1 /* stringvec.c - functions for managing arrays of strings. */
3 /* Copyright (C) 2000-2002 Free Software Foundation, Inc.
5 This file is part of GNU Bash, the Bourne Again SHell.
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.
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.
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/>.
23 #include <bashtypes.h>
25 #if defined (HAVE_UNISTD_H)
31 #include <chartypes.h>
35 /* Allocate an array of strings with room for N members. */
40 return ((char **)xmalloc ((n) * sizeof (char *)));
43 /* Allocate an array of strings with room for N members. */
48 return ((char **)malloc ((n) * sizeof (char *)));
52 strvec_resize (array, nsize)
56 return ((char **)xrealloc (array, nsize * sizeof (char *)));
60 strvec_mresize (array, nsize)
64 return ((char **)realloc (array, nsize * sizeof (char *)));
67 /* Return the length of ARRAY, a NULL terminated array of char *. */
74 for (i = 0; array[i]; i++);
78 /* Free the contents of ARRAY, a NULL terminated array of char *. */
88 for (i = 0; array[i]; i++)
93 strvec_dispose (array)
104 strvec_remove (array, name)
113 for (i = 0; array[i]; i++)
114 if (STREQ (name, array[i]))
117 for (j = i; array[j]; j++)
118 array[j] = array[j + 1];
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. */
129 strvec_search (array, name)
134 for (i = 0; array[i]; i++)
135 if (STREQ (name, array[i]))
142 /* Allocate and return a new copy of ARRAY and its contents. */
151 len = strvec_len (array);
153 ret = (char **)xmalloc ((len + 1) * sizeof (char *));
154 for (i = 0; array[i]; i++)
155 ret[i] = savestring (array[i]);
156 ret[i] = (char *)NULL;
161 /* Comparison routine for use with qsort() on arrays of strings. Uses
162 strcoll(3) if available, otherwise it uses strcmp(3). */
164 strvec_strcmp (s1, s2)
165 register char **s1, **s2;
167 #if defined (HAVE_STRCOLL)
168 return (strcoll (*s1, *s2));
169 #else /* !HAVE_STRCOLL */
172 if ((result = **s1 - **s2) == 0)
173 result = strcmp (*s1, *s2);
176 #endif /* !HAVE_STRCOLL */
179 /* Sort ARRAY, a null terminated array of pointers to strings. */
184 qsort (array, strvec_len (array), sizeof (char *), (QSFUNC *)strvec_strcmp);
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. */
196 strvec_from_word_list (list, alloc, starting_index, ip)
198 int alloc, starting_index, *ip;
203 count = list_length (list);
204 array = (char **)xmalloc ((1 + count + starting_index) * sizeof (char *));
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;
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. */
223 strvec_to_word_list (array, alloc, starting_index)
225 int alloc, starting_index;
231 if (array == 0 || array[0] == 0)
232 return (WORD_LIST *)NULL;
234 for (count = 0; array[count]; count++)
237 for (i = starting_index, list = (WORD_LIST *)NULL; i < count; i++)
239 w = make_bare_word (alloc ? array[i] : "");
245 list = make_word_list (w, list);
247 return (REVERSE_LIST (list, WORD_LIST *));