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