| 752 | } |
| 753 | |
| 754 | static int all_trees_same_as_cache_tree(int n, unsigned long dirmask, |
| 755 | struct name_entry *names, |
| 756 | struct traverse_info *info) |
| 757 | { |
| 758 | struct unpack_trees_options *o = info->data; |
| 759 | int i; |
| 760 | |
| 761 | if (!o->merge || dirmask != ((1 << n) - 1)) |
| 762 | return 0; |
| 763 | |
| 764 | for (i = 1; i < n; i++) |
| 765 | if (!are_same_oid(names, names + i)) |
| 766 | return 0; |
| 767 | |
| 768 | return cache_tree_matches_traversal(o->src_index->cache_tree, names, info); |
| 769 | } |
| 770 | |
| 771 | static int index_pos_by_traverse_info(struct name_entry *names, |
| 772 | struct traverse_info *info) |
no test coverage detected