Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	lib/libcrypto/txt_db/txt_db.c	Lines:	131	174	75.3 %
Date:	2017-11-13	Branches:	87	134	64.9 %


/* $OpenBSD: txt_db.c,v 1.18 2014/07/11 08:44:49 jsing Exp $ */
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young (eay@cryptsoft.com).
 * The implementation was written so as to conform with Netscapes SSL.
 *
 * This library is free for commercial and non-commercial use as long as
 * the following conditions are aheared to.  The following conditions
 * apply to all code found in this distribution, be it the RC4, RSA,
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 * included with this distribution is covered by the same copyright terms
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
 *
 * Copyright remains Eric Young's, and as such any Copyright notices in
 * the code are not to be removed.
 * If this package is used in a product, Eric Young should be given attribution
 * as the author of the parts of the library used.
 * This can be in the form of a textual message at program startup or
 * in documentation (online or textual) provided with the package.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    "This product includes cryptographic software written by
 *     Eric Young (eay@cryptsoft.com)"
 *    The word 'cryptographic' can be left out if the rouines from the library
 *    being used are not cryptographic related :-).
 * 4. If you include any Windows specific code (or a derivative thereof) from
 *    the apps directory (application code) you must include an acknowledgement:
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
 *
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 * The licence and distribution terms for any publically available version or
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
 * copied and put under another distribution licence
 * [including the GNU Public Licence.]
 */

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include <openssl/buffer.h>
#include <openssl/txt_db.h>

#undef BUFSIZE
#define BUFSIZE	512

TXT_DB *
TXT_DB_read(BIO *in, int num)
{
	TXT_DB *ret = NULL;
	int er = 1;
	int esc = 0;
	long ln = 0;
	int i, add, n;
	int size = BUFSIZE;
	int offset = 0;
	char *p, *f;
	OPENSSL_STRING *pp;
	BUF_MEM *buf = NULL;

	if ((buf = BUF_MEM_new()) == NULL)
		goto err;
	if (!BUF_MEM_grow(buf, size))
		goto err;

	if ((ret = malloc(sizeof(TXT_DB))) == NULL)
		goto err;
	ret->num_fields = num;
	ret->index = NULL;
	ret->qual = NULL;
	if ((ret->data = sk_OPENSSL_PSTRING_new_null()) == NULL)
		goto err;
	if ((ret->index = reallocarray(NULL, num, sizeof(*ret->index))) == NULL)
		goto err;
	if ((ret->qual = reallocarray(NULL, num, sizeof(*(ret->qual)))) == NULL)
		goto err;
	for (i = 0; i < num; i++) {
		ret->index[i] = NULL;
		ret->qual[i] = NULL;
	}

	add = (num + 1)*sizeof(char *);
	buf->data[size-1] = '\0';
	offset = 0;
	for (;;) {
		if (offset != 0) {
			size += BUFSIZE;
			if (!BUF_MEM_grow_clean(buf, size))
				goto err;
		}
		buf->data[offset] = '\0';
		BIO_gets(in, &(buf->data[offset]), size - offset);
		ln++;
		if (buf->data[offset] == '\0')
			break;
		if ((offset == 0) && (buf->data[0] == '#'))
			continue;
		i = strlen(&(buf->data[offset]));
		offset += i;
		if (buf->data[offset-1] != '\n')
			continue;
		else {
			buf->data[offset-1] = '\0'; /* blat the '\n' */
			if (!(p = malloc(add + offset)))
				goto err;
			offset = 0;
		}
		pp = (char **)p;
		p += add;
		n = 0;
		pp[n++] = p;
		i = 0;
		f = buf->data;

		esc = 0;
		for (;;) {
			if (*f == '\0')
				break;
			if (*f == '\t') {
				if (esc)
					p--;
				else {
					*(p++)='\0';
					f++;
					if (n >= num)
						break;
					pp[n++] = p;
					continue;
				}
			}
			esc=(*f == '\\');
			*(p++)= *(f++);
		}
		*(p++)='\0';
		if ((n != num) || (*f != '\0')) {
			fprintf(stderr, "wrong number of fields on line %ld (looking for field %d, got %d, '%s' left)\n",ln,num,n,f);
			er = 2;
			goto err;
		}
		pp[n] = p;
		if (!sk_OPENSSL_PSTRING_push(ret->data, pp)) {
			fprintf(stderr, "failure in sk_push\n");
			er = 2;
			goto err;
		}
	}
	er = 0;

err:
	BUF_MEM_free(buf);
	if (er) {
		if (er == 1)
			fprintf(stderr, "malloc failure\n");
		if (ret != NULL) {
			if (ret->data != NULL)
				sk_OPENSSL_PSTRING_free(ret->data);
			free(ret->index);
			free(ret->qual);
			free(ret);
		}
		return (NULL);
	} else
		return (ret);
}

OPENSSL_STRING *
TXT_DB_get_by_index(TXT_DB *db, int idx, OPENSSL_STRING *value)
{
	OPENSSL_STRING *ret;
	LHASH_OF(OPENSSL_STRING) *lh;

	if (idx >= db->num_fields) {
		db->error = DB_ERROR_INDEX_OUT_OF_RANGE;
		return (NULL);
	}
	lh = db->index[idx];
	if (lh == NULL) {
		db->error = DB_ERROR_NO_INDEX;
		return (NULL);
	}
	ret = lh_OPENSSL_STRING_retrieve(lh, value);
	db->error = DB_ERROR_OK;
	return (ret);
}

int
TXT_DB_create_index(TXT_DB *db, int field, int (*qual)(OPENSSL_STRING *),
    LHASH_HASH_FN_TYPE hash, LHASH_COMP_FN_TYPE cmp)
{
	LHASH_OF(OPENSSL_STRING) *idx;
	OPENSSL_STRING *r;
	int i, n;

	if (field >= db->num_fields) {
		db->error = DB_ERROR_INDEX_OUT_OF_RANGE;
		return (0);
	}
	/* FIXME: we lose type checking at this point */
	if ((idx = (LHASH_OF(OPENSSL_STRING) *)lh_new(hash, cmp)) == NULL) {
		db->error = DB_ERROR_MALLOC;
		return (0);
	}
	n = sk_OPENSSL_PSTRING_num(db->data);
	for (i = 0; i < n; i++) {
		r = sk_OPENSSL_PSTRING_value(db->data, i);
		if ((qual != NULL) && (qual(r) == 0))
			continue;
		if ((r = lh_OPENSSL_STRING_insert(idx, r)) != NULL) {
			db->error = DB_ERROR_INDEX_CLASH;
			db->arg1 = sk_OPENSSL_PSTRING_find(db->data, r);
			db->arg2 = i;
			lh_OPENSSL_STRING_free(idx);
			return (0);
		}
	}
	if (db->index[field] != NULL)
		lh_OPENSSL_STRING_free(db->index[field]);
	db->index[field] = idx;
	db->qual[field] = qual;
	return (1);
}

long
TXT_DB_write(BIO *out, TXT_DB *db)
{
	long i, j,n, nn, l, tot = 0;
	char *p, **pp, *f;
	BUF_MEM *buf = NULL;
	long ret = -1;

	if ((buf = BUF_MEM_new()) == NULL)
		goto err;
	n = sk_OPENSSL_PSTRING_num(db->data);
	nn = db->num_fields;
	for (i = 0; i < n; i++) {
		pp = sk_OPENSSL_PSTRING_value(db->data, i);

		l = 0;
		for (j = 0; j < nn; j++) {
			if (pp[j] != NULL)
				l += strlen(pp[j]);
		}
		if (!BUF_MEM_grow_clean(buf, (int)(l*2 + nn)))
			goto err;

		p = buf->data;
		for (j = 0; j < nn; j++) {
			f = pp[j];
			if (f != NULL)
				for (;;) {
					if (*f == '\0')
						break;
					if (*f == '\t')
						*(p++) = '\\';
					*(p++) = *(f++);
				}
			*(p++) = '\t';
		}
		p[-1] = '\n';
		j = p - buf->data;
		if (BIO_write(out, buf->data, (int)j) != j)
			goto err;
		tot += j;
	}
	ret = tot;

err:
	if (buf != NULL)
		BUF_MEM_free(buf);
	return (ret);
}

int
TXT_DB_insert(TXT_DB *db, OPENSSL_STRING *row)
{
	int i;
	OPENSSL_STRING *r;

	for (i = 0; i < db->num_fields; i++) {
		if (db->index[i] != NULL) {
			if ((db->qual[i] != NULL) && (db->qual[i](row) == 0))
				continue;
			r = lh_OPENSSL_STRING_retrieve(db->index[i], row);
			if (r != NULL) {
				db->error = DB_ERROR_INDEX_CLASH;
				db->arg1 = i;
				db->arg_row = r;
				goto err;
			}
		}
	}
	/* We have passed the index checks, now just append and insert */
	if (!sk_OPENSSL_PSTRING_push(db->data, row)) {
		db->error = DB_ERROR_MALLOC;
		goto err;
	}

	for (i = 0; i < db->num_fields; i++) {
		if (db->index[i] != NULL) {
			if ((db->qual[i] != NULL) && (db->qual[i](row) == 0))
				continue;
			(void)lh_OPENSSL_STRING_insert(db->index[i], row);
		}
	}
	return (1);

err:
	return (0);
}

void
TXT_DB_free(TXT_DB *db)
{
	int i, n;
	char **p, *max;

	if (db == NULL)
		return;

	if (db->index != NULL) {
		for (i = db->num_fields - 1; i >= 0; i--)
			if (db->index[i] != NULL)
				lh_OPENSSL_STRING_free(db->index[i]);
		free(db->index);
	}
	free(db->qual);
	if (db->data != NULL) {
		for (i = sk_OPENSSL_PSTRING_num(db->data) - 1; i >= 0; i--) {
			/* check if any 'fields' have been allocated
			 * from outside of the initial block */
			p = sk_OPENSSL_PSTRING_value(db->data, i);
			max = p[db->num_fields]; /* last address */
			if (max == NULL) /* new row */
			{
				for (n = 0; n < db->num_fields; n++)
					free(p[n]);
			} else {
				for (n = 0; n < db->num_fields; n++) {
					if (((p[n] < (char *)p) ||
					    (p[n] > max)) &&
					    (p[n] != NULL))
						free(p[n]);
				}
			}
			free(sk_OPENSSL_PSTRING_value(db->data, i));
		}
		sk_OPENSSL_PSTRING_free(db->data);
	}
	free(db);
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: txt_db.c,v 1.18 2014/07/11 08:44:49 jsing Exp $ */
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
63			#include <openssl/buffer.h>
64			#include <openssl/txt_db.h>
65
66			#undef BUFSIZE
67			#define BUFSIZE 512
68
69			TXT_DB *
70			TXT_DB_read(BIO *in, int num)
71			{
72			TXT_DB *ret = NULL;
73			int er = 1;
74			int esc = 0;
75			long ln = 0;
76			int i, add, n;
77			int size = BUFSIZE;
78			int offset = 0;
79			char p, f;
80			OPENSSL_STRING *pp;
81			BUF_MEM *buf = NULL;
82
83	✓✗	32	if ((buf = BUF_MEM_new()) == NULL)
84			goto err;
85	✓✗	16	if (!BUF_MEM_grow(buf, size))
86			goto err;
87
88	✓✗	16	if ((ret = malloc(sizeof(TXT_DB))) == NULL)
89			goto err;
90		16	ret->num_fields = num;
91		16	ret->index = NULL;
92		16	ret->qual = NULL;
93	✓✗	16	if ((ret->data = sk_OPENSSL_PSTRING_new_null()) == NULL)
94			goto err;
95	✓✗	16	if ((ret->index = reallocarray(NULL, num, sizeof(*ret->index))) == NULL)
96			goto err;
97	✓✗	16	if ((ret->qual = reallocarray(NULL, num, sizeof(*(ret->qual)))) == NULL)
98			goto err;
99	✓✓	224	for (i = 0; i < num; i++) {
100		96	ret->index[i] = NULL;
101		96	ret->qual[i] = NULL;
102			}
103
104		16	add = (num + 1)sizeof(char );
105		16	buf->data[size-1] = '\0';
106			offset = 0;
107		70	for (;;) {
108	✗✓	70	if (offset != 0) {
109			size += BUFSIZE;
110			if (!BUF_MEM_grow_clean(buf, size))
111			goto err;
112			}
113		70	buf->data[offset] = '\0';
114		70	BIO_gets(in, &(buf->data[offset]), size - offset);
115		70	ln++;
116	✓✓	70	if (buf->data[offset] == '\0')
117			break;
118	✓✗✗✓	108	if ((offset == 0) && (buf->data[0] == '#'))
119			continue;
120		54	i = strlen(&(buf->data[offset]));
121		54	offset += i;
122	✗✓	54	if (buf->data[offset-1] != '\n')
123			continue;
124			else {
125		54	buf->data[offset-1] = '\0'; /* blat the '\n' */
126	✓✗	54	if (!(p = malloc(add + offset)))
127			goto err;
128			offset = 0;
129			}
130		54	pp = (char **)p;
131		54	p += add;
132			n = 0;
133		54	pp[n++] = p;
134			i = 0;
135		54	f = buf->data;
136
137			esc = 0;
138		4810	for (;;) {
139	✓✓	5080	if (*f == '\0')
140			break;
141	✓✓	5026	if (*f == '\t') {
142	✗✓	270	if (esc)
143			p--;
144			else {
145		270	*(p++)='\0';
146		270	f++;
147	✓✗	270	if (n >= num)
148			break;
149		270	pp[n++] = p;
150		270	continue;
151			}
152			}
153		4756	esc=(*f == '\\');
154		4756	(p++)= (f++);
155			}
156		54	*(p++)='\0';
157	✓✗✗✓	108	if ((n != num) \|\| (*f != '\0')) {
158			fprintf(stderr, "wrong number of fields on line %ld (looking for field %d, got %d, '%s' left)\n",ln,num,n,f);
159			er = 2;
160			goto err;
161			}
162		54	pp[n] = p;
163	✗✓	54	if (!sk_OPENSSL_PSTRING_push(ret->data, pp)) {
164			fprintf(stderr, "failure in sk_push\n");
165			er = 2;
166			goto err;
167			}
168			}
169		16	er = 0;
170
171			err:
172		16	BUF_MEM_free(buf);
173	✗✓	16	if (er) {
174			if (er == 1)
175			fprintf(stderr, "malloc failure\n");
176			if (ret != NULL) {
177			if (ret->data != NULL)
178			sk_OPENSSL_PSTRING_free(ret->data);
179			free(ret->index);
180			free(ret->qual);
181			free(ret);
182			}
183			return (NULL);
184			} else
185		16	return (ret);
186		16	}
187
188			OPENSSL_STRING *
189			TXT_DB_get_by_index(TXT_DB db, int idx, OPENSSL_STRING value)
190			{
191			OPENSSL_STRING *ret;
192			LHASH_OF(OPENSSL_STRING) *lh;
193
194	✗✓	64	if (idx >= db->num_fields) {
195			db->error = DB_ERROR_INDEX_OUT_OF_RANGE;
196			return (NULL);
197			}
198		32	lh = db->index[idx];
199	✗✓	32	if (lh == NULL) {
200			db->error = DB_ERROR_NO_INDEX;
201			return (NULL);
202			}
203		32	ret = lh_OPENSSL_STRING_retrieve(lh, value);
204		32	db->error = DB_ERROR_OK;
205		32	return (ret);
206		32	}
207
208			int
209			TXT_DB_create_index(TXT_DB db, int field, int (qual)(OPENSSL_STRING *),
210			LHASH_HASH_FN_TYPE hash, LHASH_COMP_FN_TYPE cmp)
211			{
212			LHASH_OF(OPENSSL_STRING) *idx;
213			OPENSSL_STRING *r;
214			int i, n;
215
216	✗✓	64	if (field >= db->num_fields) {
217			db->error = DB_ERROR_INDEX_OUT_OF_RANGE;
218			return (0);
219			}
220			/* FIXME: we lose type checking at this point */
221	✗✓	32	if ((idx = (LHASH_OF(OPENSSL_STRING) *)lh_new(hash, cmp)) == NULL) {
222			db->error = DB_ERROR_MALLOC;
223			return (0);
224			}
225		32	n = sk_OPENSSL_PSTRING_num(db->data);
226	✓✓	280	for (i = 0; i < n; i++) {
227		108	r = sk_OPENSSL_PSTRING_value(db->data, i);
228	✓✓✓✓	162	if ((qual != NULL) && (qual(r) == 0))
229			continue;
230	✗✓	100	if ((r = lh_OPENSSL_STRING_insert(idx, r)) != NULL) {
231			db->error = DB_ERROR_INDEX_CLASH;
232			db->arg1 = sk_OPENSSL_PSTRING_find(db->data, r);
233			db->arg2 = i;
234			lh_OPENSSL_STRING_free(idx);
235			return (0);
236			}
237			}
238	✗✓	32	if (db->index[field] != NULL)
239			lh_OPENSSL_STRING_free(db->index[field]);
240		32	db->index[field] = idx;
241		32	db->qual[field] = qual;
242		32	return (1);
243		32	}
244
245			long
246			TXT_DB_write(BIO out, TXT_DB db)
247			{
248			long i, j,n, nn, l, tot = 0;
249			char p, pp, f;
250			BUF_MEM *buf = NULL;
251			long ret = -1;
252
253	✓✗	24	if ((buf = BUF_MEM_new()) == NULL)
254			goto err;
255		12	n = sk_OPENSSL_PSTRING_num(db->data);
256		12	nn = db->num_fields;
257	✓✓	108	for (i = 0; i < n; i++) {
258		42	pp = sk_OPENSSL_PSTRING_value(db->data, i);
259
260			l = 0;
261	✓✓	588	for (j = 0; j < nn; j++) {
262	✓✓	252	if (pp[j] != NULL)
263		242	l += strlen(pp[j]);
264			}
265	✓✗	42	if (!BUF_MEM_grow_clean(buf, (int)(l*2 + nn)))
266			goto err;
267
268		42	p = buf->data;
269	✓✓	588	for (j = 0; j < nn; j++) {
270		252	f = pp[j];
271	✓✓	252	if (f != NULL)
272		3940	for (;;) {
273	✓✓	3940	if (*f == '\0')
274			break;
275	✗✓	3698	if (*f == '\t')
276			*(p++) = '\\';
277		3698	(p++) = (f++);
278			}
279		252	*(p++) = '\t';
280			}
281		42	p[-1] = '\n';
282		42	j = p - buf->data;
283	✓✗	42	if (BIO_write(out, buf->data, (int)j) != j)
284			goto err;
285		42	tot += j;
286			}
287		12	ret = tot;
288
289			err:
290	✓✗	12	if (buf != NULL)
291		12	BUF_MEM_free(buf);
292		12	return (ret);
293			}
294
295			int
296			TXT_DB_insert(TXT_DB db, OPENSSL_STRING row)
297			{
298			int i;
299			OPENSSL_STRING *r;
300
301	✓✓	180	for (i = 0; i < db->num_fields; i++) {
302	✓✓	72	if (db->index[i] != NULL) {
303	✓✓✓✗	36	if ((db->qual[i] != NULL) && (db->qual[i](row) == 0))
304			continue;
305		24	r = lh_OPENSSL_STRING_retrieve(db->index[i], row);
306	✗✓	24	if (r != NULL) {
307			db->error = DB_ERROR_INDEX_CLASH;
308			db->arg1 = i;
309			db->arg_row = r;
310			goto err;
311			}
312			}
313			}
314			/* We have passed the index checks, now just append and insert */
315	✗✓	12	if (!sk_OPENSSL_PSTRING_push(db->data, row)) {
316			db->error = DB_ERROR_MALLOC;
317			goto err;
318			}
319
320	✓✓	168	for (i = 0; i < db->num_fields; i++) {
321	✓✓	72	if (db->index[i] != NULL) {
322	✓✓✓✗	36	if ((db->qual[i] != NULL) && (db->qual[i](row) == 0))
323			continue;
324		24	(void)lh_OPENSSL_STRING_insert(db->index[i], row);
325		24	}
326			}
327		12	return (1);
328
329			err:
330			return (0);
331		12	}
332
333			void
334			TXT_DB_free(TXT_DB *db)
335			{
336			int i, n;
337			char *p, max;
338
339	✗✓	32	if (db == NULL)
340			return;
341
342	✓✗	16	if (db->index != NULL) {
343	✓✓	224	for (i = db->num_fields - 1; i >= 0; i--)
344	✓✓	96	if (db->index[i] != NULL)
345		32	lh_OPENSSL_STRING_free(db->index[i]);
346		16	free(db->index);
347		16	}
348		16	free(db->qual);
349	✓✗	16	if (db->data != NULL) {
350	✓✓	164	for (i = sk_OPENSSL_PSTRING_num(db->data) - 1; i >= 0; i--) {
351			/* check if any 'fields' have been allocated
352			* from outside of the initial block */
353		66	p = sk_OPENSSL_PSTRING_value(db->data, i);
354		66	max = p[db->num_fields]; /* last address */
355	✓✓	66	if (max == NULL) /* new row */
356			{
357	✓✓	168	for (n = 0; n < db->num_fields; n++)
358		72	free(p[n]);
359			} else {
360	✓✓	756	for (n = 0; n < db->num_fields; n++) {
361	✓✗✗✗	324	if (((p[n] < (char *)p) \|\|
362	✗✓	324	(p[n] > max)) &&
363			(p[n] != NULL))
364			free(p[n]);
365			}
366			}
367		66	free(sk_OPENSSL_PSTRING_value(db->data, i));
368			}
369		16	sk_OPENSSL_PSTRING_free(db->data);
370		16	}
371		16	free(db);
372		32	}