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