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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
/*
* keyarray.c - routines to maintain a sorted array of keyids.
*
* Copyright 2004 Jonathan McDowell <noodles@earth.li>
*
* This program is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the Free
* Software Foundation; version 2 of the License.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
* more details.
*
* You should have received a copy of the GNU General Public License along with
* this program; if not, write to the Free Software Foundation, Inc., 51
* Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "keyarray.h"
#include "keystructs.h"
int fingerprint_cmp(struct openpgp_fingerprint *a,
struct openpgp_fingerprint *b)
{
if (a->length < b->length) {
return -1;
} else if (a->length > b->length) {
return 1;
} else {
return memcmp(a->fp, b->fp, a->length);
}
}
bool array_find(struct keyarray *array, struct openpgp_fingerprint *fp)
{
bool found;
int top = 0;
int bottom = 0;
int curpos;
found = false;
if (array->keys != NULL && array->count > 0) {
bottom = -1;
top = array->count - 1;
while ((top - bottom) > 1) {
curpos = (top + bottom) / 2;
if (fingerprint_cmp(fp, &array->keys[curpos]) > 0) {
bottom = curpos;
} else {
top = curpos;
}
}
found = (fingerprint_cmp(fp, &array->keys[top]) == 0);
}
return found;
}
bool array_add(struct keyarray *array, struct openpgp_fingerprint *fp)
{
bool found;
int top = 0;
int bottom = 0;
int curpos = 0;
found = false;
if (array->size != 0 && array->count > 0) {
bottom = -1;
top = array->count - 1;
while ((top - bottom) > 1) {
curpos = (top + bottom) / 2;
if (fingerprint_cmp(fp, &array->keys[curpos]) > 0) {
bottom = curpos;
} else {
top = curpos;
}
}
found = (fingerprint_cmp(fp, &array->keys[top]) == 0);
if (fingerprint_cmp(fp, &array->keys[top]) > 0) {
curpos = top + 1;
} else {
curpos = top;
}
}
if (!found) {
if (array->size == 0) {
array->keys = malloc(16 *
sizeof(struct openpgp_fingerprint));
array->size = 16;
array->count = 1;
array->keys[0] = *fp;
} else {
if (array->count >= array->size) {
array->size *= 2;
array->keys = realloc(array->keys,
array->size *
sizeof(struct openpgp_fingerprint));
}
if (curpos < array->count) {
memmove(&array->keys[curpos+1],
&array->keys[curpos],
sizeof(struct openpgp_fingerprint) *
(array->count - curpos));
}
array->keys[curpos] = *fp;
array->count++;
}
}
return !found;
}
void array_free(struct keyarray *array)
{
if (array->keys) {
free(array->keys);
array->keys = NULL;
}
array->count = array->size = 0;
return;
}
|
