txt_db.c revision 296465
1/* crypto/txt_db/txt_db.c */
2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
8 *
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).
15 *
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.
22 *
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 :-).
37 * 4. If you include any Windows specific code (or a derivative thereof) from
38 *    the apps directory (application code) you must include an acknowledgement:
39 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40 *
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.
52 *
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"
63#include <openssl/buffer.h>
64#include <openssl/txt_db.h>
65
66#undef BUFSIZE
67#define BUFSIZE 512
68
69const char TXT_DB_version[] = "TXT_DB" OPENSSL_VERSION_PTEXT;
70
71TXT_DB *TXT_DB_read(BIO *in, int num)
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, **pp, *f;
81    BUF_MEM *buf = NULL;
82
83    if ((buf = BUF_MEM_new()) == NULL)
84        goto err;
85    if (!BUF_MEM_grow(buf, size))
86        goto err;
87
88    if ((ret = (TXT_DB *)OPENSSL_malloc(sizeof(TXT_DB))) == NULL)
89        goto err;
90    ret->num_fields = num;
91    ret->index = NULL;
92    ret->qual = NULL;
93    if ((ret->data = sk_new_null()) == NULL)
94        goto err;
95    if ((ret->index =
96         (LHASH **)OPENSSL_malloc(sizeof(LHASH *) * num)) == NULL)
97        goto err;
98    if ((ret->qual =
99         (int (**)(char **))OPENSSL_malloc(sizeof(int (**)(char **)) *
100                                           num)) == NULL)
101        goto err;
102    for (i = 0; i < num; i++) {
103        ret->index[i] = NULL;
104        ret->qual[i] = NULL;
105    }
106
107    add = (num + 1) * sizeof(char *);
108    buf->data[size - 1] = '\0';
109    offset = 0;
110    for (;;) {
111        if (offset != 0) {
112            size += BUFSIZE;
113            if (!BUF_MEM_grow_clean(buf, size))
114                goto err;
115        }
116        buf->data[offset] = '\0';
117        BIO_gets(in, &(buf->data[offset]), size - offset);
118        ln++;
119        if (buf->data[offset] == '\0')
120            break;
121        if ((offset == 0) && (buf->data[0] == '#'))
122            continue;
123        i = strlen(&(buf->data[offset]));
124        offset += i;
125        if (buf->data[offset - 1] != '\n')
126            continue;
127        else {
128            buf->data[offset - 1] = '\0'; /* blat the '\n' */
129            if (!(p = (char *)OPENSSL_malloc(add + offset)))
130                goto err;
131            offset = 0;
132        }
133        pp = (char **)p;
134        p += add;
135        n = 0;
136        pp[n++] = p;
137        i = 0;
138        f = buf->data;
139
140        esc = 0;
141        for (;;) {
142            if (*f == '\0')
143                break;
144            if (*f == '\t') {
145                if (esc)
146                    p--;
147                else {
148                    *(p++) = '\0';
149                    f++;
150                    if (n >= num)
151                        break;
152                    pp[n++] = p;
153                    continue;
154                }
155            }
156            esc = (*f == '\\');
157            *(p++) = *(f++);
158        }
159        *(p++) = '\0';
160        if ((n != num) || (*f != '\0')) {
161#if !defined(OPENSSL_NO_STDIO) && !defined(OPENSSL_SYS_WIN16) /* temporaty
162                                                               * fix :-( */
163            fprintf(stderr,
164                    "wrong number of fields on line %ld (looking for field %d, got %d, '%s' left)\n",
165                    ln, num, n, f);
166#endif
167            er = 2;
168            goto err;
169        }
170        pp[n] = p;
171        if (!sk_push(ret->data, (char *)pp)) {
172#if !defined(OPENSSL_NO_STDIO) && !defined(OPENSSL_SYS_WIN16) /* temporaty
173                                                               * fix :-( */
174            fprintf(stderr, "failure in sk_push\n");
175#endif
176            er = 2;
177            goto err;
178        }
179    }
180    er = 0;
181 err:
182    BUF_MEM_free(buf);
183    if (er) {
184#if !defined(OPENSSL_NO_STDIO) && !defined(OPENSSL_SYS_WIN16)
185        if (er == 1)
186            fprintf(stderr, "OPENSSL_malloc failure\n");
187#endif
188        if (ret != NULL) {
189            if (ret->data != NULL)
190                sk_free(ret->data);
191            if (ret->index != NULL)
192                OPENSSL_free(ret->index);
193            if (ret->qual != NULL)
194                OPENSSL_free(ret->qual);
195            if (ret != NULL)
196                OPENSSL_free(ret);
197        }
198        return (NULL);
199    } else
200        return (ret);
201}
202
203char **TXT_DB_get_by_index(TXT_DB *db, int idx, char **value)
204{
205    char **ret;
206    LHASH *lh;
207
208    if (idx >= db->num_fields) {
209        db->error = DB_ERROR_INDEX_OUT_OF_RANGE;
210        return (NULL);
211    }
212    lh = db->index[idx];
213    if (lh == NULL) {
214        db->error = DB_ERROR_NO_INDEX;
215        return (NULL);
216    }
217    ret = (char **)lh_retrieve(lh, value);
218    db->error = DB_ERROR_OK;
219    return (ret);
220}
221
222int TXT_DB_create_index(TXT_DB *db, int field, int (*qual) (char **),
223                        LHASH_HASH_FN_TYPE hash, LHASH_COMP_FN_TYPE cmp)
224{
225    LHASH *idx;
226    char **r;
227    int i, n;
228
229    if (field >= db->num_fields) {
230        db->error = DB_ERROR_INDEX_OUT_OF_RANGE;
231        return (0);
232    }
233    if ((idx = lh_new(hash, cmp)) == NULL) {
234        db->error = DB_ERROR_MALLOC;
235        return (0);
236    }
237    n = sk_num(db->data);
238    for (i = 0; i < n; i++) {
239        r = (char **)sk_value(db->data, i);
240        if ((qual != NULL) && (qual(r) == 0))
241            continue;
242        if ((r = lh_insert(idx, r)) != NULL) {
243            db->error = DB_ERROR_INDEX_CLASH;
244            db->arg1 = sk_find(db->data, (char *)r);
245            db->arg2 = i;
246            lh_free(idx);
247            return (0);
248        }
249    }
250    if (db->index[field] != NULL)
251        lh_free(db->index[field]);
252    db->index[field] = idx;
253    db->qual[field] = qual;
254    return (1);
255}
256
257long TXT_DB_write(BIO *out, TXT_DB *db)
258{
259    long i, j, n, nn, l, tot = 0;
260    char *p, **pp, *f;
261    BUF_MEM *buf = NULL;
262    long ret = -1;
263
264    if ((buf = BUF_MEM_new()) == NULL)
265        goto err;
266    n = sk_num(db->data);
267    nn = db->num_fields;
268    for (i = 0; i < n; i++) {
269        pp = (char **)sk_value(db->data, i);
270
271        l = 0;
272        for (j = 0; j < nn; j++) {
273            if (pp[j] != NULL)
274                l += strlen(pp[j]);
275        }
276        if (!BUF_MEM_grow_clean(buf, (int)(l * 2 + nn)))
277            goto err;
278
279        p = buf->data;
280        for (j = 0; j < nn; j++) {
281            f = pp[j];
282            if (f != NULL)
283                for (;;) {
284                    if (*f == '\0')
285                        break;
286                    if (*f == '\t')
287                        *(p++) = '\\';
288                    *(p++) = *(f++);
289                }
290            *(p++) = '\t';
291        }
292        p[-1] = '\n';
293        j = p - buf->data;
294        if (BIO_write(out, buf->data, (int)j) != j)
295            goto err;
296        tot += j;
297    }
298    ret = tot;
299 err:
300    if (buf != NULL)
301        BUF_MEM_free(buf);
302    return (ret);
303}
304
305int TXT_DB_insert(TXT_DB *db, char **row)
306{
307    int i;
308    char **r;
309
310    for (i = 0; i < db->num_fields; i++) {
311        if (db->index[i] != NULL) {
312            if ((db->qual[i] != NULL) && (db->qual[i] (row) == 0))
313                continue;
314            r = (char **)lh_retrieve(db->index[i], row);
315            if (r != NULL) {
316                db->error = DB_ERROR_INDEX_CLASH;
317                db->arg1 = i;
318                db->arg_row = r;
319                goto err;
320            }
321        }
322    }
323    /* We have passed the index checks, now just append and insert */
324    if (!sk_push(db->data, (char *)row)) {
325        db->error = DB_ERROR_MALLOC;
326        goto err;
327    }
328
329    for (i = 0; i < db->num_fields; i++) {
330        if (db->index[i] != NULL) {
331            if ((db->qual[i] != NULL) && (db->qual[i] (row) == 0))
332                continue;
333            lh_insert(db->index[i], row);
334        }
335    }
336    return (1);
337 err:
338    return (0);
339}
340
341void TXT_DB_free(TXT_DB *db)
342{
343    int i, n;
344    char **p, *max;
345
346    if (db == NULL)
347        return;
348
349    if (db->index != NULL) {
350        for (i = db->num_fields - 1; i >= 0; i--)
351            if (db->index[i] != NULL)
352                lh_free(db->index[i]);
353        OPENSSL_free(db->index);
354    }
355    if (db->qual != NULL)
356        OPENSSL_free(db->qual);
357    if (db->data != NULL) {
358        for (i = sk_num(db->data) - 1; i >= 0; i--) {
359            /*
360             * check if any 'fields' have been allocated from outside of the
361             * initial block
362             */
363            p = (char **)sk_value(db->data, i);
364            max = p[db->num_fields]; /* last address */
365            if (max == NULL) {  /* new row */
366                for (n = 0; n < db->num_fields; n++)
367                    if (p[n] != NULL)
368                        OPENSSL_free(p[n]);
369            } else {
370                for (n = 0; n < db->num_fields; n++) {
371                    if (((p[n] < (char *)p) || (p[n] > max))
372                        && (p[n] != NULL))
373                        OPENSSL_free(p[n]);
374                }
375            }
376            OPENSSL_free(sk_value(db->data, i));
377        }
378        sk_free(db->data);
379    }
380    OPENSSL_free(db);
381}
382