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