rec_utils.c revision 1.6 1 1.6 cgd /* $NetBSD: rec_utils.c,v 1.6 1995/02/27 13:25:29 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.5 cgd static char sccsid[] = "@(#)rec_utils.c 8.4 (Berkeley) 6/20/94";
39 1.6 cgd #else
40 1.6 cgd static char rcsid[] = "$NetBSD: rec_utils.c,v 1.6 1995/02/27 13:25:29 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.1 cgd * __REC_RET -- Build return data as a result of search or scan.
55 1.1 cgd *
56 1.1 cgd * Parameters:
57 1.1 cgd * t: tree
58 1.1 cgd * d: LEAF to be returned to the user.
59 1.1 cgd * data: user's data structure
60 1.1 cgd *
61 1.1 cgd * Returns:
62 1.1 cgd * RET_SUCCESS, RET_ERROR.
63 1.1 cgd */
64 1.1 cgd int
65 1.1 cgd __rec_ret(t, e, nrec, key, data)
66 1.1 cgd BTREE *t;
67 1.1 cgd EPG *e;
68 1.1 cgd recno_t nrec;
69 1.1 cgd DBT *key, *data;
70 1.1 cgd {
71 1.1 cgd register RLEAF *rl;
72 1.1 cgd register void *p;
73 1.1 cgd
74 1.1 cgd if (data == NULL)
75 1.1 cgd goto retkey;
76 1.1 cgd
77 1.1 cgd rl = GETRLEAF(e->page, e->index);
78 1.1 cgd
79 1.4 cgd /*
80 1.4 cgd * We always copy big data to make it contigous. Otherwise, we
81 1.4 cgd * leave the page pinned and don't copy unless the user specified
82 1.4 cgd * concurrent access.
83 1.4 cgd */
84 1.1 cgd if (rl->flags & P_BIGDATA) {
85 1.1 cgd if (__ovfl_get(t, rl->bytes,
86 1.1 cgd &data->size, &t->bt_dbuf, &t->bt_dbufsz))
87 1.1 cgd return (RET_ERROR);
88 1.4 cgd data->data = t->bt_dbuf;
89 1.4 cgd } else if (ISSET(t, B_DB_LOCK)) {
90 1.1 cgd /* Use +1 in case the first record retrieved is 0 length. */
91 1.1 cgd if (rl->dsize + 1 > t->bt_dbufsz) {
92 1.5 cgd p = (void *)(t->bt_dbuf == NULL ?
93 1.5 cgd malloc(rl->dsize + 1) :
94 1.5 cgd realloc(t->bt_dbuf, rl->dsize + 1));
95 1.5 cgd if (p == NULL)
96 1.1 cgd return (RET_ERROR);
97 1.1 cgd t->bt_dbuf = p;
98 1.1 cgd t->bt_dbufsz = rl->dsize + 1;
99 1.1 cgd }
100 1.1 cgd memmove(t->bt_dbuf, rl->bytes, rl->dsize);
101 1.1 cgd data->size = rl->dsize;
102 1.4 cgd data->data = t->bt_dbuf;
103 1.4 cgd } else {
104 1.4 cgd data->size = rl->dsize;
105 1.4 cgd data->data = rl->bytes;
106 1.1 cgd }
107 1.1 cgd
108 1.1 cgd retkey: if (key == NULL)
109 1.1 cgd return (RET_SUCCESS);
110 1.1 cgd
111 1.4 cgd /* We have to copy the key, it's not on the page. */
112 1.1 cgd if (sizeof(recno_t) > t->bt_kbufsz) {
113 1.5 cgd p = (void *)(t->bt_kbuf == NULL ?
114 1.5 cgd malloc(sizeof(recno_t)) :
115 1.5 cgd realloc(t->bt_kbuf, sizeof(recno_t)));
116 1.5 cgd if (p == NULL)
117 1.1 cgd return (RET_ERROR);
118 1.1 cgd t->bt_kbuf = p;
119 1.1 cgd t->bt_kbufsz = sizeof(recno_t);
120 1.1 cgd }
121 1.1 cgd memmove(t->bt_kbuf, &nrec, sizeof(recno_t));
122 1.1 cgd key->size = sizeof(recno_t);
123 1.1 cgd key->data = t->bt_kbuf;
124 1.1 cgd return (RET_SUCCESS);
125 1.1 cgd }
126