🌐 AI搜索 & 代理 主页
blob: 73ba76e9e9a223306a03c3d04123c0c4af4aeda2 [file] [log] [blame]
Jeff King902bb362011-05-19 21:34:331#include "cache.h"
Jeff Kingfe299ec2020-03-30 14:03:462#include "oid-array.h"
Martin Ågrenbc626922020-12-31 11:56:233#include "hash-lookup.h"
Jeff King902bb362011-05-19 21:34:334
brian m. carlson910650d2017-03-31 01:40:005void oid_array_append(struct oid_array *array, const struct object_id *oid)
Jeff King902bb362011-05-19 21:34:336{
brian m. carlsonee3051b2017-03-26 16:01:377 ALLOC_GROW(array->oid, array->nr + 1, array->alloc);
brian m. carlson98a72dd2017-03-31 01:39:568 oidcpy(&array->oid[array->nr++], oid);
Jeff King902bb362011-05-19 21:34:339 array->sorted = 0;
10}
11
12static int void_hashcmp(const void *a, const void *b)
13{
brian m. carlsonee3051b2017-03-26 16:01:3714 return oidcmp(a, b);
Jeff King902bb362011-05-19 21:34:3315}
16
Jeff Kingd0482b42020-12-04 18:52:0717void oid_array_sort(struct oid_array *array)
Jeff King902bb362011-05-19 21:34:3318{
Jeff Kingd0482b42020-12-04 18:52:0719 if (array->sorted)
20 return;
brian m. carlsonee3051b2017-03-26 16:01:3721 QSORT(array->oid, array->nr, void_hashcmp);
Jeff King902bb362011-05-19 21:34:3322 array->sorted = 1;
23}
24
Jeff King8380dcd2021-01-28 06:20:2325static const struct object_id *oid_access(size_t index, const void *table)
Jeff King902bb362011-05-19 21:34:3326{
Jeff King8380dcd2021-01-28 06:20:2327 const struct object_id *array = table;
Jeff King45ee13b2021-01-28 06:19:4228 return &array[index];
Jeff King902bb362011-05-19 21:34:3329}
30
brian m. carlson910650d2017-03-31 01:40:0031int oid_array_lookup(struct oid_array *array, const struct object_id *oid)
Jeff King902bb362011-05-19 21:34:3332{
Jeff Kingd0482b42020-12-04 18:52:0733 oid_array_sort(array);
Jeff King45ee13b2021-01-28 06:19:4234 return oid_pos(oid, array->oid, array->nr, oid_access);
Jeff King902bb362011-05-19 21:34:3335}
36
brian m. carlson910650d2017-03-31 01:40:0037void oid_array_clear(struct oid_array *array)
Jeff King902bb362011-05-19 21:34:3338{
Ævar Arnfjör�� Bjarmason6a83d902017-06-15 23:15:4639 FREE_AND_NULL(array->oid);
Jeff King902bb362011-05-19 21:34:3340 array->nr = 0;
41 array->alloc = 0;
42 array->sorted = 0;
43}
Jeff Kingcff38a52011-05-19 21:34:4644
Ævar Arnfjörð Bjarmason5cc044e2018-05-10 12:43:0245
46int oid_array_for_each(struct oid_array *array,
47 for_each_oid_fn fn,
48 void *data)
49{
Jeff Kingeccce522020-03-30 14:03:2050 size_t i;
Ævar Arnfjörð Bjarmason5cc044e2018-05-10 12:43:0251
Jeff Kingfe299ec2020-03-30 14:03:4652 /* No oid_array_sort() here! See oid-array.h */
Ævar Arnfjörð Bjarmason5cc044e2018-05-10 12:43:0253
54 for (i = 0; i < array->nr; i++) {
55 int ret = fn(array->oid + i, data);
56 if (ret)
57 return ret;
58 }
59 return 0;
60}
61
brian m. carlson910650d2017-03-31 01:40:0062int oid_array_for_each_unique(struct oid_array *array,
Ævar Arnfjörð Bjarmason72486722018-05-10 12:42:5963 for_each_oid_fn fn,
64 void *data)
Jeff Kingcff38a52011-05-19 21:34:4665{
Jeff Kingeccce522020-03-30 14:03:2066 size_t i;
Jeff Kingcff38a52011-05-19 21:34:4667
Jeff Kingd0482b42020-12-04 18:52:0768 oid_array_sort(array);
Jeff Kingcff38a52011-05-19 21:34:4669
Jeff King12c4b4c2020-12-07 19:11:0070 for (i = 0; i < array->nr; i = oid_array_next_unique(array, i)) {
71 int ret = fn(array->oid + i, data);
Jeff King16ddcd42016-09-26 12:00:2972 if (ret)
73 return ret;
Jeff Kingcff38a52011-05-19 21:34:4674 }
Jeff King16ddcd42016-09-26 12:00:2975 return 0;
Jeff Kingcff38a52011-05-19 21:34:4676}
Stefan Beller161b1cf2018-11-29 00:27:4877
78void oid_array_filter(struct oid_array *array,
79 for_each_oid_fn want,
80 void *cb_data)
81{
Jeff Kingeccce522020-03-30 14:03:2082 size_t nr = array->nr, src, dst;
Stefan Beller161b1cf2018-11-29 00:27:4883 struct object_id *oids = array->oid;
84
85 for (src = dst = 0; src < nr; src++) {
86 if (want(&oids[src], cb_data)) {
87 if (src != dst)
88 oidcpy(&oids[dst], &oids[src]);
89 dst++;
90 }
91 }
92 array->nr = dst;
93}