summaryrefslogtreecommitdiff
path: root/oid-array.c
diff options
context:
space:
mode:
authorJeff King <peff@peff.net>2020-03-30 14:03:46 (GMT)
committerJunio C Hamano <gitster@pobox.com>2020-03-30 17:59:08 (GMT)
commitfe299ec5ae7b419990bbc3efd4e6bfa3f0773b45 (patch)
treecabe7f75d348ca4dac662a909d736ac53a94f4fa /oid-array.c
parenteccce5253b9bfb17238f7d94c9ccf1cfd935eeb2 (diff)
downloadgit-fe299ec5ae7b419990bbc3efd4e6bfa3f0773b45.zip
git-fe299ec5ae7b419990bbc3efd4e6bfa3f0773b45.tar.gz
git-fe299ec5ae7b419990bbc3efd4e6bfa3f0773b45.tar.bz2
oid_array: rename source file from sha1-array
We renamed the actual data structure in 910650d2f8 (Rename sha1_array to oid_array, 2017-03-31), but the file is still called sha1-array. Besides being slightly confusing, it makes it more annoying to grep for leftover occurrences of "sha1" in various files, because the header is included in so many places. Let's complete the transition by renaming the source and header files (and fixing up a few comment references). I kept the "-" in the name, as that seems to be our style; cf. fc1395f4a4 (sha1_file.c: rename to use dash in file name, 2018-04-10). We also have oidmap.h and oidset.h without any punctuation, but those are "struct oidmap" and "struct oidset" in the code. We _could_ make this "oidarray" to match, but somehow it looks uglier to me because of the length of "array" (plus it would be a very invasive patch for little gain). Signed-off-by: Jeff King <peff@peff.net> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'oid-array.c')
-rw-r--r--oid-array.c96
1 files changed, 96 insertions, 0 deletions
diff --git a/oid-array.c b/oid-array.c
new file mode 100644
index 0000000..8657a5c
--- /dev/null
+++ b/oid-array.c
@@ -0,0 +1,96 @@
+#include "cache.h"
+#include "oid-array.h"
+#include "sha1-lookup.h"
+
+void oid_array_append(struct oid_array *array, const struct object_id *oid)
+{
+ ALLOC_GROW(array->oid, array->nr + 1, array->alloc);
+ oidcpy(&array->oid[array->nr++], oid);
+ array->sorted = 0;
+}
+
+static int void_hashcmp(const void *a, const void *b)
+{
+ return oidcmp(a, b);
+}
+
+static void oid_array_sort(struct oid_array *array)
+{
+ QSORT(array->oid, array->nr, void_hashcmp);
+ array->sorted = 1;
+}
+
+static const unsigned char *sha1_access(size_t index, void *table)
+{
+ struct object_id *array = table;
+ return array[index].hash;
+}
+
+int oid_array_lookup(struct oid_array *array, const struct object_id *oid)
+{
+ if (!array->sorted)
+ oid_array_sort(array);
+ return sha1_pos(oid->hash, array->oid, array->nr, sha1_access);
+}
+
+void oid_array_clear(struct oid_array *array)
+{
+ FREE_AND_NULL(array->oid);
+ array->nr = 0;
+ array->alloc = 0;
+ array->sorted = 0;
+}
+
+
+int oid_array_for_each(struct oid_array *array,
+ for_each_oid_fn fn,
+ void *data)
+{
+ size_t i;
+
+ /* No oid_array_sort() here! See oid-array.h */
+
+ for (i = 0; i < array->nr; i++) {
+ int ret = fn(array->oid + i, data);
+ if (ret)
+ return ret;
+ }
+ return 0;
+}
+
+int oid_array_for_each_unique(struct oid_array *array,
+ for_each_oid_fn fn,
+ void *data)
+{
+ size_t i;
+
+ if (!array->sorted)
+ oid_array_sort(array);
+
+ for (i = 0; i < array->nr; i++) {
+ int ret;
+ if (i > 0 && oideq(array->oid + i, array->oid + i - 1))
+ continue;
+ ret = fn(array->oid + i, data);
+ if (ret)
+ return ret;
+ }
+ return 0;
+}
+
+void oid_array_filter(struct oid_array *array,
+ for_each_oid_fn want,
+ void *cb_data)
+{
+ size_t nr = array->nr, src, dst;
+ struct object_id *oids = array->oid;
+
+ for (src = dst = 0; src < nr; src++) {
+ if (want(&oids[src], cb_data)) {
+ if (src != dst)
+ oidcpy(&oids[dst], &oids[src]);
+ dst++;
+ }
+ }
+ array->nr = dst;
+}