]>
Commit | Line | Data |
---|---|---|
36bf1958 | 1 | #include "git-compat-util.h" |
fe299ec5 | 2 | #include "oid-array.h" |
bc626927 | 3 | #include "hash-lookup.h" |
902bb364 | 4 | |
910650d2 | 5 | void oid_array_append(struct oid_array *array, const struct object_id *oid) |
902bb364 | 6 | { |
ee3051bd | 7 | ALLOC_GROW(array->oid, array->nr + 1, array->alloc); |
98a72ddc | 8 | oidcpy(&array->oid[array->nr++], oid); |
d50cbe4a EB |
9 | if (!oid->algo) |
10 | oid_set_algo(&array->oid[array->nr - 1], the_hash_algo); | |
902bb364 JK |
11 | array->sorted = 0; |
12 | } | |
13 | ||
d50cbe4a | 14 | static int void_hashcmp(const void *va, const void *vb) |
902bb364 | 15 | { |
d50cbe4a EB |
16 | const struct object_id *a = va, *b = vb; |
17 | int ret; | |
18 | if (a->algo == b->algo) | |
19 | ret = oidcmp(a, b); | |
20 | else | |
21 | ret = a->algo > b->algo ? 1 : -1; | |
22 | return ret; | |
902bb364 JK |
23 | } |
24 | ||
d0482b44 | 25 | void oid_array_sort(struct oid_array *array) |
902bb364 | 26 | { |
d0482b44 JK |
27 | if (array->sorted) |
28 | return; | |
ee3051bd | 29 | QSORT(array->oid, array->nr, void_hashcmp); |
902bb364 JK |
30 | array->sorted = 1; |
31 | } | |
32 | ||
8380dcd7 | 33 | static const struct object_id *oid_access(size_t index, const void *table) |
902bb364 | 34 | { |
8380dcd7 | 35 | const struct object_id *array = table; |
45ee13b9 | 36 | return &array[index]; |
902bb364 JK |
37 | } |
38 | ||
910650d2 | 39 | int oid_array_lookup(struct oid_array *array, const struct object_id *oid) |
902bb364 | 40 | { |
d0482b44 | 41 | oid_array_sort(array); |
45ee13b9 | 42 | return oid_pos(oid, array->oid, array->nr, oid_access); |
902bb364 JK |
43 | } |
44 | ||
910650d2 | 45 | void oid_array_clear(struct oid_array *array) |
902bb364 | 46 | { |
6a83d902 | 47 | FREE_AND_NULL(array->oid); |
902bb364 JK |
48 | array->nr = 0; |
49 | array->alloc = 0; | |
50 | array->sorted = 0; | |
51 | } | |
cff38a5e | 52 | |
5cc044e0 ÆAB |
53 | |
54 | int oid_array_for_each(struct oid_array *array, | |
55 | for_each_oid_fn fn, | |
56 | void *data) | |
57 | { | |
eccce525 | 58 | size_t i; |
5cc044e0 | 59 | |
fe299ec5 | 60 | /* No oid_array_sort() here! See oid-array.h */ |
5cc044e0 ÆAB |
61 | |
62 | for (i = 0; i < array->nr; i++) { | |
63 | int ret = fn(array->oid + i, data); | |
64 | if (ret) | |
65 | return ret; | |
66 | } | |
67 | return 0; | |
68 | } | |
69 | ||
910650d2 | 70 | int oid_array_for_each_unique(struct oid_array *array, |
72486729 ÆAB |
71 | for_each_oid_fn fn, |
72 | void *data) | |
cff38a5e | 73 | { |
eccce525 | 74 | size_t i; |
cff38a5e | 75 | |
d0482b44 | 76 | oid_array_sort(array); |
cff38a5e | 77 | |
12c4b4ce JK |
78 | for (i = 0; i < array->nr; i = oid_array_next_unique(array, i)) { |
79 | int ret = fn(array->oid + i, data); | |
16ddcd40 JK |
80 | if (ret) |
81 | return ret; | |
cff38a5e | 82 | } |
16ddcd40 | 83 | return 0; |
cff38a5e | 84 | } |
161b1cf3 SB |
85 | |
86 | void oid_array_filter(struct oid_array *array, | |
87 | for_each_oid_fn want, | |
88 | void *cb_data) | |
89 | { | |
eccce525 | 90 | size_t nr = array->nr, src, dst; |
161b1cf3 SB |
91 | struct object_id *oids = array->oid; |
92 | ||
93 | for (src = dst = 0; src < nr; src++) { | |
94 | if (want(&oids[src], cb_data)) { | |
95 | if (src != dst) | |
96 | oidcpy(&oids[dst], &oids[src]); | |
97 | dst++; | |
98 | } | |
99 | } | |
100 | array->nr = dst; | |
101 | } |