hash.h revision 54925bf60766fbb4f1f2d7c843721406a7b7a3fb
/*
* Copyright 2006 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#ifndef _KRB5_DB2_HASH_H
#define _KRB5_DB2_HASH_H
#pragma ident "%Z%%M% %I% %E% SMI"
#ifdef __cplusplus
extern "C" {
#endif
/*-
* Copyright (c) 1990, 1993, 1994
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Margo Seltzer.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)hash.h 8.4 (Berkeley) 11/2/95
*/
#include "mpool.h"
#include "db-queue.h"
/* Operations */
typedef enum {
} ACTION;
/* cursor structure */
typedef struct cursor_t {
u_int32_t));
void *internal;
} CURSOR;
#define IS_BUCKET(X) ((X) & BUF_BUCKET)
#define IS_VALID(X) (!((X) & BUF_INVALID))
/* Hash Table Information */
typedef struct hashhdr { /* Disk resident portion */
} HASHHDR;
typedef struct htab { /* Memory resident data structure */
const char *fname; /* File path */
* exit */
} HTAB;
/*
* Constants
*/
#define MIN_BUFFERS 6
#define MINHDRSIZE 512
#define DEF_CACHESIZE 65536
#define DEF_DIRSIZE 256
#define DEF_FFACTOR 65536
#define MIN_FFACTOR 4
#define SPLTMAX 8
#define CHARKEY "%$sniglet^&"
#define NUMKEY 1038583
#define BYTE_SHIFT 3
#define INT32_T_TO_BYTE 2
#define INT32_T_BYTE_SHIFT 5
#define ALL_CLEAR 0
#define BITS_PER_MAP 32
/* Overflow management */
/*
* Overflow page numbers are allocated per split point. At each doubling of
* the table, we can allocate extra pages. So, an overflow page number has
* the top 5 bits indicate which split point and the lower 11 bits indicate
* which page at that split point is indicated (pages within split points are
* numberered starting with 1).
*/
#define SPLITSHIFT 11
#define SPLITMASK 0x7FF
#define BUCKET_TO_PAGE(B) \
#define OADDR_TO_PAGE(B) \
#define POW2(N) (1 << (N))
/* Shorthands for accessing structure */
#define METADATA_PGNO 0
#define SPLIT_PGNO 0xFFFF
typedef struct item_info {
} ITEM_INFO;
#define ITEM_ERROR 0
#define ITEM_OK 1
#define ITEM_NO_MORE 2
#define ITEM_GET_FIRST 0
#define ITEM_GET_NEXT 1
#define ITEM_GET_RESET 2
#define ITEM_GET_DONE 3
#define ITEM_GET_N 4
#define NO_EXPAND 0xfffffffe
#ifdef __cplusplus
}
#endif
#endif /* !_KRB5_DB2_HASH_H */