pike.git/src/block_alloc.h:1ca020c5bd3ae49d5d54f68545706c681da3fa90

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 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 /* || 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 PRE_INIT_BLOCK #undef DO_PRE_INIT_BLOCK #undef INIT_BLOCK #undef EXIT_BLOCK #undef BLOCK_ALLOC #undef LOW_PTR_HASH_ALLOC #undef PTR_HASH_ALLOC_FIXED #undef PTR_HASH_ALLOC #undef COUNT_BLOCK #undef COUNT_OTHER #undef DMALLOC_DESCRIBE_BLOCK #undef BLOCK_ALLOC_HSIZE_SHIFT #undef MAX_EMPTY_BLOCKS #undef BLOCK_ALLOC_FILL_PAGES #undef PTR_HASH_ALLOC_FILL_PAGES #undef PTR_HASH_ALLOC_FIXED_FILL_PAGES /* Define this to keep freed blocks around in a backlog, which can * help locating leftover pointers to other blocks. It can also hide * bugs since the blocks remain intact a while after they are freed. * Valgrind will immediately detect attempts to use blocks on the * backlog list, though. Only available with dmalloc debug. */ /* #define DMALLOC_BLOCK_BACKLOG */ /* Note: The block_alloc mutex is held while PRE_INIT_BLOCK runs. */ #define PRE_INIT_BLOCK(X) #define INIT_BLOCK(X) #define EXIT_BLOCK(X) #define COUNT_BLOCK(X) #define COUNT_OTHER() #define DMALLOC_DESCRIBE_BLOCK(X) #define BLOCK_ALLOC_HSIZE_SHIFT 2 #define MAX_EMPTY_BLOCKS 4 /* Must be >= 1. */ #if defined (DMALLOC_BLOCK_BACKLOG) && defined (DEBUG_MALLOC) #define DO_IF_BLOCK_BACKLOG(X) X #define DO_IF_NOT_BLOCK_BACKLOG(X) #define BLOCK_ALLOC_USED real_used #else #define DO_IF_BLOCK_BACKLOG(X) #define DO_IF_NOT_BLOCK_BACKLOG(X) X #define BLOCK_ALLOC_USED used #endif /* Invalidate the block as far as possible if running with dmalloc. */ #define DO_PRE_INIT_BLOCK(X) do { \ DO_IF_DMALLOC(MEMSET((X), 0x55, sizeof(*(X)))); \ PRE_INIT_BLOCK(X); \ } while (0) #ifndef PIKE_HASH_T #define PIKE_HASH_T size_t #endif /* !PIKE_HASH_T */ #ifdef PIKE_RUN_UNLOCKED #include "threads.h" /* Block Alloc UnLocked */ #define BA_UL(X) PIKE_CONCAT(X,_unlocked) #define BA_STATIC static #define BA_INLINE INLINE #else #define BA_UL(X) X #define BA_STATIC #define BA_INLINE #endif #ifdef PIKE_NEW_BLOCK_ALLOC # define ba_error Pike_error # include "global.h" # include "pike_error.h" # include "pike_memory.h" # define EXPORT PMOD_EXPORT # include "gjalloc.h" # undef EXPORT /* we assume here that malloc has 8 bytes of overhead */ #define BLOCK_HEADER_SIZE (sizeof(struct ba_page) + sizeof(void*)) #define BLOCK_ALLOC_FILL_PAGES(DATA, PAGES) \ BLOCK_ALLOC(DATA, \ ((PIKE_MALLOC_PAGE_SIZE * (PAGES)) - BLOCK_HEADER_SIZE) / \ sizeof (struct DATA)) #define PTR_HASH_ALLOC_FILL_PAGES(DATA, PAGES) \ PTR_HASH_ALLOC(DATA, \ ((PIKE_MALLOC_PAGE_SIZE * (PAGES)) - 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)) - BLOCK_HEADER_SIZE) / \ sizeof (struct DATA)) #define MS(x) #x #define BLOCK_ALLOC_IN_USE(DATA) (!!PIKE_CONCAT (DATA, _allocator).num_pages) #define WALK_NONFREE_BLOCKS(DATA, BLOCK, FCOND, CODE...) do { \ struct block_allocator * a = &PIKE_CONCAT(DATA, _allocator); \ if (a->alloc) a->alloc->h = a->h; \ PAGE_LOOP(a, { \ uint32_t i, used = p->h.used; \ for (i = 0; used && i < a->l.blocks; i++) { \ BLOCK = ((struct DATA*)(p+1)) + i; \ if (FCOND) { \ do CODE while(0); \ --used; \ } \ } \ }); \ } while(0) #define BLOCK_ALLOC_LOW(DATA,BSIZE) \ static struct block_allocator PIKE_CONCAT(DATA, _allocator) = \ BA_INIT(sizeof(struct DATA), (BSIZE), #DATA); \ static struct DATA PIKE_CONCAT(DATA,_blueprint); \ \ void PIKE_CONCAT3(new_,DATA,_context)(void) {} \ \ BA_STATIC BA_INLINE struct DATA *BA_UL(PIKE_CONCAT(alloc_,DATA))(void) \ { \ struct DATA *tmp; \ IF_DEBUG(ba_check_allocator(&PIKE_CONCAT(DATA, _allocator), "before alloc_"#DATA, __FILE__, __LINE__);) \ tmp = (struct DATA *)ba_alloc(&PIKE_CONCAT(DATA, _allocator)); \ IF_DEBUG(ba_check_allocator(&PIKE_CONCAT(DATA, _allocator), "after alloc_"#DATA, __FILE__, __LINE__);) \ PIKE_MEM_RW(*tmp); \ PIKE_MEM_WO(*tmp); \ INIT_BLOCK(tmp); \ return tmp; \ } \ \ BA_STATIC BA_INLINE \ void BA_UL(PIKE_CONCAT(really_free_,DATA))(struct DATA *d) \ { \ EXIT_BLOCK(d); \ DO_PRE_INIT_BLOCK(d); \ ba_free(&PIKE_CONCAT(DATA, _allocator), (void*)d); \ IF_DEBUG(ba_check_allocator(&PIKE_CONCAT(DATA, _allocator), \ "really_free_"#DATA, __FILE__, __LINE__);) \ PIKE_MEM_NA(*d); \ } \ \ static void PIKE_CONCAT3(free_all_,DATA,_blocks_unlocked)(void) \ { \ IF_STATS(ba_print_stats(&PIKE_CONCAT(DATA, _allocator))); \ ba_destroy(&PIKE_CONCAT(DATA, _allocator)); \ } \ \ void PIKE_CONCAT3(count_memory_in_,DATA,s)(size_t *num_, size_t *size_) \ { \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ ba_count_all(&PIKE_CONCAT(DATA, _allocator), num_, size_); \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ } \ \ void PIKE_CONCAT3(init_,DATA,_blocks)(void) \ { \ DO_PRE_INIT_BLOCK(((struct DATA *)(PIKE_CONCAT(DATA,_allocator).blueprint = (char*)&PIKE_CONCAT(DATA, _blueprint)))); \ } #else /* PIKE_NEW_BLOCK_ALLOC */ #define BLOCK_ALLOC_FILL_PAGES(DATA, PAGES) \ BLOCK_ALLOC(DATA, \ ((PIKE_MALLOC_PAGE_SIZE * (PAGES)) \ - PIKE_MALLOC_OVERHEAD - BLOCK_HEADER_SIZE) / \ sizeof (struct DATA)) #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 #define BLOCK_ALLOC_IN_USE(DATA) (!!PIKE_CONCAT (DATA, _blocks)) #define WALK_NONFREE_BLOCKS(DATA, BLOCK, FCOND, CODE) do { \ struct PIKE_CONCAT(DATA,_block) * p; \ for(p=PIKE_CONCAT(DATA,_blocks);p;p=p->next) { \ int n = p->used; \ int i; \ for (i = 0; n && i < (sizeof(p->x)/sizeof(struct DATA)); i++) { \ BLOCK = &p->x[i]; \ if (FCOND) { \ do CODE while(0); \ --n; \ } \ } \ } \ } while(0) #define BLOCK_ALLOC_LOW(DATA,BSIZE) \ \ struct PIKE_CONCAT(DATA,_block) \ { \ struct PIKE_CONCAT(DATA,_block) *next; \ struct PIKE_CONCAT(DATA,_block) *prev; \ struct DATA *PIKE_CONCAT3(free_,DATA,s); \ INT32 used; \ DO_IF_BLOCK_BACKLOG (INT32 real_used;) \ struct DATA x[BSIZE]; \ }; \ struct PIKE_CONCAT(DATA,_context) \ { \ struct PIKE_CONCAT(DATA,_context) *next; \ struct PIKE_CONCAT(DATA, _block) *blocks, *free_blocks; \ INT32 num_empty_blocks; \ }; \ \ static struct PIKE_CONCAT(DATA,_context) *PIKE_CONCAT(DATA,_ctxs)=0; \ \ /* Points to a double linked list of the meta-blocks. */ \ /* Full meta-blocks are last on this list. */ \ static struct PIKE_CONCAT(DATA,_block) *PIKE_CONCAT(DATA,_blocks)=0; \ \ /* Points to the last meta-block in the DATA,_block list that isn't full. */ \ /* -1 when the block alloc isn't initialized. */ \ static struct PIKE_CONCAT(DATA,_block) *PIKE_CONCAT(DATA,_free_blocks)= \ (void*)-1; \ \ static INT32 PIKE_CONCAT3(num_empty_,DATA,_blocks)=0; \ DO_IF_RUN_UNLOCKED(static PIKE_MUTEX_T PIKE_CONCAT(DATA,_mutex);) \ DO_IF_BLOCK_BACKLOG ( \ static struct DATA *PIKE_CONCAT(DATA,s_to_free)[4 * (BSIZE)]; \ static size_t PIKE_CONCAT(DATA,s_to_free_ptr) = 0; \ ) \ \ void PIKE_CONCAT3(new_,DATA,_context)(void) \ { \ struct PIKE_CONCAT(DATA, _context) *ctx = \ (struct PIKE_CONCAT(DATA, _context) *) \ malloc(sizeof(struct PIKE_CONCAT(DATA, _context))); \ if (!ctx) { \ fprintf(stderr, "Fatal: out of memory.\n"); \ exit(17); \ } \ ctx->next = PIKE_CONCAT(DATA, _ctxs); \ PIKE_CONCAT(DATA, _ctxs) = ctx; \ ctx->blocks = PIKE_CONCAT(DATA,_blocks); \ ctx->free_blocks = PIKE_CONCAT(DATA,_free_blocks); \ ctx->num_empty_blocks = PIKE_CONCAT3(num_empty_,DATA,_blocks); \ PIKE_CONCAT(DATA,_blocks) = 0; \ PIKE_CONCAT(DATA,_free_blocks) = 0; \ PIKE_CONCAT3(num_empty_,DATA,_blocks) = 0; \ } \ \ static void PIKE_CONCAT(alloc_more_,DATA)(void) \ { \ struct PIKE_CONCAT(DATA,_block) *n; \ size_t e; \ n=(struct PIKE_CONCAT(DATA,_block) *) \ malloc(sizeof(struct PIKE_CONCAT(DATA,_block))); \ if(!n) \ { \ fprintf(stderr,"Fatal: out of memory.\n"); \ exit(17); \ } \ if((n->next=PIKE_CONCAT(DATA,_blocks))) \ n->next->prev=n; \ n->prev=NULL; \ n->used=0; \ DO_IF_BLOCK_BACKLOG (n->real_used = 0); \ PIKE_CONCAT(DATA,_blocks)=n; \ PIKE_CONCAT(DATA,_free_blocks)=n; \ \ DO_PRE_INIT_BLOCK( n->x ); \ n->x[0].BLOCK_ALLOC_NEXT=NULL; \ for(e=1;e<(BSIZE);e++) \ { \ DO_PRE_INIT_BLOCK( (n->x+e) ); \ n->x[e].BLOCK_ALLOC_NEXT=(void *)&n->x[e-1]; \ } \ n->PIKE_CONCAT3(free_,DATA,s)=&n->x[(BSIZE)-1]; \ /* Mark the new blocks as unavailable for now... */ \ PIKE_MEM_NA(n->x); \ } \ \ BA_STATIC BA_INLINE struct DATA *BA_UL(PIKE_CONCAT(alloc_,DATA))(void) \ { \ struct DATA *tmp; \ struct PIKE_CONCAT(DATA,_block) *blk; \ \ if(!(blk = PIKE_CONCAT(DATA,_free_blocks))) { \ PIKE_CONCAT(alloc_more_,DATA)(); \ blk = PIKE_CONCAT(DATA,_blocks); \ blk->BLOCK_ALLOC_USED++; \ } \ DO_IF_DEBUG( \ else if (PIKE_CONCAT(DATA,_free_blocks) == (void *)-1) \ Pike_fatal("Block alloc " #DATA " not initialized.\n"); \ ) \ else if(!blk->BLOCK_ALLOC_USED++) \ --PIKE_CONCAT3(num_empty_,DATA,_blocks); \ DO_IF_BLOCK_BACKLOG (blk->used++); \ \ tmp = blk->PIKE_CONCAT3(free_,DATA,s); \ /* Mark the new block as available. */ \ PIKE_MEM_RW(*tmp); \ if(!(blk->PIKE_CONCAT3(free_,DATA,s) = (void *)tmp->BLOCK_ALLOC_NEXT)) \ PIKE_CONCAT(DATA,_free_blocks) = blk->prev; \ DO_IF_DMALLOC( \ dmalloc_unregister(tmp, 1); \ dmalloc_register(tmp,sizeof(struct DATA), DMALLOC_LOCATION()); \ ) \ /* Mark the new block as available but uninitialized. */ \ PIKE_MEM_WO(*tmp); \ INIT_BLOCK(tmp); \ return tmp; \ } \ \ DO_IF_DMALLOC( \ static void PIKE_CONCAT3(dmalloc_,DATA,_not_freed) (struct DATA *d, \ const char *msg) \ { \ /* Separate function to allow gdb breakpoints. */ \ fprintf (stderr, "struct " TOSTR(DATA) \ " at %p is still in use %s\n", d, msg); \ } \ \ static void PIKE_CONCAT(dmalloc_late_free_,DATA) (struct DATA *d) \ { \ /* Separate function to allow gdb breakpoints. */ \ fprintf (stderr, "struct " TOSTR(DATA) " at %p freed now (too late)\n", d); \ dmalloc_mark_as_free (d, 1); \ dmalloc_unregister (d, 1); \ PIKE_MEM_NA (*d); \ } \ \ static void PIKE_CONCAT3(dmalloc_free_,DATA,_block) ( \ struct PIKE_CONCAT(DATA,_block) *blk, const char *msg) \ { \ int dont_free = 0; \ size_t i; \ for (i = 0; i < (BSIZE); i++) { \ if (!dmalloc_check_allocated (blk->x + i, 0)) \ dmalloc_unregister (blk->x + i, 1); \ else if (dmalloc_check_allocated (blk->x + i, 1)) { \ PIKE_CONCAT3(dmalloc_,DATA,_not_freed) (blk->x + i, msg); \ DMALLOC_DESCRIBE_BLOCK ((blk->x + i)); \ debug_malloc_dump_references (blk->x + i, 0, 2, 0); \ dont_free = 1; \ } \ } \ if (dont_free) { \ /* If a block still is in use we conciously leak this */ \ /* meta-block to allow access to it later. That way we can */ \ /* avoid fatals before the leak report. */ \ dmalloc_accept_leak (blk); \ } \ else { \ /* Mark meta-block as available, since libc will mess with it. */ \ PIKE_MEM_RW (blk->x); \ free ((char *) blk); \ } \ } \ ) \ \ BA_STATIC BA_INLINE \ void BA_UL(PIKE_CONCAT(really_free_,DATA))(struct DATA *d) \ { \ struct PIKE_CONCAT(DATA,_block) *blk; \ \ EXIT_BLOCK(d); \ \ DO_IF_DMALLOC({ \ blk = PIKE_CONCAT(DATA,_free_blocks); \ if(blk == NULL || (char *)d < (char *)blk || \ (char *)d >= (char *)(blk->x+(BSIZE))) { \ blk = PIKE_CONCAT(DATA,_blocks); \ while (blk && ((char *)d < (char *)blk || \ (char *)d >= (char *)(blk->x+(BSIZE)))) \ blk = blk->next; \ } \ if (blk) { \ if (!dmalloc_check_allocated (d, 0)) { \ debug_malloc_dump_references(d, 0, 2, 0); \ Pike_fatal ("really_free_" TOSTR(DATA) " called with " \ "unknown pointer %p (probably already freed)\n", d); \ } \ dmalloc_mark_as_free(d, 1); \ DO_IF_BLOCK_BACKLOG({ \ struct DATA *d2 = \ PIKE_CONCAT(DATA,s_to_free)[PIKE_CONCAT(DATA,s_to_free_ptr)]; \ blk->used--; \ PIKE_MEM_NA(*d); \ PIKE_CONCAT(DATA,s_to_free)[PIKE_CONCAT(DATA,s_to_free_ptr)] = d; \ PIKE_CONCAT(DATA,s_to_free_ptr) = \ (PIKE_CONCAT(DATA,s_to_free_ptr) + 1) % \ NELEM(PIKE_CONCAT(DATA,s_to_free)); \ if ((d = d2)) \ PIKE_MEM_WO(*d); \ else \ return; \ }); \ } \ else if (dmalloc_check_allocated (d, 0)) { \ PIKE_CONCAT(dmalloc_late_free_,DATA) (d); \ return; \ } \ }); \ \ blk = PIKE_CONCAT(DATA,_free_blocks); \ if(blk == NULL || (char *)d < (char *)blk || \ (char *)d >= (char *)(blk->x+(BSIZE))) { \ blk = PIKE_CONCAT(DATA,_blocks); \ DO_IF_DEBUG ( \ if (!blk) Pike_fatal ("really_free_" TOSTR(DATA) \ " got invalid pointer %p\n", d) \ ); \ if((char *)d < (char *)blk || \ (char *)d >= (char *)(blk->x+(BSIZE))) { \ do { \ blk = blk->next; \ DO_IF_DEBUG ( \ if (!blk) Pike_fatal ("really_free_" TOSTR(DATA) \ " got invalid pointer %p\n", d) \ ); \ } while((char *)d < (char *)blk || \ (char *)d >= (char *)(blk->x+(BSIZE))); \ if(blk == PIKE_CONCAT(DATA,_free_blocks)) \ PIKE_CONCAT(DATA,_free_blocks) = blk->prev; \ blk->prev->next = blk->next; \ if(blk->next) \ blk->next->prev = blk->prev; \ blk->prev = NULL; \ blk->next = PIKE_CONCAT(DATA,_blocks); \ blk->next->prev = blk; \ PIKE_CONCAT(DATA,_blocks) = blk; \ } \ if(PIKE_CONCAT(DATA,_free_blocks) == NULL) \ PIKE_CONCAT(DATA,_free_blocks) = blk; \ } \ \ DO_IF_DEBUG ( \ if ((char *) d < (char *) &blk->x || \ ((char *) d - (char *) &blk->x) % sizeof (struct DATA)) \ Pike_fatal ("really_free_" TOSTR(DATA) \ " got misaligned pointer %p\n", d); \ ); \ \ DO_PRE_INIT_BLOCK(d); \ DO_IF_BLOCK_BACKLOG ({ \ struct DATA *d2 = (void *)blk->PIKE_CONCAT3(free_,DATA,s); \ d->BLOCK_ALLOC_NEXT = NULL; \ if (d2) { \ while (d2->BLOCK_ALLOC_NEXT) { \ if (PTR_TO_INT(d2->BLOCK_ALLOC_NEXT) == 0x55555555) { \ debug_malloc_dump_references(d2, 0, 2, 0); \ Pike_fatal("Bad next pointer in free list.\n"); \ } \ d2 = (void *)d2->BLOCK_ALLOC_NEXT; \ } \ d2->BLOCK_ALLOC_NEXT = (void *)d; \ } else { \ blk->PIKE_CONCAT3(free_,DATA,s)=d; \ } \ }); \ DO_IF_NOT_BLOCK_BACKLOG ({ \ d->BLOCK_ALLOC_NEXT = (void *)blk->PIKE_CONCAT3(free_,DATA,s); \ blk->PIKE_CONCAT3(free_,DATA,s)=d; \ }); \ /* Mark block as unavailable. */ \ PIKE_MEM_NA(*d); \ \ if(!--blk->BLOCK_ALLOC_USED && \ ++PIKE_CONCAT3(num_empty_,DATA,_blocks) > MAX_EMPTY_BLOCKS) { \ if(blk == PIKE_CONCAT(DATA,_free_blocks)) { \ /* blk->prev isn't NULL because MAX_EMPTY_BLOCKS >= 1 so we */ \ /* know there's at least one more empty block. */ \ if((blk->prev->next = blk->next)) \ blk->next->prev = blk->prev; \ PIKE_CONCAT(DATA,_free_blocks) = blk->prev; \ } else { \ PIKE_CONCAT(DATA,_blocks) = blk->next; \ blk->next->prev = NULL; \ } \ \ DO_IF_DMALLOC ( \ PIKE_CONCAT3(dmalloc_free_,DATA,_block) ( \ blk, "in block expected to be empty") \ ); \ DO_IF_NOT_DMALLOC( \ /* Mark meta-block as available, since libc will mess with it. */ \ PIKE_MEM_RW(*blk); \ free(blk); \ ); \ \ --PIKE_CONCAT3(num_empty_,DATA,_blocks); \ } \ } \ \ static void PIKE_CONCAT3(free_all_,DATA,_blocks_unlocked)(void) \ { \ struct PIKE_CONCAT(DATA,_block) *tmp; \ \ DO_IF_DMALLOC( \ DO_IF_BLOCK_BACKLOG ( \ MEMSET(PIKE_CONCAT(DATA,s_to_free), 0, \ sizeof(PIKE_CONCAT(DATA,s_to_free))); \ ); \ while ((tmp = PIKE_CONCAT(DATA,_blocks))) { \ PIKE_CONCAT(DATA,_blocks) = tmp->next; \ PIKE_CONCAT3(dmalloc_free_,DATA,_block) ( \ tmp, "in free_all_" TOSTR(DATA) "_blocks"); \ } \ ); \ \ DO_IF_NOT_DMALLOC( \ while((tmp=PIKE_CONCAT(DATA,_blocks))) \ { \ PIKE_CONCAT(DATA,_blocks)=tmp->next; \ /* Mark meta-block as available, since libc will mess with it. */ \ PIKE_MEM_RW(tmp->x); \ free((char *)tmp); \ } \ ); \ \ if (PIKE_CONCAT(DATA,_ctxs)) { \ struct PIKE_CONCAT(DATA, _context) *ctx = PIKE_CONCAT(DATA,_ctxs); \ PIKE_CONCAT(DATA,_blocks)=ctx->blocks; \ PIKE_CONCAT(DATA,_free_blocks)=ctx->free_blocks; \ PIKE_CONCAT3(num_empty_,DATA,_blocks)=ctx->num_empty_blocks; \ PIKE_CONCAT(DATA,_ctxs) = ctx->next; \ free(ctx); \ } else { \ PIKE_CONCAT(DATA,_blocks)=0; \ PIKE_CONCAT(DATA,_free_blocks)=0; \ PIKE_CONCAT3(num_empty_,DATA,_blocks)=0; \ } \ } \ \ void PIKE_CONCAT3(count_memory_in_,DATA,s)(size_t *num_, size_t *size_) \ { \ size_t num=0, size=0; \ struct PIKE_CONCAT(DATA,_block) *tmp; \ struct PIKE_CONCAT(DATA,_context) *ctx = PIKE_CONCAT(DATA,_ctxs); \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ for(tmp=PIKE_CONCAT(DATA,_blocks);tmp;tmp=tmp->next) \ { \ size+=sizeof(struct PIKE_CONCAT(DATA,_block)); \ num+=tmp->used; \ COUNT_BLOCK(tmp); \ } \ while (ctx) { \ for(tmp=ctx->blocks;tmp;tmp=tmp->next) \ { \ size+=sizeof(struct PIKE_CONCAT(DATA,_block)); \ num+=tmp->used; \ COUNT_BLOCK(tmp); \ } \ ctx = ctx->next; \ } \ COUNT_OTHER(); \ *num_=num; \ *size_=size; \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ } \ \ \ void PIKE_CONCAT3(init_,DATA,_blocks)(void) \ { \ /* DO_IF_RUN_UNLOCKED(mt_init_recursive(&PIKE_CONCAT(DATA,_mutex)));*/ \ DO_IF_RUN_UNLOCKED(mt_init(&PIKE_CONCAT(DATA,_mutex))); \ PIKE_CONCAT(DATA,_free_blocks)=0; \ } #endif /* PIKE_NEW_BLOCK_ALLOC */ #define BLOCK_ALLOC(DATA,BSIZE) \ BLOCK_ALLOC_LOW(DATA,BSIZE) \ DO_IF_RUN_UNLOCKED( \ void PIKE_CONCAT(really_free_,DATA)(struct DATA *d) \ { \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ BA_UL(PIKE_CONCAT(really_free_,DATA))(d); \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ }) \ \ void PIKE_CONCAT3(free_all_,DATA,_blocks)(void) \ { \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ PIKE_CONCAT3(free_all_,DATA,_blocks_unlocked)(); \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ } \ \ DO_IF_RUN_UNLOCKED( \ struct DATA *PIKE_CONCAT(alloc_,DATA)(void) \ { \ struct DATA *ret; \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ ret=PIKE_CONCAT3(alloc_,DATA,_unlocked)(); \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ return ret; \ }) #define LOW_PTR_HASH_ALLOC(DATA,BSIZE) \ \ BLOCK_ALLOC(DATA,BSIZE) \ \ struct DATA **PIKE_CONCAT(DATA,_hash_table)=0; \ size_t PIKE_CONCAT(DATA,_hash_table_size)=0; \ size_t PIKE_CONCAT(DATA,_hash_table_magnitude)=0; \ static size_t PIKE_CONCAT(num_,DATA)=0; \ \ static INLINE struct DATA * \ PIKE_CONCAT3(really_low_find_,DATA,_unlocked)(void *ptr, \ PIKE_HASH_T hval) \ { \ struct DATA *p,**pp; \ p=PIKE_CONCAT(DATA,_hash_table)[hval]; \ if(!p || p->PTR_HASH_ALLOC_DATA == ptr) \ { \ return p; \ } \ while((p=*(pp=&p->BLOCK_ALLOC_NEXT))) \ { \ if(p->PTR_HASH_ALLOC_DATA==ptr) \ { \ *pp=p->BLOCK_ALLOC_NEXT; \ p->BLOCK_ALLOC_NEXT=PIKE_CONCAT(DATA,_hash_table)[hval]; \ PIKE_CONCAT(DATA,_hash_table)[hval]=p; \ return p; \ } \ } \ return 0; \ } \ \ struct DATA *PIKE_CONCAT(find_,DATA)(void *ptr) \ { \ struct DATA *p; \ PIKE_HASH_T hval = (PIKE_HASH_T)PTR_TO_INT(ptr); \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ if(!PIKE_CONCAT(DATA,_hash_table)) { \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ return 0; \ } \ hval %= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size); \ p=PIKE_CONCAT3(really_low_find_,DATA,_unlocked)(ptr, hval); \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ return p; \ } \ \ static INLINE struct DATA * \ PIKE_CONCAT3(just_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; \ } \ \ static struct DATA *PIKE_CONCAT(just_find_,DATA)(void *ptr) \ { \ struct DATA *p; \ PIKE_HASH_T hval = (PIKE_HASH_T)PTR_TO_INT(ptr); \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ if(!PIKE_CONCAT(DATA,_hash_table)) { \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ return 0; \ } \ hval %= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size); \ p=PIKE_CONCAT3(just_find_,DATA,_unlocked)(ptr, hval); \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ return p; \ } \ \ \ \ struct DATA *PIKE_CONCAT(make_,DATA)(void *ptr) \ { \ struct DATA *p; \ PIKE_HASH_T hval = (PIKE_HASH_T)PTR_TO_INT(ptr); \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ hval %= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size); \ p=PIKE_CONCAT3(make_,DATA,_unlocked)(ptr,hval); \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ return p; \ } \ \ struct DATA *PIKE_CONCAT(get_,DATA)(void *ptr) \ { \ struct DATA *p; \ PIKE_HASH_T hval = (PIKE_HASH_T)PTR_TO_INT(ptr); \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ hval %= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size); \ if(!(p=PIKE_CONCAT3(really_low_find_,DATA,_unlocked)(ptr, hval))) \ p=PIKE_CONCAT3(make_,DATA,_unlocked)(ptr, hval); \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ return p; \ } \ \ int PIKE_CONCAT3(check_,DATA,_semaphore)(void *ptr) \ { \ PIKE_HASH_T hval = (PIKE_HASH_T)PTR_TO_INT(ptr); \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ hval %= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size); \ if(PIKE_CONCAT3(really_low_find_,DATA,_unlocked)(ptr, hval)) \ { \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ return 0; \ } \ \ PIKE_CONCAT3(make_,DATA,_unlocked)(ptr, hval); \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ return 1; \ } \ \ void PIKE_CONCAT(move_,DATA)(struct DATA *block, void *new_ptr) \ { \ PIKE_HASH_T hval = \ (PIKE_HASH_T)PTR_TO_INT(block->PTR_HASH_ALLOC_DATA); \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ hval %= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size); \ if (!PIKE_CONCAT3(really_low_find_,DATA,_unlocked)( \ block->PTR_HASH_ALLOC_DATA, hval)) \ Pike_fatal("The block to move wasn't found.\n"); \ DO_IF_DEBUG( \ if (PIKE_CONCAT(DATA,_hash_table)[hval] != block) \ Pike_fatal("Expected the block to be at the top of the hash chain.\n"); \ ); \ PIKE_CONCAT(DATA,_hash_table)[hval] = block->BLOCK_ALLOC_NEXT; \ block->PTR_HASH_ALLOC_DATA = new_ptr; \ hval = (PIKE_HASH_T)PTR_TO_INT(new_ptr) % \ (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size); \ block->BLOCK_ALLOC_NEXT = PIKE_CONCAT(DATA,_hash_table)[hval]; \ PIKE_CONCAT(DATA,_hash_table)[hval] = block; \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ } \ \ int PIKE_CONCAT(remove_,DATA)(void *ptr) \ { \ struct DATA *p; \ PIKE_HASH_T hval = (PIKE_HASH_T)PTR_TO_INT(ptr); \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ if(!PIKE_CONCAT(DATA,_hash_table)) \ { \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ return 0; \ } \ hval %= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size); \ if((p=PIKE_CONCAT3(really_low_find_,DATA,_unlocked)(ptr, hval))) \ { \ PIKE_CONCAT(num_,DATA)--; \ DO_IF_DEBUG( if(PIKE_CONCAT(DATA,_hash_table)[hval]!=p) \ Pike_fatal("GAOssdf\n"); ); \ PIKE_CONCAT(DATA,_hash_table)[hval]=p->BLOCK_ALLOC_NEXT; \ BA_UL(PIKE_CONCAT(really_free_,DATA))(p); \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ return 1; \ } \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ return 0; \ } \ \ void PIKE_CONCAT3(low_init_,DATA,_hash)(size_t size) \ { \ extern const INT32 hashprimes[32]; \ extern int my_log2(size_t x); \ PIKE_CONCAT3(init_,DATA,_blocks)(); \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ PIKE_CONCAT(DATA,_hash_table_size)= \ hashprimes[PIKE_CONCAT(DATA,_hash_table_magnitude)=my_log2(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)); \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ } \ \ \ void PIKE_CONCAT3(init_,DATA,_hash)(void) \ { \ PIKE_CONCAT3(low_init_,DATA,_hash)(BSIZE); \ } \ \ void PIKE_CONCAT3(exit_,DATA,_hash)(void) \ { \ DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ PIKE_CONCAT3(free_all_,DATA,_blocks_unlocked)(); \ free(PIKE_CONCAT(DATA,_hash_table)); \ PIKE_CONCAT(DATA,_hash_table)=0; \ PIKE_CONCAT(num_,DATA)=0; \ DO_IF_RUN_UNLOCKED(mt_unlock(&PIKE_CONCAT(DATA,_mutex))); \ } #define PTR_HASH_ALLOC_FIXED(DATA,BSIZE) \ struct DATA *PIKE_CONCAT3(make_,DATA,_unlocked)(void *ptr, PIKE_HASH_T hval);\ LOW_PTR_HASH_ALLOC(DATA,BSIZE) \ \ 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=BA_UL(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) \ 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 */ \ extern const INT32 hashprimes[32]; \ 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_magnitude)++; \ PIKE_CONCAT(DATA,_hash_table_size)= \ hashprimes[PIKE_CONCAT(DATA,_hash_table_magnitude)]; \ 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 = (PIKE_HASH_T)PTR_TO_INT(p->PTR_HASH_ALLOC_DATA); \ hval %= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size); \ 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; \ } \ } \ \ 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 = (PIKE_HASH_T)PTR_TO_INT(ptr); \ hval %= (PIKE_HASH_T)PIKE_CONCAT(DATA,_hash_table_size); \ } \ \ p=BA_UL(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 > 1ca020c5bd3ae49d5d54f68545706c681da3fa90 [Annotate]