1 /* crypto/txt_db/txt_db.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
69 char *TXT_DB_version
="TXT_DB part of SSLeay/OpenSSL 0.9.1c 23-Dec-1998";
71 TXT_DB
*TXT_DB_read(in
,num
)
85 if ((buf
=BUF_MEM_new()) == NULL
) goto err
;
86 if (!BUF_MEM_grow(buf
,size
)) goto err
;
88 if ((ret
=(TXT_DB
*)Malloc(sizeof(TXT_DB
))) == NULL
)
93 if ((ret
->data
=sk_new_null()) == NULL
)
95 if ((ret
->index
=(LHASH
**)Malloc(sizeof(LHASH
*)*num
)) == NULL
)
97 if ((ret
->qual
=(int (**)())Malloc(sizeof(int (**)())*num
)) == NULL
)
105 add
=(num
+1)*sizeof(char *);
106 buf
->data
[size
-1]='\0';
113 if (!BUF_MEM_grow(buf
,size
)) goto err
;
115 buf
->data
[offset
]='\0';
116 BIO_gets(in
,&(buf
->data
[offset
]),size
-offset
);
118 if (buf
->data
[offset
] == '\0') break;
119 if ((offset
== 0) && (buf
->data
[0] == '#')) continue;
120 i
=strlen(&(buf
->data
[offset
]));
122 if (buf
->data
[offset
-1] != '\n')
126 buf
->data
[offset
-1]='\0'; /* blat the '\n' */
127 p
=(char *)Malloc(add
+offset
);
140 if (*f
== '\0') break;
158 if ((n
!= num
) || (*f
!= '\0'))
160 #if !defined(NO_STDIO) && !defined(WIN16) /* temporaty fix :-( */
161 fprintf(stderr
,"wrong number of fields on line %ld\n",ln
);
167 if (!sk_push(ret
->data
,(char *)pp
))
169 #if !defined(NO_STDIO) && !defined(WIN16) /* temporaty fix :-( */
170 fprintf(stderr
,"failure in sk_push\n");
181 #if !defined(NO_STDIO) && !defined(WIN16)
182 if (er
== 1) fprintf(stderr
,"Malloc failure\n");
184 if (ret
->data
!= NULL
) sk_free(ret
->data
);
185 if (ret
->index
!= NULL
) Free(ret
->index
);
186 if (ret
->qual
!= NULL
) Free((char *)ret
->qual
);
187 if (ret
!= NULL
) Free(ret
);
194 char **TXT_DB_get_by_index(db
,idx
,value
)
202 if (idx
>= db
->num_fields
)
204 db
->error
=DB_ERROR_INDEX_OUT_OF_RANGE
;
210 db
->error
=DB_ERROR_NO_INDEX
;
213 ret
=(char **)lh_retrieve(lh
,(char *)value
);
214 db
->error
=DB_ERROR_OK
;
218 int TXT_DB_create_index(db
,field
,qual
,hash
,cmp
)
222 unsigned long (*hash
)();
229 if (field
>= db
->num_fields
)
231 db
->error
=DB_ERROR_INDEX_OUT_OF_RANGE
;
234 if ((idx
=lh_new(hash
,cmp
)) == NULL
)
236 db
->error
=DB_ERROR_MALLOC
;
242 r
=(char *)sk_value(db
->data
,i
);
243 if ((qual
!= NULL
) && (qual(r
) == 0)) continue;
244 if ((r
=lh_insert(idx
,r
)) != NULL
)
246 db
->error
=DB_ERROR_INDEX_CLASH
;
247 db
->arg1
=sk_find(db
->data
,r
);
253 if (db
->index
[field
] != NULL
) lh_free(db
->index
[field
]);
254 db
->index
[field
]=idx
;
255 db
->qual
[field
]=qual
;
259 long TXT_DB_write(out
,db
)
263 long i
,j
,n
,nn
,l
,tot
=0;
268 if ((buf
=BUF_MEM_new()) == NULL
)
274 pp
=(char **)sk_value(db
->data
,i
);
282 if (!BUF_MEM_grow(buf
,(int)(l
*2+nn
))) goto err
;
291 if (*f
== '\0') break;
292 if (*f
== '\t') *(p
++)='\\';
299 if (BIO_write(out
,buf
->data
,(int)j
) != j
)
305 if (buf
!= NULL
) BUF_MEM_free(buf
);
309 int TXT_DB_insert(db
,row
)
316 for (i
=0; i
<db
->num_fields
; i
++)
318 if (db
->index
[i
] != NULL
)
320 if ((db
->qual
[i
] != NULL
) &&
321 (db
->qual
[i
](row
) == 0)) continue;
322 r
=(char **)lh_retrieve(db
->index
[i
],(char *)row
);
325 db
->error
=DB_ERROR_INDEX_CLASH
;
332 /* We have passed the index checks, now just append and insert */
333 if (!sk_push(db
->data
,(char *)row
))
335 db
->error
=DB_ERROR_MALLOC
;
339 for (i
=0; i
<db
->num_fields
; i
++)
341 if (db
->index
[i
] != NULL
)
343 if ((db
->qual
[i
] != NULL
) &&
344 (db
->qual
[i
](row
) == 0)) continue;
345 lh_insert(db
->index
[i
],(char *)row
);
359 if (db
->index
!= NULL
)
361 for (i
=db
->num_fields
-1; i
>=0; i
--)
362 if (db
->index
[i
] != NULL
) lh_free(db
->index
[i
]);
365 if (db
->qual
!= NULL
)
367 if (db
->data
!= NULL
)
369 for (i
=sk_num(db
->data
)-1; i
>=0; i
--)
371 /* check if any 'fields' have been allocated
372 * from outside of the initial block */
373 p
=(char **)sk_value(db
->data
,i
);
374 max
=p
[db
->num_fields
]; /* last address */
375 if (max
== NULL
) /* new row */
377 for (n
=0; n
<db
->num_fields
; n
++)
378 if (p
[n
] != NULL
) Free(p
[n
]);
382 for (n
=0; n
<db
->num_fields
; n
++)
384 if (((p
[n
] < (char *)p
) || (p
[n
] > max
))
389 Free(sk_value(db
->data
,i
));