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