| cfa7d8 | 2000-01-27 | Fredrik Hübinette (Hubbe) | |
|
| 421801 | 1999-01-31 | Fredrik Hübinette (Hubbe) | | #undef PRE_INIT_BLOCK
#undef INIT_BLOCK
#undef EXIT_BLOCK
#undef BLOCK_ALLOC
|
| fc2c83 | 1999-04-01 | Fredrik Hübinette (Hubbe) | | #undef PTR_HASH_ALLOC
|
| cfa7d8 | 2000-01-27 | Fredrik Hübinette (Hubbe) | | #undef COUNT_BLOCK
#undef COUNT_OTHER
|
| 421801 | 1999-01-31 | Fredrik Hübinette (Hubbe) | |
|
| 2bfcfe | 1998-03-27 | Fredrik Hübinette (Hubbe) | | #define PRE_INIT_BLOCK(X)
|
| 21ed0e | 1998-02-19 | Fredrik Hübinette (Hubbe) | | #define INIT_BLOCK(X)
#define EXIT_BLOCK(X)
|
| cfa7d8 | 2000-01-27 | Fredrik Hübinette (Hubbe) | | #define COUNT_BLOCK(X)
#define COUNT_OTHER()
|
| 421801 | 1999-01-31 | Fredrik Hübinette (Hubbe) | |
|
| fc2c83 | 1999-04-01 | Fredrik Hübinette (Hubbe) | | #define BLOCK_ALLOC(DATA,BSIZE) \
\
struct PIKE_CONCAT(DATA,_block) \
{ \
struct PIKE_CONCAT(DATA,_block) *next; \
struct DATA x[BSIZE]; \
}; \
\
static struct PIKE_CONCAT(DATA,_block) *PIKE_CONCAT(DATA,_blocks)=0; \
static struct DATA *PIKE_CONCAT3(free_,DATA,s)=0; \
\
struct DATA *PIKE_CONCAT(alloc_,DATA)(void) \
{ \
struct DATA *tmp; \
if(!PIKE_CONCAT3(free_,DATA,s)) \
{ \
struct PIKE_CONCAT(DATA,_block) *n; \
int 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); \
} \
n->next=PIKE_CONCAT(DATA,_blocks); \
PIKE_CONCAT(DATA,_blocks)=n; \
\
for(e=0;e<BSIZE;e++) \
{ \
|
| 011ad3 | 1999-10-22 | Fredrik Hübinette (Hubbe) | | n->x[e].BLOCK_ALLOC_NEXT=PIKE_CONCAT3(free_,DATA,s); \
|
| fc2c83 | 1999-04-01 | Fredrik Hübinette (Hubbe) | | PRE_INIT_BLOCK( (n->x+e) ); \
PIKE_CONCAT3(free_,DATA,s)=n->x+e; \
} \
} \
\
tmp=PIKE_CONCAT3(free_,DATA,s); \
|
| 011ad3 | 1999-10-22 | Fredrik Hübinette (Hubbe) | | PIKE_CONCAT3(free_,DATA,s)=tmp->BLOCK_ALLOC_NEXT; \
DO_IF_DMALLOC( dmalloc_register(tmp,0, __FILE__, __LINE__); ) \
|
| fc2c83 | 1999-04-01 | Fredrik Hübinette (Hubbe) | | INIT_BLOCK(tmp); \
return tmp; \
} \
\
void PIKE_CONCAT(really_free_,DATA)(struct DATA *d) \
{ \
EXIT_BLOCK(d); \
|
| 011ad3 | 1999-10-22 | Fredrik Hübinette (Hubbe) | | DO_IF_DMALLOC( dmalloc_unregister(d, 1); ) \
d->BLOCK_ALLOC_NEXT=PIKE_CONCAT3(free_,DATA,s); \
|
| fc2c83 | 1999-04-01 | Fredrik Hübinette (Hubbe) | | PRE_INIT_BLOCK(d); \
PIKE_CONCAT3(free_,DATA,s)=d; \
} \
\
void PIKE_CONCAT3(free_all_,DATA,_blocks)(void) \
{ \
struct PIKE_CONCAT(DATA,_block) *tmp; \
while((tmp=PIKE_CONCAT(DATA,_blocks))) \
{ \
PIKE_CONCAT(DATA,_blocks)=tmp->next; \
free((char *)tmp); \
} \
PIKE_CONCAT(DATA,_blocks)=0; \
PIKE_CONCAT3(free_,DATA,s)=0; \
} \
|
| 424d9c | 1999-05-02 | Fredrik Hübinette (Hubbe) | | \
\
void PIKE_CONCAT3(count_memory_in_,DATA,s)(INT32 *num_, INT32 *size_) \
{ \
INT32 num=0, size=0; \
struct PIKE_CONCAT(DATA,_block) *tmp; \
struct DATA *tmp2; \
for(tmp=PIKE_CONCAT(DATA,_blocks);tmp;tmp=tmp->next) \
{ \
num+=BSIZE; \
size+=sizeof(struct PIKE_CONCAT(DATA,_block)); \
|
| cfa7d8 | 2000-01-27 | Fredrik Hübinette (Hubbe) | | COUNT_BLOCK(tmp); \
|
| 424d9c | 1999-05-02 | Fredrik Hübinette (Hubbe) | | } \
|
| 011ad3 | 1999-10-22 | Fredrik Hübinette (Hubbe) | | for(tmp2=PIKE_CONCAT3(free_,DATA,s);tmp2; \
tmp2=tmp2->BLOCK_ALLOC_NEXT) num--; \
|
| cfa7d8 | 2000-01-27 | Fredrik Hübinette (Hubbe) | | COUNT_OTHER(); \
|
| 424d9c | 1999-05-02 | Fredrik Hübinette (Hubbe) | | *num_=num; \
*size_=size; \
}
|
| fc2c83 | 1999-04-01 | Fredrik Hübinette (Hubbe) | |
|
| 011ad3 | 1999-10-22 | Fredrik Hübinette (Hubbe) | | #define PTR_HASH_ALLOC(DATA,BSIZE) \
\
BLOCK_ALLOC(DATA,BSIZE) \
\
static struct DATA **PIKE_CONCAT(DATA,_hash_table)=0; \
static int PIKE_CONCAT(DATA,_hash_table_size)=0; \
static int PIKE_CONCAT(num_,DATA)=0; \
\
inline struct DATA * \
PIKE_CONCAT(really_low_find_,DATA)(void *ptr, int hval) \
{ \
struct DATA *p,**pp; \
for(pp=PIKE_CONCAT(DATA,_hash_table)+hval;(p=*pp);pp=&p->BLOCK_ALLOC_NEXT) \
{ \
if(p->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) \
{ \
unsigned int hval=(long)ptr; \
hval%=PIKE_CONCAT(DATA,_hash_table_size); \
return PIKE_CONCAT(really_low_find_,DATA)(ptr, hval); \
} \
\
\
static void PIKE_CONCAT(DATA,_rehash)() \
{ \
/* Time to re-hash */ \
struct DATA **old_hash= PIKE_CONCAT(DATA,_hash_table); \
struct DATA *p; \
int hval; \
int e=PIKE_CONCAT(DATA,_hash_table_size); \
\
PIKE_CONCAT(DATA,_hash_table_size)*=2; \
PIKE_CONCAT(DATA,_hash_table_size)++; \
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=(long)(p-> data); \
hval%=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_CONCAT(make_,DATA)(void *ptr, int hval) \
{ \
struct DATA *p; \
\
DO_IF_DEBUG( if(!PIKE_CONCAT(DATA,_hash_table)) \
fatal("Hash table error!\n"); ) \
PIKE_CONCAT(num_,DATA)++; \
\
if(( PIKE_CONCAT(num_,DATA)>>2 ) >= \
PIKE_CONCAT(DATA,_hash_table_size)) \
{ \
PIKE_CONCAT(DATA,_rehash)(); \
hval=(long)ptr; \
hval%=PIKE_CONCAT(DATA,_hash_table_size); \
} \
\
p=PIKE_CONCAT(alloc_,DATA)(); \
p->data=ptr; \
p->BLOCK_ALLOC_NEXT=PIKE_CONCAT(DATA,_hash_table)[hval]; \
PIKE_CONCAT(DATA,_hash_table)[hval]=p; \
return p; \
} \
\
inline struct DATA *PIKE_CONCAT(get_,DATA)(void *ptr) \
{ \
struct DATA *p; \
int hval=(long)ptr; \
hval%=PIKE_CONCAT(DATA,_hash_table_size); \
if((p=PIKE_CONCAT(really_low_find_,DATA)(ptr, hval))) \
return p; \
\
return PIKE_CONCAT(make_,DATA)(ptr, hval); \
} \
\
int PIKE_CONCAT3(check_,DATA,_semafore)(void *ptr) \
{ \
struct DATA *p; \
int hval=(long)ptr; \
hval%=PIKE_CONCAT(DATA,_hash_table_size); \
if((p=PIKE_CONCAT(really_low_find_,DATA)(ptr, hval))) \
return 0; \
\
PIKE_CONCAT(make_,DATA)(ptr, hval); \
return 1; \
} \
\
int PIKE_CONCAT(remove_,DATA)(void *ptr) \
{ \
struct DATA *p; \
int hval=(long)ptr; \
if(!PIKE_CONCAT(DATA,_hash_table)) return 0; \
hval%=PIKE_CONCAT(DATA,_hash_table_size); \
if((p=PIKE_CONCAT(really_low_find_,DATA)(ptr, hval))) \
{ \
PIKE_CONCAT(num_,DATA)--; \
if(PIKE_CONCAT(DATA,_hash_table)[hval]!=p) fatal("GAOssdf\n"); \
PIKE_CONCAT(DATA,_hash_table)[hval]=p->BLOCK_ALLOC_NEXT; \
PIKE_CONCAT(really_free_,DATA)(p); \
return 1; \
} \
return 0; \
} \
\
void PIKE_CONCAT3(init_,DATA,_hash)(void) \
{ \
extern INT32 hashprimes[32]; \
extern int my_log2(unsigned INT32 x); \
PIKE_CONCAT(DATA,_hash_table_size)=hashprimes[my_log2(BSIZE)]; \
\
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)); \
} \
\
void PIKE_CONCAT3(exit_,DATA,_hash)(void) \
{ \
PIKE_CONCAT3(free_all_,DATA,_blocks)(); \
free(PIKE_CONCAT(DATA,_hash_table)); \
PIKE_CONCAT(DATA,_hash_table)=0; \
|
| 7bcb1d | 1999-12-19 | Fredrik Hübinette (Hubbe) | | PIKE_CONCAT(num_,DATA)=0; \
|
| 424d9c | 1999-05-02 | Fredrik Hübinette (Hubbe) | | }
|
| 21ed0e | 1998-02-19 | Fredrik Hübinette (Hubbe) | |
|
| 011ad3 | 1999-10-22 | Fredrik Hübinette (Hubbe) | | #define BLOCK_ALLOC_NEXT next
|