string-list.c

   1 #include "cache.h"
   2 #include "string-list.h"
   3
   4 void string_list_init_nodup(struct string_list *list)
   5 {
   6         struct string_list blank = STRING_LIST_INIT_NODUP;
   7         memcpy(list, &blank, sizeof(*list));
   8 }
   9
  10 void string_list_init_dup(struct string_list *list)
  11 {
  12         struct string_list blank = STRING_LIST_INIT_DUP;
  13         memcpy(list, &blank, sizeof(*list));
  14 }
  15
  16 /* if there is no exact match, point to the index where the entry could be
  17  * inserted */
  18 static int get_entry_index(const struct string_list *list, const char *string,
  19                 int *exact_match)
  20 {
  21         int left = -1, right = list->nr;
  22         compare_strings_fn cmp = list->cmp ? list->cmp : strcmp;
  23
  24         while (left + 1 < right) {
  25                 int middle = left + (right - left) / 2;
  26                 int compare = cmp(string, list->items[middle].string);
  27                 if (compare < 0)
  28                         right = middle;
  29                 else if (compare > 0)
  30                         left = middle;
  31                 else {
  32                         *exact_match = 1;
  33                         return middle;
  34                 }
  35         }
  36
  37         *exact_match = 0;
  38         return right;
  39 }
  40
  41 /* returns -1-index if already exists */
  42 static int add_entry(int insert_at, struct string_list *list, const char *string)
  43 {
  44         int exact_match = 0;
  45         int index = insert_at != -1 ? insert_at : get_entry_index(list, string, &exact_match);
  46
  47         if (exact_match)
  48                 return -1 - index;
  49
  50         ALLOC_GROW(list->items, list->nr+1, list->alloc);
  51         if (index < list->nr)
  52                 MOVE_ARRAY(list->items + index + 1, list->items + index,
  53                            list->nr - index);
  54         list->items[index].string = list->strdup_strings ?
  55                 xstrdup(string) : (char *)string;
  56         list->items[index].util = NULL;
  57         list->nr++;
  58
  59         return index;
  60 }
  61
  62 struct string_list_item *string_list_insert(struct string_list *list, const char *string)
  63 {
  64         int index = add_entry(-1, list, string);
  65
  66         if (index < 0)
  67                 index = -1 - index;
  68
  69         return list->items + index;
  70 }
  71
  72 void string_list_remove(struct string_list *list, const char *string,
  73                         int free_util)
  74 {
  75         int exact_match;
  76         int i = get_entry_index(list, string, &exact_match);
  77
  78         if (exact_match) {
  79                 if (list->strdup_strings)
  80                         free(list->items[i].string);
  81                 if (free_util)
  82                         free(list->items[i].util);
  83
  84                 list->nr--;
  85                 MOVE_ARRAY(list->items + i, list->items + i + 1, list->nr - i);
  86         }
  87 }
  88
  89 int string_list_has_string(const struct string_list *list, const char *string)
  90 {
  91         int exact_match;
  92         get_entry_index(list, string, &exact_match);
  93         return exact_match;
  94 }
  95
  96 int string_list_find_insert_index(const struct string_list *list, const char *string,
  97                                   int negative_existing_index)
  98 {
  99         int exact_match;
 100         int index = get_entry_index(list, string, &exact_match);
 101         if (exact_match)
 102                 index = -1 - (negative_existing_index ? index : 0);
 103         return index;
 104 }
 105
 106 struct string_list_item *string_list_lookup(struct string_list *list, const char *string)
 107 {
 108         int exact_match, i = get_entry_index(list, string, &exact_match);
 109         if (!exact_match)
 110                 return NULL;
 111         return list->items + i;
 112 }
 113
 114 void string_list_remove_duplicates(struct string_list *list, int free_util)
 115 {
 116         if (list->nr > 1) {
 117                 int src, dst;
 118                 compare_strings_fn cmp = list->cmp ? list->cmp : strcmp;
 119                 for (src = dst = 1; src < list->nr; src++) {
 120                         if (!cmp(list->items[dst - 1].string, list->items[src].string)) {
 121                                 if (list->strdup_strings)
 122                                         free(list->items[src].string);
 123                                 if (free_util)
 124                                         free(list->items[src].util);
 125                         } else
 126                                 list->items[dst++] = list->items[src];
 127                 }
 128                 list->nr = dst;
 129         }
 130 }
 131
 132 int for_each_string_list(struct string_list *list,
 133                          string_list_each_func_t fn, void *cb_data)
 134 {
 135         int i, ret = 0;
 136         for (i = 0; i < list->nr; i++)
 137                 if ((ret = fn(&list->items[i], cb_data)))
 138                         break;
 139         return ret;
 140 }
 141
 142 void filter_string_list(struct string_list *list, int free_util,
 143                         string_list_each_func_t want, void *cb_data)
 144 {
 145         int src, dst = 0;
 146         for (src = 0; src < list->nr; src++) {
 147                 if (want(&list->items[src], cb_data)) {
 148                         list->items[dst++] = list->items[src];
 149                 } else {
 150                         if (list->strdup_strings)
 151                                 free(list->items[src].string);
 152                         if (free_util)
 153                                 free(list->items[src].util);
 154                 }
 155         }
 156         list->nr = dst;
 157 }
 158
 159 static int item_is_not_empty(struct string_list_item *item, void *data UNUSED)
 160 {
 161         return *item->string != '\0';
 162 }
 163
 164 void string_list_remove_empty_items(struct string_list *list, int free_util)
 165 {
 166         filter_string_list(list, free_util, item_is_not_empty, NULL);
 167 }
 168
 169 void string_list_clear(struct string_list *list, int free_util)
 170 {
 171         if (list->items) {
 172                 int i;
 173                 if (list->strdup_strings) {
 174                         for (i = 0; i < list->nr; i++)
 175                                 free(list->items[i].string);
 176                 }
 177                 if (free_util) {
 178                         for (i = 0; i < list->nr; i++)
 179                                 free(list->items[i].util);
 180                 }
 181                 free(list->items);
 182         }
 183         list->items = NULL;
 184         list->nr = list->alloc = 0;
 185 }
 186
 187 void string_list_clear_func(struct string_list *list, string_list_clear_func_t clearfunc)
 188 {
 189         if (list->items) {
 190                 int i;
 191                 if (clearfunc) {
 192                         for (i = 0; i < list->nr; i++)
 193                                 clearfunc(list->items[i].util, list->items[i].string);
 194                 }
 195                 if (list->strdup_strings) {
 196                         for (i = 0; i < list->nr; i++)
 197                                 free(list->items[i].string);
 198                 }
 199                 free(list->items);
 200         }
 201         list->items = NULL;
 202         list->nr = list->alloc = 0;
 203 }
 204
 205 struct string_list_item *string_list_append_nodup(struct string_list *list,
 206                                                   char *string)
 207 {
 208         struct string_list_item *retval;
 209         ALLOC_GROW(list->items, list->nr + 1, list->alloc);
 210         retval = &list->items[list->nr++];
 211         retval->string = string;
 212         retval->util = NULL;
 213         return retval;
 214 }
 215
 216 struct string_list_item *string_list_append(struct string_list *list,
 217                                             const char *string)
 218 {
 219         return string_list_append_nodup(
 220                         list,
 221                         list->strdup_strings ? xstrdup(string) : (char *)string);
 222 }
 223
 224 /*
 225  * Encapsulate the compare function pointer because ISO C99 forbids
 226  * casting from void * to a function pointer and vice versa.
 227  */
 228 struct string_list_sort_ctx
 229 {
 230         compare_strings_fn cmp;
 231 };
 232
 233 static int cmp_items(const void *a, const void *b, void *ctx)
 234 {
 235         struct string_list_sort_ctx *sort_ctx = ctx;
 236         const struct string_list_item *one = a;
 237         const struct string_list_item *two = b;
 238         return sort_ctx->cmp(one->string, two->string);
 239 }
 240
 241 void string_list_sort(struct string_list *list)
 242 {
 243         struct string_list_sort_ctx sort_ctx = {list->cmp ? list->cmp : strcmp};
 244
 245         QSORT_S(list->items, list->nr, cmp_items, &sort_ctx);
 246 }
 247
 248 struct string_list_item *unsorted_string_list_lookup(struct string_list *list,
 249                                                      const char *string)
 250 {
 251         struct string_list_item *item;
 252         compare_strings_fn cmp = list->cmp ? list->cmp : strcmp;
 253
 254         for_each_string_list_item(item, list)
 255                 if (!cmp(string, item->string))
 256                         return item;
 257         return NULL;
 258 }
 259
 260 int unsorted_string_list_has_string(struct string_list *list,
 261                                     const char *string)
 262 {
 263         return unsorted_string_list_lookup(list, string) != NULL;
 264 }
 265
 266 void unsorted_string_list_delete_item(struct string_list *list, int i, int free_util)
 267 {
 268         if (list->strdup_strings)
 269                 free(list->items[i].string);
 270         if (free_util)
 271                 free(list->items[i].util);
 272         list->items[i] = list->items[list->nr-1];
 273         list->nr--;
 274 }
 275
 276 int string_list_split(struct string_list *list, const char *string,
 277                       int delim, int maxsplit)
 278 {
 279         int count = 0;
 280         const char *p = string, *end;
 281
 282         if (!list->strdup_strings)
 283                 die("internal error in string_list_split(): "
 284                     "list->strdup_strings must be set");
 285         for (;;) {
 286                 count++;
 287                 if (maxsplit >= 0 && count > maxsplit) {
 288                         string_list_append(list, p);
 289                         return count;
 290                 }
 291                 end = strchr(p, delim);
 292                 if (end) {
 293                         string_list_append_nodup(list, xmemdupz(p, end - p));
 294                         p = end + 1;
 295                 } else {
 296                         string_list_append(list, p);
 297                         return count;
 298                 }
 299         }
 300 }
 301
 302 int string_list_split_in_place(struct string_list *list, char *string,
 303                                int delim, int maxsplit)
 304 {
 305         int count = 0;
 306         char *p = string, *end;
 307
 308         if (list->strdup_strings)
 309                 die("internal error in string_list_split_in_place(): "
 310                     "list->strdup_strings must not be set");
 311         for (;;) {
 312                 count++;
 313                 if (maxsplit >= 0 && count > maxsplit) {
 314                         string_list_append(list, p);
 315                         return count;
 316                 }
 317                 end = strchr(p, delim);
 318                 if (end) {
 319                         *end = '\0';
 320                         string_list_append(list, p);
 321                         p = end + 1;
 322                 } else {
 323                         string_list_append(list, p);
 324                         return count;
 325                 }
 326         }
 327 }