blob: c1cc25cd95da66aec1c695f4bba9680f5cb834f6 [file] [log] [blame]
Jeff King902bb362011-05-19 17:34:33 -04001#include "cache.h"
2#include "sha1-array.h"
3#include "sha1-lookup.h"
4
5void sha1_array_append(struct sha1_array *array, const unsigned char *sha1)
6{
7 ALLOC_GROW(array->sha1, array->nr + 1, array->alloc);
8 hashcpy(array->sha1[array->nr++], sha1);
9 array->sorted = 0;
10}
11
12static int void_hashcmp(const void *a, const void *b)
13{
14 return hashcmp(a, b);
15}
16
Junio C Hamano69850be2012-09-15 22:39:43 -070017static void sha1_array_sort(struct sha1_array *array)
Jeff King902bb362011-05-19 17:34:33 -040018{
René Scharfe9ed0d8d2016-09-29 17:27:31 +020019 QSORT(array->sha1, array->nr, void_hashcmp);
Jeff King902bb362011-05-19 17:34:33 -040020 array->sorted = 1;
21}
22
23static const unsigned char *sha1_access(size_t index, void *table)
24{
25 unsigned char (*array)[20] = table;
26 return array[index];
27}
28
29int sha1_array_lookup(struct sha1_array *array, const unsigned char *sha1)
30{
31 if (!array->sorted)
32 sha1_array_sort(array);
33 return sha1_pos(sha1, array->sha1, array->nr, sha1_access);
34}
35
36void sha1_array_clear(struct sha1_array *array)
37{
38 free(array->sha1);
39 array->sha1 = NULL;
40 array->nr = 0;
41 array->alloc = 0;
42 array->sorted = 0;
43}
Jeff Kingcff38a52011-05-19 17:34:46 -040044
Jeff King16ddcd42016-09-26 08:00:29 -040045int sha1_array_for_each_unique(struct sha1_array *array,
Jeff Kingcff38a52011-05-19 17:34:46 -040046 for_each_sha1_fn fn,
47 void *data)
48{
49 int i;
50
51 if (!array->sorted)
52 sha1_array_sort(array);
53
54 for (i = 0; i < array->nr; i++) {
Jeff King16ddcd42016-09-26 08:00:29 -040055 int ret;
Jeff Kingcff38a52011-05-19 17:34:46 -040056 if (i > 0 && !hashcmp(array->sha1[i], array->sha1[i-1]))
57 continue;
Jeff King16ddcd42016-09-26 08:00:29 -040058 ret = fn(array->sha1[i], data);
59 if (ret)
60 return ret;
Jeff Kingcff38a52011-05-19 17:34:46 -040061 }
Jeff King16ddcd42016-09-26 08:00:29 -040062 return 0;
Jeff Kingcff38a52011-05-19 17:34:46 -040063}