| 395 | } |
| 396 | |
| 397 | static void update_extended_entry(struct tree_desc_x *t, struct name_entry *a) |
| 398 | { |
| 399 | if (t->d.entry.path == a->path) { |
| 400 | update_tree_entry(&t->d); |
| 401 | } else { |
| 402 | /* we have returned this entry early */ |
| 403 | struct tree_desc_skip *skip = xmalloc(sizeof(*skip)); |
| 404 | skip->ptr = a->path; |
| 405 | skip->prev = t->skip; |
| 406 | t->skip = skip; |
| 407 | } |
| 408 | } |
| 409 | |
| 410 | static void free_extended_entry(struct tree_desc_x *t) |
| 411 | { |
no test coverage detected