pike.git/ src/ block_alloc.h

2002-12-01

2002-12-01 02:51:51 by Martin Stjernholm <mast@lysator.liu.se>

• e13e7154adbd2906eafe43f26b599c7281c4f276 (41 lines) (+40/-1) ^{[ Show | Annotate ]}
  Branch: 7.9

Added a move_foo function to PTR_HASH_ALLOC. Fixed bugs in dmalloc updates
when foo_block blocks are freed before cleanup. Improved check for invalid
pointers in check_free_foo.

Rev: src/block_alloc.h:1.56
Rev: src/block_alloc_h.h:1.18

2:   || 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. - || $Id: block_alloc.h,v 1.55 2002/12/01 00:57:32 mast Exp $ + || $Id: block_alloc.h,v 1.56 2002/12/01 02:51:51 mast Exp $   */      #undef PRE_INIT_BLOCK
162:    { \    if( (char *)d < (char *)tmp) continue; \    if( (char *)d >= (char *)(tmp->x+(BSIZE))) continue; \ +  if ((char *) d - (char *) tmp->x != \ +  (d - tmp->x) * (ptrdiff_t) sizeof (struct DATA)) break; \    return; \    } \    Pike_fatal("really_free_%s called on non-block_alloc region (%p).\n", \
213:    PIKE_CONCAT(DATA,_blocks) = blk->next; \    blk->next->prev = NULL; \    } \ +  DO_IF_DMALLOC({ \ +  size_t i; \ +  extern void dmalloc_check_block_free(void *p, char *loc); \ +  for (i = 0; i < (BSIZE); i++) { \ +  dmalloc_check_block_free(blk->x + i, DMALLOC_LOCATION()); \ +  dmalloc_unregister(blk->x + i, 1); \ +  } \ +  }); \    /* Mark meta-block as available, since libc will mess with it. */ \    PIKE_MEM_RW(*blk); \    free(blk); \
265:    PIKE_CONCAT(DATA,_blocks) = blk->next; \    blk->next->prev = NULL; \    } \ +  DO_IF_DMALLOC({ \ +  size_t i; \ +  extern void dmalloc_check_block_free(void *p, char *loc); \ +  for (i = 0; i < (BSIZE); i++) { \ +  dmalloc_check_block_free(blk->x + i, DMALLOC_LOCATION()); \ +  dmalloc_unregister(blk->x + i, 1); \ +  } \ +  }); \    /* Mark meta-block as available, since libc will mess with it. */ \    PIKE_MEM_RW(*blk); \    free(blk); \
423:    return 1; \   } \    \ + void PIKE_CONCAT(move_,DATA)(struct DATA *block, void *new_ptr) \ + { \ +  size_t hval = (size_t) block->PTR_HASH_ALLOC_DATA; \ +  DO_IF_RUN_UNLOCKED(mt_lock(&PIKE_CONCAT(DATA,_mutex))); \ +  hval %= 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 = (size_t) new_ptr % 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; \