[thirdparty/git.git] / string-list.c

#include "cache.h"
#include "string-list.h"

void string_list_init(struct string_list *list, int strdup_strings)
{
	memset(list, 0, sizeof(*list));
	list->strdup_strings = strdup_strings;
}

/* if there is no exact match, point to the index where the entry could be
 * inserted */
static int get_entry_index(const struct string_list *list, const char *string,
		int *exact_match)
{
	int left = -1, right = list->nr;
	compare_strings_fn cmp = list->cmp ? list->cmp : strcmp;

	while (left + 1 < right) {
		int middle = left + (right - left) / 2;
		int compare = cmp(string, list->items[middle].string);
		if (compare < 0)
			right = middle;
		else if (compare > 0)
			left = middle;
		else {
			*exact_match = 1;
			return middle;
		}
	}

	*exact_match = 0;
	return right;
}

/* returns -1-index if already exists */
static int add_entry(int insert_at, struct string_list *list, const char *string)
{
	int exact_match = 0;
	int index = insert_at != -1 ? insert_at : get_entry_index(list, string, &exact_match);

	if (exact_match)
		return -1 - index;

	ALLOC_GROW(list->items, list->nr+1, list->alloc);
	if (index < list->nr)
		MOVE_ARRAY(list->items + index + 1, list->items + index,
			   list->nr - index);
	list->items[index].string = list->strdup_strings ?
		xstrdup(string) : (char *)string;
	list->items[index].util = NULL;
	list->nr++;

	return index;
}

struct string_list_item *string_list_insert(struct string_list *list, const char *string)
{
	int index = add_entry(-1, list, string);

	if (index < 0)
		index = -1 - index;

	return list->items + index;
}

void string_list_remove(struct string_list *list, const char *string,
			int free_util)
{
	int exact_match;
	int i = get_entry_index(list, string, &exact_match);

	if (exact_match) {
		if (list->strdup_strings)
			free(list->items[i].string);
		if (free_util)
			free(list->items[i].util);

		list->nr--;
		MOVE_ARRAY(list->items + i, list->items + i + 1, list->nr - i);
	}
}

int string_list_has_string(const struct string_list *list, const char *string)
{
	int exact_match;
	get_entry_index(list, string, &exact_match);
	return exact_match;
}

int string_list_find_insert_index(const struct string_list *list, const char *string,
				  int negative_existing_index)
{
	int exact_match;
	int index = get_entry_index(list, string, &exact_match);
	if (exact_match)
		index = -1 - (negative_existing_index ? index : 0);
	return index;
}

struct string_list_item *string_list_lookup(struct string_list *list, const char *string)
{
	int exact_match, i = get_entry_index(list, string, &exact_match);
	if (!exact_match)
		return NULL;
	return list->items + i;
}

void string_list_remove_duplicates(struct string_list *list, int free_util)
{
	if (list->nr > 1) {
		int src, dst;
		compare_strings_fn cmp = list->cmp ? list->cmp : strcmp;
		for (src = dst = 1; src < list->nr; src++) {
			if (!cmp(list->items[dst - 1].string, list->items[src].string)) {
				if (list->strdup_strings)
					free(list->items[src].string);
				if (free_util)
					free(list->items[src].util);
			} else
				list->items[dst++] = list->items[src];
		}
		list->nr = dst;
	}
}

int for_each_string_list(struct string_list *list,
			 string_list_each_func_t fn, void *cb_data)
{
	int i, ret = 0;
	for (i = 0; i < list->nr; i++)
		if ((ret = fn(&list->items[i], cb_data)))
			break;
	return ret;
}

void filter_string_list(struct string_list *list, int free_util,
			string_list_each_func_t want, void *cb_data)
{
	int src, dst = 0;
	for (src = 0; src < list->nr; src++) {
		if (want(&list->items[src], cb_data)) {
			list->items[dst++] = list->items[src];
		} else {
			if (list->strdup_strings)
				free(list->items[src].string);
			if (free_util)
				free(list->items[src].util);
		}
	}
	list->nr = dst;
}

static int item_is_not_empty(struct string_list_item *item, void *unused)
{
	return *item->string != '\0';
}

void string_list_remove_empty_items(struct string_list *list, int free_util) {
	filter_string_list(list, free_util, item_is_not_empty, NULL);
}

void string_list_clear(struct string_list *list, int free_util)
{
	if (list->items) {
		int i;
		if (list->strdup_strings) {
			for (i = 0; i < list->nr; i++)
				free(list->items[i].string);
		}
		if (free_util) {
			for (i = 0; i < list->nr; i++)
				free(list->items[i].util);
		}
		free(list->items);
	}
	list->items = NULL;
	list->nr = list->alloc = 0;
}

void string_list_clear_func(struct string_list *list, string_list_clear_func_t clearfunc)
{
	if (list->items) {
		int i;
		if (clearfunc) {
			for (i = 0; i < list->nr; i++)
				clearfunc(list->items[i].util, list->items[i].string);
		}
		if (list->strdup_strings) {
			for (i = 0; i < list->nr; i++)
				free(list->items[i].string);
		}
		free(list->items);
	}
	list->items = NULL;
	list->nr = list->alloc = 0;
}


void print_string_list(const struct string_list *p, const char *text)
{
	int i;
	if ( text )
		printf("%s\n", text);
	for (i = 0; i < p->nr; i++)
		printf("%s:%p\n", p->items[i].string, p->items[i].util);
}

struct string_list_item *string_list_append_nodup(struct string_list *list,
						  char *string)
{
	struct string_list_item *retval;
	ALLOC_GROW(list->items, list->nr + 1, list->alloc);
	retval = &list->items[list->nr++];
	retval->string = string;
	retval->util = NULL;
	return retval;
}

struct string_list_item *string_list_append(struct string_list *list,
					    const char *string)
{
	return string_list_append_nodup(
			list,
			list->strdup_strings ? xstrdup(string) : (char *)string);
}

static int cmp_items(const void *a, const void *b, void *ctx)
{
	compare_strings_fn cmp = ctx;
	const struct string_list_item *one = a;
	const struct string_list_item *two = b;
	return cmp(one->string, two->string);
}

void string_list_sort(struct string_list *list)
{
	QSORT_S(list->items, list->nr, cmp_items,
		list->cmp ? list->cmp : strcmp);
}

struct string_list_item *unsorted_string_list_lookup(struct string_list *list,
						     const char *string)
{
	struct string_list_item *item;
	compare_strings_fn cmp = list->cmp ? list->cmp : strcmp;

	for_each_string_list_item(item, list)
		if (!cmp(string, item->string))
			return item;
	return NULL;
}

int unsorted_string_list_has_string(struct string_list *list,
				    const char *string)
{
	return unsorted_string_list_lookup(list, string) != NULL;
}

void unsorted_string_list_delete_item(struct string_list *list, int i, int free_util)
{
	if (list->strdup_strings)
		free(list->items[i].string);
	if (free_util)
		free(list->items[i].util);
	list->items[i] = list->items[list->nr-1];
	list->nr--;
}

int string_list_split(struct string_list *list, const char *string,
		      int delim, int maxsplit)
{
	int count = 0;
	const char *p = string, *end;

	if (!list->strdup_strings)
		die("internal error in string_list_split(): "
		    "list->strdup_strings must be set");
	for (;;) {
		count++;
		if (maxsplit >= 0 && count > maxsplit) {
			string_list_append(list, p);
			return count;
		}
		end = strchr(p, delim);
		if (end) {
			string_list_append_nodup(list, xmemdupz(p, end - p));
			p = end + 1;
		} else {
			string_list_append(list, p);
			return count;
		}
	}
}

int string_list_split_in_place(struct string_list *list, char *string,
			       int delim, int maxsplit)
{
	int count = 0;
	char *p = string, *end;

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