Git 2.9
[git/git.git] / patch-ids.c
CommitLineData
5d23e133
JH
1#include "cache.h"
2#include "diff.h"
3#include "commit.h"
5289bae1 4#include "sha1-lookup.h"
5d23e133
JH
5#include "patch-ids.h"
6
ded2c097 7int commit_patch_id(struct commit *commit, struct diff_options *options,
5d23e133
JH
8 unsigned char *sha1)
9{
10 if (commit->parents)
ed1c9977 11 diff_tree_sha1(commit->parents->item->object.oid.hash,
12 commit->object.oid.hash, "", options);
5d23e133 13 else
ed1c9977 14 diff_root_tree_sha1(commit->object.oid.hash, "", options);
5d23e133
JH
15 diffcore_std(options);
16 return diff_flush_patch_id(options, sha1);
17}
18
5289bae1 19static const unsigned char *patch_id_access(size_t index, void *table)
5d23e133 20{
5289bae1
CC
21 struct patch_id **id_table = table;
22 return id_table[index]->patch_id;
5d23e133
JH
23}
24
5d23e133
JH
25static int patch_pos(struct patch_id **table, int nr, const unsigned char *id)
26{
5289bae1 27 return sha1_pos(id, table, nr, patch_id_access);
5d23e133
JH
28}
29
30#define BUCKET_SIZE 190 /* 190 * 21 = 3990, with slop close enough to 4K */
31struct patch_id_bucket {
32 struct patch_id_bucket *next;
33 int nr;
34 struct patch_id bucket[BUCKET_SIZE];
35};
36
37int init_patch_ids(struct patch_ids *ids)
38{
39 memset(ids, 0, sizeof(*ids));
40 diff_setup(&ids->diffopts);
8f67f8ae 41 DIFF_OPT_SET(&ids->diffopts, RECURSIVE);
28452655 42 diff_setup_done(&ids->diffopts);
5d23e133
JH
43 return 0;
44}
45
46int free_patch_ids(struct patch_ids *ids)
47{
48 struct patch_id_bucket *next, *patches;
49
50 free(ids->table);
51 for (patches = ids->patches; patches; patches = next) {
52 next = patches->next;
53 free(patches);
54 }
55 return 0;
56}
57
58static struct patch_id *add_commit(struct commit *commit,
59 struct patch_ids *ids,
60 int no_add)
61{
62 struct patch_id_bucket *bucket;
63 struct patch_id *ent;
64 unsigned char sha1[20];
65 int pos;
66
67 if (commit_patch_id(commit, &ids->diffopts, sha1))
68 return NULL;
69 pos = patch_pos(ids->table, ids->nr, sha1);
70 if (0 <= pos)
71 return ids->table[pos];
72 if (no_add)
73 return NULL;
74
75 pos = -1 - pos;
76
77 bucket = ids->patches;
78 if (!bucket || (BUCKET_SIZE <= bucket->nr)) {
79 bucket = xcalloc(1, sizeof(*bucket));
80 bucket->next = ids->patches;
81 ids->patches = bucket;
82 }
83 ent = &bucket->bucket[bucket->nr++];
84 hashcpy(ent->patch_id, sha1);
85
104fb26a 86 ALLOC_GROW(ids->table, ids->nr + 1, ids->alloc);
5d23e133
JH
87 if (pos < ids->nr)
88 memmove(ids->table + pos + 1, ids->table + pos,
89 sizeof(ent) * (ids->nr - pos));
90 ids->nr++;
91 ids->table[pos] = ent;
92 return ids->table[pos];
93}
94
95struct patch_id *has_commit_patch_id(struct commit *commit,
96 struct patch_ids *ids)
97{
98 return add_commit(commit, ids, 1);
99}
100
101struct patch_id *add_commit_patch_id(struct commit *commit,
102 struct patch_ids *ids)
103{
104 return add_commit(commit, ids, 0);
105}