string-list.c

   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(int insert_at, struct string_list *list, const char *string)
  30 {
  31         int exact_match = 0;
  32         int index = insert_at != -1 ? insert_at : 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(struct string_list *list, const char *string)
  55 {
  56         return string_list_insert_at_index(list, -1, string);
  57 }
  58
  59 struct string_list_item *string_list_insert_at_index(struct string_list *list,
  60                                                      int insert_at, const char *string)
  61 {
  62         int index = add_entry(insert_at, list, string);
  63
  64         if (index < 0)
  65                 index = -1 - index;
  66
  67         return list->items + index;
  68 }
  69
  70 int 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
  77 int 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
  87 struct string_list_item *string_list_lookup(struct string_list *list, const char *string)
  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
  95 void string_list_remove_duplicates(struct string_list *list, int free_util)
  96 {
  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];
 107                 }
 108                 list->nr = dst;
 109         }
 110 }
 111
 112 int for_each_string_list(struct string_list *list,
 113                          string_list_each_func_t fn, void *cb_data)
 114 {
 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;
 120 }
 121
 122 void filter_string_list(struct string_list *list, int free_util,
 123                         string_list_each_func_t want, void *cb_data)
 124 {
 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);
 134                 }
 135         }
 136         list->nr = dst;
 137 }
 138
 139 static int item_is_not_empty(struct string_list_item *item, void *unused)
 140 {
 141         return *item->string != '\0';
 142 }
 143
 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);
 146 }
 147
 148 char *string_list_longest_prefix(const struct string_list *prefixes,
 149                                  const char *string)
 150 {
 151         int i, max_len = -1;
 152         char *retval = NULL;
 153
 154         for (i = 0; i < prefixes->nr; i++) {
 155                 char *prefix = prefixes->items[i].string;
 156                 if (!prefixcmp(string, prefix)) {
 157                         int len = strlen(prefix);
 158                         if (len > max_len) {
 159                                 retval = prefix;
 160                                 max_len = len;
 161                         }
 162                 }
 163         }
 164
 165         return retval;
 166 }
 167
 168 void string_list_clear(struct string_list *list, int free_util)
 169 {
 170         if (list->items) {
 171                 int i;
 172                 if (list->strdup_strings) {
 173                         for (i = 0; i < list->nr; i++)
 174                                 free(list->items[i].string);
 175                 }
 176                 if (free_util) {
 177                         for (i = 0; i < list->nr; i++)
 178                                 free(list->items[i].util);
 179                 }
 180                 free(list->items);
 181         }
 182         list->items = NULL;
 183         list->nr = list->alloc = 0;
 184 }
 185
 186 void string_list_clear_func(struct string_list *list, string_list_clear_func_t clearfunc)
 187 {
 188         if (list->items) {
 189                 int i;
 190                 if (clearfunc) {
 191                         for (i = 0; i < list->nr; i++)
 192                                 clearfunc(list->items[i].util, list->items[i].string);
 193                 }
 194                 if (list->strdup_strings) {
 195                         for (i = 0; i < list->nr; i++)
 196                                 free(list->items[i].string);
 197                 }
 198                 free(list->items);
 199         }
 200         list->items = NULL;
 201         list->nr = list->alloc = 0;
 202 }
 203
 204
 205 void print_string_list(const struct string_list *p, const char *text)
 206 {
 207         int i;
 208         if ( text )
 209                 printf("%s\n", text);
 210         for (i = 0; i < p->nr; i++)
 211                 printf("%s:%p\n", p->items[i].string, p->items[i].util);
 212 }
 213
 214 struct string_list_item *string_list_append_nodup(struct string_list *list,
 215                                                   char *string)
 216 {
 217         struct string_list_item *retval;
 218         ALLOC_GROW(list->items, list->nr + 1, list->alloc);
 219         retval = &list->items[list->nr++];
 220         retval->string = string;
 221         retval->util = NULL;
 222         return retval;
 223 }
 224
 225 struct string_list_item *string_list_append(struct string_list *list,
 226                                             const char *string)
 227 {
 228         return string_list_append_nodup(
 229                         list,
 230                         list->strdup_strings ? xstrdup(string) : (char *)string);
 231 }
 232
 233 static int cmp_items(const void *a, const void *b)
 234 {
 235         const struct string_list_item *one = a;
 236         const struct string_list_item *two = b;
 237         return strcmp(one->string, two->string);
 238 }
 239
 240 void sort_string_list(struct string_list *list)
 241 {
 242         qsort(list->items, list->nr, sizeof(*list->items), cmp_items);
 243 }
 244
 245 struct string_list_item *unsorted_string_list_lookup(struct string_list *list,
 246                                                      const char *string)
 247 {
 248         int i;
 249         for (i = 0; i < list->nr; i++)
 250                 if (!strcmp(string, list->items[i].string))
 251                         return list->items + i;
 252         return NULL;
 253 }
 254
 255 int unsorted_string_list_has_string(struct string_list *list,
 256                                     const char *string)
 257 {
 258         return unsorted_string_list_lookup(list, string) != NULL;
 259 }
 260
 261 void unsorted_string_list_delete_item(struct string_list *list, int i, int free_util)
 262 {
 263         if (list->strdup_strings)
 264                 free(list->items[i].string);
 265         if (free_util)
 266                 free(list->items[i].util);
 267         list->items[i] = list->items[list->nr-1];
 268         list->nr--;
 269 }
 270
 271 int string_list_split(struct string_list *list, const char *string,
 272                       int delim, int maxsplit)
 273 {
 274         int count = 0;
 275         const char *p = string, *end;
 276
 277         if (!list->strdup_strings)
 278                 die("internal error in string_list_split(): "
 279                     "list->strdup_strings must be set");
 280         for (;;) {
 281                 count++;
 282                 if (maxsplit >= 0 && count > maxsplit) {
 283                         string_list_append(list, p);
 284                         return count;
 285                 }
 286                 end = strchr(p, delim);
 287                 if (end) {
 288                         string_list_append_nodup(list, xmemdupz(p, end - p));
 289                         p = end + 1;
 290                 } else {
 291                         string_list_append(list, p);
 292                         return count;
 293                 }
 294         }
 295 }
 296
 297 int string_list_split_in_place(struct string_list *list, char *string,
 298                                int delim, int maxsplit)
 299 {
 300         int count = 0;
 301         char *p = string, *end;
 302
 303         if (list->strdup_strings)
 304                 die("internal error in string_list_split_in_place(): "
 305                     "list->strdup_strings must not be set");
 306         for (;;) {
 307                 count++;
 308                 if (maxsplit >= 0 && count > maxsplit) {
 309                         string_list_append(list, p);
 310                         return count;
 311                 }
 312                 end = strchr(p, delim);
 313                 if (end) {
 314                         *end = '\0';
 315                         string_list_append(list, p);
 316                         p = end + 1;
 317                 } else {
 318                         string_list_append(list, p);
 319                         return count;
 320                 }
 321         }
 322 }