[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) / 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;

	if (list->nr + 1 >= list->alloc) {
		list->alloc += 32;
		REALLOC_ARRAY(list->items, list->alloc);
	}
	if (index < list->nr)
		memmove(list->items + index + 1, list->items + index,
				(list->nr - index)
				* sizeof(struct string_list_item));
	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)
{
	return string_list_insert_at_index(list, -1, string);
}

struct string_list_item *string_list_insert_at_index(struct string_list *list,
						     int insert_at, const char *string)
{
	int index = add_entry(insert_at, list, string);

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

	return list->items + index;
}

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);
}

/* Yuck */
static compare_strings_fn compare_for_qsort;

/* Only call this from inside sort_string_list! */
static int cmp_items(const void *a, const void *b)
{
	const struct string_list_item *one = a;
	const struct string_list_item *two = b;
	return compare_for_qsort(one->string, two->string);
}

void sort_string_list(struct string_list *list)
{
	compare_for_qsort = list->cmp ? list->cmp : strcmp;
	qsort(list->items, list->nr, sizeof(*list->items), cmp_items);
}

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

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