db/recno/rec_search.c

   1 /*
   2  * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
   3  *
   4  * @APPLE_LICENSE_HEADER_START@
   5  *
   6  * Copyright (c) 1999-2003 Apple Computer, Inc.  All Rights Reserved.
   7  *
   8  * This file contains Original Code and/or Modifications of Original Code
   9  * as defined in and that are subject to the Apple Public Source License
  10  * Version 2.0 (the 'License'). You may not use this file except in
  11  * compliance with the License. Please obtain a copy of the License at
  12  * http://www.opensource.apple.com/apsl/ and read it before using this
  13  * file.
  14  *
  15  * The Original Code and all software distributed under the License are
  16  * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
  17  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
  18  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
  19  * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
  20  * Please see the License for the specific language governing rights and
  21  * limitations under the License.
  22  *
  23  * @APPLE_LICENSE_HEADER_END@
  24  */
  25 /*
  26  * Copyright (c) 1990, 1993
  27  *      The Regents of the University of California.  All rights reserved.
  28  *
  29  * Redistribution and use in source and binary forms, with or without
  30  * modification, are permitted provided that the following conditions
  31  * are met:
  32  * 1. Redistributions of source code must retain the above copyright
  33  *    notice, this list of conditions and the following disclaimer.
  34  * 2. Redistributions in binary form must reproduce the above copyright
  35  *    notice, this list of conditions and the following disclaimer in the
  36  *    documentation and/or other materials provided with the distribution.
  37  * 3. All advertising materials mentioning features or use of this software
  38  *    must display the following acknowledgement:
  39  *      This product includes software developed by the University of
  40  *      California, Berkeley and its contributors.
  41  * 4. Neither the name of the University nor the names of its contributors
  42  *    may be used to endorse or promote products derived from this software
  43  *    without specific prior written permission.
  44  *
  45  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  46  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  47  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  48  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  49  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  50  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  51  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  52  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  53  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  54  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  55  * SUCH DAMAGE.
  56  */
  57
  58
  59 #include <sys/types.h>
  60
  61 #include <errno.h>
  62 #include <stdio.h>
  63
  64 #include <db.h>
  65 #include "recno.h"
  66
  67 /*
  68  * __REC_SEARCH -- Search a btree for a key.
  69  *
  70  * Parameters:
  71  *      t:      tree to search
  72  *      recno:  key to find
  73  *      op:     search operation
  74  *
  75  * Returns:
  76  *      EPG for matching record, if any, or the EPG for the location of the
  77  *      key, if it were inserted into the tree.
  78  *
  79  * Returns:
  80  *      The EPG for matching record, if any, or the EPG for the location
  81  *      of the key, if it were inserted into the tree, is entered into
  82  *      the bt_cur field of the tree.  A pointer to the field is returned.
  83  */
  84 EPG *
  85 __rec_search(t, recno, op)
  86         BTREE *t;
  87         recno_t recno;
  88         enum SRCHOP op;
  89 {
  90         register indx_t index;
  91         register PAGE *h;
  92         EPGNO *parent;
  93         RINTERNAL *r;
  94         pgno_t pg;
  95         indx_t top;
  96         recno_t total;
  97         int sverrno;
  98
  99         BT_CLR(t);
 100         for (pg = P_ROOT, total = 0;;) {
 101                 if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL)
 102                         goto err;
 103                 if (h->flags & P_RLEAF) {
 104                         t->bt_cur.page = h;
 105                         t->bt_cur.index = recno - total;
 106                         return (&t->bt_cur);
 107                 }
 108                 for (index = 0, top = NEXTINDEX(h);;) {
 109                         r = GETRINTERNAL(h, index);
 110                         if (++index == top || total + r->nrecs > recno)
 111                                 break;
 112                         total += r->nrecs;
 113                 }
 114
 115                 if (__bt_push(t, pg, index - 1) == RET_ERROR)
 116                         return (NULL);
 117
 118                 pg = r->pgno;
 119                 switch (op) {
 120                 case SDELETE:
 121                         --GETRINTERNAL(h, (index - 1))->nrecs;
 122                         mpool_put(t->bt_mp, h, MPOOL_DIRTY);
 123                         break;
 124                 case SINSERT:
 125                         ++GETRINTERNAL(h, (index - 1))->nrecs;
 126                         mpool_put(t->bt_mp, h, MPOOL_DIRTY);
 127                         break;
 128                 case SEARCH:
 129                         mpool_put(t->bt_mp, h, 0);
 130                         break;
 131                 }
 132
 133         }
 134         /* Try and recover the tree. */
 135 err:    sverrno = errno;
 136         if (op != SEARCH)
 137                 while  ((parent = BT_POP(t)) != NULL) {
 138                         if ((h = mpool_get(t->bt_mp, parent->pgno, 0)) == NULL)
 139                                 break;
 140                         if (op == SINSERT)
 141                                 --GETRINTERNAL(h, parent->index)->nrecs;
 142                         else
 143                                 ++GETRINTERNAL(h, parent->index)->nrecs;
 144                         mpool_put(t->bt_mp, h, MPOOL_DIRTY);
 145                 }
 146         errno = sverrno;
 147         return (NULL);
 148 }