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

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

/* 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;

	while (left + 1 < right) {
		int middle = (left + right) / 2;
		int compare = strcmp(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;
		list->items = xrealloc(list->items, list->alloc
				* sizeof(struct string_list_item));
	}
	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;
		for (src = dst = 1; src < list->nr; src++) {
			if (!strcmp(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);
}

char *string_list_longest_prefix(const struct string_list *prefixes,
				 const char *string)
{
	int i, max_len = -1;
	char *retval = NULL;

	for (i = 0; i < prefixes->nr; i++) {
		char *prefix = prefixes->items[i].string;
		if (!prefixcmp(string, prefix)) {
			int len = strlen(prefix);
			if (len > max_len) {
				retval = prefix;
				max_len = len;
			}
		}
	}

	return retval;
}

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)
{
	const struct string_list_item *one = a;
	const struct string_list_item *two = b;
	return strcmp(one->string, two->string);
}

void sort_string_list(struct string_list *list)
{
	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;
	for (i = 0; i < list->nr; i++)
		if (!strcmp(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
	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 */
cfa1ee6b	29	static int add_entry(int insert_at, struct string_list list, const char string)
c455c87c	30	{
cfa1ee6b MSO	31	int exact_match = 0;
cfa1ee6b MSO	32	int index = insert_at != -1 ? insert_at : get_entry_index(list, string, &exact_match);
c455c87c JS	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
78a395d3	54	struct string_list_item string_list_insert(struct string_list list, const char *string)
c455c87c	55	{
aadceea6	56	return string_list_insert_at_index(list, -1, string);
cfa1ee6b MSO	57	}
cfa1ee6b MSO	58
aadceea6 JP	59	struct string_list_item string_list_insert_at_index(struct string_list list,
aadceea6 JP	60	int insert_at, const char *string)
cfa1ee6b MSO	61	{
cfa1ee6b MSO	62	int index = add_entry(insert_at, list, string);
c455c87c JS	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
cfa1ee6b MSO	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
e8c8b713	87	struct string_list_item string_list_lookup(struct string_list list, const char *string)
c455c87c JS	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
31d5451e MH	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
b684e977 JP	112	int for_each_string_list(struct string_list *list,
b684e977 JP	113	string_list_each_func_t fn, void *cb_data)
c6f5a7a9 JS	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
eb5f0c7a MH	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
6bb2a137 MH	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
f103f95b MH	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
c455c87c JS	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
cfa1ee6b MSO	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
cb944f6b	205	void print_string_list(const struct string_list p, const char text)
c455c87c JS	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
e448fed8 MH	214	struct string_list_item string_list_append_nodup(struct string_list list,
e448fed8 MH	215	char *string)
c455c87c	216	{
e448fed8	217	struct string_list_item *retval;
c455c87c	218	ALLOC_GROW(list->items, list->nr + 1, list->alloc);
e448fed8 MH	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);
c455c87c JS	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
e2421480 SB	245	struct string_list_item unsorted_string_list_lookup(struct string_list list,
e2421480 SB	246	const char *string)
c455c87c JS	247	{
	248	int i;
	249	for (i = 0; i < list->nr; i++)
	250	if (!strcmp(string, list->items[i].string))
e2421480 SB	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;
c455c87c JS	259	}
c455c87c JS	260
86d4b528 JS	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	}
ff919f96 MH	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	}