git@vger.kernel.org list mirror (unofficial, one of many)
 help / color / mirror / code / Atom feed
466937d73dfb0abc4bfddf2cfcd5c6a3a60af9e7 blob 1900 bytes (raw)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
 
#include "cache.h"
#include "sha1-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_contains_nondestructive(const struct oid_array* array,
	const struct object_id* oid)
{
	int i;
	if (array->sorted) {
		return sha1_pos(oid->hash, array->oid, array->nr, sha1_access) >= 0;
	}
	for (i = 0; i < array->nr; i++) {
		if (hashcmp(array->oid[i].hash, oid->hash) == 0) {
			return 1;
		}
	}
	return 0;
}

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)
{
	int i;

	/* No oid_array_sort() here! See the api-oid-array.txt docs! */

	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)
{
	int 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;
}
debug log:

solving 466937d73d ...
found 466937d73d in https://public-inbox.org/git/20190121223216.66659-2-sxenos@google.com/
found b94e0ec0f5 in https://80x24.org/mirrors/git.git
preparing index
index prepared:
100644 b94e0ec0f5e45fa56e1748bbb611a904ab81de67	sha1-array.c

applying [1/1] https://public-inbox.org/git/20190121223216.66659-2-sxenos@google.com/
diff --git a/sha1-array.c b/sha1-array.c
index b94e0ec0f5..466937d73d 100644

Checking patch sha1-array.c...
Applied patch sha1-array.c cleanly.

index at:
100644 466937d73dfb0abc4bfddf2cfcd5c6a3a60af9e7	sha1-array.c

Code repositories for project(s) associated with this inbox:

	https://80x24.org/mirrors/git.git

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).