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