gitweb: Separate printing of git_tree row into git_print_tree_entry

diff --git a/merge-recursive.c b/merge-recursive.c
index d4de1adfe271c57ff40f60b4064de9ae35980599..39a1eae894398cd235a1dfb643c523823670f656 100644 (file)
--- a/merge-recursive.c
+++ b/merge-recursive.c
@@ -56,7 +56,7 @@ static int sha_eq(const unsigned char *a, const unsigned char *b)
 {
        if (!a && !b)
                return 2;
-       return a && b && memcmp(a, b, 20) == 0;
+       return a && b && hashcmp(a, b) == 0;
 }
 
 /*
@@ -125,9 +125,7 @@ static int flush_cache(void)
 {
        /* flush temporary index */
        struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
-       int fd = hold_lock_file_for_update(lock, current_index_file);
-       if (fd < 0)
-               die("could not lock %s", lock->filename);
+       int fd = hold_lock_file_for_update(lock, current_index_file, 1);
        if (write_cache(fd, active_cache, active_nr) ||
                        close(fd) || commit_lock_file(lock))
                die ("unable to write %s", current_index_file);
@@ -139,8 +137,10 @@ static int flush_cache(void)
 static void setup_index(int temp)
 {
        current_index_file = temp ? temporary_index_file: original_index_file;
-       if (cache_dirty)
-               die("fatal: cache changed flush_cache();");
+       if (cache_dirty) {
+               discard_cache();
+               cache_dirty = 0;
+       }
        unlink(temporary_index_file);
        discard_cache();
 }
@@ -158,7 +158,7 @@ static struct cache_entry *make_cache_entry(unsigned int mode,
        size = cache_entry_size(len);
        ce = xcalloc(1, size);
 
-       memcpy(ce->sha1, sha1, 20);
+       hashcpy(ce->sha1, sha1);
        memcpy(ce->name, path, len);
        ce->ce_flags = create_ce_flags(len, stage);
        ce->ce_mode = create_ce_mode(mode);
@@ -355,7 +355,7 @@ static struct path_list *get_unmerged(void)
                }
                e = item->util;
                e->stages[ce_stage(ce)].mode = ntohl(ce->ce_mode);
-               memcpy(e->stages[ce_stage(ce)].sha, ce->sha1, 20);
+               hashcpy(e->stages[ce_stage(ce)].sha, ce->sha1);
        }
 
        return unmerged;
@@ -636,10 +636,10 @@ static struct merge_file_info merge_file(struct diff_filespec *o,
                result.clean = 0;
                if (S_ISREG(a->mode)) {
                        result.mode = a->mode;
-                       memcpy(result.sha, a->sha1, 20);
+                       hashcpy(result.sha, a->sha1);
                } else {
                        result.mode = b->mode;
-                       memcpy(result.sha, b->sha1, 20);
+                       hashcpy(result.sha, b->sha1);
                }
        } else {
                if (!sha_eq(a->sha1, o->sha1) && !sha_eq(b->sha1, o->sha1))
@@ -648,9 +648,9 @@ static struct merge_file_info merge_file(struct diff_filespec *o,
                result.mode = a->mode == o->mode ? b->mode: a->mode;
 
                if (sha_eq(a->sha1, o->sha1))
-                       memcpy(result.sha, b->sha1, 20);
+                       hashcpy(result.sha, b->sha1);
                else if (sha_eq(b->sha1, o->sha1))
-                       memcpy(result.sha, a->sha1, 20);
+                       hashcpy(result.sha, a->sha1);
                else if (S_ISREG(a->mode)) {
                        int code = 1, fd;
                        struct stat st;
@@ -699,7 +699,7 @@ static struct merge_file_info merge_file(struct diff_filespec *o,
                        if (!(S_ISLNK(a->mode) || S_ISLNK(b->mode)))
                                die("cannot merge modes?");
 
-                       memcpy(result.sha, a->sha1, 20);
+                       hashcpy(result.sha, a->sha1);
 
                        if (!sha_eq(a->sha1, b->sha1))
                                result.clean = 0;
@@ -891,11 +891,9 @@ static int process_renames(struct path_list *a_renames,
 
                        remove_file(1, ren1_src);
 
-                       memcpy(src_other.sha1,
-                                       ren1->src_entry->stages[stage].sha, 20);
+                       hashcpy(src_other.sha1, ren1->src_entry->stages[stage].sha);
                        src_other.mode = ren1->src_entry->stages[stage].mode;
-                       memcpy(dst_other.sha1,
-                                       ren1->dst_entry->stages[stage].sha, 20);
+                       hashcpy(dst_other.sha1, ren1->dst_entry->stages[stage].sha);
                        dst_other.mode = ren1->dst_entry->stages[stage].mode;
 
                        try_merge = 0;
@@ -980,7 +978,7 @@ static int process_renames(struct path_list *a_renames,
 
 static unsigned char *has_sha(const unsigned char *sha)
 {
-       return memcmp(sha, null_sha1, 20) == 0 ? NULL: (unsigned char *)sha;
+       return is_null_sha1(sha) ? NULL: (unsigned char *)sha;
 }
 
 /* Per entry merge function */
@@ -1096,11 +1094,11 @@ static int process_entry(const char *path, struct stage_data *entry,
 
                output("Auto-merging %s", path);
                o.path = a.path = b.path = (char *)path;
-               memcpy(o.sha1, o_sha, 20);
+               hashcpy(o.sha1, o_sha);
                o.mode = o_mode;
-               memcpy(a.sha1, a_sha, 20);
+               hashcpy(a.sha1, a_sha);
                a.mode = a_mode;
-               memcpy(b.sha1, b_sha, 20);
+               hashcpy(b.sha1, b_sha);
                b.mode = b_mode;
 
                mfi = merge_file(&o, &a, &b,
@@ -1191,6 +1189,17 @@ static int merge_trees(struct tree *head,
        return clean;
 }
 
+static struct commit_list *reverse_commit_list(struct commit_list *list)
+{
+       struct commit_list *next = NULL, *current, *backup;
+       for (current = list; current; current = backup) {
+               backup = current->next;
+               current->next = next;
+               next = current;
+       }
+       return next;
+}
+
 /*
  * Merge the commits h1 and h2, return the resulting virtual
  * commit object and a flag indicating the cleaness of the merge.
@@ -1216,7 +1225,7 @@ int merge(struct commit *h1,
        if (ancestor)
                commit_list_insert(ancestor, &ca);
        else
-               ca = get_merge_bases(h1, h2, 1);
+               ca = reverse_commit_list(get_merge_bases(h1, h2, 1));
 
        output("found %u common ancestor(s):", commit_list_count(ca));
        for (iter = ca; iter; iter = iter->next)