Bug Summary

File:commit.c
Location:line 1157, column 8
Description:Dereference of null pointer (loaded from variable 'line')

Annotated Source Code

1#include "cache.h"
2#include "tag.h"
3#include "commit.h"
4#include "pkt-line.h"
5#include "utf8.h"
6#include "diff.h"
7#include "revision.h"
8#include "notes.h"
9#include "gpg-interface.h"
10#include "mergesort.h"
11#include "commit-slab.h"
12#include "prio-queue.h"
13#include "sha1-lookup.h"
14
15static struct commit_extra_header *read_commit_extra_header_lines(const char *buf, size_t len, const char **);
16
17int save_commit_buffer = 1;
18
19const char *commit_type = "commit";
20
21struct commit *lookup_commit_reference_gently(const unsigned char *sha1,
22 int quiet)
23{
24 struct object *obj = deref_tag(parse_object(sha1), NULL((void*)0), 0);
25
26 if (!obj)
27 return NULL((void*)0);
28 return object_as_type(obj, OBJ_COMMIT, quiet);
29}
30
31struct commit *lookup_commit_reference(const unsigned char *sha1)
32{
33 return lookup_commit_reference_gently(sha1, 0);
34}
35
36struct commit *lookup_commit_or_die(const unsigned char *sha1, const char *ref_name)
37{
38 struct commit *c = lookup_commit_reference(sha1);
39 if (!c)
40 die(_("could not parse %s"), ref_name);
41 if (hashcmp(sha1, c->object.oid.hash)) {
42 warning(_("%s %s is not a commit!"),
43 ref_name, sha1_to_hex(sha1));
44 }
45 return c;
46}
47
48struct commit *lookup_commit(const unsigned char *sha1)
49{
50 struct object *obj = lookup_object(sha1);
51 if (!obj)
52 return create_object(sha1, alloc_commit_node());
53 return object_as_type(obj, OBJ_COMMIT, 0);
54}
55
56struct commit *lookup_commit_reference_by_name(const char *name)
57{
58 struct object_id oid;
59 struct commit *commit;
60
61 if (get_sha1_committish(name, oid.hash))
62 return NULL((void*)0);
63 commit = lookup_commit_reference(oid.hash);
64 if (parse_commit(commit))
65 return NULL((void*)0);
66 return commit;
67}
68
69static unsigned long parse_commit_date(const char *buf, const char *tail)
70{
71 const char *dateptr;
72
73 if (buf + 6 >= tail)
74 return 0;
75 if (memcmp(buf, "author", 6))
76 return 0;
77 while (buf < tail && *buf++ != '\n')
78 /* nada */;
79 if (buf + 9 >= tail)
80 return 0;
81 if (memcmp(buf, "committer", 9))
82 return 0;
83 while (buf < tail && *buf++ != '>')
84 /* nada */;
85 if (buf >= tail)
86 return 0;
87 dateptr = buf;
88 while (buf < tail && *buf++ != '\n')
89 /* nada */;
90 if (buf >= tail)
91 return 0;
92 /* dateptr < buf && buf[-1] == '\n', so strtoul will stop at buf-1 */
93 return strtoul(dateptr, NULL((void*)0), 10);
94}
95
96static struct commit_graft **commit_graft;
97static int commit_graft_alloc, commit_graft_nr;
98
99static const unsigned char *commit_graft_sha1_access(size_t index, void *table)
100{
101 struct commit_graft **commit_graft_table = table;
102 return commit_graft_table[index]->oid.hash;
103}
104
105static int commit_graft_pos(const unsigned char *sha1)
106{
107 return sha1_pos(sha1, commit_graft, commit_graft_nr,
108 commit_graft_sha1_access);
109}
110
111int register_commit_graft(struct commit_graft *graft, int ignore_dups)
112{
113 int pos = commit_graft_pos(graft->oid.hash);
114
115 if (0 <= pos) {
116 if (ignore_dups)
117 free(graft);
118 else {
119 free(commit_graft[pos]);
120 commit_graft[pos] = graft;
121 }
122 return 1;
123 }
124 pos = -pos - 1;
125 ALLOC_GROW(commit_graft, commit_graft_nr + 1, commit_graft_alloc)do { if ((commit_graft_nr + 1) > commit_graft_alloc) { if (
(((commit_graft_alloc)+16)*3/2) < (commit_graft_nr + 1)) commit_graft_alloc
= (commit_graft_nr + 1); else commit_graft_alloc = (((commit_graft_alloc
)+16)*3/2); (commit_graft) = xrealloc((commit_graft), st_mult
(sizeof(*(commit_graft)), (commit_graft_alloc))); } } while (
0);
126 commit_graft_nr++;
127 if (pos < commit_graft_nr)
128 memmove(commit_graft + pos + 1,__builtin___memmove_chk (commit_graft + pos + 1, commit_graft
+ pos, (commit_graft_nr - pos - 1) * sizeof(*commit_graft), __builtin_object_size
(commit_graft + pos + 1, 0))
129 commit_graft + pos,__builtin___memmove_chk (commit_graft + pos + 1, commit_graft
+ pos, (commit_graft_nr - pos - 1) * sizeof(*commit_graft), __builtin_object_size
(commit_graft + pos + 1, 0))
130 (commit_graft_nr - pos - 1) *__builtin___memmove_chk (commit_graft + pos + 1, commit_graft
+ pos, (commit_graft_nr - pos - 1) * sizeof(*commit_graft), __builtin_object_size
(commit_graft + pos + 1, 0))
131 sizeof(*commit_graft))__builtin___memmove_chk (commit_graft + pos + 1, commit_graft
+ pos, (commit_graft_nr - pos - 1) * sizeof(*commit_graft), __builtin_object_size
(commit_graft + pos + 1, 0));
132 commit_graft[pos] = graft;
133 return 0;
134}
135
136struct commit_graft *read_graft_line(char *buf, int len)
137{
138 /* The format is just "Commit Parent1 Parent2 ...\n" */
139 int i;
140 struct commit_graft *graft = NULL((void*)0);
141 const int entry_size = GIT_SHA1_HEXSZ(2 * 20) + 1;
142
143 while (len && isspace(buf[len-1])((sane_ctype[(unsigned char)(buf[len-1])] & (0x01)) != 0))
144 buf[--len] = '\0';
145 if (buf[0] == '#' || buf[0] == '\0')
146 return NULL((void*)0);
147 if ((len + 1) % entry_size)
148 goto bad_graft_data;
149 i = (len + 1) / entry_size - 1;
150 graft = xmalloc(st_add(sizeof(*graft), st_mult(GIT_SHA1_RAWSZ20, i)));
151 graft->nr_parent = i;
152 if (get_oid_hex(buf, &graft->oid))
153 goto bad_graft_data;
154 for (i = GIT_SHA1_HEXSZ(2 * 20); i < len; i += entry_size) {
155 if (buf[i] != ' ')
156 goto bad_graft_data;
157 if (get_sha1_hex(buf + i + 1, graft->parent[i/entry_size].hash))
158 goto bad_graft_data;
159 }
160 return graft;
161
162bad_graft_data:
163 error("bad graft data: %s", buf)(error("bad graft data: %s", buf), const_error());
164 free(graft);
165 return NULL((void*)0);
166}
167
168static int read_graft_file(const char *graft_file)
169{
170 FILE *fp = fopen(graft_file, "r");
171 struct strbuf buf = STRBUF_INIT{ 0, 0, strbuf_slopbuf };
172 if (!fp)
173 return -1;
174 while (!strbuf_getwholeline(&buf, fp, '\n')) {
175 /* The format is just "Commit Parent1 Parent2 ...\n" */
176 struct commit_graft *graft = read_graft_line(buf.buf, buf.len);
177 if (!graft)
178 continue;
179 if (register_commit_graft(graft, 1))
180 error("duplicate graft data: %s", buf.buf)(error("duplicate graft data: %s", buf.buf), const_error());
181 }
182 fclose(fp);
183 strbuf_release(&buf);
184 return 0;
185}
186
187static void prepare_commit_graft(void)
188{
189 static int commit_graft_prepared;
190 char *graft_file;
191
192 if (commit_graft_prepared)
193 return;
194 graft_file = get_graft_file();
195 read_graft_file(graft_file);
196 /* make sure shallows are read */
197 is_repository_shallow();
198 commit_graft_prepared = 1;
199}
200
201struct commit_graft *lookup_commit_graft(const unsigned char *sha1)
202{
203 int pos;
204 prepare_commit_graft();
205 pos = commit_graft_pos(sha1);
206 if (pos < 0)
207 return NULL((void*)0);
208 return commit_graft[pos];
209}
210
211int for_each_commit_graft(each_commit_graft_fn fn, void *cb_data)
212{
213 int i, ret;
214 for (i = ret = 0; i < commit_graft_nr && !ret; i++)
215 ret = fn(commit_graft[i], cb_data);
216 return ret;
217}
218
219int unregister_shallow(const unsigned char *sha1)
220{
221 int pos = commit_graft_pos(sha1);
222 if (pos < 0)
223 return -1;
224 if (pos + 1 < commit_graft_nr)
225 memmove(commit_graft + pos, commit_graft + pos + 1,__builtin___memmove_chk (commit_graft + pos, commit_graft + pos
+ 1, sizeof(struct commit_graft *) * (commit_graft_nr - pos -
1), __builtin_object_size (commit_graft + pos, 0))
226 sizeof(struct commit_graft *)__builtin___memmove_chk (commit_graft + pos, commit_graft + pos
+ 1, sizeof(struct commit_graft *) * (commit_graft_nr - pos -
1), __builtin_object_size (commit_graft + pos, 0))
227 * (commit_graft_nr - pos - 1))__builtin___memmove_chk (commit_graft + pos, commit_graft + pos
+ 1, sizeof(struct commit_graft *) * (commit_graft_nr - pos -
1), __builtin_object_size (commit_graft + pos, 0));
228 commit_graft_nr--;
229 return 0;
230}
231
232struct commit_buffer {
233 void *buffer;
234 unsigned long size;
235};
236define_commit_slab(buffer_slab, struct commit_buffer)struct buffer_slab { unsigned slab_size; unsigned stride; unsigned
slab_count; struct commit_buffer **slab; }; static int stat_buffer_slabrealloc
; static __attribute__((__unused__)) void init_buffer_slab_with_stride
(struct buffer_slab *s, unsigned stride) { unsigned int elem_size
; if (!stride) stride = 1; s->stride = stride; elem_size =
sizeof(struct commit_buffer) * stride; s->slab_size = (512
*1024-32) / elem_size; s->slab_count = 0; s->slab = ((void
*)0); } static __attribute__((__unused__)) void init_buffer_slab
(struct buffer_slab *s) { init_buffer_slab_with_stride(s, 1);
} static __attribute__((__unused__)) void clear_buffer_slab(
struct buffer_slab *s) { int i; for (i = 0; i < s->slab_count
; i++) free(s->slab[i]); s->slab_count = 0; free(s->
slab); s->slab = ((void*)0); } static __attribute__((__unused__
)) struct commit_buffer *buffer_slab_at_peek(struct buffer_slab
*s, const struct commit *c, int add_if_missing) { int nth_slab
, nth_slot; nth_slab = c->index / s->slab_size; nth_slot
= c->index % s->slab_size; if (s->slab_count <= nth_slab
) { int i; if (!add_if_missing) return ((void*)0); (s->slab
) = xrealloc((s->slab), st_mult(sizeof(*(s->slab)), (nth_slab
+ 1))); stat_buffer_slabrealloc++; for (i = s->slab_count
; i <= nth_slab; i++) s->slab[i] = ((void*)0); s->slab_count
= nth_slab + 1; } if (!s->slab[nth_slab]) { if (!add_if_missing
) return ((void*)0); s->slab[nth_slab] = xcalloc(s->slab_size
, sizeof(**s->slab) * s->stride); } return &s->slab
[nth_slab][nth_slot * s->stride]; } static __attribute__((
__unused__)) struct commit_buffer *buffer_slab_at(struct buffer_slab
*s, const struct commit *c) { return buffer_slab_at_peek(s, c
, 1); } static __attribute__((__unused__)) struct commit_buffer
*buffer_slab_peek(struct buffer_slab *s, const struct commit
*c) { return buffer_slab_at_peek(s, c, 0); } struct buffer_slab;
237static struct buffer_slab buffer_slab = COMMIT_SLAB_INIT(1, buffer_slab){ (512*1024-32) / sizeof(**((buffer_slab).slab)) / (1), (1), 0
, ((void*)0) };
238
239void set_commit_buffer(struct commit *commit, void *buffer, unsigned long size)
240{
241 struct commit_buffer *v = buffer_slab_at(&buffer_slab, commit);
242 v->buffer = buffer;
243 v->size = size;
244}
245
246const void *get_cached_commit_buffer(const struct commit *commit, unsigned long *sizep)
247{
248 struct commit_buffer *v = buffer_slab_peek(&buffer_slab, commit);
249 if (!v) {
250 if (sizep)
251 *sizep = 0;
252 return NULL((void*)0);
253 }
254 if (sizep)
255 *sizep = v->size;
256 return v->buffer;
257}
258
259const void *get_commit_buffer(const struct commit *commit, unsigned long *sizep)
260{
261 const void *ret = get_cached_commit_buffer(commit, sizep);
262 if (!ret) {
263 enum object_type type;
264 unsigned long size;
265 ret = read_sha1_file(commit->object.oid.hash, &type, &size);
266 if (!ret)
267 die("cannot read commit object %s",
268 oid_to_hex(&commit->object.oid));
269 if (type != OBJ_COMMIT)
270 die("expected commit for %s, got %s",
271 oid_to_hex(&commit->object.oid), typename(type));
272 if (sizep)
273 *sizep = size;
274 }
275 return ret;
276}
277
278void unuse_commit_buffer(const struct commit *commit, const void *buffer)
279{
280 struct commit_buffer *v = buffer_slab_peek(&buffer_slab, commit);
281 if (!(v && v->buffer == buffer))
282 free((void *)buffer);
283}
284
285void free_commit_buffer(struct commit *commit)
286{
287 struct commit_buffer *v = buffer_slab_peek(&buffer_slab, commit);
288 if (v) {
289 free(v->buffer);
290 v->buffer = NULL((void*)0);
291 v->size = 0;
292 }
293}
294
295const void *detach_commit_buffer(struct commit *commit, unsigned long *sizep)
296{
297 struct commit_buffer *v = buffer_slab_peek(&buffer_slab, commit);
298 void *ret;
299
300 if (!v) {
301 if (sizep)
302 *sizep = 0;
303 return NULL((void*)0);
304 }
305 ret = v->buffer;
306 if (sizep)
307 *sizep = v->size;
308
309 v->buffer = NULL((void*)0);
310 v->size = 0;
311 return ret;
312}
313
314int parse_commit_buffer(struct commit *item, const void *buffer, unsigned long size)
315{
316 const char *tail = buffer;
317 const char *bufptr = buffer;
318 struct object_id parent;
319 struct commit_list **pptr;
320 struct commit_graft *graft;
321 const int tree_entry_len = GIT_SHA1_HEXSZ(2 * 20) + 5;
322 const int parent_entry_len = GIT_SHA1_HEXSZ(2 * 20) + 7;
323
324 if (item->object.parsed)
325 return 0;
326 item->object.parsed = 1;
327 tail += size;
328 if (tail <= bufptr + tree_entry_len + 1 || memcmp(bufptr, "tree ", 5) ||
329 bufptr[tree_entry_len] != '\n')
330 return error("bogus commit object %s", oid_to_hex(&item->object.oid))(error("bogus commit object %s", oid_to_hex(&item->object
.oid)), const_error());
331 if (get_sha1_hex(bufptr + 5, parent.hash) < 0)
332 return error("bad tree pointer in commit %s",(error("bad tree pointer in commit %s", oid_to_hex(&item->
object.oid)), const_error())
333 oid_to_hex(&item->object.oid))(error("bad tree pointer in commit %s", oid_to_hex(&item->
object.oid)), const_error());
334 item->tree = lookup_tree(parent.hash);
335 bufptr += tree_entry_len + 1; /* "tree " + "hex sha1" + "\n" */
336 pptr = &item->parents;
337
338 graft = lookup_commit_graft(item->object.oid.hash);
339 while (bufptr + parent_entry_len < tail && !memcmp(bufptr, "parent ", 7)) {
340 struct commit *new_parent;
341
342 if (tail <= bufptr + parent_entry_len + 1 ||
343 get_sha1_hex(bufptr + 7, parent.hash) ||
344 bufptr[parent_entry_len] != '\n')
345 return error("bad parents in commit %s", oid_to_hex(&item->object.oid))(error("bad parents in commit %s", oid_to_hex(&item->object
.oid)), const_error());
346 bufptr += parent_entry_len + 1;
347 /*
348 * The clone is shallow if nr_parent < 0, and we must
349 * not traverse its real parents even when we unhide them.
350 */
351 if (graft && (graft->nr_parent < 0 || grafts_replace_parents))
352 continue;
353 new_parent = lookup_commit(parent.hash);
354 if (new_parent)
355 pptr = &commit_list_insert(new_parent, pptr)->next;
356 }
357 if (graft) {
358 int i;
359 struct commit *new_parent;
360 for (i = 0; i < graft->nr_parent; i++) {
361 new_parent = lookup_commit(graft->parent[i].hash);
362 if (!new_parent)
363 continue;
364 pptr = &commit_list_insert(new_parent, pptr)->next;
365 }
366 }
367 item->date = parse_commit_date(bufptr, tail);
368
369 return 0;
370}
371
372int parse_commit_gently(struct commit *item, int quiet_on_missing)
373{
374 enum object_type type;
375 void *buffer;
376 unsigned long size;
377 int ret;
378
379 if (!item)
380 return -1;
381 if (item->object.parsed)
382 return 0;
383 buffer = read_sha1_file(item->object.oid.hash, &type, &size);
384 if (!buffer)
385 return quiet_on_missing ? -1 :
386 error("Could not read %s",(error("Could not read %s", oid_to_hex(&item->object.oid
)), const_error())
387 oid_to_hex(&item->object.oid))(error("Could not read %s", oid_to_hex(&item->object.oid
)), const_error());
388 if (type != OBJ_COMMIT) {
389 free(buffer);
390 return error("Object %s not a commit",(error("Object %s not a commit", oid_to_hex(&item->object
.oid)), const_error())
391 oid_to_hex(&item->object.oid))(error("Object %s not a commit", oid_to_hex(&item->object
.oid)), const_error());
392 }
393 ret = parse_commit_buffer(item, buffer, size);
394 if (save_commit_buffer && !ret) {
395 set_commit_buffer(item, buffer, size);
396 return 0;
397 }
398 free(buffer);
399 return ret;
400}
401
402void parse_commit_or_die(struct commit *item)
403{
404 if (parse_commit(item))
405 die("unable to parse commit %s",
406 item ? oid_to_hex(&item->object.oid) : "(null)");
407}
408
409int find_commit_subject(const char *commit_buffer, const char **subject)
410{
411 const char *eol;
412 const char *p = commit_buffer;
413
414 while (*p && (*p != '\n' || p[1] != '\n'))
415 p++;
416 if (*p) {
417 p = skip_blank_lines(p + 2);
418 for (eol = p; *eol && *eol != '\n'; eol++)
419 ; /* do nothing */
420 } else
421 eol = p;
422
423 *subject = p;
424
425 return eol - p;
426}
427
428struct commit_list *commit_list_insert(struct commit *item, struct commit_list **list_p)
429{
430 struct commit_list *new_list = xmalloc(sizeof(struct commit_list));
431 new_list->item = item;
432 new_list->next = *list_p;
433 *list_p = new_list;
434 return new_list;
435}
436
437unsigned commit_list_count(const struct commit_list *l)
438{
439 unsigned c = 0;
440 for (; l; l = l->next )
441 c++;
442 return c;
443}
444
445struct commit_list *copy_commit_list(struct commit_list *list)
446{
447 struct commit_list *head = NULL((void*)0);
448 struct commit_list **pp = &head;
449 while (list) {
450 pp = commit_list_append(list->item, pp);
451 list = list->next;
452 }
453 return head;
454}
455
456void free_commit_list(struct commit_list *list)
457{
458 while (list)
459 pop_commit(&list);
460}
461
462struct commit_list * commit_list_insert_by_date(struct commit *item, struct commit_list **list)
463{
464 struct commit_list **pp = list;
465 struct commit_list *p;
466 while ((p = *pp) != NULL((void*)0)) {
467 if (p->item->date < item->date) {
468 break;
469 }
470 pp = &p->next;
471 }
472 return commit_list_insert(item, pp);
473}
474
475static int commit_list_compare_by_date(const void *a, const void *b)
476{
477 unsigned long a_date = ((const struct commit_list *)a)->item->date;
478 unsigned long b_date = ((const struct commit_list *)b)->item->date;
479 if (a_date < b_date)
480 return 1;
481 if (a_date > b_date)
482 return -1;
483 return 0;
484}
485
486static void *commit_list_get_next(const void *a)
487{
488 return ((const struct commit_list *)a)->next;
489}
490
491static void commit_list_set_next(void *a, void *next)
492{
493 ((struct commit_list *)a)->next = next;
494}
495
496void commit_list_sort_by_date(struct commit_list **list)
497{
498 *list = llist_mergesort(*list, commit_list_get_next, commit_list_set_next,
499 commit_list_compare_by_date);
500}
501
502struct commit *pop_most_recent_commit(struct commit_list **list,
503 unsigned int mark)
504{
505 struct commit *ret = pop_commit(list);
506 struct commit_list *parents = ret->parents;
507
508 while (parents) {
509 struct commit *commit = parents->item;
510 if (!parse_commit(commit) && !(commit->object.flags & mark)) {
511 commit->object.flags |= mark;
512 commit_list_insert_by_date(commit, list);
513 }
514 parents = parents->next;
515 }
516 return ret;
517}
518
519static void clear_commit_marks_1(struct commit_list **plist,
520 struct commit *commit, unsigned int mark)
521{
522 while (commit) {
523 struct commit_list *parents;
524
525 if (!(mark & commit->object.flags))
526 return;
527
528 commit->object.flags &= ~mark;
529
530 parents = commit->parents;
531 if (!parents)
532 return;
533
534 while ((parents = parents->next))
535 commit_list_insert(parents->item, plist);
536
537 commit = commit->parents->item;
538 }
539}
540
541void clear_commit_marks_many(int nr, struct commit **commit, unsigned int mark)
542{
543 struct commit_list *list = NULL((void*)0);
544
545 while (nr--) {
546 commit_list_insert(*commit, &list);
547 commit++;
548 }
549 while (list)
550 clear_commit_marks_1(&list, pop_commit(&list), mark);
551}
552
553void clear_commit_marks(struct commit *commit, unsigned int mark)
554{
555 clear_commit_marks_many(1, &commit, mark);
556}
557
558void clear_commit_marks_for_object_array(struct object_array *a, unsigned mark)
559{
560 struct object *object;
561 struct commit *commit;
562 unsigned int i;
563
564 for (i = 0; i < a->nr; i++) {
565 object = a->objects[i].item;
566 commit = lookup_commit_reference_gently(object->oid.hash, 1);
567 if (commit)
568 clear_commit_marks(commit, mark);
569 }
570}
571
572struct commit *pop_commit(struct commit_list **stack)
573{
574 struct commit_list *top = *stack;
575 struct commit *item = top ? top->item : NULL((void*)0);
576
577 if (top) {
578 *stack = top->next;
579 free(top);
580 }
581 return item;
582}
583
584/*
585 * Topological sort support
586 */
587
588/* count number of children that have not been emitted */
589define_commit_slab(indegree_slab, int)struct indegree_slab { unsigned slab_size; unsigned stride; unsigned
slab_count; int **slab; }; static int stat_indegree_slabrealloc
; static __attribute__((__unused__)) void init_indegree_slab_with_stride
(struct indegree_slab *s, unsigned stride) { unsigned int elem_size
; if (!stride) stride = 1; s->stride = stride; elem_size =
sizeof(int) * stride; s->slab_size = (512*1024-32) / elem_size
; s->slab_count = 0; s->slab = ((void*)0); } static __attribute__
((__unused__)) void init_indegree_slab(struct indegree_slab *
s) { init_indegree_slab_with_stride(s, 1); } static __attribute__
((__unused__)) void clear_indegree_slab(struct indegree_slab *
s) { int i; for (i = 0; i < s->slab_count; i++) free(s->
slab[i]); s->slab_count = 0; free(s->slab); s->slab =
((void*)0); } static __attribute__((__unused__)) int *indegree_slab_at_peek
(struct indegree_slab *s, const struct commit *c, int add_if_missing
) { int nth_slab, nth_slot; nth_slab = c->index / s->slab_size
; nth_slot = c->index % s->slab_size; if (s->slab_count
<= nth_slab) { int i; if (!add_if_missing) return ((void*
)0); (s->slab) = xrealloc((s->slab), st_mult(sizeof(*(s
->slab)), (nth_slab + 1))); stat_indegree_slabrealloc++; for
(i = s->slab_count; i <= nth_slab; i++) s->slab[i] =
((void*)0); s->slab_count = nth_slab + 1; } if (!s->slab
[nth_slab]) { if (!add_if_missing) return ((void*)0); s->slab
[nth_slab] = xcalloc(s->slab_size, sizeof(**s->slab) * s
->stride); } return &s->slab[nth_slab][nth_slot * s
->stride]; } static __attribute__((__unused__)) int *indegree_slab_at
(struct indegree_slab *s, const struct commit *c) { return indegree_slab_at_peek
(s, c, 1); } static __attribute__((__unused__)) int *indegree_slab_peek
(struct indegree_slab *s, const struct commit *c) { return indegree_slab_at_peek
(s, c, 0); } struct indegree_slab;
590
591/* record author-date for each commit object */
592define_commit_slab(author_date_slab, unsigned long)struct author_date_slab { unsigned slab_size; unsigned stride
; unsigned slab_count; unsigned long **slab; }; static int stat_author_date_slabrealloc
; static __attribute__((__unused__)) void init_author_date_slab_with_stride
(struct author_date_slab *s, unsigned stride) { unsigned int elem_size
; if (!stride) stride = 1; s->stride = stride; elem_size =
sizeof(unsigned long) * stride; s->slab_size = (512*1024-
32) / elem_size; s->slab_count = 0; s->slab = ((void*)0
); } static __attribute__((__unused__)) void init_author_date_slab
(struct author_date_slab *s) { init_author_date_slab_with_stride
(s, 1); } static __attribute__((__unused__)) void clear_author_date_slab
(struct author_date_slab *s) { int i; for (i = 0; i < s->
slab_count; i++) free(s->slab[i]); s->slab_count = 0; free
(s->slab); s->slab = ((void*)0); } static __attribute__
((__unused__)) unsigned long *author_date_slab_at_peek(struct
author_date_slab *s, const struct commit *c, int add_if_missing
) { int nth_slab, nth_slot; nth_slab = c->index / s->slab_size
; nth_slot = c->index % s->slab_size; if (s->slab_count
<= nth_slab) { int i; if (!add_if_missing) return ((void*
)0); (s->slab) = xrealloc((s->slab), st_mult(sizeof(*(s
->slab)), (nth_slab + 1))); stat_author_date_slabrealloc++
; for (i = s->slab_count; i <= nth_slab; i++) s->slab
[i] = ((void*)0); s->slab_count = nth_slab + 1; } if (!s->
slab[nth_slab]) { if (!add_if_missing) return ((void*)0); s->
slab[nth_slab] = xcalloc(s->slab_size, sizeof(**s->slab
) * s->stride); } return &s->slab[nth_slab][nth_slot
* s->stride]; } static __attribute__((__unused__)) unsigned
long *author_date_slab_at(struct author_date_slab *s, const struct
commit *c) { return author_date_slab_at_peek(s, c, 1); } static
__attribute__((__unused__)) unsigned long *author_date_slab_peek
(struct author_date_slab *s, const struct commit *c) { return
author_date_slab_at_peek(s, c, 0); } struct author_date_slab;
593
594static void record_author_date(struct author_date_slab *author_date,
595 struct commit *commit)
596{
597 const char *buffer = get_commit_buffer(commit, NULL((void*)0));
598 struct ident_split ident;
599 const char *ident_line;
600 size_t ident_len;
601 char *date_end;
602 unsigned long date;
603
604 ident_line = find_commit_header(buffer, "author", &ident_len);
605 if (!ident_line)
606 goto fail_exit; /* no author line */
607 if (split_ident_line(&ident, ident_line, ident_len) ||
608 !ident.date_begin || !ident.date_end)
609 goto fail_exit; /* malformed "author" line */
610
611 date = strtoul(ident.date_begin, &date_end, 10);
612 if (date_end != ident.date_end)
613 goto fail_exit; /* malformed date */
614 *(author_date_slab_at(author_date, commit)) = date;
615
616fail_exit:
617 unuse_commit_buffer(commit, buffer);
618}
619
620static int compare_commits_by_author_date(const void *a_, const void *b_,
621 void *cb_data)
622{
623 const struct commit *a = a_, *b = b_;
624 struct author_date_slab *author_date = cb_data;
625 unsigned long a_date = *(author_date_slab_at(author_date, a));
626 unsigned long b_date = *(author_date_slab_at(author_date, b));
627
628 /* newer commits with larger date first */
629 if (a_date < b_date)
630 return 1;
631 else if (a_date > b_date)
632 return -1;
633 return 0;
634}
635
636int compare_commits_by_commit_date(const void *a_, const void *b_, void *unused)
637{
638 const struct commit *a = a_, *b = b_;
639 /* newer commits with larger date first */
640 if (a->date < b->date)
641 return 1;
642 else if (a->date > b->date)
643 return -1;
644 return 0;
645}
646
647/*
648 * Performs an in-place topological sort on the list supplied.
649 */
650void sort_in_topological_order(struct commit_list **list, enum rev_sort_order sort_order)
651{
652 struct commit_list *next, *orig = *list;
653 struct commit_list **pptr;
654 struct indegree_slab indegree;
655 struct prio_queue queue;
656 struct commit *commit;
657 struct author_date_slab author_date;
658
659 if (!orig)
660 return;
661 *list = NULL((void*)0);
662
663 init_indegree_slab(&indegree);
664 memset(&queue, '\0', sizeof(queue))__builtin___memset_chk (&queue, '\0', sizeof(queue), __builtin_object_size
(&queue, 0));
665
666 switch (sort_order) {
667 default: /* REV_SORT_IN_GRAPH_ORDER */
668 queue.compare = NULL((void*)0);
669 break;
670 case REV_SORT_BY_COMMIT_DATE:
671 queue.compare = compare_commits_by_commit_date;
672 break;
673 case REV_SORT_BY_AUTHOR_DATE:
674 init_author_date_slab(&author_date);
675 queue.compare = compare_commits_by_author_date;
676 queue.cb_data = &author_date;
677 break;
678 }
679
680 /* Mark them and clear the indegree */
681 for (next = orig; next; next = next->next) {
682 struct commit *commit = next->item;
683 *(indegree_slab_at(&indegree, commit)) = 1;
684 /* also record the author dates, if needed */
685 if (sort_order == REV_SORT_BY_AUTHOR_DATE)
686 record_author_date(&author_date, commit);
687 }
688
689 /* update the indegree */
690 for (next = orig; next; next = next->next) {
691 struct commit_list *parents = next->item->parents;
692 while (parents) {
693 struct commit *parent = parents->item;
694 int *pi = indegree_slab_at(&indegree, parent);
695
696 if (*pi)
697 (*pi)++;
698 parents = parents->next;
699 }
700 }
701
702 /*
703 * find the tips
704 *
705 * tips are nodes not reachable from any other node in the list
706 *
707 * the tips serve as a starting set for the work queue.
708 */
709 for (next = orig; next; next = next->next) {
710 struct commit *commit = next->item;
711
712 if (*(indegree_slab_at(&indegree, commit)) == 1)
713 prio_queue_put(&queue, commit);
714 }
715
716 /*
717 * This is unfortunate; the initial tips need to be shown
718 * in the order given from the revision traversal machinery.
719 */
720 if (sort_order == REV_SORT_IN_GRAPH_ORDER)
721 prio_queue_reverse(&queue);
722
723 /* We no longer need the commit list */
724 free_commit_list(orig);
725
726 pptr = list;
727 *list = NULL((void*)0);
728 while ((commit = prio_queue_get(&queue)) != NULL((void*)0)) {
729 struct commit_list *parents;
730
731 for (parents = commit->parents; parents ; parents = parents->next) {
732 struct commit *parent = parents->item;
733 int *pi = indegree_slab_at(&indegree, parent);
734
735 if (!*pi)
736 continue;
737
738 /*
739 * parents are only enqueued for emission
740 * when all their children have been emitted thereby
741 * guaranteeing topological order.
742 */
743 if (--(*pi) == 1)
744 prio_queue_put(&queue, parent);
745 }
746 /*
747 * all children of commit have already been
748 * emitted. we can emit it now.
749 */
750 *(indegree_slab_at(&indegree, commit)) = 0;
751
752 pptr = &commit_list_insert(commit, pptr)->next;
753 }
754
755 clear_indegree_slab(&indegree);
756 clear_prio_queue(&queue);
757 if (sort_order == REV_SORT_BY_AUTHOR_DATE)
758 clear_author_date_slab(&author_date);
759}
760
761/* merge-base stuff */
762
763/* Remember to update object flag allocation in object.h */
764#define PARENT1(1u<<16) (1u<<16)
765#define PARENT2(1u<<17) (1u<<17)
766#define STALE(1u<<18) (1u<<18)
767#define RESULT(1u<<19) (1u<<19)
768
769static const unsigned all_flags = (PARENT1(1u<<16) | PARENT2(1u<<17) | STALE(1u<<18) | RESULT(1u<<19));
770
771static int queue_has_nonstale(struct prio_queue *queue)
772{
773 int i;
774 for (i = 0; i < queue->nr; i++) {
775 struct commit *commit = queue->array[i].data;
776 if (!(commit->object.flags & STALE(1u<<18)))
777 return 1;
778 }
779 return 0;
780}
781
782/* all input commits in one and twos[] must have been parsed! */
783static struct commit_list *paint_down_to_common(struct commit *one, int n, struct commit **twos)
784{
785 struct prio_queue queue = { compare_commits_by_commit_date };
786 struct commit_list *result = NULL((void*)0);
787 int i;
788
789 one->object.flags |= PARENT1(1u<<16);
790 if (!n) {
791 commit_list_append(one, &result);
792 return result;
793 }
794 prio_queue_put(&queue, one);
795
796 for (i = 0; i < n; i++) {
797 twos[i]->object.flags |= PARENT2(1u<<17);
798 prio_queue_put(&queue, twos[i]);
799 }
800
801 while (queue_has_nonstale(&queue)) {
802 struct commit *commit = prio_queue_get(&queue);
803 struct commit_list *parents;
804 int flags;
805
806 flags = commit->object.flags & (PARENT1(1u<<16) | PARENT2(1u<<17) | STALE(1u<<18));
807 if (flags == (PARENT1(1u<<16) | PARENT2(1u<<17))) {
808 if (!(commit->object.flags & RESULT(1u<<19))) {
809 commit->object.flags |= RESULT(1u<<19);
810 commit_list_insert_by_date(commit, &result);
811 }
812 /* Mark parents of a found merge stale */
813 flags |= STALE(1u<<18);
814 }
815 parents = commit->parents;
816 while (parents) {
817 struct commit *p = parents->item;
818 parents = parents->next;
819 if ((p->object.flags & flags) == flags)
820 continue;
821 if (parse_commit(p))
822 return NULL((void*)0);
823 p->object.flags |= flags;
824 prio_queue_put(&queue, p);
825 }
826 }
827
828 clear_prio_queue(&queue);
829 return result;
830}
831
832static struct commit_list *merge_bases_many(struct commit *one, int n, struct commit **twos)
833{
834 struct commit_list *list = NULL((void*)0);
835 struct commit_list *result = NULL((void*)0);
836 int i;
837
838 for (i = 0; i < n; i++) {
839 if (one == twos[i])
840 /*
841 * We do not mark this even with RESULT so we do not
842 * have to clean it up.
843 */
844 return commit_list_insert(one, &result);
845 }
846
847 if (parse_commit(one))
848 return NULL((void*)0);
849 for (i = 0; i < n; i++) {
850 if (parse_commit(twos[i]))
851 return NULL((void*)0);
852 }
853
854 list = paint_down_to_common(one, n, twos);
855
856 while (list) {
857 struct commit *commit = pop_commit(&list);
858 if (!(commit->object.flags & STALE(1u<<18)))
859 commit_list_insert_by_date(commit, &result);
860 }
861 return result;
862}
863
864struct commit_list *get_octopus_merge_bases(struct commit_list *in)
865{
866 struct commit_list *i, *j, *k, *ret = NULL((void*)0);
867
868 if (!in)
869 return ret;
870
871 commit_list_insert(in->item, &ret);
872
873 for (i = in->next; i; i = i->next) {
874 struct commit_list *new = NULL((void*)0), *end = NULL((void*)0);
875
876 for (j = ret; j; j = j->next) {
877 struct commit_list *bases;
878 bases = get_merge_bases(i->item, j->item);
879 if (!new)
880 new = bases;
881 else
882 end->next = bases;
883 for (k = bases; k; k = k->next)
884 end = k;
885 }
886 ret = new;
887 }
888 return ret;
889}
890
891static int remove_redundant(struct commit **array, int cnt)
892{
893 /*
894 * Some commit in the array may be an ancestor of
895 * another commit. Move such commit to the end of
896 * the array, and return the number of commits that
897 * are independent from each other.
898 */
899 struct commit **work;
900 unsigned char *redundant;
901 int *filled_index;
902 int i, j, filled;
903
904 work = xcalloc(cnt, sizeof(*work));
905 redundant = xcalloc(cnt, 1);
906 ALLOC_ARRAY(filled_index, cnt - 1)(filled_index) = xmalloc(st_mult(sizeof(*(filled_index)), (cnt
- 1)));
907
908 for (i = 0; i < cnt; i++)
909 parse_commit(array[i]);
910 for (i = 0; i < cnt; i++) {
911 struct commit_list *common;
912
913 if (redundant[i])
914 continue;
915 for (j = filled = 0; j < cnt; j++) {
916 if (i == j || redundant[j])
917 continue;
918 filled_index[filled] = j;
919 work[filled++] = array[j];
920 }
921 common = paint_down_to_common(array[i], filled, work);
922 if (array[i]->object.flags & PARENT2(1u<<17))
923 redundant[i] = 1;
924 for (j = 0; j < filled; j++)
925 if (work[j]->object.flags & PARENT1(1u<<16))
926 redundant[filled_index[j]] = 1;
927 clear_commit_marks(array[i], all_flags);
928 for (j = 0; j < filled; j++)
929 clear_commit_marks(work[j], all_flags);
930 free_commit_list(common);
931 }
932
933 /* Now collect the result */
934 COPY_ARRAY(work, array, cnt)copy_array((work), (array), (cnt), sizeof(*(work)) + (sizeof(
char [1 - 2*!(sizeof(*(work)) == sizeof(*(array)))]) - 1));
935 for (i = filled = 0; i < cnt; i++)
936 if (!redundant[i])
937 array[filled++] = work[i];
938 for (j = filled, i = 0; i < cnt; i++)
939 if (redundant[i])
940 array[j++] = work[i];
941 free(work);
942 free(redundant);
943 free(filled_index);
944 return filled;
945}
946
947static struct commit_list *get_merge_bases_many_0(struct commit *one,
948 int n,
949 struct commit **twos,
950 int cleanup)
951{
952 struct commit_list *list;
953 struct commit **rslt;
954 struct commit_list *result;
955 int cnt, i;
956
957 result = merge_bases_many(one, n, twos);
958 for (i = 0; i < n; i++) {
959 if (one == twos[i])
960 return result;
961 }
962 if (!result || !result->next) {
963 if (cleanup) {
964 clear_commit_marks(one, all_flags);
965 clear_commit_marks_many(n, twos, all_flags);
966 }
967 return result;
968 }
969
970 /* There are more than one */
971 cnt = commit_list_count(result);
972 rslt = xcalloc(cnt, sizeof(*rslt));
973 for (list = result, i = 0; list; list = list->next)
974 rslt[i++] = list->item;
975 free_commit_list(result);
976
977 clear_commit_marks(one, all_flags);
978 clear_commit_marks_many(n, twos, all_flags);
979
980 cnt = remove_redundant(rslt, cnt);
981 result = NULL((void*)0);
982 for (i = 0; i < cnt; i++)
983 commit_list_insert_by_date(rslt[i], &result);
984 free(rslt);
985 return result;
986}
987
988struct commit_list *get_merge_bases_many(struct commit *one,
989 int n,
990 struct commit **twos)
991{
992 return get_merge_bases_many_0(one, n, twos, 1);
993}
994
995struct commit_list *get_merge_bases_many_dirty(struct commit *one,
996 int n,
997 struct commit **twos)
998{
999 return get_merge_bases_many_0(one, n, twos, 0);
1000}
1001
1002struct commit_list *get_merge_bases(struct commit *one, struct commit *two)
1003{
1004 return get_merge_bases_many_0(one, 1, &two, 1);
1005}
1006
1007/*
1008 * Is "commit" a descendant of one of the elements on the "with_commit" list?
1009 */
1010int is_descendant_of(struct commit *commit, struct commit_list *with_commit)
1011{
1012 if (!with_commit)
1013 return 1;
1014 while (with_commit) {
1015 struct commit *other;
1016
1017 other = with_commit->item;
1018 with_commit = with_commit->next;
1019 if (in_merge_bases(other, commit))
1020 return 1;
1021 }
1022 return 0;
1023}
1024
1025/*
1026 * Is "commit" an ancestor of one of the "references"?
1027 */
1028int in_merge_bases_many(struct commit *commit, int nr_reference, struct commit **reference)
1029{
1030 struct commit_list *bases;
1031 int ret = 0, i;
1032
1033 if (parse_commit(commit))
1034 return ret;
1035 for (i = 0; i < nr_reference; i++)
1036 if (parse_commit(reference[i]))
1037 return ret;
1038
1039 bases = paint_down_to_common(commit, nr_reference, reference);
1040 if (commit->object.flags & PARENT2(1u<<17))
1041 ret = 1;
1042 clear_commit_marks(commit, all_flags);
1043 clear_commit_marks_many(nr_reference, reference, all_flags);
1044 free_commit_list(bases);
1045 return ret;
1046}
1047
1048/*
1049 * Is "commit" an ancestor of (i.e. reachable from) the "reference"?
1050 */
1051int in_merge_bases(struct commit *commit, struct commit *reference)
1052{
1053 return in_merge_bases_many(commit, 1, &reference);
1054}
1055
1056struct commit_list *reduce_heads(struct commit_list *heads)
1057{
1058 struct commit_list *p;
1059 struct commit_list *result = NULL((void*)0), **tail = &result;
1060 struct commit **array;
1061 int num_head, i;
1062
1063 if (!heads)
1064 return NULL((void*)0);
1065
1066 /* Uniquify */
1067 for (p = heads; p; p = p->next)
1068 p->item->object.flags &= ~STALE(1u<<18);
1069 for (p = heads, num_head = 0; p; p = p->next) {
1070 if (p->item->object.flags & STALE(1u<<18))
1071 continue;
1072 p->item->object.flags |= STALE(1u<<18);
1073 num_head++;
1074 }
1075 array = xcalloc(num_head, sizeof(*array));
1076 for (p = heads, i = 0; p; p = p->next) {
1077 if (p->item->object.flags & STALE(1u<<18)) {
1078 array[i++] = p->item;
1079 p->item->object.flags &= ~STALE(1u<<18);
1080 }
1081 }
1082 num_head = remove_redundant(array, num_head);
1083 for (i = 0; i < num_head; i++)
1084 tail = &commit_list_insert(array[i], tail)->next;
1085 return result;
1086}
1087
1088static const char gpg_sig_header[] = "gpgsig";
1089static const int gpg_sig_header_len = sizeof(gpg_sig_header) - 1;
1090
1091static int do_sign_commit(struct strbuf *buf, const char *keyid)
1092{
1093 struct strbuf sig = STRBUF_INIT{ 0, 0, strbuf_slopbuf };
1094 int inspos, copypos;
1095 const char *eoh;
1096
1097 /* find the end of the header */
1098 eoh = strstr(buf->buf, "\n\n");
1099 if (!eoh)
1100 inspos = buf->len;
1101 else
1102 inspos = eoh - buf->buf + 1;
1103
1104 if (!keyid || !*keyid)
1105 keyid = get_signing_key();
1106 if (sign_buffer(buf, &sig, keyid)) {
1107 strbuf_release(&sig);
1108 return -1;
1109 }
1110
1111 for (copypos = 0; sig.buf[copypos]; ) {
1112 const char *bol = sig.buf + copypos;
1113 const char *eol = strchrnulgitstrchrnul(bol, '\n');
1114 int len = (eol - bol) + !!*eol;
1115
1116 if (!copypos) {
1117 strbuf_insert(buf, inspos, gpg_sig_header, gpg_sig_header_len);
1118 inspos += gpg_sig_header_len;
1119 }
1120 strbuf_insert(buf, inspos++, " ", 1);
1121 strbuf_insert(buf, inspos, bol, len);
1122 inspos += len;
1123 copypos += len;
1124 }
1125 strbuf_release(&sig);
1126 return 0;
1127}
1128
1129int parse_signed_commit(const struct commit *commit,
1130 struct strbuf *payload, struct strbuf *signature)
1131{
1132
1133 unsigned long size;
1134 const char *buffer = get_commit_buffer(commit, &size);
1135 int in_signature, saw_signature = -1;
1136 const char *line, *tail;
1137
1138 line = buffer;
1139 tail = buffer + size;
1140 in_signature = 0;
1141 saw_signature = 0;
1142 while (line < tail) {
2
←
Assuming 'line' is < 'tail'
→
3
←
Loop condition is true. Entering loop body
→
9
←
Loop condition is true. Entering loop body
→
1143 const char *sig = NULL((void*)0);
1144 const char *next = memchr(line, '\n', tail - line);
1145
1146 next = next ? next + 1 : tail;
4
←
Assuming 'next' is non-null
→
5
←
'?' condition is true
→
10
←
Assuming 'next' is non-null
→
11
←
'?' condition is true
→
1147 if (in_signature && line[0] == ' ')
1148 sig = line + 1;
1149 else if (starts_with(line, gpg_sig_header) &&
12
←
Taking true branch
→
1150 line[gpg_sig_header_len] == ' ')
1151 sig = line + gpg_sig_header_len + 1;
1152 if (sig) {
6
←
Taking false branch
→
13
←
Assuming 'sig' is null
→
14
←
Assuming pointer value is null
→
15
←
Taking false branch
→
1153 strbuf_add(signature, sig, next - sig);
1154 saw_signature = 1;
1155 in_signature = 1;
1156 } else {
1157 if (*line == '\n')
7
←
Taking false branch
→
16
←
Dereference of null pointer (loaded from variable 'line')
1158 /* dump the whole remainder of the buffer */
1159 next = tail;
1160 strbuf_add(payload, line, next - line);
1161 in_signature = 0;
1162 }
1163 line = next;
8
←
Value assigned to 'line'
→
1164 }
1165 unuse_commit_buffer(commit, buffer);
1166 return saw_signature;
1167}
1168
1169int remove_signature(struct strbuf *buf)
1170{
1171 const char *line = buf->buf;
1172 const char *tail = buf->buf + buf->len;
1173 int in_signature = 0;
1174 const char *sig_start = NULL((void*)0);
1175 const char *sig_end = NULL((void*)0);
1176
1177 while (line < tail) {
1178 const char *next = memchr(line, '\n', tail - line);
1179 next = next ? next + 1 : tail;
1180
1181 if (in_signature && line[0] == ' ')
1182 sig_end = next;
1183 else if (starts_with(line, gpg_sig_header) &&
1184 line[gpg_sig_header_len] == ' ') {
1185 sig_start = line;
1186 sig_end = next;
1187 in_signature = 1;
1188 } else {
1189 if (*line == '\n')
1190 /* dump the whole remainder of the buffer */
1191 next = tail;
1192 in_signature = 0;
1193 }
1194 line = next;
1195 }
1196
1197 if (sig_start)
1198 strbuf_remove(buf, sig_start - buf->buf, sig_end - sig_start);
1199
1200 return sig_start != NULL((void*)0);
1201}
1202
1203static void handle_signed_tag(struct commit *parent, struct commit_extra_header ***tail)
1204{
1205 struct merge_remote_desc *desc;
1206 struct commit_extra_header *mergetag;
1207 char *buf;
1208 unsigned long size, len;
1209 enum object_type type;
1210
1211 desc = merge_remote_util(parent)((struct merge_remote_desc *)((parent)->util));
1212 if (!desc || !desc->obj)
1213 return;
1214 buf = read_sha1_file(desc->obj->oid.hash, &type, &size);
1215 if (!buf || type != OBJ_TAG)
1216 goto free_return;
1217 len = parse_signature(buf, size);
1218 if (size == len)
1219 goto free_return;
1220 /*
1221 * We could verify this signature and either omit the tag when
1222 * it does not validate, but the integrator may not have the
1223 * public key of the signer of the tag he is merging, while a
1224 * later auditor may have it while auditing, so let's not run
1225 * verify-signed-buffer here for now...
1226 *
1227 * if (verify_signed_buffer(buf, len, buf + len, size - len, ...))
1228 * warn("warning: signed tag unverified.");
1229 */
1230 mergetag = xcalloc(1, sizeof(*mergetag));
1231 mergetag->key = xstrdup("mergetag");
1232 mergetag->value = buf;
1233 mergetag->len = size;
1234
1235 **tail = mergetag;
1236 *tail = &mergetag->next;
1237 return;
1238
1239free_return:
1240 free(buf);
1241}
1242
1243int check_commit_signature(const struct commit *commit, struct signature_check *sigc)
1244{
1245 struct strbuf payload = STRBUF_INIT{ 0, 0, strbuf_slopbuf };
1246 struct strbuf signature = STRBUF_INIT{ 0, 0, strbuf_slopbuf };
1247 int ret = 1;
1248
1249 sigc->result = 'N';
1250
1251 if (parse_signed_commit(commit, &payload, &signature) <= 0)
1
Calling 'parse_signed_commit'
→
1252 goto out;
1253 ret = check_signature(payload.buf, payload.len, signature.buf,
1254 signature.len, sigc);
1255
1256 out:
1257 strbuf_release(&payload);
1258 strbuf_release(&signature);
1259
1260 return ret;
1261}
1262
1263
1264
1265void append_merge_tag_headers(struct commit_list *parents,
1266 struct commit_extra_header ***tail)
1267{
1268 while (parents) {
1269 struct commit *parent = parents->item;
1270 handle_signed_tag(parent, tail);
1271 parents = parents->next;
1272 }
1273}
1274
1275static void add_extra_header(struct strbuf *buffer,
1276 struct commit_extra_header *extra)
1277{
1278 strbuf_addstr(buffer, extra->key);
1279 if (extra->len)
1280 strbuf_add_lines(buffer, " ", extra->value, extra->len);
1281 else
1282 strbuf_addch(buffer, '\n');
1283}
1284
1285struct commit_extra_header *read_commit_extra_headers(struct commit *commit,
1286 const char **exclude)
1287{
1288 struct commit_extra_header *extra = NULL((void*)0);
1289 unsigned long size;
1290 const char *buffer = get_commit_buffer(commit, &size);
1291 extra = read_commit_extra_header_lines(buffer, size, exclude);
1292 unuse_commit_buffer(commit, buffer);
1293 return extra;
1294}
1295
1296void for_each_mergetag(each_mergetag_fn fn, struct commit *commit, void *data)
1297{
1298 struct commit_extra_header *extra, *to_free;
1299
1300 to_free = read_commit_extra_headers(commit, NULL((void*)0));
1301 for (extra = to_free; extra; extra = extra->next) {
1302 if (strcmp(extra->key, "mergetag"))
1303 continue; /* not a merge tag */
1304 fn(commit, extra, data);
1305 }
1306 free_commit_extra_headers(to_free);
1307}
1308
1309static inline int standard_header_field(const char *field, size_t len)
1310{
1311 return ((len == 4 && !memcmp(field, "tree ", 5)) ||
1312 (len == 6 && !memcmp(field, "parent ", 7)) ||
1313 (len == 6 && !memcmp(field, "author ", 7)) ||
1314 (len == 9 && !memcmp(field, "committer ", 10)) ||
1315 (len == 8 && !memcmp(field, "encoding ", 9)));
1316}
1317
1318static int excluded_header_field(const char *field, size_t len, const char **exclude)
1319{
1320 if (!exclude)
1321 return 0;
1322
1323 while (*exclude) {
1324 size_t xlen = strlen(*exclude);
1325 if (len == xlen &&
1326 !memcmp(field, *exclude, xlen) && field[xlen] == ' ')
1327 return 1;
1328 exclude++;
1329 }
1330 return 0;
1331}
1332
1333static struct commit_extra_header *read_commit_extra_header_lines(
1334 const char *buffer, size_t size,
1335 const char **exclude)
1336{
1337 struct commit_extra_header *extra = NULL((void*)0), **tail = &extra, *it = NULL((void*)0);
1338 const char *line, *next, *eof, *eob;
1339 struct strbuf buf = STRBUF_INIT{ 0, 0, strbuf_slopbuf };
1340
1341 for (line = buffer, eob = line + size;
1342 line < eob && *line != '\n';
1343 line = next) {
1344 next = memchr(line, '\n', eob - line);
1345 next = next ? next + 1 : eob;
1346 if (*line == ' ') {
1347 /* continuation */
1348 if (it)
1349 strbuf_add(&buf, line + 1, next - (line + 1));
1350 continue;
1351 }
1352 if (it)
1353 it->value = strbuf_detach(&buf, &it->len);
1354 strbuf_reset(&buf)strbuf_setlen(&buf, 0);
1355 it = NULL((void*)0);
1356
1357 eof = strchr(line, ' ');
1358 if (next <= eof)
1359 eof = next;
1360
1361 if (standard_header_field(line, eof - line) ||
1362 excluded_header_field(line, eof - line, exclude))
1363 continue;
1364
1365 it = xcalloc(1, sizeof(*it));
1366 it->key = xmemdupz(line, eof-line);
1367 *tail = it;
1368 tail = &it->next;
1369 if (eof + 1 < next)
1370 strbuf_add(&buf, eof + 1, next - (eof + 1));
1371 }
1372 if (it)
1373 it->value = strbuf_detach(&buf, &it->len);
1374 return extra;
1375}
1376
1377void free_commit_extra_headers(struct commit_extra_header *extra)
1378{
1379 while (extra) {
1380 struct commit_extra_header *next = extra->next;
1381 free(extra->key);
1382 free(extra->value);
1383 free(extra);
1384 extra = next;
1385 }
1386}
1387
1388int commit_tree(const char *msg, size_t msg_len,
1389 const unsigned char *tree,
1390 struct commit_list *parents, unsigned char *ret,
1391 const char *author, const char *sign_commit)
1392{
1393 struct commit_extra_header *extra = NULL((void*)0), **tail = &extra;
1394 int result;
1395
1396 append_merge_tag_headers(parents, &tail);
1397 result = commit_tree_extended(msg, msg_len, tree, parents, ret,
1398 author, sign_commit, extra);
1399 free_commit_extra_headers(extra);
1400 return result;
1401}
1402
1403static int find_invalid_utf8(const char *buf, int len)
1404{
1405 int offset = 0;
1406 static const unsigned int max_codepoint[] = {
1407 0x7f, 0x7ff, 0xffff, 0x10ffff
1408 };
1409
1410 while (len) {
1411 unsigned char c = *buf++;
1412 int bytes, bad_offset;
1413 unsigned int codepoint;
1414 unsigned int min_val, max_val;
1415
1416 len--;
1417 offset++;
1418
1419 /* Simple US-ASCII? No worries. */
1420 if (c < 0x80)
1421 continue;
1422
1423 bad_offset = offset-1;
1424
1425 /*
1426 * Count how many more high bits set: that's how
1427 * many more bytes this sequence should have.
1428 */
1429 bytes = 0;
1430 while (c & 0x40) {
1431 c <<= 1;
1432 bytes++;
1433 }
1434
1435 /*
1436 * Must be between 1 and 3 more bytes. Longer sequences result in
1437 * codepoints beyond U+10FFFF, which are guaranteed never to exist.
1438 */
1439 if (bytes < 1 || 3 < bytes)
1440 return bad_offset;
1441
1442 /* Do we *have* that many bytes? */
1443 if (len < bytes)
1444 return bad_offset;
1445
1446 /*
1447 * Place the encoded bits at the bottom of the value and compute the
1448 * valid range.
1449 */
1450 codepoint = (c & 0x7f) >> bytes;
1451 min_val = max_codepoint[bytes-1] + 1;
1452 max_val = max_codepoint[bytes];
1453
1454 offset += bytes;
1455 len -= bytes;
1456
1457 /* And verify that they are good continuation bytes */
1458 do {
1459 codepoint <<= 6;
1460 codepoint |= *buf & 0x3f;
1461 if ((*buf++ & 0xc0) != 0x80)
1462 return bad_offset;
1463 } while (--bytes);
1464
1465 /* Reject codepoints that are out of range for the sequence length. */
1466 if (codepoint < min_val || codepoint > max_val)
1467 return bad_offset;
1468 /* Surrogates are only for UTF-16 and cannot be encoded in UTF-8. */
1469 if ((codepoint & 0x1ff800) == 0xd800)
1470 return bad_offset;
1471 /* U+xxFFFE and U+xxFFFF are guaranteed non-characters. */
1472 if ((codepoint & 0xfffe) == 0xfffe)
1473 return bad_offset;
1474 /* So are anything in the range U+FDD0..U+FDEF. */
1475 if (codepoint >= 0xfdd0 && codepoint <= 0xfdef)
1476 return bad_offset;
1477 }
1478 return -1;
1479}
1480
1481/*
1482 * This verifies that the buffer is in proper utf8 format.
1483 *
1484 * If it isn't, it assumes any non-utf8 characters are Latin1,
1485 * and does the conversion.
1486 */
1487static int verify_utf8(struct strbuf *buf)
1488{
1489 int ok = 1;
1490 long pos = 0;
1491
1492 for (;;) {
1493 int bad;
1494 unsigned char c;
1495 unsigned char replace[2];
1496
1497 bad = find_invalid_utf8(buf->buf + pos, buf->len - pos);
1498 if (bad < 0)
1499 return ok;
1500 pos += bad;
1501 ok = 0;
1502 c = buf->buf[pos];
1503 strbuf_remove(buf, pos, 1);
1504
1505 /* We know 'c' must be in the range 128-255 */
1506 replace[0] = 0xc0 + (c >> 6);
1507 replace[1] = 0x80 + (c & 0x3f);
1508 strbuf_insert(buf, pos, replace, 2);
1509 pos += 2;
1510 }
1511}
1512
1513static const char commit_utf8_warn[] =
1514N_("Warning: commit message did not conform to UTF-8.\n"("Warning: commit message did not conform to UTF-8.\n" "You may want to amend it after fixing the message, or set the config\n"
"variable i18n.commitencoding to the encoding your project uses.\n"
)
1515 "You may want to amend it after fixing the message, or set the config\n"("Warning: commit message did not conform to UTF-8.\n" "You may want to amend it after fixing the message, or set the config\n"
"variable i18n.commitencoding to the encoding your project uses.\n"
)
1516 "variable i18n.commitencoding to the encoding your project uses.\n")("Warning: commit message did not conform to UTF-8.\n" "You may want to amend it after fixing the message, or set the config\n"
"variable i18n.commitencoding to the encoding your project uses.\n"
);
1517
1518int commit_tree_extended(const char *msg, size_t msg_len,
1519 const unsigned char *tree,
1520 struct commit_list *parents, unsigned char *ret,
1521 const char *author, const char *sign_commit,
1522 struct commit_extra_header *extra)
1523{
1524 int result;
1525 int encoding_is_utf8;
1526 struct strbuf buffer;
1527
1528 assert_sha1_type(tree, OBJ_TREE);
1529
1530 if (memchr(msg, '\0', msg_len))
1531 return error("a NUL byte in commit log message not allowed.")(error("a NUL byte in commit log message not allowed."), const_error
());
1532
1533 /* Not having i18n.commitencoding is the same as having utf-8 */
1534 encoding_is_utf8 = is_encoding_utf8(git_commit_encoding);
1535
1536 strbuf_init(&buffer, 8192); /* should avoid reallocs for the headers */
1537 strbuf_addf(&buffer, "tree %s\n", sha1_to_hex(tree));
1538
1539 /*
1540 * NOTE! This ordering means that the same exact tree merged with a
1541 * different order of parents will be a _different_ changeset even
1542 * if everything else stays the same.
1543 */
1544 while (parents) {
1545 struct commit *parent = pop_commit(&parents);
1546 strbuf_addf(&buffer, "parent %s\n",
1547 oid_to_hex(&parent->object.oid));
1548 }
1549
1550 /* Person/date information */
1551 if (!author)
1552 author = git_author_info(IDENT_STRICT1);
1553 strbuf_addf(&buffer, "author %s\n", author);
1554 strbuf_addf(&buffer, "committer %s\n", git_committer_info(IDENT_STRICT1));
1555 if (!encoding_is_utf8)
1556 strbuf_addf(&buffer, "encoding %s\n", git_commit_encoding);
1557
1558 while (extra) {
1559 add_extra_header(&buffer, extra);
1560 extra = extra->next;
1561 }
1562 strbuf_addch(&buffer, '\n');
1563
1564 /* And add the comment */
1565 strbuf_add(&buffer, msg, msg_len);
1566
1567 /* And check the encoding */
1568 if (encoding_is_utf8 && !verify_utf8(&buffer))
1569 fprintf(stderr__stderrp, _(commit_utf8_warn));
1570
1571 if (sign_commit && do_sign_commit(&buffer, sign_commit))
1572 return -1;
1573
1574 result = write_sha1_file(buffer.buf, buffer.len, commit_type, ret);
1575 strbuf_release(&buffer);
1576 return result;
1577}
1578
1579void set_merge_remote_desc(struct commit *commit,
1580 const char *name, struct object *obj)
1581{
1582 struct merge_remote_desc *desc;
1583 FLEX_ALLOC_STR(desc, name, name)do { size_t flex_array_len_ = (strlen(name)); ((desc)) = xcalloc
(1, st_add(st_add((sizeof(*((desc)))),(flex_array_len_)),(1))
); __builtin___memcpy_chk ((void *)((desc))->name, ((name)
), flex_array_len_, __builtin_object_size ((void *)((desc))->
name, 0)); } while (0);
1584 desc->obj = obj;
1585 commit->util = desc;
1586}
1587
1588struct commit *get_merge_parent(const char *name)
1589{
1590 struct object *obj;
1591 struct commit *commit;
1592 struct object_id oid;
1593 if (get_sha1(name, oid.hash))
1594 return NULL((void*)0);
1595 obj = parse_object(oid.hash);
1596 commit = (struct commit *)peel_to_type(name, 0, obj, OBJ_COMMIT);
1597 if (commit && !commit->util)
1598 set_merge_remote_desc(commit, name, obj);
1599 return commit;
1600}
1601
1602/*
1603 * Append a commit to the end of the commit_list.
1604 *
1605 * next starts by pointing to the variable that holds the head of an
1606 * empty commit_list, and is updated to point to the "next" field of
1607 * the last item on the list as new commits are appended.
1608 *
1609 * Usage example:
1610 *
1611 * struct commit_list *list;
1612 * struct commit_list **next = &list;
1613 *
1614 * next = commit_list_append(c1, next);
1615 * next = commit_list_append(c2, next);
1616 * assert(commit_list_count(list) == 2);
1617 * return list;
1618 */
1619struct commit_list **commit_list_append(struct commit *commit,
1620 struct commit_list **next)
1621{
1622 struct commit_list *new = xmalloc(sizeof(struct commit_list));
1623 new->item = commit;
1624 *next = new;
1625 new->next = NULL((void*)0);
1626 return &new->next;
1627}
1628
1629const char *find_commit_header(const char *msg, const char *key, size_t *out_len)
1630{
1631 int key_len = strlen(key);
1632 const char *line = msg;
1633
1634 while (line) {
1635 const char *eol = strchrnulgitstrchrnul(line, '\n');
1636
1637 if (line == eol)
1638 return NULL((void*)0);
1639
1640 if (eol - line > key_len &&
1641 !strncmp(line, key, key_len) &&
1642 line[key_len] == ' ') {
1643 *out_len = eol - line - key_len - 1;
1644 return line + key_len + 1;
1645 }
1646 line = *eol ? eol + 1 : NULL((void*)0);
1647 }
1648 return NULL((void*)0);
1649}
1650
1651/*
1652 * Inspect the given string and determine the true "end" of the log message, in
1653 * order to find where to put a new Signed-off-by: line. Ignored are
1654 * trailing comment lines and blank lines, and also the traditional
1655 * "Conflicts:" block that is not commented out, so that we can use
1656 * "git commit -s --amend" on an existing commit that forgot to remove
1657 * it.
1658 *
1659 * Returns the number of bytes from the tail to ignore, to be fed as
1660 * the second parameter to append_signoff().
1661 */
1662int ignore_non_trailer(const char *buf, size_t len)
1663{
1664 int boc = 0;
1665 int bol = 0;
1666 int in_old_conflicts_block = 0;
1667
1668 while (bol < len) {
1669 const char *next_line = memchr(buf + bol, '\n', len - bol);
1670
1671 if (!next_line)
1672 next_line = buf + len;
1673 else
1674 next_line++;
1675
1676 if (buf[bol] == comment_line_char || buf[bol] == '\n') {
1677 /* is this the first of the run of comments? */
1678 if (!boc)
1679 boc = bol;
1680 /* otherwise, it is just continuing */
1681 } else if (starts_with(buf + bol, "Conflicts:\n")) {
1682 in_old_conflicts_block = 1;
1683 if (!boc)
1684 boc = bol;
1685 } else if (in_old_conflicts_block && buf[bol] == '\t') {
1686 ; /* a pathname in the conflicts block */
1687 } else if (boc) {
1688 /* the previous was not trailing comment */
1689 boc = 0;
1690 in_old_conflicts_block = 0;
1691 }
1692 bol = next_line - buf;
1693 }
1694 return boc ? len - boc : 0;
1695}