Merge branch 'dt/remote-helper-doc-re-lock-option'
[git/git.git] / tree.c
CommitLineData
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
12const char *tree_type = "tree";
13
85ab50f9 14static int read_one_entry_opt(struct index_state *istate,
df46d77e 15 const struct object_id *oid,
85ab50f9
BW
16 const char *base, int baselen,
17 const char *pathname,
18 unsigned mode, int stage, int opt)
94537c78 19{
3c5e8468 20 int len;
3c5e8468
LT
21 struct cache_entry *ce;
22
23 if (S_ISDIR(mode))
24 return READ_TREE_RECURSIVE;
25
26 len = strlen(pathname);
a849735b 27 ce = make_empty_cache_entry(istate, baselen + len);
94537c78
LT
28
29 ce->ce_mode = create_ce_mode(mode);
b60e188c
TG
30 ce->ce_flags = create_ce_flags(stage);
31 ce->ce_namelen = baselen + len;
94537c78
LT
32 memcpy(ce->name, base, baselen);
33 memcpy(ce->name + baselen, pathname, len+1);
df46d77e 34 oidcpy(&ce->oid, oid);
85ab50f9 35 return add_index_entry(istate, ce, opt);
af3785dc
JH
36}
37
df46d77e 38static int read_one_entry(const struct object_id *oid, struct strbuf *base,
6a0b0b6d
NTND
39 const char *pathname, unsigned mode, int stage,
40 void *context)
af3785dc 41{
85ab50f9 42 struct index_state *istate = context;
df46d77e 43 return read_one_entry_opt(istate, oid, base->buf, base->len, pathname,
6a0b0b6d 44 mode, stage,
af3785dc
JH
45 ADD_CACHE_OK_TO_ADD|ADD_CACHE_SKIP_DFCHECK);
46}
47
48/*
49 * This is used when the caller knows there is no existing entries at
50 * the stage that will conflict with the entry being added.
51 */
df46d77e 52static int read_one_entry_quick(const struct object_id *oid, struct strbuf *base,
6a0b0b6d
NTND
53 const char *pathname, unsigned mode, int stage,
54 void *context)
af3785dc 55{
85ab50f9 56 struct index_state *istate = context;
df46d77e 57 return read_one_entry_opt(istate, oid, base->buf, base->len, pathname,
6a0b0b6d 58 mode, stage,
af3785dc 59 ADD_CACHE_JUST_APPEND);
94537c78
LT
60}
61
e092073d
NTND
62static int read_tree_1(struct repository *r,
63 struct tree *tree, struct strbuf *base,
18e4f405 64 int stage, const struct pathspec *pathspec,
ffd31f66 65 read_tree_fn_t fn, void *context)
94537c78 66{
0790a42a 67 struct tree_desc desc;
4c068a98 68 struct name_entry entry;
f26efc58 69 struct object_id oid;
d688cf07
NTND
70 int len, oldlen = base->len;
71 enum interesting retval = entry_not_interesting;
0790a42a 72
521698b1
DB
73 if (parse_tree(tree))
74 return -1;
0790a42a 75
6fda5e51 76 init_tree_desc(&desc, tree->buffer, tree->size);
0790a42a 77
4c068a98 78 while (tree_entry(&desc, &entry)) {
d688cf07 79 if (retval != all_entries_interesting) {
67022e02
NTND
80 retval = tree_entry_interesting(r->index, &entry,
81 base, 0, pathspec);
d688cf07 82 if (retval == all_entries_not_interesting)
ffd31f66 83 break;
d688cf07 84 if (retval == entry_not_interesting)
ffd31f66
NTND
85 continue;
86 }
0ca14a57 87
ea82b2a0 88 switch (fn(&entry.oid, base,
ffd31f66 89 entry.path, entry.mode, stage, context)) {
3c5e8468
LT
90 case 0:
91 continue;
92 case READ_TREE_RECURSIVE:
ba19a808 93 break;
3c5e8468
LT
94 default:
95 return -1;
96 }
d3bee161 97
ffd31f66 98 if (S_ISDIR(entry.mode))
ea82b2a0 99 oidcpy(&oid, &entry.oid);
ffd31f66
NTND
100 else if (S_ISGITLINK(entry.mode)) {
101 struct commit *commit;
d3bee161 102
371820d5 103 commit = lookup_commit(r, &entry.oid);
d3bee161 104 if (!commit)
ffd31f66 105 die("Commit %s in submodule path %s%s not found",
ea82b2a0 106 oid_to_hex(&entry.oid),
ffd31f66 107 base->buf, entry.path);
d3bee161
LH
108
109 if (parse_commit(commit))
ffd31f66 110 die("Invalid commit %s in submodule path %s%s",
ea82b2a0 111 oid_to_hex(&entry.oid),
ffd31f66
NTND
112 base->buf, entry.path);
113
2e27bd77 114 oidcpy(&oid, get_commit_tree_oid(commit));
94537c78 115 }
ffd31f66
NTND
116 else
117 continue;
118
0de16337 119 len = tree_entry_len(&entry);
ffd31f66
NTND
120 strbuf_add(base, entry.path, len);
121 strbuf_addch(base, '/');
e092073d 122 retval = read_tree_1(r, lookup_tree(r, &oid),
ffd31f66
NTND
123 base, stage, pathspec,
124 fn, context);
125 strbuf_setlen(base, oldlen);
126 if (retval)
127 return -1;
94537c78
LT
128 }
129 return 0;
130}
131
e092073d
NTND
132int read_tree_recursive(struct repository *r,
133 struct tree *tree,
ffd31f66 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);
e092073d 142 ret = read_tree_1(r, 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
e092073d
NTND
157int read_tree(struct repository *r, struct tree *tree, int stage,
158 struct pathspec *match, 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;
e092073d 186 err = read_tree_recursive(r, 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
f58a6cb6 198struct tree *lookup_tree(struct repository *r, const struct object_id *oid)
175785e5 199{
d0229abd 200 struct object *obj = lookup_object(r, oid);
100c5f3b 201 if (!obj)
a378509e 202 return create_object(r, oid, alloc_tree_node(r));
f58a6cb6 203 return object_as_type(r, obj, OBJ_TREE, 0);
175785e5
DB
204}
205
2d9c58c6
LT
206int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size)
207{
175785e5
DB
208 if (item->object.parsed)
209 return 0;
210 item->object.parsed = 1;
136f2e54
LT
211 item->buffer = buffer;
212 item->size = size;
213
2d9c58c6
LT
214 return 0;
215}
216
9cc2b07a 217int parse_tree_gently(struct tree *item, int quiet_on_missing)
bd2c39f5 218{
21666f1a 219 enum object_type type;
bd2c39f5
NP
220 void *buffer;
221 unsigned long size;
bd2c39f5
NP
222
223 if (item->object.parsed)
224 return 0;
b4f5aca4 225 buffer = read_object_file(&item->object.oid, &type, &size);
bd2c39f5 226 if (!buffer)
9cc2b07a
JK
227 return quiet_on_missing ? -1 :
228 error("Could not read %s",
f2fd0760 229 oid_to_hex(&item->object.oid));
21666f1a 230 if (type != OBJ_TREE) {
bd2c39f5
NP
231 free(buffer);
232 return error("Object %s not a tree",
f2fd0760 233 oid_to_hex(&item->object.oid));
bd2c39f5 234 }
136f2e54 235 return parse_tree_buffer(item, buffer, size);
bd2c39f5 236}
77675e2a 237
6e454b9a
JK
238void free_tree_buffer(struct tree *tree)
239{
6a83d902 240 FREE_AND_NULL(tree->buffer);
6e454b9a
JK
241 tree->size = 0;
242 tree->object.parsed = 0;
243}
244
a9dbc179 245struct tree *parse_tree_indirect(const struct object_id *oid)
77675e2a 246{
1577dc0f
RS
247 struct repository *r = the_repository;
248 struct object *obj = parse_object(r, oid);
249 return (struct tree *)repo_peel_to_type(r, NULL, 0, obj, OBJ_TREE);
77675e2a 250}