Home | History | Annotate | Line # | Download | only in recno
rec_get.c revision 1.13.12.1
      1  1.13.12.1  wrstuden /*	$NetBSD: rec_get.c,v 1.13.12.1 2008/09/18 04:39:21 wrstuden Exp $	*/
      2        1.7       cgd 
      3        1.1       cgd /*-
      4        1.6       cgd  * Copyright (c) 1990, 1993, 1994
      5        1.1       cgd  *	The Regents of the University of California.  All rights reserved.
      6        1.1       cgd  *
      7        1.1       cgd  * Redistribution and use in source and binary forms, with or without
      8        1.1       cgd  * modification, are permitted provided that the following conditions
      9        1.1       cgd  * are met:
     10        1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     11        1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     12        1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13        1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     14        1.1       cgd  *    documentation and/or other materials provided with the distribution.
     15       1.12       agc  * 3. Neither the name of the University nor the names of its contributors
     16        1.1       cgd  *    may be used to endorse or promote products derived from this software
     17        1.1       cgd  *    without specific prior written permission.
     18        1.1       cgd  *
     19        1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20        1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21        1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22        1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23        1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24        1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25        1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26        1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27        1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28        1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29        1.1       cgd  * SUCH DAMAGE.
     30        1.1       cgd  */
     31        1.1       cgd 
     32        1.9  christos #include <sys/cdefs.h>
     33        1.1       cgd #if defined(LIBC_SCCS) && !defined(lint)
     34        1.7       cgd #if 0
     35        1.8       cgd static char sccsid[] = "@(#)rec_get.c	8.9 (Berkeley) 8/18/94";
     36        1.7       cgd #else
     37  1.13.12.1  wrstuden __RCSID("$NetBSD: rec_get.c,v 1.13.12.1 2008/09/18 04:39:21 wrstuden Exp $");
     38        1.7       cgd #endif
     39        1.1       cgd #endif /* LIBC_SCCS and not lint */
     40        1.1       cgd 
     41       1.10       jtc #include "namespace.h"
     42        1.1       cgd #include <sys/types.h>
     43        1.1       cgd 
     44       1.13  christos #include <assert.h>
     45        1.1       cgd #include <errno.h>
     46        1.1       cgd #include <stddef.h>
     47        1.1       cgd #include <stdio.h>
     48        1.1       cgd #include <stdlib.h>
     49        1.1       cgd #include <string.h>
     50        1.1       cgd #include <unistd.h>
     51        1.1       cgd 
     52        1.1       cgd #include <db.h>
     53        1.1       cgd #include "recno.h"
     54        1.1       cgd 
     55        1.1       cgd /*
     56        1.1       cgd  * __REC_GET -- Get a record from the btree.
     57        1.1       cgd  *
     58        1.1       cgd  * Parameters:
     59        1.1       cgd  *	dbp:	pointer to access method
     60        1.1       cgd  *	key:	key to find
     61        1.1       cgd  *	data:	data to return
     62        1.1       cgd  *	flag:	currently unused
     63        1.1       cgd  *
     64        1.1       cgd  * Returns:
     65        1.1       cgd  *	RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
     66        1.1       cgd  */
     67        1.1       cgd int
     68       1.13  christos __rec_get(const DB *dbp, const DBT *key, DBT *data, u_int flags)
     69        1.1       cgd {
     70        1.1       cgd 	BTREE *t;
     71        1.1       cgd 	EPG *e;
     72        1.1       cgd 	recno_t nrec;
     73        1.1       cgd 	int status;
     74        1.1       cgd 
     75        1.4       cgd 	t = dbp->internal;
     76        1.4       cgd 
     77        1.4       cgd 	/* Toss any page pinned across calls. */
     78        1.4       cgd 	if (t->bt_pinned != NULL) {
     79        1.4       cgd 		mpool_put(t->bt_mp, t->bt_pinned, 0);
     80        1.4       cgd 		t->bt_pinned = NULL;
     81        1.4       cgd 	}
     82        1.4       cgd 
     83        1.4       cgd 	/* Get currently doesn't take any flags, and keys of 0 are illegal. */
     84        1.1       cgd 	if (flags || (nrec = *(recno_t *)key->data) == 0) {
     85        1.1       cgd 		errno = EINVAL;
     86        1.1       cgd 		return (RET_ERROR);
     87        1.1       cgd 	}
     88        1.1       cgd 
     89        1.1       cgd 	/*
     90        1.1       cgd 	 * If we haven't seen this record yet, try to find it in the
     91        1.1       cgd 	 * original file.
     92        1.1       cgd 	 */
     93        1.1       cgd 	if (nrec > t->bt_nrecs) {
     94        1.8       cgd 		if (F_ISSET(t, R_EOF | R_INMEM))
     95        1.1       cgd 			return (RET_SPECIAL);
     96        1.1       cgd 		if ((status = t->bt_irec(t, nrec)) != RET_SUCCESS)
     97        1.1       cgd 			return (status);
     98        1.1       cgd 	}
     99        1.1       cgd 
    100        1.1       cgd 	--nrec;
    101        1.1       cgd 	if ((e = __rec_search(t, nrec, SEARCH)) == NULL)
    102        1.1       cgd 		return (RET_ERROR);
    103        1.1       cgd 
    104        1.1       cgd 	status = __rec_ret(t, e, 0, NULL, data);
    105        1.8       cgd 	if (F_ISSET(t, B_DB_LOCK))
    106        1.4       cgd 		mpool_put(t->bt_mp, e->page, 0);
    107        1.4       cgd 	else
    108        1.4       cgd 		t->bt_pinned = e->page;
    109        1.1       cgd 	return (status);
    110        1.1       cgd }
    111        1.1       cgd 
    112        1.1       cgd /*
    113        1.1       cgd  * __REC_FPIPE -- Get fixed length records from a pipe.
    114        1.1       cgd  *
    115        1.1       cgd  * Parameters:
    116        1.1       cgd  *	t:	tree
    117        1.1       cgd  *	cnt:	records to read
    118        1.1       cgd  *
    119        1.1       cgd  * Returns:
    120        1.1       cgd  *	RET_ERROR, RET_SUCCESS
    121        1.1       cgd  */
    122        1.1       cgd int
    123       1.13  christos __rec_fpipe(BTREE *t, recno_t top)
    124        1.1       cgd {
    125        1.1       cgd 	DBT data;
    126        1.1       cgd 	recno_t nrec;
    127        1.1       cgd 	size_t len;
    128        1.1       cgd 	int ch;
    129  1.13.12.1  wrstuden 	uint8_t *p;
    130        1.1       cgd 
    131        1.8       cgd 	if (t->bt_rdata.size < t->bt_reclen) {
    132        1.8       cgd 		t->bt_rdata.data = t->bt_rdata.data == NULL ?
    133        1.8       cgd 		    malloc(t->bt_reclen) :
    134        1.8       cgd 		    realloc(t->bt_rdata.data, t->bt_reclen);
    135        1.8       cgd 		if (t->bt_rdata.data == NULL)
    136        1.1       cgd 			return (RET_ERROR);
    137        1.8       cgd 		t->bt_rdata.size = t->bt_reclen;
    138        1.1       cgd 	}
    139        1.8       cgd 	data.data = t->bt_rdata.data;
    140        1.5       cgd 	data.size = t->bt_reclen;
    141        1.6       cgd 
    142        1.8       cgd 	for (nrec = t->bt_nrecs; nrec < top;) {
    143        1.1       cgd 		len = t->bt_reclen;
    144        1.8       cgd 		for (p = t->bt_rdata.data;; *p++ = ch)
    145        1.8       cgd 			if ((ch = getc(t->bt_rfp)) == EOF || !--len) {
    146        1.8       cgd 				if (ch != EOF)
    147        1.8       cgd 					*p = ch;
    148        1.8       cgd 				if (len != 0)
    149        1.8       cgd 					memset(p, t->bt_bval, len);
    150        1.8       cgd 				if (__rec_iput(t,
    151        1.8       cgd 				    nrec, &data, 0) != RET_SUCCESS)
    152        1.1       cgd 					return (RET_ERROR);
    153        1.8       cgd 				++nrec;
    154        1.1       cgd 				break;
    155        1.1       cgd 			}
    156        1.1       cgd 		if (ch == EOF)
    157        1.1       cgd 			break;
    158        1.1       cgd 	}
    159        1.1       cgd 	if (nrec < top) {
    160        1.8       cgd 		F_SET(t, R_EOF);
    161        1.1       cgd 		return (RET_SPECIAL);
    162        1.1       cgd 	}
    163        1.1       cgd 	return (RET_SUCCESS);
    164        1.1       cgd }
    165        1.1       cgd 
    166        1.1       cgd /*
    167        1.1       cgd  * __REC_VPIPE -- Get variable length records from a pipe.
    168        1.1       cgd  *
    169        1.1       cgd  * Parameters:
    170        1.1       cgd  *	t:	tree
    171        1.1       cgd  *	cnt:	records to read
    172        1.1       cgd  *
    173        1.1       cgd  * Returns:
    174        1.1       cgd  *	RET_ERROR, RET_SUCCESS
    175        1.1       cgd  */
    176        1.1       cgd int
    177       1.13  christos __rec_vpipe(BTREE *t, recno_t top)
    178        1.1       cgd {
    179        1.1       cgd 	DBT data;
    180        1.1       cgd 	recno_t nrec;
    181       1.11   aymeric 	ptrdiff_t len;
    182        1.1       cgd 	size_t sz;
    183        1.1       cgd 	int bval, ch;
    184  1.13.12.1  wrstuden 	uint8_t *p;
    185        1.1       cgd 
    186        1.1       cgd 	bval = t->bt_bval;
    187        1.1       cgd 	for (nrec = t->bt_nrecs; nrec < top; ++nrec) {
    188        1.8       cgd 		for (p = t->bt_rdata.data,
    189        1.8       cgd 		    sz = t->bt_rdata.size;; *p++ = ch, --sz) {
    190        1.1       cgd 			if ((ch = getc(t->bt_rfp)) == EOF || ch == bval) {
    191        1.8       cgd 				data.data = t->bt_rdata.data;
    192  1.13.12.1  wrstuden 				data.size = p - (uint8_t *)t->bt_rdata.data;
    193        1.1       cgd 				if (ch == EOF && data.size == 0)
    194        1.1       cgd 					break;
    195        1.1       cgd 				if (__rec_iput(t, nrec, &data, 0)
    196        1.1       cgd 				    != RET_SUCCESS)
    197        1.1       cgd 					return (RET_ERROR);
    198        1.1       cgd 				break;
    199        1.1       cgd 			}
    200        1.1       cgd 			if (sz == 0) {
    201  1.13.12.1  wrstuden 				len = p - (uint8_t *)t->bt_rdata.data;
    202        1.8       cgd 				t->bt_rdata.size += (sz = 256);
    203        1.8       cgd 				t->bt_rdata.data = t->bt_rdata.data == NULL ?
    204        1.8       cgd 				    malloc(t->bt_rdata.size) :
    205        1.8       cgd 				    realloc(t->bt_rdata.data, t->bt_rdata.size);
    206        1.8       cgd 				if (t->bt_rdata.data == NULL)
    207        1.1       cgd 					return (RET_ERROR);
    208  1.13.12.1  wrstuden 				p = (uint8_t *)t->bt_rdata.data + len;
    209        1.1       cgd 			}
    210        1.1       cgd 		}
    211        1.1       cgd 		if (ch == EOF)
    212        1.1       cgd 			break;
    213        1.1       cgd 	}
    214        1.1       cgd 	if (nrec < top) {
    215        1.8       cgd 		F_SET(t, R_EOF);
    216        1.1       cgd 		return (RET_SPECIAL);
    217        1.1       cgd 	}
    218        1.1       cgd 	return (RET_SUCCESS);
    219        1.1       cgd }
    220        1.1       cgd 
    221        1.1       cgd /*
    222        1.1       cgd  * __REC_FMAP -- Get fixed length records from a file.
    223        1.1       cgd  *
    224        1.1       cgd  * Parameters:
    225        1.1       cgd  *	t:	tree
    226        1.1       cgd  *	cnt:	records to read
    227        1.1       cgd  *
    228        1.1       cgd  * Returns:
    229        1.1       cgd  *	RET_ERROR, RET_SUCCESS
    230        1.1       cgd  */
    231        1.1       cgd int
    232       1.13  christos __rec_fmap(BTREE *t, recno_t top)
    233        1.1       cgd {
    234        1.1       cgd 	DBT data;
    235        1.1       cgd 	recno_t nrec;
    236  1.13.12.1  wrstuden 	uint8_t *sp, *ep, *p;
    237        1.1       cgd 	size_t len;
    238        1.1       cgd 
    239        1.8       cgd 	if (t->bt_rdata.size < t->bt_reclen) {
    240        1.8       cgd 		t->bt_rdata.data = t->bt_rdata.data == NULL ?
    241        1.8       cgd 		    malloc(t->bt_reclen) :
    242        1.8       cgd 		    realloc(t->bt_rdata.data, t->bt_reclen);
    243        1.8       cgd 		if (t->bt_rdata.data == NULL)
    244        1.1       cgd 			return (RET_ERROR);
    245        1.8       cgd 		t->bt_rdata.size = t->bt_reclen;
    246        1.1       cgd 	}
    247        1.8       cgd 	data.data = t->bt_rdata.data;
    248        1.6       cgd 	data.size = t->bt_reclen;
    249        1.6       cgd 
    250  1.13.12.1  wrstuden 	sp = (uint8_t *)t->bt_cmap;
    251  1.13.12.1  wrstuden 	ep = (uint8_t *)t->bt_emap;
    252        1.1       cgd 	for (nrec = t->bt_nrecs; nrec < top; ++nrec) {
    253        1.1       cgd 		if (sp >= ep) {
    254        1.8       cgd 			F_SET(t, R_EOF);
    255        1.1       cgd 			return (RET_SPECIAL);
    256        1.1       cgd 		}
    257        1.1       cgd 		len = t->bt_reclen;
    258        1.8       cgd 		for (p = t->bt_rdata.data;
    259        1.8       cgd 		    sp < ep && len > 0; *p++ = *sp++, --len);
    260        1.8       cgd 		if (len != 0)
    261        1.8       cgd 			memset(p, t->bt_bval, len);
    262        1.1       cgd 		if (__rec_iput(t, nrec, &data, 0) != RET_SUCCESS)
    263        1.1       cgd 			return (RET_ERROR);
    264        1.1       cgd 	}
    265        1.8       cgd 	t->bt_cmap = (caddr_t)sp;
    266        1.1       cgd 	return (RET_SUCCESS);
    267        1.1       cgd }
    268        1.1       cgd 
    269        1.1       cgd /*
    270        1.1       cgd  * __REC_VMAP -- Get variable length records from a file.
    271        1.1       cgd  *
    272        1.1       cgd  * Parameters:
    273        1.1       cgd  *	t:	tree
    274        1.1       cgd  *	cnt:	records to read
    275        1.1       cgd  *
    276        1.1       cgd  * Returns:
    277        1.1       cgd  *	RET_ERROR, RET_SUCCESS
    278        1.1       cgd  */
    279        1.1       cgd int
    280       1.13  christos __rec_vmap(BTREE *t, recno_t top)
    281        1.1       cgd {
    282        1.1       cgd 	DBT data;
    283  1.13.12.1  wrstuden 	uint8_t *sp, *ep;
    284        1.1       cgd 	recno_t nrec;
    285        1.1       cgd 	int bval;
    286        1.1       cgd 
    287  1.13.12.1  wrstuden 	sp = (uint8_t *)t->bt_cmap;
    288  1.13.12.1  wrstuden 	ep = (uint8_t *)t->bt_emap;
    289        1.1       cgd 	bval = t->bt_bval;
    290        1.1       cgd 
    291        1.1       cgd 	for (nrec = t->bt_nrecs; nrec < top; ++nrec) {
    292        1.1       cgd 		if (sp >= ep) {
    293        1.8       cgd 			F_SET(t, R_EOF);
    294        1.1       cgd 			return (RET_SPECIAL);
    295        1.1       cgd 		}
    296        1.1       cgd 		for (data.data = sp; sp < ep && *sp != bval; ++sp);
    297  1.13.12.1  wrstuden 		data.size = sp - (uint8_t *)data.data;
    298        1.1       cgd 		if (__rec_iput(t, nrec, &data, 0) != RET_SUCCESS)
    299        1.1       cgd 			return (RET_ERROR);
    300        1.1       cgd 		++sp;
    301        1.1       cgd 	}
    302        1.8       cgd 	t->bt_cmap = (caddr_t)sp;
    303        1.1       cgd 	return (RET_SUCCESS);
    304        1.1       cgd }
    305