2 #include "string-list.h"
4 /* if there is no exact match, point to the index where the entry could be
6 static int get_entry_index(const struct string_list *list, const char *string,
9 int left = -1, right = list->nr;
11 while (left + 1 < right) {
12 int middle = (left + right) / 2;
13 int compare = strcmp(string, list->items[middle].string);
28 /* returns -1-index if already exists */
29 static int add_entry(int insert_at, struct string_list *list, const char *string)
32 int index = insert_at != -1 ? insert_at : get_entry_index(list, string, &exact_match);
37 if (list->nr + 1 >= list->alloc) {
39 list->items = xrealloc(list->items, list->alloc
40 * sizeof(struct string_list_item));
43 memmove(list->items + index + 1, list->items + index,
45 * sizeof(struct string_list_item));
46 list->items[index].string = list->strdup_strings ?
47 xstrdup(string) : (char *)string;
48 list->items[index].util = NULL;
54 struct string_list_item *string_list_insert(struct string_list *list, const char *string)
56 return string_list_insert_at_index(list, -1, string);
59 struct string_list_item *string_list_insert_at_index(struct string_list *list,
60 int insert_at, const char *string)
62 int index = add_entry(insert_at, list, string);
67 return list->items + index;
70 int string_list_has_string(const struct string_list *list, const char *string)
73 get_entry_index(list, string, &exact_match);
77 int string_list_find_insert_index(const struct string_list *list, const char *string,
78 int negative_existing_index)
81 int index = get_entry_index(list, string, &exact_match);
83 index = -1 - (negative_existing_index ? index : 0);
87 struct string_list_item *string_list_lookup(struct string_list *list, const char *string)
89 int exact_match, i = get_entry_index(list, string, &exact_match);
92 return list->items + i;
95 int for_each_string_list(struct string_list *list,
96 string_list_each_func_t fn, void *cb_data)
99 for (i = 0; i < list->nr; i++)
100 if ((ret = fn(&list->items[i], cb_data)))
105 void filter_string_list(struct string_list *list, int free_util,
106 string_list_each_func_t want, void *cb_data)
109 for (src = 0; src < list->nr; src++) {
110 if (want(&list->items[src], cb_data)) {
111 list->items[dst++] = list->items[src];
113 if (list->strdup_strings)
114 free(list->items[src].string);
116 free(list->items[src].util);
122 void string_list_clear(struct string_list *list, int free_util)
126 if (list->strdup_strings) {
127 for (i = 0; i < list->nr; i++)
128 free(list->items[i].string);
131 for (i = 0; i < list->nr; i++)
132 free(list->items[i].util);
137 list->nr = list->alloc = 0;
140 void string_list_clear_func(struct string_list *list, string_list_clear_func_t clearfunc)
145 for (i = 0; i < list->nr; i++)
146 clearfunc(list->items[i].util, list->items[i].string);
148 if (list->strdup_strings) {
149 for (i = 0; i < list->nr; i++)
150 free(list->items[i].string);
155 list->nr = list->alloc = 0;
159 void print_string_list(const struct string_list *p, const char *text)
163 printf("%s\n", text);
164 for (i = 0; i < p->nr; i++)
165 printf("%s:%p\n", p->items[i].string, p->items[i].util);
168 struct string_list_item *string_list_append_nodup(struct string_list *list,
171 struct string_list_item *retval;
172 ALLOC_GROW(list->items, list->nr + 1, list->alloc);
173 retval = &list->items[list->nr++];
174 retval->string = string;
179 struct string_list_item *string_list_append(struct string_list *list,
182 return string_list_append_nodup(
184 list->strdup_strings ? xstrdup(string) : (char *)string);
187 static int cmp_items(const void *a, const void *b)
189 const struct string_list_item *one = a;
190 const struct string_list_item *two = b;
191 return strcmp(one->string, two->string);
194 void sort_string_list(struct string_list *list)
196 qsort(list->items, list->nr, sizeof(*list->items), cmp_items);
199 struct string_list_item *unsorted_string_list_lookup(struct string_list *list,
203 for (i = 0; i < list->nr; i++)
204 if (!strcmp(string, list->items[i].string))
205 return list->items + i;
209 int unsorted_string_list_has_string(struct string_list *list,
212 return unsorted_string_list_lookup(list, string) != NULL;
215 void unsorted_string_list_delete_item(struct string_list *list, int i, int free_util)
217 if (list->strdup_strings)
218 free(list->items[i].string);
220 free(list->items[i].util);
221 list->items[i] = list->items[list->nr-1];
225 int string_list_split(struct string_list *list, const char *string,
226 int delim, int maxsplit)
229 const char *p = string, *end;
231 if (!list->strdup_strings)
232 die("internal error in string_list_split(): "
233 "list->strdup_strings must be set");
236 if (maxsplit >= 0 && count > maxsplit) {
237 string_list_append(list, p);
240 end = strchr(p, delim);
242 string_list_append_nodup(list, xmemdupz(p, end - p));
245 string_list_append(list, p);
251 int string_list_split_in_place(struct string_list *list, char *string,
252 int delim, int maxsplit)
255 char *p = string, *end;
257 if (list->strdup_strings)
258 die("internal error in string_list_split_in_place(): "
259 "list->strdup_strings must not be set");
262 if (maxsplit >= 0 && count > maxsplit) {
263 string_list_append(list, p);
266 end = strchr(p, delim);
269 string_list_append(list, p);
272 string_list_append(list, p);