| 1049 | } |
| 1050 | |
| 1051 | static int ce_in_traverse_path(const struct cache_entry *ce, |
| 1052 | const struct traverse_info *info) |
| 1053 | { |
| 1054 | if (!info->prev) |
| 1055 | return 1; |
| 1056 | if (do_compare_entry(ce, info->prev, |
| 1057 | info->name, info->namelen, info->mode)) |
| 1058 | return 0; |
| 1059 | /* |
| 1060 | * If ce (blob) is the same name as the path (which is a tree |
| 1061 | * we will be descending into), it won't be inside it. |
| 1062 | */ |
| 1063 | return (info->pathlen < ce_namelen(ce)); |
| 1064 | } |
| 1065 | |
| 1066 | static struct cache_entry *create_ce_entry(const struct traverse_info *info, |
| 1067 | const struct name_entry *n, |
no test coverage detected