name_entry 413 builtin/grep.c struct name_entry entry; name_entry 151 builtin/merge-tree.c static int same_entry(struct name_entry *a, struct name_entry *b) name_entry 159 builtin/merge-tree.c static int both_empty(struct name_entry *a, struct name_entry *b) name_entry 175 builtin/merge-tree.c static char *traverse_path(const struct traverse_info *info, const struct name_entry *n) name_entry 181 builtin/merge-tree.c static void resolve(const struct traverse_info *info, struct name_entry *ours, struct name_entry *result) name_entry 200 builtin/merge-tree.c struct name_entry n[3]) name_entry 203 builtin/merge-tree.c struct name_entry *p; name_entry 231 builtin/merge-tree.c static struct merge_list *link_entry(unsigned stage, const struct traverse_info *info, struct name_entry *n, struct merge_list *entry) name_entry 247 builtin/merge-tree.c static void unresolved(const struct traverse_info *info, struct name_entry n[3]) name_entry 307 builtin/merge-tree.c static int threeway_callback(int n, unsigned long mask, unsigned long dirmask, struct name_entry *entry, struct traverse_info *info) name_entry 1175 builtin/pack-objects.c struct name_entry entry; name_entry 61 builtin/reflog.c struct name_entry entry; name_entry 657 cache-tree.c struct name_entry entry; name_entry 708 cache-tree.c struct name_entry *ent, name_entry 53 cache-tree.h extern int cache_tree_matches_traversal(struct cache_tree *, struct name_entry *ent, struct traverse_info *info); name_entry 301 fsck.c struct name_entry entry; name_entry 1301 http-push.c struct name_entry entry; name_entry 72 list-objects.c struct name_entry entry; name_entry 66 match-trees.c static int base_name_entries_compare(const struct name_entry *a, name_entry 67 match-trees.c const struct name_entry *b) name_entry 85 match-trees.c struct name_entry e1, e2; name_entry 418 notes.c struct name_entry entry; name_entry 106 revision.c struct name_entry entry; name_entry 3241 sha1_file.c struct name_entry entry; name_entry 40 tree-diff.c struct name_entry *e1, *e2; name_entry 66 tree-walk.c static void entry_clear(struct name_entry *a) name_entry 71 tree-walk.c static void entry_extract(struct tree_desc *t, struct name_entry *a) name_entry 93 tree-walk.c int tree_entry(struct tree_desc *desc, struct name_entry *entry) name_entry 118 tree-walk.c char *make_traverse_path(char *path, const struct traverse_info *info, const struct name_entry *n) name_entry 212 tree-walk.c struct name_entry *a, name_entry 280 tree-walk.c static void update_extended_entry(struct tree_desc_x *t, struct name_entry *a) name_entry 303 tree-walk.c static inline int prune_traversal(struct name_entry *e, name_entry 318 tree-walk.c struct name_entry *entry = xmalloc(n*sizeof(*entry)); name_entry 338 tree-walk.c struct name_entry *e = NULL; name_entry 688 tree-walk.c const struct name_entry *entry, int pathlen, name_entry 861 tree-walk.c static enum interesting do_match(const struct name_entry *entry, name_entry 994 tree-walk.c enum interesting tree_entry_interesting(const struct name_entry *entry, name_entry 12 tree-walk.h struct name_entry entry; name_entry 23 tree-walk.h static inline int tree_entry_len(const struct name_entry *ne) name_entry 35 tree-walk.h int tree_entry(struct tree_desc *, struct name_entry *); name_entry 40 tree-walk.h typedef int (*traverse_callback_t)(int n, unsigned long mask, unsigned long dirmask, struct name_entry *entry, struct traverse_info *); name_entry 63 tree-walk.h struct name_entry name; name_entry 74 tree-walk.h extern char *make_traverse_path(char *path, const struct traverse_info *info, const struct name_entry *n); name_entry 77 tree-walk.h static inline int traverse_path_len(const struct traverse_info *info, const struct name_entry *n) name_entry 90 tree-walk.h extern enum interesting tree_entry_interesting(const struct name_entry *, name_entry 60 tree.c struct name_entry entry; name_entry 425 unpack-trees.c static int find_cache_pos(struct traverse_info *, const struct name_entry *); name_entry 455 unpack-trees.c struct name_entry *names, name_entry 462 unpack-trees.c struct name_entry *p; name_entry 501 unpack-trees.c static int do_compare_entry(const struct cache_entry *ce, const struct traverse_info *info, const struct name_entry *n) name_entry 525 unpack-trees.c static int compare_entry(const struct cache_entry *ce, const struct traverse_info *info, const struct name_entry *n) name_entry 552 unpack-trees.c static struct cache_entry *create_ce_entry(const struct traverse_info *info, const struct name_entry *n, int stage) name_entry 569 unpack-trees.c const struct name_entry *names, name_entry 641 unpack-trees.c const struct name_entry *p) name_entry 696 unpack-trees.c const struct name_entry *p) name_entry 717 unpack-trees.c static void debug_name_entry(int i, struct name_entry *n) name_entry 727 unpack-trees.c struct name_entry *names, name_entry 739 unpack-trees.c static int unpack_callback(int n, unsigned long mask, unsigned long dirmask, struct name_entry *names, struct traverse_info *info) name_entry 743 unpack-trees.c const struct name_entry *p = names; name_entry 34 walker.c struct name_entry entry;