pike.git/src/block_alloc.h:e82bbed61d8f3ce6b19cc1e6005f7f5400f6c55a

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 /* || This file is part of Pike. For copyright information see COPYRIGHT. || Pike is distributed under GPL, LGPL and MPL. See the file COPYING || for more information. */ #undef INIT_BLOCK #undef EXIT_BLOCK #undef BLOCK_ALLOC #undef LOW_PTR_HASH_ALLOC #undef PTR_HASH_ALLOC_FIXED #undef PTR_HASH_ALLOC #undef BLOCK_ALLOC_HSIZE_SHIFT #undef BLOCK_ALLOC_FILL_PAGES #undef PTR_HASH_ALLOC_FILL_PAGES #undef PTR_HASH_ALLOC_FIXED_FILL_PAGES #define INIT_BLOCK(X) #define EXIT_BLOCK(X) #define BLOCK_ALLOC_HSIZE_SHIFT 2 #ifndef PIKE_HASH_T #define PIKE_HASH_T size_t #endif /* !PIKE_HASH_T */ #define BA_STATIC #define BA_INLINE #define PTR_HASH_ALLOC_FILL_PAGES(DATA, PAGES) \ PTR_HASH_ALLOC(DATA, \ ((PIKE_MALLOC_PAGE_SIZE * (PAGES)) \ - PIKE_MALLOC_OVERHEAD - BLOCK_HEADER_SIZE) / \ sizeof (struct DATA)) #define PTR_HASH_ALLOC_FIXED_FILL_PAGES(DATA, PAGES) \ PTR_HASH_ALLOC_FIXED(DATA, \ ((PIKE_MALLOC_PAGE_SIZE * (PAGES)) \ - PIKE_MALLOC_OVERHEAD - BLOCK_HEADER_SIZE) / \ sizeof (struct DATA)) /* Size of the members in the block struct below that don't contain * the payload data (i.e. that aren't x). This can be used in BSIZE to * make the block fit within a page. */ #ifndef BLOCK_HEADER_SIZE #define BLOCK_HEADER_SIZE (3 * sizeof (void *) + sizeof (INT32) \ DO_IF_DMALLOC( + sizeof(INT32))) #endif #ifndef PTR_HASH_HASHFUN_DEFINED #define PTR_HASH_HASHFUN_DEFINED static INLINE PIKE_HASH_T ptr_hashfun(void * ptr) { PIKE_HASH_T q = (size_t)((char*)ptr - (char*)0); q ^= (q >> 20) ^ (q >> 12); return q ^ (q >> 7) ^ (q >> 4); } static INLINE size_t ptr_hash_find_hashsize(size_t size) { if (size & (size-1)) { size |= size >> 1; size |= size >> 2; size |= size >> 4; size |= size >> 8; size |= size >> 16; #if SIZEOF_INT_TYPE > 4 size |= size >> 32; #endif size++; } return size; } #endif #include "block_allocator.h" #define LOW_PTR_HASH_ALLOC(DATA,BSIZE) \ \ static struct block_allocator PIKE_CONCAT(DATA,_allocator) = \ BA_INIT(sizeof(struct DATA), BSIZE); \ \ struct DATA *PIKE_CONCAT(alloc_,DATA)(void) { \ struct DATA * ptr = (struct DATA *)ba_alloc(&PIKE_CONCAT(DATA,_allocator));\ INIT_BLOCK(ptr); \ return ptr; \ } \ \ void PIKE_CONCAT(really_free_,DATA)(struct DATA *d) { \ EXIT_BLOCK(d); \ ba_free(&PIKE_CONCAT(DATA,_allocator), d); \ } \ \ void PIKE_CONCAT3(count_memory_in_,DATA,s)(size_t *num_, size_t *size_) { \ ba_count_all(&PIKE_CONCAT(DATA,_allocator), num_, size_); \ } \ \ struct DATA **PIKE_CONCAT(DATA,_hash_table)=0; \ size_t PIKE_CONCAT(DATA,_hash_table_size)=0; \ static size_t PIKE_CONCAT(num_,DATA)=0; \ \ static struct DATA * \ PIKE_CONCAT3(really_low_find_,DATA,_unlocked)(void *ptr, \ PIKE_HASH_T hval) \ { \ struct DATA *p; \ p=PIKE_CONCAT(DATA,_hash_table)[hval]; \ if(!p || p->PTR_HASH_ALLOC_DATA == ptr) \ { \ return p; \ } \ while((p=p->BLOCK_ALLOC_NEXT)) \ { \ if(p->PTR_HASH_ALLOC_DATA==ptr) \ { \ return p; \ } \ } \ return 0; \ } \ \ struct DATA *PIKE_CONCAT(find_,DATA)(void *ptr) \ { \ struct DATA *p; \ PIKE_HASH_T hval = ptr_hashfun(ptr); \ if(!PIKE_CONCAT(DATA,_hash_table)) { \ return 0; \ } \ hval &= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size) - 1; \ p=PIKE_CONCAT3(really_low_find_,DATA,_unlocked)(ptr, hval); \ return p; \ } \ \ struct DATA *PIKE_CONCAT(make_,DATA)(void *ptr) \ { \ struct DATA *p; \ PIKE_HASH_T hval = ptr_hashfun(ptr); \ hval &= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size) - 1; \ p=PIKE_CONCAT3(make_,DATA,_unlocked)(ptr,hval); \ return p; \ } \ \ struct DATA *PIKE_CONCAT(get_,DATA)(void *ptr) \ { \ struct DATA *p; \ PIKE_HASH_T hval = ptr_hashfun(ptr); \ hval &= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size) - 1; \ if(!(p=PIKE_CONCAT3(really_low_find_,DATA,_unlocked)(ptr, hval))) \ p=PIKE_CONCAT3(make_,DATA,_unlocked)(ptr, hval); \ return p; \ } \ \ int PIKE_CONCAT3(check_,DATA,_semaphore)(void *ptr) \ { \ PIKE_HASH_T hval = ptr_hashfun(ptr); \ hval &= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size) - 1; \ if(PIKE_CONCAT3(really_low_find_,DATA,_unlocked)(ptr, hval)) \ { \ return 0; \ } \ \ PIKE_CONCAT3(make_,DATA,_unlocked)(ptr, hval); \ return 1; \ } \ \ void PIKE_CONCAT(move_,DATA)(struct DATA *block, void *new_ptr) \ { \ struct DATA **pp, *p; \ PIKE_HASH_T hval = ptr_hashfun(block->PTR_HASH_ALLOC_DATA); \ hval &= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size) - 1; \ pp=PIKE_CONCAT(DATA,_hash_table) + hval; \ while((p = *pp)) \ { \ if(p == block) \ { \ *pp = p->BLOCK_ALLOC_NEXT; \ break; \ } \ pp = &p->BLOCK_ALLOC_NEXT; \ } \ if (!p) Pike_fatal("The block to move wasn't found.\n"); \ block->PTR_HASH_ALLOC_DATA = new_ptr; \ hval = ptr_hashfun(new_ptr) & \ ((PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size) - 1); \ block->BLOCK_ALLOC_NEXT = PIKE_CONCAT(DATA,_hash_table)[hval]; \ PIKE_CONCAT(DATA,_hash_table)[hval] = block; \ } \ \ int PIKE_CONCAT(remove_,DATA)(void *ptr) \ { \ struct DATA **pp, *p; \ PIKE_HASH_T hval = ptr_hashfun(ptr); \ if(!PIKE_CONCAT(DATA,_hash_table)) \ { \ return 0; \ } \ hval &= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size) - 1; \ pp=PIKE_CONCAT(DATA,_hash_table) + hval; \ while((p = *pp)) \ { \ if(p->PTR_HASH_ALLOC_DATA==ptr) \ { \ *pp = p->BLOCK_ALLOC_NEXT; \ PIKE_CONCAT(num_,DATA)--; \ PIKE_CONCAT(really_free_,DATA)(p); \ return 1; \ } \ pp = &p->BLOCK_ALLOC_NEXT; \ } \ return 0; \ } \ \ static void PIKE_CONCAT3(low_init_,DATA,_hash)(size_t size) \ { \ PIKE_CONCAT(DATA,_hash_table_size)= \ ptr_hash_find_hashsize(size); \ \ PIKE_CONCAT(DATA,_hash_table)=(struct DATA **) \ malloc(sizeof(struct DATA *)*PIKE_CONCAT(DATA,_hash_table_size)); \ if(!PIKE_CONCAT(DATA,_hash_table)) \ { \ fprintf(stderr,"Fatal: out of memory.\n"); \ exit(17); \ } \ memset(PIKE_CONCAT(DATA,_hash_table),0, \ sizeof(struct DATA *)*PIKE_CONCAT(DATA,_hash_table_size)); \ } \ \ \ static void ATTRIBUTE((unused)) PIKE_CONCAT3(init_,DATA,_hash)(void) \ { \ PIKE_CONCAT3(low_init_,DATA,_hash)(BSIZE); \ } \ \ static void PIKE_CONCAT3(exit_,DATA,_hash)(void) \ { \ ba_free_all(& PIKE_CONCAT(DATA,_allocator)); \ free(PIKE_CONCAT(DATA,_hash_table)); \ PIKE_CONCAT(DATA,_hash_table)=0; \ PIKE_CONCAT(num_,DATA)=0; \ } #define PTR_HASH_ALLOC_FIXED(DATA,BSIZE) \ static struct DATA *PIKE_CONCAT3(make_,DATA,_unlocked)(void *ptr, PIKE_HASH_T hval);\ LOW_PTR_HASH_ALLOC(DATA,BSIZE) \ \ static struct DATA *PIKE_CONCAT3(make_,DATA,_unlocked)(void *ptr, PIKE_HASH_T hval) \ { \ struct DATA *p; \ \ DO_IF_DEBUG( if(!PIKE_CONCAT(DATA,_hash_table)) \ Pike_fatal("Hash table error!\n"); ) \ PIKE_CONCAT(num_,DATA)++; \ \ p=PIKE_CONCAT(alloc_,DATA)(); \ p->PTR_HASH_ALLOC_DATA=ptr; \ p->BLOCK_ALLOC_NEXT=PIKE_CONCAT(DATA,_hash_table)[hval]; \ PIKE_CONCAT(DATA,_hash_table)[hval]=p; \ return p; \ } #define PTR_HASH_ALLOC(DATA,BSIZE) \ static struct DATA *PIKE_CONCAT3(make_,DATA,_unlocked)(void *ptr, \ PIKE_HASH_T hval); \ LOW_PTR_HASH_ALLOC(DATA,BSIZE) \ \ static void PIKE_CONCAT(DATA,_rehash)(void) \ { \ /* Time to re-hash */ \ struct DATA **old_hash; \ struct DATA *p; \ PIKE_HASH_T hval; \ size_t e; \ \ old_hash= PIKE_CONCAT(DATA,_hash_table); \ e=PIKE_CONCAT(DATA,_hash_table_size); \ \ PIKE_CONCAT(DATA,_hash_table_size) *= 2; \ if((PIKE_CONCAT(DATA,_hash_table)=(struct DATA **) \ malloc(PIKE_CONCAT(DATA,_hash_table_size)* \ sizeof(struct DATA *)))) \ { \ memset(PIKE_CONCAT(DATA,_hash_table),0, \ sizeof(struct DATA *)*PIKE_CONCAT(DATA,_hash_table_size)); \ while(e-- > 0) \ { \ while((p=old_hash[e])) \ { \ old_hash[e]=p->BLOCK_ALLOC_NEXT; \ hval = ptr_hashfun(p->PTR_HASH_ALLOC_DATA); \ hval &= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size) - 1; \ p->BLOCK_ALLOC_NEXT=PIKE_CONCAT(DATA,_hash_table)[hval]; \ PIKE_CONCAT(DATA,_hash_table)[hval]=p; \ } \ } \ free((char *)old_hash); \ }else{ \ PIKE_CONCAT(DATA,_hash_table)=old_hash; \ PIKE_CONCAT(DATA,_hash_table_size)=e; \ } \ } \ \ static struct DATA *PIKE_CONCAT3(make_,DATA,_unlocked)(void *ptr, \ PIKE_HASH_T hval) \ { \ struct DATA *p; \ \ DO_IF_DEBUG( if(!PIKE_CONCAT(DATA,_hash_table)) \ Pike_fatal("Hash table error!\n"); ) \ PIKE_CONCAT(num_,DATA)++; \ \ if(( PIKE_CONCAT(num_,DATA)>>BLOCK_ALLOC_HSIZE_SHIFT ) >= \ PIKE_CONCAT(DATA,_hash_table_size)) \ { \ PIKE_CONCAT(DATA,_rehash)(); \ hval = ptr_hashfun(ptr); \ hval &= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size) - 1; \ } \ \ p=PIKE_CONCAT(alloc_,DATA)(); \ p->PTR_HASH_ALLOC_DATA=ptr; \ p->BLOCK_ALLOC_NEXT=PIKE_CONCAT(DATA,_hash_table)[hval]; \ PIKE_CONCAT(DATA,_hash_table)[hval]=p; \ return p; \ }

pike.git/ src/ block_alloc.h > e82bbed61d8f3ce6b19cc1e6005f7f5400f6c55a [Annotate]