list              424 archive.c      	int list = 0;
list              447 archive.c      		OPT_BOOL('l', "list", &list,
list              469 archive.c      	if (list) {
list              355 attr.c         static struct attr_stack *read_attr_from_array(const char **list)
list              362 attr.c         	while ((line = *(list++)) != NULL)
list               63 bisect.c       static void clear_distance(struct commit_list *list)
list               65 bisect.c       	while (list) {
list               66 bisect.c       		struct commit *commit = list->item;
list               68 bisect.c       		list = list->next;
list              122 bisect.c       		      struct commit_list *list)
list              128 bisect.c       	for (p = list; p; p = p->next) {
list              159 bisect.c       static struct commit_list *best_bisection(struct commit_list *list, int nr)
list              164 bisect.c       	best = list;
list              165 bisect.c       	for (p = list; p; p = p->next) {
list              199 bisect.c       static struct commit_list *best_bisection_sorted(struct commit_list *list, int nr)
list              205 bisect.c       	for (p = list, cnt = 0; p; p = p->next) {
list              219 bisect.c       	for (p = list, i = 0; i < cnt; i++) {
list              232 bisect.c       	return list;
list              248 bisect.c       static struct commit_list *do_find_bisection(struct commit_list *list,
list              257 bisect.c       	for (n = 0, p = list; p; p = p->next) {
list              268 bisect.c       					  counted, nr, list);
list              284 bisect.c       	show_list("bisection 2 initialize", counted, nr, list);
list              300 bisect.c       	for (p = list; p; p = p->next) {
list              306 bisect.c       		clear_distance(list);
list              314 bisect.c       	show_list("bisection 2 count_distance", counted, nr, list);
list              317 bisect.c       		for (p = list; p; p = p->next) {
list              341 bisect.c       					  counted, nr, list);
list              352 bisect.c       	show_list("bisection 2 counted all", counted, nr, list);
list              355 bisect.c       		return best_bisection(list, nr);
list              357 bisect.c       		return best_bisection_sorted(list, nr);
list              360 bisect.c       struct commit_list *find_bisection(struct commit_list *list,
list              368 bisect.c       	show_list("bisection 2 entry", 0, 0, list);
list              374 bisect.c       	for (nr = on_list = 0, last = NULL, p = list;
list              388 bisect.c       	list = last;
list              389 bisect.c       	show_list("bisection 2 sorted", 0, nr, list);
list              395 bisect.c       	best = do_find_bisection(list, nr, weights, find_all);
list              481 bisect.c       struct commit_list *filter_skipped(struct commit_list *list,
list              497 bisect.c       		return list;
list              499 bisect.c       	while (list) {
list              500 bisect.c       		struct commit_list *next = list->next;
list              501 bisect.c       		list->next = NULL;
list              503 bisect.c       					   list->item->object.sha1)) {
list              507 bisect.c       			*tried = list;
list              508 bisect.c       			tried = &list->next;
list              512 bisect.c       					return list;
list              518 bisect.c       			*f = list;
list              519 bisect.c       			f = &list->next;
list              523 bisect.c       		list = next;
list              565 bisect.c       static struct commit_list *skip_away(struct commit_list *list, int count)
list              573 bisect.c       	cur = list;
list              582 bisect.c       			return list;
list              587 bisect.c       	return list;
list              590 bisect.c       static struct commit_list *managed_skipped(struct commit_list *list,
list              598 bisect.c       		return list;
list              600 bisect.c       	list = filter_skipped(list, tried, 0, &count, &skipped_first);
list              603 bisect.c       		return list;
list              605 bisect.c       	return skip_away(list, count);
list                4 bisect.h       extern struct commit_list *find_bisection(struct commit_list *list,
list                8 bisect.h       extern struct commit_list *filter_skipped(struct commit_list *list,
list              214 builtin/apply.c static void free_fragment_list(struct fragment *list)
list              216 builtin/apply.c 	while (list) {
list              217 builtin/apply.c 		struct fragment *next = list->next;
list              218 builtin/apply.c 		if (list->free_patch)
list              219 builtin/apply.c 			free((char *)list->patch);
list              220 builtin/apply.c 		free(list);
list              221 builtin/apply.c 		list = next;
list              235 builtin/apply.c static void free_patch_list(struct patch *list)
list              237 builtin/apply.c 	while (list) {
list              238 builtin/apply.c 		struct patch *next = list->next;
list              239 builtin/apply.c 		free_patch(list);
list              240 builtin/apply.c 		list = next;
list             3872 builtin/apply.c static void build_fake_ancestor(struct patch *list, const char *filename)
list             3881 builtin/apply.c 	for (patch = list; patch; patch = patch->next) {
list             4316 builtin/apply.c static int write_out_results(struct patch *list)
list             4324 builtin/apply.c 		l = list;
list             4366 builtin/apply.c 	struct patch *list = NULL, **listp = &list;
list             4396 builtin/apply.c 	if (!list && !skipped_patch)
list             4412 builtin/apply.c 	    check_patch_list(list) < 0 &&
list             4416 builtin/apply.c 	if (apply && write_out_results(list)) {
list             4424 builtin/apply.c 		build_fake_ancestor(list, fake_ancestor);
list             4427 builtin/apply.c 		stat_patch_list(list);
list             4430 builtin/apply.c 		numstat_patch_list(list);
list             4433 builtin/apply.c 		summary_patch_list(list);
list             4435 builtin/apply.c 	free_patch_list(list);
list              293 builtin/branch.c 	struct ref_item *list;
list              382 builtin/branch.c 	ALLOC_GROW(ref_list->list, ref_list->index + 1, ref_list->alloc);
list              385 builtin/branch.c 	newitem = &(ref_list->list[ref_list->index++]);
list              407 builtin/branch.c 		free(ref_list->list[i].name);
list              408 builtin/branch.c 		free(ref_list->list[i].dest);
list              410 builtin/branch.c 	free(ref_list->list);
list              564 builtin/branch.c 		if (refs->list[i].ignore)
list              566 builtin/branch.c 		if (refs->list[i].width > w)
list              567 builtin/branch.c 			w = refs->list[i].width;
list              655 builtin/branch.c 			struct ref_item *item = &ref_list.list[i];
list              662 builtin/branch.c 			struct ref_item *item = &ref_list.list[i];
list              671 builtin/branch.c 	qsort(ref_list.list, ref_list.index, sizeof(struct ref_item), ref_cmp);
list              679 builtin/branch.c 			(ref_list.list[i].kind == REF_LOCAL_BRANCH) &&
list              680 builtin/branch.c 			!strcmp(ref_list.list[i].name, head);
list              682 builtin/branch.c 				ref_list.list[i].kind == REF_REMOTE_BRANCH)
list              684 builtin/branch.c 		print_ref_item(&ref_list.list[i], ref_list.maxwidth, verbose,
list              801 builtin/branch.c 	int delete = 0, rename = 0, force = 0, list = 0;
list              845 builtin/branch.c 		OPT_BOOL(0, "list", &list, N_("list branch names")),
list              887 builtin/branch.c 		list = 1;
list              890 builtin/branch.c 		list = 1;
list              893 builtin/branch.c 	    list + unset_upstream > 1)
list              914 builtin/branch.c 	} else if (list) {
list              277 builtin/clean.c 	struct string_list list = STRING_LIST_INIT_DUP;
list              285 builtin/clean.c 		string_list_append(&list, qname);
list              296 builtin/clean.c 	print_columns(&list, colopts, &copts);
list              298 builtin/clean.c 	string_list_clear(&list, 0);
list               21 builtin/column.c 	struct string_list list = STRING_LIST_INIT_DUP;
list               55 builtin/column.c 		string_list_append(&list, sb.buf);
list               57 builtin/column.c 	print_columns(&list, colopts, &copts);
list              229 builtin/commit.c static int list_paths(struct string_list *list, const char *with_tree,
list              254 builtin/commit.c 		item = string_list_insert(list, ce->name);
list              264 builtin/commit.c static void add_remove_files(struct string_list *list)
list              267 builtin/commit.c 	for (i = 0; i < list->nr; i++) {
list              269 builtin/commit.c 		struct string_list_item *p = &(list->items[i]);
list              180 builtin/describe.c 	struct commit_list **list,
list              184 builtin/describe.c 	while (*list) {
list              185 builtin/describe.c 		struct commit *c = pop_commit(list);
list              189 builtin/describe.c 			struct commit_list *a = *list;
list              204 builtin/describe.c 				commit_list_insert_by_date(p, list);
list              242 builtin/describe.c 	struct commit_list *list;
list              286 builtin/describe.c 	list = NULL;
list              288 builtin/describe.c 	commit_list_insert(cmit, &list);
list              289 builtin/describe.c 	while (list) {
list              290 builtin/describe.c 		struct commit *c = pop_commit(&list);
list              317 builtin/describe.c 		if (annotated_cnt && !list) {
list              327 builtin/describe.c 				commit_list_insert_by_date(p, &list);
list              358 builtin/describe.c 		commit_list_insert_by_date(gave_up_on, &list);
list              361 builtin/describe.c 	seen_commits += finish_depth_computation(&list, &all_matches[0]);
list              362 builtin/describe.c 	free_commit_list(list);
list              186 builtin/fetch.c 	struct string_list *list = (struct string_list *)cbdata;
list              187 builtin/fetch.c 	struct string_list_item *item = string_list_insert(list, refname);
list              977 builtin/fetch.c 	struct string_list *list = priv;
list              979 builtin/fetch.c 		string_list_append(list, remote->name);
list              985 builtin/fetch.c 	struct string_list *list;
list              998 builtin/fetch.c 				string_list_append(g->list,
list             1007 builtin/fetch.c static int add_remote_or_group(const char *name, struct string_list *list)
list             1009 builtin/fetch.c 	int prev_nr = list->nr;
list             1011 builtin/fetch.c 	g.name = name; g.list = list;
list             1014 builtin/fetch.c 	if (list->nr == prev_nr) {
list             1019 builtin/fetch.c 		string_list_append(list, remote->name);
list             1053 builtin/fetch.c static int fetch_multiple(struct string_list *list)
list             1067 builtin/fetch.c 	for (i = 0; i < list->nr; i++) {
list             1068 builtin/fetch.c 		const char *name = list->items[i].string;
list             1137 builtin/fetch.c 	struct string_list list = STRING_LIST_INIT_NODUP;
list             1184 builtin/fetch.c 		(void) for_each_remote(get_one_remote_for_fetch, &list);
list             1185 builtin/fetch.c 		result = fetch_multiple(&list);
list             1193 builtin/fetch.c 			if (!add_remote_or_group(argv[i], &list))
list             1195 builtin/fetch.c 		result = fetch_multiple(&list);
list             1198 builtin/fetch.c 		(void) add_remote_or_group(argv[0], &list);
list             1199 builtin/fetch.c 		if (list.nr > 1) {
list             1203 builtin/fetch.c 			result = fetch_multiple(&list);
list             1223 builtin/fetch.c 	list.strdup_strings = 1;
list             1224 builtin/fetch.c 	string_list_clear(&list, 0);
list              191 builtin/fmt-merge-msg.c 		struct string_list *list, struct strbuf *out)
list              193 builtin/fmt-merge-msg.c 	if (list->nr == 0)
list              195 builtin/fmt-merge-msg.c 	if (list->nr == 1) {
list              196 builtin/fmt-merge-msg.c 		strbuf_addf(out, "%s%s", singular, list->items[0].string);
list              200 builtin/fmt-merge-msg.c 		for (i = 0; i < list->nr - 1; i++)
list              202 builtin/fmt-merge-msg.c 				    list->items[i].string);
list              203 builtin/fmt-merge-msg.c 		strbuf_addf(out, " and %s", list->items[list->nr - 1].string);
list              495 builtin/grep.c 			const struct object_array *list)
list              499 builtin/grep.c 	const unsigned int nr = list->nr;
list              503 builtin/grep.c 		real_obj = deref_tag(list->objects[i].item, NULL, 0);
list              504 builtin/grep.c 		if (grep_object(opt, pathspec, real_obj, list->objects[i].name, list->objects[i].path)) {
list              628 builtin/grep.c 	struct object_array list = OBJECT_ARRAY_INIT;
list              824 builtin/grep.c 			add_object_array_with_path(object, arg, &list, oc.mode, oc.path);
list              835 builtin/grep.c 	if (list.nr || cached || online_cpus() == 1)
list              865 builtin/grep.c 	if (show_in_pager && (cached || list.nr))
list              896 builtin/grep.c 		if (list.nr)
list              901 builtin/grep.c 	} else if (!list.nr) {
list              909 builtin/grep.c 		hit = grep_objects(&opt, &pathspec, &list);
list              212 builtin/log.c  static int estimate_commit_count(struct rev_info *rev, struct commit_list *list)
list              216 builtin/log.c  	while (list) {
list              217 builtin/log.c  		struct commit *commit = list->item;
list              219 builtin/log.c  		list = list->next;
list              238 builtin/log.c  static void log_show_early(struct rev_info *revs, struct commit_list *list)
list              243 builtin/log.c  	sort_in_topological_order(&list, revs->sort_order);
list              244 builtin/log.c  	while (list && i) {
list              245 builtin/log.c  		struct commit *commit = list->item;
list              249 builtin/log.c  				int n = estimate_commit_count(revs, list);
list              261 builtin/log.c  		list = list->next;
list              927 builtin/log.c  			      int nr, struct commit **list,
list              941 builtin/log.c  	struct commit *head = list[0];
list              956 builtin/log.c  		const char *buf = get_commit_buffer(list[i], NULL);
list              959 builtin/log.c  		unuse_commit_buffer(list[i], buf);
list              982 builtin/log.c  		shortlog_add_commit(&log, list[i]);
list             1189 builtin/log.c  	struct commit **list = NULL;
list             1470 builtin/log.c  		REALLOC_ARRAY(list, nr);
list             1471 builtin/log.c  		list[nr - 1] = commit;
list             1512 builtin/log.c  				  origin, nr, list, branch_name, quiet);
list             1519 builtin/log.c  		commit = list[nr];
list             1582 builtin/log.c  	free(list);
list             1632 builtin/log.c  	struct commit_list *list = NULL;
list             1692 builtin/log.c  		commit_list_insert(commit, &list);
list             1695 builtin/log.c  	while (list) {
list             1698 builtin/log.c  		commit = list->item;
list             1702 builtin/log.c  		list = list->next;
list               97 builtin/mailsplit.c static int populate_maildir_list(struct string_list *list, const char *path)
list              118 builtin/mailsplit.c 			string_list_insert(list, name);
list              155 builtin/mailsplit.c 	struct string_list list = STRING_LIST_INIT_DUP;
list              157 builtin/mailsplit.c 	list.cmp = maildir_filename_cmp;
list              159 builtin/mailsplit.c 	if (populate_maildir_list(&list, maildir) < 0)
list              162 builtin/mailsplit.c 	for (i = 0; i < list.nr; i++) {
list              164 builtin/mailsplit.c 		snprintf(file, sizeof(file), "%s/%s", maildir, list.items[i].string);
list              184 builtin/mailsplit.c 	string_list_clear(&list, 1);
list              711 builtin/merge.c static void split_merge_strategies(const char *string, struct strategy **list,
list              724 builtin/merge.c 			ALLOC_GROW(*list, *nr + 1, *alloc);
list              725 builtin/merge.c 			(*list)[(*nr)++].name = xstrdup(q);
list              730 builtin/merge.c 			ALLOC_GROW(*list, *nr + 1, *alloc);
list              731 builtin/merge.c 			(*list)[(*nr)++].name = xstrdup(q);
list              739 builtin/merge.c 	struct strategy *list = NULL;
list              742 builtin/merge.c 	memset(&list, 0, sizeof(list));
list              743 builtin/merge.c 	split_merge_strategies(string, &list, &list_nr, &list_alloc);
list              744 builtin/merge.c 	if (list) {
list              746 builtin/merge.c 			append_strategy(get_strategy(list[i].name));
list             1392 builtin/merge.c 		struct commit_list *list = remoteheads;
list             1393 builtin/merge.c 		commit_list_insert(head_commit, &list);
list             1394 builtin/merge.c 		common = get_octopus_merge_bases(list);
list             1395 builtin/merge.c 		free(list);
list              994 builtin/notes.c 		result = list(argc, argv, prefix);
list             1744 builtin/pack-objects.c static void find_deltas(struct object_entry **list, unsigned *list_size,
list             1763 builtin/pack-objects.c 		entry = *list++;
list             1901 builtin/pack-objects.c 	struct object_entry **list;
list             1941 builtin/pack-objects.c 		find_deltas(me->list, &me->remaining,
list             1967 builtin/pack-objects.c static void ll_find_deltas(struct object_entry **list, unsigned list_size,
list             1976 builtin/pack-objects.c 		find_deltas(list, &list_size, window, depth, processed);
list             2001 builtin/pack-objects.c 		       list[sub_size]->hash &&
list             2002 builtin/pack-objects.c 		       list[sub_size]->hash == list[sub_size-1]->hash)
list             2005 builtin/pack-objects.c 		p[i].list = list;
list             2009 builtin/pack-objects.c 		list += sub_size;
list             2055 builtin/pack-objects.c 			list = victim->list + victim->list_size - sub_size;
list             2056 builtin/pack-objects.c 			while (sub_size && list[0]->hash &&
list             2057 builtin/pack-objects.c 			       list[0]->hash == list[-1]->hash) {
list             2058 builtin/pack-objects.c 				list++;
list             2069 builtin/pack-objects.c 				list -= sub_size;
list             2071 builtin/pack-objects.c 			target->list = list;
list               63 builtin/pack-redundant.c static void llist_free(struct llist *list)
list               65 builtin/pack-redundant.c 	while ((list->back = list->front)) {
list               66 builtin/pack-redundant.c 		list->front = list->front->next;
list               67 builtin/pack-redundant.c 		llist_item_put(list->back);
list               69 builtin/pack-redundant.c 	free(list);
list               72 builtin/pack-redundant.c static inline void llist_init(struct llist **list)
list               74 builtin/pack-redundant.c 	*list = xmalloc(sizeof(struct llist));
list               75 builtin/pack-redundant.c 	(*list)->front = (*list)->back = NULL;
list               76 builtin/pack-redundant.c 	(*list)->size = 0;
list               79 builtin/pack-redundant.c static struct llist * llist_copy(struct llist *list)
list               86 builtin/pack-redundant.c 	if ((ret->size = list->size) == 0)
list               90 builtin/pack-redundant.c 	new->sha1 = list->front->sha1;
list               92 builtin/pack-redundant.c 	old = list->front->next;
list              106 builtin/pack-redundant.c static inline struct llist_item *llist_insert(struct llist *list,
list              117 builtin/pack-redundant.c 		if (after == list->back)
list              118 builtin/pack-redundant.c 			list->back = new;
list              120 builtin/pack-redundant.c 		if (list->size == 0)
list              121 builtin/pack-redundant.c 			list->back = new;
list              123 builtin/pack-redundant.c 			new->next = list->front;
list              124 builtin/pack-redundant.c 		list->front = new;
list              126 builtin/pack-redundant.c 	list->size++;
list              130 builtin/pack-redundant.c static inline struct llist_item *llist_insert_back(struct llist *list,
list              133 builtin/pack-redundant.c 	return llist_insert(list, list->back, sha1);
list              136 builtin/pack-redundant.c static inline struct llist_item *llist_insert_sorted_unique(struct llist *list,
list              141 builtin/pack-redundant.c 	l = (hint == NULL) ? list->front : hint;
list              145 builtin/pack-redundant.c 			return llist_insert(list, prev, sha1);
list              154 builtin/pack-redundant.c 	return llist_insert_back(list, sha1);
list              158 builtin/pack-redundant.c static inline struct llist_item * llist_sorted_remove(struct llist *list, const unsigned char *sha1, struct llist_item *hint)
list              163 builtin/pack-redundant.c 	l = (hint == NULL) ? list->front : hint;
list              171 builtin/pack-redundant.c 				if (hint != NULL && hint != list->front) {
list              176 builtin/pack-redundant.c 				list->front = l->next;
list              179 builtin/pack-redundant.c 			if (l == list->back)
list              180 builtin/pack-redundant.c 				list->back = prev;
list              182 builtin/pack-redundant.c 			list->size--;
list              302 builtin/pack-redundant.c static struct pll * get_permutations(struct pack_list *list, int n)
list              306 builtin/pack-redundant.c 	if (list == NULL || pack_list_size(list) < n || n == 0)
list              310 builtin/pack-redundant.c 		while (list) {
list              313 builtin/pack-redundant.c 			pack_list_insert(&new_pll->pl, list);
list              316 builtin/pack-redundant.c 			list = list->next;
list              321 builtin/pack-redundant.c 	while (list->next) {
list              322 builtin/pack-redundant.c 		subset = get_permutations(list->next, n - 1);
list              326 builtin/pack-redundant.c 			pack_list_insert(&new_pll->pl, list);
list              331 builtin/pack-redundant.c 		list = list->next;
list              336 builtin/pack-redundant.c static int is_superset(struct pack_list *pl, struct llist *list)
list              340 builtin/pack-redundant.c 	diff = llist_copy(list);
list             1068 builtin/receive-pack.c static void check_aliased_update(struct command *cmd, struct string_list *list)
list             1093 builtin/receive-pack.c 	if ((item = string_list_lookup(list, dst_name)) == NULL)
list              321 builtin/reflog.c 	struct commit_list **list = cb_data;
list              328 builtin/reflog.c 	commit_list_insert(tip_commit, list);
list              487 builtin/remote.c 	struct known_remote *list;
list              500 builtin/remote.c 	r->next = all->list;
list              501 builtin/remote.c 	all->list = r;
list              524 builtin/remote.c 	for (kr = branches->keep->list; kr; kr = kr->next) {
list              896 builtin/remote.c 	struct string_list *list;
list              908 builtin/remote.c 	string_list_insert(info->list, item->string);
list              955 builtin/remote.c 	item = string_list_insert(show_info->list, branch_item->string);
list             1003 builtin/remote.c 	item = string_list_append(show_info->list, push_item->string);
list             1068 builtin/remote.c 	struct string_list *list = priv;
list             1075 builtin/remote.c 		string_list_append(list, remote->name)->util =
list             1078 builtin/remote.c 		string_list_append(list, remote->name)->util = NULL;
list             1089 builtin/remote.c 		string_list_append(list, remote->name)->util =
list             1098 builtin/remote.c 	struct string_list list = STRING_LIST_INIT_NODUP;
list             1101 builtin/remote.c 	list.strdup_strings = 1;
list             1102 builtin/remote.c 	result = for_each_remote(get_one_entry, &list);
list             1107 builtin/remote.c 		string_list_sort(&list);
list             1108 builtin/remote.c 		for (i = 0; i < list.nr; i++) {
list             1109 builtin/remote.c 			struct string_list_item *item = list.items + i;
list             1120 builtin/remote.c 	string_list_clear(&list, 1);
list             1147 builtin/remote.c 	info.list = &info_list;
list             1187 builtin/remote.c 		if (info.list->nr)
list             1190 builtin/remote.c 				     info.list->nr),
list             1192 builtin/remote.c 		for_each_string_list(info.list, show_remote_info_item, &info);
list             1193 builtin/remote.c 		string_list_clear(info.list, 0);
list             1199 builtin/remote.c 		if (info.list->nr)
list             1202 builtin/remote.c 				     info.list->nr));
list             1203 builtin/remote.c 		for_each_string_list(info.list, show_local_info_item, &info);
list             1204 builtin/remote.c 		string_list_clear(info.list, 0);
list             1212 builtin/remote.c 		qsort(info.list->items, info.list->nr,
list             1213 builtin/remote.c 			sizeof(*info.list->items), cmp_string_with_push);
list             1214 builtin/remote.c 		if (info.list->nr)
list             1217 builtin/remote.c 				     info.list->nr),
list             1219 builtin/remote.c 		for_each_string_list(info.list, show_push_info_item, &info);
list             1220 builtin/remote.c 		string_list_clear(info.list, 0);
list               27 builtin/rm.c   } list;
list               83 builtin/rm.c   	for (i = 0; i < list.nr; i++) {
list               84 builtin/rm.c   		const char *name = list.entry[i].name;
list              127 builtin/rm.c   	for (i = 0; i < list.nr; i++) {
list              131 builtin/rm.c   		const char *name = list.entry[i].name;
list              312 builtin/rm.c   		ALLOC_GROW(list.entry, list.nr + 1, list.alloc);
list              313 builtin/rm.c   		list.entry[list.nr].name = xstrdup(ce->name);
list              314 builtin/rm.c   		list.entry[list.nr].is_submodule = S_ISGITLINK(ce->ce_mode);
list              315 builtin/rm.c   		if (list.entry[list.nr++].is_submodule &&
list              368 builtin/rm.c   	for (i = 0; i < list.nr; i++) {
list              369 builtin/rm.c   		const char *path = list.entry[i].name;
list              390 builtin/rm.c   		for (i = 0; i < list.nr; i++) {
list              391 builtin/rm.c   			const char *path = list.entry[i].name;
list              392 builtin/rm.c   			if (list.entry[i].is_submodule) {
list               58 builtin/shortlog.c 	item = string_list_insert(&log->list, namemailbuf.buf);
list              216 builtin/shortlog.c 	log->list.strdup_strings = 1;
list              296 builtin/shortlog.c 		qsort(log->list.items, log->list.nr, sizeof(struct string_list_item),
list              298 builtin/shortlog.c 	for (i = 0; i < log->list.nr; i++) {
list              299 builtin/shortlog.c 		struct string_list *onelines = log->list.items[i].util;
list              302 builtin/shortlog.c 			printf("%6d\t%s\n", onelines->nr, log->list.items[i].string);
list              304 builtin/shortlog.c 			printf("%s (%d):\n", log->list.items[i].string, onelines->nr);
list              322 builtin/shortlog.c 		log->list.items[i].util = NULL;
list              326 builtin/shortlog.c 	log->list.strdup_strings = 1;
list              327 builtin/shortlog.c 	string_list_clear(&log->list, 1);
list               44 builtin/show-branch.c static struct commit *interesting(struct commit_list *list)
list               46 builtin/show-branch.c 	while (list) {
list               47 builtin/show-branch.c 		struct commit *commit = list->item;
list               48 builtin/show-branch.c 		list = list->next;
list               59 builtin/show-branch.c 	struct commit_list *list;
list               60 builtin/show-branch.c 	list = *list_p;
list               61 builtin/show-branch.c 	commit = list->item;
list               62 builtin/show-branch.c 	*list_p = list->next;
list               63 builtin/show-branch.c 	free(list);
list              123 builtin/show-branch.c static void name_commits(struct commit_list *list,
list              133 builtin/show-branch.c 	for (cl = list; cl; cl = cl->next) {
list              148 builtin/show-branch.c 		for (cl = list; cl; cl = cl->next) {
list              156 builtin/show-branch.c 		for (cl = list; cl; cl = cl->next) {
list              637 builtin/show-branch.c 	struct commit_list *list = NULL, *seen = NULL;
list              862 builtin/show-branch.c 			commit_list_insert_by_date(commit, &list);
list              869 builtin/show-branch.c 		join_revs(&list, &seen, num_rev, extra);
list               95 builtin/show-ref.c 	struct string_list *list = (struct string_list *)cbdata;
list               96 builtin/show-ref.c 	string_list_insert(list, refname);
list               16 bundle.c       		struct ref_list *list)
list               18 bundle.c       	ALLOC_GROW(list->list, list->nr + 1, list->alloc);
list               19 bundle.c       	hashcpy(list->list[list->nr].sha1, sha1);
list               20 bundle.c       	list->list[list->nr].name = xstrdup(name);
list               21 bundle.c       	list->nr++;
list              113 bundle.c       				if (!strcmp(r->list[i].name, argv[j]))
list              118 bundle.c       		printf("%s %s\n", sha1_to_hex(r->list[i].sha1),
list              119 bundle.c       				r->list[i].name);
list              143 bundle.c       		struct ref_list_entry *e = p->list + i;
list                9 bundle.h       	} *list;
list             1521 cache.h        	struct configset_list list;
list               13 column.c       	const struct string_list *list;
list               48 column.c       	for (i = 0; i < data->list->nr; i++)
list               58 column.c       	data->rows = DIV_ROUND_UP(data->list->nr, data->cols);
list               68 column.c       			if (i < data->list->nr &&
list               91 column.c       		data->cols = DIV_ROUND_UP(data->list->nr, data->rows);
list              111 column.c       static void display_plain(const struct string_list *list,
list              116 column.c       	for (i = 0; i < list->nr; i++)
list              117 column.c       		printf("%s%s%s", indent, list->items[i].string, nl);
list              127 column.c       	if (i >= data->list->nr)
list              142 column.c       		newline = i + data->rows >= data->list->nr;
list              144 column.c       		newline = x == data->cols - 1 || i == data->list->nr - 1;
list              148 column.c       	       data->list->items[i].string,
list              154 column.c       static void display_table(const struct string_list *list,
list              163 column.c       	data.list = list;
list              167 column.c       	data.len = xmalloc(sizeof(*data.len) * list->nr);
list              168 column.c       	for (i = 0; i < list->nr; i++)
list              169 column.c       		data.len[i] = item_length(colopts, list->items[i].string);
list              190 column.c       void print_columns(const struct string_list *list, unsigned int colopts,
list              195 column.c       	if (!list->nr)
list              205 column.c       		display_plain(list, "", "\n");
list              210 column.c       		display_plain(list, nopts.indent, nopts.nl);
list              214 column.c       		display_table(list, colopts, &nopts);
list               39 column.h       extern void print_columns(const struct string_list *list, unsigned int colopts,
list              445 commit.c       struct commit_list *copy_commit_list(struct commit_list *list)
list              449 commit.c       	while (list) {
list              450 commit.c       		pp = commit_list_append(list->item, pp);
list              451 commit.c       		list = list->next;
list              456 commit.c       void free_commit_list(struct commit_list *list)
list              458 commit.c       	while (list) {
list              459 commit.c       		struct commit_list *temp = list;
list              460 commit.c       		list = temp->next;
list              465 commit.c       struct commit_list * commit_list_insert_by_date(struct commit *item, struct commit_list **list)
list              467 commit.c       	struct commit_list **pp = list;
list              499 commit.c       void commit_list_sort_by_date(struct commit_list **list)
list              501 commit.c       	*list = llist_mergesort(*list, commit_list_get_next, commit_list_set_next,
list              505 commit.c       struct commit *pop_most_recent_commit(struct commit_list **list,
list              508 commit.c       	struct commit *ret = (*list)->item;
list              510 commit.c       	struct commit_list *old = *list;
list              512 commit.c       	*list = (*list)->next;
list              519 commit.c       			commit_list_insert_by_date(commit, list);
list              550 commit.c       	struct commit_list *list = NULL;
list              553 commit.c       		commit_list_insert(*commit, &list);
list              556 commit.c       	while (list)
list              557 commit.c       		clear_commit_marks_1(&list, pop_commit(&list), mark);
list              657 commit.c       void sort_in_topological_order(struct commit_list **list, enum rev_sort_order sort_order)
list              659 commit.c       	struct commit_list *next, *orig = *list;
list              668 commit.c       	*list = NULL;
list              733 commit.c       	pptr = list;
list              734 commit.c       	*list = NULL;
list              841 commit.c       	struct commit_list *list = NULL;
list              861 commit.c       	list = paint_down_to_common(one, n, twos);
list              863 commit.c       	while (list) {
list              864 commit.c       		struct commit_list *next = list->next;
list              865 commit.c       		if (!(list->item->object.flags & STALE))
list              866 commit.c       			commit_list_insert_by_date(list->item, &result);
list              867 commit.c       		free(list);
list              868 commit.c       		list = next;
list              961 commit.c       	struct commit_list *list;
list              982 commit.c       	for (list = result, i = 0; list; list = list->next)
list              983 commit.c       		rslt[i++] = list->item;
list             1633 commit.c       void print_commit_list(struct commit_list *list,
list             1637 commit.c       	for ( ; list; list = list->next) {
list             1638 commit.c       		const char *format = list->next ? format_cur : format_last;
list             1639 commit.c       		printf(format, sha1_to_hex(list->item->object.sha1));
list              111 commit.h       					struct commit_list **list);
list              116 commit.h       				    struct commit_list **list);
list              117 commit.h       void commit_list_sort_by_date(struct commit_list **list);
list              120 commit.h       struct commit_list *copy_commit_list(struct commit_list *list);
list              122 commit.h       void free_commit_list(struct commit_list *list);
list              204 commit.h       struct commit *pop_most_recent_commit(struct commit_list **list,
list              371 commit.h       extern void print_commit_list(struct commit_list *list,
list             1285 config.c       	struct configset_list *list = &cs->list;
list             1288 config.c       	for (i = 0; i < list->nr; i++) {
list             1289 config.c       		entry = list->items[i].e;
list             1290 config.c       		value_index = list->items[i].value_index;
list             1350 config.c       	ALLOC_GROW(cs->list.items, cs->list.nr + 1, cs->list.alloc);
list             1351 config.c       	l_item = &cs->list.items[cs->list.nr++];
list             1378 config.c       	cs->list.nr = 0;
list             1379 config.c       	cs->list.alloc = 0;
list             1380 config.c       	cs->list.items = NULL;
list             1397 config.c       	free(cs->list.items);
list             1398 config.c       	cs->list.nr = 0;
list             1399 config.c       	cs->list.alloc = 0;
list             1400 config.c       	cs->list.items = NULL;
list              113 connect.c      			      struct ref **list, unsigned int flags,
list              117 connect.c      	struct ref **orig_list = list;
list              120 connect.c      	*list = NULL;
list              170 connect.c      		*list = ref;
list              171 connect.c      		list = &ref->next;
list              177 connect.c      	return list;
list               52 contrib/credential/osxkeychain/git-credential-osxkeychain.c 	SecKeychainAttributeList list;
list               55 contrib/credential/osxkeychain/git-credential-osxkeychain.c 	list.count = 1;
list               56 contrib/credential/osxkeychain/git-credential-osxkeychain.c 	list.attr = &attr;
list               59 contrib/credential/osxkeychain/git-credential-osxkeychain.c 	if (SecKeychainItemCopyContent(item, NULL, &list, NULL, NULL))
list               63 contrib/credential/osxkeychain/git-credential-osxkeychain.c 	SecKeychainItemFreeContent(&list, NULL);
list              882 daemon.c       	int *list;
list              979 daemon.c       		ALLOC_GROW(socklist->list, socklist->nr + 1, socklist->alloc);
list              980 daemon.c       		socklist->list[socklist->nr++] = sockfd;
list             1039 daemon.c       	ALLOC_GROW(socklist->list, socklist->nr + 1, socklist->alloc);
list             1040 daemon.c       	socklist->list[socklist->nr++] = sockfd;
list             1071 daemon.c       		pfd[i].fd = socklist->list[i];
list               20 diff-no-index.c static int read_directory_contents(const char *path, struct string_list *list)
list               30 diff-no-index.c 			string_list_insert(list, e->d_name);
list             2648 fast-import.c  	struct hash_list *list = NULL, **tail = &list, *n;
list             2681 fast-import.c  	return list;
list              302 graph.c        	struct commit_list *list;
list              314 graph.c        	for (list = orig->next; list; list = list->next) {
list              315 graph.c        		if (graph_is_interesting(graph, list->item))
list              316 graph.c        			return list;
list              436 grep.c         static struct grep_expr *compile_pattern_atom(struct grep_pat **list)
list              441 grep.c         	p = *list;
list              451 grep.c         		*list = p->next;
list              454 grep.c         		*list = p->next;
list              455 grep.c         		x = compile_pattern_or(list);
list              456 grep.c         		if (!*list || (*list)->token != GREP_CLOSE_PAREN)
list              458 grep.c         		*list = (*list)->next;
list              465 grep.c         static struct grep_expr *compile_pattern_not(struct grep_pat **list)
list              470 grep.c         	p = *list;
list              477 grep.c         		*list = p->next;
list              480 grep.c         		x->u.unary = compile_pattern_not(list);
list              485 grep.c         		return compile_pattern_atom(list);
list              489 grep.c         static struct grep_expr *compile_pattern_and(struct grep_pat **list)
list              494 grep.c         	x = compile_pattern_not(list);
list              495 grep.c         	p = *list;
list              499 grep.c         		*list = p->next;
list              500 grep.c         		y = compile_pattern_and(list);
list              512 grep.c         static struct grep_expr *compile_pattern_or(struct grep_pat **list)
list              517 grep.c         	x = compile_pattern_and(list);
list              518 grep.c         	p = *list;
list              520 grep.c         		y = compile_pattern_or(list);
list              532 grep.c         static struct grep_expr *compile_pattern_expr(struct grep_pat **list)
list              534 grep.c         	return compile_pattern_or(list);
list               83 help.c         	struct string_list list = STRING_LIST_INIT_NODUP;
list               88 help.c         		string_list_append(&list, cmds->names[i]->name);
list               97 help.c         	print_columns(&list, colopts, &copts);
list               98 help.c         	string_list_clear(&list, 0);
list              264 line-log.c     search_line_log_data(struct line_log_data *list, const char *path,
list              267 line-log.c     	struct line_log_data *p = list;
list              285 line-log.c     static void line_log_data_insert(struct line_log_data **list,
list              290 line-log.c     	struct line_log_data *p = search_line_log_data(*list, path, &ip);
list              305 line-log.c     		p->next = *list;
list              306 line-log.c     		*list = p;
list             1235 line-log.c     	struct commit_list *list = rev->commits;
list             1238 line-log.c     	while (list) {
list             1240 line-log.c     		commit = list->item;
list             1242 line-log.c     			*pp = list;
list             1243 line-log.c     			pp = &list->next;
list             1245 line-log.c     			to_free = list;
list             1246 line-log.c     		list = list->next;
list             1251 line-log.c     	for (list = out; list; list = list->next)
list             1252 line-log.c     		rewrite_parents(rev, list->item, line_log_rewrite_one);
list              152 list-objects.c 	struct commit_list *list;
list              155 list-objects.c 	for (list = revs->commits; list; list = list->next) {
list              156 list-objects.c 		struct commit *commit = list->item;
list              186 log-tree.c     	const struct name_decoration *list, *head = NULL;
list              192 log-tree.c     	for (list = decoration; list; list = list->next)
list              193 log-tree.c     		if (list->type == DECORATION_REF_HEAD) {
list              194 log-tree.c     			head = list;
list              209 log-tree.c     	for (list = decoration; list; list = list->next)
list              210 log-tree.c     		if ((list->type == DECORATION_REF_LOCAL) &&
list              211 log-tree.c     		    !strcmp(branch_name, list->name)) {
list              212 log-tree.c     			return list;
list             1877 merge-recursive.c static struct commit_list *reverse_commit_list(struct commit_list *list)
list             1880 merge-recursive.c 	for (current = list; current; current = backup) {
list                9 mergesort.c    static void *get_nth_next(void *list, unsigned long n,
list               12 mergesort.c    	while (n-- && list)
list               13 mergesort.c    		list = get_next_fn(list);
list               14 mergesort.c    	return list;
list               26 mergesort.c    void *llist_mergesort(void *list,
list               33 mergesort.c    	if (!list)
list               39 mergesort.c    		p.ptr = list;
list               46 mergesort.c    			list = curr = pop_item(&q, get_next_fn);
list               48 mergesort.c    			list = curr = pop_item(&p, get_next_fn);
list               72 mergesort.c    	return list;
list               12 mergesort.h    void *llist_mergesort(void *list,
list               61 notes-merge.c  		struct notes_merge_pair *list, int len, unsigned char *obj,
list               78 notes-merge.c  		cmp = hashcmp(obj, list[i].obj);
list              102 notes-merge.c  			memmove(list + i + 1, list + i,
list              104 notes-merge.c  			memset(list + i, 0, sizeof(struct notes_merge_pair));
list              108 notes-merge.c  	return list + i;
list              856 notes.c        static int string_list_add_note_lines(struct string_list *list,
list              879 notes.c        	string_list_split(list, data, '\n', -1);
list              934 notes.c        void string_list_add_refs_by_glob(struct string_list *list, const char *glob)
list              936 notes.c        	assert(list->strdup_strings);
list              938 notes.c        		for_each_glob_ref(string_list_add_one_ref, glob, list);
list              943 notes.c        		if (!unsorted_string_list_has_string(list, glob))
list              944 notes.c        			string_list_append(list, glob);
list              948 notes.c        void string_list_add_refs_from_colon_sep(struct string_list *list,
list              959 notes.c        		string_list_add_refs_by_glob(list, split.items[i].string);
list              284 notes.h        void string_list_add_refs_by_glob(struct string_list *list, const char *glob);
list              291 notes.h        void string_list_add_refs_from_colon_sep(struct string_list *list,
list              295 object.c       int object_list_contains(struct object_list *list, struct object *obj)
list              297 object.c       	while (list) {
list              298 object.c       		if (list->item == obj)
list              300 object.c       		list = list->next;
list              113 object.h       int object_list_contains(struct object_list *list, struct object *obj);
list               50 pack-write.c   	struct pack_idx_entry **sorted_by_sha, **list, **last;
list               58 pack-write.c   		list = sorted_by_sha;
list               68 pack-write.c   		sorted_by_sha = list = last = NULL;
list              104 pack-write.c   		struct pack_idx_entry **next = list;
list              112 pack-write.c   		list = next;
list              119 pack-write.c   	list = sorted_by_sha;
list              121 pack-write.c   		struct pack_idx_entry *obj = *list++;
list              128 pack-write.c   		    (i && !hashcmp(list[-2]->sha1, obj->sha1)))
list              137 pack-write.c   		list = sorted_by_sha;
list              139 pack-write.c   			struct pack_idx_entry *obj = *list++;
list              145 pack-write.c   		list = sorted_by_sha;
list              147 pack-write.c   			struct pack_idx_entry *obj = *list++;
list              158 pack-write.c   		list = sorted_by_sha;
list              160 pack-write.c   			struct pack_idx_entry *obj = *list++;
list              140 remote-curl.c  	struct ref *list = NULL;
list              141 remote-curl.c  	get_remote_heads(-1, heads->buf, heads->len, &list,
list              143 remote-curl.c  	return list;
list              801 remote-curl.c  	struct ref **list = &list_head;
list              823 remote-curl.c  			*list = ref;
list              824 remote-curl.c  			list = &ref->next;
list             1421 remote.c       struct ref *find_ref_by_name(const struct ref *list, const char *name)
list             1423 remote.c       	for ( ; list; list = list->next)
list             1424 remote.c       		if (!strcmp(list->name, name))
list             1425 remote.c       			return (struct ref *)list;
list             1963 remote.c       int resolve_remote_symref(struct ref *ref, struct ref *list)
list             1967 remote.c       	for (; list; list = list->next)
list             1968 remote.c       		if (!strcmp(ref->symref, list->name)) {
list             1969 remote.c       			hashcpy(ref->old_sha1, list->old_sha1);
list             1975 remote.c       static void unmark_and_free(struct commit_list *list, unsigned int mark)
list             1977 remote.c       	while (list) {
list             1978 remote.c       		struct commit_list *temp = list;
list             1980 remote.c       		list = temp->next;
list             1989 remote.c       	struct commit_list *list, *used;
list             2009 remote.c       	used = list = NULL;
list             2010 remote.c       	commit_list_insert(new, &list);
list             2011 remote.c       	while (list) {
list             2012 remote.c       		new = pop_most_recent_commit(&list, TMP_MARK);
list             2019 remote.c       	unmark_and_free(list, TMP_MARK);
list             2204 remote.c       	struct ref *list = NULL;
list             2205 remote.c       	struct ref **tail = &list;
list             2237 remote.c       	return list;
list              130 remote.h       extern struct ref *find_ref_by_name(const struct ref *list, const char *name);
list              148 remote.h       				     struct ref **list, unsigned int flags,
list              152 remote.h       int resolve_remote_symref(struct ref *ref, struct ref *list);
list              355 revision.c     	struct commit_list *list = orig;
list              363 revision.c     	while (list) {
list              364 revision.c     		struct commit *commit = list->item;
list              365 revision.c     		list = list->next;
list              414 revision.c     	struct commit_list *list = orig;
list              437 revision.c     	while (list) {
list              438 revision.c     		struct commit *commit = list->item;
list              439 revision.c     		list = list->next;
list              792 revision.c     		    struct commit_list **list, struct commit_list **cache_ptr)
list              831 revision.c     			commit_list_insert_by_date_cached(p, list, cached_base, cache_ptr);
list              858 revision.c     			commit_list_insert_by_date_cached(p, list, cached_base, cache_ptr);
list              866 revision.c     static void cherry_pick_list(struct commit_list *list, struct rev_info *revs)
list              875 revision.c     	for (p = list; p; p = p->next) {
list              894 revision.c     	for (p = list; p; p = p->next) {
list              914 revision.c     	for (p = list; p; p = p->next) {
list              939 revision.c     	for (p = list; p; p = p->next) {
list              991 revision.c     static void limit_to_ancestry(struct commit_list *bottom, struct commit_list *list)
list             1001 revision.c     	for (p = list; p; p = p->next)
list             1039 revision.c     	for (p = list; p; p = p->next) {
list             1047 revision.c     	for (p = list; p; p = p->next)
list             1062 revision.c     static struct commit_list *collect_bottom_commits(struct commit_list *list)
list             1065 revision.c     	for (elem = list; elem; elem = elem->next)
list             1072 revision.c     static void limit_left_right(struct commit_list *list, struct rev_info *revs)
list             1076 revision.c     	for (p = list; p; p = p->next) {
list             1092 revision.c     	struct commit_list *list = revs->commits;
list             1099 revision.c     		bottom = collect_bottom_commits(list);
list             1104 revision.c     	while (list) {
list             1105 revision.c     		struct commit_list *entry = list;
list             1106 revision.c     		struct commit *commit = list->item;
list             1110 revision.c     		list = list->next;
list             1118 revision.c     		if (add_parents_to_list(revs, commit, &list, NULL) < 0)
list             1124 revision.c     			slop = still_interesting(list, date, slop, &interesting_cache);
list             1129 revision.c     				*p = list;
list             1160 revision.c     		for (list = newlist; list; list = list->next) {
list             1161 revision.c     			struct commit *c = list->item;
list             2713 revision.c     	struct commit_list *list, *next;
list             2722 revision.c     	for (list = revs->commits; list; list = next) {
list             2723 revision.c     		commit = list->item;
list             2724 revision.c     		next = list->next;
list             2732 revision.c     		list = yet_to_do;
list             2735 revision.c     		while (list) {
list             2736 revision.c     			commit = list->item;
list             2737 revision.c     			next = list->next;
list             2738 revision.c     			free(list);
list             2739 revision.c     			list = next;
list             2745 revision.c     	list = revs->commits;
list             2748 revision.c     	while (list) {
list             2751 revision.c     		commit = list->item;
list             2752 revision.c     		next = list->next;
list             2753 revision.c     		free(list);
list             2754 revision.c     		list = next;
list             1233 sha1_file.c    static void report_helper(const struct string_list *list,
list             1251 sha1_file.c    		report_garbage(msg, list->items[first].string);
list             1254 sha1_file.c    static void report_pack_garbage(struct string_list *list)
list             1261 sha1_file.c    	string_list_sort(list);
list             1263 sha1_file.c    	for (i = 0; i < list->nr; i++) {
list             1264 sha1_file.c    		const char *path = list->items[i].string;
list             1266 sha1_file.c    		    strncmp(path, list->items[first].string, baselen)) {
list             1267 sha1_file.c    			report_helper(list, seen_bits, first, i);
list             1285 sha1_file.c    	report_helper(list, seen_bits, first, list->nr);
list              749 sha1_name.c    		struct commit_list *list = NULL;
list              759 sha1_name.c    		commit_list_insert((struct commit *)o, &list);
list              760 sha1_name.c    		ret = get_sha1_oneline(prefix, sha1, list);
list              851 sha1_name.c    	struct commit_list **list = cb_data;
list              862 sha1_name.c    	commit_list_insert((struct commit *)object, list);
list              867 sha1_name.c    			    struct commit_list *list)
list              882 sha1_name.c    	for (l = list; l; l = l->next) {
list              886 sha1_name.c    	while (list) {
list              891 sha1_name.c    		commit = pop_most_recent_commit(&list, ONELINE_SEEN);
list              906 sha1_name.c    	free_commit_list(list);
list             1381 sha1_name.c    			struct commit_list *list = NULL;
list             1383 sha1_name.c    			for_each_ref(handle_one_ref, &list);
list             1384 sha1_name.c    			commit_list_sort_by_date(&list);
list             1385 sha1_name.c    			return get_sha1_oneline(name + 2, sha1, list);
list                7 shortlog.h     	struct string_list list;
list                4 string-list.c  void string_list_init(struct string_list *list, int strdup_strings)
list                6 string-list.c  	memset(list, 0, sizeof(*list));
list                7 string-list.c  	list->strdup_strings = strdup_strings;
list               12 string-list.c  static int get_entry_index(const struct string_list *list, const char *string,
list               15 string-list.c  	int left = -1, right = list->nr;
list               16 string-list.c  	compare_strings_fn cmp = list->cmp ? list->cmp : strcmp;
list               20 string-list.c  		int compare = cmp(string, list->items[middle].string);
list               36 string-list.c  static int add_entry(int insert_at, struct string_list *list, const char *string)
list               39 string-list.c  	int index = insert_at != -1 ? insert_at : get_entry_index(list, string, &exact_match);
list               44 string-list.c  	if (list->nr + 1 >= list->alloc) {
list               45 string-list.c  		list->alloc += 32;
list               46 string-list.c  		REALLOC_ARRAY(list->items, list->alloc);
list               48 string-list.c  	if (index < list->nr)
list               49 string-list.c  		memmove(list->items + index + 1, list->items + index,
list               50 string-list.c  				(list->nr - index)
list               52 string-list.c  	list->items[index].string = list->strdup_strings ?
list               54 string-list.c  	list->items[index].util = NULL;
list               55 string-list.c  	list->nr++;
list               60 string-list.c  struct string_list_item *string_list_insert(struct string_list *list, const char *string)
list               62 string-list.c  	int index = add_entry(-1, list, string);
list               67 string-list.c  	return list->items + index;
list               70 string-list.c  int string_list_has_string(const struct string_list *list, const char *string)
list               73 string-list.c  	get_entry_index(list, string, &exact_match);
list               77 string-list.c  int string_list_find_insert_index(const struct string_list *list, const char *string,
list               81 string-list.c  	int index = get_entry_index(list, string, &exact_match);
list               87 string-list.c  struct string_list_item *string_list_lookup(struct string_list *list, const char *string)
list               89 string-list.c  	int exact_match, i = get_entry_index(list, string, &exact_match);
list               92 string-list.c  	return list->items + i;
list               95 string-list.c  void string_list_remove_duplicates(struct string_list *list, int free_util)
list               97 string-list.c  	if (list->nr > 1) {
list               99 string-list.c  		compare_strings_fn cmp = list->cmp ? list->cmp : strcmp;
list              100 string-list.c  		for (src = dst = 1; src < list->nr; src++) {
list              101 string-list.c  			if (!cmp(list->items[dst - 1].string, list->items[src].string)) {
list              102 string-list.c  				if (list->strdup_strings)
list              103 string-list.c  					free(list->items[src].string);
list              105 string-list.c  					free(list->items[src].util);
list              107 string-list.c  				list->items[dst++] = list->items[src];
list              109 string-list.c  		list->nr = dst;
list              113 string-list.c  int for_each_string_list(struct string_list *list,
list              117 string-list.c  	for (i = 0; i < list->nr; i++)
list              118 string-list.c  		if ((ret = fn(&list->items[i], cb_data)))
list              123 string-list.c  void filter_string_list(struct string_list *list, int free_util,
list              127 string-list.c  	for (src = 0; src < list->nr; src++) {
list              128 string-list.c  		if (want(&list->items[src], cb_data)) {
list              129 string-list.c  			list->items[dst++] = list->items[src];
list              131 string-list.c  			if (list->strdup_strings)
list              132 string-list.c  				free(list->items[src].string);
list              134 string-list.c  				free(list->items[src].util);
list              137 string-list.c  	list->nr = dst;
list              145 string-list.c  void string_list_remove_empty_items(struct string_list *list, int free_util) {
list              146 string-list.c  	filter_string_list(list, free_util, item_is_not_empty, NULL);
list              149 string-list.c  void string_list_clear(struct string_list *list, int free_util)
list              151 string-list.c  	if (list->items) {
list              153 string-list.c  		if (list->strdup_strings) {
list              154 string-list.c  			for (i = 0; i < list->nr; i++)
list              155 string-list.c  				free(list->items[i].string);
list              158 string-list.c  			for (i = 0; i < list->nr; i++)
list              159 string-list.c  				free(list->items[i].util);
list              161 string-list.c  		free(list->items);
list              163 string-list.c  	list->items = NULL;
list              164 string-list.c  	list->nr = list->alloc = 0;
list              167 string-list.c  void string_list_clear_func(struct string_list *list, string_list_clear_func_t clearfunc)
list              169 string-list.c  	if (list->items) {
list              172 string-list.c  			for (i = 0; i < list->nr; i++)
list              173 string-list.c  				clearfunc(list->items[i].util, list->items[i].string);
list              175 string-list.c  		if (list->strdup_strings) {
list              176 string-list.c  			for (i = 0; i < list->nr; i++)
list              177 string-list.c  				free(list->items[i].string);
list              179 string-list.c  		free(list->items);
list              181 string-list.c  	list->items = NULL;
list              182 string-list.c  	list->nr = list->alloc = 0;
list              195 string-list.c  struct string_list_item *string_list_append_nodup(struct string_list *list,
list              199 string-list.c  	ALLOC_GROW(list->items, list->nr + 1, list->alloc);
list              200 string-list.c  	retval = &list->items[list->nr++];
list              206 string-list.c  struct string_list_item *string_list_append(struct string_list *list,
list              210 string-list.c  			list,
list              211 string-list.c  			list->strdup_strings ? xstrdup(string) : (char *)string);
list              225 string-list.c  void string_list_sort(struct string_list *list)
list              227 string-list.c  	compare_for_qsort = list->cmp ? list->cmp : strcmp;
list              228 string-list.c  	qsort(list->items, list->nr, sizeof(*list->items), cmp_items);
list              231 string-list.c  struct string_list_item *unsorted_string_list_lookup(struct string_list *list,
list              235 string-list.c  	compare_strings_fn cmp = list->cmp ? list->cmp : strcmp;
list              237 string-list.c  	for (i = 0; i < list->nr; i++)
list              238 string-list.c  		if (!cmp(string, list->items[i].string))
list              239 string-list.c  			return list->items + i;
list              243 string-list.c  int unsorted_string_list_has_string(struct string_list *list,
list              246 string-list.c  	return unsorted_string_list_lookup(list, string) != NULL;
list              249 string-list.c  void unsorted_string_list_delete_item(struct string_list *list, int i, int free_util)
list              251 string-list.c  	if (list->strdup_strings)
list              252 string-list.c  		free(list->items[i].string);
list              254 string-list.c  		free(list->items[i].util);
list              255 string-list.c  	list->items[i] = list->items[list->nr-1];
list              256 string-list.c  	list->nr--;
list              259 string-list.c  int string_list_split(struct string_list *list, const char *string,
list              265 string-list.c  	if (!list->strdup_strings)
list              271 string-list.c  			string_list_append(list, p);
list              276 string-list.c  			string_list_append_nodup(list, xmemdupz(p, end - p));
list              279 string-list.c  			string_list_append(list, p);
list              285 string-list.c  int string_list_split_in_place(struct string_list *list, char *string,
list              291 string-list.c  	if (list->strdup_strings)
list              297 string-list.c  			string_list_append(list, p);
list              303 string-list.c  			string_list_append(list, p);
list              306 string-list.c  			string_list_append(list, p);
list               21 string-list.h  void string_list_init(struct string_list *list, int strdup_strings);
list               24 string-list.h  void string_list_clear(struct string_list *list, int free_util);
list               29 string-list.h  void string_list_clear_func(struct string_list *list, string_list_clear_func_t clearfunc);
list               33 string-list.h  int for_each_string_list(struct string_list *list,
list               35 string-list.h  #define for_each_string_list_item(item,list) \
list               36 string-list.h  	for (item = (list)->items; item < (list)->items + (list)->nr; ++item)
list               44 string-list.h  void filter_string_list(struct string_list *list, int free_util,
list               52 string-list.h  void string_list_remove_empty_items(struct string_list *list, int free_util);
list               55 string-list.h  int string_list_has_string(const struct string_list *list, const char *string);
list               56 string-list.h  int string_list_find_insert_index(const struct string_list *list, const char *string,
list               63 string-list.h  struct string_list_item *string_list_insert(struct string_list *list, const char *string);
list               69 string-list.h  struct string_list_item *string_list_lookup(struct string_list *list, const char *string);
list               86 string-list.h  struct string_list_item *string_list_append(struct string_list *list, const char *string);
list               94 string-list.h  struct string_list_item *string_list_append_nodup(struct string_list *list, char *string);
list               96 string-list.h  void string_list_sort(struct string_list *list);
list               97 string-list.h  int unsorted_string_list_has_string(struct string_list *list, const char *string);
list               98 string-list.h  struct string_list_item *unsorted_string_list_lookup(struct string_list *list,
list              101 string-list.h  void unsorted_string_list_delete_item(struct string_list *list, int i, int free_util);
list              119 string-list.h  int string_list_split(struct string_list *list, const char *string,
list              129 string-list.h  int string_list_split_in_place(struct string_list *list, char *string,
list              231 submodule.c    	struct commit_list *merge_bases, *list;
list              247 submodule.c    	for (list = merge_bases; list; list = list->next) {
list              248 submodule.c    		list->item->object.flags |= UNINTERESTING;
list              249 submodule.c    		add_pending_object(rev, &list->item->object,
list              250 submodule.c    			sha1_to_hex(list->item->object.sha1));
list               14 test-parse-options.c static struct string_list list;
list               64 test-parse-options.c 		OPT_STRING_LIST(0, "list", &list, "str", "add str to list"),
list               97 test-parse-options.c 	for (i = 0; i < list.nr; i++)
list               98 test-parse-options.c 		printf("list: %s\n", list.items[i].string);
list               10 test-string-list.c static void parse_string_list(struct string_list *list, const char *arg)
list               15 test-string-list.c 	(void)string_list_split(list, arg, ':', -1);
list               18 test-string-list.c static void write_list(const struct string_list *list)
list               21 test-string-list.c 	for (i = 0; i < list->nr; i++)
list               22 test-string-list.c 		printf("[%d]: \"%s\"\n", i, list->items[i].string);
list               25 test-string-list.c static void write_list_compact(const struct string_list *list)
list               28 test-string-list.c 	if (!list->nr)
list               31 test-string-list.c 		printf("%s", list->items[0].string);
list               32 test-string-list.c 		for (i = 1; i < list->nr; i++)
list               33 test-string-list.c 			printf(":%s", list->items[i].string);
list               47 test-string-list.c 		struct string_list list = STRING_LIST_INIT_DUP;
list               53 test-string-list.c 		i = string_list_split(&list, s, delim, maxsplit);
list               55 test-string-list.c 		write_list(&list);
list               56 test-string-list.c 		string_list_clear(&list, 0);
list               61 test-string-list.c 		struct string_list list = STRING_LIST_INIT_NODUP;
list               67 test-string-list.c 		i = string_list_split_in_place(&list, s, delim, maxsplit);
list               69 test-string-list.c 		write_list(&list);
list               70 test-string-list.c 		string_list_clear(&list, 0);
list               80 test-string-list.c 		struct string_list list = STRING_LIST_INIT_DUP;
list               83 test-string-list.c 		parse_string_list(&list, argv[2]);
list               84 test-string-list.c 		filter_string_list(&list, 0, prefix_cb, (void *)prefix);
list               85 test-string-list.c 		write_list_compact(&list);
list               86 test-string-list.c 		string_list_clear(&list, 0);
list               91 test-string-list.c 		struct string_list list = STRING_LIST_INIT_DUP;
list               93 test-string-list.c 		parse_string_list(&list, argv[2]);
list               94 test-string-list.c 		string_list_remove_duplicates(&list, 0);
list               95 test-string-list.c 		write_list_compact(&list);
list               96 test-string-list.c 		string_list_clear(&list, 0);
list               48 transport.c    	} list;
list               54 transport.c    	memset (&list, 0, sizeof(list));
list               59 transport.c    		ALLOC_GROW(list.entries, list.nr + 1, list.alloc);
list               60 transport.c    		list.entries[list.nr++] = xstrdup(de->d_name);
list               66 transport.c    	qsort(list.entries, list.nr, sizeof(char *), str_cmp);
list               71 transport.c    	for (i = 0; i < list.nr; i++, strbuf_setlen(path, pathlen + 1)) {
list               72 transport.c    		strbuf_addstr(path, list.entries[i]);
list               94 transport.c    	for (i = 0; i < list.nr; i++)
list               95 transport.c    		free(list.entries[i]);
list               96 transport.c    	free(list.entries);
list              103 transport.c    static void insert_packed_refs(const char *packed_refs, struct ref **list)
list              127 transport.c    		while ((*list)->next &&
list              129 transport.c    				      (*list)->next->name)) > 0)
list              130 transport.c    			list = &(*list)->next;
list              131 transport.c    		if (!(*list)->next || cmp < 0) {
list              139 transport.c    			next->next = (*list)->next;
list              140 transport.c    			(*list)->next = next;
list              141 transport.c    			list = &(*list)->next;
list              413 transport.c    		struct ref_list_entry *e = data->header.references.list + i;
list              319 upload-pack.c  		struct commit_list *list = work->next;
list              322 upload-pack.c  		work = list;
list              335 upload-pack.c  		for (list = commit->parents; list; list = list->next) {
list              336 upload-pack.c  			struct commit *parent = list->item;