sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 1 | /* |
| 2 | This file is part of drd, a data race detector. |
| 3 | |
sewardj | 8564292 | 2008-01-14 11:54:56 +0000 | [diff] [blame] | 4 | Copyright (C) 2006-2008 Bart Van Assche |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 5 | bart.vanassche@gmail.com |
| 6 | |
| 7 | This program is free software; you can redistribute it and/or |
| 8 | modify it under the terms of the GNU General Public License as |
| 9 | published by the Free Software Foundation; either version 2 of the |
| 10 | License, or (at your option) any later version. |
| 11 | |
| 12 | This program is distributed in the hope that it will be useful, but |
| 13 | WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 15 | General Public License for more details. |
| 16 | |
| 17 | You should have received a copy of the GNU General Public License |
| 18 | along with this program; if not, write to the Free Software |
| 19 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA |
| 20 | 02111-1307, USA. |
| 21 | |
| 22 | The GNU General Public License is contained in the file COPYING. |
| 23 | */ |
| 24 | |
| 25 | |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 26 | #ifndef __DRD_BITMAP_H |
| 27 | #define __DRD_BITMAP_H |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 28 | |
| 29 | |
| 30 | #include "pub_tool_oset.h" |
| 31 | |
| 32 | |
| 33 | /* |
| 34 | Bitmap representation. A bitmap is a data structure in which two bits are |
| 35 | reserved per 32 bit address: one bit that indicates that the data at the |
| 36 | specified address has been read, and one bit that indicates that the data has |
| 37 | been written to. |
| 38 | */ |
| 39 | |
| 40 | |
| 41 | /* Macro definitions. */ |
| 42 | |
bart | f587d04 | 2008-03-15 14:30:20 +0000 | [diff] [blame] | 43 | #define ADDR0_BITS 16 |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 44 | |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 45 | #define ADDR0_COUNT ((UWord)1 << ADDR0_BITS) |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 46 | |
| 47 | #define ADDR0_MASK (ADDR0_COUNT - 1) |
| 48 | |
bart | 0268dfa | 2008-03-11 20:10:21 +0000 | [diff] [blame] | 49 | #define SPLIT_ADDRESS(a) \ |
| 50 | UWord a##0 = ((a) & ADDR0_MASK); \ |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 51 | UWord a##1 = ((a) >> ADDR0_BITS); |
| 52 | |
| 53 | // Assumption: sizeof(Addr) == sizeof(UWord). |
bart | 0268dfa | 2008-03-11 20:10:21 +0000 | [diff] [blame] | 54 | #define MAKE_ADDRESS(a1, a0) \ |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 55 | (Addr)(((UWord)(a1) << (ADDR0_BITS)) | ((UWord)(a0))) |
| 56 | |
| 57 | #define BITS_PER_UWORD (8UL*sizeof(UWord)) |
| 58 | #if defined(VGA_x86) || defined(VGA_ppc32) |
| 59 | #define BITS_PER_BITS_PER_UWORD 5 |
| 60 | #elif defined(VGA_amd64) || defined(VGA_ppc64) |
| 61 | #define BITS_PER_BITS_PER_UWORD 6 |
| 62 | #else |
| 63 | #error Unknown platform. |
| 64 | #endif |
| 65 | |
| 66 | #define BITMAP1_UWORD_COUNT (ADDR0_COUNT >> BITS_PER_BITS_PER_UWORD) |
| 67 | |
| 68 | /* Highest bits of an address that fit into the same UWord of bm0[]. */ |
| 69 | #define UWORD_MSB(a) ((a) & ~(BITS_PER_UWORD - 1)) |
| 70 | |
| 71 | /* Lowest bits of an address that fit into the same UWord of bm0[]. */ |
| 72 | #define UWORD_LSB(a) ((a) & (BITS_PER_UWORD - 1)) |
| 73 | |
| 74 | /* Highest address that fits in the same UWord as a. */ |
| 75 | #define UWORD_HIGHEST_ADDRESS(a) ((a) | (BITS_PER_UWORD - 1)) |
| 76 | |
| 77 | |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 78 | /* Local variables. */ |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 79 | |
| 80 | static ULong s_bitmap2_creation_count; |
bart | 588d90f | 2008-04-06 13:05:58 +0000 | [diff] [blame] | 81 | static ULong s_node_creation_count; |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 82 | |
| 83 | |
bart | 0008f5b | 2008-03-22 17:07:39 +0000 | [diff] [blame] | 84 | |
| 85 | /*********************************************************************/ |
| 86 | /* Functions for manipulating a struct bitmap1. */ |
| 87 | /*********************************************************************/ |
| 88 | |
| 89 | |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 90 | /* Lowest level, corresponding to the lowest ADDR0_BITS of an address. */ |
| 91 | struct bitmap1 |
| 92 | { |
| 93 | UWord bm0_r[BITMAP1_UWORD_COUNT]; |
| 94 | UWord bm0_w[BITMAP1_UWORD_COUNT]; |
| 95 | }; |
| 96 | |
| 97 | static __inline__ UWord bm0_mask(const Addr a) |
| 98 | { |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 99 | return ((UWord)1 << UWORD_LSB(a)); |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 100 | } |
| 101 | |
| 102 | static __inline__ void bm0_set(UWord* bm0, const Addr a) |
| 103 | { |
| 104 | //tl_assert(a < ADDR0_COUNT); |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 105 | bm0[a >> BITS_PER_BITS_PER_UWORD] |= (UWord)1 << UWORD_LSB(a); |
| 106 | } |
| 107 | |
bart | f8bc71d | 2008-03-15 11:42:34 +0000 | [diff] [blame] | 108 | /** Set all of the addresses in range [ a1 .. a1 + size [ in bitmap bm0. */ |
| 109 | static __inline__ void bm0_set_range(UWord* bm0, |
| 110 | const Addr a1, const SizeT size) |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 111 | { |
| 112 | #if 0 |
| 113 | tl_assert(a1 < ADDR0_COUNT); |
bart | f8bc71d | 2008-03-15 11:42:34 +0000 | [diff] [blame] | 114 | tl_assert(size > 0); |
| 115 | tl_assert(a1 + size <= ADDR0_COUNT); |
| 116 | tl_assert(UWORD_MSB(a1) == UWORD_MSB(a1 + size - 1)); |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 117 | #endif |
| 118 | bm0[a1 >> BITS_PER_BITS_PER_UWORD] |
bart | f8bc71d | 2008-03-15 11:42:34 +0000 | [diff] [blame] | 119 | |= (((UWord)1 << size) - 1) << UWORD_LSB(a1); |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 120 | } |
| 121 | |
| 122 | static __inline__ void bm0_clear(UWord* bm0, const Addr a) |
| 123 | { |
| 124 | //tl_assert(a < ADDR0_COUNT); |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 125 | bm0[a >> BITS_PER_BITS_PER_UWORD] &= ~((UWord)1 << UWORD_LSB(a)); |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 126 | } |
| 127 | |
bart | 5955f33 | 2008-03-25 17:19:20 +0000 | [diff] [blame] | 128 | /** Clear all of the addresses in range [ a1 .. a1 + size [ in bitmap bm0. */ |
| 129 | static __inline__ void bm0_clear_range(UWord* bm0, |
| 130 | const Addr a1, const SizeT size) |
| 131 | { |
| 132 | #if 0 |
| 133 | tl_assert(a1 < ADDR0_COUNT); |
| 134 | tl_assert(size > 0); |
| 135 | tl_assert(a1 + size <= ADDR0_COUNT); |
| 136 | tl_assert(UWORD_MSB(a1) == UWORD_MSB(a1 + size - 1)); |
| 137 | #endif |
| 138 | bm0[a1 >> BITS_PER_BITS_PER_UWORD] |
| 139 | &= ~(((UWord)1 << size) - 1) << UWORD_LSB(a1); |
| 140 | } |
| 141 | |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 142 | static __inline__ UWord bm0_is_set(const UWord* bm0, const Addr a) |
| 143 | { |
| 144 | //tl_assert(a < ADDR0_COUNT); |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 145 | return (bm0[a >> BITS_PER_BITS_PER_UWORD] & ((UWord)1 << UWORD_LSB(a))); |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 146 | } |
| 147 | |
bart | f8bc71d | 2008-03-15 11:42:34 +0000 | [diff] [blame] | 148 | /** Return true if any of the bits [ a1 .. a1+size [ are set in bm0. */ |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 149 | static __inline__ UWord bm0_is_any_set(const UWord* bm0, |
bart | f8bc71d | 2008-03-15 11:42:34 +0000 | [diff] [blame] | 150 | const Addr a1, const SizeT size) |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 151 | { |
| 152 | #if 0 |
| 153 | tl_assert(a1 < ADDR0_COUNT); |
bart | f8bc71d | 2008-03-15 11:42:34 +0000 | [diff] [blame] | 154 | tl_assert(size > 0); |
| 155 | tl_assert(a1 + size <= ADDR0_COUNT); |
| 156 | tl_assert(UWORD_MSB(a1) == UWORD_MSB(a1 + size - 1)); |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 157 | #endif |
| 158 | return (bm0[a1 >> BITS_PER_BITS_PER_UWORD] |
bart | f8bc71d | 2008-03-15 11:42:34 +0000 | [diff] [blame] | 159 | & ((((UWord)1 << size) - 1) << UWORD_LSB(a1))); |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 160 | } |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 161 | |
bart | adbdf14 | 2008-03-19 17:00:12 +0000 | [diff] [blame] | 162 | |
bart | 0008f5b | 2008-03-22 17:07:39 +0000 | [diff] [blame] | 163 | |
| 164 | /*********************************************************************/ |
| 165 | /* Functions for manipulating a struct bitmap. */ |
bart | adbdf14 | 2008-03-19 17:00:12 +0000 | [diff] [blame] | 166 | /*********************************************************************/ |
| 167 | |
| 168 | |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 169 | /* Second level bitmap. */ |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 170 | struct bitmap2 |
| 171 | { |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 172 | Addr addr; ///< address >> ADDR0_BITS |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 173 | int refcnt; |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 174 | struct bitmap1 bm1; |
| 175 | }; |
| 176 | |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 177 | /* One node of bitmap::oset. */ |
| 178 | struct bitmap2ref |
| 179 | { |
| 180 | Addr addr; ///< address >> ADDR0_BITS |
| 181 | struct bitmap2* bm2; |
| 182 | }; |
| 183 | |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 184 | struct bm_cache_elem |
| 185 | { |
| 186 | Addr a1; |
| 187 | struct bitmap2* bm2; |
| 188 | }; |
| 189 | |
| 190 | #define N_CACHE_ELEM 4 |
| 191 | |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 192 | /* Complete bitmap. */ |
| 193 | struct bitmap |
| 194 | { |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 195 | struct bm_cache_elem cache[N_CACHE_ELEM]; |
| 196 | OSet* oset; |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 197 | }; |
| 198 | |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 199 | |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 200 | static struct bitmap2* bm2_new(const UWord a1); |
| 201 | static struct bitmap2* bm2_make_exclusive(struct bitmap* const bm, |
| 202 | struct bitmap2ref* const bm2ref); |
| 203 | |
| 204 | |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 205 | static __inline__ |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 206 | Bool bm_cache_lookup(const struct bitmap* const bm, const UWord a1, |
| 207 | struct bitmap2** bm2) |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 208 | { |
| 209 | tl_assert(bm); |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 210 | tl_assert(bm2); |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 211 | |
| 212 | #if N_CACHE_ELEM > 8 |
| 213 | #error Please update the code below. |
| 214 | #endif |
| 215 | #if N_CACHE_ELEM >= 1 |
| 216 | if (a1 == bm->cache[0].a1) |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 217 | { |
| 218 | *bm2 = bm->cache[0].bm2; |
| 219 | return True; |
| 220 | } |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 221 | #endif |
| 222 | #if N_CACHE_ELEM >= 2 |
| 223 | if (a1 == bm->cache[1].a1) |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 224 | { |
| 225 | *bm2 = bm->cache[1].bm2; |
| 226 | return True; |
| 227 | } |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 228 | #endif |
| 229 | #if N_CACHE_ELEM >= 3 |
| 230 | if (a1 == bm->cache[2].a1) |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 231 | { |
| 232 | *bm2 = bm->cache[2].bm2; |
| 233 | return True; |
| 234 | } |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 235 | #endif |
| 236 | #if N_CACHE_ELEM >= 4 |
| 237 | if (a1 == bm->cache[3].a1) |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 238 | { |
| 239 | *bm2 = bm->cache[3].bm2; |
| 240 | return True; |
| 241 | } |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 242 | #endif |
| 243 | #if N_CACHE_ELEM >= 5 |
| 244 | if (a1 == bm->cache[4].a1) |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 245 | { |
| 246 | *bm2 = bm->cache[4].bm2; |
| 247 | return True; |
| 248 | } |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 249 | #endif |
| 250 | #if N_CACHE_ELEM >= 6 |
| 251 | if (a1 == bm->cache[5].a1) |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 252 | { |
| 253 | *bm2 = bm->cache[5].bm2; |
| 254 | return True; |
| 255 | } |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 256 | #endif |
| 257 | #if N_CACHE_ELEM >= 7 |
| 258 | if (a1 == bm->cache[6].a1) |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 259 | { |
| 260 | *bm2 = bm->cache[6].bm2; |
| 261 | return True; |
| 262 | } |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 263 | #endif |
| 264 | #if N_CACHE_ELEM >= 8 |
| 265 | if (a1 == bm->cache[7].a1) |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 266 | { |
| 267 | *bm2 = bm->cache[7].bm2; |
| 268 | return True; |
| 269 | } |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 270 | #endif |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 271 | *bm2 = 0; |
| 272 | return False; |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 273 | } |
| 274 | |
| 275 | static __inline__ |
| 276 | void bm_update_cache(struct bitmap* const bm, |
| 277 | const UWord a1, |
| 278 | struct bitmap2* const bm2) |
| 279 | { |
| 280 | tl_assert(bm); |
| 281 | |
| 282 | #if N_CACHE_ELEM > 8 |
| 283 | #error Please update the code below. |
| 284 | #endif |
| 285 | #if N_CACHE_ELEM >= 8 |
| 286 | bm->cache[7] = bm->cache[6]; |
| 287 | #endif |
| 288 | #if N_CACHE_ELEM >= 7 |
| 289 | bm->cache[6] = bm->cache[5]; |
| 290 | #endif |
| 291 | #if N_CACHE_ELEM >= 6 |
| 292 | bm->cache[5] = bm->cache[4]; |
| 293 | #endif |
| 294 | #if N_CACHE_ELEM >= 5 |
| 295 | bm->cache[4] = bm->cache[3]; |
| 296 | #endif |
| 297 | #if N_CACHE_ELEM >= 4 |
| 298 | bm->cache[3] = bm->cache[2]; |
| 299 | #endif |
| 300 | #if N_CACHE_ELEM >= 3 |
| 301 | bm->cache[2] = bm->cache[1]; |
| 302 | #endif |
| 303 | #if N_CACHE_ELEM >= 2 |
| 304 | bm->cache[1] = bm->cache[0]; |
| 305 | #endif |
| 306 | bm->cache[0].a1 = a1; |
| 307 | bm->cache[0].bm2 = bm2; |
| 308 | } |
| 309 | |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 310 | /** Look up the address a1 in bitmap bm and return a pointer to a potentially |
| 311 | * shared second level bitmap. The bitmap where the returned pointer points |
| 312 | * at may not be modified by the caller. |
| 313 | * |
bart | 0008f5b | 2008-03-22 17:07:39 +0000 | [diff] [blame] | 314 | * @param a1 client address shifted right by ADDR0_BITS. |
| 315 | * @param bm bitmap pointer. |
| 316 | */ |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 317 | static __inline__ |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 318 | const struct bitmap2* bm2_lookup(const struct bitmap* const bm, const UWord a1) |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 319 | { |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 320 | struct bitmap2* bm2; |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 321 | struct bitmap2ref* bm2ref; |
| 322 | |
| 323 | tl_assert(bm); |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 324 | if (! bm_cache_lookup(bm, a1, &bm2)) |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 325 | { |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 326 | bm2ref = VG_(OSetGen_Lookup)(bm->oset, &a1); |
| 327 | if (bm2ref) |
| 328 | { |
| 329 | bm2 = bm2ref->bm2; |
| 330 | } |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 331 | bm_update_cache(*(struct bitmap**)&bm, a1, bm2); |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 332 | } |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 333 | return bm2; |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 334 | } |
| 335 | |
| 336 | /** Look up the address a1 in bitmap bm and return a pointer to a second |
| 337 | * level bitmap that is not shared and hence may be modified. |
| 338 | * |
| 339 | * @param a1 client address shifted right by ADDR0_BITS. |
| 340 | * @param bm bitmap pointer. |
| 341 | */ |
| 342 | static __inline__ |
| 343 | struct bitmap2* |
| 344 | bm2_lookup_exclusive(const struct bitmap* const bm, const UWord a1) |
| 345 | { |
| 346 | struct bitmap2ref* bm2ref; |
| 347 | struct bitmap2* bm2; |
| 348 | |
| 349 | bm2ref = 0; |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 350 | if (bm_cache_lookup(bm, a1, &bm2)) |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 351 | { |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 352 | if (bm2 == 0) |
| 353 | return 0; |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 354 | if (bm2->refcnt > 1) |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 355 | { |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 356 | bm2ref = VG_(OSetGen_Lookup)(bm->oset, &a1); |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 357 | } |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 358 | } |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 359 | else |
| 360 | { |
| 361 | bm2ref = VG_(OSetGen_Lookup)(bm->oset, &a1); |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 362 | if (bm2ref == 0) |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 363 | return 0; |
bart | f29205e | 2008-03-25 18:51:06 +0000 | [diff] [blame] | 364 | bm2 = bm2ref->bm2; |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 365 | } |
| 366 | |
| 367 | tl_assert(bm2); |
| 368 | |
| 369 | if (bm2->refcnt > 1) |
| 370 | { |
| 371 | tl_assert(bm2ref); |
| 372 | bm2 = bm2_make_exclusive(*(struct bitmap**)&bm, bm2ref); |
| 373 | } |
| 374 | |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 375 | return bm2; |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 376 | } |
| 377 | |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 378 | /** Look up the address a1 in bitmap bm. The returned second level bitmap has |
| 379 | * reference count one and hence may be modified. |
| 380 | * |
| 381 | * @param a1 client address shifted right by ADDR0_BITS. |
| 382 | * @param bm bitmap pointer. |
| 383 | */ |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 384 | static __inline__ |
bart | 0008f5b | 2008-03-22 17:07:39 +0000 | [diff] [blame] | 385 | struct bitmap2* bm2_insert(const struct bitmap* const bm, const UWord a1) |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 386 | { |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 387 | struct bitmap2ref* bm2ref; |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 388 | struct bitmap2* bm2; |
| 389 | |
bart | 588d90f | 2008-04-06 13:05:58 +0000 | [diff] [blame] | 390 | s_node_creation_count++; |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 391 | bm2ref = VG_(OSetGen_AllocNode)(bm->oset, sizeof(*bm2ref)); |
| 392 | bm2ref->addr = a1; |
| 393 | bm2 = bm2_new(a1); |
| 394 | bm2ref->bm2 = bm2; |
bart | 0008f5b | 2008-03-22 17:07:39 +0000 | [diff] [blame] | 395 | VG_(memset)(&bm2->bm1, 0, sizeof(bm2->bm1)); |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 396 | VG_(OSetGen_Insert)(bm->oset, bm2ref); |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 397 | |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 398 | bm_update_cache(*(struct bitmap**)&bm, a1, bm2); |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 399 | |
| 400 | return bm2; |
| 401 | } |
| 402 | |
| 403 | /** Insert a new node in bitmap bm that points to the second level bitmap |
| 404 | * *bm2. This means that *bm2 becomes shared over two or more bitmaps. |
| 405 | */ |
| 406 | static __inline__ |
| 407 | struct bitmap2* bm2_insert_addref(const struct bitmap* const bm, |
| 408 | struct bitmap2* const bm2) |
| 409 | { |
| 410 | struct bitmap2ref* bm2ref; |
| 411 | |
| 412 | tl_assert(bm); |
| 413 | //tl_assert(VG_(OSetGen_Lookup)(bm->oset, &bm2->addr) == 0); |
bart | 588d90f | 2008-04-06 13:05:58 +0000 | [diff] [blame] | 414 | |
| 415 | s_node_creation_count++; |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 416 | bm2ref = VG_(OSetGen_AllocNode)(bm->oset, sizeof(*bm2ref)); |
| 417 | bm2ref->addr = bm2->addr; |
| 418 | bm2ref->bm2 = bm2; |
| 419 | bm2->refcnt++; |
| 420 | VG_(OSetGen_Insert)(bm->oset, bm2ref); |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 421 | |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 422 | bm_update_cache(*(struct bitmap**)&bm, bm2->addr, bm2); |
| 423 | |
bart | 0008f5b | 2008-03-22 17:07:39 +0000 | [diff] [blame] | 424 | return bm2; |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 425 | } |
| 426 | |
bart | 0008f5b | 2008-03-22 17:07:39 +0000 | [diff] [blame] | 427 | /** Look up the address a1 in bitmap bm, and insert it if not found. |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 428 | * The returned second level bitmap may not be modified. |
bart | 0008f5b | 2008-03-22 17:07:39 +0000 | [diff] [blame] | 429 | * |
| 430 | * @param a1 client address shifted right by ADDR0_BITS. |
| 431 | * @param bm bitmap pointer. |
| 432 | */ |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 433 | static __inline__ |
| 434 | struct bitmap2* bm2_lookup_or_insert(const struct bitmap* const bm, |
| 435 | const UWord a1) |
| 436 | { |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 437 | struct bitmap2ref* bm2ref; |
bart | 0008f5b | 2008-03-22 17:07:39 +0000 | [diff] [blame] | 438 | struct bitmap2* bm2; |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 439 | |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 440 | tl_assert(bm); |
bart | 567614d | 2008-03-25 19:16:20 +0000 | [diff] [blame] | 441 | if (bm_cache_lookup(bm, a1, &bm2)) |
| 442 | { |
| 443 | if (bm2 == 0) |
| 444 | { |
| 445 | bm2 = bm2_insert(bm, a1); |
| 446 | } |
| 447 | } |
| 448 | else |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 449 | { |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 450 | bm2ref = VG_(OSetGen_Lookup)(bm->oset, &a1); |
| 451 | if (bm2ref) |
| 452 | { |
| 453 | bm2 = bm2ref->bm2; |
| 454 | } |
| 455 | else |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 456 | { |
| 457 | bm2 = bm2_insert(bm, a1); |
| 458 | } |
| 459 | bm_update_cache(*(struct bitmap**)&bm, a1, bm2); |
bart | a79df6e | 2008-03-14 17:07:51 +0000 | [diff] [blame] | 460 | } |
bart | 0008f5b | 2008-03-22 17:07:39 +0000 | [diff] [blame] | 461 | return bm2; |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 462 | } |
| 463 | |
bart | f647d34 | 2008-03-24 19:12:12 +0000 | [diff] [blame] | 464 | /** Look up the address a1 in bitmap bm, and insert it if not found. |
| 465 | * The returned second level bitmap may be modified. |
| 466 | * |
| 467 | * @param a1 client address shifted right by ADDR0_BITS. |
| 468 | * @param bm bitmap pointer. |
| 469 | */ |
| 470 | static __inline__ |
| 471 | struct bitmap2* bm2_lookup_or_insert_exclusive(struct bitmap* const bm, |
| 472 | const UWord a1) |
| 473 | { |
| 474 | struct bitmap2* bm2; |
| 475 | |
| 476 | tl_assert(bm); |
| 477 | bm2 = (struct bitmap2*)bm2_lookup_or_insert(bm, a1); |
| 478 | tl_assert(bm2); |
| 479 | if (bm2->refcnt > 1) |
| 480 | { |
| 481 | struct bitmap2ref* bm2ref; |
| 482 | bm2ref = VG_(OSetGen_Lookup)(bm->oset, &a1); |
| 483 | bm2 = bm2_make_exclusive(bm, bm2ref); |
| 484 | } |
| 485 | return bm2; |
| 486 | } |
| 487 | |
sewardj | af44c82 | 2007-11-25 14:01:38 +0000 | [diff] [blame] | 488 | |
bart | 33e56c9 | 2008-03-24 06:41:30 +0000 | [diff] [blame] | 489 | #endif /* __DRD_BITMAP_H */ |