lookup_tree      1483 builtin/am.c   		tree = lookup_tree(head);
lookup_tree      1485 builtin/am.c   		tree = lookup_tree(EMPTY_TREE_SHA1_BIN);
lookup_tree        49 builtin/diff-tree.c 	tree2 = lookup_tree(sha1);
lookup_tree       384 builtin/diff.c 					tree = lookup_tree(EMPTY_TREE_SHA1_BIN);
lookup_tree        65 builtin/reflog.c 	tree = lookup_tree(sha1);
lookup_tree       668 cache-tree.c   			struct tree *subtree = lookup_tree(entry.sha1);
lookup_tree       334 commit.c       	item->tree = lookup_tree(parent.hash);
lookup_tree       314 fsck.c         			result = options->walk(&lookup_tree(entry.sha1)->object, OBJ_TREE, data, options);
lookup_tree      1323 http-push.c    			p = process_tree(lookup_tree(entry.sha1), p, &me, name);
lookup_tree       115 list-objects.c 				     lookup_tree(entry.sha1),
lookup_tree        39 merge-recursive.c 	return lookup_tree(shifted);
lookup_tree       272 merge-recursive.c 	result = lookup_tree(active_cache_tree->sha1);
lookup_tree      1928 merge-recursive.c 		tree = lookup_tree(EMPTY_TREE_SHA1_BIN);
lookup_tree       199 object.c       		struct tree *tree = lookup_tree(sha1);
lookup_tree        89 reachable.c    		obj = (struct object *)lookup_tree(sha1);
lookup_tree       118 revision.c     			mark_tree_uninteresting(lookup_tree(entry.sha1));
lookup_tree      1326 revision.c     		struct tree *tree = lookup_tree(it->sha1);
lookup_tree       207 sequencer.c    	return lookup_tree(EMPTY_TREE_SHA1_BIN);
lookup_tree        92 tag.c          		item->tagged = &lookup_tree(sha1)->object;
lookup_tree       113 tree.c         		retval = read_tree_1(lookup_tree(sha1),
lookup_tree        15 tree.h         struct tree *lookup_tree(const unsigned char *sha1);
lookup_tree        47 walker.c       			struct tree *tree = lookup_tree(entry.sha1);