njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 1 | |
| 2 | /*--------------------------------------------------------------------*/ |
| 3 | /*--- OSet: a fast data structure with no dups. pub_tool_oset.h ---*/ |
| 4 | /*--------------------------------------------------------------------*/ |
| 5 | |
| 6 | /* |
| 7 | This file is part of Valgrind, a dynamic binary instrumentation |
| 8 | framework. |
| 9 | |
sewardj | 4d474d0 | 2008-02-11 11:34:59 +0000 | [diff] [blame] | 10 | Copyright (C) 2005-2008 Nicholas Nethercote |
sewardj | dff46d5 | 2006-10-17 01:40:33 +0000 | [diff] [blame] | 11 | njn@valgrind.org |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 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 | |
| 31 | #ifndef __PUB_TOOL_OSET_H |
| 32 | #define __PUB_TOOL_OSET_H |
| 33 | |
| 34 | // This module implements an ordered set, a data structure with fast |
| 35 | // (eg. amortised log(n) or better) insertion, lookup and deletion of |
| 36 | // elements. It does not allow duplicates, and will assert if you insert a |
| 37 | // duplicate to an OSet. |
| 38 | // |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 39 | // It has two interfaces. |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 40 | // |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 41 | // - The "OSetWord_" interface provides an easier-to-use interface for the |
| 42 | // case where you just want to store Word-sized values. The user provides |
| 43 | // the allocation and deallocation functions, and possibly a comparison |
| 44 | // function. |
| 45 | // |
| 46 | // - The "OSetGen_" interface provides a totally generic interface, which |
| 47 | // allows any kind of structure to be put into the set. The user provides |
| 48 | // the allocation and deallocation functions. Also, each element has a |
| 49 | // key, which the lookup is done with. The key may be the whole element |
| 50 | // (eg. in an OSet of integers, each integer serves both as an element and |
| 51 | // a key), or it may be only part of it (eg. if the key is a single field |
| 52 | // in a struct). The user can provide a function that compares an element |
| 53 | // with a key; this is very flexible, and with the right comparison |
| 54 | // function even a (non-overlapping) interval list can be created. But |
| 55 | // the cost of calling a function for every comparison can be high during |
| 56 | // lookup. If no comparison function is provided, we assume that keys are |
| 57 | // (signed or unsigned) words, and that the key is the first word in each |
| 58 | // element. This fast comparison is suitable for an OSet containing |
| 59 | // structs where the first element is an Addr, for example. |
| 60 | // |
| 61 | // Each OSet interface also has an iterator, which makes it simple to |
| 62 | // traverse all the nodes in order. Note that the iterator maintains state |
| 63 | // and so is non-reentrant. |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 64 | // |
| 65 | // Note that once you insert an element into an OSet, if you modify any part |
| 66 | // of it looked at by your cmp() function, this may cause incorrect |
| 67 | // behaviour as the sorted order maintained will be wrong. |
| 68 | |
| 69 | /*--------------------------------------------------------------------*/ |
| 70 | /*--- Types ---*/ |
| 71 | /*--------------------------------------------------------------------*/ |
| 72 | |
| 73 | typedef struct _OSet OSet; |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 74 | |
sewardj | 9bc8d9e | 2007-12-09 02:08:42 +0000 | [diff] [blame] | 75 | // - Cmp: returns -1, 0 or 1 if key is <, == or > elem. |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 76 | // - Alloc: allocates a chunk of memory. |
| 77 | // - Free: frees a chunk of memory allocated with Alloc. |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 78 | |
tom | 5a835d5 | 2007-12-30 12:28:26 +0000 | [diff] [blame] | 79 | typedef Word (*OSetCmp_t) ( const void* key, const void* elem ); |
njn | e004d72 | 2005-12-22 06:20:59 +0000 | [diff] [blame] | 80 | typedef void* (*OSetAlloc_t) ( SizeT szB ); |
| 81 | typedef void (*OSetFree_t) ( void* p ); |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 82 | |
| 83 | /*--------------------------------------------------------------------*/ |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 84 | /*--- Creating and destroying OSets (Word) ---*/ |
| 85 | /*--------------------------------------------------------------------*/ |
| 86 | |
| 87 | // * Create: allocates and initialises the OSet. Arguments: |
| 88 | // - alloc The allocation function used internally for allocating the |
| 89 | // OSet and all its nodes. |
| 90 | // - free The deallocation function used internally for freeing nodes |
| 91 | // called by VG_(OSetWord_Destroy)(). |
| 92 | // |
| 93 | // * CreateWithCmp: like Create, but you specify your own comparison |
| 94 | // function. |
| 95 | // |
| 96 | // * Destroy: frees all nodes in the table, plus the memory used by |
| 97 | // the table itself. The passed-in function is called on each node first |
| 98 | // to allow the destruction of any attached resources; if NULL it is not |
| 99 | // called. |
| 100 | |
| 101 | extern OSet* VG_(OSetWord_Create) ( OSetAlloc_t alloc, OSetFree_t free ); |
| 102 | extern void VG_(OSetWord_Destroy) ( OSet* os ); |
| 103 | |
| 104 | /*--------------------------------------------------------------------*/ |
| 105 | /*--- Operations on OSets (Word) ---*/ |
| 106 | /*--------------------------------------------------------------------*/ |
| 107 | |
| 108 | // In everything that follows, the parameter 'key' is always the *address* |
| 109 | // of the key, and 'elem' is *address* of the elem, as are the return values |
| 110 | // of the functions that return elems. |
| 111 | // |
| 112 | // * Size: The number of elements in the set. |
| 113 | // |
| 114 | // * Contains: Determines if the value is in the set. |
| 115 | // |
| 116 | // * Insert: Inserts a new element into the set. Duplicates are forbidden, |
| 117 | // and will cause assertion failures. |
| 118 | // |
| 119 | // * Remove: Removes the value from the set, if present. Returns a Bool |
| 120 | // indicating if the value was removed. |
| 121 | // |
| 122 | // * ResetIter: Each OSet has an iterator. This resets it to point to the |
| 123 | // first element in the OSet. |
| 124 | // |
| 125 | // * Next: Copies the next value according to the OSet's iterator into &val, |
| 126 | // advances the iterator by one, and returns True; the elements are |
| 127 | // visited in order. Or, returns False if the iterator has reached the |
| 128 | // set's end. |
| 129 | // |
| 130 | // You can thus iterate in order through a set like this: |
| 131 | // |
| 132 | // Word val; |
| 133 | // VG_(OSetWord_ResetIter)(oset); |
| 134 | // while ( VG_(OSetWord_Next)(oset, &val) ) { |
| 135 | // ... do stuff with 'val' ... |
| 136 | // } |
| 137 | // |
| 138 | // Note that iterators are cleared any time an element is inserted or |
| 139 | // removed from the OSet, to avoid possible mayhem caused by the iterator |
| 140 | // getting out of sync with the OSet's contents. "Cleared" means that |
| 141 | // they will return False if VG_(OSetWord_Next)() is called without an |
| 142 | // intervening call to VG_(OSetWord_ResetIter)(). |
| 143 | |
| 144 | extern Int VG_(OSetWord_Size) ( OSet* os ); |
| 145 | extern void VG_(OSetWord_Insert) ( OSet* os, Word val ); |
| 146 | extern Bool VG_(OSetWord_Contains) ( OSet* os, Word val ); |
| 147 | extern Bool VG_(OSetWord_Remove) ( OSet* os, Word val ); |
| 148 | extern void VG_(OSetWord_ResetIter) ( OSet* os ); |
| 149 | extern Bool VG_(OSetWord_Next) ( OSet* os, Word* val ); |
| 150 | |
| 151 | |
| 152 | /*--------------------------------------------------------------------*/ |
| 153 | /*--- Creating and destroying OSets and OSet members (Gen) ---*/ |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 154 | /*--------------------------------------------------------------------*/ |
| 155 | |
njn | a103e14 | 2005-11-18 21:32:18 +0000 | [diff] [blame] | 156 | // * Create: allocates and initialises the OSet. Arguments: |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 157 | // - keyOff The offset of the key within the element. |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 158 | // - cmp The comparison function between keys and elements, or NULL |
| 159 | // if the OSet should use fast comparisons. |
| 160 | // - alloc The allocation function used for allocating the OSet itself; |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 161 | // it's also called for each invocation of |
| 162 | // VG_(OSetGen_AllocNode)(). |
| 163 | // - free The deallocation function used by VG_(OSetGen_FreeNode)() and |
| 164 | // VG_(OSetGen_Destroy)(). |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 165 | // |
| 166 | // If cmp is NULL, keyOff must be zero. This is checked. |
| 167 | // |
| 168 | // * Destroy: frees all nodes in the table, plus the memory used by |
njn | e004d72 | 2005-12-22 06:20:59 +0000 | [diff] [blame] | 169 | // the table itself. The passed-in function is called on each node first |
| 170 | // to allow the destruction of any attached resources; if NULL it is not |
| 171 | // called. |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 172 | // |
| 173 | // * AllocNode: Allocate and zero memory for a node to go into the OSet. |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 174 | // Uses the alloc function given to VG_(OSetGen_Create)() to allocated a |
| 175 | // node which is big enough for both an element and the OSet metadata. |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 176 | // Not all elements in one OSet have to be the same size. |
| 177 | // |
| 178 | // Note that the element allocated will be at most word-aligned, which may |
| 179 | // be less aligned than the element type would normally be. |
| 180 | // |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 181 | // * FreeNode: Deallocate a node allocated with OSetGen_AllocNode(). Using |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 182 | // a deallocation function (such as VG_(free)()) directly will likely |
| 183 | // lead to assertions in Valgrind's allocator. |
| 184 | |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 185 | extern OSet* VG_(OSetGen_Create) ( OffT keyOff, OSetCmp_t cmp, |
| 186 | OSetAlloc_t alloc, OSetFree_t free ); |
| 187 | extern void VG_(OSetGen_Destroy) ( OSet* os ); |
| 188 | extern void* VG_(OSetGen_AllocNode) ( OSet* os, SizeT elemSize ); |
| 189 | extern void VG_(OSetGen_FreeNode) ( OSet* os, void* elem ); |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 190 | |
| 191 | /*--------------------------------------------------------------------*/ |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 192 | /*--- Operations on OSets (Gen) ---*/ |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 193 | /*--------------------------------------------------------------------*/ |
| 194 | |
njn | c438e08 | 2005-10-15 17:50:02 +0000 | [diff] [blame] | 195 | // In everything that follows, the parameter 'key' is always the *address* |
| 196 | // of the key, and 'elem' is *address* of the elem, as are the return values |
| 197 | // of the functions that return elems. |
| 198 | // |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 199 | // * Size: The number of elements in the set. |
| 200 | // |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 201 | // * Insert: Inserts a new element into the set. Note that 'elem' must |
| 202 | // have been allocated using VG_(OSetGen_AllocNode)(), otherwise you will |
| 203 | // get assertion failures about "bad magic". Duplicates are forbidden, |
| 204 | // and will also cause assertion failures. |
| 205 | // |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 206 | // * Contains: Determines if any element in the OSet matches the key. |
| 207 | // |
| 208 | // * Lookup: Returns a pointer to the element matching the key, if there is |
| 209 | // one, otherwise returns NULL. |
| 210 | // |
njn | aa260e8 | 2005-08-17 21:06:07 +0000 | [diff] [blame] | 211 | // * LookupWithCmp: Like Lookup, but you specify the comparison function, |
| 212 | // which overrides the OSet's normal one. |
| 213 | // |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 214 | // * Remove: Removes the element matching the key, if there is one. Returns |
| 215 | // NULL if no element matches the key. |
| 216 | // |
| 217 | // * ResetIter: Each OSet has an iterator. This resets it to point to the |
| 218 | // first element in the OSet. |
| 219 | // |
| 220 | // * Next: Returns a pointer to the element pointed to by the OSet's |
| 221 | // iterator, and advances the iterator by one; the elements are visited |
| 222 | // in order. Or, returns NULL if the iterator has reached the OSet's end. |
| 223 | // |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 224 | // You can thus iterate in order through a set like this: |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 225 | // |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 226 | // VG_(OSetGen_ResetIter)(oset); |
| 227 | // while ( (elem = VG_(OSetGen_Next)(oset)) ) { |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 228 | // ... do stuff with 'elem' ... |
| 229 | // } |
| 230 | // |
| 231 | // Note that iterators are cleared any time an element is inserted or |
| 232 | // removed from the OSet, to avoid possible mayhem caused by the iterator |
| 233 | // getting out of sync with the OSet's contents. "Cleared" means that |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 234 | // they will return NULL if VG_(OSetGen_Next)() is called without an |
| 235 | // intervening call to VG_(OSetGen_ResetIter)(). |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 236 | |
tom | 5a835d5 | 2007-12-30 12:28:26 +0000 | [diff] [blame] | 237 | extern Int VG_(OSetGen_Size) ( const OSet* os ); |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 238 | extern void VG_(OSetGen_Insert) ( OSet* os, void* elem ); |
tom | 5a835d5 | 2007-12-30 12:28:26 +0000 | [diff] [blame] | 239 | extern Bool VG_(OSetGen_Contains) ( const OSet* os, const void* key ); |
| 240 | extern void* VG_(OSetGen_Lookup) ( const OSet* os, const void* key ); |
| 241 | extern void* VG_(OSetGen_LookupWithCmp)( OSet* os, const void* key, OSetCmp_t cmp ); |
bart | 966f055 | 2008-02-23 19:04:44 +0000 | [diff] [blame^] | 242 | extern void* VG_(OSetGen_Remove) ( OSet* os, const void* key ); |
njn | e2a9ad3 | 2007-09-17 05:30:48 +0000 | [diff] [blame] | 243 | extern void VG_(OSetGen_ResetIter) ( OSet* os ); |
| 244 | extern void* VG_(OSetGen_Next) ( OSet* os ); |
njn | e1b2b96 | 2005-08-14 22:13:00 +0000 | [diff] [blame] | 245 | |
| 246 | #endif // __PUB_TOOL_OSET_H |
| 247 | |
| 248 | /*--------------------------------------------------------------------*/ |
| 249 | /*--- end ---*/ |
| 250 | /*--------------------------------------------------------------------*/ |