Documentation/githooks: Fix linkgit
[git.git] / string-list.c
blob480173fe6dbee5428e3b135ff27ba7551c527ad8
1 #include "cache.h"
2 #include "string-list.h"
4 /* if there is no exact match, point to the index where the entry could be
5 * inserted */
6 static int get_entry_index(const struct string_list *list, const char *string,
7 int *exact_match)
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);
14 if (compare < 0)
15 right = middle;
16 else if (compare > 0)
17 left = middle;
18 else {
19 *exact_match = 1;
20 return middle;
24 *exact_match = 0;
25 return right;
28 /* returns -1-index if already exists */
29 static int add_entry(int insert_at, struct string_list *list, const char *string)
31 int exact_match = 0;
32 int index = insert_at != -1 ? insert_at : get_entry_index(list, string, &exact_match);
34 if (exact_match)
35 return -1 - index;
37 if (list->nr + 1 >= list->alloc) {
38 list->alloc += 32;
39 list->items = xrealloc(list->items, list->alloc
40 * sizeof(struct string_list_item));
42 if (index < list->nr)
43 memmove(list->items + index + 1, list->items + index,
44 (list->nr - 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;
49 list->nr++;
51 return index;
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);
64 if (index < 0)
65 index = -1 - index;
67 return list->items + index;
70 int string_list_has_string(const struct string_list *list, const char *string)
72 int exact_match;
73 get_entry_index(list, string, &exact_match);
74 return exact_match;
77 int string_list_find_insert_index(const struct string_list *list, const char *string,
78 int negative_existing_index)
80 int exact_match;
81 int index = get_entry_index(list, string, &exact_match);
82 if (exact_match)
83 index = -1 - (negative_existing_index ? index : 0);
84 return index;
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);
90 if (!exact_match)
91 return NULL;
92 return list->items + i;
95 void string_list_remove_duplicates(struct string_list *list, int free_util)
97 if (list->nr > 1) {
98 int src, dst;
99 for (src = dst = 1; src < list->nr; src++) {
100 if (!strcmp(list->items[dst - 1].string, list->items[src].string)) {
101 if (list->strdup_strings)
102 free(list->items[src].string);
103 if (free_util)
104 free(list->items[src].util);
105 } else
106 list->items[dst++] = list->items[src];
108 list->nr = dst;
112 int for_each_string_list(struct string_list *list,
113 string_list_each_func_t fn, void *cb_data)
115 int i, ret = 0;
116 for (i = 0; i < list->nr; i++)
117 if ((ret = fn(&list->items[i], cb_data)))
118 break;
119 return ret;
122 void filter_string_list(struct string_list *list, int free_util,
123 string_list_each_func_t want, void *cb_data)
125 int src, dst = 0;
126 for (src = 0; src < list->nr; src++) {
127 if (want(&list->items[src], cb_data)) {
128 list->items[dst++] = list->items[src];
129 } else {
130 if (list->strdup_strings)
131 free(list->items[src].string);
132 if (free_util)
133 free(list->items[src].util);
136 list->nr = dst;
139 static int item_is_not_empty(struct string_list_item *item, void *unused)
141 return *item->string != '\0';
144 void string_list_remove_empty_items(struct string_list *list, int free_util) {
145 filter_string_list(list, free_util, item_is_not_empty, NULL);
148 void string_list_clear(struct string_list *list, int free_util)
150 if (list->items) {
151 int i;
152 if (list->strdup_strings) {
153 for (i = 0; i < list->nr; i++)
154 free(list->items[i].string);
156 if (free_util) {
157 for (i = 0; i < list->nr; i++)
158 free(list->items[i].util);
160 free(list->items);
162 list->items = NULL;
163 list->nr = list->alloc = 0;
166 void string_list_clear_func(struct string_list *list, string_list_clear_func_t clearfunc)
168 if (list->items) {
169 int i;
170 if (clearfunc) {
171 for (i = 0; i < list->nr; i++)
172 clearfunc(list->items[i].util, list->items[i].string);
174 if (list->strdup_strings) {
175 for (i = 0; i < list->nr; i++)
176 free(list->items[i].string);
178 free(list->items);
180 list->items = NULL;
181 list->nr = list->alloc = 0;
185 void print_string_list(const struct string_list *p, const char *text)
187 int i;
188 if ( text )
189 printf("%s\n", text);
190 for (i = 0; i < p->nr; i++)
191 printf("%s:%p\n", p->items[i].string, p->items[i].util);
194 struct string_list_item *string_list_append_nodup(struct string_list *list,
195 char *string)
197 struct string_list_item *retval;
198 ALLOC_GROW(list->items, list->nr + 1, list->alloc);
199 retval = &list->items[list->nr++];
200 retval->string = string;
201 retval->util = NULL;
202 return retval;
205 struct string_list_item *string_list_append(struct string_list *list,
206 const char *string)
208 return string_list_append_nodup(
209 list,
210 list->strdup_strings ? xstrdup(string) : (char *)string);
213 static int cmp_items(const void *a, const void *b)
215 const struct string_list_item *one = a;
216 const struct string_list_item *two = b;
217 return strcmp(one->string, two->string);
220 void sort_string_list(struct string_list *list)
222 qsort(list->items, list->nr, sizeof(*list->items), cmp_items);
225 struct string_list_item *unsorted_string_list_lookup(struct string_list *list,
226 const char *string)
228 int i;
229 for (i = 0; i < list->nr; i++)
230 if (!strcmp(string, list->items[i].string))
231 return list->items + i;
232 return NULL;
235 int unsorted_string_list_has_string(struct string_list *list,
236 const char *string)
238 return unsorted_string_list_lookup(list, string) != NULL;
241 void unsorted_string_list_delete_item(struct string_list *list, int i, int free_util)
243 if (list->strdup_strings)
244 free(list->items[i].string);
245 if (free_util)
246 free(list->items[i].util);
247 list->items[i] = list->items[list->nr-1];
248 list->nr--;
251 int string_list_split(struct string_list *list, const char *string,
252 int delim, int maxsplit)
254 int count = 0;
255 const char *p = string, *end;
257 if (!list->strdup_strings)
258 die("internal error in string_list_split(): "
259 "list->strdup_strings must be set");
260 for (;;) {
261 count++;
262 if (maxsplit >= 0 && count > maxsplit) {
263 string_list_append(list, p);
264 return count;
266 end = strchr(p, delim);
267 if (end) {
268 string_list_append_nodup(list, xmemdupz(p, end - p));
269 p = end + 1;
270 } else {
271 string_list_append(list, p);
272 return count;
277 int string_list_split_in_place(struct string_list *list, char *string,
278 int delim, int maxsplit)
280 int count = 0;
281 char *p = string, *end;
283 if (list->strdup_strings)
284 die("internal error in string_list_split_in_place(): "
285 "list->strdup_strings must not be set");
286 for (;;) {
287 count++;
288 if (maxsplit >= 0 && count > maxsplit) {
289 string_list_append(list, p);
290 return count;
292 end = strchr(p, delim);
293 if (end) {
294 *end = '\0';
295 string_list_append(list, p);
296 p = end + 1;
297 } else {
298 string_list_append(list, p);
299 return count;