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 symlink */
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(
167 const git_tree
*tree
,
168 const char *filename
,
171 struct tree_key_search ksearch
;
172 const git_tree_entry
*entry
;
175 TREE_ENTRY_CHECK_NAMELEN(filename_len
);
177 ksearch
.filename
= filename
;
178 ksearch
.filename_len
= (uint16_t)filename_len
;
180 /* Initial homing search; find an entry on the tree with
181 * the same prefix as the filename we're looking for */
183 if (git_array_search(&homing
,
184 tree
->entries
, &homing_search_cmp
, &ksearch
) < 0)
185 return GIT_ENOTFOUND
; /* just a signal error; not passed back to user */
187 /* We found a common prefix. Look forward as long as
188 * there are entries that share the common prefix */
189 for (i
= homing
; i
< tree
->entries
.size
; ++i
) {
190 entry
= git_array_get(tree
->entries
, i
);
192 if (homing_search_cmp(&ksearch
, entry
) < 0)
195 if (entry
->filename_len
== filename_len
&&
196 memcmp(filename
, entry
->filename
, filename_len
) == 0) {
204 /* If we haven't found our filename yet, look backwards
205 * too as long as we have entries with the same prefix */
210 entry
= git_array_get(tree
->entries
, i
);
212 if (homing_search_cmp(&ksearch
, entry
) > 0)
215 if (entry
->filename_len
== filename_len
&&
216 memcmp(filename
, entry
->filename
, filename_len
) == 0) {
225 /* The filename doesn't exist at all */
226 return GIT_ENOTFOUND
;
229 void git_tree_entry_free(git_tree_entry
*entry
)
237 int git_tree_entry_dup(git_tree_entry
**dest
, const git_tree_entry
*source
)
243 cpy
= alloc_entry(source
->filename
, source
->filename_len
, source
->oid
);
247 cpy
->attr
= source
->attr
;
253 void git_tree__free(void *_tree
)
255 git_tree
*tree
= _tree
;
257 git_odb_object_free(tree
->odb_obj
);
258 git_array_clear(tree
->entries
);
262 git_filemode_t
git_tree_entry_filemode(const git_tree_entry
*entry
)
264 return normalize_filemode(entry
->attr
);
267 git_filemode_t
git_tree_entry_filemode_raw(const git_tree_entry
*entry
)
272 const char *git_tree_entry_name(const git_tree_entry
*entry
)
275 return entry
->filename
;
278 const git_oid
*git_tree_entry_id(const git_tree_entry
*entry
)
284 git_otype
git_tree_entry_type(const git_tree_entry
*entry
)
288 if (S_ISGITLINK(entry
->attr
))
289 return GIT_OBJ_COMMIT
;
290 else if (S_ISDIR(entry
->attr
))
296 int git_tree_entry_to_object(
297 git_object
**object_out
,
298 git_repository
*repo
,
299 const git_tree_entry
*entry
)
301 assert(entry
&& object_out
);
302 return git_object_lookup(object_out
, repo
, entry
->oid
, GIT_OBJ_ANY
);
305 static const git_tree_entry
*entry_fromname(
306 const git_tree
*tree
, const char *name
, size_t name_len
)
310 if (tree_key_search(&idx
, tree
, name
, name_len
) < 0)
313 return git_array_get(tree
->entries
, idx
);
316 const git_tree_entry
*git_tree_entry_byname(
317 const git_tree
*tree
, const char *filename
)
319 assert(tree
&& filename
);
321 return entry_fromname(tree
, filename
, strlen(filename
));
324 const git_tree_entry
*git_tree_entry_byindex(
325 const git_tree
*tree
, size_t idx
)
328 return git_array_get(tree
->entries
, idx
);
331 const git_tree_entry
*git_tree_entry_byid(
332 const git_tree
*tree
, const git_oid
*id
)
335 const git_tree_entry
*e
;
339 git_array_foreach(tree
->entries
, i
, e
) {
340 if (memcmp(&e
->oid
->id
, &id
->id
, sizeof(id
->id
)) == 0)
347 int git_tree__prefix_position(const git_tree
*tree
, const char *path
)
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 /* Find tree entry with appropriate prefix */
363 &at_pos
, tree
->entries
, &homing_search_cmp
, &ksearch
);
365 for (; at_pos
< tree
->entries
.size
; ++at_pos
) {
366 const git_tree_entry
*entry
= git_array_get(tree
->entries
, at_pos
);
367 if (homing_search_cmp(&ksearch
, entry
) < 0)
371 for (; at_pos
> 0; --at_pos
) {
372 const git_tree_entry
*entry
=
373 git_array_get(tree
->entries
, at_pos
- 1);
375 if (homing_search_cmp(&ksearch
, entry
) > 0)
382 size_t git_tree_entrycount(const git_tree
*tree
)
385 return tree
->entries
.size
;
388 unsigned int git_treebuilder_entrycount(git_treebuilder
*bld
)
392 return git_strmap_num_entries(bld
->map
);
395 static int tree_error(const char *str
, const char *path
)
398 giterr_set(GITERR_TREE
, "%s - %s", str
, path
);
400 giterr_set(GITERR_TREE
, "%s", str
);
404 static int parse_mode(unsigned int *modep
, const char *buffer
, const char **buffer_out
)
407 unsigned int mode
= 0;
412 while ((c
= *buffer
++) != ' ') {
413 if (c
< '0' || c
> '7')
415 mode
= (mode
<< 3) + (c
- '0');
418 *buffer_out
= buffer
;
423 int git_tree__parse(void *_tree
, git_odb_object
*odb_obj
)
425 git_tree
*tree
= _tree
;
427 const char *buffer_end
;
429 if (git_odb_object_dup(&tree
->odb_obj
, odb_obj
) < 0)
432 buffer
= git_odb_object_data(tree
->odb_obj
);
433 buffer_end
= buffer
+ git_odb_object_size(tree
->odb_obj
);
435 git_array_init_to_size(tree
->entries
, DEFAULT_TREE_SIZE
);
436 GITERR_CHECK_ARRAY(tree
->entries
);
438 while (buffer
< buffer_end
) {
439 git_tree_entry
*entry
;
444 if (parse_mode(&attr
, buffer
, &buffer
) < 0 || !buffer
)
445 return tree_error("Failed to parse tree. Can't parse filemode", NULL
);
447 if ((nul
= memchr(buffer
, 0, buffer_end
- buffer
)) == NULL
)
448 return tree_error("Failed to parse tree. Object is corrupted", NULL
);
450 filename_len
= nul
- buffer
;
451 /* Allocate the entry */
453 entry
= git_array_alloc(tree
->entries
);
454 GITERR_CHECK_ALLOC(entry
);
457 entry
->filename_len
= filename_len
;
458 entry
->filename
= buffer
;
459 entry
->oid
= (git_oid
*) ((char *) buffer
+ filename_len
+ 1);
462 buffer
+= filename_len
+ 1;
463 buffer
+= GIT_OID_RAWSZ
;
469 static size_t find_next_dir(const char *dirname
, git_index
*index
, size_t start
)
471 size_t dirlen
, i
, entries
= git_index_entrycount(index
);
473 dirlen
= strlen(dirname
);
474 for (i
= start
; i
< entries
; ++i
) {
475 const git_index_entry
*entry
= git_index_get_byindex(index
, i
);
476 if (strlen(entry
->path
) < dirlen
||
477 memcmp(entry
->path
, dirname
, dirlen
) ||
478 (dirlen
> 0 && entry
->path
[dirlen
] != '/')) {
486 static int append_entry(
487 git_treebuilder
*bld
,
488 const char *filename
,
490 git_filemode_t filemode
)
492 git_tree_entry
*entry
;
495 if (!valid_entry_name(bld
->repo
, filename
))
496 return tree_error("Failed to insert entry. Invalid name for a tree entry", filename
);
498 entry
= alloc_entry(filename
, strlen(filename
), id
);
499 GITERR_CHECK_ALLOC(entry
);
501 entry
->attr
= (uint16_t)filemode
;
503 git_strmap_insert(bld
->map
, entry
->filename
, entry
, error
);
505 git_tree_entry_free(entry
);
506 giterr_set(GITERR_TREE
, "failed to append entry %s to the tree builder", filename
);
513 static int write_tree(
515 git_repository
*repo
,
520 git_treebuilder
*bld
= NULL
;
521 size_t i
, entries
= git_index_entrycount(index
);
523 size_t dirname_len
= strlen(dirname
);
524 const git_tree_cache
*cache
;
526 cache
= git_tree_cache_get(index
->tree
, dirname
);
527 if (cache
!= NULL
&& cache
->entry_count
>= 0){
528 git_oid_cpy(oid
, &cache
->oid
);
529 return (int)find_next_dir(dirname
, index
, start
);
532 if ((error
= git_treebuilder_new(&bld
, repo
, NULL
)) < 0 || bld
== NULL
)
536 * This loop is unfortunate, but necessary. The index doesn't have
537 * any directores, so we need to handle that manually, and we
538 * need to keep track of the current position.
540 for (i
= start
; i
< entries
; ++i
) {
541 const git_index_entry
*entry
= git_index_get_byindex(index
, i
);
542 const char *filename
, *next_slash
;
545 * If we've left our (sub)tree, exit the loop and return. The
546 * first check is an early out (and security for the
547 * third). The second check is a simple prefix comparison. The
548 * third check catches situations where there is a directory
549 * win32/sys and a file win32mmap.c. Without it, the following
550 * code believes there is a file win32/mmap.c
552 if (strlen(entry
->path
) < dirname_len
||
553 memcmp(entry
->path
, dirname
, dirname_len
) ||
554 (dirname_len
> 0 && entry
->path
[dirname_len
] != '/')) {
558 filename
= entry
->path
+ dirname_len
;
559 if (*filename
== '/')
561 next_slash
= strchr(filename
, '/');
565 char *subdir
, *last_comp
;
567 subdir
= git__strndup(entry
->path
, next_slash
- entry
->path
);
568 GITERR_CHECK_ALLOC(subdir
);
570 /* Write out the subtree */
571 written
= write_tree(&sub_oid
, repo
, index
, subdir
, i
);
576 i
= written
- 1; /* -1 because of the loop increment */
580 * We need to figure out what we want toinsert
581 * into this tree. If we're traversing
582 * deps/zlib/, then we only want to write
583 * 'zlib' into the tree.
585 last_comp
= strrchr(subdir
, '/');
587 last_comp
++; /* Get rid of the '/' */
592 error
= append_entry(bld
, last_comp
, &sub_oid
, S_IFDIR
);
597 error
= append_entry(bld
, filename
, &entry
->id
, entry
->mode
);
603 if (git_treebuilder_write(oid
, bld
) < 0)
606 git_treebuilder_free(bld
);
610 git_treebuilder_free(bld
);
614 int git_tree__write_index(
615 git_oid
*oid
, git_index
*index
, git_repository
*repo
)
619 bool old_ignore_case
= false;
621 assert(oid
&& index
&& repo
);
623 if (git_index_has_conflicts(index
)) {
624 giterr_set(GITERR_INDEX
,
625 "Cannot create a tree from a not fully merged index.");
626 return GIT_EUNMERGED
;
629 if (index
->tree
!= NULL
&& index
->tree
->entry_count
>= 0) {
630 git_oid_cpy(oid
, &index
->tree
->oid
);
634 /* The tree cache didn't help us; we'll have to write
635 * out a tree. If the index is ignore_case, we must
636 * make it case-sensitive for the duration of the tree-write
639 if (index
->ignore_case
) {
640 old_ignore_case
= true;
641 git_index__set_ignore_case(index
, false);
644 ret
= write_tree(oid
, repo
, index
, "", 0);
647 git_index__set_ignore_case(index
, true);
654 git_pool_clear(&index
->tree_pool
);
656 if ((ret
= git_tree_lookup(&tree
, repo
, oid
)) < 0)
659 /* Read the tree cache into the index */
660 ret
= git_tree_cache_read_tree(&index
->tree
, tree
, &index
->tree_pool
);
666 int git_treebuilder_new(
667 git_treebuilder
**builder_p
,
668 git_repository
*repo
,
669 const git_tree
*source
)
671 git_treebuilder
*bld
;
674 assert(builder_p
&& repo
);
676 bld
= git__calloc(1, sizeof(git_treebuilder
));
677 GITERR_CHECK_ALLOC(bld
);
681 if (git_strmap_alloc(&bld
->map
) < 0) {
686 if (source
!= NULL
) {
687 git_tree_entry
*entry_src
;
689 git_array_foreach(source
->entries
, i
, entry_src
) {
691 bld
, entry_src
->filename
,
693 entry_src
->attr
) < 0)
702 git_treebuilder_free(bld
);
706 static git_otype
otype_from_mode(git_filemode_t filemode
)
709 case GIT_FILEMODE_TREE
:
711 case GIT_FILEMODE_COMMIT
:
712 return GIT_OBJ_COMMIT
;
718 int git_treebuilder_insert(
719 const git_tree_entry
**entry_out
,
720 git_treebuilder
*bld
,
721 const char *filename
,
723 git_filemode_t filemode
)
725 git_tree_entry
*entry
;
729 assert(bld
&& id
&& filename
);
731 if (!valid_filemode(filemode
))
732 return tree_error("Failed to insert entry. Invalid filemode for file", filename
);
734 if (!valid_entry_name(bld
->repo
, filename
))
735 return tree_error("Failed to insert entry. Invalid name for a tree entry", filename
);
737 if (filemode
!= GIT_FILEMODE_COMMIT
&&
738 !git_object__is_valid(bld
->repo
, id
, otype_from_mode(filemode
)))
739 return tree_error("Failed to insert entry; invalid object specified", filename
);
741 pos
= git_strmap_lookup_index(bld
->map
, filename
);
742 if (git_strmap_valid_index(bld
->map
, pos
)) {
743 entry
= git_strmap_value_at(bld
->map
, pos
);
744 git_oid_cpy((git_oid
*) entry
->oid
, id
);
746 entry
= alloc_entry(filename
, strlen(filename
), id
);
747 GITERR_CHECK_ALLOC(entry
);
749 git_strmap_insert(bld
->map
, entry
->filename
, entry
, error
);
752 git_tree_entry_free(entry
);
753 giterr_set(GITERR_TREE
, "failed to insert %s", filename
);
758 entry
->attr
= filemode
;
766 static git_tree_entry
*treebuilder_get(git_treebuilder
*bld
, const char *filename
)
768 git_tree_entry
*entry
= NULL
;
771 assert(bld
&& filename
);
773 pos
= git_strmap_lookup_index(bld
->map
, filename
);
774 if (git_strmap_valid_index(bld
->map
, pos
))
775 entry
= git_strmap_value_at(bld
->map
, pos
);
780 const git_tree_entry
*git_treebuilder_get(git_treebuilder
*bld
, const char *filename
)
782 return treebuilder_get(bld
, filename
);
785 int git_treebuilder_remove(git_treebuilder
*bld
, const char *filename
)
787 git_tree_entry
*entry
= treebuilder_get(bld
, filename
);
790 return tree_error("Failed to remove entry. File isn't in the tree", filename
);
792 git_strmap_delete(bld
->map
, filename
);
793 git_tree_entry_free(entry
);
798 int git_treebuilder_write(git_oid
*oid
, git_treebuilder
*bld
)
801 size_t i
, entrycount
;
802 git_buf tree
= GIT_BUF_INIT
;
804 git_tree_entry
*entry
;
809 entrycount
= git_strmap_num_entries(bld
->map
);
810 if (git_vector_init(&entries
, entrycount
, entry_sort_cmp
) < 0)
813 git_strmap_foreach_value(bld
->map
, entry
, {
814 if (git_vector_insert(&entries
, entry
) < 0)
818 git_vector_sort(&entries
);
820 /* Grow the buffer beforehand to an estimated size */
821 error
= git_buf_grow(&tree
, entrycount
* 72);
823 for (i
= 0; i
< entries
.length
&& !error
; ++i
) {
824 git_tree_entry
*entry
= git_vector_get(&entries
, i
);
826 git_buf_printf(&tree
, "%o ", entry
->attr
);
827 git_buf_put(&tree
, entry
->filename
, entry
->filename_len
+ 1);
828 git_buf_put(&tree
, (char *)entry
->oid
->id
, GIT_OID_RAWSZ
);
830 if (git_buf_oom(&tree
))
836 !(error
= git_repository_odb__weakptr(&odb
, bld
->repo
)))
837 error
= git_odb_write(oid
, odb
, tree
.ptr
, tree
.size
, GIT_OBJ_TREE
);
840 git_vector_free(&entries
);
845 void git_treebuilder_filter(
846 git_treebuilder
*bld
,
847 git_treebuilder_filter_cb filter
,
850 const char *filename
;
851 git_tree_entry
*entry
;
853 assert(bld
&& filter
);
855 git_strmap_foreach(bld
->map
, filename
, entry
, {
856 if (filter(entry
, payload
)) {
857 git_strmap_delete(bld
->map
, filename
);
858 git_tree_entry_free(entry
);
863 void git_treebuilder_clear(git_treebuilder
*bld
)
869 git_strmap_foreach_value(bld
->map
, e
, git_tree_entry_free(e
));
870 git_strmap_clear(bld
->map
);
873 void git_treebuilder_free(git_treebuilder
*bld
)
878 git_treebuilder_clear(bld
);
879 git_strmap_free(bld
->map
);
883 static size_t subpath_len(const char *path
)
885 const char *slash_pos
= strchr(path
, '/');
886 if (slash_pos
== NULL
)
889 return slash_pos
- path
;
892 int git_tree_entry_bypath(
893 git_tree_entry
**entry_out
,
894 const git_tree
*root
,
899 const git_tree_entry
*entry
;
902 /* Find how long is the current path component (i.e.
903 * the filename between two slashes */
904 filename_len
= subpath_len(path
);
906 if (filename_len
== 0) {
907 giterr_set(GITERR_TREE
, "Invalid tree path given");
908 return GIT_ENOTFOUND
;
911 entry
= entry_fromname(root
, path
, filename_len
);
914 giterr_set(GITERR_TREE
,
915 "the path '%.*s' does not exist in the given tree", filename_len
, path
);
916 return GIT_ENOTFOUND
;
919 switch (path
[filename_len
]) {
921 /* If there are more components in the path...
922 * then this entry *must* be a tree */
923 if (!git_tree_entry__is_tree(entry
)) {
924 giterr_set(GITERR_TREE
,
925 "the path '%.*s' exists but is not a tree", filename_len
, path
);
926 return GIT_ENOTFOUND
;
929 /* If there's only a slash left in the path, we
930 * return the current entry; otherwise, we keep
931 * walking down the path */
932 if (path
[filename_len
+ 1] != '\0')
936 /* If there are no more components in the path, return
938 return git_tree_entry_dup(entry_out
, entry
);
941 if (git_tree_lookup(&subtree
, root
->object
.repo
, entry
->oid
) < 0)
944 error
= git_tree_entry_bypath(
947 path
+ filename_len
+ 1
950 git_tree_free(subtree
);
954 static int tree_walk(
955 const git_tree
*tree
,
956 git_treewalk_cb callback
,
963 const git_tree_entry
*entry
;
965 git_array_foreach(tree
->entries
, i
, entry
) {
967 error
= callback(path
->ptr
, entry
, payload
);
968 if (error
< 0) { /* negative value stops iteration */
969 giterr_set_after_callback_function(error
, "git_tree_walk");
972 if (error
> 0) { /* positive value skips this entry */
978 if (git_tree_entry__is_tree(entry
)) {
980 size_t path_len
= git_buf_len(path
);
982 error
= git_tree_lookup(&subtree
, tree
->object
.repo
, entry
->oid
);
986 /* append the next entry to the path */
987 git_buf_puts(path
, entry
->filename
);
988 git_buf_putc(path
, '/');
990 if (git_buf_oom(path
))
993 error
= tree_walk(subtree
, callback
, path
, payload
, preorder
);
995 git_tree_free(subtree
);
999 git_buf_truncate(path
, path_len
);
1003 error
= callback(path
->ptr
, entry
, payload
);
1004 if (error
< 0) { /* negative value stops iteration */
1005 giterr_set_after_callback_function(error
, "git_tree_walk");
1016 const git_tree
*tree
,
1017 git_treewalk_mode mode
,
1018 git_treewalk_cb callback
,
1022 git_buf root_path
= GIT_BUF_INIT
;
1024 if (mode
!= GIT_TREEWALK_POST
&& mode
!= GIT_TREEWALK_PRE
) {
1025 giterr_set(GITERR_INVALID
, "Invalid walking mode for tree walk");
1030 tree
, callback
, &root_path
, payload
, (mode
== GIT_TREEWALK_PRE
));
1032 git_buf_free(&root_path
);