2 * Copyright (C) the libgit2 contributors. All rights reserved.
4 * This file is part of libgit2, distributed under the GNU GPL v2 with
5 * a Linking Exception. For full terms see the included COPYING file.
11 #include "git2/repository.h"
12 #include "git2/object.h"
14 #include "tree-cache.h"
17 #define DEFAULT_TREE_SIZE 16
18 #define MAX_FILEMODE_BYTES 6
20 #define TREE_ENTRY_CHECK_NAMELEN(n) \
21 if (n > UINT16_MAX) { giterr_set(GITERR_INVALID, "tree entry path too long"); }
25 static bool valid_filemode(const int filemode
)
27 return (filemode
== GIT_FILEMODE_TREE
28 || filemode
== GIT_FILEMODE_BLOB
29 || filemode
== GIT_FILEMODE_BLOB_EXECUTABLE
30 || filemode
== GIT_FILEMODE_LINK
31 || filemode
== GIT_FILEMODE_COMMIT
);
34 GIT_INLINE(git_filemode_t
) normalize_filemode(git_filemode_t filemode
)
36 /* Tree bits set, but it's not a commit */
37 if (GIT_MODE_TYPE(filemode
) == GIT_FILEMODE_TREE
)
38 return GIT_FILEMODE_TREE
;
40 /* If any of the x bits are set */
41 if (GIT_PERMS_IS_EXEC(filemode
))
42 return GIT_FILEMODE_BLOB_EXECUTABLE
;
44 /* 16XXXX means commit */
45 if (GIT_MODE_TYPE(filemode
) == GIT_FILEMODE_COMMIT
)
46 return GIT_FILEMODE_COMMIT
;
48 /* 12XXXX means commit */
49 if (GIT_MODE_TYPE(filemode
) == GIT_FILEMODE_LINK
)
50 return GIT_FILEMODE_LINK
;
52 /* Otherwise, return a blob */
53 return GIT_FILEMODE_BLOB
;
56 static int valid_entry_name(git_repository
*repo
, const char *filename
)
58 return *filename
!= '\0' &&
59 git_path_isvalid(repo
, filename
,
60 GIT_PATH_REJECT_TRAVERSAL
| GIT_PATH_REJECT_DOT_GIT
| GIT_PATH_REJECT_SLASH
);
63 static int entry_sort_cmp(const void *a
, const void *b
)
65 const git_tree_entry
*e1
= (const git_tree_entry
*)a
;
66 const git_tree_entry
*e2
= (const git_tree_entry
*)b
;
69 e1
->filename
, e1
->filename_len
, git_tree_entry__is_tree(e1
),
70 e2
->filename
, e2
->filename_len
, git_tree_entry__is_tree(e2
),
74 int git_tree_entry_cmp(const git_tree_entry
*e1
, const git_tree_entry
*e2
)
76 return entry_sort_cmp(e1
, e2
);
79 int git_tree_entry_icmp(const git_tree_entry
*e1
, const git_tree_entry
*e2
)
82 e1
->filename
, e1
->filename_len
, git_tree_entry__is_tree(e1
),
83 e2
->filename
, e2
->filename_len
, git_tree_entry__is_tree(e2
),
88 * Allocate a new self-contained entry, with enough space after it to
89 * store the filename and the id.
91 static git_tree_entry
*alloc_entry(const char *filename
, size_t filename_len
, const git_oid
*id
)
93 git_tree_entry
*entry
= NULL
;
96 TREE_ENTRY_CHECK_NAMELEN(filename_len
);
98 if (GIT_ADD_SIZET_OVERFLOW(&tree_len
, sizeof(git_tree_entry
), filename_len
) ||
99 GIT_ADD_SIZET_OVERFLOW(&tree_len
, tree_len
, 1) ||
100 GIT_ADD_SIZET_OVERFLOW(&tree_len
, tree_len
, GIT_OID_RAWSZ
))
103 entry
= git__calloc(1, tree_len
);
111 filename_ptr
= ((char *) entry
) + sizeof(git_tree_entry
);
112 memcpy(filename_ptr
, filename
, filename_len
);
113 entry
->filename
= filename_ptr
;
115 id_ptr
= filename_ptr
+ filename_len
+ 1;
116 git_oid_cpy(id_ptr
, id
);
120 entry
->filename_len
= (uint16_t)filename_len
;
125 struct tree_key_search
{
126 const char *filename
;
127 uint16_t filename_len
;
130 static int homing_search_cmp(const void *key
, const void *array_member
)
132 const struct tree_key_search
*ksearch
= key
;
133 const git_tree_entry
*entry
= array_member
;
135 const uint16_t len1
= ksearch
->filename_len
;
136 const uint16_t len2
= entry
->filename_len
;
141 len1
< len2
? len1
: len2
146 * Search for an entry in a given tree.
148 * Note that this search is performed in two steps because
149 * of the way tree entries are sorted internally in git:
151 * Entries in a tree are not sorted alphabetically; two entries
152 * with the same root prefix will have different positions
153 * depending on whether they are folders (subtrees) or normal files.
155 * Consequently, it is not possible to find an entry on the tree
156 * with a binary search if you don't know whether the filename
157 * you're looking for is a folder or a normal file.
159 * To work around this, we first perform a homing binary search
160 * on the tree, using the minimal length root prefix of our filename.
161 * Once the comparisons for this homing search start becoming
162 * ambiguous because of folder vs file sorting, we look linearly
163 * around the area for our target file.
165 static int tree_key_search(
166 size_t *at_pos
, git_vector
*entries
, const char *filename
, size_t filename_len
)
168 struct tree_key_search ksearch
;
169 const git_tree_entry
*entry
;
172 TREE_ENTRY_CHECK_NAMELEN(filename_len
);
174 ksearch
.filename
= filename
;
175 ksearch
.filename_len
= (uint16_t)filename_len
;
177 /* Initial homing search; find an entry on the tree with
178 * the same prefix as the filename we're looking for */
179 if (git_vector_bsearch2(&homing
, entries
, &homing_search_cmp
, &ksearch
) < 0)
180 return GIT_ENOTFOUND
; /* just a signal error; not passed back to user */
182 /* We found a common prefix. Look forward as long as
183 * there are entries that share the common prefix */
184 for (i
= homing
; i
< entries
->length
; ++i
) {
185 entry
= entries
->contents
[i
];
187 if (homing_search_cmp(&ksearch
, entry
) < 0)
190 if (entry
->filename_len
== filename_len
&&
191 memcmp(filename
, entry
->filename
, filename_len
) == 0) {
199 /* If we haven't found our filename yet, look backwards
200 * too as long as we have entries with the same prefix */
205 entry
= entries
->contents
[i
];
207 if (homing_search_cmp(&ksearch
, entry
) > 0)
210 if (entry
->filename_len
== filename_len
&&
211 memcmp(filename
, entry
->filename
, filename_len
) == 0) {
220 /* The filename doesn't exist at all */
221 return GIT_ENOTFOUND
;
224 void git_tree_entry_free(git_tree_entry
*entry
)
232 int git_tree_entry_dup(git_tree_entry
**dest
, const git_tree_entry
*source
)
238 cpy
= alloc_entry(source
->filename
, source
->filename_len
, source
->oid
);
242 cpy
->attr
= source
->attr
;
248 void git_tree__free(void *_tree
)
250 git_tree
*tree
= _tree
;
252 git_odb_object_free(tree
->odb_obj
);
253 git_vector_free(&tree
->entries
);
254 git_array_clear(tree
->entries_arr
);
258 git_filemode_t
git_tree_entry_filemode(const git_tree_entry
*entry
)
260 return normalize_filemode(entry
->attr
);
263 git_filemode_t
git_tree_entry_filemode_raw(const git_tree_entry
*entry
)
268 const char *git_tree_entry_name(const git_tree_entry
*entry
)
271 return entry
->filename
;
274 const git_oid
*git_tree_entry_id(const git_tree_entry
*entry
)
280 git_otype
git_tree_entry_type(const git_tree_entry
*entry
)
284 if (S_ISGITLINK(entry
->attr
))
285 return GIT_OBJ_COMMIT
;
286 else if (S_ISDIR(entry
->attr
))
292 int git_tree_entry_to_object(
293 git_object
**object_out
,
294 git_repository
*repo
,
295 const git_tree_entry
*entry
)
297 assert(entry
&& object_out
);
298 return git_object_lookup(object_out
, repo
, entry
->oid
, GIT_OBJ_ANY
);
301 static const git_tree_entry
*entry_fromname(
302 const git_tree
*tree
, const char *name
, size_t name_len
)
306 /* be safe when we cast away constness - i.e. don't trigger a sort */
307 assert(git_vector_is_sorted(&tree
->entries
));
309 if (tree_key_search(&idx
, (git_vector
*)&tree
->entries
, name
, name_len
) < 0)
312 return git_vector_get(&tree
->entries
, idx
);
315 const git_tree_entry
*git_tree_entry_byname(
316 const git_tree
*tree
, const char *filename
)
318 assert(tree
&& filename
);
320 return entry_fromname(tree
, filename
, strlen(filename
));
323 const git_tree_entry
*git_tree_entry_byindex(
324 const git_tree
*tree
, size_t idx
)
327 return git_vector_get(&tree
->entries
, idx
);
330 const git_tree_entry
*git_tree_entry_byid(
331 const git_tree
*tree
, const git_oid
*id
)
334 const git_tree_entry
*e
;
338 git_vector_foreach(&tree
->entries
, i
, e
) {
339 if (memcmp(&e
->oid
->id
, &id
->id
, sizeof(id
->id
)) == 0)
346 int git_tree__prefix_position(const git_tree
*tree
, const char *path
)
348 const git_vector
*entries
= &tree
->entries
;
349 struct tree_key_search ksearch
;
350 size_t at_pos
, path_len
;
355 path_len
= strlen(path
);
356 TREE_ENTRY_CHECK_NAMELEN(path_len
);
358 ksearch
.filename
= path
;
359 ksearch
.filename_len
= (uint16_t)path_len
;
361 /* be safe when we cast away constness - i.e. don't trigger a sort */
362 assert(git_vector_is_sorted(&tree
->entries
));
364 /* Find tree entry with appropriate prefix */
366 &at_pos
, (git_vector
*)entries
, &homing_search_cmp
, &ksearch
);
368 for (; at_pos
< entries
->length
; ++at_pos
) {
369 const git_tree_entry
*entry
= entries
->contents
[at_pos
];
370 if (homing_search_cmp(&ksearch
, entry
) < 0)
374 for (; at_pos
> 0; --at_pos
) {
375 const git_tree_entry
*entry
= entries
->contents
[at_pos
- 1];
376 if (homing_search_cmp(&ksearch
, entry
) > 0)
383 size_t git_tree_entrycount(const git_tree
*tree
)
386 return tree
->entries
.length
;
389 unsigned int git_treebuilder_entrycount(git_treebuilder
*bld
)
393 return git_strmap_num_entries(bld
->map
);
396 static int tree_error(const char *str
, const char *path
)
399 giterr_set(GITERR_TREE
, "%s - %s", str
, path
);
401 giterr_set(GITERR_TREE
, "%s", str
);
405 static int parse_mode(unsigned int *modep
, const char *buffer
, const char **buffer_out
)
408 unsigned int mode
= 0;
413 while ((c
= *buffer
++) != ' ') {
414 if (c
< '0' || c
> '7')
416 mode
= (mode
<< 3) + (c
- '0');
419 *buffer_out
= buffer
;
424 int git_tree__parse(void *_tree
, git_odb_object
*odb_obj
)
427 git_tree
*tree
= _tree
;
429 const char *buffer_end
;
431 if (git_odb_object_dup(&tree
->odb_obj
, odb_obj
) < 0)
434 buffer
= git_odb_object_data(tree
->odb_obj
);
435 buffer_end
= buffer
+ git_odb_object_size(tree
->odb_obj
);
437 git_array_init_to_size(tree
->entries_arr
, DEFAULT_TREE_SIZE
);
438 GITERR_CHECK_ARRAY(tree
->entries_arr
);
440 while (buffer
< buffer_end
) {
441 git_tree_entry
*entry
;
446 if (parse_mode(&attr
, buffer
, &buffer
) < 0 || !buffer
)
447 return tree_error("Failed to parse tree. Can't parse filemode", NULL
);
449 if ((nul
= memchr(buffer
, 0, buffer_end
- buffer
)) == NULL
)
450 return tree_error("Failed to parse tree. Object is corrupted", NULL
);
452 filename_len
= nul
- buffer
;
453 /** Allocate the entry and store it in the entries vector */
455 entry
= git_array_alloc(tree
->entries_arr
);
456 GITERR_CHECK_ALLOC(entry
);
459 entry
->filename_len
= filename_len
;
460 entry
->filename
= buffer
;
461 entry
->oid
= (git_oid
*) ((char *) buffer
+ filename_len
+ 1);
464 buffer
+= filename_len
+ 1;
465 buffer
+= GIT_OID_RAWSZ
;
468 /* Add the entries to the vector here, as we may reallocate during the loop */
469 if (git_vector_init(&tree
->entries
, tree
->entries_arr
.size
, entry_sort_cmp
) < 0)
472 for (i
= 0; i
< tree
->entries_arr
.size
; i
++) {
473 if (git_vector_insert(&tree
->entries
, git_array_get(tree
->entries_arr
, i
)) < 0)
477 /* The tree is sorted by definition. Bad inputs give bad outputs */
478 tree
->entries
.flags
|= GIT_VECTOR_SORTED
;
483 static size_t find_next_dir(const char *dirname
, git_index
*index
, size_t start
)
485 size_t dirlen
, i
, entries
= git_index_entrycount(index
);
487 dirlen
= strlen(dirname
);
488 for (i
= start
; i
< entries
; ++i
) {
489 const git_index_entry
*entry
= git_index_get_byindex(index
, i
);
490 if (strlen(entry
->path
) < dirlen
||
491 memcmp(entry
->path
, dirname
, dirlen
) ||
492 (dirlen
> 0 && entry
->path
[dirlen
] != '/')) {
500 static int append_entry(
501 git_treebuilder
*bld
,
502 const char *filename
,
504 git_filemode_t filemode
)
506 git_tree_entry
*entry
;
509 if (!valid_entry_name(bld
->repo
, filename
))
510 return tree_error("Failed to insert entry. Invalid name for a tree entry", filename
);
512 entry
= alloc_entry(filename
, strlen(filename
), id
);
513 GITERR_CHECK_ALLOC(entry
);
515 entry
->attr
= (uint16_t)filemode
;
517 git_strmap_insert(bld
->map
, entry
->filename
, entry
, error
);
519 git_tree_entry_free(entry
);
520 giterr_set(GITERR_TREE
, "failed to append entry %s to the tree builder", filename
);
527 static int write_tree(
529 git_repository
*repo
,
534 git_treebuilder
*bld
= NULL
;
535 size_t i
, entries
= git_index_entrycount(index
);
537 size_t dirname_len
= strlen(dirname
);
538 const git_tree_cache
*cache
;
540 cache
= git_tree_cache_get(index
->tree
, dirname
);
541 if (cache
!= NULL
&& cache
->entry_count
>= 0){
542 git_oid_cpy(oid
, &cache
->oid
);
543 return (int)find_next_dir(dirname
, index
, start
);
546 if ((error
= git_treebuilder_new(&bld
, repo
, NULL
)) < 0 || bld
== NULL
)
550 * This loop is unfortunate, but necessary. The index doesn't have
551 * any directores, so we need to handle that manually, and we
552 * need to keep track of the current position.
554 for (i
= start
; i
< entries
; ++i
) {
555 const git_index_entry
*entry
= git_index_get_byindex(index
, i
);
556 const char *filename
, *next_slash
;
559 * If we've left our (sub)tree, exit the loop and return. The
560 * first check is an early out (and security for the
561 * third). The second check is a simple prefix comparison. The
562 * third check catches situations where there is a directory
563 * win32/sys and a file win32mmap.c. Without it, the following
564 * code believes there is a file win32/mmap.c
566 if (strlen(entry
->path
) < dirname_len
||
567 memcmp(entry
->path
, dirname
, dirname_len
) ||
568 (dirname_len
> 0 && entry
->path
[dirname_len
] != '/')) {
572 filename
= entry
->path
+ dirname_len
;
573 if (*filename
== '/')
575 next_slash
= strchr(filename
, '/');
579 char *subdir
, *last_comp
;
581 subdir
= git__strndup(entry
->path
, next_slash
- entry
->path
);
582 GITERR_CHECK_ALLOC(subdir
);
584 /* Write out the subtree */
585 written
= write_tree(&sub_oid
, repo
, index
, subdir
, i
);
590 i
= written
- 1; /* -1 because of the loop increment */
594 * We need to figure out what we want toinsert
595 * into this tree. If we're traversing
596 * deps/zlib/, then we only want to write
597 * 'zlib' into the tree.
599 last_comp
= strrchr(subdir
, '/');
601 last_comp
++; /* Get rid of the '/' */
606 error
= append_entry(bld
, last_comp
, &sub_oid
, S_IFDIR
);
611 error
= append_entry(bld
, filename
, &entry
->id
, entry
->mode
);
617 if (git_treebuilder_write(oid
, bld
) < 0)
620 git_treebuilder_free(bld
);
624 git_treebuilder_free(bld
);
628 int git_tree__write_index(
629 git_oid
*oid
, git_index
*index
, git_repository
*repo
)
633 bool old_ignore_case
= false;
635 assert(oid
&& index
&& repo
);
637 if (git_index_has_conflicts(index
)) {
638 giterr_set(GITERR_INDEX
,
639 "Cannot create a tree from a not fully merged index.");
640 return GIT_EUNMERGED
;
643 if (index
->tree
!= NULL
&& index
->tree
->entry_count
>= 0) {
644 git_oid_cpy(oid
, &index
->tree
->oid
);
648 /* The tree cache didn't help us; we'll have to write
649 * out a tree. If the index is ignore_case, we must
650 * make it case-sensitive for the duration of the tree-write
653 if (index
->ignore_case
) {
654 old_ignore_case
= true;
655 git_index__set_ignore_case(index
, false);
658 ret
= write_tree(oid
, repo
, index
, "", 0);
661 git_index__set_ignore_case(index
, true);
668 git_pool_clear(&index
->tree_pool
);
670 if ((ret
= git_tree_lookup(&tree
, repo
, oid
)) < 0)
673 /* Read the tree cache into the index */
674 ret
= git_tree_cache_read_tree(&index
->tree
, tree
, &index
->tree_pool
);
680 int git_treebuilder_new(
681 git_treebuilder
**builder_p
,
682 git_repository
*repo
,
683 const git_tree
*source
)
685 git_treebuilder
*bld
;
688 assert(builder_p
&& repo
);
690 bld
= git__calloc(1, sizeof(git_treebuilder
));
691 GITERR_CHECK_ALLOC(bld
);
695 if (git_strmap_alloc(&bld
->map
) < 0) {
700 if (source
!= NULL
) {
701 git_tree_entry
*entry_src
;
703 git_vector_foreach(&source
->entries
, i
, entry_src
) {
705 bld
, entry_src
->filename
,
707 entry_src
->attr
) < 0)
716 git_treebuilder_free(bld
);
720 static git_otype
otype_from_mode(git_filemode_t filemode
)
723 case GIT_FILEMODE_TREE
:
725 case GIT_FILEMODE_COMMIT
:
726 return GIT_OBJ_COMMIT
;
732 int git_treebuilder_insert(
733 const git_tree_entry
**entry_out
,
734 git_treebuilder
*bld
,
735 const char *filename
,
737 git_filemode_t filemode
)
739 git_tree_entry
*entry
;
743 assert(bld
&& id
&& filename
);
745 if (!valid_filemode(filemode
))
746 return tree_error("Failed to insert entry. Invalid filemode for file", filename
);
748 if (!valid_entry_name(bld
->repo
, filename
))
749 return tree_error("Failed to insert entry. Invalid name for a tree entry", filename
);
751 if (filemode
!= GIT_FILEMODE_COMMIT
&&
752 !git_object__is_valid(bld
->repo
, id
, otype_from_mode(filemode
)))
753 return tree_error("Failed to insert entry; invalid object specified", filename
);
755 pos
= git_strmap_lookup_index(bld
->map
, filename
);
756 if (git_strmap_valid_index(bld
->map
, pos
)) {
757 entry
= git_strmap_value_at(bld
->map
, pos
);
758 git_oid_cpy((git_oid
*) entry
->oid
, id
);
760 entry
= alloc_entry(filename
, strlen(filename
), id
);
761 GITERR_CHECK_ALLOC(entry
);
763 git_strmap_insert(bld
->map
, entry
->filename
, entry
, error
);
766 git_tree_entry_free(entry
);
767 giterr_set(GITERR_TREE
, "failed to insert %s", filename
);
772 entry
->attr
= filemode
;
780 static git_tree_entry
*treebuilder_get(git_treebuilder
*bld
, const char *filename
)
782 git_tree_entry
*entry
= NULL
;
785 assert(bld
&& filename
);
787 pos
= git_strmap_lookup_index(bld
->map
, filename
);
788 if (git_strmap_valid_index(bld
->map
, pos
))
789 entry
= git_strmap_value_at(bld
->map
, pos
);
794 const git_tree_entry
*git_treebuilder_get(git_treebuilder
*bld
, const char *filename
)
796 return treebuilder_get(bld
, filename
);
799 int git_treebuilder_remove(git_treebuilder
*bld
, const char *filename
)
801 git_tree_entry
*entry
= treebuilder_get(bld
, filename
);
804 return tree_error("Failed to remove entry. File isn't in the tree", filename
);
806 git_strmap_delete(bld
->map
, filename
);
807 git_tree_entry_free(entry
);
812 int git_treebuilder_write(git_oid
*oid
, git_treebuilder
*bld
)
815 size_t i
, entrycount
;
816 git_buf tree
= GIT_BUF_INIT
;
818 git_tree_entry
*entry
;
823 entrycount
= git_strmap_num_entries(bld
->map
);
824 if (git_vector_init(&entries
, entrycount
, entry_sort_cmp
) < 0)
827 git_strmap_foreach_value(bld
->map
, entry
, {
828 if (git_vector_insert(&entries
, entry
) < 0)
832 git_vector_sort(&entries
);
834 /* Grow the buffer beforehand to an estimated size */
835 error
= git_buf_grow(&tree
, entrycount
* 72);
837 for (i
= 0; i
< entries
.length
&& !error
; ++i
) {
838 git_tree_entry
*entry
= git_vector_get(&entries
, i
);
840 git_buf_printf(&tree
, "%o ", entry
->attr
);
841 git_buf_put(&tree
, entry
->filename
, entry
->filename_len
+ 1);
842 git_buf_put(&tree
, (char *)entry
->oid
->id
, GIT_OID_RAWSZ
);
844 if (git_buf_oom(&tree
))
848 git_vector_free(&entries
);
851 !(error
= git_repository_odb__weakptr(&odb
, bld
->repo
)))
852 error
= git_odb_write(oid
, odb
, tree
.ptr
, tree
.size
, GIT_OBJ_TREE
);
858 void git_treebuilder_filter(
859 git_treebuilder
*bld
,
860 git_treebuilder_filter_cb filter
,
863 const char *filename
;
864 git_tree_entry
*entry
;
866 assert(bld
&& filter
);
868 git_strmap_foreach(bld
->map
, filename
, entry
, {
869 if (filter(entry
, payload
)) {
870 git_strmap_delete(bld
->map
, filename
);
871 git_tree_entry_free(entry
);
876 void git_treebuilder_clear(git_treebuilder
*bld
)
882 git_strmap_foreach_value(bld
->map
, e
, git_tree_entry_free(e
));
883 git_strmap_clear(bld
->map
);
886 void git_treebuilder_free(git_treebuilder
*bld
)
891 git_treebuilder_clear(bld
);
892 git_strmap_free(bld
->map
);
896 static size_t subpath_len(const char *path
)
898 const char *slash_pos
= strchr(path
, '/');
899 if (slash_pos
== NULL
)
902 return slash_pos
- path
;
905 int git_tree_entry_bypath(
906 git_tree_entry
**entry_out
,
907 const git_tree
*root
,
912 const git_tree_entry
*entry
;
915 /* Find how long is the current path component (i.e.
916 * the filename between two slashes */
917 filename_len
= subpath_len(path
);
919 if (filename_len
== 0) {
920 giterr_set(GITERR_TREE
, "Invalid tree path given");
921 return GIT_ENOTFOUND
;
924 entry
= entry_fromname(root
, path
, filename_len
);
927 giterr_set(GITERR_TREE
,
928 "the path '%.*s' does not exist in the given tree", filename_len
, path
);
929 return GIT_ENOTFOUND
;
932 switch (path
[filename_len
]) {
934 /* If there are more components in the path...
935 * then this entry *must* be a tree */
936 if (!git_tree_entry__is_tree(entry
)) {
937 giterr_set(GITERR_TREE
,
938 "the path '%.*s' exists but is not a tree", filename_len
, path
);
939 return GIT_ENOTFOUND
;
942 /* If there's only a slash left in the path, we
943 * return the current entry; otherwise, we keep
944 * walking down the path */
945 if (path
[filename_len
+ 1] != '\0')
949 /* If there are no more components in the path, return
951 return git_tree_entry_dup(entry_out
, entry
);
954 if (git_tree_lookup(&subtree
, root
->object
.repo
, entry
->oid
) < 0)
957 error
= git_tree_entry_bypath(
960 path
+ filename_len
+ 1
963 git_tree_free(subtree
);
967 static int tree_walk(
968 const git_tree
*tree
,
969 git_treewalk_cb callback
,
976 const git_tree_entry
*entry
;
978 git_vector_foreach(&tree
->entries
, i
, entry
) {
980 error
= callback(path
->ptr
, entry
, payload
);
981 if (error
< 0) { /* negative value stops iteration */
982 giterr_set_after_callback_function(error
, "git_tree_walk");
985 if (error
> 0) { /* positive value skips this entry */
991 if (git_tree_entry__is_tree(entry
)) {
993 size_t path_len
= git_buf_len(path
);
995 error
= git_tree_lookup(&subtree
, tree
->object
.repo
, entry
->oid
);
999 /* append the next entry to the path */
1000 git_buf_puts(path
, entry
->filename
);
1001 git_buf_putc(path
, '/');
1003 if (git_buf_oom(path
))
1006 error
= tree_walk(subtree
, callback
, path
, payload
, preorder
);
1008 git_tree_free(subtree
);
1012 git_buf_truncate(path
, path_len
);
1016 error
= callback(path
->ptr
, entry
, payload
);
1017 if (error
< 0) { /* negative value stops iteration */
1018 giterr_set_after_callback_function(error
, "git_tree_walk");
1029 const git_tree
*tree
,
1030 git_treewalk_mode mode
,
1031 git_treewalk_cb callback
,
1035 git_buf root_path
= GIT_BUF_INIT
;
1037 if (mode
!= GIT_TREEWALK_POST
&& mode
!= GIT_TREEWALK_PRE
) {
1038 giterr_set(GITERR_INVALID
, "Invalid walking mode for tree walk");
1043 tree
, callback
, &root_path
, payload
, (mode
== GIT_TREEWALK_PRE
));
1045 git_buf_free(&root_path
);