]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* crypto/txt_db/txt_db.c */ |
58964a49 | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
3 | * All rights reserved. |
4 | * | |
5 | * This package is an SSL implementation written | |
6 | * by Eric Young (eay@cryptsoft.com). | |
7 | * The implementation was written so as to conform with Netscapes SSL. | |
0f113f3e | 8 | * |
d02b48c6 RE |
9 | * This library is free for commercial and non-commercial use as long as |
10 | * the following conditions are aheared to. The following conditions | |
11 | * apply to all code found in this distribution, be it the RC4, RSA, | |
12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
13 | * included with this distribution is covered by the same copyright terms | |
14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
0f113f3e | 15 | * |
d02b48c6 RE |
16 | * Copyright remains Eric Young's, and as such any Copyright notices in |
17 | * the code are not to be removed. | |
18 | * If this package is used in a product, Eric Young should be given attribution | |
19 | * as the author of the parts of the library used. | |
20 | * This can be in the form of a textual message at program startup or | |
21 | * in documentation (online or textual) provided with the package. | |
0f113f3e | 22 | * |
d02b48c6 RE |
23 | * Redistribution and use in source and binary forms, with or without |
24 | * modification, are permitted provided that the following conditions | |
25 | * are met: | |
26 | * 1. Redistributions of source code must retain the copyright | |
27 | * notice, this list of conditions and the following disclaimer. | |
28 | * 2. Redistributions in binary form must reproduce the above copyright | |
29 | * notice, this list of conditions and the following disclaimer in the | |
30 | * documentation and/or other materials provided with the distribution. | |
31 | * 3. All advertising materials mentioning features or use of this software | |
32 | * must display the following acknowledgement: | |
33 | * "This product includes cryptographic software written by | |
34 | * Eric Young (eay@cryptsoft.com)" | |
35 | * The word 'cryptographic' can be left out if the rouines from the library | |
36 | * being used are not cryptographic related :-). | |
0f113f3e | 37 | * 4. If you include any Windows specific code (or a derivative thereof) from |
d02b48c6 RE |
38 | * the apps directory (application code) you must include an acknowledgement: |
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
0f113f3e | 40 | * |
d02b48c6 RE |
41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND |
42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
51 | * SUCH DAMAGE. | |
0f113f3e | 52 | * |
d02b48c6 RE |
53 | * The licence and distribution terms for any publically available version or |
54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
55 | * copied and put under another distribution licence | |
56 | * [including the GNU Public Licence.] | |
57 | */ | |
58 | ||
59 | #include <stdio.h> | |
60 | #include <stdlib.h> | |
61 | #include <string.h> | |
62 | #include "cryptlib.h" | |
ec577822 BM |
63 | #include <openssl/buffer.h> |
64 | #include <openssl/txt_db.h> | |
d02b48c6 RE |
65 | |
66 | #undef BUFSIZE | |
0f113f3e | 67 | #define BUFSIZE 512 |
d02b48c6 | 68 | |
0f113f3e | 69 | const char TXT_DB_version[] = "TXT_DB" OPENSSL_VERSION_PTEXT; |
d02b48c6 | 70 | |
6b691a5c | 71 | TXT_DB *TXT_DB_read(BIO *in, int num) |
0f113f3e MC |
72 | { |
73 | TXT_DB *ret = NULL; | |
74 | int er = 1; | |
75 | int esc = 0; | |
76 | long ln = 0; | |
77 | int i, add, n; | |
78 | int size = BUFSIZE; | |
79 | int offset = 0; | |
80 | char *p, *f; | |
81 | OPENSSL_STRING *pp; | |
82 | BUF_MEM *buf = NULL; | |
d02b48c6 | 83 | |
0f113f3e MC |
84 | if ((buf = BUF_MEM_new()) == NULL) |
85 | goto err; | |
86 | if (!BUF_MEM_grow(buf, size)) | |
87 | goto err; | |
d02b48c6 | 88 | |
0f113f3e MC |
89 | if ((ret = OPENSSL_malloc(sizeof(TXT_DB))) == NULL) |
90 | goto err; | |
91 | ret->num_fields = num; | |
92 | ret->index = NULL; | |
93 | ret->qual = NULL; | |
94 | if ((ret->data = sk_OPENSSL_PSTRING_new_null()) == NULL) | |
95 | goto err; | |
96 | if ((ret->index = OPENSSL_malloc(sizeof(*ret->index) * num)) == NULL) | |
97 | goto err; | |
98 | if ((ret->qual = OPENSSL_malloc(sizeof(*(ret->qual)) * num)) == NULL) | |
99 | goto err; | |
100 | for (i = 0; i < num; i++) { | |
101 | ret->index[i] = NULL; | |
102 | ret->qual[i] = NULL; | |
103 | } | |
d02b48c6 | 104 | |
0f113f3e MC |
105 | add = (num + 1) * sizeof(char *); |
106 | buf->data[size - 1] = '\0'; | |
107 | offset = 0; | |
108 | for (;;) { | |
109 | if (offset != 0) { | |
110 | size += BUFSIZE; | |
111 | if (!BUF_MEM_grow_clean(buf, size)) | |
112 | goto err; | |
113 | } | |
114 | buf->data[offset] = '\0'; | |
115 | BIO_gets(in, &(buf->data[offset]), size - offset); | |
116 | ln++; | |
117 | if (buf->data[offset] == '\0') | |
118 | break; | |
119 | if ((offset == 0) && (buf->data[0] == '#')) | |
120 | continue; | |
121 | i = strlen(&(buf->data[offset])); | |
122 | offset += i; | |
123 | if (buf->data[offset - 1] != '\n') | |
124 | continue; | |
125 | else { | |
126 | buf->data[offset - 1] = '\0'; /* blat the '\n' */ | |
127 | if (!(p = OPENSSL_malloc(add + offset))) | |
128 | goto err; | |
129 | offset = 0; | |
130 | } | |
131 | pp = (char **)p; | |
132 | p += add; | |
133 | n = 0; | |
134 | pp[n++] = p; | |
135 | i = 0; | |
136 | f = buf->data; | |
d02b48c6 | 137 | |
0f113f3e MC |
138 | esc = 0; |
139 | for (;;) { | |
140 | if (*f == '\0') | |
141 | break; | |
142 | if (*f == '\t') { | |
143 | if (esc) | |
144 | p--; | |
145 | else { | |
146 | *(p++) = '\0'; | |
147 | f++; | |
148 | if (n >= num) | |
149 | break; | |
150 | pp[n++] = p; | |
151 | continue; | |
152 | } | |
153 | } | |
154 | esc = (*f == '\\'); | |
155 | *(p++) = *(f++); | |
156 | } | |
157 | *(p++) = '\0'; | |
158 | if ((n != num) || (*f != '\0')) { | |
159 | #if !defined(OPENSSL_NO_STDIO) /* temporary fix :-( */ | |
160 | fprintf(stderr, | |
161 | "wrong number of fields on line %ld (looking for field %d, got %d, '%s' left)\n", | |
162 | ln, num, n, f); | |
d02b48c6 | 163 | #endif |
0f113f3e MC |
164 | er = 2; |
165 | goto err; | |
166 | } | |
167 | pp[n] = p; | |
168 | if (!sk_OPENSSL_PSTRING_push(ret->data, pp)) { | |
169 | #if !defined(OPENSSL_NO_STDIO) /* temporary fix :-( */ | |
170 | fprintf(stderr, "failure in sk_push\n"); | |
d02b48c6 | 171 | #endif |
0f113f3e MC |
172 | er = 2; |
173 | goto err; | |
174 | } | |
175 | } | |
176 | er = 0; | |
177 | err: | |
178 | BUF_MEM_free(buf); | |
179 | if (er) { | |
6d23cf97 | 180 | #if !defined(OPENSSL_NO_STDIO) |
0f113f3e MC |
181 | if (er == 1) |
182 | fprintf(stderr, "OPENSSL_malloc failure\n"); | |
d02b48c6 | 183 | #endif |
0f113f3e MC |
184 | if (ret != NULL) { |
185 | if (ret->data != NULL) | |
186 | sk_OPENSSL_PSTRING_free(ret->data); | |
187 | if (ret->index != NULL) | |
188 | OPENSSL_free(ret->index); | |
189 | if (ret->qual != NULL) | |
190 | OPENSSL_free(ret->qual); | |
191 | if (ret != NULL) | |
192 | OPENSSL_free(ret); | |
193 | } | |
194 | return (NULL); | |
195 | } else | |
196 | return (ret); | |
197 | } | |
d02b48c6 | 198 | |
0f113f3e MC |
199 | OPENSSL_STRING *TXT_DB_get_by_index(TXT_DB *db, int idx, |
200 | OPENSSL_STRING *value) | |
201 | { | |
202 | OPENSSL_STRING *ret; | |
203 | LHASH_OF(OPENSSL_STRING) *lh; | |
d02b48c6 | 204 | |
0f113f3e MC |
205 | if (idx >= db->num_fields) { |
206 | db->error = DB_ERROR_INDEX_OUT_OF_RANGE; | |
207 | return (NULL); | |
208 | } | |
209 | lh = db->index[idx]; | |
210 | if (lh == NULL) { | |
211 | db->error = DB_ERROR_NO_INDEX; | |
212 | return (NULL); | |
213 | } | |
214 | ret = lh_OPENSSL_STRING_retrieve(lh, value); | |
215 | db->error = DB_ERROR_OK; | |
216 | return (ret); | |
217 | } | |
d02b48c6 | 218 | |
0f113f3e MC |
219 | int TXT_DB_create_index(TXT_DB *db, int field, int (*qual) (OPENSSL_STRING *), |
220 | LHASH_HASH_FN_TYPE hash, LHASH_COMP_FN_TYPE cmp) | |
221 | { | |
222 | LHASH_OF(OPENSSL_STRING) *idx; | |
223 | OPENSSL_STRING *r; | |
224 | int i, n; | |
d02b48c6 | 225 | |
0f113f3e MC |
226 | if (field >= db->num_fields) { |
227 | db->error = DB_ERROR_INDEX_OUT_OF_RANGE; | |
228 | return (0); | |
229 | } | |
230 | /* FIXME: we lose type checking at this point */ | |
231 | if ((idx = (LHASH_OF(OPENSSL_STRING) *)lh_new(hash, cmp)) == NULL) { | |
232 | db->error = DB_ERROR_MALLOC; | |
233 | return (0); | |
234 | } | |
235 | n = sk_OPENSSL_PSTRING_num(db->data); | |
236 | for (i = 0; i < n; i++) { | |
237 | r = sk_OPENSSL_PSTRING_value(db->data, i); | |
238 | if ((qual != NULL) && (qual(r) == 0)) | |
239 | continue; | |
240 | if ((r = lh_OPENSSL_STRING_insert(idx, r)) != NULL) { | |
241 | db->error = DB_ERROR_INDEX_CLASH; | |
242 | db->arg1 = sk_OPENSSL_PSTRING_find(db->data, r); | |
243 | db->arg2 = i; | |
244 | lh_OPENSSL_STRING_free(idx); | |
245 | return (0); | |
246 | } | |
247 | } | |
248 | if (db->index[field] != NULL) | |
249 | lh_OPENSSL_STRING_free(db->index[field]); | |
250 | db->index[field] = idx; | |
251 | db->qual[field] = qual; | |
252 | return (1); | |
253 | } | |
d02b48c6 | 254 | |
6b691a5c | 255 | long TXT_DB_write(BIO *out, TXT_DB *db) |
0f113f3e MC |
256 | { |
257 | long i, j, n, nn, l, tot = 0; | |
258 | char *p, **pp, *f; | |
259 | BUF_MEM *buf = NULL; | |
260 | long ret = -1; | |
d02b48c6 | 261 | |
0f113f3e MC |
262 | if ((buf = BUF_MEM_new()) == NULL) |
263 | goto err; | |
264 | n = sk_OPENSSL_PSTRING_num(db->data); | |
265 | nn = db->num_fields; | |
266 | for (i = 0; i < n; i++) { | |
267 | pp = sk_OPENSSL_PSTRING_value(db->data, i); | |
d02b48c6 | 268 | |
0f113f3e MC |
269 | l = 0; |
270 | for (j = 0; j < nn; j++) { | |
271 | if (pp[j] != NULL) | |
272 | l += strlen(pp[j]); | |
273 | } | |
274 | if (!BUF_MEM_grow_clean(buf, (int)(l * 2 + nn))) | |
275 | goto err; | |
d02b48c6 | 276 | |
0f113f3e MC |
277 | p = buf->data; |
278 | for (j = 0; j < nn; j++) { | |
279 | f = pp[j]; | |
280 | if (f != NULL) | |
281 | for (;;) { | |
282 | if (*f == '\0') | |
283 | break; | |
284 | if (*f == '\t') | |
285 | *(p++) = '\\'; | |
286 | *(p++) = *(f++); | |
287 | } | |
288 | *(p++) = '\t'; | |
289 | } | |
290 | p[-1] = '\n'; | |
291 | j = p - buf->data; | |
292 | if (BIO_write(out, buf->data, (int)j) != j) | |
293 | goto err; | |
294 | tot += j; | |
295 | } | |
296 | ret = tot; | |
297 | err: | |
298 | if (buf != NULL) | |
299 | BUF_MEM_free(buf); | |
300 | return (ret); | |
301 | } | |
d02b48c6 | 302 | |
c869da88 | 303 | int TXT_DB_insert(TXT_DB *db, OPENSSL_STRING *row) |
0f113f3e MC |
304 | { |
305 | int i; | |
306 | OPENSSL_STRING *r; | |
d02b48c6 | 307 | |
0f113f3e MC |
308 | for (i = 0; i < db->num_fields; i++) { |
309 | if (db->index[i] != NULL) { | |
310 | if ((db->qual[i] != NULL) && (db->qual[i] (row) == 0)) | |
311 | continue; | |
312 | r = lh_OPENSSL_STRING_retrieve(db->index[i], row); | |
313 | if (r != NULL) { | |
314 | db->error = DB_ERROR_INDEX_CLASH; | |
315 | db->arg1 = i; | |
316 | db->arg_row = r; | |
317 | goto err; | |
318 | } | |
319 | } | |
320 | } | |
321 | /* We have passed the index checks, now just append and insert */ | |
322 | if (!sk_OPENSSL_PSTRING_push(db->data, row)) { | |
323 | db->error = DB_ERROR_MALLOC; | |
324 | goto err; | |
325 | } | |
d02b48c6 | 326 | |
0f113f3e MC |
327 | for (i = 0; i < db->num_fields; i++) { |
328 | if (db->index[i] != NULL) { | |
329 | if ((db->qual[i] != NULL) && (db->qual[i] (row) == 0)) | |
330 | continue; | |
331 | (void)lh_OPENSSL_STRING_insert(db->index[i], row); | |
332 | } | |
333 | } | |
334 | return (1); | |
335 | err: | |
336 | return (0); | |
337 | } | |
d02b48c6 | 338 | |
6b691a5c | 339 | void TXT_DB_free(TXT_DB *db) |
0f113f3e MC |
340 | { |
341 | int i, n; | |
342 | char **p, *max; | |
d02b48c6 | 343 | |
0f113f3e MC |
344 | if (db == NULL) |
345 | return; | |
e03ddfae | 346 | |
0f113f3e MC |
347 | if (db->index != NULL) { |
348 | for (i = db->num_fields - 1; i >= 0; i--) | |
349 | if (db->index[i] != NULL) | |
350 | lh_OPENSSL_STRING_free(db->index[i]); | |
351 | OPENSSL_free(db->index); | |
352 | } | |
353 | if (db->qual != NULL) | |
354 | OPENSSL_free(db->qual); | |
355 | if (db->data != NULL) { | |
356 | for (i = sk_OPENSSL_PSTRING_num(db->data) - 1; i >= 0; i--) { | |
357 | /* | |
358 | * check if any 'fields' have been allocated from outside of the | |
359 | * initial block | |
360 | */ | |
361 | p = sk_OPENSSL_PSTRING_value(db->data, i); | |
362 | max = p[db->num_fields]; /* last address */ | |
363 | if (max == NULL) { /* new row */ | |
364 | for (n = 0; n < db->num_fields; n++) | |
365 | if (p[n] != NULL) | |
366 | OPENSSL_free(p[n]); | |
367 | } else { | |
368 | for (n = 0; n < db->num_fields; n++) { | |
369 | if (((p[n] < (char *)p) || (p[n] > max)) | |
370 | && (p[n] != NULL)) | |
371 | OPENSSL_free(p[n]); | |
372 | } | |
373 | } | |
374 | OPENSSL_free(sk_OPENSSL_PSTRING_value(db->data, i)); | |
375 | } | |
376 | sk_OPENSSL_PSTRING_free(db->data); | |
377 | } | |
378 | OPENSSL_free(db); | |
379 | } |