Home | History | Annotate | Line # | Download | only in recno
rec_get.c revision 1.12
      1  1.12       agc /*	$NetBSD: rec_get.c,v 1.12 2003/08/07 16:42:44 agc 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.12       agc __RCSID("$NetBSD: rec_get.c,v 1.12 2003/08/07 16:42:44 agc 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.1       cgd #include <errno.h>
     45   1.1       cgd #include <stddef.h>
     46   1.1       cgd #include <stdio.h>
     47   1.1       cgd #include <stdlib.h>
     48   1.1       cgd #include <string.h>
     49   1.1       cgd #include <unistd.h>
     50   1.1       cgd 
     51   1.1       cgd #include <db.h>
     52   1.1       cgd #include "recno.h"
     53   1.1       cgd 
     54   1.1       cgd /*
     55   1.1       cgd  * __REC_GET -- Get a record from the btree.
     56   1.1       cgd  *
     57   1.1       cgd  * Parameters:
     58   1.1       cgd  *	dbp:	pointer to access method
     59   1.1       cgd  *	key:	key to find
     60   1.1       cgd  *	data:	data to return
     61   1.1       cgd  *	flag:	currently unused
     62   1.1       cgd  *
     63   1.1       cgd  * Returns:
     64   1.1       cgd  *	RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
     65   1.1       cgd  */
     66   1.1       cgd int
     67   1.1       cgd __rec_get(dbp, key, data, flags)
     68   1.1       cgd 	const DB *dbp;
     69   1.1       cgd 	const DBT *key;
     70   1.1       cgd 	DBT *data;
     71   1.1       cgd 	u_int flags;
     72   1.1       cgd {
     73   1.1       cgd 	BTREE *t;
     74   1.1       cgd 	EPG *e;
     75   1.1       cgd 	recno_t nrec;
     76   1.1       cgd 	int status;
     77   1.1       cgd 
     78   1.4       cgd 	t = dbp->internal;
     79   1.4       cgd 
     80   1.4       cgd 	/* Toss any page pinned across calls. */
     81   1.4       cgd 	if (t->bt_pinned != NULL) {
     82   1.4       cgd 		mpool_put(t->bt_mp, t->bt_pinned, 0);
     83   1.4       cgd 		t->bt_pinned = NULL;
     84   1.4       cgd 	}
     85   1.4       cgd 
     86   1.4       cgd 	/* Get currently doesn't take any flags, and keys of 0 are illegal. */
     87   1.1       cgd 	if (flags || (nrec = *(recno_t *)key->data) == 0) {
     88   1.1       cgd 		errno = EINVAL;
     89   1.1       cgd 		return (RET_ERROR);
     90   1.1       cgd 	}
     91   1.1       cgd 
     92   1.1       cgd 	/*
     93   1.1       cgd 	 * If we haven't seen this record yet, try to find it in the
     94   1.1       cgd 	 * original file.
     95   1.1       cgd 	 */
     96   1.1       cgd 	if (nrec > t->bt_nrecs) {
     97   1.8       cgd 		if (F_ISSET(t, R_EOF | R_INMEM))
     98   1.1       cgd 			return (RET_SPECIAL);
     99   1.1       cgd 		if ((status = t->bt_irec(t, nrec)) != RET_SUCCESS)
    100   1.1       cgd 			return (status);
    101   1.1       cgd 	}
    102   1.1       cgd 
    103   1.1       cgd 	--nrec;
    104   1.1       cgd 	if ((e = __rec_search(t, nrec, SEARCH)) == NULL)
    105   1.1       cgd 		return (RET_ERROR);
    106   1.1       cgd 
    107   1.1       cgd 	status = __rec_ret(t, e, 0, NULL, data);
    108   1.8       cgd 	if (F_ISSET(t, B_DB_LOCK))
    109   1.4       cgd 		mpool_put(t->bt_mp, e->page, 0);
    110   1.4       cgd 	else
    111   1.4       cgd 		t->bt_pinned = e->page;
    112   1.1       cgd 	return (status);
    113   1.1       cgd }
    114   1.1       cgd 
    115   1.1       cgd /*
    116   1.1       cgd  * __REC_FPIPE -- Get fixed length records from a pipe.
    117   1.1       cgd  *
    118   1.1       cgd  * Parameters:
    119   1.1       cgd  *	t:	tree
    120   1.1       cgd  *	cnt:	records to read
    121   1.1       cgd  *
    122   1.1       cgd  * Returns:
    123   1.1       cgd  *	RET_ERROR, RET_SUCCESS
    124   1.1       cgd  */
    125   1.1       cgd int
    126   1.1       cgd __rec_fpipe(t, top)
    127   1.1       cgd 	BTREE *t;
    128   1.1       cgd 	recno_t top;
    129   1.1       cgd {
    130   1.1       cgd 	DBT data;
    131   1.1       cgd 	recno_t nrec;
    132   1.1       cgd 	size_t len;
    133   1.1       cgd 	int ch;
    134   1.8       cgd 	u_char *p;
    135   1.1       cgd 
    136   1.8       cgd 	if (t->bt_rdata.size < t->bt_reclen) {
    137   1.8       cgd 		t->bt_rdata.data = t->bt_rdata.data == NULL ?
    138   1.8       cgd 		    malloc(t->bt_reclen) :
    139   1.8       cgd 		    realloc(t->bt_rdata.data, t->bt_reclen);
    140   1.8       cgd 		if (t->bt_rdata.data == NULL)
    141   1.1       cgd 			return (RET_ERROR);
    142   1.8       cgd 		t->bt_rdata.size = t->bt_reclen;
    143   1.1       cgd 	}
    144   1.8       cgd 	data.data = t->bt_rdata.data;
    145   1.5       cgd 	data.size = t->bt_reclen;
    146   1.6       cgd 
    147   1.8       cgd 	for (nrec = t->bt_nrecs; nrec < top;) {
    148   1.1       cgd 		len = t->bt_reclen;
    149   1.8       cgd 		for (p = t->bt_rdata.data;; *p++ = ch)
    150   1.8       cgd 			if ((ch = getc(t->bt_rfp)) == EOF || !--len) {
    151   1.8       cgd 				if (ch != EOF)
    152   1.8       cgd 					*p = ch;
    153   1.8       cgd 				if (len != 0)
    154   1.8       cgd 					memset(p, t->bt_bval, len);
    155   1.8       cgd 				if (__rec_iput(t,
    156   1.8       cgd 				    nrec, &data, 0) != RET_SUCCESS)
    157   1.1       cgd 					return (RET_ERROR);
    158   1.8       cgd 				++nrec;
    159   1.1       cgd 				break;
    160   1.1       cgd 			}
    161   1.1       cgd 		if (ch == EOF)
    162   1.1       cgd 			break;
    163   1.1       cgd 	}
    164   1.1       cgd 	if (nrec < top) {
    165   1.8       cgd 		F_SET(t, R_EOF);
    166   1.1       cgd 		return (RET_SPECIAL);
    167   1.1       cgd 	}
    168   1.1       cgd 	return (RET_SUCCESS);
    169   1.1       cgd }
    170   1.1       cgd 
    171   1.1       cgd /*
    172   1.1       cgd  * __REC_VPIPE -- Get variable length records from a pipe.
    173   1.1       cgd  *
    174   1.1       cgd  * Parameters:
    175   1.1       cgd  *	t:	tree
    176   1.1       cgd  *	cnt:	records to read
    177   1.1       cgd  *
    178   1.1       cgd  * Returns:
    179   1.1       cgd  *	RET_ERROR, RET_SUCCESS
    180   1.1       cgd  */
    181   1.1       cgd int
    182   1.1       cgd __rec_vpipe(t, top)
    183   1.1       cgd 	BTREE *t;
    184   1.1       cgd 	recno_t top;
    185   1.1       cgd {
    186   1.1       cgd 	DBT data;
    187   1.1       cgd 	recno_t nrec;
    188  1.11   aymeric 	ptrdiff_t len;
    189   1.1       cgd 	size_t sz;
    190   1.1       cgd 	int bval, ch;
    191   1.8       cgd 	u_char *p;
    192   1.1       cgd 
    193   1.1       cgd 	bval = t->bt_bval;
    194   1.1       cgd 	for (nrec = t->bt_nrecs; nrec < top; ++nrec) {
    195   1.8       cgd 		for (p = t->bt_rdata.data,
    196   1.8       cgd 		    sz = t->bt_rdata.size;; *p++ = ch, --sz) {
    197   1.1       cgd 			if ((ch = getc(t->bt_rfp)) == EOF || ch == bval) {
    198   1.8       cgd 				data.data = t->bt_rdata.data;
    199   1.8       cgd 				data.size = p - (u_char *)t->bt_rdata.data;
    200   1.1       cgd 				if (ch == EOF && data.size == 0)
    201   1.1       cgd 					break;
    202   1.1       cgd 				if (__rec_iput(t, nrec, &data, 0)
    203   1.1       cgd 				    != RET_SUCCESS)
    204   1.1       cgd 					return (RET_ERROR);
    205   1.1       cgd 				break;
    206   1.1       cgd 			}
    207   1.1       cgd 			if (sz == 0) {
    208   1.8       cgd 				len = p - (u_char *)t->bt_rdata.data;
    209   1.8       cgd 				t->bt_rdata.size += (sz = 256);
    210   1.8       cgd 				t->bt_rdata.data = t->bt_rdata.data == NULL ?
    211   1.8       cgd 				    malloc(t->bt_rdata.size) :
    212   1.8       cgd 				    realloc(t->bt_rdata.data, t->bt_rdata.size);
    213   1.8       cgd 				if (t->bt_rdata.data == NULL)
    214   1.1       cgd 					return (RET_ERROR);
    215   1.8       cgd 				p = (u_char *)t->bt_rdata.data + len;
    216   1.1       cgd 			}
    217   1.1       cgd 		}
    218   1.1       cgd 		if (ch == EOF)
    219   1.1       cgd 			break;
    220   1.1       cgd 	}
    221   1.1       cgd 	if (nrec < top) {
    222   1.8       cgd 		F_SET(t, R_EOF);
    223   1.1       cgd 		return (RET_SPECIAL);
    224   1.1       cgd 	}
    225   1.1       cgd 	return (RET_SUCCESS);
    226   1.1       cgd }
    227   1.1       cgd 
    228   1.1       cgd /*
    229   1.1       cgd  * __REC_FMAP -- Get fixed length records from a file.
    230   1.1       cgd  *
    231   1.1       cgd  * Parameters:
    232   1.1       cgd  *	t:	tree
    233   1.1       cgd  *	cnt:	records to read
    234   1.1       cgd  *
    235   1.1       cgd  * Returns:
    236   1.1       cgd  *	RET_ERROR, RET_SUCCESS
    237   1.1       cgd  */
    238   1.1       cgd int
    239   1.1       cgd __rec_fmap(t, top)
    240   1.1       cgd 	BTREE *t;
    241   1.1       cgd 	recno_t top;
    242   1.1       cgd {
    243   1.1       cgd 	DBT data;
    244   1.1       cgd 	recno_t nrec;
    245   1.8       cgd 	u_char *sp, *ep, *p;
    246   1.1       cgd 	size_t len;
    247   1.1       cgd 
    248   1.8       cgd 	if (t->bt_rdata.size < t->bt_reclen) {
    249   1.8       cgd 		t->bt_rdata.data = t->bt_rdata.data == NULL ?
    250   1.8       cgd 		    malloc(t->bt_reclen) :
    251   1.8       cgd 		    realloc(t->bt_rdata.data, t->bt_reclen);
    252   1.8       cgd 		if (t->bt_rdata.data == NULL)
    253   1.1       cgd 			return (RET_ERROR);
    254   1.8       cgd 		t->bt_rdata.size = t->bt_reclen;
    255   1.1       cgd 	}
    256   1.8       cgd 	data.data = t->bt_rdata.data;
    257   1.6       cgd 	data.size = t->bt_reclen;
    258   1.6       cgd 
    259   1.8       cgd 	sp = (u_char *)t->bt_cmap;
    260   1.8       cgd 	ep = (u_char *)t->bt_emap;
    261   1.1       cgd 	for (nrec = t->bt_nrecs; nrec < top; ++nrec) {
    262   1.1       cgd 		if (sp >= ep) {
    263   1.8       cgd 			F_SET(t, R_EOF);
    264   1.1       cgd 			return (RET_SPECIAL);
    265   1.1       cgd 		}
    266   1.1       cgd 		len = t->bt_reclen;
    267   1.8       cgd 		for (p = t->bt_rdata.data;
    268   1.8       cgd 		    sp < ep && len > 0; *p++ = *sp++, --len);
    269   1.8       cgd 		if (len != 0)
    270   1.8       cgd 			memset(p, t->bt_bval, len);
    271   1.1       cgd 		if (__rec_iput(t, nrec, &data, 0) != RET_SUCCESS)
    272   1.1       cgd 			return (RET_ERROR);
    273   1.1       cgd 	}
    274   1.8       cgd 	t->bt_cmap = (caddr_t)sp;
    275   1.1       cgd 	return (RET_SUCCESS);
    276   1.1       cgd }
    277   1.1       cgd 
    278   1.1       cgd /*
    279   1.1       cgd  * __REC_VMAP -- Get variable length records from a file.
    280   1.1       cgd  *
    281   1.1       cgd  * Parameters:
    282   1.1       cgd  *	t:	tree
    283   1.1       cgd  *	cnt:	records to read
    284   1.1       cgd  *
    285   1.1       cgd  * Returns:
    286   1.1       cgd  *	RET_ERROR, RET_SUCCESS
    287   1.1       cgd  */
    288   1.1       cgd int
    289   1.1       cgd __rec_vmap(t, top)
    290   1.1       cgd 	BTREE *t;
    291   1.1       cgd 	recno_t top;
    292   1.1       cgd {
    293   1.1       cgd 	DBT data;
    294   1.8       cgd 	u_char *sp, *ep;
    295   1.1       cgd 	recno_t nrec;
    296   1.1       cgd 	int bval;
    297   1.1       cgd 
    298   1.8       cgd 	sp = (u_char *)t->bt_cmap;
    299   1.8       cgd 	ep = (u_char *)t->bt_emap;
    300   1.1       cgd 	bval = t->bt_bval;
    301   1.1       cgd 
    302   1.1       cgd 	for (nrec = t->bt_nrecs; nrec < top; ++nrec) {
    303   1.1       cgd 		if (sp >= ep) {
    304   1.8       cgd 			F_SET(t, R_EOF);
    305   1.1       cgd 			return (RET_SPECIAL);
    306   1.1       cgd 		}
    307   1.1       cgd 		for (data.data = sp; sp < ep && *sp != bval; ++sp);
    308   1.8       cgd 		data.size = sp - (u_char *)data.data;
    309   1.1       cgd 		if (__rec_iput(t, nrec, &data, 0) != RET_SUCCESS)
    310   1.1       cgd 			return (RET_ERROR);
    311   1.1       cgd 		++sp;
    312   1.1       cgd 	}
    313   1.8       cgd 	t->bt_cmap = (caddr_t)sp;
    314   1.1       cgd 	return (RET_SUCCESS);
    315   1.1       cgd }
    316