1/* 2 * Copyright (c) 1984 through 2008, William LeFebvre 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are met: 7 * 8 * * Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 11 * * Redistributions in binary form must reproduce the above 12 * copyright notice, this list of conditions and the following disclaimer 13 * in the documentation and/or other materials provided with the 14 * distribution. 15 * 16 * * Neither the name of William LeFebvre nor the names of other 17 * contributors may be used to endorse or promote products derived from 18 * this software without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 23 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 24 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 25 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 26 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 30 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 31 */ 32 33/* hash.m4h */ 34 35/* Interface definition for hash.c */ 36 37/* The file hash.h is generated from hash.m4h via the preprocessor M4 */ 38 39#ifndef _HASH_H 40#define _HASH_H 41 42#include <sys/types.h> 43 44typedef struct pidthr_t { 45 pid_t k_pid; 46 id_t k_thr; 47} pidthr_t; 48 49typedef struct llistitem { 50 void *datum; 51 struct llistitem *next; 52} llistitem; 53 54typedef struct llist { 55 llistitem *head; 56 unsigned int count; 57} llist; 58 59typedef struct bucket { 60 llist list; 61} bucket_t; 62 63typedef struct hash_table { 64 int num_buckets; 65 bucket_t *buckets; 66} hash_table; 67 68typedef struct hash_pos { 69 int num_buckets; 70 int curr; 71 bucket_t *hash_bucket; 72 llistitem *ll_item; 73 llistitem *ll_last; 74} hash_pos; 75 76hash_table *hash_create(int num); 77void hash_sizeinfo(unsigned int *sizes, int max, hash_table *ht); 78 79define(`HASH_TYPE_TMPL', ` 80typedef struct hash_item_$1 { 81 $2 key; 82 void *value; 83} hash_item_$1; 84 85void *hash_add_$1(hash_table *ht, $2 key, void *value); 86void *hash_replace_$1(hash_table *ht, $2 key, void *value); 87void *hash_lookup_$1(hash_table *ht, $2 key); 88void *hash_remove_$1(hash_table *ht, $2 key); 89hash_item_$1 *hash_first_$1(hash_table *ht, hash_pos *pos); 90hash_item_$1 *hash_next_$1(hash_pos *pos); 91void *hash_remove_pos_$1(hash_pos *pos); 92') 93 94HASH_TYPE_TMPL(`uint', `unsigned int') 95HASH_TYPE_TMPL(`pid', `pid_t') 96HASH_TYPE_TMPL(`string', `char *') 97HASH_TYPE_TMPL(`pidthr', `pidthr_t') 98#if HAVE_LWPID_T 99HASH_TYPE_TMPL(`lwpid', `lwpid_t') 100#endif 101 102 103#endif 104