Home | History | Annotate | Line # | Download | only in recno
rec_utils.c revision 1.10
      1 /*	$NetBSD: rec_utils.c,v 1.10 2004/06/20 22:20:14 jmc Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1990, 1993, 1994
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. Neither the name of the University nor the names of its contributors
     16  *    may be used to endorse or promote products derived from this software
     17  *    without specific prior written permission.
     18  *
     19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29  * SUCH DAMAGE.
     30  */
     31 
     32 #if HAVE_NBTOOL_CONFIG_H
     33 #include "nbtool_config.h"
     34 #endif
     35 
     36 #include <sys/cdefs.h>
     37 #if defined(LIBC_SCCS) && !defined(lint)
     38 #if 0
     39 static char sccsid[] = "@(#)rec_utils.c	8.6 (Berkeley) 7/16/94";
     40 #else
     41 __RCSID("$NetBSD: rec_utils.c,v 1.10 2004/06/20 22:20:14 jmc Exp $");
     42 #endif
     43 #endif /* LIBC_SCCS and not lint */
     44 
     45 #include <sys/param.h>
     46 
     47 #include <stdio.h>
     48 #include <stdlib.h>
     49 #include <string.h>
     50 
     51 #include <db.h>
     52 #include "recno.h"
     53 
     54 /*
     55  * __rec_ret --
     56  *	Build return data.
     57  *
     58  * Parameters:
     59  *	t:	tree
     60  *	e:	key/data pair to be returned
     61  *   nrec:	record number
     62  *    key:	user's key structure
     63  *	data:	user's data structure
     64  *
     65  * Returns:
     66  *	RET_SUCCESS, RET_ERROR.
     67  */
     68 int
     69 __rec_ret(t, e, nrec, key, data)
     70 	BTREE *t;
     71 	EPG *e;
     72 	recno_t nrec;
     73 	DBT *key, *data;
     74 {
     75 	RLEAF *rl;
     76 	void *p;
     77 
     78 	if (key == NULL)
     79 		goto dataonly;
     80 
     81 	/* We have to copy the key, it's not on the page. */
     82 	if (sizeof(recno_t) > t->bt_rkey.size) {
     83 		p = (void *)(t->bt_rkey.data == NULL ?
     84 		    malloc(sizeof(recno_t)) :
     85 		    realloc(t->bt_rkey.data, sizeof(recno_t)));
     86 		if (p == NULL)
     87 			return (RET_ERROR);
     88 		t->bt_rkey.data = p;
     89 		t->bt_rkey.size = sizeof(recno_t);
     90 	}
     91 	memmove(t->bt_rkey.data, &nrec, sizeof(recno_t));
     92 	key->size = sizeof(recno_t);
     93 	key->data = t->bt_rkey.data;
     94 
     95 dataonly:
     96 	if (data == NULL)
     97 		return (RET_SUCCESS);
     98 
     99 	/*
    100 	 * We must copy big keys/data to make them contigous.  Otherwise,
    101 	 * leave the page pinned and don't copy unless the user specified
    102 	 * concurrent access.
    103 	 */
    104 	rl = GETRLEAF(e->page, e->index);
    105 	if (rl->flags & P_BIGDATA) {
    106 		if (__ovfl_get(t, rl->bytes,
    107 		    &data->size, &t->bt_rdata.data, &t->bt_rdata.size))
    108 			return (RET_ERROR);
    109 		data->data = t->bt_rdata.data;
    110 	} else if (F_ISSET(t, B_DB_LOCK)) {
    111 		/* Use +1 in case the first record retrieved is 0 length. */
    112 		if (rl->dsize + 1 > t->bt_rdata.size) {
    113 			p = (void *)(t->bt_rdata.data == NULL ?
    114 			    malloc(rl->dsize + 1) :
    115 			    realloc(t->bt_rdata.data, rl->dsize + 1));
    116 			if (p == NULL)
    117 				return (RET_ERROR);
    118 			t->bt_rdata.data = p;
    119 			t->bt_rdata.size = rl->dsize + 1;
    120 		}
    121 		memmove(t->bt_rdata.data, rl->bytes, rl->dsize);
    122 		data->size = rl->dsize;
    123 		data->data = t->bt_rdata.data;
    124 	} else {
    125 		data->size = rl->dsize;
    126 		data->data = rl->bytes;
    127 	}
    128 	return (RET_SUCCESS);
    129 }
    130