/*
 * Please do not edit this file.
 * It was generated using rpcgen.
 */

#ifndef _DB_INDEX_ENTRY_C_H_RPCGEN
#define	_DB_INDEX_ENTRY_C_H_RPCGEN

#include <rpc/rpc.h>
#pragma ident	"%Z%%M%	%I%	%E% SMI"
#ifndef _DB_INDEX_ENTRY_H
#define _DB_INDEX_ENTRY_H

 /* db_index_entry is an entry in the hashtable.  db_index_entries can be
    linked in one of two ways:
    * via the 'next' pointer and form the hash bucket
    * via the 'nextresult' pointer and form a chain of results.
    Each entry contains the key, the hash value of key, and location
    information  'entryp'
    entryp is location information.
    It might be pointer to an in core entry, or an indirect pointer
    identifying the location of an entry somewhere in memory (e.g.
    if there was a table where all complete entries are stored) --- this
    is desirable, for example, for XDR operations on a multi-indexed table;
    or, if used in conjunction with NetISAM, it may be the record number. */
/* *** notes */
/* remember to set next_result to null first if using XDR. */
#include "db_item_c.h"
#include "db_table_c.h"   /* contains definition of entryp */
typedef void *nullptr;

struct db_index_entry {
	u_long hashval;
	item *key;
	entryp location;
	struct db_index_entry *next;
	nullptr next_result;
};
typedef struct db_index_entry db_index_entry;

typedef db_index_entry *db_index_entry_p;
#endif /* _DB_INDEX_ENTRY_H */

/* the xdr functions */
extern bool_t xdr_db_index_entry();
extern bool_t xdr_db_index_entry_p();

#endif /* !_DB_INDEX_ENTRY_C_H_RPCGEN */