#include "iterator.h"

#include "tree.h"

#include "index.h"

#include "path.h"

#define GIT_ITERATOR_FIRST_ACCESS (1 << 15)

#define GIT_ITERATOR_HONOR_IGNORES (1 << 16)

#define GIT_ITERATOR_IGNORE_DOT_GIT (1 << 17)

#define iterator__flag(I,F) ((((git_iterator *)(I))->flags & GIT_ITERATOR_ ## F) != 0)

#define iterator__ignore_case(I) iterator__flag(I,IGNORE_CASE)

#define iterator__include_trees(I) iterator__flag(I,INCLUDE_TREES)

#define iterator__dont_autoexpand(I) iterator__flag(I,DONT_AUTOEXPAND)

#define iterator__do_autoexpand(I) !iterator__flag(I,DONT_AUTOEXPAND)

#define iterator__include_conflicts(I) iterator__flag(I,INCLUDE_CONFLICTS)

#define iterator__has_been_accessed(I) iterator__flag(I,FIRST_ACCESS)

#define iterator__honor_ignores(I) iterator__flag(I,HONOR_IGNORES)

#define iterator__ignore_dot_git(I) iterator__flag(I,IGNORE_DOT_GIT)

#define iterator__descend_symlinks(I) iterator__flag(I,DESCEND_SYMLINKS)

static void iterator_set_ignore_case(git_iterator *iter, bool ignore_case)

{

int (*vector_cmp)(const void *a, const void *b);

if (ignore_case)

iter->flags |= GIT_ITERATOR_IGNORE_CASE;

else

iter->flags &= ~GIT_ITERATOR_IGNORE_CASE;

iter->strcomp = ignore_case ? git__strcasecmp : git__strcmp;

iter->strncomp = ignore_case ? git__strncasecmp : git__strncmp;

iter->prefixcomp = ignore_case ? git__prefixcmp_icase : git__prefixcmp;

iter->entry_srch = ignore_case ? git_index_entry_isrch : git_index_entry_srch;

vector_cmp = ignore_case ? git__strcasecmp_cb : git__strcmp_cb;

git_vector_set_cmp(&iter->pathlist, vector_cmp);

}

static int iterator_range_init(

git_iterator *iter, const char *start, const char *end)

{

if (start && *start) {

iter->start = git__strdup(start);

GIT_ERROR_CHECK_ALLOC(iter->start);

iter->start_len = strlen(iter->start);

}

if (end && *end) {

iter->end = git__strdup(end);

GIT_ERROR_CHECK_ALLOC(iter->end);

iter->end_len = strlen(iter->end);

}

iter->started = (iter->start == NULL);

iter->ended = false;

return 0;

}

static void iterator_range_free(git_iterator *iter)

{

if (iter->start) {

git__free(iter->start);

iter->start = NULL;

iter->start_len = 0;

}

if (iter->end) {

git__free(iter->end);

iter->end = NULL;

iter->end_len = 0;

}

}

static int iterator_reset_range(

git_iterator *iter, const char *start, const char *end)

{

iterator_range_free(iter);

return iterator_range_init(iter, start, end);

}

static int iterator_pathlist_init(git_iterator *iter, git_strarray *pathlist)

{

size_t i;

if (git_vector_init(&iter->pathlist, pathlist->count, NULL) < 0)

return -1;

for (i = 0; i < pathlist->count; i++) {

if (!pathlist->strings[i])

continue;

if (git_vector_insert(&iter->pathlist, pathlist->strings[i]) < 0)

return -1;

}

return 0;

}

static int iterator_init_common(

git_iterator_options *given_opts)

{

static git_iterator_options default_opts = GIT_ITERATOR_OPTIONS_INIT;

git_iterator_options *options = given_opts ? given_opts : &default_opts;

bool ignore_case;

int precompose;

int error;

iter->repo = repo;

iter->index = index;

iter->flags = options->flags;

if ((iter->flags & GIT_ITERATOR_IGNORE_CASE) != 0) {

ignore_case = true;

} else if ((iter->flags & GIT_ITERATOR_DONT_IGNORE_CASE) != 0) {

ignore_case = false;

} else if (repo) {

git_index *index;

if ((error = git_repository_index__weakptr(&index, iter->repo)) < 0)

return error;

ignore_case = !!index->ignore_case;

if (ignore_case == 1)

iter->flags |= GIT_ITERATOR_IGNORE_CASE;

else

iter->flags |= GIT_ITERATOR_DONT_IGNORE_CASE;

} else {

ignore_case = false;

}

/* try to look up precompose and set flag if appropriate */

if (repo &&

(iter->flags & GIT_ITERATOR_PRECOMPOSE_UNICODE) == 0 &&

(iter->flags & GIT_ITERATOR_DONT_PRECOMPOSE_UNICODE) == 0) {

if (git_repository__configmap_lookup(&precompose, repo, GIT_CONFIGMAP_PRECOMPOSE) < 0)

git_error_clear();

else if (precompose)

iter->flags |= GIT_ITERATOR_PRECOMPOSE_UNICODE;

}

if ((iter->flags & GIT_ITERATOR_DONT_AUTOEXPAND))

iter->flags |= GIT_ITERATOR_INCLUDE_TREES;

if ((error = iterator_range_init(iter, options->start, options->end)) < 0 ||

(error = iterator_pathlist_init(iter, &options->pathlist)) < 0)

return error;

iterator_set_ignore_case(iter, ignore_case);

return 0;

}

static void iterator_clear(git_iterator *iter)

{

iter->started = false;

iter->ended = false;

iter->stat_calls = 0;

iter->pathlist_walk_idx = 0;

iter->flags &= ~GIT_ITERATOR_FIRST_ACCESS;

}

GIT_INLINE(bool) iterator_has_started(

git_iterator *iter, const char *path, bool is_submodule)

{

size_t path_len;

if (iter->start == NULL || iter->started == true)

return true;

/* the starting path is generally a prefix - we have started once we

iter->started = (iter->prefixcomp(path, iter->start) >= 0);

if (iter->started)

return true;

path_len = strlen(path);

/* if, however, we are a submodule, then we support `start` being

if (is_submodule && iter->start_len && path_len == iter->start_len - 1 &&

iter->start[iter->start_len-1] == '/')

return true;

/* if, however, our current path is a directory, and our starting path

if (path_len > 0 && path[path_len-1] == '/' &&

iter->strncomp(path, iter->start, path_len) == 0)

return true;

return false;

}

GIT_INLINE(bool) iterator_has_ended(git_iterator *iter, const char *path)

{

if (iter->end == NULL)

return false;

else if (iter->ended)

return true;

iter->ended = (iter->prefixcomp(path, iter->end) > 0);

return iter->ended;

}

static bool iterator_pathlist_next_is(git_iterator *iter, const char *path)

{

char *p;

size_t path_len, p_len, cmp_len, i;

int cmp;

if (iter->pathlist.length == 0)

return true;

git_vector_sort(&iter->pathlist);

path_len = strlen(path);

/* for comparison, drop the trailing slash on the current '/' */

if (path_len && path[path_len-1] == '/')

path_len--;

for (i = iter->pathlist_walk_idx; i < iter->pathlist.length; i++) {

p = iter->pathlist.contents[i];

p_len = strlen(p);

if (p_len && p[p_len-1] == '/')

p_len--;

cmp_len = min(path_len, p_len);

/* see if the pathlist entry is a prefix of this path */

cmp = iter->strncomp(p, path, cmp_len);

/* prefix match - see if there's an exact match, or if we were

if (cmp == 0) {

/* if this pathlist entry is not suffixed with a '/' then

if (p[cmp_len] == '\0' &&

(path[cmp_len] == '\0' || path[cmp_len] == '/'))

return true;

/* if this pathlist entry _is_ suffixed with a '/' then

if (p[cmp_len] == '/' && path[cmp_len] == '/')

return true;

}

/* this pathlist entry sorts before the given path, try the next */

else if (cmp < 0) {

iter->pathlist_walk_idx++;

continue;

}

/* this pathlist sorts after the given path, no match. */

else if (cmp > 0) {

break;

}

}

return false;

}

typedef enum {

ITERATOR_PATHLIST_NONE = 0,

ITERATOR_PATHLIST_IS_FILE = 1,

ITERATOR_PATHLIST_IS_DIR = 2,

ITERATOR_PATHLIST_IS_PARENT = 3,

ITERATOR_PATHLIST_FULL = 4

} iterator_pathlist_search_t;

static iterator_pathlist_search_t iterator_pathlist_search(

git_iterator *iter, const char *path, size_t path_len)

{

int (*vector_cmp)(const void *a, const void *b);

const char *p;

size_t idx;

int error;

if (iter->pathlist.length == 0)

return ITERATOR_PATHLIST_FULL;

git_vector_sort(&iter->pathlist);

vector_cmp = (iter->flags & GIT_ITERATOR_IGNORE_CASE) != 0 ?

git__strcasecmp_cb : git__strcmp_cb;

error = git_vector_bsearch2(&idx, &iter->pathlist, vector_cmp, path);

/* the given path was found in the pathlist. since the pathlist only

if (error == 0) {

if (path_len && path[path_len-1] == '/')

return ITERATOR_PATHLIST_IS_DIR;

return ITERATOR_PATHLIST_IS_FILE;

}

/* at this point, the path we're examining may be a directory (though we

while ((p = git_vector_get(&iter->pathlist, idx)) != NULL) {

if (iter->prefixcomp(p, path) != 0)

break;

/* an exact match would have been matched by the bsearch above */

GIT_ASSERT_WITH_RETVAL(p[path_len], ITERATOR_PATHLIST_NONE);

/* is this a literal directory entry (eg `foo/`) or a file beneath */

if (p[path_len] == '/') {

return (p[path_len+1] == '\0') ?

ITERATOR_PATHLIST_IS_DIR :

ITERATOR_PATHLIST_IS_PARENT;

}

if (p[path_len] > '/')

break;

idx++;

}

return ITERATOR_PATHLIST_NONE;

}

static int empty_iterator_noop(const git_index_entry **e, git_iterator *i)

{

GIT_UNUSED(i);

if (e)

*e = NULL;

return GIT_ITEROVER;

}

static int empty_iterator_advance_over(

const git_index_entry **e,

git_iterator_status_t *s,

git_iterator *i)

{

*s = GIT_ITERATOR_STATUS_EMPTY;

return empty_iterator_noop(e, i);

}

static int empty_iterator_reset(git_iterator *i)

{

GIT_UNUSED(i);

return 0;

}

static void empty_iterator_free(git_iterator *i)

{

GIT_UNUSED(i);

}

typedef struct {

git_iterator base;

git_iterator_callbacks cb;

} empty_iterator;

int git_iterator_for_nothing(

git_iterator **out,

git_iterator_options *options)

{

empty_iterator *iter;

static git_iterator_callbacks callbacks = {

empty_iterator_noop,

empty_iterator_noop,

empty_iterator_noop,

empty_iterator_advance_over,

empty_iterator_reset,

empty_iterator_free

};

*out = NULL;

iter = git__calloc(1, sizeof(empty_iterator));

GIT_ERROR_CHECK_ALLOC(iter);

iter->base.type = GIT_ITERATOR_EMPTY;

iter->base.cb = &callbacks;

iter->base.flags = options->flags;

*out = &iter->base;

return 0;

}

typedef struct {

git_tree_entry *tree_entry;

const char *parent_path;

} tree_iterator_entry;

typedef struct {

git_tree *tree;

/* path to this particular frame (folder) */

git_str path;

/* a sorted list of the entries for this frame (folder), these are

git_vector entries;

tree_iterator_entry *current;

size_t next_idx;

/* on case insensitive iterations, we also have an array of other

git_vector similar_trees;

git_array_t(git_str) similar_paths;

} tree_iterator_frame;

typedef struct {

git_iterator base;

git_tree *root;

git_array_t(tree_iterator_frame) frames;

git_index_entry entry;

git_str entry_path;

/* a pool of entries to reduce the number of allocations */

git_pool entry_pool;

} tree_iterator;

GIT_INLINE(tree_iterator_frame *) tree_iterator_parent_frame(

tree_iterator *iter)

{

return iter->frames.size > 1 ?

&iter->frames.ptr[iter->frames.size-2] : NULL;

}

GIT_INLINE(tree_iterator_frame *) tree_iterator_current_frame(

tree_iterator *iter)

{

return iter->frames.size ? &iter->frames.ptr[iter->frames.size-1] : NULL;

}

GIT_INLINE(int) tree_entry_cmp(

const git_tree_entry *a, const git_tree_entry *b, bool icase)

{

return git_fs_path_cmp(

a->filename, a->filename_len, a->attr == GIT_FILEMODE_TREE,

b->filename, b->filename_len, b->attr == GIT_FILEMODE_TREE,

icase ? git__strncasecmp : git__strncmp);

}

GIT_INLINE(int) tree_iterator_entry_cmp_icase(

const void *ptr_a, const void *ptr_b)

{

const tree_iterator_entry *a = (const tree_iterator_entry *)ptr_a;

const tree_iterator_entry *b = (const tree_iterator_entry *)ptr_b;

return tree_entry_cmp(a->tree_entry, b->tree_entry, true);

}

static int tree_iterator_entry_sort_icase(const void *ptr_a, const void *ptr_b)

{

const tree_iterator_entry *a = (const tree_iterator_entry *)ptr_a;

const tree_iterator_entry *b = (const tree_iterator_entry *)ptr_b;

int c = tree_entry_cmp(a->tree_entry, b->tree_entry, true);

/* stabilize the sort order for filenames that are (case insensitively)

if (!c && a->parent_path != b->parent_path)

c = git__strcmp(a->parent_path, b->parent_path);

if (!c)

c = tree_entry_cmp(a->tree_entry, b->tree_entry, false);

return c;

}

static int tree_iterator_compute_path(

git_str *out,

tree_iterator_entry *entry)

{

git_str_clear(out);

if (entry->parent_path)

git_str_joinpath(out, entry->parent_path, entry->tree_entry->filename);

else

git_str_puts(out, entry->tree_entry->filename);

if (git_tree_entry__is_tree(entry->tree_entry))

git_str_putc(out, '/');

if (git_str_oom(out))

return -1;

return 0;

}

static int tree_iterator_frame_init(

tree_iterator *iter,

git_tree *tree,

tree_iterator_entry *frame_entry)

{

tree_iterator_frame *new_frame = NULL;

tree_iterator_entry *new_entry;

git_tree *dup = NULL;

git_tree_entry *tree_entry;

git_vector_cmp cmp;

size_t i;

int error = 0;

new_frame = git_array_alloc(iter->frames);

GIT_ERROR_CHECK_ALLOC(new_frame);

if ((error = git_tree_dup(&dup, tree)) < 0)

goto done;

memset(new_frame, 0x0, sizeof(tree_iterator_frame));

new_frame->tree = dup;

if (frame_entry &&

(error = tree_iterator_compute_path(&new_frame->path, frame_entry)) < 0)

goto done;

cmp = iterator__ignore_case(&iter->base) ?

tree_iterator_entry_sort_icase : NULL;

if ((error = git_vector_init(&new_frame->entries,

dup->entries.size, cmp)) < 0)

goto done;

git_array_foreach(dup->entries, i, tree_entry) {

if ((new_entry = git_pool_malloc(&iter->entry_pool, 1)) == NULL) {

git_error_set_oom();

error = -1;

goto done;

}

new_entry->tree_entry = tree_entry;

new_entry->parent_path = new_frame->path.ptr;

if ((error = git_vector_insert(&new_frame->entries, new_entry)) < 0)

goto done;

}

git_vector_set_sorted(&new_frame->entries,

!iterator__ignore_case(&iter->base));

done:

if (error < 0) {

git_tree_free(dup);

git_array_pop(iter->frames);

}

return error;

}

GIT_INLINE(tree_iterator_entry *) tree_iterator_current_entry(

tree_iterator_frame *frame)

{

return frame->current;

}

GIT_INLINE(int) tree_iterator_frame_push_neighbors(

const char *filename)

{

tree_iterator_entry *entry, *new_entry;

git_tree *tree = NULL;

git_tree_entry *tree_entry;

git_str *path;

size_t new_size, i;

int error = 0;

while (parent_frame->next_idx < parent_frame->entries.length) {

entry = parent_frame->entries.contents[parent_frame->next_idx];

if (strcasecmp(filename, entry->tree_entry->filename) != 0)

break;

if ((error = git_tree_lookup(&tree,

iter->base.repo, &entry->tree_entry->oid)) < 0)

break;

if (git_vector_insert(&parent_frame->similar_trees, tree) < 0)

break;

path = git_array_alloc(parent_frame->similar_paths);

GIT_ERROR_CHECK_ALLOC(path);

memset(path, 0, sizeof(git_str));

if ((error = tree_iterator_compute_path(path, entry)) < 0)

break;

GIT_ERROR_CHECK_ALLOC_ADD(&new_size,

frame->entries.length, tree->entries.size);

git_vector_size_hint(&frame->entries, new_size);

git_array_foreach(tree->entries, i, tree_entry) {

new_entry = git_pool_malloc(&iter->entry_pool, 1);

GIT_ERROR_CHECK_ALLOC(new_entry);

new_entry->tree_entry = tree_entry;

new_entry->parent_path = path->ptr;

if ((error = git_vector_insert(&frame->entries, new_entry)) < 0)

break;

}

if (error)

break;

parent_frame->next_idx++;

}

return error;

}

GIT_INLINE(int) tree_iterator_frame_push(

tree_iterator *iter, tree_iterator_entry *entry)

{

tree_iterator_frame *parent_frame, *frame;

git_tree *tree = NULL;

int error;

if ((error = git_tree_lookup(&tree,

iter->base.repo, &entry->tree_entry->oid)) < 0 ||

(error = tree_iterator_frame_init(iter, tree, entry)) < 0)

goto done;

parent_frame = tree_iterator_parent_frame(iter);

frame = tree_iterator_current_frame(iter);

/* if we're case insensitive, then we may have another directory that

if (iterator__ignore_case(&iter->base))

error = tree_iterator_frame_push_neighbors(iter,

parent_frame, frame, entry->tree_entry->filename);

done:

git_tree_free(tree);

return error;

}

static int tree_iterator_frame_pop(tree_iterator *iter)

{

tree_iterator_frame *frame;

git_str *buf = NULL;

git_tree *tree;

size_t i;

GIT_ASSERT(iter->frames.size);

frame = git_array_pop(iter->frames);

git_vector_dispose(&frame->entries);

git_tree_free(frame->tree);

do {

buf = git_array_pop(frame->similar_paths);

git_str_dispose(buf);

} while (buf != NULL);

git_array_clear(frame->similar_paths);

git_vector_foreach(&frame->similar_trees, i, tree)

git_tree_free(tree);

git_vector_dispose(&frame->similar_trees);

git_str_dispose(&frame->path);

return 0;

}

static int tree_iterator_current(

const git_index_entry **out, git_iterator *i)

{

tree_iterator *iter = (tree_iterator *)i;

if (!iterator__has_been_accessed(i))

return iter->base.cb->advance(out, i);

if (!iter->frames.size) {

*out = NULL;

return GIT_ITEROVER;

}

*out = &iter->entry;

return 0;

}

static void tree_iterator_set_current(

tree_iterator *iter,

tree_iterator_frame *frame,

tree_iterator_entry *entry)

{

git_tree_entry *tree_entry = entry->tree_entry;

frame->current = entry;

memset(&iter->entry, 0x0, sizeof(git_index_entry));

iter->entry.mode = tree_entry->attr;

iter->entry.path = iter->entry_path.ptr;

git_oid_cpy(&iter->entry.id, &tree_entry->oid);

}

static int tree_iterator_advance(const git_index_entry **out, git_iterator *i)

{

tree_iterator *iter = (tree_iterator *)i;

int error = 0;

iter->base.flags |= GIT_ITERATOR_FIRST_ACCESS;

/* examine tree entries until we find the next one to return */

while (true) {

tree_iterator_entry *prev_entry, *entry;

tree_iterator_frame *frame;

bool is_tree;

if ((frame = tree_iterator_current_frame(iter)) == NULL) {

error = GIT_ITEROVER;

break;

}

/* no more entries in this frame. pop the frame out */

if (frame->next_idx == frame->entries.length) {

if ((error = tree_iterator_frame_pop(iter)) < 0)

break;

continue;

}

/* we may have coalesced the contents of case-insensitively same-named

if (frame->next_idx == 0 && !git_vector_is_sorted(&frame->entries))

git_vector_sort(&frame->entries);

/* we have more entries in the current frame, that's our next entry */

prev_entry = tree_iterator_current_entry(frame);

entry = frame->entries.contents[frame->next_idx];

frame->next_idx++;

/* we can have collisions when iterating case insensitively. (eg,

if (iterator__ignore_case(&iter->base) &&

prev_entry &&

tree_iterator_entry_cmp_icase(prev_entry, entry) == 0)

continue;

if ((error = tree_iterator_compute_path(&iter->entry_path, entry)) < 0)

break;

/* if this path is before our start, advance over this entry */

if (!iterator_has_started(&iter->base, iter->entry_path.ptr, false))

continue;

/* if this path is after our end, stop */

if (iterator_has_ended(&iter->base, iter->entry_path.ptr)) {

error = GIT_ITEROVER;

break;

}

/* if we have a list of paths we're interested in, examine it */

if (!iterator_pathlist_next_is(&iter->base, iter->entry_path.ptr))

continue;

is_tree = git_tree_entry__is_tree(entry->tree_entry);

/* if we are *not* including trees then advance over this entry */

if (is_tree && !iterator__include_trees(iter)) {

/* if we've found a tree (and are not returning it to the caller)

if (iterator__do_autoexpand(iter)) {

if ((error = tree_iterator_frame_push(iter, entry)) < 0)

break;

}

continue;

}

tree_iterator_set_current(iter, frame, entry);

/* if we are autoexpanding, then push this as a new frame, so that

if (is_tree && iterator__do_autoexpand(iter))

error = tree_iterator_frame_push(iter, entry);

break;

}

if (out)

*out = (error == 0) ? &iter->entry : NULL;

return error;

}

static int tree_iterator_advance_into(

const git_index_entry **out, git_iterator *i)

{

tree_iterator *iter = (tree_iterator *)i;

tree_iterator_frame *frame;

tree_iterator_entry *prev_entry;

int error;

if (out)

*out = NULL;

if ((frame = tree_iterator_current_frame(iter)) == NULL)

return GIT_ITEROVER;

/* get the last seen entry */

prev_entry = tree_iterator_current_entry(frame);

/* it's legal to call advance_into when auto-expand is on. in this case,

GIT_ASSERT(iterator__do_autoexpand(i) ^ (prev_entry != NULL));

if (prev_entry) {

if (!git_tree_entry__is_tree(prev_entry->tree_entry))

return 0;

if ((error = tree_iterator_frame_push(iter, prev_entry)) < 0)

return error;

}

/* we've advanced into the directory in question, let advance

return tree_iterator_advance(out, i);

}

static int tree_iterator_advance_over(

const git_index_entry **out,

git_iterator_status_t *status,

git_iterator *i)

{

*status = GIT_ITERATOR_STATUS_NORMAL;

return git_iterator_advance(out, i);

}

static void tree_iterator_clear(tree_iterator *iter)

{

while (iter->frames.size)

tree_iterator_frame_pop(iter);

git_array_clear(iter->frames);

git_pool_clear(&iter->entry_pool);

git_str_clear(&iter->entry_path);

iterator_clear(&iter->base);

}

static int tree_iterator_init(tree_iterator *iter)

{

int error;

if ((error = git_pool_init(&iter->entry_pool, sizeof(tree_iterator_entry))) < 0 ||

(error = tree_iterator_frame_init(iter, iter->root, NULL)) < 0)

return error;

iter->base.flags &= ~GIT_ITERATOR_FIRST_ACCESS;

return 0;

}

static int tree_iterator_reset(git_iterator *i)

{

tree_iterator *iter = (tree_iterator *)i;

tree_iterator_clear(iter);

return tree_iterator_init(iter);

}

static void tree_iterator_free(git_iterator *i)

{

tree_iterator *iter = (tree_iterator *)i;

tree_iterator_clear(iter);

git_tree_free(iter->root);

git_str_dispose(&iter->entry_path);

}

int git_iterator_for_tree(

git_iterator **out,

git_tree *tree,

git_iterator_options *options)

{

tree_iterator *iter;

int error;

static git_iterator_callbacks callbacks = {

tree_iterator_current,

tree_iterator_advance,

tree_iterator_advance_into,

tree_iterator_advance_over,

tree_iterator_reset,

tree_iterator_free

};

*out = NULL;

if (tree == NULL)

return git_iterator_for_nothing(out, options);

iter = git__calloc(1, sizeof(tree_iterator));

GIT_ERROR_CHECK_ALLOC(iter);

iter->base.type = GIT_ITERATOR_TREE;

iter->base.cb = &callbacks;

if ((error = iterator_init_common(&iter->base,

git_tree_owner(tree), NULL, options)) < 0 ||

(error = git_tree_dup(&iter->root, tree)) < 0 ||

(error = tree_iterator_init(iter)) < 0)

goto on_error;

*out = &iter->base;

return 0;

on_error:

git_iterator_free(&iter->base);

return error;

}

int git_iterator_current_tree_entry(

const git_tree_entry **tree_entry, git_iterator *i)

{

tree_iterator *iter;

tree_iterator_frame *frame;

tree_iterator_entry *entry;

GIT_ASSERT(i->type == GIT_ITERATOR_TREE);

iter = (tree_iterator *)i;

frame = tree_iterator_current_frame(iter);

entry = tree_iterator_current_entry(frame);

*tree_entry = entry->tree_entry;

return 0;

}

int git_iterator_current_parent_tree(

const git_tree **parent_tree, git_iterator *i, size_t depth)

{