9 #include "list-objects.h"
11 static void process_blob(struct rev_info
*revs
,
14 struct name_path
*path
,
18 struct object
*obj
= &blob
->object
;
20 if (!revs
->blob_objects
)
23 die("bad blob object");
24 if (obj
->flags
& (UNINTERESTING
| SEEN
))
27 show(obj
, path
, name
, cb_data
);
31 * Processing a gitlink entry currently does nothing, since
32 * we do not recurse into the subproject.
34 * We *could* eventually add a flag that actually does that,
35 * which would involve:
36 * - is the subproject actually checked out?
37 * - if so, see if the subproject has already been added
38 * to the alternates list, and add it if not.
39 * - process the commit (or tag) the gitlink points to
42 * However, it's unclear whether there is really ever any
43 * reason to see superprojects and subprojects as such a
44 * "unified" object pool (potentially resulting in a totally
45 * humongous pack - avoiding which was the whole point of
46 * having gitlinks in the first place!).
48 * So for now, there is just a note that we *could* follow
49 * the link, and how to do it. Whether it necessarily makes
50 * any sense what-so-ever to ever do that is another issue.
52 static void process_gitlink(struct rev_info
*revs
,
53 const unsigned char *sha1
,
55 struct name_path
*path
,
62 static void process_tree(struct rev_info
*revs
,
69 struct object
*obj
= &tree
->object
;
70 struct tree_desc desc
;
71 struct name_entry entry
;
73 enum interesting match
= revs
->diffopt
.pathspec
.nr
== 0 ?
74 all_entries_interesting
: entry_not_interesting
;
75 int baselen
= base
->len
;
77 if (!revs
->tree_objects
)
80 die("bad tree object");
81 if (obj
->flags
& (UNINTERESTING
| SEEN
))
83 if (parse_tree_gently(tree
, revs
->ignore_missing_links
) < 0) {
84 if (revs
->ignore_missing_links
)
86 die("bad tree object %s", sha1_to_hex(obj
->sha1
));
91 show(obj
, &me
, name
, cb_data
);
93 strbuf_addstr(base
, name
);
95 strbuf_addch(base
, '/');
97 init_tree_desc(&desc
, tree
->buffer
, tree
->size
);
99 while (tree_entry(&desc
, &entry
)) {
100 if (match
!= all_entries_interesting
) {
101 match
= tree_entry_interesting(&entry
, base
, 0,
102 &revs
->diffopt
.pathspec
);
103 if (match
== all_entries_not_interesting
)
105 if (match
== entry_not_interesting
)
109 if (S_ISDIR(entry
.mode
))
111 lookup_tree(entry
.sha1
),
112 show
, base
, entry
.path
,
114 else if (S_ISGITLINK(entry
.mode
))
115 process_gitlink(revs
, entry
.sha1
,
116 show
, &me
, entry
.path
,
120 lookup_blob(entry
.sha1
),
121 show
, &me
, entry
.path
,
124 strbuf_setlen(base
, baselen
);
125 free_tree_buffer(tree
);
128 static void mark_edge_parents_uninteresting(struct commit
*commit
,
129 struct rev_info
*revs
,
130 show_edge_fn show_edge
)
132 struct commit_list
*parents
;
134 for (parents
= commit
->parents
; parents
; parents
= parents
->next
) {
135 struct commit
*parent
= parents
->item
;
136 if (!(parent
->object
.flags
& UNINTERESTING
))
138 mark_tree_uninteresting(parent
->tree
);
139 if (revs
->edge_hint
&& !(parent
->object
.flags
& SHOWN
)) {
140 parent
->object
.flags
|= SHOWN
;
146 void mark_edges_uninteresting(struct rev_info
*revs
, show_edge_fn show_edge
)
148 struct commit_list
*list
;
151 for (list
= revs
->commits
; list
; list
= list
->next
) {
152 struct commit
*commit
= list
->item
;
154 if (commit
->object
.flags
& UNINTERESTING
) {
155 mark_tree_uninteresting(commit
->tree
);
156 if (revs
->edge_hint_aggressive
&& !(commit
->object
.flags
& SHOWN
)) {
157 commit
->object
.flags
|= SHOWN
;
162 mark_edge_parents_uninteresting(commit
, revs
, show_edge
);
164 if (revs
->edge_hint_aggressive
) {
165 for (i
= 0; i
< revs
->cmdline
.nr
; i
++) {
166 struct object
*obj
= revs
->cmdline
.rev
[i
].item
;
167 struct commit
*commit
= (struct commit
*)obj
;
168 if (obj
->type
!= OBJ_COMMIT
|| !(obj
->flags
& UNINTERESTING
))
170 mark_tree_uninteresting(commit
->tree
);
171 if (!(obj
->flags
& SHOWN
)) {
179 static void add_pending_tree(struct rev_info
*revs
, struct tree
*tree
)
181 add_pending_object(revs
, &tree
->object
, "");
184 void traverse_commit_list(struct rev_info
*revs
,
185 show_commit_fn show_commit
,
186 show_object_fn show_object
,
190 struct commit
*commit
;
193 strbuf_init(&base
, PATH_MAX
);
194 while ((commit
= get_revision(revs
)) != NULL
) {
196 * an uninteresting boundary commit may not have its tree
197 * parsed yet, but we are not going to show them anyway
200 add_pending_tree(revs
, commit
->tree
);
201 show_commit(commit
, data
);
203 for (i
= 0; i
< revs
->pending
.nr
; i
++) {
204 struct object_array_entry
*pending
= revs
->pending
.objects
+ i
;
205 struct object
*obj
= pending
->item
;
206 const char *name
= pending
->name
;
207 const char *path
= pending
->path
;
208 if (obj
->flags
& (UNINTERESTING
| SEEN
))
210 if (obj
->type
== OBJ_TAG
) {
212 show_object(obj
, NULL
, name
, data
);
217 if (obj
->type
== OBJ_TREE
) {
218 process_tree(revs
, (struct tree
*)obj
, show_object
,
222 if (obj
->type
== OBJ_BLOB
) {
223 process_blob(revs
, (struct blob
*)obj
, show_object
,
227 die("unknown pending object %s (%s)",
228 sha1_to_hex(obj
->sha1
), name
);
230 object_array_clear(&revs
->pending
);
231 strbuf_release(&base
);