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