read-tree.c

   1 /*
   2  * GIT - The information manager from hell
   3  *
   4  * Copyright (C) Linus Torvalds, 2005
   5  */
   6 #define DBRT_DEBUG 1
   7
   8 #include "cache.h"
   9
  10 #include "object.h"
  11 #include "tree.h"
  12 #include "cache-tree.h"
  13 #include <sys/time.h>
  14 #include <signal.h>
  15
  16 static int merge = 0;
  17 static int update = 0;
  18 static int index_only = 0;
  19 static int nontrivial_merge = 0;
  20 static int trivial_merges_only = 0;
  21 static int aggressive = 0;
  22 static int verbose_update = 0;
  23 static volatile int progress_update = 0;
  24
  25 static int head_idx = -1;
  26 static int merge_size = 0;
  27
  28 static struct object_list *trees = NULL;
  29
  30 static struct cache_entry df_conflict_entry = {
  31 };
  32
  33 static struct tree_entry_list df_conflict_list = {
  34         .name = NULL,
  35         .next = &df_conflict_list
  36 };
  37
  38 typedef int (*merge_fn_t)(struct cache_entry **src);
  39
  40 static int entcmp(char *name1, int dir1, char *name2, int dir2)
  41 {
  42         int len1 = strlen(name1);
  43         int len2 = strlen(name2);
  44         int len = len1 < len2 ? len1 : len2;
  45         int ret = memcmp(name1, name2, len);
  46         unsigned char c1, c2;
  47         if (ret)
  48                 return ret;
  49         c1 = name1[len];
  50         c2 = name2[len];
  51         if (!c1 && dir1)
  52                 c1 = '/';
  53         if (!c2 && dir2)
  54                 c2 = '/';
  55         ret = (c1 < c2) ? -1 : (c1 > c2) ? 1 : 0;
  56         if (c1 && c2 && !ret)
  57                 ret = len1 - len2;
  58         return ret;
  59 }
  60
  61 static int unpack_trees_rec(struct tree_entry_list **posns, int len,
  62                             const char *base, merge_fn_t fn, int *indpos)
  63 {
  64         int baselen = strlen(base);
  65         int src_size = len + 1;
  66         do {
  67                 int i;
  68                 char *first;
  69                 int firstdir = 0;
  70                 int pathlen;
  71                 unsigned ce_size;
  72                 struct tree_entry_list **subposns;
  73                 struct cache_entry **src;
  74                 int any_files = 0;
  75                 int any_dirs = 0;
  76                 char *cache_name;
  77                 int ce_stage;
  78
  79                 /* Find the first name in the input. */
  80
  81                 first = NULL;
  82                 cache_name = NULL;
  83
  84                 /* Check the cache */
  85                 if (merge && *indpos < active_nr) {
  86                         /* This is a bit tricky: */
  87                         /* If the index has a subdirectory (with
  88                          * contents) as the first name, it'll get a
  89                          * filename like "foo/bar". But that's after
  90                          * "foo", so the entry in trees will get
  91                          * handled first, at which point we'll go into
  92                          * "foo", and deal with "bar" from the index,
  93                          * because the base will be "foo/". The only
  94                          * way we can actually have "foo/bar" first of
  95                          * all the things is if the trees don't
  96                          * contain "foo" at all, in which case we'll
  97                          * handle "foo/bar" without going into the
  98                          * directory, but that's fine (and will return
  99                          * an error anyway, with the added unknown
 100                          * file case.
 101                          */
 102
 103                         cache_name = active_cache[*indpos]->name;
 104                         if (strlen(cache_name) > baselen &&
 105                             !memcmp(cache_name, base, baselen)) {
 106                                 cache_name += baselen;
 107                                 first = cache_name;
 108                         } else {
 109                                 cache_name = NULL;
 110                         }
 111                 }
 112
 113 #if DBRT_DEBUG > 1
 114                 if (first)
 115                         printf("index %s\n", first);
 116 #endif
 117                 for (i = 0; i < len; i++) {
 118                         if (!posns[i] || posns[i] == &df_conflict_list)
 119                                 continue;
 120 #if DBRT_DEBUG > 1
 121                         printf("%d %s\n", i + 1, posns[i]->name);
 122 #endif
 123                         if (!first || entcmp(first, firstdir,
 124                                              posns[i]->name,
 125                                              posns[i]->directory) > 0) {
 126                                 first = posns[i]->name;
 127                                 firstdir = posns[i]->directory;
 128                         }
 129                 }
 130                 /* No name means we're done */
 131                 if (!first)
 132                         return 0;
 133
 134                 pathlen = strlen(first);
 135                 ce_size = cache_entry_size(baselen + pathlen);
 136
 137                 src = xcalloc(src_size, sizeof(struct cache_entry *));
 138
 139                 subposns = xcalloc(len, sizeof(struct tree_list_entry *));
 140
 141                 if (cache_name && !strcmp(cache_name, first)) {
 142                         any_files = 1;
 143                         src[0] = active_cache[*indpos];
 144                         remove_cache_entry_at(*indpos);
 145                 }
 146
 147                 for (i = 0; i < len; i++) {
 148                         struct cache_entry *ce;
 149
 150                         if (!posns[i] ||
 151                             (posns[i] != &df_conflict_list &&
 152                              strcmp(first, posns[i]->name))) {
 153                                 continue;
 154                         }
 155
 156                         if (posns[i] == &df_conflict_list) {
 157                                 src[i + merge] = &df_conflict_entry;
 158                                 continue;
 159                         }
 160
 161                         if (posns[i]->directory) {
 162                                 any_dirs = 1;
 163                                 parse_tree(posns[i]->item.tree);
 164                                 subposns[i] = posns[i]->item.tree->entries;
 165                                 posns[i] = posns[i]->next;
 166                                 src[i + merge] = &df_conflict_entry;
 167                                 continue;
 168                         }
 169
 170                         if (!merge)
 171                                 ce_stage = 0;
 172                         else if (i + 1 < head_idx)
 173                                 ce_stage = 1;
 174                         else if (i + 1 > head_idx)
 175                                 ce_stage = 3;
 176                         else
 177                                 ce_stage = 2;
 178
 179                         ce = xcalloc(1, ce_size);
 180                         ce->ce_mode = create_ce_mode(posns[i]->mode);
 181                         ce->ce_flags = create_ce_flags(baselen + pathlen,
 182                                                        ce_stage);
 183                         memcpy(ce->name, base, baselen);
 184                         memcpy(ce->name + baselen, first, pathlen + 1);
 185
 186                         any_files = 1;
 187
 188                         memcpy(ce->sha1, posns[i]->item.any->sha1, 20);
 189                         src[i + merge] = ce;
 190                         subposns[i] = &df_conflict_list;
 191                         posns[i] = posns[i]->next;
 192                 }
 193                 if (any_files) {
 194                         if (merge) {
 195                                 int ret;
 196
 197 #if DBRT_DEBUG > 1
 198                                 printf("%s:\n", first);
 199                                 for (i = 0; i < src_size; i++) {
 200                                         printf(" %d ", i);
 201                                         if (src[i])
 202                                                 printf("%s\n", sha1_to_hex(src[i]->sha1));
 203                                         else
 204                                                 printf("\n");
 205                                 }
 206 #endif
 207                                 ret = fn(src);
 208
 209 #if DBRT_DEBUG > 1
 210                                 printf("Added %d entries\n", ret);
 211 #endif
 212                                 *indpos += ret;
 213                         } else {
 214                                 for (i = 0; i < src_size; i++) {
 215                                         if (src[i]) {
 216                                                 add_cache_entry(src[i], ADD_CACHE_OK_TO_ADD|ADD_CACHE_SKIP_DFCHECK);
 217                                         }
 218                                 }
 219                         }
 220                 }
 221                 if (any_dirs) {
 222                         char *newbase = xmalloc(baselen + 2 + pathlen);
 223                         memcpy(newbase, base, baselen);
 224                         memcpy(newbase + baselen, first, pathlen);
 225                         newbase[baselen + pathlen] = '/';
 226                         newbase[baselen + pathlen + 1] = '\0';
 227                         if (unpack_trees_rec(subposns, len, newbase, fn,
 228                                              indpos))
 229                                 return -1;
 230                         free(newbase);
 231                 }
 232                 free(subposns);
 233                 free(src);
 234         } while (1);
 235 }
 236
 237 static void reject_merge(struct cache_entry *ce)
 238 {
 239         die("Entry '%s' would be overwritten by merge. Cannot merge.",
 240             ce->name);
 241 }
 242
 243 /* Unlink the last component and attempt to remove leading
 244  * directories, in case this unlink is the removal of the
 245  * last entry in the directory -- empty directories are removed.
 246  */
 247 static void unlink_entry(char *name)
 248 {
 249         char *cp, *prev;
 250
 251         if (unlink(name))
 252                 return;
 253         prev = NULL;
 254         while (1) {
 255                 int status;
 256                 cp = strrchr(name, '/');
 257                 if (prev)
 258                         *prev = '/';
 259                 if (!cp)
 260                         break;
 261
 262                 *cp = 0;
 263                 status = rmdir(name);
 264                 if (status) {
 265                         *cp = '/';
 266                         break;
 267                 }
 268                 prev = cp;
 269         }
 270 }
 271
 272 static void progress_interval(int signum)
 273 {
 274         progress_update = 1;
 275 }
 276
 277 static void setup_progress_signal(void)
 278 {
 279         struct sigaction sa;
 280         struct itimerval v;
 281
 282         memset(&sa, 0, sizeof(sa));
 283         sa.sa_handler = progress_interval;
 284         sigemptyset(&sa.sa_mask);
 285         sa.sa_flags = SA_RESTART;
 286         sigaction(SIGALRM, &sa, NULL);
 287
 288         v.it_interval.tv_sec = 1;
 289         v.it_interval.tv_usec = 0;
 290         v.it_value = v.it_interval;
 291         setitimer(ITIMER_REAL, &v, NULL);
 292 }
 293
 294 static void check_updates(struct cache_entry **src, int nr)
 295 {
 296         static struct checkout state = {
 297                 .base_dir = "",
 298                 .force = 1,
 299                 .quiet = 1,
 300                 .refresh_cache = 1,
 301         };
 302         unsigned short mask = htons(CE_UPDATE);
 303         unsigned last_percent = 200, cnt = 0, total = 0;
 304
 305         if (update && verbose_update) {
 306                 for (total = cnt = 0; cnt < nr; cnt++) {
 307                         struct cache_entry *ce = src[cnt];
 308                         if (!ce->ce_mode || ce->ce_flags & mask)
 309                                 total++;
 310                 }
 311
 312                 /* Don't bother doing this for very small updates */
 313                 if (total < 250)
 314                         total = 0;
 315
 316                 if (total) {
 317                         fprintf(stderr, "Checking files out...\n");
 318                         setup_progress_signal();
 319                         progress_update = 1;
 320                 }
 321                 cnt = 0;
 322         }
 323
 324         while (nr--) {
 325                 struct cache_entry *ce = *src++;
 326
 327                 if (total) {
 328                         if (!ce->ce_mode || ce->ce_flags & mask) {
 329                                 unsigned percent;
 330                                 cnt++;
 331                                 percent = (cnt * 100) / total;
 332                                 if (percent != last_percent ||
 333                                     progress_update) {
 334                                         fprintf(stderr, "%4u%% (%u/%u) done\r",
 335                                                 percent, cnt, total);
 336                                         last_percent = percent;
 337                                 }
 338                         }
 339                 }
 340                 if (!ce->ce_mode) {
 341                         if (update)
 342                                 unlink_entry(ce->name);
 343                         continue;
 344                 }
 345                 if (ce->ce_flags & mask) {
 346                         ce->ce_flags &= ~mask;
 347                         if (update)
 348                                 checkout_entry(ce, &state, NULL);
 349                 }
 350         }
 351         if (total) {
 352                 signal(SIGALRM, SIG_IGN);
 353                 fputc('\n', stderr);
 354         }
 355 }
 356
 357 static int unpack_trees(merge_fn_t fn)
 358 {
 359         int indpos = 0;
 360         unsigned len = object_list_length(trees);
 361         struct tree_entry_list **posns;
 362         int i;
 363         struct object_list *posn = trees;
 364         merge_size = len;
 365
 366         if (len) {
 367                 posns = xmalloc(len * sizeof(struct tree_entry_list *));
 368                 for (i = 0; i < len; i++) {
 369                         posns[i] = ((struct tree *) posn->item)->entries;
 370                         posn = posn->next;
 371                 }
 372                 if (unpack_trees_rec(posns, len, "", fn, &indpos))
 373                         return -1;
 374         }
 375
 376         if (trivial_merges_only && nontrivial_merge)
 377                 die("Merge requires file-level merging");
 378
 379         check_updates(active_cache, active_nr);
 380         return 0;
 381 }
 382
 383 static int list_tree(unsigned char *sha1)
 384 {
 385         struct tree *tree = parse_tree_indirect(sha1);
 386         if (!tree)
 387                 return -1;
 388         object_list_append(&tree->object, &trees);
 389         return 0;
 390 }
 391
 392 static int same(struct cache_entry *a, struct cache_entry *b)
 393 {
 394         if (!!a != !!b)
 395                 return 0;
 396         if (!a && !b)
 397                 return 1;
 398         return a->ce_mode == b->ce_mode &&
 399                 !memcmp(a->sha1, b->sha1, 20);
 400 }
 401
 402
 403 /*
 404  * When a CE gets turned into an unmerged entry, we
 405  * want it to be up-to-date
 406  */
 407 static void verify_uptodate(struct cache_entry *ce)
 408 {
 409         struct stat st;
 410
 411         if (index_only)
 412                 return;
 413
 414         if (!lstat(ce->name, &st)) {
 415                 unsigned changed = ce_match_stat(ce, &st, 1);
 416                 if (!changed)
 417                         return;
 418                 errno = 0;
 419         }
 420         if (errno == ENOENT)
 421                 return;
 422         die("Entry '%s' not uptodate. Cannot merge.", ce->name);
 423 }
 424
 425 static void invalidate_ce_path(struct cache_entry *ce)
 426 {
 427         if (ce)
 428                 cache_tree_invalidate_path(active_cache_tree, ce->name);
 429 }
 430
 431 static int merged_entry(struct cache_entry *merge, struct cache_entry *old)
 432 {
 433         merge->ce_flags |= htons(CE_UPDATE);
 434         if (old) {
 435                 /*
 436                  * See if we can re-use the old CE directly?
 437                  * That way we get the uptodate stat info.
 438                  *
 439                  * This also removes the UPDATE flag on
 440                  * a match.
 441                  */
 442                 if (same(old, merge)) {
 443                         *merge = *old;
 444                 } else {
 445                         verify_uptodate(old);
 446                         invalidate_ce_path(old);
 447                 }
 448         }
 449         merge->ce_flags &= ~htons(CE_STAGEMASK);
 450         add_cache_entry(merge, ADD_CACHE_OK_TO_ADD);
 451         return 1;
 452 }
 453
 454 static int deleted_entry(struct cache_entry *ce, struct cache_entry *old)
 455 {
 456         if (old)
 457                 verify_uptodate(old);
 458         ce->ce_mode = 0;
 459         add_cache_entry(ce, ADD_CACHE_OK_TO_ADD);
 460         invalidate_ce_path(ce);
 461         return 1;
 462 }
 463
 464 static int keep_entry(struct cache_entry *ce)
 465 {
 466         add_cache_entry(ce, ADD_CACHE_OK_TO_ADD);
 467         return 1;
 468 }
 469
 470 #if DBRT_DEBUG
 471 static void show_stage_entry(FILE *o,
 472                              const char *label, const struct cache_entry *ce)
 473 {
 474         if (!ce)
 475                 fprintf(o, "%s (missing)\n", label);
 476         else
 477                 fprintf(o, "%s%06o %s %d\t%s\n",
 478                         label,
 479                         ntohl(ce->ce_mode),
 480                         sha1_to_hex(ce->sha1),
 481                         ce_stage(ce),
 482                         ce->name);
 483 }
 484 #endif
 485
 486 static int threeway_merge(struct cache_entry **stages)
 487 {
 488         struct cache_entry *index;
 489         struct cache_entry *head;
 490         struct cache_entry *remote = stages[head_idx + 1];
 491         int count;
 492         int head_match = 0;
 493         int remote_match = 0;
 494
 495         int df_conflict_head = 0;
 496         int df_conflict_remote = 0;
 497
 498         int any_anc_missing = 0;
 499         int no_anc_exists = 1;
 500         int i;
 501
 502         for (i = 1; i < head_idx; i++) {
 503                 if (!stages[i])
 504                         any_anc_missing = 1;
 505                 else
 506                         no_anc_exists = 0;
 507         }
 508
 509         index = stages[0];
 510         head = stages[head_idx];
 511
 512         if (head == &df_conflict_entry) {
 513                 df_conflict_head = 1;
 514                 head = NULL;
 515         }
 516
 517         if (remote == &df_conflict_entry) {
 518                 df_conflict_remote = 1;
 519                 remote = NULL;
 520         }
 521
 522         /* First, if there's a #16 situation, note that to prevent #13
 523          * and #14.
 524          */
 525         if (!same(remote, head)) {
 526                 for (i = 1; i < head_idx; i++) {
 527                         if (same(stages[i], head)) {
 528                                 head_match = i;
 529                         }
 530                         if (same(stages[i], remote)) {
 531                                 remote_match = i;
 532                         }
 533                 }
 534         }
 535
 536         /* We start with cases where the index is allowed to match
 537          * something other than the head: #14(ALT) and #2ALT, where it
 538          * is permitted to match the result instead.
 539          */
 540         /* #14, #14ALT, #2ALT */
 541         if (remote && !df_conflict_head && head_match && !remote_match) {
 542                 if (index && !same(index, remote) && !same(index, head))
 543                         reject_merge(index);
 544                 return merged_entry(remote, index);
 545         }
 546         /*
 547          * If we have an entry in the index cache, then we want to
 548          * make sure that it matches head.
 549          */
 550         if (index && !same(index, head)) {
 551                 reject_merge(index);
 552         }
 553
 554         if (head) {
 555                 /* #5ALT, #15 */
 556                 if (same(head, remote))
 557                         return merged_entry(head, index);
 558                 /* #13, #3ALT */
 559                 if (!df_conflict_remote && remote_match && !head_match)
 560                         return merged_entry(head, index);
 561         }
 562
 563         /* #1 */
 564         if (!head && !remote && any_anc_missing)
 565                 return 0;
 566
 567         /* Under the new "aggressive" rule, we resolve mostly trivial
 568          * cases that we historically had git-merge-one-file resolve.
 569          */
 570         if (aggressive) {
 571                 int head_deleted = !head && !df_conflict_head;
 572                 int remote_deleted = !remote && !df_conflict_remote;
 573                 /*
 574                  * Deleted in both.
 575                  * Deleted in one and unchanged in the other.
 576                  */
 577                 if ((head_deleted && remote_deleted) ||
 578                     (head_deleted && remote && remote_match) ||
 579                     (remote_deleted && head && head_match)) {
 580                         if (index)
 581                                 return deleted_entry(index, index);
 582                         return 0;
 583                 }
 584                 /*
 585                  * Added in both, identically.
 586                  */
 587                 if (no_anc_exists && head && remote && same(head, remote))
 588                         return merged_entry(head, index);
 589
 590         }
 591
 592         /* Below are "no merge" cases, which require that the index be
 593          * up-to-date to avoid the files getting overwritten with
 594          * conflict resolution files.
 595          */
 596         if (index) {
 597                 verify_uptodate(index);
 598         }
 599
 600         nontrivial_merge = 1;
 601
 602         /* #2, #3, #4, #6, #7, #9, #11. */
 603         count = 0;
 604         if (!head_match || !remote_match) {
 605                 for (i = 1; i < head_idx; i++) {
 606                         if (stages[i]) {
 607                                 keep_entry(stages[i]);
 608                                 count++;
 609                                 break;
 610                         }
 611                 }
 612         }
 613 #if DBRT_DEBUG
 614         else {
 615                 fprintf(stderr, "read-tree: warning #16 detected\n");
 616                 show_stage_entry(stderr, "head   ", stages[head_match]);
 617                 show_stage_entry(stderr, "remote ", stages[remote_match]);
 618         }
 619 #endif
 620         if (head) { count += keep_entry(head); }
 621         if (remote) { count += keep_entry(remote); }
 622         return count;
 623 }
 624
 625 /*
 626  * Two-way merge.
 627  *
 628  * The rule is to "carry forward" what is in the index without losing
 629  * information across a "fast forward", favoring a successful merge
 630  * over a merge failure when it makes sense.  For details of the
 631  * "carry forward" rule, please see <Documentation/git-read-tree.txt>.
 632  *
 633  */
 634 static int twoway_merge(struct cache_entry **src)
 635 {
 636         struct cache_entry *current = src[0];
 637         struct cache_entry *oldtree = src[1], *newtree = src[2];
 638
 639         if (merge_size != 2)
 640                 return error("Cannot do a twoway merge of %d trees",
 641                              merge_size);
 642
 643         if (current) {
 644                 if ((!oldtree && !newtree) || /* 4 and 5 */
 645                     (!oldtree && newtree &&
 646                      same(current, newtree)) || /* 6 and 7 */
 647                     (oldtree && newtree &&
 648                      same(oldtree, newtree)) || /* 14 and 15 */
 649                     (oldtree && newtree &&
 650                      !same(oldtree, newtree) && /* 18 and 19*/
 651                      same(current, newtree))) {
 652                         return keep_entry(current);
 653                 }
 654                 else if (oldtree && !newtree && same(current, oldtree)) {
 655                         /* 10 or 11 */
 656                         return deleted_entry(oldtree, current);
 657                 }
 658                 else if (oldtree && newtree &&
 659                          same(current, oldtree) && !same(current, newtree)) {
 660                         /* 20 or 21 */
 661                         return merged_entry(newtree, current);
 662                 }
 663                 else {
 664                         /* all other failures */
 665                         if (oldtree)
 666                                 reject_merge(oldtree);
 667                         if (current)
 668                                 reject_merge(current);
 669                         if (newtree)
 670                                 reject_merge(newtree);
 671                         return -1;
 672                 }
 673         }
 674         else if (newtree)
 675                 return merged_entry(newtree, current);
 676         else
 677                 return deleted_entry(oldtree, current);
 678 }
 679
 680 /*
 681  * One-way merge.
 682  *
 683  * The rule is:
 684  * - take the stat information from stage0, take the data from stage1
 685  */
 686 static int oneway_merge(struct cache_entry **src)
 687 {
 688         struct cache_entry *old = src[0];
 689         struct cache_entry *a = src[1];
 690
 691         if (merge_size != 1)
 692                 return error("Cannot do a oneway merge of %d trees",
 693                              merge_size);
 694
 695         if (!a) {
 696                 invalidate_ce_path(old);
 697                 return 0;
 698         }
 699         if (old && same(old, a)) {
 700                 return keep_entry(old);
 701         }
 702         return merged_entry(a, NULL);
 703 }
 704
 705 static int read_cache_unmerged(void)
 706 {
 707         int i, deleted;
 708         struct cache_entry **dst;
 709
 710         read_cache();
 711         dst = active_cache;
 712         deleted = 0;
 713         for (i = 0; i < active_nr; i++) {
 714                 struct cache_entry *ce = active_cache[i];
 715                 if (ce_stage(ce)) {
 716                         deleted++;
 717                         invalidate_ce_path(ce);
 718                         continue;
 719                 }
 720                 if (deleted)
 721                         *dst = ce;
 722                 dst++;
 723         }
 724         active_nr -= deleted;
 725         return deleted;
 726 }
 727
 728 static void prime_cache_tree_rec(struct cache_tree *it, struct tree *tree)
 729 {
 730         struct tree_entry_list *ent;
 731         int cnt;
 732
 733         memcpy(it->sha1, tree->object.sha1, 20);
 734         for (cnt = 0, ent = tree->entries; ent; ent = ent->next) {
 735                 if (!ent->directory)
 736                         cnt++;
 737                 else {
 738                         struct cache_tree_sub *sub;
 739                         struct tree *subtree = (struct tree *)ent->item.tree;
 740                         if (!subtree->object.parsed)
 741                                 parse_tree(subtree);
 742                         sub = cache_tree_sub(it, ent->name);
 743                         sub->cache_tree = cache_tree();
 744                         prime_cache_tree_rec(sub->cache_tree, subtree);
 745                         cnt += sub->cache_tree->entry_count;
 746                 }
 747         }
 748         it->entry_count = cnt;
 749 }
 750
 751 static void prime_cache_tree(void)
 752 {
 753         struct tree *tree = (struct tree *)trees->item;
 754         if (!tree)
 755                 return;
 756         active_cache_tree = cache_tree();
 757         prime_cache_tree_rec(active_cache_tree, tree);
 758
 759 }
 760
 761 static const char read_tree_usage[] = "git-read-tree (<sha> | -m [--aggressive] [-u | -i] <sha1> [<sha2> [<sha3>]])";
 762
 763 static struct cache_file cache_file;
 764
 765 int main(int argc, char **argv)
 766 {
 767         int i, newfd, reset, stage = 0;
 768         unsigned char sha1[20];
 769         merge_fn_t fn = NULL;
 770
 771         setup_git_directory();
 772         git_config(git_default_config);
 773
 774         newfd = hold_index_file_for_update(&cache_file, get_index_file());
 775         if (newfd < 0)
 776                 die("unable to create new cachefile");
 777
 778         git_config(git_default_config);
 779
 780         merge = 0;
 781         reset = 0;
 782         for (i = 1; i < argc; i++) {
 783                 const char *arg = argv[i];
 784
 785                 /* "-u" means "update", meaning that a merge will update
 786                  * the working tree.
 787                  */
 788                 if (!strcmp(arg, "-u")) {
 789                         update = 1;
 790                         continue;
 791                 }
 792
 793                 if (!strcmp(arg, "-v")) {
 794                         verbose_update = 1;
 795                         continue;
 796                 }
 797
 798                 /* "-i" means "index only", meaning that a merge will
 799                  * not even look at the working tree.
 800                  */
 801                 if (!strcmp(arg, "-i")) {
 802                         index_only = 1;
 803                         continue;
 804                 }
 805
 806                 /* This differs from "-m" in that we'll silently ignore unmerged entries */
 807                 if (!strcmp(arg, "--reset")) {
 808                         if (stage || merge)
 809                                 usage(read_tree_usage);
 810                         reset = 1;
 811                         merge = 1;
 812                         stage = 1;
 813                         read_cache_unmerged();
 814                         continue;
 815                 }
 816
 817                 if (!strcmp(arg, "--trivial")) {
 818                         trivial_merges_only = 1;
 819                         continue;
 820                 }
 821
 822                 if (!strcmp(arg, "--aggressive")) {
 823                         aggressive = 1;
 824                         continue;
 825                 }
 826
 827                 /* "-m" stands for "merge", meaning we start in stage 1 */
 828                 if (!strcmp(arg, "-m")) {
 829                         if (stage || merge)
 830                                 usage(read_tree_usage);
 831                         if (read_cache_unmerged())
 832                                 die("you need to resolve your current index first");
 833                         stage = 1;
 834                         merge = 1;
 835                         continue;
 836                 }
 837
 838                 /* using -u and -i at the same time makes no sense */
 839                 if (1 < index_only + update)
 840                         usage(read_tree_usage);
 841
 842                 if (get_sha1(arg, sha1) < 0)
 843                         usage(read_tree_usage);
 844                 if (list_tree(sha1) < 0)
 845                         die("failed to unpack tree object %s", arg);
 846                 stage++;
 847         }
 848         if ((update||index_only) && !merge)
 849                 usage(read_tree_usage);
 850
 851         if (merge) {
 852                 if (stage < 2)
 853                         die("just how do you expect me to merge %d trees?", stage-1);
 854                 switch (stage - 1) {
 855                 case 1:
 856                         fn = oneway_merge;
 857                         break;
 858                 case 2:
 859                         fn = twoway_merge;
 860                         break;
 861                 case 3:
 862                 default:
 863                         fn = threeway_merge;
 864                         cache_tree_free(&active_cache_tree);
 865                         break;
 866                 }
 867
 868                 if (stage - 1 >= 3)
 869                         head_idx = stage - 2;
 870                 else
 871                         head_idx = 1;
 872         }
 873
 874         unpack_trees(fn);
 875
 876         /*
 877          * When reading only one tree (either the most basic form,
 878          * "-m ent" or "--reset ent" form), we can obtain a fully
 879          * valid cache-tree because the index must match exactly
 880          * what came from the tree.
 881          */
 882         if (trees->item && (!merge || (stage == 2))) {
 883                 cache_tree_free(&active_cache_tree);
 884                 prime_cache_tree();
 885         }
 886
 887         if (write_cache(newfd, active_cache, active_nr) ||
 888             commit_index_file(&cache_file))
 889                 die("unable to write new index file");
 890         return 0;
 891 }