tree 24 alloc.c struct tree tree; tree 62 alloc.c struct tree *t = alloc_node(&tree_state, sizeof(struct tree)); tree 111 alloc.c REPORT(tree, struct tree); tree 243 archive.c err = write_entry(args, args->tree->object.sha1, args->base, tree 263 archive.c init_tree_desc(&t, args->tree->buffer, args->tree->size); tree 269 archive.c err = read_tree_recursive(args->tree, "", 0, 0, &args->pathspec, tree 314 archive.c static int path_exists(struct tree *tree, const char *path) tree 322 archive.c ret = read_tree_recursive(tree, "", 0, 0, &pathspec, tree 342 archive.c if (**pathspec && !path_exists(ar_args->tree, *pathspec)) tree 356 archive.c struct tree *tree; tree 383 archive.c tree = parse_tree_indirect(oid.hash); tree 384 archive.c if (tree == NULL) tree 392 archive.c err = get_tree_entry(tree->object.sha1, prefix, tree 397 archive.c tree = parse_tree_indirect(tree_oid.hash); tree 399 archive.c ar_args->tree = tree; tree 9 archive.h struct tree *tree; tree 1477 builtin/am.c struct tree *tree; tree 1483 builtin/am.c tree = lookup_tree(head); tree 1485 builtin/am.c tree = lookup_tree(EMPTY_TREE_SHA1_BIN); tree 1496 builtin/am.c add_pending_object(&rev_info, &tree->object, ""); tree 1697 builtin/am.c unsigned char tree[GIT_SHA1_RAWSZ], parent[GIT_SHA1_RAWSZ], tree 1707 builtin/am.c if (write_cache_as_tree(tree, 0, NULL)) tree 1726 builtin/am.c if (commit_tree(state->msg, state->msg_len, tree, parents, commit, tree 1987 builtin/am.c static int fast_forward_to(struct tree *head, struct tree *remote, int reset) tree 2027 builtin/am.c static int merge_tree(struct tree *tree) tree 2033 builtin/am.c if (parse_tree(tree)) tree 2045 builtin/am.c init_tree_desc(&t[0], tree->buffer, tree->size); tree 2064 builtin/am.c struct tree *head_tree, *remote_tree, *index_tree; tree 560 builtin/blame.c do_diff_cache(parent->tree->object.sha1, &diff_opts); tree 562 builtin/blame.c diff_tree_sha1(parent->tree->object.sha1, tree 563 builtin/blame.c origin->commit->tree->object.sha1, tree 630 builtin/blame.c do_diff_cache(parent->tree->object.sha1, &diff_opts); tree 632 builtin/blame.c diff_tree_sha1(parent->tree->object.sha1, tree 633 builtin/blame.c origin->commit->tree->object.sha1, tree 1278 builtin/blame.c do_diff_cache(parent->tree->object.sha1, &diff_opts); tree 1280 builtin/blame.c diff_tree_sha1(parent->tree->object.sha1, tree 1281 builtin/blame.c target->commit->tree->object.sha1, tree 51 builtin/checkout.c struct tree *source_tree; tree 105 builtin/checkout.c static int read_tree_some(struct tree *tree, const struct pathspec *pathspec) tree 107 builtin/checkout.c read_tree_recursive(tree, "", 0, 0, pathspec, update_some, NULL); tree 407 builtin/checkout.c static int reset_tree(struct tree *tree, const struct checkout_opts *o, tree 423 builtin/checkout.c parse_tree(tree); tree 424 builtin/checkout.c init_tree_desc(&tree_desc, tree->buffer, tree->size); tree 477 builtin/checkout.c ret = reset_tree(new->commit->tree, opts, 1, writeout_error); tree 482 builtin/checkout.c struct tree *tree; tree 511 builtin/checkout.c tree = parse_tree_indirect(old->commit ? tree 514 builtin/checkout.c init_tree_desc(&trees[0], tree->buffer, tree->size); tree 515 builtin/checkout.c tree = parse_tree_indirect(new->commit->object.sha1); tree 516 builtin/checkout.c init_tree_desc(&trees[1], tree->buffer, tree->size); tree 525 builtin/checkout.c struct tree *result; tree 526 builtin/checkout.c struct tree *work; tree 563 builtin/checkout.c ret = reset_tree(new->commit->tree, opts, 1, tree 570 builtin/checkout.c merge_trees(&o, new->commit->tree, work, tree 571 builtin/checkout.c old->commit->tree, &result); tree 572 builtin/checkout.c ret = reset_tree(new->commit->tree, opts, 0, tree 903 builtin/checkout.c struct tree **source_tree = &opts->source_tree; tree 1031 builtin/checkout.c *source_tree = new->commit->tree; tree 679 builtin/clone.c struct tree *tree; tree 715 builtin/clone.c tree = parse_tree_indirect(sha1); tree 716 builtin/clone.c parse_tree(tree); tree 717 builtin/clone.c init_tree_desc(&t, tree->buffer, tree->size); tree 285 builtin/commit.c struct tree *tree; tree 302 builtin/commit.c tree = parse_tree_indirect(current_head->object.sha1); tree 303 builtin/commit.c if (!tree) tree 305 builtin/commit.c parse_tree(tree); tree 306 builtin/commit.c init_tree_desc(&t, tree->buffer, tree->size); tree 43 builtin/diff-tree.c static int stdin_diff_trees(struct tree *tree1, char *line, int len) tree 46 builtin/diff-tree.c struct tree *tree2; tree 77 builtin/diff-tree.c return stdin_diff_trees((struct tree *)obj, line, len); tree 383 builtin/diff.c struct tree *tree; tree 384 builtin/diff.c tree = lookup_tree(EMPTY_TREE_SHA1_BIN); tree 385 builtin/diff.c add_pending_object(&rev, &tree->object, "HEAD"); tree 403 builtin/diff.c obj = &((struct commit *)obj)->tree->object; tree 565 builtin/fast-export.c diff_tree_sha1(commit->parents->item->tree->object.sha1, tree 566 builtin/fast-export.c commit->tree->object.sha1, "", &rev->diffopt); tree 569 builtin/fast-export.c diff_root_tree_sha1(commit->tree->object.sha1, tree 145 builtin/fsck.c struct tree *tree = NULL; tree 148 builtin/fsck.c tree = (struct tree *)obj; tree 149 builtin/fsck.c if (parse_tree(tree) < 0) tree 153 builtin/fsck.c if (tree) tree 154 builtin/fsck.c free_tree_buffer(tree); tree 326 builtin/fsck.c struct tree *item = (struct tree *) obj; tree 408 builtin/grep.c struct tree_desc *tree, struct strbuf *base, int tn_len, tree 416 builtin/grep.c while (tree_entry(tree, &entry)) { tree 464 builtin/grep.c struct tree_desc tree; tree 484 builtin/grep.c init_tree_desc(&tree, data, size); tree 485 builtin/grep.c hit = grep_tree(opt, pathspec, &tree, &base, base.len, tree 848 builtin/index-pack.c struct tree *item = (struct tree *) obj; tree 585 builtin/log.c read_tree_recursive((struct tree *)o, "", 0, 0, &match_all, tree 997 builtin/log.c diff_tree_sha1(origin->tree->object.sha1, tree 998 builtin/log.c head->tree->object.sha1, tree 306 builtin/ls-files.c struct tree *tree; tree 314 builtin/ls-files.c tree = parse_tree_indirect(sha1); tree 315 builtin/ls-files.c if (!tree) tree 333 builtin/ls-files.c if (read_tree(tree, 1, &pathspec)) tree 124 builtin/ls-tree.c struct tree *tree; tree 184 builtin/ls-tree.c tree = parse_tree_indirect(sha1); tree 185 builtin/ls-tree.c if (!tree) tree 187 builtin/ls-tree.c return !!read_tree_recursive(tree, "", 0, 0, &pathspec, show_tree, NULL); tree 597 builtin/merge.c struct tree *trees[MAX_UNPACK_TREES]; tree 1170 builtin/pack-objects.c static void add_pbase_object(struct tree_desc *tree, tree 1178 builtin/pack-objects.c while (tree_entry(tree,&entry)) { tree 1195 builtin/pack-objects.c struct pbase_tree_cache *tree; tree 1199 builtin/pack-objects.c tree = pbase_tree_get(entry.sha1); tree 1200 builtin/pack-objects.c if (!tree) tree 1202 builtin/pack-objects.c init_tree_desc(&sub, tree->tree_data, tree->tree_size); tree 1205 builtin/pack-objects.c pbase_tree_put(tree); tree 1262 builtin/pack-objects.c struct tree_desc tree; tree 1263 builtin/pack-objects.c init_tree_desc(&tree, it->pcache.tree_data, it->pcache.tree_size); tree 1264 builtin/pack-objects.c add_pbase_object(&tree, name, cmplen, name); tree 21 builtin/read-tree.c static struct tree *trees[MAX_UNPACK_TREES]; tree 25 builtin/read-tree.c struct tree *tree; tree 29 builtin/read-tree.c tree = parse_tree_indirect(sha1); tree 30 builtin/read-tree.c if (!tree) tree 32 builtin/read-tree.c trees[nr_trees++] = tree; tree 227 builtin/read-tree.c struct tree *tree = trees[i]; tree 228 builtin/read-tree.c parse_tree(tree); tree 229 builtin/read-tree.c init_tree_desc(t+i, tree->buffer, tree->size); tree 63 builtin/reflog.c struct tree *tree; tree 65 builtin/reflog.c tree = lookup_tree(sha1); tree 66 builtin/reflog.c if (!tree) tree 68 builtin/reflog.c if (tree->object.flags & SEEN) tree 70 builtin/reflog.c if (tree->object.flags & INCOMPLETE) tree 73 builtin/reflog.c if (!tree->buffer) { tree 78 builtin/reflog.c tree->object.flags |= INCOMPLETE; tree 81 builtin/reflog.c tree->buffer = data; tree 82 builtin/reflog.c tree->size = size; tree 84 builtin/reflog.c init_tree_desc(&desc, tree->buffer, tree->size); tree 89 builtin/reflog.c tree->object.flags |= INCOMPLETE; tree 93 builtin/reflog.c free_tree_buffer(tree); tree 96 builtin/reflog.c tree->object.flags |= SEEN; tree 155 builtin/reflog.c if (!tree_is_complete(c->tree->object.sha1)) { tree 46 builtin/reset.c struct tree *tree; tree 87 builtin/reset.c tree = parse_tree_indirect(sha1); tree 88 builtin/reset.c prime_cache_tree(&the_index, tree); tree 311 builtin/reset.c struct tree *tree; tree 314 builtin/reset.c tree = parse_tree_indirect(sha1); tree 315 builtin/reset.c if (!tree) tree 317 builtin/reset.c hashcpy(sha1, tree->object.sha1); tree 654 cache-tree.c static void prime_cache_tree_rec(struct cache_tree *it, struct tree *tree) tree 660 cache-tree.c hashcpy(it->sha1, tree->object.sha1); tree 661 cache-tree.c init_tree_desc(&desc, tree->buffer, tree->size); tree 668 cache-tree.c struct tree *subtree = lookup_tree(entry.sha1); tree 680 cache-tree.c void prime_cache_tree(struct index_state *istate, struct tree *tree) tree 684 cache-tree.c prime_cache_tree_rec(istate->cache_tree, tree); tree 51 cache-tree.h void prime_cache_tree(struct index_state *, struct tree *); tree 463 cache.h extern void set_git_work_tree(const char *tree); tree 1036 cache.h unsigned char tree[20]; tree 334 commit.c item->tree = lookup_tree(parent.hash); tree 1393 commit.c const unsigned char *tree, tree 1401 commit.c result = commit_tree_extended(msg, msg_len, tree, parents, ret, tree 1523 commit.c const unsigned char *tree, tree 1532 commit.c assert_sha1_type(tree, OBJ_TREE); tree 1541 commit.c strbuf_addf(&buffer, "tree %s\n", sha1_to_hex(tree)); tree 22 commit.h struct tree *tree; tree 321 commit.h const unsigned char *tree, tree 326 commit.h const unsigned char *tree, tree 1338 compat/regex/regcomp.c bin_tree_t *op, *cls, *tree1, *tree; tree 1356 compat/regex/regcomp.c tree = create_tree (dfa, op, tree1, CONCAT); tree 1357 compat/regex/regcomp.c if (BE (tree == NULL || tree1 == NULL || op == NULL || cls == NULL, 0)) tree 1365 compat/regex/regcomp.c return tree; tree 2115 compat/regex/regcomp.c bin_tree_t *tree, *eor, *root; tree 2119 compat/regex/regcomp.c tree = parse_reg_exp (regexp, preg, ¤t_token, syntax, 0, err); tree 2120 compat/regex/regcomp.c if (BE (*err != REG_NOERROR && tree == NULL, 0)) tree 2123 compat/regex/regcomp.c if (tree != NULL) tree 2124 compat/regex/regcomp.c root = create_tree (dfa, tree, eor, CONCAT); tree 2149 compat/regex/regcomp.c bin_tree_t *tree, *branch = NULL; tree 2150 compat/regex/regcomp.c tree = parse_branch (regexp, preg, token, syntax, nest, err); tree 2151 compat/regex/regcomp.c if (BE (*err != REG_NOERROR && tree == NULL, 0)) tree 2166 compat/regex/regcomp.c tree = create_tree (dfa, tree, branch, OP_ALT); tree 2167 compat/regex/regcomp.c if (BE (tree == NULL, 0)) tree 2173 compat/regex/regcomp.c return tree; tree 2189 compat/regex/regcomp.c bin_tree_t *tree, *exp; tree 2191 compat/regex/regcomp.c tree = parse_expression (regexp, preg, token, syntax, nest, err); tree 2192 compat/regex/regcomp.c if (BE (*err != REG_NOERROR && tree == NULL, 0)) tree 2203 compat/regex/regcomp.c if (tree != NULL && exp != NULL) tree 2205 compat/regex/regcomp.c tree = create_tree (dfa, tree, exp, CONCAT); tree 2206 compat/regex/regcomp.c if (tree == NULL) tree 2212 compat/regex/regcomp.c else if (tree == NULL) tree 2213 compat/regex/regcomp.c tree = exp; tree 2216 compat/regex/regcomp.c return tree; tree 2230 compat/regex/regcomp.c bin_tree_t *tree; tree 2234 compat/regex/regcomp.c tree = create_token_tree (dfa, NULL, NULL, token); tree 2235 compat/regex/regcomp.c if (BE (tree == NULL, 0)) tree 2249 compat/regex/regcomp.c tree = create_tree (dfa, tree, mbc_remain, CONCAT); tree 2250 compat/regex/regcomp.c if (BE (mbc_remain == NULL || tree == NULL, 0)) tree 2260 compat/regex/regcomp.c tree = parse_sub_exp (regexp, preg, token, syntax, nest + 1, err); tree 2261 compat/regex/regcomp.c if (BE (*err != REG_NOERROR && tree == NULL, 0)) tree 2265 compat/regex/regcomp.c tree = parse_bracket_exp (regexp, dfa, token, syntax, err); tree 2266 compat/regex/regcomp.c if (BE (*err != REG_NOERROR && tree == NULL, 0)) tree 2276 compat/regex/regcomp.c tree = create_token_tree (dfa, NULL, NULL, token); tree 2277 compat/regex/regcomp.c if (BE (tree == NULL, 0)) tree 2321 compat/regex/regcomp.c tree = create_token_tree (dfa, NULL, NULL, token); tree 2322 compat/regex/regcomp.c if (BE (tree == NULL, 0)) tree 2350 compat/regex/regcomp.c tree = create_tree (dfa, tree_first, tree_last, OP_ALT); tree 2351 compat/regex/regcomp.c if (BE (tree_first == NULL || tree_last == NULL || tree == NULL, 0)) tree 2359 compat/regex/regcomp.c tree = create_token_tree (dfa, NULL, NULL, token); tree 2360 compat/regex/regcomp.c if (BE (tree == NULL, 0)) tree 2371 compat/regex/regcomp.c return tree; tree 2373 compat/regex/regcomp.c tree = create_token_tree (dfa, NULL, NULL, token); tree 2374 compat/regex/regcomp.c if (BE (tree == NULL, 0)) tree 2384 compat/regex/regcomp.c tree = build_charclass_op (dfa, regexp->trans, tree 2388 compat/regex/regcomp.c if (BE (*err != REG_NOERROR && tree == NULL, 0)) tree 2393 compat/regex/regcomp.c tree = build_charclass_op (dfa, regexp->trans, tree 2397 compat/regex/regcomp.c if (BE (*err != REG_NOERROR && tree == NULL, 0)) tree 2418 compat/regex/regcomp.c tree = parse_dup_op (tree, regexp, dfa, token, syntax, err); tree 2419 compat/regex/regcomp.c if (BE (*err != REG_NOERROR && tree == NULL, 0)) tree 2431 compat/regex/regcomp.c return tree; tree 2446 compat/regex/regcomp.c bin_tree_t *tree; tree 2454 compat/regex/regcomp.c tree = NULL; tree 2457 compat/regex/regcomp.c tree = parse_reg_exp (regexp, preg, token, syntax, nest, err); tree 2467 compat/regex/regcomp.c tree = create_tree (dfa, tree, NULL, SUBEXP); tree 2468 compat/regex/regcomp.c if (BE (tree == NULL, 0)) tree 2473 compat/regex/regcomp.c tree->token.opr.idx = cur_nsub; tree 2474 compat/regex/regcomp.c return tree; tree 2483 compat/regex/regcomp.c bin_tree_t *tree = NULL, *old_tree = NULL; tree 2562 compat/regex/regcomp.c tree = elem; tree 2566 compat/regex/regcomp.c tree = create_tree (dfa, tree, elem, CONCAT); tree 2567 compat/regex/regcomp.c if (BE (elem == NULL || tree == NULL, 0)) tree 2572 compat/regex/regcomp.c return tree; tree 2576 compat/regex/regcomp.c old_tree = tree; tree 2584 compat/regex/regcomp.c tree = create_tree (dfa, elem, NULL, (end == -1 ? OP_DUP_ASTERISK : OP_ALT)); tree 2585 compat/regex/regcomp.c if (BE (tree == NULL, 0)) tree 2594 compat/regex/regcomp.c tree = create_tree (dfa, tree, elem, CONCAT); tree 2595 compat/regex/regcomp.c if (BE (elem == NULL || tree == NULL, 0)) tree 2598 compat/regex/regcomp.c tree = create_tree (dfa, tree, NULL, OP_ALT); tree 2599 compat/regex/regcomp.c if (BE (tree == NULL, 0)) tree 2604 compat/regex/regcomp.c tree = create_tree (dfa, old_tree, tree, CONCAT); tree 2606 compat/regex/regcomp.c return tree; tree 3622 compat/regex/regcomp.c bin_tree_t *tree; tree 3679 compat/regex/regcomp.c tree = create_token_tree (dfa, NULL, NULL, &br_token); tree 3680 compat/regex/regcomp.c if (BE (tree == NULL, 0)) tree 3695 compat/regex/regcomp.c tree = create_tree (dfa, tree, mbc_tree, OP_ALT); tree 3697 compat/regex/regcomp.c return tree; tree 3702 compat/regex/regcomp.c return tree; tree 3705 compat/regex/regcomp.c return tree; tree 3775 compat/regex/regcomp.c bin_tree_t *tree; tree 3786 compat/regex/regcomp.c tree = &dfa->str_tree_storage->data[dfa->str_tree_storage_idx++]; tree 3788 compat/regex/regcomp.c tree->parent = NULL; tree 3789 compat/regex/regcomp.c tree->left = left; tree 3790 compat/regex/regcomp.c tree->right = right; tree 3791 compat/regex/regcomp.c tree->token = *token; tree 3792 compat/regex/regcomp.c tree->token.duplicated = 0; tree 3793 compat/regex/regcomp.c tree->token.opt_subexp = 0; tree 3794 compat/regex/regcomp.c tree->first = NULL; tree 3795 compat/regex/regcomp.c tree->next = NULL; tree 3796 compat/regex/regcomp.c tree->node_idx = -1; tree 3799 compat/regex/regcomp.c left->parent = tree; tree 3801 compat/regex/regcomp.c right->parent = tree; tree 3802 compat/regex/regcomp.c return tree; tree 374 diff-lib.c const struct cache_entry *tree) tree 394 diff-lib.c if (tree) tree 395 diff-lib.c fill_filespec(pair->one, tree->sha1, 1, tree->ce_mode); tree 402 diff-lib.c if (!tree) { tree 411 diff-lib.c diff_index_show_file(revs, "-", tree, tree->sha1, 1, tree->ce_mode, 0); tree 416 diff-lib.c show_modified(revs, tree, idx, 1, cached, match_missing); tree 438 diff-lib.c const struct cache_entry *tree = src[1]; tree 447 diff-lib.c if (tree == o->df_conflict_entry) tree 448 diff-lib.c tree = NULL; tree 450 diff-lib.c if (ce_path_match(idx ? idx : tree, &revs->prune_data, NULL)) { tree 451 diff-lib.c do_oneway_diff(o, idx, tree); tree 466 diff-lib.c struct tree *tree; tree 470 diff-lib.c tree = parse_tree_indirect(tree_sha1); tree 471 diff-lib.c if (!tree) tree 487 diff-lib.c init_tree_desc(&t, tree->buffer, tree->size); tree 225 fast-import.c struct tree_content *tree; tree 387 fast-import.c if (b->branch_tree.tree) tree 831 fast-import.c if (e->tree) tree 832 fast-import.c release_tree_content_recursive(e->tree); tree 850 fast-import.c if (a->tree && is_null_sha1(b->versions[1].sha1)) tree 851 fast-import.c b->tree = dup_tree_content(a->tree); tree 853 fast-import.c b->tree = NULL; tree 1342 fast-import.c root->tree = t = new_tree_content(8); tree 1366 fast-import.c root->tree = t = grow_tree_content(t, t->entry_count); tree 1369 fast-import.c e->tree = NULL; tree 1439 fast-import.c if (!root->tree) tree 1441 fast-import.c t = root->tree; tree 1444 fast-import.c if (t->entries[i]->tree) tree 1485 fast-import.c if (root->tree) tree 1486 fast-import.c release_tree_content_recursive(root->tree); tree 1487 fast-import.c root->tree = newtree; tree 1509 fast-import.c if (!root->tree) tree 1511 fast-import.c t = root->tree; tree 1522 fast-import.c if (e->tree) tree 1523 fast-import.c release_tree_content_recursive(e->tree); tree 1524 fast-import.c e->tree = subtree; tree 1546 fast-import.c e->tree = new_tree_content(8); tree 1549 fast-import.c if (!e->tree) tree 1560 fast-import.c root->tree = t = grow_tree_content(t, t->entry_count); tree 1567 fast-import.c e->tree = new_tree_content(8); tree 1571 fast-import.c e->tree = subtree; tree 1593 fast-import.c if (!root->tree) tree 1601 fast-import.c t = root->tree; tree 1615 fast-import.c if (!e->tree) tree 1618 fast-import.c for (n = 0; n < e->tree->entry_count; n++) { tree 1619 fast-import.c if (e->tree->entries[n]->versions[1].mode) { tree 1635 fast-import.c else if (e->tree) tree 1636 fast-import.c release_tree_content_recursive(e->tree); tree 1637 fast-import.c e->tree = NULL; tree 1660 fast-import.c if (!root->tree) tree 1668 fast-import.c t = root->tree; tree 1676 fast-import.c if (!e->tree) tree 1685 fast-import.c if (e->tree && is_null_sha1(e->versions[1].sha1)) tree 1686 fast-import.c leaf->tree = dup_tree_content(e->tree); tree 1688 fast-import.c leaf->tree = NULL; tree 2115 fast-import.c if (e->branch_tree.tree) { tree 2116 fast-import.c release_tree_content_recursive(e->branch_tree.tree); tree 2117 fast-import.c e->branch_tree.tree = NULL; tree 2165 fast-import.c struct tree_content *t = root->tree; tree 2220 fast-import.c leaf.tree); tree 2223 fast-import.c if (!e->tree) tree 2231 fast-import.c t = root->tree; tree 2452 fast-import.c leaf.tree); tree 2458 fast-import.c leaf.tree); tree 2561 fast-import.c release_tree_content_recursive(b->branch_tree.tree); tree 2637 fast-import.c if (b->branch_tree.tree && hashcmp(sha1, b->branch_tree.versions[1].sha1)) { tree 2638 fast-import.c release_tree_content_recursive(b->branch_tree.tree); tree 2639 fast-import.c b->branch_tree.tree = NULL; tree 2717 fast-import.c if (!b->branch_tree.tree || !max_active_branches) { tree 2871 fast-import.c if (b->branch_tree.tree) { tree 2872 fast-import.c release_tree_content_recursive(b->branch_tree.tree); tree 2873 fast-import.c b->branch_tree.tree = NULL; tree 3113 fast-import.c if (leaf.tree) tree 3114 fast-import.c release_tree_content_recursive(leaf.tree); tree 298 fsck.c static int fsck_walk_tree(struct tree *tree, void *data, struct fsck_options *options) tree 304 fsck.c if (parse_tree(tree)) tree 307 fsck.c init_tree_desc(&desc, tree->buffer, tree->size); tree 319 fsck.c sha1_to_hex(tree->object.sha1), entry.path, entry.mode); tree 338 fsck.c result = options->walk((struct object *)commit->tree, OBJ_TREE, data, options); tree 370 fsck.c return fsck_walk_tree((struct tree *)obj, data, options); tree 427 fsck.c static int fsck_tree(struct tree *item, struct fsck_options *options) tree 668 fsck.c if (!commit->tree) tree 797 fsck.c return fsck_tree((struct tree *) obj, options); tree 1294 http-push.c static struct object_list **process_tree(struct tree *tree, tree 1299 http-push.c struct object *obj = &tree->object; tree 1308 http-push.c if (parse_tree(tree) < 0) tree 1318 http-push.c init_tree_desc(&desc, tree->buffer, tree->size); tree 1333 http-push.c free_tree_buffer(tree); tree 1345 http-push.c p = process_tree(commit->tree, p, NULL, ""); tree 1364 http-push.c p = process_tree((struct tree *)obj, p, NULL, name); tree 51 kwset.c struct tree *llink; /* Left link; MUST be first field. */ tree 52 kwset.c struct tree *rlink; /* Right link (to larger labels). */ tree 62 kwset.c struct tree *links; /* Tree of edges leaving this node. */ tree 131 kwset.c register struct tree *link; tree 133 kwset.c struct tree *links[DEPTH_SIZE]; tree 135 kwset.c struct tree *t, *r, *l, *rl, *lr; tree 151 kwset.c links[0] = (struct tree *) &trie->links; tree 169 kwset.c link = (struct tree *) obstack_alloc(&kwset->obstack, tree 170 kwset.c sizeof (struct tree)); tree 286 kwset.c enqueue (struct tree *tree, struct trie **last) tree 288 kwset.c if (!tree) tree 290 kwset.c enqueue(tree->llink, last); tree 291 kwset.c enqueue(tree->rlink, last); tree 292 kwset.c (*last) = (*last)->next = tree->trie; tree 299 kwset.c treefails (register struct tree const *tree, struct trie const *fail, tree 302 kwset.c register struct tree *link; tree 304 kwset.c if (!tree) tree 307 kwset.c treefails(tree->llink, fail, recourse); tree 308 kwset.c treefails(tree->rlink, fail, recourse); tree 315 kwset.c while (link && tree->label != link->label) tree 316 kwset.c if (tree->label < link->label) tree 322 kwset.c tree->trie->fail = link->trie; tree 328 kwset.c tree->trie->fail = recourse; tree 334 kwset.c treedelta (register struct tree const *tree, tree 338 kwset.c if (!tree) tree 340 kwset.c treedelta(tree->llink, depth, delta); tree 341 kwset.c treedelta(tree->rlink, depth, delta); tree 342 kwset.c if (depth < delta[tree->label]) tree 343 kwset.c delta[tree->label] = depth; tree 348 kwset.c hasevery (register struct tree const *a, register struct tree const *b) tree 367 kwset.c treenext (struct tree const *tree, struct trie *next[]) tree 369 kwset.c if (!tree) tree 371 kwset.c treenext(tree->llink, next); tree 372 kwset.c treenext(tree->rlink, next); tree 373 kwset.c next[tree->label] = tree->trie; tree 592 kwset.c register struct tree const *tree; tree 647 kwset.c tree = trie->links; tree 648 kwset.c while (tree && c != tree->label) tree 649 kwset.c if (c < tree->label) tree 650 kwset.c tree = tree->llink; tree 652 kwset.c tree = tree->rlink; tree 653 kwset.c if (tree) tree 655 kwset.c trie = tree->trie; tree 698 kwset.c tree = trie->links; tree 699 kwset.c while (tree && c != tree->label) tree 700 kwset.c if (c < tree->label) tree 701 kwset.c tree = tree->llink; tree 703 kwset.c tree = tree->rlink; tree 704 kwset.c if (tree) tree 706 kwset.c trie = tree->trie; tree 827 line-log.c diff_tree_sha1(parent ? parent->tree->object.sha1 : NULL, tree 828 line-log.c commit->tree->object.sha1, "", opt); tree 63 list-objects.c struct tree *tree, tree 70 list-objects.c struct object *obj = &tree->object; tree 84 list-objects.c if (parse_tree_gently(tree, revs->ignore_missing_links) < 0) { tree 101 list-objects.c init_tree_desc(&desc, tree->buffer, tree->size); tree 129 list-objects.c free_tree_buffer(tree); tree 142 list-objects.c mark_tree_uninteresting(parent->tree); tree 159 list-objects.c mark_tree_uninteresting(commit->tree); tree 174 list-objects.c mark_tree_uninteresting(commit->tree); tree 183 list-objects.c static void add_pending_tree(struct rev_info *revs, struct tree *tree) tree 185 list-objects.c add_pending_object(revs, &tree->object, ""); tree 203 list-objects.c if (commit->tree) tree 204 list-objects.c add_pending_tree(revs, commit->tree); tree 222 list-objects.c process_tree(revs, (struct tree *)obj, show_object, tree 805 log-tree.c sha1 = commit->tree->object.sha1; tree 830 log-tree.c diff_tree_sha1(parents->item->tree->object.sha1, tree 845 log-tree.c diff_tree_sha1(parent->tree->object.sha1, tree 26 merge-recursive.c static struct tree *shift_tree_object(struct tree *one, struct tree *two, tree 42 merge-recursive.c static struct commit *make_virtual_commit(struct tree *tree, const char *comment) tree 49 merge-recursive.c commit->tree = tree; tree 213 merge-recursive.c static void init_tree_desc_from_tree(struct tree_desc *desc, struct tree *tree) tree 215 merge-recursive.c parse_tree(tree); tree 216 merge-recursive.c init_tree_desc(desc, tree->buffer, tree->size); tree 220 merge-recursive.c struct tree *common, tree 221 merge-recursive.c struct tree *head, tree 222 merge-recursive.c struct tree *merge) tree 249 merge-recursive.c struct tree *write_tree_from_memory(struct merge_options *o) tree 251 merge-recursive.c struct tree *result = NULL; tree 295 merge-recursive.c static int get_files_dirs(struct merge_options *o, struct tree *tree) tree 300 merge-recursive.c if (read_tree_recursive(tree, "", 0, 0, &match_all, save_files_dirs, o)) tree 311 merge-recursive.c struct tree *o, struct tree *a, struct tree *b, tree 474 merge-recursive.c struct tree *tree, tree 475 merge-recursive.c struct tree *o_tree, tree 476 merge-recursive.c struct tree *a_tree, tree 477 merge-recursive.c struct tree *b_tree, tree 496 merge-recursive.c diff_tree_sha1(o_tree->object.sha1, tree->object.sha1, "", &opts); tree 1804 merge-recursive.c struct tree *head, tree 1805 merge-recursive.c struct tree *merge, tree 1806 merge-recursive.c struct tree *common, tree 1807 merge-recursive.c struct tree **result) tree 1900 merge-recursive.c struct tree *mrtree = mrtree; tree 1926 merge-recursive.c struct tree *tree; tree 1928 merge-recursive.c tree = lookup_tree(EMPTY_TREE_SHA1_BIN); tree 1929 merge-recursive.c merged_common_ancestors = make_virtual_commit(tree, "ancestor"); tree 1962 merge-recursive.c clean = merge_trees(o, h1->tree, h2->tree, merged_common_ancestors->tree, tree 1985 merge-recursive.c return make_virtual_commit((struct tree*)object, name); tree 41 merge-recursive.h struct tree *head, tree 42 merge-recursive.h struct tree *merge, tree 43 merge-recursive.h struct tree *common, tree 44 merge-recursive.h struct tree **result); tree 58 merge-recursive.h struct tree *write_tree_from_memory(struct merge_options *o); tree 51 merge.c struct tree *trees[MAX_UNPACK_TREES]; tree 43 notes-cache.c init_notes(&c->tree, ref.buf, combine_notes_overwrite, flags); tree 52 notes-cache.c if (!c || !c->tree.initialized || !c->tree.ref || !*c->tree.ref) tree 54 notes-cache.c if (!c->tree.dirty) tree 57 notes-cache.c if (write_notes_tree(&c->tree, tree_sha1)) tree 62 notes-cache.c if (update_ref("update notes cache", c->tree.ref, commit_sha1, NULL, tree 77 notes-cache.c value_sha1 = get_note(&c->tree, key_sha1); tree 93 notes-cache.c return add_note(&c->tree, key_sha1, value_sha1, NULL); tree 7 notes-cache.h struct notes_tree tree; tree 606 notes-merge.c base_tree_sha1 = bases->item->tree->object.sha1; tree 613 notes-merge.c base_tree_sha1 = bases->item->tree->object.sha1; tree 640 notes-merge.c result = merge_from_diffs(o, base_tree_sha1, local->tree->object.sha1, tree 641 notes-merge.c remote->tree->object.sha1, local_tree); tree 94 notes.c static void **note_tree_search(struct notes_tree *t, struct int_node **tree, tree 99 notes.c void *p = (*tree)->a[0]; tree 105 notes.c (*tree)->a[0] = NULL; tree 106 notes.c load_subtree(t, l, *tree, *n); tree 108 notes.c return note_tree_search(t, tree, n, key_sha1); tree 113 notes.c p = (*tree)->a[i]; tree 116 notes.c *tree = CLR_PTR_TYPE(p); tree 118 notes.c return note_tree_search(t, tree, n, key_sha1); tree 123 notes.c (*tree)->a[i] = NULL; tree 124 notes.c load_subtree(t, l, *tree, *n); tree 126 notes.c return note_tree_search(t, tree, n, key_sha1); tree 130 notes.c return &((*tree)->a[i]); tree 140 notes.c struct int_node *tree, unsigned char n, tree 143 notes.c void **p = note_tree_search(t, &tree, &n, key_sha1); tree 159 notes.c static int note_tree_consolidate(struct int_node *tree, tree 165 notes.c assert(tree && parent); tree 166 notes.c assert(CLR_PTR_TYPE(parent->a[index]) == tree); tree 169 notes.c if (GET_PTR_TYPE(tree->a[i]) != PTR_TYPE_NULL) { tree 172 notes.c p = tree->a[i]; tree 178 notes.c free(tree); tree 191 notes.c struct int_node *tree, unsigned char n, tree 197 notes.c void **p = note_tree_search(t, &tree, &n, entry->key_sha1); tree 220 notes.c assert(i == n && parent_stack[i] == tree); tree 241 notes.c static int note_tree_insert(struct notes_tree *t, struct int_node *tree, tree 247 notes.c void **p = note_tree_search(t, &tree, &n, entry->key_sha1); tree 271 notes.c note_tree_remove(t, tree, n, entry); tree 280 notes.c load_subtree(t, entry, tree, n); tree 291 notes.c load_subtree(t, l, tree, n); tree 293 notes.c return note_tree_insert(t, tree, n, entry, type, tree 316 notes.c static void note_tree_free(struct int_node *tree) tree 320 notes.c void *p = tree->a[i]; tree 516 notes.c static unsigned char determine_fanout(struct int_node *tree, unsigned char n, tree 531 notes.c switch (GET_PTR_TYPE(tree->a[i])) { tree 557 notes.c static int for_each_note_helper(struct notes_tree *t, struct int_node *tree, tree 567 notes.c fanout = determine_fanout(tree, n, fanout); tree 570 notes.c p = tree->a[i]; tree 611 notes.c tree->a[i] = NULL; tree 612 notes.c load_subtree(t, l, tree, n); tree 199 object.c struct tree *tree = lookup_tree(sha1); tree 200 object.c if (tree) { tree 201 object.c obj = &tree->object; tree 202 object.c if (!tree->buffer) tree 203 object.c tree->object.parsed = 0; tree 204 object.c if (!tree->object.parsed) { tree 205 object.c if (parse_tree_buffer(tree, buffer, size)) tree 1142 pretty.c strbuf_addstr(sb, sha1_to_hex(commit->tree->object.sha1)); tree 1147 pretty.c strbuf_addstr(sb, find_unique_abbrev(commit->tree->object.sha1, tree 272 ref-filter.c strcpy(s, sha1_to_hex(commit->tree->object.sha1)); tree 103 revision.c static void mark_tree_contents_uninteresting(struct tree *tree) tree 107 revision.c struct object *obj = &tree->object; tree 111 revision.c if (parse_tree(tree) < 0) tree 114 revision.c init_tree_desc(&desc, tree->buffer, tree->size); tree 133 revision.c free_tree_buffer(tree); tree 136 revision.c void mark_tree_uninteresting(struct tree *tree) tree 138 revision.c struct object *obj = &tree->object; tree 140 revision.c if (!tree) tree 145 revision.c mark_tree_contents_uninteresting(tree); tree 327 revision.c struct tree *tree = (struct tree *)object; tree 331 revision.c mark_tree_contents_uninteresting(tree); tree 488 revision.c struct tree *t1 = parent->tree; tree 489 revision.c struct tree *t2 = commit->tree; tree 525 revision.c struct tree *t1 = commit->tree; tree 663 revision.c if (!commit->tree) tree 1326 revision.c struct tree *tree = lookup_tree(it->sha1); tree 1327 revision.c add_pending_object_with_path(revs, &tree->object, "", tree 257 revision.h extern void mark_tree_uninteresting(struct tree *tree); tree 205 sequencer.c static struct tree *empty_tree(void) tree 281 sequencer.c struct tree *result, *next_tree, *base_tree, *head_tree; tree 296 sequencer.c next_tree = next ? next->tree : empty_tree(); tree 297 sequencer.c base_tree = base ? base->tree : empty_tree(); tree 349 sequencer.c return !hashcmp(active_cache_tree->sha1, head_commit->tree->object.sha1); tree 406 sequencer.c ptree_sha1 = parent->tree->object.sha1; tree 411 sequencer.c return !hashcmp(ptree_sha1, commit->tree->object.sha1); tree 659 sha1_name.c o = &(((struct commit *) o)->tree->object); tree 1460 sha1_name.c hashcpy(oc->tree, tree_sha1); tree 7 test-match-trees.c struct tree *one, *two; tree 419 tree-walk.c void *tree; tree 462 tree-walk.c void *tree; tree 466 tree-walk.c tree = read_object_with_reference(tree_sha1, tree_type, &size, root); tree 467 tree-walk.c if (!tree) tree 472 tree-walk.c free(tree); tree 480 tree-walk.c init_tree_desc(&t, tree, size); tree 483 tree-walk.c free(tree); tree 532 tree-walk.c void *tree; tree 535 tree-walk.c tree = read_object_with_reference(current_tree_sha1, tree 538 tree-walk.c if (!tree) tree 542 tree-walk.c parents[parents_nr].tree = tree; tree 557 tree-walk.c init_tree_desc(&t, tree, size); tree 588 tree-walk.c free(parent->tree); tree 591 tree-walk.c init_tree_desc(&t, parent->tree, parent->size); tree 670 tree-walk.c init_tree_desc(&t, parent->tree, parent->size); tree 680 tree-walk.c free(parents[i].tree); tree 55 tree.c static int read_tree_1(struct tree *tree, struct strbuf *base, tree 65 tree.c if (parse_tree(tree)) tree 68 tree.c init_tree_desc(&desc, tree->buffer, tree->size); tree 105 tree.c hashcpy(sha1, commit->tree->object.sha1); tree 123 tree.c int read_tree_recursive(struct tree *tree, tree 132 tree.c ret = read_tree_1(tree, &sb, stage, pathspec, fn, context); tree 147 tree.c int read_tree(struct tree *tree, int stage, struct pathspec *match) tree 175 tree.c err = read_tree_recursive(tree, "", 0, stage, match, fn, NULL); tree 188 tree.c struct tree *lookup_tree(const unsigned char *sha1) tree 196 tree.c int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size) tree 207 tree.c int parse_tree_gently(struct tree *item, int quiet_on_missing) tree 228 tree.c void free_tree_buffer(struct tree *tree) tree 230 tree.c free(tree->buffer); tree 231 tree.c tree->buffer = NULL; tree 232 tree.c tree->size = 0; tree 233 tree.c tree->object.parsed = 0; tree 236 tree.c struct tree *parse_tree_indirect(const unsigned char *sha1) tree 243 tree.c return (struct tree *) obj; tree 245 tree.c obj = &(((struct commit *) obj)->tree->object); tree 15 tree.h struct tree *lookup_tree(const unsigned char *sha1); tree 17 tree.h int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size); tree 19 tree.h int parse_tree_gently(struct tree *tree, int quiet_on_missing); tree 20 tree.h static inline int parse_tree(struct tree *tree) tree 22 tree.h return parse_tree_gently(tree, 0); tree 24 tree.h void free_tree_buffer(struct tree *tree); tree 27 tree.h struct tree *parse_tree_indirect(const unsigned char *sha1); tree 32 tree.h extern int read_tree_recursive(struct tree *tree, tree 37 tree.h extern int read_tree(struct tree *tree, int stage, struct pathspec *pathspec); tree 31 walker.c static int process_tree(struct walker *walker, struct tree *tree) tree 36 walker.c if (parse_tree(tree)) tree 39 walker.c init_tree_desc(&desc, tree->buffer, tree->size); tree 47 walker.c struct tree *tree = lookup_tree(entry.sha1); tree 48 walker.c if (tree) tree 49 walker.c obj = &tree->object; tree 59 walker.c free_tree_buffer(tree); tree 87 walker.c if (process(walker, &commit->tree->object)) tree 120 walker.c if (process_tree(walker, (struct tree *)obj))