string_list: add function string_list_append_nodup()
[git/git.git] / string-list.c
CommitLineData
c455c87c
JS
1#include "cache.h"
2#include "string-list.h"
3
4/* if there is no exact match, point to the index where the entry could be
5 * inserted */
6static int get_entry_index(const struct string_list *list, const char *string,
7 int *exact_match)
8{
9 int left = -1, right = list->nr;
10
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;
21 }
22 }
23
24 *exact_match = 0;
25 return right;
26}
27
28/* returns -1-index if already exists */
cfa1ee6b 29static int add_entry(int insert_at, struct string_list *list, const char *string)
c455c87c 30{
cfa1ee6b
MSO
31 int exact_match = 0;
32 int index = insert_at != -1 ? insert_at : get_entry_index(list, string, &exact_match);
c455c87c
JS
33
34 if (exact_match)
35 return -1 - index;
36
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));
41 }
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++;
50
51 return index;
52}
53
78a395d3 54struct string_list_item *string_list_insert(struct string_list *list, const char *string)
c455c87c 55{
aadceea6 56 return string_list_insert_at_index(list, -1, string);
cfa1ee6b
MSO
57}
58
aadceea6
JP
59struct string_list_item *string_list_insert_at_index(struct string_list *list,
60 int insert_at, const char *string)
cfa1ee6b
MSO
61{
62 int index = add_entry(insert_at, list, string);
c455c87c
JS
63
64 if (index < 0)
65 index = -1 - index;
66
67 return list->items + index;
68}
69
70int string_list_has_string(const struct string_list *list, const char *string)
71{
72 int exact_match;
73 get_entry_index(list, string, &exact_match);
74 return exact_match;
75}
76
cfa1ee6b
MSO
77int string_list_find_insert_index(const struct string_list *list, const char *string,
78 int negative_existing_index)
79{
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;
85}
86
e8c8b713 87struct string_list_item *string_list_lookup(struct string_list *list, const char *string)
c455c87c
JS
88{
89 int exact_match, i = get_entry_index(list, string, &exact_match);
90 if (!exact_match)
91 return NULL;
92 return list->items + i;
93}
94
b684e977
JP
95int for_each_string_list(struct string_list *list,
96 string_list_each_func_t fn, void *cb_data)
c6f5a7a9
JS
97{
98 int i, ret = 0;
99 for (i = 0; i < list->nr; i++)
100 if ((ret = fn(&list->items[i], cb_data)))
101 break;
102 return ret;
103}
104
c455c87c
JS
105void string_list_clear(struct string_list *list, int free_util)
106{
107 if (list->items) {
108 int i;
109 if (list->strdup_strings) {
110 for (i = 0; i < list->nr; i++)
111 free(list->items[i].string);
112 }
113 if (free_util) {
114 for (i = 0; i < list->nr; i++)
115 free(list->items[i].util);
116 }
117 free(list->items);
118 }
119 list->items = NULL;
120 list->nr = list->alloc = 0;
121}
122
cfa1ee6b
MSO
123void string_list_clear_func(struct string_list *list, string_list_clear_func_t clearfunc)
124{
125 if (list->items) {
126 int i;
127 if (clearfunc) {
128 for (i = 0; i < list->nr; i++)
129 clearfunc(list->items[i].util, list->items[i].string);
130 }
131 if (list->strdup_strings) {
132 for (i = 0; i < list->nr; i++)
133 free(list->items[i].string);
134 }
135 free(list->items);
136 }
137 list->items = NULL;
138 list->nr = list->alloc = 0;
139}
140
141
cb944f6b 142void print_string_list(const struct string_list *p, const char *text)
c455c87c
JS
143{
144 int i;
145 if ( text )
146 printf("%s\n", text);
147 for (i = 0; i < p->nr; i++)
148 printf("%s:%p\n", p->items[i].string, p->items[i].util);
149}
150
e448fed8
MH
151struct string_list_item *string_list_append_nodup(struct string_list *list,
152 char *string)
c455c87c 153{
e448fed8 154 struct string_list_item *retval;
c455c87c 155 ALLOC_GROW(list->items, list->nr + 1, list->alloc);
e448fed8
MH
156 retval = &list->items[list->nr++];
157 retval->string = string;
158 retval->util = NULL;
159 return retval;
160}
161
162struct string_list_item *string_list_append(struct string_list *list,
163 const char *string)
164{
165 return string_list_append_nodup(
166 list,
167 list->strdup_strings ? xstrdup(string) : (char *)string);
c455c87c
JS
168}
169
170static int cmp_items(const void *a, const void *b)
171{
172 const struct string_list_item *one = a;
173 const struct string_list_item *two = b;
174 return strcmp(one->string, two->string);
175}
176
177void sort_string_list(struct string_list *list)
178{
179 qsort(list->items, list->nr, sizeof(*list->items), cmp_items);
180}
181
e2421480
SB
182struct string_list_item *unsorted_string_list_lookup(struct string_list *list,
183 const char *string)
c455c87c
JS
184{
185 int i;
186 for (i = 0; i < list->nr; i++)
187 if (!strcmp(string, list->items[i].string))
e2421480
SB
188 return list->items + i;
189 return NULL;
190}
191
192int unsorted_string_list_has_string(struct string_list *list,
193 const char *string)
194{
195 return unsorted_string_list_lookup(list, string) != NULL;
c455c87c
JS
196}
197
86d4b528
JS
198void unsorted_string_list_delete_item(struct string_list *list, int i, int free_util)
199{
200 if (list->strdup_strings)
201 free(list->items[i].string);
202 if (free_util)
203 free(list->items[i].util);
204 list->items[i] = list->items[list->nr-1];
205 list->nr--;
206}