rec_utils.c revision 1.4 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.4 cgd /* from: static char sccsid[] = "@(#)rec_utils.c 8.2 (Berkeley) 9/7/93"; */
36 1.4 cgd static char *rcsid = "$Id: rec_utils.c,v 1.4 1993/09/09 02:42:29 cgd Exp $";
37 1.1 cgd #endif /* LIBC_SCCS and not lint */
38 1.1 cgd
39 1.1 cgd #include <sys/param.h>
40 1.1 cgd
41 1.1 cgd #include <stdio.h>
42 1.1 cgd #include <stdlib.h>
43 1.1 cgd #include <string.h>
44 1.1 cgd
45 1.1 cgd #include <db.h>
46 1.1 cgd #include "recno.h"
47 1.1 cgd
48 1.1 cgd /*
49 1.1 cgd * __REC_RET -- Build return data as a result of search or scan.
50 1.1 cgd *
51 1.1 cgd * Parameters:
52 1.1 cgd * t: tree
53 1.1 cgd * d: LEAF to be returned to the user.
54 1.1 cgd * data: user's data structure
55 1.1 cgd *
56 1.1 cgd * Returns:
57 1.1 cgd * RET_SUCCESS, RET_ERROR.
58 1.1 cgd */
59 1.1 cgd int
60 1.1 cgd __rec_ret(t, e, nrec, key, data)
61 1.1 cgd BTREE *t;
62 1.1 cgd EPG *e;
63 1.1 cgd recno_t nrec;
64 1.1 cgd DBT *key, *data;
65 1.1 cgd {
66 1.1 cgd register RLEAF *rl;
67 1.1 cgd register void *p;
68 1.1 cgd
69 1.1 cgd if (data == NULL)
70 1.1 cgd goto retkey;
71 1.1 cgd
72 1.1 cgd rl = GETRLEAF(e->page, e->index);
73 1.1 cgd
74 1.4 cgd /*
75 1.4 cgd * We always copy big data to make it contigous. Otherwise, we
76 1.4 cgd * leave the page pinned and don't copy unless the user specified
77 1.4 cgd * concurrent access.
78 1.4 cgd */
79 1.1 cgd if (rl->flags & P_BIGDATA) {
80 1.1 cgd if (__ovfl_get(t, rl->bytes,
81 1.1 cgd &data->size, &t->bt_dbuf, &t->bt_dbufsz))
82 1.1 cgd return (RET_ERROR);
83 1.4 cgd data->data = t->bt_dbuf;
84 1.4 cgd } else if (ISSET(t, B_DB_LOCK)) {
85 1.1 cgd /* Use +1 in case the first record retrieved is 0 length. */
86 1.1 cgd if (rl->dsize + 1 > t->bt_dbufsz) {
87 1.1 cgd if ((p = realloc(t->bt_dbuf, rl->dsize + 1)) == NULL)
88 1.1 cgd return (RET_ERROR);
89 1.1 cgd t->bt_dbuf = p;
90 1.1 cgd t->bt_dbufsz = rl->dsize + 1;
91 1.1 cgd }
92 1.1 cgd memmove(t->bt_dbuf, rl->bytes, rl->dsize);
93 1.1 cgd data->size = rl->dsize;
94 1.4 cgd data->data = t->bt_dbuf;
95 1.4 cgd } else {
96 1.4 cgd data->size = rl->dsize;
97 1.4 cgd data->data = rl->bytes;
98 1.1 cgd }
99 1.1 cgd
100 1.1 cgd retkey: if (key == NULL)
101 1.1 cgd return (RET_SUCCESS);
102 1.1 cgd
103 1.4 cgd /* We have to copy the key, it's not on the page. */
104 1.1 cgd if (sizeof(recno_t) > t->bt_kbufsz) {
105 1.1 cgd if ((p = realloc(t->bt_kbuf, sizeof(recno_t))) == NULL)
106 1.1 cgd return (RET_ERROR);
107 1.1 cgd t->bt_kbuf = p;
108 1.1 cgd t->bt_kbufsz = sizeof(recno_t);
109 1.1 cgd }
110 1.1 cgd memmove(t->bt_kbuf, &nrec, sizeof(recno_t));
111 1.1 cgd key->size = sizeof(recno_t);
112 1.1 cgd key->data = t->bt_kbuf;
113 1.1 cgd return (RET_SUCCESS);
114 1.1 cgd }
115