151
return (struct tree *) obj;
152
}
153
154
-int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size)
154
+static int track_tree_refs(struct tree *item)
155
{
156
+ int n_refs = 0, i;
157
+ struct object_refs *refs;
158
struct tree_desc desc;
157
- struct tree_entry_list **list_p;
158
- int n_refs = 0;
159
160
+ /* Count how many entries there are.. */
161
+ desc.buf = item->buffer;
162
+ desc.size = item->size;
163
+ while (desc.size) {
164
+ n_refs++;
165
+ update_tree_entry(&desc);
166
+ }
167
+
168
+ /* Allocate object refs and walk it again.. */
169
+ i = 0;
170
+ refs = alloc_object_refs(n_refs);
171
+ desc.buf = item->buffer;
172
+ desc.size = item->size;
173
+ while (desc.size) {
174
+ unsigned mode;
175
+ const char *name;
176
+ const unsigned char *sha1;
177
+ struct object *obj;
178
+
179
+ sha1 = tree_entry_extract(&desc, &name, &mode);
180
+ update_tree_entry(&desc);
181
+ if (S_ISDIR(mode))
182
+ obj = &lookup_tree(sha1)->object;
183
+ else
184
+ obj = &lookup_blob(sha1)->object;
185
+ refs->ref[i++] = obj;
186
+ }
187
+ set_object_refs(&item->object, refs);
188
+ return 0;
189
+}
190
+
191
+int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size)
192
+{
193
if (item->object.parsed)
194
return 0;
195
item->object.parsed = 1;
196
item->buffer = buffer;
197
item->size = size;
198
166
- desc.buf = buffer;
167
- desc.size = size;
199
+ if (track_object_refs)
200
+ track_tree_refs(item);
201
+ return 0;
202
+}
203
+
204
+struct tree_entry_list *create_tree_entry_list(struct tree *tree)
205
+{
206
+ struct tree_desc desc;
207
+ struct tree_entry_list *ret = NULL;
208
+ struct tree_entry_list **list_p = &ret;
209
+
210
+ desc.buf = tree->buffer;
211
+ desc.size = tree->size;
212
169
- list_p = &item->entries;
213
while (desc.size) {
214
unsigned mode;
215
const char *path;
229
entry->next = NULL;
230
231
update_tree_entry(&desc);
189
- n_refs++;
232
*list_p = entry;
233
list_p = &entry->next;
234
}
235
+ return ret;
236
+}
237
194
- if (track_object_refs) {
195
- struct tree_entry_list *entry;
196
- unsigned i = 0;
197
- struct object_refs *refs = alloc_object_refs(n_refs);
198
- for (entry = item->entries; entry; entry = entry->next) {
199
- struct object *obj;
200
-
201
- if (entry->directory)
202
- obj = &lookup_tree(entry->sha1)->object;
203
- else
204
- obj = &lookup_blob(entry->sha1)->object;
205
- refs->ref[i++] = obj;
206
- }
207
-
208
- set_object_refs(&item->object, refs);
238
+void free_tree_entry_list(struct tree_entry_list *list)
239
+{
240
+ while (list) {
241
+ struct tree_entry_list *next = list->next;
242
+ free(list);
243
+ list = next;
244
}
210
-
211
- return 0;
245
}
246
247
int parse_tree(struct tree *item)