2 * Copyright (c) 1991, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * @(#)rec_seq.c 8.3 (Berkeley) 7/14/94
30 * $DragonFly: src/lib/libc/db/recno/rec_seq.c,v 1.4 2005/11/12 23:01:55 swildner Exp $
33 #include <sys/types.h>
44 * __REC_SEQ -- Recno sequential scan interface.
47 * dbp: pointer to access method
48 * key: key for positioning and return value
49 * data: data return value
50 * flags: R_CURSOR, R_FIRST, R_LAST, R_NEXT, R_PREV.
53 * RET_ERROR, RET_SUCCESS or RET_SPECIAL if there's no next key.
56 __rec_seq(const DB
*dbp
, DBT
*key
, DBT
*data
, u_int flags
)
65 /* Toss any page pinned across calls. */
66 if (t
->bt_pinned
!= NULL
) {
67 mpool_put(t
->bt_mp
, t
->bt_pinned
, 0);
73 if ((nrec
= *(recno_t
*)key
->data
) == 0)
77 if (F_ISSET(&t
->bt_cursor
, CURS_INIT
)) {
78 nrec
= t
->bt_cursor
.rcursor
+ 1;
86 if (F_ISSET(&t
->bt_cursor
, CURS_INIT
)) {
87 if ((nrec
= t
->bt_cursor
.rcursor
- 1) == 0)
93 if (!F_ISSET(t
, R_EOF
| R_INMEM
) &&
94 t
->bt_irec(t
, MAX_REC_NUMBER
) == RET_ERROR
)
99 einval
: errno
= EINVAL
;
103 if (t
->bt_nrecs
== 0 || nrec
> t
->bt_nrecs
) {
104 if (!F_ISSET(t
, R_EOF
| R_INMEM
) &&
105 (status
= t
->bt_irec(t
, nrec
)) != RET_SUCCESS
)
107 if (t
->bt_nrecs
== 0 || nrec
> t
->bt_nrecs
)
108 return (RET_SPECIAL
);
111 if ((e
= __rec_search(t
, nrec
- 1, SEARCH
)) == NULL
)
114 F_SET(&t
->bt_cursor
, CURS_INIT
);
115 t
->bt_cursor
.rcursor
= nrec
;
117 status
= __rec_ret(t
, e
, nrec
, key
, data
);
118 if (F_ISSET(t
, B_DB_LOCK
))
119 mpool_put(t
->bt_mp
, e
->page
, 0);
121 t
->bt_pinned
= e
->page
;