cde/cde/lib/tt/mini_isam/isbtree.c

/*
 * CDE - Common Desktop Environment
 *
 * Copyright (c) 1993-2012, The Open Group. All rights reserved.
 *
 * These libraries and programs are free software; you can
 * redistribute them and/or modify them under the terms of the GNU
 * Lesser General Public License as published by the Free Software
 * Foundation; either version 2 of the License, or (at your option)
 * any later version.
 *
 * These libraries and programs are distributed in the hope that
 * they will be useful, but WITHOUT ANY WARRANTY; without even the
 * implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
 * PURPOSE. See the GNU Lesser General Public License for more
 * details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with these libraries and programs; if not, write
 * to the Free Software Foundation, Inc., 51 Franklin Street, Fifth
 * Floor, Boston, MA 02110-1301 USA
 */
/*%%  (c) Copyright 1993, 1994 Hewlett-Packard Company			 */
/*%%  (c) Copyright 1993, 1994 International Business Machines Corp.	 */
/*%%  (c) Copyright 1993, 1994 Sun Microsystems, Inc.			 */
/*%%  (c) Copyright 1993, 1994 Novell, Inc. 				 */
/*%%  $XConsortium: isbtree.c /main/3 1995/10/23 11:35:52 rswiston $ 			 				 */
#ifndef lint
    static char sccsid[] = "@(#)isbtree.c 1.4 89/07/17 Copyr 1988 Sun Micro";
#endif

/*
 * Copyright (c) 1988 by Sun Microsystems, Inc.
 */

/*
 * isbtree.c
 *
 * Description:
 *	B-tree operations: SEARCH
 *	
 */
#include <stdlib.h>

#include "isam_impl.h"

extern int _iskeycmp();

/* 
 * _isbtree_create() 
 *
 * Create a B-tree path object that will used in subsequent operations.
 */

Btree *
    _isbtree_create(Fcb *fcb, Keydesc2 *pkeydesc2)
{
    Btree	*p;
    
    p = (Btree *) _ismalloc(sizeof(*p));
    memset((char *)p, 0, sizeof(*p));
    
    p->fcb = fcb;
    p->keydesc2 = pkeydesc2;	
    
    return (p);
}


/* 
 * _isbtr_destroy() 
 *
 * Destroy B-tree path object 
 */

void
_isbtree_destroy(Btree *btree)
{
    int	i;
    
    for (i = 0; i < btree->depth;i++) {
	_isdisk_unfix(btree->bufhdr[i]);
    }
    free((char *)btree);
}


/* 
 * _isbtree_search() 
 *
 * Descend the B-tree, position pointer on or before the matched key.
 */

void
_isbtree_search( Btree *btree, char *key)
{
    Keydesc2		*pkeydesc2 = btree->keydesc2;
    Blkno		rootblkno = pkeydesc2->k2_rootnode;
    int			keylength = pkeydesc2->k2_len;
    int			index;		     /* Index to tables in btree */
    /* Has value of 1, next 2, etc. */
    int			elevation;	     /* Level - leaves have value 0 */
    char	*p;		     /* Pointer to key page */
    int			nkeys;		     /* Number of keys in the page */
    char		*key2;		     /* Equal or next lower key */
    int			curpos;		     /* index of key2 in key page */
    Blkno		blkno;
    
    /* Set comparison function. */
    _iskeycmp_set(pkeydesc2, pkeydesc2->k2_nparts + 1);	/* +1 for recno field */
    
    index = 0;
    blkno = rootblkno;
    do {
	btree->bufhdr[index] = 
	    _isdisk_fix(btree->fcb,  btree->fcb->indfd, blkno, ISFIXREAD);
	p = btree->bufhdr[index]->isb_buffer; /* pointer to buffer */
	
	/* Load some fields from the key page. */
	nkeys = ldshort(p+BT_NKEYS_OFF);     /* Number of keys in the page */
	elevation = ldshort(p+BT_LEVEL_OFF); /* Level of the page */
	
	/* Binary search in the key page to find equal or next lowere key. */
	key2 = _isbsearch(key, p+BT_KEYS_OFF, nkeys, keylength, _iskeycmp);
	
	curpos = (key2) ? ((key2 - p - BT_NKEYS_OFF) / keylength) : 0;
	
	btree->curpos[index] = 
	    (key2 == (char *)0 && elevation==0)? -1 : curpos;
	
	if (elevation > 0) 
	    blkno = ldblkno(p + ISPAGESIZE - (curpos + 1) * BLKNOSIZE);
	
	index++;
    } while (elevation > 0);
    
    btree->depth = index;
}

/* 
 * _isbtree_current() 
 *
 * Get pointer to the current key 
 */

char *
_isbtree_current(Btree *btree)
{
    int			curpos;
    
    assert(btree->depth > 0);
    if ((curpos = btree->curpos[btree->depth - 1]) == -1)
	return (NULL);
    else
	return (btree->bufhdr[btree->depth - 1]->isb_buffer 
		+ BT_KEYS_OFF + curpos * btree->keydesc2->k2_len);
}

/* 
 * _isbtree_next()
 *
 * Get pointer to the next key 
 */

char *
_isbtree_next(Btree *btree)
{
    int			curpos;
    int			depth = btree->depth;
    char	*p;
    int	level;
    Blkno		blkno;
    
    assert(depth > 0);
    
    /* 
     * Move up along the path, find first block where we can move to the right.
     */
    for (level = depth - 1; level >= 0; level--) {
	p = btree->bufhdr[level]->isb_buffer;
	
	if (btree->curpos[level] < ldshort(p + BT_NKEYS_OFF) - 1)
	    break;
    }
    
    if (level < 0) {
	/* Logical end of the index file. No next record. */
	return (NULL);
    }
    
    curpos = ++(btree->curpos[level]);
    
    while (++level < depth) {
	
	/* Get block number to block in next lower level. */
	if (level > 0)
	    blkno = ldblkno(p + ISPAGESIZE - (curpos + 1) * BLKNOSIZE);
	
	/* Unfix page in this level, fetch its right brother. */
	_isdisk_unfix(btree->bufhdr[level]);
	btree->bufhdr[level] = 
	    _isdisk_fix(btree->fcb, btree->fcb->indfd, blkno, ISFIXREAD);
	p = btree->bufhdr[level]->isb_buffer;
	
	curpos = btree->curpos[level] = 0;
    }
    
    return (p + BT_KEYS_OFF + curpos * btree->keydesc2->k2_len);
}