commit.c

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