1*2639ae9bSBen Gras /* $NetBSD: rec_seq.c,v 1.14 2008/09/11 12:58:00 joerg Exp $ */
2*2639ae9bSBen Gras
3*2639ae9bSBen Gras /*-
4*2639ae9bSBen Gras * Copyright (c) 1991, 1993, 1994
5*2639ae9bSBen Gras * The Regents of the University of California. All rights reserved.
6*2639ae9bSBen Gras *
7*2639ae9bSBen Gras * Redistribution and use in source and binary forms, with or without
8*2639ae9bSBen Gras * modification, are permitted provided that the following conditions
9*2639ae9bSBen Gras * are met:
10*2639ae9bSBen Gras * 1. Redistributions of source code must retain the above copyright
11*2639ae9bSBen Gras * notice, this list of conditions and the following disclaimer.
12*2639ae9bSBen Gras * 2. Redistributions in binary form must reproduce the above copyright
13*2639ae9bSBen Gras * notice, this list of conditions and the following disclaimer in the
14*2639ae9bSBen Gras * documentation and/or other materials provided with the distribution.
15*2639ae9bSBen Gras * 3. Neither the name of the University nor the names of its contributors
16*2639ae9bSBen Gras * may be used to endorse or promote products derived from this software
17*2639ae9bSBen Gras * without specific prior written permission.
18*2639ae9bSBen Gras *
19*2639ae9bSBen Gras * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20*2639ae9bSBen Gras * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21*2639ae9bSBen Gras * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22*2639ae9bSBen Gras * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23*2639ae9bSBen Gras * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24*2639ae9bSBen Gras * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25*2639ae9bSBen Gras * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26*2639ae9bSBen Gras * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27*2639ae9bSBen Gras * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28*2639ae9bSBen Gras * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29*2639ae9bSBen Gras * SUCH DAMAGE.
30*2639ae9bSBen Gras */
31*2639ae9bSBen Gras
32*2639ae9bSBen Gras #if HAVE_NBTOOL_CONFIG_H
33*2639ae9bSBen Gras #include "nbtool_config.h"
34*2639ae9bSBen Gras #endif
35*2639ae9bSBen Gras
36*2639ae9bSBen Gras #include <sys/cdefs.h>
37*2639ae9bSBen Gras __RCSID("$NetBSD: rec_seq.c,v 1.14 2008/09/11 12:58:00 joerg Exp $");
38*2639ae9bSBen Gras
39*2639ae9bSBen Gras #include "namespace.h"
40*2639ae9bSBen Gras #include <sys/types.h>
41*2639ae9bSBen Gras
42*2639ae9bSBen Gras #include <assert.h>
43*2639ae9bSBen Gras #include <errno.h>
44*2639ae9bSBen Gras #include <limits.h>
45*2639ae9bSBen Gras #include <stdio.h>
46*2639ae9bSBen Gras #include <string.h>
47*2639ae9bSBen Gras
48*2639ae9bSBen Gras #include <db.h>
49*2639ae9bSBen Gras #include "recno.h"
50*2639ae9bSBen Gras
51*2639ae9bSBen Gras /*
52*2639ae9bSBen Gras * __REC_SEQ -- Recno sequential scan interface.
53*2639ae9bSBen Gras *
54*2639ae9bSBen Gras * Parameters:
55*2639ae9bSBen Gras * dbp: pointer to access method
56*2639ae9bSBen Gras * key: key for positioning and return value
57*2639ae9bSBen Gras * data: data return value
58*2639ae9bSBen Gras * flags: R_CURSOR, R_FIRST, R_LAST, R_NEXT, R_PREV.
59*2639ae9bSBen Gras *
60*2639ae9bSBen Gras * Returns:
61*2639ae9bSBen Gras * RET_ERROR, RET_SUCCESS or RET_SPECIAL if there's no next key.
62*2639ae9bSBen Gras */
63*2639ae9bSBen Gras int
__rec_seq(const DB * dbp,DBT * key,DBT * data,u_int flags)64*2639ae9bSBen Gras __rec_seq(const DB *dbp, DBT *key, DBT *data, u_int flags)
65*2639ae9bSBen Gras {
66*2639ae9bSBen Gras BTREE *t;
67*2639ae9bSBen Gras EPG *e;
68*2639ae9bSBen Gras recno_t nrec;
69*2639ae9bSBen Gras int status;
70*2639ae9bSBen Gras
71*2639ae9bSBen Gras t = dbp->internal;
72*2639ae9bSBen Gras
73*2639ae9bSBen Gras /* Toss any page pinned across calls. */
74*2639ae9bSBen Gras if (t->bt_pinned != NULL) {
75*2639ae9bSBen Gras mpool_put(t->bt_mp, t->bt_pinned, 0);
76*2639ae9bSBen Gras t->bt_pinned = NULL;
77*2639ae9bSBen Gras }
78*2639ae9bSBen Gras
79*2639ae9bSBen Gras switch(flags) {
80*2639ae9bSBen Gras case R_CURSOR:
81*2639ae9bSBen Gras if ((nrec = *(recno_t *)key->data) == 0)
82*2639ae9bSBen Gras goto einval;
83*2639ae9bSBen Gras break;
84*2639ae9bSBen Gras case R_NEXT:
85*2639ae9bSBen Gras if (F_ISSET(&t->bt_cursor, CURS_INIT)) {
86*2639ae9bSBen Gras nrec = t->bt_cursor.rcursor + 1;
87*2639ae9bSBen Gras break;
88*2639ae9bSBen Gras }
89*2639ae9bSBen Gras /* FALLTHROUGH */
90*2639ae9bSBen Gras case R_FIRST:
91*2639ae9bSBen Gras nrec = 1;
92*2639ae9bSBen Gras break;
93*2639ae9bSBen Gras case R_PREV:
94*2639ae9bSBen Gras if (F_ISSET(&t->bt_cursor, CURS_INIT)) {
95*2639ae9bSBen Gras if ((nrec = t->bt_cursor.rcursor - 1) == 0)
96*2639ae9bSBen Gras return (RET_SPECIAL);
97*2639ae9bSBen Gras break;
98*2639ae9bSBen Gras }
99*2639ae9bSBen Gras /* FALLTHROUGH */
100*2639ae9bSBen Gras case R_LAST:
101*2639ae9bSBen Gras if (!F_ISSET(t, R_EOF | R_INMEM) &&
102*2639ae9bSBen Gras t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
103*2639ae9bSBen Gras return (RET_ERROR);
104*2639ae9bSBen Gras nrec = t->bt_nrecs;
105*2639ae9bSBen Gras break;
106*2639ae9bSBen Gras default:
107*2639ae9bSBen Gras einval: errno = EINVAL;
108*2639ae9bSBen Gras return (RET_ERROR);
109*2639ae9bSBen Gras }
110*2639ae9bSBen Gras
111*2639ae9bSBen Gras if (t->bt_nrecs == 0 || nrec > t->bt_nrecs) {
112*2639ae9bSBen Gras if (!F_ISSET(t, R_EOF | R_INMEM) &&
113*2639ae9bSBen Gras (status = t->bt_irec(t, nrec)) != RET_SUCCESS)
114*2639ae9bSBen Gras return (status);
115*2639ae9bSBen Gras if (t->bt_nrecs == 0 || nrec > t->bt_nrecs)
116*2639ae9bSBen Gras return (RET_SPECIAL);
117*2639ae9bSBen Gras }
118*2639ae9bSBen Gras
119*2639ae9bSBen Gras if ((e = __rec_search(t, nrec - 1, SEARCH)) == NULL)
120*2639ae9bSBen Gras return (RET_ERROR);
121*2639ae9bSBen Gras
122*2639ae9bSBen Gras F_SET(&t->bt_cursor, CURS_INIT);
123*2639ae9bSBen Gras t->bt_cursor.rcursor = nrec;
124*2639ae9bSBen Gras
125*2639ae9bSBen Gras status = __rec_ret(t, e, nrec, key, data);
126*2639ae9bSBen Gras if (F_ISSET(t, B_DB_LOCK))
127*2639ae9bSBen Gras mpool_put(t->bt_mp, e->page, 0);
128*2639ae9bSBen Gras else
129*2639ae9bSBen Gras t->bt_pinned = e->page;
130*2639ae9bSBen Gras return (status);
131*2639ae9bSBen Gras }
132