Merge tag 'v2.14.1'
[git/raj.git] / sha1-array.c
blob838b3bf8478cfdfcd78f866e69dc0f8c5cbf3c9e
1 #include "cache.h"
2 #include "sha1-array.h"
3 #include "sha1-lookup.h"
5 void oid_array_append(struct oid_array *array, const struct object_id *oid)
7 ALLOC_GROW(array->oid, array->nr + 1, array->alloc);
8 oidcpy(&array->oid[array->nr++], oid);
9 array->sorted = 0;
12 static int void_hashcmp(const void *a, const void *b)
14 return oidcmp(a, b);
17 static void oid_array_sort(struct oid_array *array)
19 QSORT(array->oid, array->nr, void_hashcmp);
20 array->sorted = 1;
23 static const unsigned char *sha1_access(size_t index, void *table)
25 struct object_id *array = table;
26 return array[index].hash;
29 int oid_array_lookup(struct oid_array *array, const struct object_id *oid)
31 if (!array->sorted)
32 oid_array_sort(array);
33 return sha1_pos(oid->hash, array->oid, array->nr, sha1_access);
36 void oid_array_clear(struct oid_array *array)
38 FREE_AND_NULL(array->oid);
39 array->nr = 0;
40 array->alloc = 0;
41 array->sorted = 0;
44 int oid_array_for_each_unique(struct oid_array *array,
45 for_each_oid_fn fn,
46 void *data)
48 int i;
50 if (!array->sorted)
51 oid_array_sort(array);
53 for (i = 0; i < array->nr; i++) {
54 int ret;
55 if (i > 0 && !oidcmp(array->oid + i, array->oid + i - 1))
56 continue;
57 ret = fn(array->oid + i, data);
58 if (ret)
59 return ret;
61 return 0;