http: refactor finish_http_pack_request()
[git.git] / oid-array.c
blob8657a5cedfa68cbc3711d4b288e514978ff5b6df
1 #include "cache.h"
2 #include "oid-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;
45 int oid_array_for_each(struct oid_array *array,
46 for_each_oid_fn fn,
47 void *data)
49 size_t i;
51 /* No oid_array_sort() here! See oid-array.h */
53 for (i = 0; i < array->nr; i++) {
54 int ret = fn(array->oid + i, data);
55 if (ret)
56 return ret;
58 return 0;
61 int oid_array_for_each_unique(struct oid_array *array,
62 for_each_oid_fn fn,
63 void *data)
65 size_t i;
67 if (!array->sorted)
68 oid_array_sort(array);
70 for (i = 0; i < array->nr; i++) {
71 int ret;
72 if (i > 0 && oideq(array->oid + i, array->oid + i - 1))
73 continue;
74 ret = fn(array->oid + i, data);
75 if (ret)
76 return ret;
78 return 0;
81 void oid_array_filter(struct oid_array *array,
82 for_each_oid_fn want,
83 void *cb_data)
85 size_t nr = array->nr, src, dst;
86 struct object_id *oids = array->oid;
88 for (src = dst = 0; src < nr; src++) {
89 if (want(&oids[src], cb_data)) {
90 if (src != dst)
91 oidcpy(&oids[dst], &oids[src]);
92 dst++;
95 array->nr = dst;