1 /*
   2  * Copyright (c) 2003, 2011, Oracle and/or its affiliates. All rights reserved.
   3  *
   4  * Redistribution and use in source and binary forms, with or without
   5  * modification, are permitted provided that the following conditions
   6  * 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 copyright
  12  *     notice, this list of conditions and the following disclaimer in the
  13  *     documentation and/or other materials provided with the distribution.
  14  *
  15  *   - Neither the name of Oracle nor the names of its
  16  *     contributors may be used to endorse or promote products derived
  17  *     from this software without specific prior written permission.
  18  *
  19  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
  20  * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
  21  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  22  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  23  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  24  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  25  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
  26  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
  27  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
  28  * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  29  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  30  */
  31 
  32 /*
  33  * This source code is provided to illustrate the usage of a given feature
  34  * or technique and has been deliberately simplified. Additional steps
  35  * required for a production-quality application, such as security checks,
  36  * input validation and proper error handling, might not be present in
  37  * this sample code.
  38  */
  39 
  40 
  41 #ifndef HPROF_TABLE_H
  42 #define HPROF_TABLE_H
  43 
  44 /* Key based generic lookup table */
  45 
  46 struct LookupTable;
  47 
  48 typedef void (*LookupTableIterator)
  49                 (TableIndex, void *key_ptr, int key_len, void*, void*);
  50 
  51 struct LookupTable * table_initialize(const char *name, int size,
  52                                 int incr, int buckets, int esize);
  53 int                  table_element_count(struct LookupTable *ltable);
  54 TableIndex           table_create_entry(struct LookupTable *ltable,
  55                                 void *key_ptr, int key_len, void *info_ptr);
  56 TableIndex           table_find_entry(struct LookupTable *ltable,
  57                                 void *key_ptr, int key_len);
  58 TableIndex           table_find_or_create_entry(struct LookupTable *ltable,
  59                                 void *key_ptr, int key_len,
  60                                 jboolean *pnew_entry, void *info_ptr);
  61 void                 table_free_entry(struct LookupTable *ltable,
  62                                 TableIndex index);
  63 void                 table_cleanup(struct LookupTable *ltable,
  64                                 LookupTableIterator func, void *arg);
  65 void                 table_walk_items(struct LookupTable *ltable,
  66                                 LookupTableIterator func, void *arg);
  67 void *               table_get_info(struct LookupTable *ltable,
  68                                 TableIndex index);
  69 void                 table_get_key(struct LookupTable *ltable,
  70                                 TableIndex index, void **pkey_ptr,
  71                                 int *pkey_len);
  72 void                 table_lock_enter(struct LookupTable *ltable);
  73 void                 table_lock_exit(struct LookupTable *ltable);
  74 
  75 #endif