| 1 | #include "git-compat-util.h" |
| 2 | #include "diff.h" |
| 3 | #include "commit.h" |
| 4 | #include "hash.h" |
| 5 | #include "hex.h" |
| 6 | #include "patch-ids.h" |
| 7 | |
| 8 | static int patch_id_defined(struct commit *commit) |
| 9 | { |
| 10 | /* must be 0 or 1 parents */ |
| 11 | return !commit->parents || !commit->parents->next; |
| 12 | } |
| 13 | |
| 14 | int commit_patch_id(struct commit *commit, struct diff_options *options, |
| 15 | struct object_id *oid, int diff_header_only) |
| 16 | { |
| 17 | if (!patch_id_defined(commit)) |
| 18 | return -1; |
| 19 | |
| 20 | if (commit->parents) |
| 21 | diff_tree_oid(&commit->parents->item->object.oid, |
| 22 | &commit->object.oid, "", options); |
| 23 | else |
| 24 | diff_root_tree_oid(&commit->object.oid, "", options); |
| 25 | diffcore_std(options); |
| 26 | return diff_flush_patch_id(options, oid, diff_header_only); |
| 27 | } |
| 28 | |
| 29 | /* |
| 30 | * When we cannot load the full patch-id for both commits for whatever |
| 31 | * reason, the function returns -1 (i.e. return error(...)). Despite |
| 32 | * the "neq" in the name of this function, the caller only cares about |
| 33 | * the return value being zero (a and b are equivalent) or non-zero (a |
| 34 | * and b are different), and returning non-zero would keep both in the |
| 35 | * result, even if they actually were equivalent, in order to err on |
| 36 | * the side of safety. The actual value being negative does not have |
| 37 | * any significance; only that it is non-zero matters. |
| 38 | */ |
| 39 | static int patch_id_neq(const void *cmpfn_data, |
| 40 | const struct hashmap_entry *eptr, |
| 41 | const struct hashmap_entry *entry_or_key, |
| 42 | const void *keydata UNUSED) |
| 43 | { |
| 44 | /* |
| 45 | * We drop the 'const' modifier here intentionally. |
| 46 | * |
| 47 | * Even though eptr and entry_or_key are const, we want to |
| 48 | * lazily compute their .patch_id members; see b3dfeebb (rebase: |
| 49 | * avoid computing unnecessary patch IDs, 2016-07-29). So we cast |
| 50 | * the constness away with container_of(). |
| 51 | */ |
| 52 | struct diff_options *opt = (void *)cmpfn_data; |
| 53 | struct patch_id *a, *b; |
| 54 | |
| 55 | a = container_of(eptr, struct patch_id, ent); |
| 56 | b = container_of(entry_or_key, struct patch_id, ent); |
| 57 | |
| 58 | if (is_null_oid(&a->patch_id) && |
| 59 | commit_patch_id(a->commit, opt, &a->patch_id, 0)) |
| 60 | return error("Could not get patch ID for %s", |
| 61 | oid_to_hex(&a->commit->object.oid)); |
| 62 | if (is_null_oid(&b->patch_id) && |
| 63 | commit_patch_id(b->commit, opt, &b->patch_id, 0)) |
| 64 | return error("Could not get patch ID for %s", |
| 65 | oid_to_hex(&b->commit->object.oid)); |
| 66 | return !oideq(&a->patch_id, &b->patch_id); |
| 67 | } |
| 68 | |
| 69 | int init_patch_ids(struct repository *r, struct patch_ids *ids) |
| 70 | { |
| 71 | memset(ids, 0, sizeof(*ids)); |
| 72 | repo_diff_setup(r, &ids->diffopts); |
| 73 | ids->diffopts.detect_rename = 0; |
| 74 | ids->diffopts.flags.recursive = 1; |
| 75 | diff_setup_done(&ids->diffopts); |
| 76 | hashmap_init(&ids->patches, patch_id_neq, &ids->diffopts, 256); |
| 77 | return 0; |
| 78 | } |
| 79 | |
| 80 | int free_patch_ids(struct patch_ids *ids) |
| 81 | { |
| 82 | hashmap_clear_and_free(&ids->patches, struct patch_id, ent); |
| 83 | return 0; |
| 84 | } |
| 85 | |
| 86 | static int init_patch_id_entry(struct patch_id *patch, |
| 87 | struct commit *commit, |
| 88 | struct patch_ids *ids) |
| 89 | { |
| 90 | struct object_id header_only_patch_id; |
| 91 | |
| 92 | patch->commit = commit; |
| 93 | if (commit_patch_id(commit, &ids->diffopts, &header_only_patch_id, 1)) |
| 94 | return -1; |
| 95 | |
| 96 | hashmap_entry_init(&patch->ent, oidhash(&header_only_patch_id)); |
| 97 | return 0; |
| 98 | } |
| 99 | |
| 100 | struct patch_id *patch_id_iter_first(struct commit *commit, |
| 101 | struct patch_ids *ids) |
| 102 | { |
| 103 | struct patch_id patch; |
| 104 | |
| 105 | if (!patch_id_defined(commit)) |
| 106 | return NULL; |
| 107 | |
| 108 | memset(&patch, 0, sizeof(patch)); |
| 109 | if (init_patch_id_entry(&patch, commit, ids)) |
| 110 | return NULL; |
| 111 | |
| 112 | return hashmap_get_entry(&ids->patches, &patch, ent, NULL); |
| 113 | } |
| 114 | |
| 115 | struct patch_id *patch_id_iter_next(struct patch_id *cur, |
| 116 | struct patch_ids *ids) |
| 117 | { |
| 118 | return hashmap_get_next_entry(&ids->patches, cur, ent); |
| 119 | } |
| 120 | |
| 121 | int has_commit_patch_id(struct commit *commit, |
| 122 | struct patch_ids *ids) |
| 123 | { |
| 124 | return !!patch_id_iter_first(commit, ids); |
| 125 | } |
| 126 | |
| 127 | struct patch_id *add_commit_patch_id(struct commit *commit, |
| 128 | struct patch_ids *ids) |
| 129 | { |
| 130 | struct patch_id *key; |
| 131 | |
| 132 | if (!patch_id_defined(commit)) |
| 133 | return NULL; |
| 134 | |
| 135 | CALLOC_ARRAY(key, 1); |
| 136 | if (init_patch_id_entry(key, commit, ids)) { |
| 137 | free(key); |
| 138 | return NULL; |
| 139 | } |
| 140 | |
| 141 | hashmap_add(&ids->patches, &key->ent); |
| 142 | return key; |
| 143 | } |