5 void init_tree_desc(struct tree_desc *desc, const void *buffer, unsigned long size)
11 void *fill_tree_descriptor(struct tree_desc *desc, const unsigned char *sha1)
13 unsigned long size = 0;
17 buf = read_object_with_reference(sha1, tree_type, &size, NULL);
19 die("unable to read tree %s", sha1_to_hex(sha1));
21 init_tree_desc(desc, buf, size);
25 static int entry_compare(struct name_entry *a, struct name_entry *b)
27 return base_name_compare(
28 a->path, tree_entry_len(a->path, a->sha1), a->mode,
29 b->path, tree_entry_len(b->path, b->sha1), b->mode);
32 static void entry_clear(struct name_entry *a)
34 memset(a, 0, sizeof(*a));
37 static void entry_extract(struct tree_desc *t, struct name_entry *a)
39 a->sha1 = tree_entry_extract(t, &a->path, &a->mode);
42 void update_tree_entry(struct tree_desc *desc)
44 const void *buf = desc->buffer;
45 unsigned long size = desc->size;
46 int len = strlen(buf) + 1 + 20;
49 die("corrupt tree file");
50 desc->buffer = (char *) buf + len;
51 desc->size = size - len;
54 static const char *get_mode(const char *str, unsigned int *modep)
57 unsigned int mode = 0;
59 while ((c = *str++) != ' ') {
60 if (c < '0' || c > '7')
62 mode = (mode << 3) + (c - '0');
68 const unsigned char *tree_entry_extract(struct tree_desc *desc, const char **pathp, unsigned int *modep)
70 const void *tree = desc->buffer;
71 unsigned long size = desc->size;
72 int len = strlen(tree)+1;
73 const unsigned char *sha1 = (unsigned char *) tree + len;
77 path = get_mode(tree, &mode);
78 if (!path || size < len + 20)
79 die("corrupt tree file");
81 *modep = canon_mode(mode);
85 int tree_entry(struct tree_desc *desc, struct name_entry *entry)
87 const void *tree = desc->buffer;
89 unsigned long len, size = desc->size;
94 path = get_mode(tree, &entry->mode);
96 die("corrupt tree file");
102 entry->sha1 = (const unsigned char *) path;
105 len = path - (char *) tree;
107 die("corrupt tree file");
110 desc->size = size - len;
114 void traverse_trees(int n, struct tree_desc *t, const char *base, traverse_callback_t callback)
116 struct name_entry *entry = xmalloc(n*sizeof(*entry));
119 unsigned long mask = 0;
123 for (i = 0; i < n; i++) {
126 entry_extract(t+i, entry+i);
128 int cmp = entry_compare(entry+i, entry+last);
131 * Is the new name bigger than the old one?
137 * Is the new name smaller than the old one?
138 * Ignore all old ones
150 * Update the tree entries we've walked, and clear
151 * all the unused name-entries.
153 for (i = 0; i < n; i++) {
154 if (mask & (1ul << i)) {
155 update_tree_entry(t+i);
158 entry_clear(entry + i);
160 callback(n, mask, entry, base);
165 static int find_tree_entry(struct tree_desc *t, const char *name, unsigned char *result, unsigned *mode)
167 int namelen = strlen(name);
170 const unsigned char *sha1;
173 sha1 = tree_entry_extract(t, &entry, mode);
174 update_tree_entry(t);
175 entrylen = tree_entry_len(entry, sha1);
176 if (entrylen > namelen)
178 cmp = memcmp(name, entry, entrylen);
183 if (entrylen == namelen) {
184 hashcpy(result, sha1);
187 if (name[entrylen] != '/')
191 if (++entrylen == namelen) {
192 hashcpy(result, sha1);
195 return get_tree_entry(sha1, name + entrylen, result, mode);
200 int get_tree_entry(const unsigned char *tree_sha1, const char *name, unsigned char *sha1, unsigned *mode)
206 unsigned char root[20];
208 tree = read_object_with_reference(tree_sha1, tree_type, &size, root);
212 if (name[0] == '\0') {
217 init_tree_desc(&t, tree, size);
218 retval = find_tree_entry(&t, name, sha1, mode);