tree_entry        416 builtin/grep.c 	while (tree_entry(tree, &entry)) {
tree_entry       1178 builtin/pack-objects.c 	while (tree_entry(tree,&entry)) {
tree_entry         86 builtin/reflog.c 	while (tree_entry(&desc, &entry)) {
tree_entry        663 cache-tree.c   	while (tree_entry(&desc, &entry)) {
tree_entry        237 fast-import.c  	struct tree_entry *entries[FLEX_ARRAY]; /* more */
tree_entry        249 fast-import.c  	struct tree_entry branch_tree;
tree_entry        780 fast-import.c  static void release_tree_entry(struct tree_entry *e);
tree_entry        809 fast-import.c  static struct tree_entry *new_tree_entry(void)
tree_entry        811 fast-import.c  	struct tree_entry *e;
tree_entry        815 fast-import.c  		total_allocd += n * sizeof(struct tree_entry);
tree_entry        816 fast-import.c  		avail_tree_entry = e = xmalloc(n * sizeof(struct tree_entry));
tree_entry        829 fast-import.c  static void release_tree_entry(struct tree_entry *e)
tree_entry        840 fast-import.c  	struct tree_entry *a, *b;
tree_entry       1333 fast-import.c  static void load_tree(struct tree_entry *root)
tree_entry       1363 fast-import.c  		struct tree_entry *e = new_tree_entry();
tree_entry       1385 fast-import.c  	struct tree_entry *a = *((struct tree_entry**)_a);
tree_entry       1386 fast-import.c  	struct tree_entry *b = *((struct tree_entry**)_b);
tree_entry       1394 fast-import.c  	struct tree_entry *a = *((struct tree_entry**)_a);
tree_entry       1395 fast-import.c  	struct tree_entry *b = *((struct tree_entry**)_b);
tree_entry       1419 fast-import.c  		struct tree_entry *e = t->entries[i];
tree_entry       1429 fast-import.c  static void store_tree(struct tree_entry *root)
tree_entry       1462 fast-import.c  		struct tree_entry *e = t->entries[i];
tree_entry       1476 fast-import.c  	struct tree_entry *root,
tree_entry       1491 fast-import.c  	struct tree_entry *root,
tree_entry       1500 fast-import.c  	struct tree_entry *e;
tree_entry       1580 fast-import.c  	struct tree_entry *root,
tree_entry       1582 fast-import.c  	struct tree_entry *backup_leaf,
tree_entry       1588 fast-import.c  	struct tree_entry *e;
tree_entry       1645 fast-import.c  	struct tree_entry *root,
tree_entry       1647 fast-import.c  	struct tree_entry *leaf,
tree_entry       1653 fast-import.c  	struct tree_entry *e;
tree_entry       2160 fast-import.c  		struct tree_entry *orig_root, struct tree_entry *root,
tree_entry       2166 fast-import.c  	struct tree_entry *e, leaf;
tree_entry       2236 fast-import.c  static uintmax_t change_note_fanout(struct tree_entry *root,
tree_entry       2415 fast-import.c  	struct tree_entry leaf;
tree_entry       3078 fast-import.c  	struct tree_entry *root = NULL;
tree_entry       3079 fast-import.c  	struct tree_entry leaf = {NULL};
tree_entry        308 fsck.c         	while (tree_entry(&desc, &entry)) {
tree_entry       1320 http-push.c    	while (tree_entry(&desc, &entry))
tree_entry        103 list-objects.c 	while (tree_entry(&desc, &entry)) {
tree_entry         86 match-trees.c  		int got_entry_from_one = tree_entry(&one, &e1);
tree_entry         87 match-trees.c  		int got_entry_from_two = tree_entry(&two, &e2);
tree_entry        431 notes.c        	while (tree_entry(&desc, &entry)) {
tree_entry        115 revision.c     	while (tree_entry(&desc, &entry)) {
tree_entry       3244 sha1_file.c    	while (tree_entry(&desc, &entry))
tree_entry         35 tree-walk.h    int tree_entry(struct tree_desc *, struct name_entry *);
tree_entry         70 tree.c         	while (tree_entry(&desc, &entry)) {
tree_entry         40 walker.c       	while (tree_entry(&desc, &entry)) {