rec_get.c revision 1.16 1 1.16 joerg /* $NetBSD: rec_get.c,v 1.16 2008/09/11 12:58:00 joerg Exp $ */
2 1.7 cgd
3 1.1 cgd /*-
4 1.6 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.12 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.16 joerg #if HAVE_NBTOOL_CONFIG_H
33 1.16 joerg #include "nbtool_config.h"
34 1.16 joerg #endif
35 1.16 joerg
36 1.9 christos #include <sys/cdefs.h>
37 1.16 joerg __RCSID("$NetBSD: rec_get.c,v 1.16 2008/09/11 12:58:00 joerg Exp $");
38 1.1 cgd
39 1.10 jtc #include "namespace.h"
40 1.1 cgd #include <sys/types.h>
41 1.1 cgd
42 1.13 christos #include <assert.h>
43 1.1 cgd #include <errno.h>
44 1.1 cgd #include <stddef.h>
45 1.1 cgd #include <stdio.h>
46 1.1 cgd #include <stdlib.h>
47 1.1 cgd #include <string.h>
48 1.1 cgd #include <unistd.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_GET -- Get a record from the btree.
55 1.1 cgd *
56 1.1 cgd * Parameters:
57 1.1 cgd * dbp: pointer to access method
58 1.1 cgd * key: key to find
59 1.1 cgd * data: data to return
60 1.1 cgd * flag: currently unused
61 1.1 cgd *
62 1.1 cgd * Returns:
63 1.1 cgd * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key not found.
64 1.1 cgd */
65 1.1 cgd int
66 1.13 christos __rec_get(const DB *dbp, const DBT *key, DBT *data, u_int flags)
67 1.1 cgd {
68 1.1 cgd BTREE *t;
69 1.1 cgd EPG *e;
70 1.1 cgd recno_t nrec;
71 1.1 cgd int status;
72 1.1 cgd
73 1.4 cgd t = dbp->internal;
74 1.4 cgd
75 1.4 cgd /* Toss any page pinned across calls. */
76 1.4 cgd if (t->bt_pinned != NULL) {
77 1.4 cgd mpool_put(t->bt_mp, t->bt_pinned, 0);
78 1.4 cgd t->bt_pinned = NULL;
79 1.4 cgd }
80 1.4 cgd
81 1.4 cgd /* Get currently doesn't take any flags, and keys of 0 are illegal. */
82 1.1 cgd if (flags || (nrec = *(recno_t *)key->data) == 0) {
83 1.1 cgd errno = EINVAL;
84 1.1 cgd return (RET_ERROR);
85 1.1 cgd }
86 1.1 cgd
87 1.1 cgd /*
88 1.1 cgd * If we haven't seen this record yet, try to find it in the
89 1.1 cgd * original file.
90 1.1 cgd */
91 1.1 cgd if (nrec > t->bt_nrecs) {
92 1.8 cgd if (F_ISSET(t, R_EOF | R_INMEM))
93 1.1 cgd return (RET_SPECIAL);
94 1.1 cgd if ((status = t->bt_irec(t, nrec)) != RET_SUCCESS)
95 1.1 cgd return (status);
96 1.1 cgd }
97 1.1 cgd
98 1.1 cgd --nrec;
99 1.1 cgd if ((e = __rec_search(t, nrec, SEARCH)) == NULL)
100 1.1 cgd return (RET_ERROR);
101 1.1 cgd
102 1.1 cgd status = __rec_ret(t, e, 0, NULL, data);
103 1.8 cgd if (F_ISSET(t, B_DB_LOCK))
104 1.4 cgd mpool_put(t->bt_mp, e->page, 0);
105 1.4 cgd else
106 1.4 cgd t->bt_pinned = e->page;
107 1.1 cgd return (status);
108 1.1 cgd }
109 1.1 cgd
110 1.1 cgd /*
111 1.1 cgd * __REC_FPIPE -- Get fixed length records from a pipe.
112 1.1 cgd *
113 1.1 cgd * Parameters:
114 1.1 cgd * t: tree
115 1.1 cgd * cnt: records to read
116 1.1 cgd *
117 1.1 cgd * Returns:
118 1.1 cgd * RET_ERROR, RET_SUCCESS
119 1.1 cgd */
120 1.1 cgd int
121 1.13 christos __rec_fpipe(BTREE *t, recno_t top)
122 1.1 cgd {
123 1.1 cgd DBT data;
124 1.1 cgd recno_t nrec;
125 1.1 cgd size_t len;
126 1.1 cgd int ch;
127 1.14 joerg uint8_t *p;
128 1.1 cgd
129 1.8 cgd if (t->bt_rdata.size < t->bt_reclen) {
130 1.8 cgd t->bt_rdata.data = t->bt_rdata.data == NULL ?
131 1.8 cgd malloc(t->bt_reclen) :
132 1.8 cgd realloc(t->bt_rdata.data, t->bt_reclen);
133 1.8 cgd if (t->bt_rdata.data == NULL)
134 1.1 cgd return (RET_ERROR);
135 1.8 cgd t->bt_rdata.size = t->bt_reclen;
136 1.1 cgd }
137 1.8 cgd data.data = t->bt_rdata.data;
138 1.5 cgd data.size = t->bt_reclen;
139 1.6 cgd
140 1.8 cgd for (nrec = t->bt_nrecs; nrec < top;) {
141 1.1 cgd len = t->bt_reclen;
142 1.8 cgd for (p = t->bt_rdata.data;; *p++ = ch)
143 1.8 cgd if ((ch = getc(t->bt_rfp)) == EOF || !--len) {
144 1.8 cgd if (ch != EOF)
145 1.8 cgd *p = ch;
146 1.8 cgd if (len != 0)
147 1.8 cgd memset(p, t->bt_bval, len);
148 1.8 cgd if (__rec_iput(t,
149 1.8 cgd nrec, &data, 0) != RET_SUCCESS)
150 1.1 cgd return (RET_ERROR);
151 1.8 cgd ++nrec;
152 1.1 cgd break;
153 1.1 cgd }
154 1.1 cgd if (ch == EOF)
155 1.1 cgd break;
156 1.1 cgd }
157 1.1 cgd if (nrec < top) {
158 1.8 cgd F_SET(t, R_EOF);
159 1.1 cgd return (RET_SPECIAL);
160 1.1 cgd }
161 1.1 cgd return (RET_SUCCESS);
162 1.1 cgd }
163 1.1 cgd
164 1.1 cgd /*
165 1.1 cgd * __REC_VPIPE -- Get variable length records from a pipe.
166 1.1 cgd *
167 1.1 cgd * Parameters:
168 1.1 cgd * t: tree
169 1.1 cgd * cnt: records to read
170 1.1 cgd *
171 1.1 cgd * Returns:
172 1.1 cgd * RET_ERROR, RET_SUCCESS
173 1.1 cgd */
174 1.1 cgd int
175 1.13 christos __rec_vpipe(BTREE *t, recno_t top)
176 1.1 cgd {
177 1.1 cgd DBT data;
178 1.1 cgd recno_t nrec;
179 1.11 aymeric ptrdiff_t len;
180 1.1 cgd size_t sz;
181 1.1 cgd int bval, ch;
182 1.14 joerg uint8_t *p;
183 1.1 cgd
184 1.1 cgd bval = t->bt_bval;
185 1.1 cgd for (nrec = t->bt_nrecs; nrec < top; ++nrec) {
186 1.8 cgd for (p = t->bt_rdata.data,
187 1.8 cgd sz = t->bt_rdata.size;; *p++ = ch, --sz) {
188 1.1 cgd if ((ch = getc(t->bt_rfp)) == EOF || ch == bval) {
189 1.8 cgd data.data = t->bt_rdata.data;
190 1.14 joerg data.size = p - (uint8_t *)t->bt_rdata.data;
191 1.1 cgd if (ch == EOF && data.size == 0)
192 1.1 cgd break;
193 1.1 cgd if (__rec_iput(t, nrec, &data, 0)
194 1.1 cgd != RET_SUCCESS)
195 1.1 cgd return (RET_ERROR);
196 1.1 cgd break;
197 1.1 cgd }
198 1.1 cgd if (sz == 0) {
199 1.14 joerg len = p - (uint8_t *)t->bt_rdata.data;
200 1.8 cgd t->bt_rdata.size += (sz = 256);
201 1.8 cgd t->bt_rdata.data = t->bt_rdata.data == NULL ?
202 1.8 cgd malloc(t->bt_rdata.size) :
203 1.8 cgd realloc(t->bt_rdata.data, t->bt_rdata.size);
204 1.8 cgd if (t->bt_rdata.data == NULL)
205 1.1 cgd return (RET_ERROR);
206 1.14 joerg p = (uint8_t *)t->bt_rdata.data + len;
207 1.1 cgd }
208 1.1 cgd }
209 1.1 cgd if (ch == EOF)
210 1.1 cgd break;
211 1.1 cgd }
212 1.1 cgd if (nrec < top) {
213 1.8 cgd F_SET(t, R_EOF);
214 1.1 cgd return (RET_SPECIAL);
215 1.1 cgd }
216 1.1 cgd return (RET_SUCCESS);
217 1.1 cgd }
218 1.1 cgd
219 1.1 cgd /*
220 1.1 cgd * __REC_FMAP -- Get fixed length records from a file.
221 1.1 cgd *
222 1.1 cgd * Parameters:
223 1.1 cgd * t: tree
224 1.1 cgd * cnt: records to read
225 1.1 cgd *
226 1.1 cgd * Returns:
227 1.1 cgd * RET_ERROR, RET_SUCCESS
228 1.1 cgd */
229 1.1 cgd int
230 1.13 christos __rec_fmap(BTREE *t, recno_t top)
231 1.1 cgd {
232 1.1 cgd DBT data;
233 1.1 cgd recno_t nrec;
234 1.14 joerg uint8_t *sp, *ep, *p;
235 1.1 cgd size_t len;
236 1.1 cgd
237 1.8 cgd if (t->bt_rdata.size < t->bt_reclen) {
238 1.8 cgd t->bt_rdata.data = t->bt_rdata.data == NULL ?
239 1.8 cgd malloc(t->bt_reclen) :
240 1.8 cgd realloc(t->bt_rdata.data, t->bt_reclen);
241 1.8 cgd if (t->bt_rdata.data == NULL)
242 1.1 cgd return (RET_ERROR);
243 1.8 cgd t->bt_rdata.size = t->bt_reclen;
244 1.1 cgd }
245 1.8 cgd data.data = t->bt_rdata.data;
246 1.6 cgd data.size = t->bt_reclen;
247 1.6 cgd
248 1.14 joerg sp = (uint8_t *)t->bt_cmap;
249 1.14 joerg ep = (uint8_t *)t->bt_emap;
250 1.1 cgd for (nrec = t->bt_nrecs; nrec < top; ++nrec) {
251 1.1 cgd if (sp >= ep) {
252 1.8 cgd F_SET(t, R_EOF);
253 1.1 cgd return (RET_SPECIAL);
254 1.1 cgd }
255 1.1 cgd len = t->bt_reclen;
256 1.8 cgd for (p = t->bt_rdata.data;
257 1.8 cgd sp < ep && len > 0; *p++ = *sp++, --len);
258 1.8 cgd if (len != 0)
259 1.8 cgd memset(p, t->bt_bval, len);
260 1.1 cgd if (__rec_iput(t, nrec, &data, 0) != RET_SUCCESS)
261 1.1 cgd return (RET_ERROR);
262 1.1 cgd }
263 1.8 cgd t->bt_cmap = (caddr_t)sp;
264 1.1 cgd return (RET_SUCCESS);
265 1.1 cgd }
266 1.1 cgd
267 1.1 cgd /*
268 1.1 cgd * __REC_VMAP -- Get variable length records from a file.
269 1.1 cgd *
270 1.1 cgd * Parameters:
271 1.1 cgd * t: tree
272 1.1 cgd * cnt: records to read
273 1.1 cgd *
274 1.1 cgd * Returns:
275 1.1 cgd * RET_ERROR, RET_SUCCESS
276 1.1 cgd */
277 1.1 cgd int
278 1.13 christos __rec_vmap(BTREE *t, recno_t top)
279 1.1 cgd {
280 1.1 cgd DBT data;
281 1.14 joerg uint8_t *sp, *ep;
282 1.1 cgd recno_t nrec;
283 1.1 cgd int bval;
284 1.1 cgd
285 1.14 joerg sp = (uint8_t *)t->bt_cmap;
286 1.14 joerg ep = (uint8_t *)t->bt_emap;
287 1.1 cgd bval = t->bt_bval;
288 1.1 cgd
289 1.1 cgd for (nrec = t->bt_nrecs; nrec < top; ++nrec) {
290 1.1 cgd if (sp >= ep) {
291 1.8 cgd F_SET(t, R_EOF);
292 1.1 cgd return (RET_SPECIAL);
293 1.1 cgd }
294 1.1 cgd for (data.data = sp; sp < ep && *sp != bval; ++sp);
295 1.14 joerg data.size = sp - (uint8_t *)data.data;
296 1.1 cgd if (__rec_iput(t, nrec, &data, 0) != RET_SUCCESS)
297 1.1 cgd return (RET_ERROR);
298 1.1 cgd ++sp;
299 1.1 cgd }
300 1.8 cgd t->bt_cmap = (caddr_t)sp;
301 1.1 cgd return (RET_SUCCESS);
302 1.1 cgd }
303