9 #include "list-objects.h"
11 static void process_blob(struct rev_info *revs,
13 struct object_array *p,
14 struct name_path *path,
17 struct object *obj = &blob->object;
19 if (!revs->blob_objects)
21 if (obj->flags & (UNINTERESTING | SEEN))
25 add_object(obj, p, path, name);
28 static void process_tree(struct rev_info *revs,
30 struct object_array *p,
31 struct name_path *path,
34 struct object *obj = &tree->object;
35 struct tree_desc desc;
36 struct name_entry entry;
39 if (!revs->tree_objects)
41 if (obj->flags & (UNINTERESTING | SEEN))
43 if (parse_tree(tree) < 0)
44 die("bad tree object %s", sha1_to_hex(obj->sha1));
47 add_object(obj, p, path, name);
50 me.elem_len = strlen(name);
52 desc.buf = tree->buffer;
53 desc.size = tree->size;
55 while (tree_entry(&desc, &entry)) {
56 if (S_ISDIR(entry.mode))
58 lookup_tree(entry.sha1),
62 lookup_blob(entry.sha1),
69 void traverse_commit_list(struct rev_info *revs,
70 void (*show_commit)(struct commit *),
71 void (*show_object)(struct object_array_entry *))
74 struct commit *commit;
75 struct object_array objects = { 0, 0, NULL };
77 while ((commit = get_revision(revs)) != NULL) {
78 process_tree(revs, commit->tree, &objects, NULL, "");
81 for (i = 0; i < revs->pending.nr; i++) {
82 struct object_array_entry *pending = revs->pending.objects + i;
83 struct object *obj = pending->item;
84 const char *name = pending->name;
85 if (obj->flags & (UNINTERESTING | SEEN))
87 if (obj->type == OBJ_TAG) {
89 add_object_array(obj, name, &objects);
92 if (obj->type == OBJ_TREE) {
93 process_tree(revs, (struct tree *)obj, &objects,
97 if (obj->type == OBJ_BLOB) {
98 process_blob(revs, (struct blob *)obj, &objects,
102 die("unknown pending object %s (%s)",
103 sha1_to_hex(obj->sha1), name);
105 for (i = 0; i < objects.nr; i++)
106 show_object(&objects.objects[i]);