]>
Commit | Line | Data |
---|---|---|
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 */ | |
6 | static 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 */ | |
29 | static int add_entry(struct string_list *list, const char *string) | |
30 | { | |
31 | int exact_match; | |
32 | int index = get_entry_index(list, string, &exact_match); | |
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 | ||
54 | struct string_list_item *string_list_insert(const char *string, struct string_list *list) | |
55 | { | |
56 | int index = add_entry(list, string); | |
57 | ||
58 | if (index < 0) | |
59 | index = -1 - index; | |
60 | ||
61 | return list->items + index; | |
62 | } | |
63 | ||
64 | int string_list_has_string(const struct string_list *list, const char *string) | |
65 | { | |
66 | int exact_match; | |
67 | get_entry_index(list, string, &exact_match); | |
68 | return exact_match; | |
69 | } | |
70 | ||
71 | struct string_list_item *string_list_lookup(const char *string, struct string_list *list) | |
72 | { | |
73 | int exact_match, i = get_entry_index(list, string, &exact_match); | |
74 | if (!exact_match) | |
75 | return NULL; | |
76 | return list->items + i; | |
77 | } | |
78 | ||
79 | void string_list_clear(struct string_list *list, int free_util) | |
80 | { | |
81 | if (list->items) { | |
82 | int i; | |
83 | if (list->strdup_strings) { | |
84 | for (i = 0; i < list->nr; i++) | |
85 | free(list->items[i].string); | |
86 | } | |
87 | if (free_util) { | |
88 | for (i = 0; i < list->nr; i++) | |
89 | free(list->items[i].util); | |
90 | } | |
91 | free(list->items); | |
92 | } | |
93 | list->items = NULL; | |
94 | list->nr = list->alloc = 0; | |
95 | } | |
96 | ||
97 | void print_string_list(const char *text, const struct string_list *p) | |
98 | { | |
99 | int i; | |
100 | if ( text ) | |
101 | printf("%s\n", text); | |
102 | for (i = 0; i < p->nr; i++) | |
103 | printf("%s:%p\n", p->items[i].string, p->items[i].util); | |
104 | } | |
105 | ||
106 | struct string_list_item *string_list_append(const char *string, struct string_list *list) | |
107 | { | |
108 | ALLOC_GROW(list->items, list->nr + 1, list->alloc); | |
109 | list->items[list->nr].string = | |
110 | list->strdup_strings ? xstrdup(string) : (char *)string; | |
111 | return list->items + list->nr++; | |
112 | } | |
113 | ||
114 | static int cmp_items(const void *a, const void *b) | |
115 | { | |
116 | const struct string_list_item *one = a; | |
117 | const struct string_list_item *two = b; | |
118 | return strcmp(one->string, two->string); | |
119 | } | |
120 | ||
121 | void sort_string_list(struct string_list *list) | |
122 | { | |
123 | qsort(list->items, list->nr, sizeof(*list->items), cmp_items); | |
124 | } | |
125 | ||
126 | int unsorted_string_list_has_string(struct string_list *list, const char *string) | |
127 | { | |
128 | int i; | |
129 | for (i = 0; i < list->nr; i++) | |
130 | if (!strcmp(string, list->items[i].string)) | |
131 | return 1; | |
132 | return 0; | |
133 | } | |
134 |