]>
Commit | Line | Data |
---|---|---|
8f1d2e6f | 1 | #include "cache.h" |
af3785dc | 2 | #include "cache-tree.h" |
175785e5 | 3 | #include "tree.h" |
cbd53a21 | 4 | #include "object-store.h" |
175785e5 | 5 | #include "blob.h" |
77675e2a DB |
6 | #include "commit.h" |
7 | #include "tag.h" | |
14ba97f8 | 8 | #include "alloc.h" |
136f2e54 | 9 | #include "tree-walk.h" |
109cd76d | 10 | #include "repository.h" |
175785e5 DB |
11 | |
12 | const char *tree_type = "tree"; | |
13 | ||
6c9fc42e ÆAB |
14 | int read_tree_at(struct repository *r, |
15 | struct tree *tree, struct strbuf *base, | |
6c9fc42e ÆAB |
16 | const struct pathspec *pathspec, |
17 | read_tree_fn_t fn, void *context) | |
94537c78 | 18 | { |
0790a42a | 19 | struct tree_desc desc; |
4c068a98 | 20 | struct name_entry entry; |
f26efc58 | 21 | struct object_id oid; |
d688cf07 NTND |
22 | int len, oldlen = base->len; |
23 | enum interesting retval = entry_not_interesting; | |
0790a42a | 24 | |
521698b1 DB |
25 | if (parse_tree(tree)) |
26 | return -1; | |
0790a42a | 27 | |
6fda5e51 | 28 | init_tree_desc(&desc, tree->buffer, tree->size); |
0790a42a | 29 | |
4c068a98 | 30 | while (tree_entry(&desc, &entry)) { |
d688cf07 | 31 | if (retval != all_entries_interesting) { |
67022e02 NTND |
32 | retval = tree_entry_interesting(r->index, &entry, |
33 | base, 0, pathspec); | |
d688cf07 | 34 | if (retval == all_entries_not_interesting) |
ffd31f66 | 35 | break; |
d688cf07 | 36 | if (retval == entry_not_interesting) |
ffd31f66 NTND |
37 | continue; |
38 | } | |
0ca14a57 | 39 | |
ea82b2a0 | 40 | switch (fn(&entry.oid, base, |
47957485 | 41 | entry.path, entry.mode, context)) { |
3c5e8468 LT |
42 | case 0: |
43 | continue; | |
44 | case READ_TREE_RECURSIVE: | |
ba19a808 | 45 | break; |
3c5e8468 LT |
46 | default: |
47 | return -1; | |
48 | } | |
d3bee161 | 49 | |
ffd31f66 | 50 | if (S_ISDIR(entry.mode)) |
ea82b2a0 | 51 | oidcpy(&oid, &entry.oid); |
ffd31f66 NTND |
52 | else if (S_ISGITLINK(entry.mode)) { |
53 | struct commit *commit; | |
d3bee161 | 54 | |
371820d5 | 55 | commit = lookup_commit(r, &entry.oid); |
d3bee161 | 56 | if (!commit) |
ffd31f66 | 57 | die("Commit %s in submodule path %s%s not found", |
ea82b2a0 | 58 | oid_to_hex(&entry.oid), |
ffd31f66 | 59 | base->buf, entry.path); |
d3bee161 LH |
60 | |
61 | if (parse_commit(commit)) | |
ffd31f66 | 62 | die("Invalid commit %s in submodule path %s%s", |
ea82b2a0 | 63 | oid_to_hex(&entry.oid), |
ffd31f66 NTND |
64 | base->buf, entry.path); |
65 | ||
2e27bd77 | 66 | oidcpy(&oid, get_commit_tree_oid(commit)); |
94537c78 | 67 | } |
ffd31f66 NTND |
68 | else |
69 | continue; | |
70 | ||
0de16337 | 71 | len = tree_entry_len(&entry); |
ffd31f66 NTND |
72 | strbuf_add(base, entry.path, len); |
73 | strbuf_addch(base, '/'); | |
6c9fc42e | 74 | retval = read_tree_at(r, lookup_tree(r, &oid), |
47957485 | 75 | base, pathspec, |
6c9fc42e | 76 | fn, context); |
ffd31f66 NTND |
77 | strbuf_setlen(base, oldlen); |
78 | if (retval) | |
79 | return -1; | |
94537c78 LT |
80 | } |
81 | return 0; | |
82 | } | |
83 | ||
47957485 ÆAB |
84 | int read_tree(struct repository *r, |
85 | struct tree *tree, | |
86 | const struct pathspec *pathspec, | |
87 | read_tree_fn_t fn, void *context) | |
ffd31f66 NTND |
88 | { |
89 | struct strbuf sb = STRBUF_INIT; | |
47957485 | 90 | int ret = read_tree_at(r, tree, &sb, pathspec, fn, context); |
ffd31f66 | 91 | strbuf_release(&sb); |
ffd31f66 NTND |
92 | return ret; |
93 | } | |
94 | ||
70912f66 | 95 | int cmp_cache_name_compare(const void *a_, const void *b_) |
af3785dc JH |
96 | { |
97 | const struct cache_entry *ce1, *ce2; | |
98 | ||
99 | ce1 = *((const struct cache_entry **)a_); | |
100 | ce2 = *((const struct cache_entry **)b_); | |
b60e188c TG |
101 | return cache_name_stage_compare(ce1->name, ce1->ce_namelen, ce_stage(ce1), |
102 | ce2->name, ce2->ce_namelen, ce_stage(ce2)); | |
af3785dc JH |
103 | } |
104 | ||
f58a6cb6 | 105 | struct tree *lookup_tree(struct repository *r, const struct object_id *oid) |
175785e5 | 106 | { |
d0229abd | 107 | struct object *obj = lookup_object(r, oid); |
100c5f3b | 108 | if (!obj) |
a378509e | 109 | return create_object(r, oid, alloc_tree_node(r)); |
6da43d93 | 110 | return object_as_type(obj, OBJ_TREE, 0); |
175785e5 DB |
111 | } |
112 | ||
2d9c58c6 LT |
113 | int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size) |
114 | { | |
175785e5 DB |
115 | if (item->object.parsed) |
116 | return 0; | |
117 | item->object.parsed = 1; | |
136f2e54 LT |
118 | item->buffer = buffer; |
119 | item->size = size; | |
120 | ||
2d9c58c6 LT |
121 | return 0; |
122 | } | |
123 | ||
9cc2b07a | 124 | int parse_tree_gently(struct tree *item, int quiet_on_missing) |
bd2c39f5 | 125 | { |
21666f1a | 126 | enum object_type type; |
bd2c39f5 NP |
127 | void *buffer; |
128 | unsigned long size; | |
bd2c39f5 NP |
129 | |
130 | if (item->object.parsed) | |
131 | return 0; | |
b4f5aca4 | 132 | buffer = read_object_file(&item->object.oid, &type, &size); |
bd2c39f5 | 133 | if (!buffer) |
9cc2b07a JK |
134 | return quiet_on_missing ? -1 : |
135 | error("Could not read %s", | |
f2fd0760 | 136 | oid_to_hex(&item->object.oid)); |
21666f1a | 137 | if (type != OBJ_TREE) { |
bd2c39f5 NP |
138 | free(buffer); |
139 | return error("Object %s not a tree", | |
f2fd0760 | 140 | oid_to_hex(&item->object.oid)); |
bd2c39f5 | 141 | } |
136f2e54 | 142 | return parse_tree_buffer(item, buffer, size); |
bd2c39f5 | 143 | } |
77675e2a | 144 | |
6e454b9a JK |
145 | void free_tree_buffer(struct tree *tree) |
146 | { | |
6a83d902 | 147 | FREE_AND_NULL(tree->buffer); |
6e454b9a JK |
148 | tree->size = 0; |
149 | tree->object.parsed = 0; | |
150 | } | |
151 | ||
a9dbc179 | 152 | struct tree *parse_tree_indirect(const struct object_id *oid) |
77675e2a | 153 | { |
1577dc0f RS |
154 | struct repository *r = the_repository; |
155 | struct object *obj = parse_object(r, oid); | |
156 | return (struct tree *)repo_peel_to_type(r, NULL, 0, obj, OBJ_TREE); | |
77675e2a | 157 | } |