rec_seq.c revision 1.7.2.1 1 1.7.2.1 jtc /* $NetBSD: rec_seq.c,v 1.7.2.1 1996/09/16 18:40:08 jtc Exp $ */
2 1.6 cgd
3 1.1 cgd /*-
4 1.7 cgd * Copyright (c) 1991, 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 #ifndef lint
37 1.6 cgd #if 0
38 1.7 cgd static char sccsid[] = "@(#)rec_seq.c 8.3 (Berkeley) 7/14/94";
39 1.6 cgd #else
40 1.7.2.1 jtc static char rcsid[] = "$NetBSD: rec_seq.c,v 1.7.2.1 1996/09/16 18:40:08 jtc Exp $";
41 1.6 cgd #endif
42 1.1 cgd #endif /* not lint */
43 1.1 cgd
44 1.7.2.1 jtc #include "namespace.h"
45 1.1 cgd #include <sys/types.h>
46 1.1 cgd
47 1.1 cgd #include <errno.h>
48 1.1 cgd #include <limits.h>
49 1.1 cgd #include <stdio.h>
50 1.1 cgd #include <string.h>
51 1.1 cgd
52 1.1 cgd #include <db.h>
53 1.1 cgd #include "recno.h"
54 1.1 cgd
55 1.1 cgd /*
56 1.1 cgd * __REC_SEQ -- Recno sequential scan interface.
57 1.1 cgd *
58 1.1 cgd * Parameters:
59 1.1 cgd * dbp: pointer to access method
60 1.1 cgd * key: key for positioning and return value
61 1.1 cgd * data: data return value
62 1.1 cgd * flags: R_CURSOR, R_FIRST, R_LAST, R_NEXT, R_PREV.
63 1.1 cgd *
64 1.1 cgd * Returns:
65 1.1 cgd * RET_ERROR, RET_SUCCESS or RET_SPECIAL if there's no next key.
66 1.1 cgd */
67 1.1 cgd int
68 1.1 cgd __rec_seq(dbp, key, data, flags)
69 1.1 cgd const DB *dbp;
70 1.1 cgd DBT *key, *data;
71 1.1 cgd u_int flags;
72 1.1 cgd {
73 1.1 cgd BTREE *t;
74 1.1 cgd EPG *e;
75 1.1 cgd recno_t nrec;
76 1.1 cgd int status;
77 1.1 cgd
78 1.1 cgd t = dbp->internal;
79 1.4 cgd
80 1.4 cgd /* Toss any page pinned across calls. */
81 1.4 cgd if (t->bt_pinned != NULL) {
82 1.4 cgd mpool_put(t->bt_mp, t->bt_pinned, 0);
83 1.4 cgd t->bt_pinned = NULL;
84 1.4 cgd }
85 1.4 cgd
86 1.1 cgd switch(flags) {
87 1.1 cgd case R_CURSOR:
88 1.1 cgd if ((nrec = *(recno_t *)key->data) == 0)
89 1.1 cgd goto einval;
90 1.1 cgd break;
91 1.1 cgd case R_NEXT:
92 1.7 cgd if (F_ISSET(&t->bt_cursor, CURS_INIT)) {
93 1.7 cgd nrec = t->bt_cursor.rcursor + 1;
94 1.1 cgd break;
95 1.1 cgd }
96 1.1 cgd /* FALLTHROUGH */
97 1.1 cgd case R_FIRST:
98 1.1 cgd nrec = 1;
99 1.1 cgd break;
100 1.1 cgd case R_PREV:
101 1.7 cgd if (F_ISSET(&t->bt_cursor, CURS_INIT)) {
102 1.7 cgd if ((nrec = t->bt_cursor.rcursor - 1) == 0)
103 1.1 cgd return (RET_SPECIAL);
104 1.1 cgd break;
105 1.1 cgd }
106 1.1 cgd /* FALLTHROUGH */
107 1.1 cgd case R_LAST:
108 1.7 cgd if (!F_ISSET(t, R_EOF | R_INMEM) &&
109 1.1 cgd t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
110 1.1 cgd return (RET_ERROR);
111 1.1 cgd nrec = t->bt_nrecs;
112 1.1 cgd break;
113 1.1 cgd default:
114 1.1 cgd einval: errno = EINVAL;
115 1.1 cgd return (RET_ERROR);
116 1.1 cgd }
117 1.1 cgd
118 1.1 cgd if (t->bt_nrecs == 0 || nrec > t->bt_nrecs) {
119 1.7 cgd if (!F_ISSET(t, R_EOF | R_INMEM) &&
120 1.1 cgd (status = t->bt_irec(t, nrec)) != RET_SUCCESS)
121 1.1 cgd return (status);
122 1.1 cgd if (t->bt_nrecs == 0 || nrec > t->bt_nrecs)
123 1.1 cgd return (RET_SPECIAL);
124 1.1 cgd }
125 1.1 cgd
126 1.1 cgd if ((e = __rec_search(t, nrec - 1, SEARCH)) == NULL)
127 1.1 cgd return (RET_ERROR);
128 1.1 cgd
129 1.7 cgd F_SET(&t->bt_cursor, CURS_INIT);
130 1.7 cgd t->bt_cursor.rcursor = nrec;
131 1.1 cgd
132 1.1 cgd status = __rec_ret(t, e, nrec, key, data);
133 1.7 cgd if (F_ISSET(t, B_DB_LOCK))
134 1.4 cgd mpool_put(t->bt_mp, e->page, 0);
135 1.4 cgd else
136 1.4 cgd t->bt_pinned = e->page;
137 1.1 cgd return (status);
138 1.1 cgd }
139