njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 1 | |
| 2 | /*--------------------------------------------------------------------*/ |
njn | 81c00df | 2005-05-14 21:28:43 +0000 | [diff] [blame] | 3 | /*--- A separately chained hash table. m_hashtable.c ---*/ |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 4 | /*--------------------------------------------------------------------*/ |
| 5 | |
| 6 | /* |
njn | b9c427c | 2004-12-01 14:14:42 +0000 | [diff] [blame] | 7 | This file is part of Valgrind, a dynamic binary instrumentation |
| 8 | framework. |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 9 | |
njn | 5361242 | 2005-03-12 16:22:54 +0000 | [diff] [blame] | 10 | Copyright (C) 2000-2005 Julian Seward |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 11 | jseward@acm.org |
| 12 | |
| 13 | This program is free software; you can redistribute it and/or |
| 14 | modify it under the terms of the GNU General Public License as |
| 15 | published by the Free Software Foundation; either version 2 of the |
| 16 | License, or (at your option) any later version. |
| 17 | |
| 18 | This program is distributed in the hope that it will be useful, but |
| 19 | WITHOUT ANY WARRANTY; without even the implied warranty of |
| 20 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 21 | General Public License for more details. |
| 22 | |
| 23 | You should have received a copy of the GNU General Public License |
| 24 | along with this program; if not, write to the Free Software |
| 25 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA |
| 26 | 02111-1307, USA. |
| 27 | |
| 28 | The GNU General Public License is contained in the file COPYING. |
| 29 | */ |
| 30 | |
nethercote | f1e5e15 | 2004-09-01 23:58:16 +0000 | [diff] [blame] | 31 | #include "core.h" |
njn | 81c00df | 2005-05-14 21:28:43 +0000 | [diff] [blame] | 32 | #include "pub_core_hashtable.h" |
njn | 132bfcc | 2005-06-04 19:16:06 +0000 | [diff] [blame] | 33 | #include "pub_core_libcassert.h" |
njn | af1d7df | 2005-06-11 01:31:52 +0000 | [diff] [blame] | 34 | #include "pub_core_mallocfree.h" |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 35 | |
| 36 | /*--------------------------------------------------------------------*/ |
| 37 | /*--- Declarations ---*/ |
| 38 | /*--------------------------------------------------------------------*/ |
| 39 | |
| 40 | /* Holds malloc'd but not freed blocks. Static, so zero-inited by default. */ |
| 41 | |
sewardj | b326a1a | 2005-05-17 02:20:35 +0000 | [diff] [blame] | 42 | #define VG_N_CHAINS 80021 /*4999*/ /* a prime number */ |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 43 | |
nethercote | 50397c2 | 2004-11-04 18:03:06 +0000 | [diff] [blame] | 44 | #define VG_CHAIN_NO(aa) (((UWord)(aa)) % VG_N_CHAINS) |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 45 | |
| 46 | /*--------------------------------------------------------------------*/ |
| 47 | /*--- Functions ---*/ |
| 48 | /*--------------------------------------------------------------------*/ |
| 49 | |
| 50 | VgHashTable VG_(HT_construct)(void) |
| 51 | { |
njn | ce46c2a | 2003-07-21 10:52:07 +0000 | [diff] [blame] | 52 | /* Initialises to zero, ie. all entries NULL */ |
njn | 84d669f | 2003-07-21 11:42:27 +0000 | [diff] [blame] | 53 | return VG_(calloc)(VG_N_CHAINS, sizeof(VgHashNode*)); |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 54 | } |
| 55 | |
| 56 | Int VG_(HT_count_nodes) ( VgHashTable table ) |
| 57 | { |
| 58 | VgHashNode* node; |
| 59 | UInt chain; |
| 60 | Int n = 0; |
| 61 | |
| 62 | for (chain = 0; chain < VG_N_CHAINS; chain++) |
| 63 | for (node = table[chain]; node != NULL; node = node->next) |
| 64 | n++; |
| 65 | return n; |
| 66 | } |
| 67 | |
| 68 | /* Puts a new, heap allocated VgHashNode, into the malloclist. */ |
| 69 | void VG_(HT_add_node) ( VgHashTable table, VgHashNode* node ) |
| 70 | { |
| 71 | UInt chain = VG_CHAIN_NO(node->key); |
| 72 | node->next = table[chain]; |
| 73 | table[chain] = node; |
| 74 | } |
| 75 | |
| 76 | /* Looks up a VgHashNode in the table. Also returns the address of |
njn | 02bc4b8 | 2005-05-15 17:28:26 +0000 | [diff] [blame] | 77 | the previous node's 'next' pointer which allows it to be removed from the |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 78 | list later without having to look it up again. */ |
nethercote | 3d6b611 | 2004-11-04 16:39:43 +0000 | [diff] [blame] | 79 | VgHashNode* VG_(HT_get_node) ( VgHashTable table, UWord key, |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 80 | /*OUT*/VgHashNode*** next_ptr ) |
| 81 | { |
| 82 | VgHashNode *prev, *curr; |
| 83 | Int chain; |
| 84 | |
| 85 | chain = VG_CHAIN_NO(key); |
| 86 | |
| 87 | prev = NULL; |
| 88 | curr = table[chain]; |
| 89 | while (True) { |
| 90 | if (curr == NULL) |
| 91 | break; |
| 92 | if (key == curr->key) |
| 93 | break; |
| 94 | prev = curr; |
| 95 | curr = curr->next; |
| 96 | } |
| 97 | |
| 98 | if (NULL == prev) |
| 99 | *next_ptr = & table[chain]; |
| 100 | else |
| 101 | *next_ptr = & prev->next; |
| 102 | |
| 103 | return curr; |
| 104 | } |
| 105 | |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 106 | /* Allocates a suitably-sized array, copies all the malloc'd block |
njn | 06072ec | 2003-09-30 15:35:13 +0000 | [diff] [blame] | 107 | shadows into it, then returns both the array and the size of it. This is |
| 108 | used by the memory-leak detector. |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 109 | */ |
njn | 06072ec | 2003-09-30 15:35:13 +0000 | [diff] [blame] | 110 | VgHashNode** VG_(HT_to_array) ( VgHashTable table, /*OUT*/ UInt* n_shadows ) |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 111 | { |
| 112 | UInt i, j; |
| 113 | VgHashNode** arr; |
| 114 | VgHashNode* node; |
| 115 | |
| 116 | *n_shadows = 0; |
| 117 | for (i = 0; i < VG_N_CHAINS; i++) { |
| 118 | for (node = table[i]; node != NULL; node = node->next) { |
| 119 | (*n_shadows)++; |
| 120 | } |
| 121 | } |
| 122 | if (*n_shadows == 0) |
| 123 | return NULL; |
| 124 | |
| 125 | arr = VG_(malloc)( *n_shadows * sizeof(VgHashNode*) ); |
| 126 | |
| 127 | j = 0; |
| 128 | for (i = 0; i < VG_N_CHAINS; i++) { |
| 129 | for (node = table[i]; node != NULL; node = node->next) { |
| 130 | arr[j++] = node; |
| 131 | } |
| 132 | } |
njn | 8372b7f | 2003-05-14 12:42:14 +0000 | [diff] [blame] | 133 | vg_assert(j == *n_shadows); |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 134 | |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 135 | return arr; |
| 136 | } |
| 137 | |
| 138 | /* Return the first VgHashNode satisfying the predicate p. */ |
thughes | 4ad52d0 | 2004-06-27 17:37:21 +0000 | [diff] [blame] | 139 | VgHashNode* VG_(HT_first_match) ( VgHashTable table, |
| 140 | Bool (*p) ( VgHashNode*, void* ), |
| 141 | void* d ) |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 142 | { |
| 143 | UInt i; |
| 144 | VgHashNode* node; |
| 145 | |
| 146 | for (i = 0; i < VG_N_CHAINS; i++) |
| 147 | for (node = table[i]; node != NULL; node = node->next) |
thughes | 4ad52d0 | 2004-06-27 17:37:21 +0000 | [diff] [blame] | 148 | if ( p(node, d) ) |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 149 | return node; |
| 150 | |
| 151 | return NULL; |
| 152 | } |
| 153 | |
thughes | 4ad52d0 | 2004-06-27 17:37:21 +0000 | [diff] [blame] | 154 | void VG_(HT_apply_to_all_nodes)( VgHashTable table, |
| 155 | void (*f)(VgHashNode*, void*), |
| 156 | void* d ) |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 157 | { |
| 158 | UInt i; |
| 159 | VgHashNode* node; |
| 160 | |
| 161 | for (i = 0; i < VG_N_CHAINS; i++) { |
| 162 | for (node = table[i]; node != NULL; node = node->next) { |
thughes | 4ad52d0 | 2004-06-27 17:37:21 +0000 | [diff] [blame] | 163 | f(node, d); |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 164 | } |
| 165 | } |
| 166 | } |
| 167 | |
| 168 | void VG_(HT_destruct)(VgHashTable table) |
| 169 | { |
| 170 | UInt i; |
| 171 | VgHashNode* node; |
| 172 | |
| 173 | for (i = 0; i < VG_N_CHAINS; i++) { |
| 174 | for (node = table[i]; node != NULL; node = node->next) { |
| 175 | VG_(free)(node); |
| 176 | } |
| 177 | } |
| 178 | VG_(free)(table); |
| 179 | } |
| 180 | |
| 181 | /*--------------------------------------------------------------------*/ |
njn | 81c00df | 2005-05-14 21:28:43 +0000 | [diff] [blame] | 182 | /*--- end ---*/ |
njn | 3e88418 | 2003-04-15 13:03:23 +0000 | [diff] [blame] | 183 | /*--------------------------------------------------------------------*/ |