commit: add repository argument to lookup_commit
[git/git.git] / tree.c
CommitLineData
85ab50f9 1#define NO_THE_INDEX_COMPATIBILITY_MACROS
8f1d2e6f 2#include "cache.h"
af3785dc 3#include "cache-tree.h"
175785e5 4#include "tree.h"
cbd53a21 5#include "object-store.h"
175785e5 6#include "blob.h"
77675e2a
DB
7#include "commit.h"
8#include "tag.h"
14ba97f8 9#include "alloc.h"
136f2e54 10#include "tree-walk.h"
109cd76d 11#include "repository.h"
175785e5
DB
12
13const char *tree_type = "tree";
14
85ab50f9 15static int read_one_entry_opt(struct index_state *istate,
df46d77e 16 const struct object_id *oid,
85ab50f9
BW
17 const char *base, int baselen,
18 const char *pathname,
19 unsigned mode, int stage, int opt)
94537c78 20{
3c5e8468
LT
21 int len;
22 unsigned int size;
23 struct cache_entry *ce;
24
25 if (S_ISDIR(mode))
26 return READ_TREE_RECURSIVE;
27
28 len = strlen(pathname);
29 size = cache_entry_size(baselen + len);
90321c10 30 ce = xcalloc(1, size);
94537c78
LT
31
32 ce->ce_mode = create_ce_mode(mode);
b60e188c
TG
33 ce->ce_flags = create_ce_flags(stage);
34 ce->ce_namelen = baselen + len;
94537c78
LT
35 memcpy(ce->name, base, baselen);
36 memcpy(ce->name + baselen, pathname, len+1);
df46d77e 37 oidcpy(&ce->oid, oid);
85ab50f9 38 return add_index_entry(istate, ce, opt);
af3785dc
JH
39}
40
df46d77e 41static int read_one_entry(const struct object_id *oid, struct strbuf *base,
6a0b0b6d
NTND
42 const char *pathname, unsigned mode, int stage,
43 void *context)
af3785dc 44{
85ab50f9 45 struct index_state *istate = context;
df46d77e 46 return read_one_entry_opt(istate, oid, base->buf, base->len, pathname,
6a0b0b6d 47 mode, stage,
af3785dc
JH
48 ADD_CACHE_OK_TO_ADD|ADD_CACHE_SKIP_DFCHECK);
49}
50
51/*
52 * This is used when the caller knows there is no existing entries at
53 * the stage that will conflict with the entry being added.
54 */
df46d77e 55static int read_one_entry_quick(const struct object_id *oid, struct strbuf *base,
6a0b0b6d
NTND
56 const char *pathname, unsigned mode, int stage,
57 void *context)
af3785dc 58{
85ab50f9 59 struct index_state *istate = context;
df46d77e 60 return read_one_entry_opt(istate, oid, base->buf, base->len, pathname,
6a0b0b6d 61 mode, stage,
af3785dc 62 ADD_CACHE_JUST_APPEND);
94537c78
LT
63}
64
ffd31f66 65static int read_tree_1(struct tree *tree, struct strbuf *base,
18e4f405 66 int stage, const struct pathspec *pathspec,
ffd31f66 67 read_tree_fn_t fn, void *context)
94537c78 68{
0790a42a 69 struct tree_desc desc;
4c068a98 70 struct name_entry entry;
f26efc58 71 struct object_id oid;
d688cf07
NTND
72 int len, oldlen = base->len;
73 enum interesting retval = entry_not_interesting;
0790a42a 74
521698b1
DB
75 if (parse_tree(tree))
76 return -1;
0790a42a 77
6fda5e51 78 init_tree_desc(&desc, tree->buffer, tree->size);
0790a42a 79
4c068a98 80 while (tree_entry(&desc, &entry)) {
d688cf07 81 if (retval != all_entries_interesting) {
ffd31f66 82 retval = tree_entry_interesting(&entry, base, 0, pathspec);
d688cf07 83 if (retval == all_entries_not_interesting)
ffd31f66 84 break;
d688cf07 85 if (retval == entry_not_interesting)
ffd31f66
NTND
86 continue;
87 }
0ca14a57 88
df46d77e 89 switch (fn(entry.oid, base,
ffd31f66 90 entry.path, entry.mode, stage, context)) {
3c5e8468
LT
91 case 0:
92 continue;
93 case READ_TREE_RECURSIVE:
ba19a808 94 break;
3c5e8468
LT
95 default:
96 return -1;
97 }
d3bee161 98
ffd31f66 99 if (S_ISDIR(entry.mode))
f26efc58 100 oidcpy(&oid, entry.oid);
ffd31f66
NTND
101 else if (S_ISGITLINK(entry.mode)) {
102 struct commit *commit;
d3bee161 103
c1f5eb49 104 commit = lookup_commit(the_repository, entry.oid);
d3bee161 105 if (!commit)
ffd31f66 106 die("Commit %s in submodule path %s%s not found",
7d924c91 107 oid_to_hex(entry.oid),
ffd31f66 108 base->buf, entry.path);
d3bee161
LH
109
110 if (parse_commit(commit))
ffd31f66 111 die("Invalid commit %s in submodule path %s%s",
7d924c91 112 oid_to_hex(entry.oid),
ffd31f66
NTND
113 base->buf, entry.path);
114
2e27bd77 115 oidcpy(&oid, get_commit_tree_oid(commit));
94537c78 116 }
ffd31f66
NTND
117 else
118 continue;
119
0de16337 120 len = tree_entry_len(&entry);
ffd31f66
NTND
121 strbuf_add(base, entry.path, len);
122 strbuf_addch(base, '/');
f86bcc7b 123 retval = read_tree_1(lookup_tree(the_repository, &oid),
ffd31f66
NTND
124 base, stage, pathspec,
125 fn, context);
126 strbuf_setlen(base, oldlen);
127 if (retval)
128 return -1;
94537c78
LT
129 }
130 return 0;
131}
132
ffd31f66
NTND
133int read_tree_recursive(struct tree *tree,
134 const char *base, int baselen,
18e4f405 135 int stage, const struct pathspec *pathspec,
ffd31f66
NTND
136 read_tree_fn_t fn, void *context)
137{
138 struct strbuf sb = STRBUF_INIT;
f0096c06 139 int ret;
ffd31f66 140
ffd31f66 141 strbuf_add(&sb, base, baselen);
f0096c06 142 ret = read_tree_1(tree, &sb, stage, pathspec, fn, context);
ffd31f66 143 strbuf_release(&sb);
ffd31f66
NTND
144 return ret;
145}
146
af3785dc
JH
147static int cmp_cache_name_compare(const void *a_, const void *b_)
148{
149 const struct cache_entry *ce1, *ce2;
150
151 ce1 = *((const struct cache_entry **)a_);
152 ce2 = *((const struct cache_entry **)b_);
b60e188c
TG
153 return cache_name_stage_compare(ce1->name, ce1->ce_namelen, ce_stage(ce1),
154 ce2->name, ce2->ce_namelen, ce_stage(ce2));
af3785dc
JH
155}
156
85ab50f9
BW
157int read_tree(struct tree *tree, int stage, struct pathspec *match,
158 struct index_state *istate)
94537c78 159{
af3785dc
JH
160 read_tree_fn_t fn = NULL;
161 int i, err;
162
163 /*
164 * Currently the only existing callers of this function all
165 * call it with stage=1 and after making sure there is nothing
166 * at that stage; we could always use read_one_entry_quick().
167 *
168 * But when we decide to straighten out git-read-tree not to
169 * use unpack_trees() in some cases, this will probably start
170 * to matter.
171 */
172
173 /*
174 * See if we have cache entry at the stage. If so,
175 * do it the original slow way, otherwise, append and then
176 * sort at the end.
177 */
85ab50f9
BW
178 for (i = 0; !fn && i < istate->cache_nr; i++) {
179 const struct cache_entry *ce = istate->cache[i];
af3785dc
JH
180 if (ce_stage(ce) == stage)
181 fn = read_one_entry;
182 }
183
184 if (!fn)
185 fn = read_one_entry_quick;
85ab50f9 186 err = read_tree_recursive(tree, "", 0, stage, match, fn, istate);
af3785dc
JH
187 if (fn == read_one_entry || err)
188 return err;
189
190 /*
191 * Sort the cache entry -- we need to nuke the cache tree, though.
192 */
85ab50f9
BW
193 cache_tree_free(&istate->cache_tree);
194 QSORT(istate->cache, istate->cache_nr, cmp_cache_name_compare);
af3785dc 195 return 0;
94537c78
LT
196}
197
f86bcc7b 198struct tree *lookup_tree_the_repository(const struct object_id *oid)
175785e5 199{
5abddd1e 200 struct object *obj = lookup_object(the_repository, oid->hash);
100c5f3b 201 if (!obj)
68f95d38 202 return create_object(the_repository, oid->hash,
cf7203bd 203 alloc_tree_node(the_repository));
1268dfac 204 return object_as_type(the_repository, obj, OBJ_TREE, 0);
175785e5
DB
205}
206
2d9c58c6
LT
207int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size)
208{
175785e5
DB
209 if (item->object.parsed)
210 return 0;
211 item->object.parsed = 1;
136f2e54
LT
212 item->buffer = buffer;
213 item->size = size;
214
2d9c58c6
LT
215 return 0;
216}
217
9cc2b07a 218int parse_tree_gently(struct tree *item, int quiet_on_missing)
bd2c39f5 219{
21666f1a 220 enum object_type type;
bd2c39f5
NP
221 void *buffer;
222 unsigned long size;
bd2c39f5
NP
223
224 if (item->object.parsed)
225 return 0;
b4f5aca4 226 buffer = read_object_file(&item->object.oid, &type, &size);
bd2c39f5 227 if (!buffer)
9cc2b07a
JK
228 return quiet_on_missing ? -1 :
229 error("Could not read %s",
f2fd0760 230 oid_to_hex(&item->object.oid));
21666f1a 231 if (type != OBJ_TREE) {
bd2c39f5
NP
232 free(buffer);
233 return error("Object %s not a tree",
f2fd0760 234 oid_to_hex(&item->object.oid));
bd2c39f5 235 }
136f2e54 236 return parse_tree_buffer(item, buffer, size);
bd2c39f5 237}
77675e2a 238
6e454b9a
JK
239void free_tree_buffer(struct tree *tree)
240{
6a83d902 241 FREE_AND_NULL(tree->buffer);
6e454b9a
JK
242 tree->size = 0;
243 tree->object.parsed = 0;
244}
245
a9dbc179 246struct tree *parse_tree_indirect(const struct object_id *oid)
77675e2a 247{
109cd76d 248 struct object *obj = parse_object(the_repository, oid);
77675e2a
DB
249 do {
250 if (!obj)
251 return NULL;
1974632c 252 if (obj->type == OBJ_TREE)
77675e2a 253 return (struct tree *) obj;
1974632c 254 else if (obj->type == OBJ_COMMIT)
2e27bd77 255 obj = &(get_commit_tree(((struct commit *)obj))->object);
1974632c 256 else if (obj->type == OBJ_TAG)
77675e2a
DB
257 obj = ((struct tag *) obj)->tagged;
258 else
259 return NULL;
260 if (!obj->parsed)
109cd76d 261 parse_object(the_repository, &obj->oid);
77675e2a
DB
262 } while (1);
263}