Home | History | Annotate | Line # | Download | only in recno
rec_utils.c revision 1.1
      1  1.1  cgd /*-
      2  1.1  cgd  * Copyright (c) 1990, 1993
      3  1.1  cgd  *	The Regents of the University of California.  All rights reserved.
      4  1.1  cgd  *
      5  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      6  1.1  cgd  * modification, are permitted provided that the following conditions
      7  1.1  cgd  * are met:
      8  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
      9  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     10  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     12  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     13  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     14  1.1  cgd  *    must display the following acknowledgement:
     15  1.1  cgd  *	This product includes software developed by the University of
     16  1.1  cgd  *	California, Berkeley and its contributors.
     17  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     18  1.1  cgd  *    may be used to endorse or promote products derived from this software
     19  1.1  cgd  *    without specific prior written permission.
     20  1.1  cgd  *
     21  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1  cgd  * SUCH DAMAGE.
     32  1.1  cgd  */
     33  1.1  cgd 
     34  1.1  cgd #if defined(LIBC_SCCS) && !defined(lint)
     35  1.1  cgd static char sccsid[] = "@(#)rec_utils.c	8.1 (Berkeley) 6/4/93";
     36  1.1  cgd #endif /* LIBC_SCCS and not lint */
     37  1.1  cgd 
     38  1.1  cgd #include <sys/param.h>
     39  1.1  cgd 
     40  1.1  cgd #include <stdio.h>
     41  1.1  cgd #include <stdlib.h>
     42  1.1  cgd #include <string.h>
     43  1.1  cgd 
     44  1.1  cgd #include <db.h>
     45  1.1  cgd #include "recno.h"
     46  1.1  cgd 
     47  1.1  cgd /*
     48  1.1  cgd  * __REC_RET -- Build return data as a result of search or scan.
     49  1.1  cgd  *
     50  1.1  cgd  * Parameters:
     51  1.1  cgd  *	t:	tree
     52  1.1  cgd  *	d:	LEAF to be returned to the user.
     53  1.1  cgd  *	data:	user's data structure
     54  1.1  cgd  *
     55  1.1  cgd  * Returns:
     56  1.1  cgd  *	RET_SUCCESS, RET_ERROR.
     57  1.1  cgd  */
     58  1.1  cgd int
     59  1.1  cgd __rec_ret(t, e, nrec, key, data)
     60  1.1  cgd 	BTREE *t;
     61  1.1  cgd 	EPG *e;
     62  1.1  cgd 	recno_t nrec;
     63  1.1  cgd 	DBT *key, *data;
     64  1.1  cgd {
     65  1.1  cgd 	register RLEAF *rl;
     66  1.1  cgd 	register void *p;
     67  1.1  cgd 
     68  1.1  cgd 	if (data == NULL)
     69  1.1  cgd 		goto retkey;
     70  1.1  cgd 
     71  1.1  cgd 	rl = GETRLEAF(e->page, e->index);
     72  1.1  cgd 
     73  1.1  cgd 	if (rl->flags & P_BIGDATA) {
     74  1.1  cgd 		if (__ovfl_get(t, rl->bytes,
     75  1.1  cgd 		    &data->size, &t->bt_dbuf, &t->bt_dbufsz))
     76  1.1  cgd 			return (RET_ERROR);
     77  1.1  cgd 	} else {
     78  1.1  cgd 		/* Use +1 in case the first record retrieved is 0 length. */
     79  1.1  cgd 		if (rl->dsize + 1 > t->bt_dbufsz) {
     80  1.1  cgd 			if ((p = realloc(t->bt_dbuf, rl->dsize + 1)) == NULL)
     81  1.1  cgd 				return (RET_ERROR);
     82  1.1  cgd 			t->bt_dbuf = p;
     83  1.1  cgd 			t->bt_dbufsz = rl->dsize + 1;
     84  1.1  cgd 		}
     85  1.1  cgd 		memmove(t->bt_dbuf, rl->bytes, rl->dsize);
     86  1.1  cgd 		data->size = rl->dsize;
     87  1.1  cgd 	}
     88  1.1  cgd 	data->data = t->bt_dbuf;
     89  1.1  cgd 
     90  1.1  cgd retkey:	if (key == NULL)
     91  1.1  cgd 		return (RET_SUCCESS);
     92  1.1  cgd 
     93  1.1  cgd 	if (sizeof(recno_t) > t->bt_kbufsz) {
     94  1.1  cgd 		if ((p = realloc(t->bt_kbuf, sizeof(recno_t))) == NULL)
     95  1.1  cgd 			return (RET_ERROR);
     96  1.1  cgd 		t->bt_kbuf = p;
     97  1.1  cgd 		t->bt_kbufsz = sizeof(recno_t);
     98  1.1  cgd 	}
     99  1.1  cgd 	memmove(t->bt_kbuf, &nrec, sizeof(recno_t));
    100  1.1  cgd 	key->size = sizeof(recno_t);
    101  1.1  cgd 	key->data = t->bt_kbuf;
    102  1.1  cgd 	return (RET_SUCCESS);
    103  1.1  cgd }
    104