Merge branch 'jl/submodule-status-failure-report'

* jl/submodule-status-failure-report:
  diff/status: print submodule path when looking for changes fails

diff --cc submodule.c
index 52cdcc6a6347a786deafad34efdb9dc4dc3670ff,8340b1956f904b40d24cf21dbe67451a42690436..68c1ba90b9e746b869830ec66a6f23437a4d7d08
--- 1/submodule.c
--- 2/submodule.c
+++ b/submodule.c
@@@ -687,199 -147,17 +687,199 @@@ unsigned is_submodule_modified(const ch
        cp.git_cmd = 1;
        cp.no_stdin = 1;
        cp.out = -1;
 +      cp.dir = path;
        if (start_command(&cp))
-               die("Could not run git status --porcelain");
+               die("Could not run 'git status --porcelain' in submodule %s", path);
  
        len = strbuf_read(&buf, cp.out, 1024);
 +      line = buf.buf;
 +      while (len > 2) {
 +              if ((line[0] == '?') && (line[1] == '?')) {
 +                      dirty_submodule |= DIRTY_SUBMODULE_UNTRACKED;
 +                      if (dirty_submodule & DIRTY_SUBMODULE_MODIFIED)
 +                              break;
 +              } else {
 +                      dirty_submodule |= DIRTY_SUBMODULE_MODIFIED;
 +                      if (ignore_untracked ||
 +                          (dirty_submodule & DIRTY_SUBMODULE_UNTRACKED))
 +                              break;
 +              }
 +              next_line = strchr(line, '\n');
 +              if (!next_line)
 +                      break;
 +              next_line++;
 +              len -= (next_line - line);
 +              line = next_line;
 +      }
        close(cp.out);
  
        if (finish_command(&cp))
-               die("git status --porcelain failed");
+               die("'git status --porcelain' failed in submodule %s", path);
  
 -      free(env[0]);
 -      free(env[1]);
        strbuf_release(&buf);
 -      return len != 0;
 +      return dirty_submodule;
 +}
 +
 +static int find_first_merges(struct object_array *result, const char *path,
 +              struct commit *a, struct commit *b)
 +{
 +      int i, j;
 +      struct object_array merges;
 +      struct commit *commit;
 +      int contains_another;
 +
 +      char merged_revision[42];
 +      const char *rev_args[] = { "rev-list", "--merges", "--ancestry-path",
 +                                 "--all", merged_revision, NULL };
 +      struct rev_info revs;
 +      struct setup_revision_opt rev_opts;
 +
 +      memset(&merges, 0, sizeof(merges));
 +      memset(result, 0, sizeof(struct object_array));
 +      memset(&rev_opts, 0, sizeof(rev_opts));
 +
 +      /* get all revisions that merge commit a */
 +      snprintf(merged_revision, sizeof(merged_revision), "^%s",
 +                      sha1_to_hex(a->object.sha1));
 +      init_revisions(&revs, NULL);
 +      rev_opts.submodule = path;
 +      setup_revisions(sizeof(rev_args)/sizeof(char *)-1, rev_args, &revs, &rev_opts);
 +
 +      /* save all revisions from the above list that contain b */
 +      if (prepare_revision_walk(&revs))
 +              die("revision walk setup failed");
 +      while ((commit = get_revision(&revs)) != NULL) {
 +              struct object *o = &(commit->object);
 +              if (in_merge_bases(b, &commit, 1))
 +                      add_object_array(o, NULL, &merges);
 +      }
 +
 +      /* Now we've got all merges that contain a and b. Prune all
 +       * merges that contain another found merge and save them in
 +       * result.
 +       */
 +      for (i = 0; i < merges.nr; i++) {
 +              struct commit *m1 = (struct commit *) merges.objects[i].item;
 +
 +              contains_another = 0;
 +              for (j = 0; j < merges.nr; j++) {
 +                      struct commit *m2 = (struct commit *) merges.objects[j].item;
 +                      if (i != j && in_merge_bases(m2, &m1, 1)) {
 +                              contains_another = 1;
 +                              break;
 +                      }
 +              }
 +
 +              if (!contains_another)
 +                      add_object_array(merges.objects[i].item,
 +                                       merges.objects[i].name, result);
 +      }
 +
 +      free(merges.objects);
 +      return result->nr;
 +}
 +
 +static void print_commit(struct commit *commit)
 +{
 +      struct strbuf sb = STRBUF_INIT;
 +      struct pretty_print_context ctx = {0};
 +      ctx.date_mode = DATE_NORMAL;
 +      format_commit_message(commit, " %h: %m %s", &sb, &ctx);
 +      fprintf(stderr, "%s\n", sb.buf);
 +      strbuf_release(&sb);
 +}
 +
 +#define MERGE_WARNING(path, msg) \
 +      warning("Failed to merge submodule %s (%s)", path, msg);
 +
 +int merge_submodule(unsigned char result[20], const char *path,
 +                  const unsigned char base[20], const unsigned char a[20],
 +                  const unsigned char b[20], int search)
 +{
 +      struct commit *commit_base, *commit_a, *commit_b;
 +      int parent_count;
 +      struct object_array merges;
 +
 +      int i;
 +
 +      /* store a in result in case we fail */
 +      hashcpy(result, a);
 +
 +      /* we can not handle deletion conflicts */
 +      if (is_null_sha1(base))
 +              return 0;
 +      if (is_null_sha1(a))
 +              return 0;
 +      if (is_null_sha1(b))
 +              return 0;
 +
 +      if (add_submodule_odb(path)) {
 +              MERGE_WARNING(path, "not checked out");
 +              return 0;
 +      }
 +
 +      if (!(commit_base = lookup_commit_reference(base)) ||
 +          !(commit_a = lookup_commit_reference(a)) ||
 +          !(commit_b = lookup_commit_reference(b))) {
 +              MERGE_WARNING(path, "commits not present");
 +              return 0;
 +      }
 +
 +      /* check whether both changes are forward */
 +      if (!in_merge_bases(commit_base, &commit_a, 1) ||
 +          !in_merge_bases(commit_base, &commit_b, 1)) {
 +              MERGE_WARNING(path, "commits don't follow merge-base");
 +              return 0;
 +      }
 +
 +      /* Case #1: a is contained in b or vice versa */
 +      if (in_merge_bases(commit_a, &commit_b, 1)) {
 +              hashcpy(result, b);
 +              return 1;
 +      }
 +      if (in_merge_bases(commit_b, &commit_a, 1)) {
 +              hashcpy(result, a);
 +              return 1;
 +      }
 +
 +      /*
 +       * Case #2: There are one or more merges that contain a and b in
 +       * the submodule. If there is only one, then present it as a
 +       * suggestion to the user, but leave it marked unmerged so the
 +       * user needs to confirm the resolution.
 +       */
 +
 +      /* Skip the search if makes no sense to the calling context.  */
 +      if (!search)
 +              return 0;
 +
 +      /* find commit which merges them */
 +      parent_count = find_first_merges(&merges, path, commit_a, commit_b);
 +      switch (parent_count) {
 +      case 0:
 +              MERGE_WARNING(path, "merge following commits not found");
 +              break;
 +
 +      case 1:
 +              MERGE_WARNING(path, "not fast-forward");
 +              fprintf(stderr, "Found a possible merge resolution "
 +                              "for the submodule:\n");
 +              print_commit((struct commit *) merges.objects[0].item);
 +              fprintf(stderr,
 +                      "If this is correct simply add it to the index "
 +                      "for example\n"
 +                      "by using:\n\n"
 +                      "  git update-index --cacheinfo 160000 %s \"%s\"\n\n"
 +                      "which will accept this suggestion.\n",
 +                      sha1_to_hex(merges.objects[0].item->sha1), path);
 +              break;
 +
 +      default:
 +              MERGE_WARNING(path, "multiple merges found");
 +              for (i = 0; i < merges.nr; i++)
 +                      print_commit((struct commit *) merges.objects[i].item);
 +      }
 +
 +      free(merges.objects);
 +      return 0;
  }