Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 1 | /* stringvec.c - functions for managing arrays of strings. */ |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 2 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 3 | /* Copyright (C) 2000-2002 Free Software Foundation, Inc. |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 4 | |
| 5 | This file is part of GNU Bash, the Bourne Again SHell. |
| 6 | |
Jari Aalto | 3185942 | 2009-01-12 13:36:28 +0000 | [diff] [blame] | 7 | Bash is free software: you can redistribute it and/or modify |
| 8 | it under the terms of the GNU General Public License as published by |
| 9 | the Free Software Foundation, either version 3 of the License, or |
| 10 | (at your option) any later version. |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 11 | |
Jari Aalto | 3185942 | 2009-01-12 13:36:28 +0000 | [diff] [blame] | 12 | Bash is distributed in the hope that it will be useful, |
| 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 15 | GNU General Public License for more details. |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 16 | |
Jari Aalto | 3185942 | 2009-01-12 13:36:28 +0000 | [diff] [blame] | 17 | You should have received a copy of the GNU General Public License |
| 18 | along with Bash. If not, see <http://www.gnu.org/licenses/>. |
| 19 | */ |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 20 | |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 21 | #include <config.h> |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 22 | |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 23 | #include <bashtypes.h> |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 24 | |
| 25 | #if defined (HAVE_UNISTD_H) |
| 26 | # include <unistd.h> |
| 27 | #endif |
| 28 | |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 29 | #include <bashansi.h> |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 30 | #include <stdio.h> |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 31 | #include <chartypes.h> |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 32 | |
| 33 | #include "shell.h" |
| 34 | |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 35 | /* Allocate an array of strings with room for N members. */ |
| 36 | char ** |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 37 | strvec_create (n) |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 38 | int n; |
| 39 | { |
| 40 | return ((char **)xmalloc ((n) * sizeof (char *))); |
| 41 | } |
| 42 | |
Chet Ramey | ac50fba | 2014-02-26 09:36:43 -0500 | [diff] [blame] | 43 | /* Allocate an array of strings with room for N members. */ |
| 44 | char ** |
| 45 | strvec_mcreate (n) |
| 46 | int n; |
| 47 | { |
| 48 | return ((char **)malloc ((n) * sizeof (char *))); |
| 49 | } |
| 50 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 51 | char ** |
| 52 | strvec_resize (array, nsize) |
| 53 | char **array; |
| 54 | int nsize; |
| 55 | { |
| 56 | return ((char **)xrealloc (array, nsize * sizeof (char *))); |
| 57 | } |
| 58 | |
Chet Ramey | ac50fba | 2014-02-26 09:36:43 -0500 | [diff] [blame] | 59 | char ** |
| 60 | strvec_mresize (array, nsize) |
| 61 | char **array; |
| 62 | int nsize; |
| 63 | { |
| 64 | return ((char **)realloc (array, nsize * sizeof (char *))); |
| 65 | } |
| 66 | |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 67 | /* Return the length of ARRAY, a NULL terminated array of char *. */ |
| 68 | int |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 69 | strvec_len (array) |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 70 | char **array; |
| 71 | { |
| 72 | register int i; |
| 73 | |
| 74 | for (i = 0; array[i]; i++); |
| 75 | return (i); |
| 76 | } |
| 77 | |
| 78 | /* Free the contents of ARRAY, a NULL terminated array of char *. */ |
| 79 | void |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 80 | strvec_flush (array) |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 81 | char **array; |
| 82 | { |
| 83 | register int i; |
| 84 | |
| 85 | if (array == 0) |
| 86 | return; |
| 87 | |
| 88 | for (i = 0; array[i]; i++) |
| 89 | free (array[i]); |
| 90 | } |
| 91 | |
| 92 | void |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 93 | strvec_dispose (array) |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 94 | char **array; |
| 95 | { |
| 96 | if (array == 0) |
| 97 | return; |
| 98 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 99 | strvec_flush (array); |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 100 | free (array); |
| 101 | } |
| 102 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 103 | int |
| 104 | strvec_remove (array, name) |
| 105 | char **array, *name; |
| 106 | { |
| 107 | register int i, j; |
| 108 | char *x; |
| 109 | |
| 110 | if (array == 0) |
| 111 | return 0; |
| 112 | |
| 113 | for (i = 0; array[i]; i++) |
| 114 | if (STREQ (name, array[i])) |
| 115 | { |
| 116 | x = array[i]; |
| 117 | for (j = i; array[j]; j++) |
| 118 | array[j] = array[j + 1]; |
| 119 | free (x); |
| 120 | return 1; |
| 121 | } |
| 122 | return 0; |
| 123 | } |
| 124 | |
| 125 | #ifdef INCLUDE_UNUSED |
| 126 | /* Find NAME in ARRAY. Return the index of NAME, or -1 if not present. |
| 127 | ARRAY should be NULL terminated. */ |
| 128 | int |
| 129 | strvec_search (array, name) |
| 130 | char **array, *name; |
| 131 | { |
| 132 | int i; |
| 133 | |
| 134 | for (i = 0; array[i]; i++) |
| 135 | if (STREQ (name, array[i])) |
| 136 | return (i); |
| 137 | |
| 138 | return (-1); |
| 139 | } |
| 140 | #endif |
| 141 | |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 142 | /* Allocate and return a new copy of ARRAY and its contents. */ |
| 143 | char ** |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 144 | strvec_copy (array) |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 145 | char **array; |
| 146 | { |
| 147 | register int i; |
| 148 | int len; |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 149 | char **ret; |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 150 | |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 151 | len = strvec_len (array); |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 152 | |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 153 | ret = (char **)xmalloc ((len + 1) * sizeof (char *)); |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 154 | for (i = 0; array[i]; i++) |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 155 | ret[i] = savestring (array[i]); |
| 156 | ret[i] = (char *)NULL; |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 157 | |
Jari Aalto | f73dda0 | 2001-11-13 17:56:06 +0000 | [diff] [blame] | 158 | return (ret); |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 159 | } |
| 160 | |
| 161 | /* Comparison routine for use with qsort() on arrays of strings. Uses |
| 162 | strcoll(3) if available, otherwise it uses strcmp(3). */ |
| 163 | int |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 164 | strvec_strcmp (s1, s2) |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 165 | register char **s1, **s2; |
| 166 | { |
| 167 | #if defined (HAVE_STRCOLL) |
| 168 | return (strcoll (*s1, *s2)); |
| 169 | #else /* !HAVE_STRCOLL */ |
| 170 | int result; |
| 171 | |
| 172 | if ((result = **s1 - **s2) == 0) |
| 173 | result = strcmp (*s1, *s2); |
| 174 | |
| 175 | return (result); |
| 176 | #endif /* !HAVE_STRCOLL */ |
| 177 | } |
| 178 | |
| 179 | /* Sort ARRAY, a null terminated array of pointers to strings. */ |
| 180 | void |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 181 | strvec_sort (array) |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 182 | char **array; |
| 183 | { |
Jari Aalto | 7117c2d | 2002-07-17 14:10:11 +0000 | [diff] [blame] | 184 | qsort (array, strvec_len (array), sizeof (char *), (QSFUNC *)strvec_strcmp); |
| 185 | } |
| 186 | |
| 187 | /* Cons up a new array of words. The words are taken from LIST, |
| 188 | which is a WORD_LIST *. If ALLOC is true, everything is malloc'ed, |
| 189 | so you should free everything in this array when you are done. |
| 190 | The array is NULL terminated. If IP is non-null, it gets the |
| 191 | number of words in the returned array. STARTING_INDEX says where |
| 192 | to start filling in the returned array; it can be used to reserve |
| 193 | space at the beginning of the array. */ |
| 194 | |
| 195 | char ** |
| 196 | strvec_from_word_list (list, alloc, starting_index, ip) |
| 197 | WORD_LIST *list; |
| 198 | int alloc, starting_index, *ip; |
| 199 | { |
| 200 | int count; |
| 201 | char **array; |
| 202 | |
| 203 | count = list_length (list); |
| 204 | array = (char **)xmalloc ((1 + count + starting_index) * sizeof (char *)); |
| 205 | |
| 206 | for (count = 0; count < starting_index; count++) |
| 207 | array[count] = (char *)NULL; |
| 208 | for (count = starting_index; list; count++, list = list->next) |
| 209 | array[count] = alloc ? savestring (list->word->word) : list->word->word; |
| 210 | array[count] = (char *)NULL; |
| 211 | |
| 212 | if (ip) |
| 213 | *ip = count; |
| 214 | return (array); |
| 215 | } |
| 216 | |
| 217 | /* Convert an array of strings into the form used internally by the shell. |
| 218 | ALLOC means to allocate new storage for each WORD_DESC in the returned |
| 219 | list rather than copy the values in ARRAY. STARTING_INDEX says where |
| 220 | in ARRAY to begin. */ |
| 221 | |
| 222 | WORD_LIST * |
| 223 | strvec_to_word_list (array, alloc, starting_index) |
| 224 | char **array; |
| 225 | int alloc, starting_index; |
| 226 | { |
| 227 | WORD_LIST *list; |
| 228 | WORD_DESC *w; |
| 229 | int i, count; |
| 230 | |
| 231 | if (array == 0 || array[0] == 0) |
| 232 | return (WORD_LIST *)NULL; |
| 233 | |
| 234 | for (count = 0; array[count]; count++) |
| 235 | ; |
| 236 | |
| 237 | for (i = starting_index, list = (WORD_LIST *)NULL; i < count; i++) |
| 238 | { |
| 239 | w = make_bare_word (alloc ? array[i] : ""); |
| 240 | if (alloc == 0) |
| 241 | { |
| 242 | free (w->word); |
| 243 | w->word = array[i]; |
| 244 | } |
| 245 | list = make_word_list (w, list); |
| 246 | } |
| 247 | return (REVERSE_LIST (list, WORD_LIST *)); |
Jari Aalto | 28ef6c3 | 2001-04-06 19:14:31 +0000 | [diff] [blame] | 248 | } |