Remove "tree->entries" tree-entry list from tree parser
[git] / builtin-rev-list.c
1 #include "cache.h"
2 #include "refs.h"
3 #include "tag.h"
4 #include "commit.h"
5 #include "tree.h"
6 #include "blob.h"
7 #include "tree-walk.h"
8 #include "diff.h"
9 #include "revision.h"
10 #include "builtin.h"
11
12 /* bits #0-15 in revision.h */
13
14 #define COUNTED         (1u<<16)
15
16 static const char rev_list_usage[] =
17 "git-rev-list [OPTION] <commit-id>... [ -- paths... ]\n"
18 "  limiting output:\n"
19 "    --max-count=nr\n"
20 "    --max-age=epoch\n"
21 "    --min-age=epoch\n"
22 "    --sparse\n"
23 "    --no-merges\n"
24 "    --remove-empty\n"
25 "    --all\n"
26 "  ordering output:\n"
27 "    --topo-order\n"
28 "    --date-order\n"
29 "  formatting output:\n"
30 "    --parents\n"
31 "    --objects | --objects-edge\n"
32 "    --unpacked\n"
33 "    --header | --pretty\n"
34 "    --abbrev=nr | --no-abbrev\n"
35 "    --abbrev-commit\n"
36 "  special purpose:\n"
37 "    --bisect"
38 ;
39
40 static struct rev_info revs;
41
42 static int bisect_list = 0;
43 static int show_timestamp = 0;
44 static int hdr_termination = 0;
45 static const char *header_prefix;
46
47 static void show_commit(struct commit *commit)
48 {
49         if (show_timestamp)
50                 printf("%lu ", commit->date);
51         if (header_prefix)
52                 fputs(header_prefix, stdout);
53         if (commit->object.flags & BOUNDARY)
54                 putchar('-');
55         if (revs.abbrev_commit && revs.abbrev)
56                 fputs(find_unique_abbrev(commit->object.sha1, revs.abbrev),
57                       stdout);
58         else
59                 fputs(sha1_to_hex(commit->object.sha1), stdout);
60         if (revs.parents) {
61                 struct commit_list *parents = commit->parents;
62                 while (parents) {
63                         struct object *o = &(parents->item->object);
64                         parents = parents->next;
65                         if (o->flags & TMP_MARK)
66                                 continue;
67                         printf(" %s", sha1_to_hex(o->sha1));
68                         o->flags |= TMP_MARK;
69                 }
70                 /* TMP_MARK is a general purpose flag that can
71                  * be used locally, but the user should clean
72                  * things up after it is done with them.
73                  */
74                 for (parents = commit->parents;
75                      parents;
76                      parents = parents->next)
77                         parents->item->object.flags &= ~TMP_MARK;
78         }
79         if (revs.commit_format == CMIT_FMT_ONELINE)
80                 putchar(' ');
81         else
82                 putchar('\n');
83
84         if (revs.verbose_header) {
85                 static char pretty_header[16384];
86                 pretty_print_commit(revs.commit_format, commit, ~0,
87                                     pretty_header, sizeof(pretty_header),
88                                     revs.abbrev, NULL, NULL);
89                 printf("%s%c", pretty_header, hdr_termination);
90         }
91         fflush(stdout);
92 }
93
94 static struct object_list **process_blob(struct blob *blob,
95                                          struct object_list **p,
96                                          struct name_path *path,
97                                          const char *name)
98 {
99         struct object *obj = &blob->object;
100
101         if (!revs.blob_objects)
102                 return p;
103         if (obj->flags & (UNINTERESTING | SEEN))
104                 return p;
105         obj->flags |= SEEN;
106         name = strdup(name);
107         return add_object(obj, p, path, name);
108 }
109
110 static struct object_list **process_tree(struct tree *tree,
111                                          struct object_list **p,
112                                          struct name_path *path,
113                                          const char *name)
114 {
115         struct object *obj = &tree->object;
116         struct tree_desc desc;
117         struct name_path me;
118
119         if (!revs.tree_objects)
120                 return p;
121         if (obj->flags & (UNINTERESTING | SEEN))
122                 return p;
123         if (parse_tree(tree) < 0)
124                 die("bad tree object %s", sha1_to_hex(obj->sha1));
125         obj->flags |= SEEN;
126         name = strdup(name);
127         p = add_object(obj, p, path, name);
128         me.up = path;
129         me.elem = name;
130         me.elem_len = strlen(name);
131
132         desc.buf = tree->buffer;
133         desc.size = tree->size;
134
135         while (desc.size) {
136                 unsigned mode;
137                 const char *name;
138                 const unsigned char *sha1;
139
140                 sha1 = tree_entry_extract(&desc, &name, &mode);
141                 update_tree_entry(&desc);
142
143                 if (S_ISDIR(mode))
144                         p = process_tree(lookup_tree(sha1), p, &me, name);
145                 else
146                         p = process_blob(lookup_blob(sha1), p, &me, name);
147         }
148         free(tree->buffer);
149         tree->buffer = NULL;
150         return p;
151 }
152
153 static void show_commit_list(struct rev_info *revs)
154 {
155         struct commit *commit;
156         struct object_list *objects = NULL, **p = &objects, *pending;
157
158         while ((commit = get_revision(revs)) != NULL) {
159                 p = process_tree(commit->tree, p, NULL, "");
160                 show_commit(commit);
161         }
162         for (pending = revs->pending_objects; pending; pending = pending->next) {
163                 struct object *obj = pending->item;
164                 const char *name = pending->name;
165                 if (obj->flags & (UNINTERESTING | SEEN))
166                         continue;
167                 if (obj->type == tag_type) {
168                         obj->flags |= SEEN;
169                         p = add_object(obj, p, NULL, name);
170                         continue;
171                 }
172                 if (obj->type == tree_type) {
173                         p = process_tree((struct tree *)obj, p, NULL, name);
174                         continue;
175                 }
176                 if (obj->type == blob_type) {
177                         p = process_blob((struct blob *)obj, p, NULL, name);
178                         continue;
179                 }
180                 die("unknown pending object %s (%s)", sha1_to_hex(obj->sha1), name);
181         }
182         while (objects) {
183                 /* An object with name "foo\n0000000..." can be used to
184                  * confuse downstream git-pack-objects very badly.
185                  */
186                 const char *ep = strchr(objects->name, '\n');
187                 if (ep) {
188                         printf("%s %.*s\n", sha1_to_hex(objects->item->sha1),
189                                (int) (ep - objects->name),
190                                objects->name);
191                 }
192                 else
193                         printf("%s %s\n", sha1_to_hex(objects->item->sha1), objects->name);
194                 objects = objects->next;
195         }
196 }
197
198 /*
199  * This is a truly stupid algorithm, but it's only
200  * used for bisection, and we just don't care enough.
201  *
202  * We care just barely enough to avoid recursing for
203  * non-merge entries.
204  */
205 static int count_distance(struct commit_list *entry)
206 {
207         int nr = 0;
208
209         while (entry) {
210                 struct commit *commit = entry->item;
211                 struct commit_list *p;
212
213                 if (commit->object.flags & (UNINTERESTING | COUNTED))
214                         break;
215                 if (!revs.prune_fn || (commit->object.flags & TREECHANGE))
216                         nr++;
217                 commit->object.flags |= COUNTED;
218                 p = commit->parents;
219                 entry = p;
220                 if (p) {
221                         p = p->next;
222                         while (p) {
223                                 nr += count_distance(p);
224                                 p = p->next;
225                         }
226                 }
227         }
228
229         return nr;
230 }
231
232 static void clear_distance(struct commit_list *list)
233 {
234         while (list) {
235                 struct commit *commit = list->item;
236                 commit->object.flags &= ~COUNTED;
237                 list = list->next;
238         }
239 }
240
241 static struct commit_list *find_bisection(struct commit_list *list)
242 {
243         int nr, closest;
244         struct commit_list *p, *best;
245
246         nr = 0;
247         p = list;
248         while (p) {
249                 if (!revs.prune_fn || (p->item->object.flags & TREECHANGE))
250                         nr++;
251                 p = p->next;
252         }
253         closest = 0;
254         best = list;
255
256         for (p = list; p; p = p->next) {
257                 int distance;
258
259                 if (revs.prune_fn && !(p->item->object.flags & TREECHANGE))
260                         continue;
261
262                 distance = count_distance(p);
263                 clear_distance(list);
264                 if (nr - distance < distance)
265                         distance = nr - distance;
266                 if (distance > closest) {
267                         best = p;
268                         closest = distance;
269                 }
270         }
271         if (best)
272                 best->next = NULL;
273         return best;
274 }
275
276 static void mark_edge_parents_uninteresting(struct commit *commit)
277 {
278         struct commit_list *parents;
279
280         for (parents = commit->parents; parents; parents = parents->next) {
281                 struct commit *parent = parents->item;
282                 if (!(parent->object.flags & UNINTERESTING))
283                         continue;
284                 mark_tree_uninteresting(parent->tree);
285                 if (revs.edge_hint && !(parent->object.flags & SHOWN)) {
286                         parent->object.flags |= SHOWN;
287                         printf("-%s\n", sha1_to_hex(parent->object.sha1));
288                 }
289         }
290 }
291
292 static void mark_edges_uninteresting(struct commit_list *list)
293 {
294         for ( ; list; list = list->next) {
295                 struct commit *commit = list->item;
296
297                 if (commit->object.flags & UNINTERESTING) {
298                         mark_tree_uninteresting(commit->tree);
299                         continue;
300                 }
301                 mark_edge_parents_uninteresting(commit);
302         }
303 }
304
305 int cmd_rev_list(int argc, const char **argv, char **envp)
306 {
307         struct commit_list *list;
308         int i;
309
310         init_revisions(&revs);
311         revs.abbrev = 0;
312         revs.commit_format = CMIT_FMT_UNSPECIFIED;
313         argc = setup_revisions(argc, argv, &revs, NULL);
314
315         for (i = 1 ; i < argc; i++) {
316                 const char *arg = argv[i];
317
318                 if (!strcmp(arg, "--header")) {
319                         revs.verbose_header = 1;
320                         continue;
321                 }
322                 if (!strcmp(arg, "--timestamp")) {
323                         show_timestamp = 1;
324                         continue;
325                 }
326                 if (!strcmp(arg, "--bisect")) {
327                         bisect_list = 1;
328                         continue;
329                 }
330                 usage(rev_list_usage);
331
332         }
333         if (revs.commit_format != CMIT_FMT_UNSPECIFIED) {
334                 /* The command line has a --pretty  */
335                 hdr_termination = '\n';
336                 if (revs.commit_format == CMIT_FMT_ONELINE)
337                         header_prefix = "";
338                 else
339                         header_prefix = "commit ";
340         }
341         else if (revs.verbose_header)
342                 /* Only --header was specified */
343                 revs.commit_format = CMIT_FMT_RAW;
344
345         list = revs.commits;
346
347         if ((!list &&
348              (!(revs.tag_objects||revs.tree_objects||revs.blob_objects) &&
349               !revs.pending_objects)) ||
350             revs.diff)
351                 usage(rev_list_usage);
352
353         save_commit_buffer = revs.verbose_header;
354         track_object_refs = 0;
355         if (bisect_list)
356                 revs.limited = 1;
357
358         prepare_revision_walk(&revs);
359         if (revs.tree_objects)
360                 mark_edges_uninteresting(revs.commits);
361
362         if (bisect_list)
363                 revs.commits = find_bisection(revs.commits);
364
365         show_commit_list(&revs);
366
367         return 0;
368 }