/* * $Id: t-test2.c,v 1.1 2003/06/18 03:02:49 jsquyres Exp $ * by Wolfram Gloger 1996-1999 * A multi-thread test for malloc performance, maintaining a single * global pool of allocated bins. */ #include "thread-m.h" #if USE_PTHREADS /* Posix threads */ #include pthread_cond_t finish_cond = PTHREAD_COND_INITIALIZER; pthread_mutex_t finish_mutex = PTHREAD_MUTEX_INITIALIZER; #endif #if (defined __STDC__ && __STDC__) || defined __cplusplus # include #endif #include #include #include #include #include #include #if !USE_MALLOC #include #else #include "ptmalloc.h" #endif #include "lran2.h" #include "t-test.h" #define N_TOTAL 10 #ifndef N_THREADS #define N_THREADS 2 #endif #ifndef N_TOTAL_PRINT #define N_TOTAL_PRINT 50 #endif #define STACKSIZE 32768 #ifndef MEMORY #define MEMORY 8000000l #endif #define SIZE 10000 #define I_MAX 10000 #define BINS_PER_BLOCK 20 #define RANDOM(d,s) (lran2(d) % (s)) struct block { struct bin b[BINS_PER_BLOCK]; mutex_t mutex; } *blocks; int n_blocks; #if TEST > 0 void bin_test() { int b, i; for(b=0; bseed); for(i=0; i<=st->max;) { #if TEST > 1 bin_test(); #endif bl = &blocks[RANDOM(&ld, n_blocks)]; r = RANDOM(&ld, 1024); if(r < 200) { /* free only */ mutex_lock(&bl->mutex); for(b=0; bb[b]); mutex_unlock(&bl->mutex); i += BINS_PER_BLOCK; } else { /* alloc/realloc */ /* Generate random numbers in advance. */ for(b=0; bsize) + 1; rnum[b] = lran2(&ld); } mutex_lock(&bl->mutex); for(b=0; bb[b], rsize[b], rnum[b]); mutex_unlock(&bl->mutex); i += BINS_PER_BLOCK; } #if TEST > 2 bin_test(); #endif } #if USE_PTHREADS pthread_mutex_lock(&finish_mutex); st->flags = 1; pthread_mutex_unlock(&finish_mutex); pthread_cond_signal(&finish_cond); return NULL; #elif USE_SPROC return; #else return NULL; #endif } int my_start_thread(struct thread_st *st) { #if USE_PTHREADS pthread_create(&st->id, NULL, malloc_test, st); #elif USE_THR if(!st->sp) st->sp = malloc(STACKSIZE); if(!st->sp) return -1; thr_create(st->sp, STACKSIZE, malloc_test, st, THR_NEW_LWP, &st->id); #elif USE_SPROC if(!st->sp) st->sp = malloc(STACKSIZE); if(!st->sp) return -1; st->id = sprocsp(malloc_test, PR_SALL, st, st->sp+STACKSIZE, STACKSIZE); if(st->id < 0) { return -1; } #else /* NO_THREADS */ st->id = 1; malloc_test(st); #endif return 0; } int n_total=0, n_total_max=N_TOTAL, n_running; int my_end_thread(struct thread_st *st) { /* Thread st has finished. Start a new one. */ #if 0 printf("Thread %lx terminated.\n", (long)st->id); #endif if(n_total >= n_total_max) { n_running--; } else if(my_start_thread(st)) { printf("Creating thread #%d failed.\n", n_total); } else { n_total++; if(n_total%N_TOTAL_PRINT == 0) printf("n_total = %d\n", n_total); } return 0; } int main(int argc, char *argv[]) { int i, j, bins; int n_thr=N_THREADS; int i_max=I_MAX; unsigned long size=SIZE; struct thread_st *st; #if USE_MALLOC && !defined(MALLOC_HOOKS) && !defined(__GLIBC__) ptmalloc_init(); #endif if(argc > 1) n_total_max = atoi(argv[1]); if(n_total_max < 1) n_thr = 1; if(argc > 2) n_thr = atoi(argv[2]); if(n_thr < 1) n_thr = 1; if(n_thr > 100) n_thr = 100; if(argc > 3) i_max = atoi(argv[3]); if(argc > 4) size = atol(argv[4]); if(size < 2) size = 2; bins = MEMORY/size; if(argc > 5) bins = atoi(argv[5]); if(bins < BINS_PER_BLOCK) bins = BINS_PER_BLOCK; n_blocks = bins/BINS_PER_BLOCK; blocks = (struct block *)malloc(n_blocks*sizeof(*blocks)); if(!blocks) exit(1); #if USE_PTHREADS printf("Using posix threads.\n"); pthread_cond_init(&finish_cond, NULL); pthread_mutex_init(&finish_mutex, NULL); #elif USE_THR printf("Using Solaris threads.\n"); #elif USE_SPROC printf("Using sproc() threads.\n"); #else printf("No threads.\n"); #endif printf("total=%d threads=%d i_max=%d size=%ld bins=%d\n", n_total_max, n_thr, i_max, size, n_blocks*BINS_PER_BLOCK); for(i=0; i0;) { #if USE_SPROC || USE_THR thread_id id; #endif /* Wait for subthreads to finish. */ #if USE_PTHREADS pthread_mutex_lock(&finish_mutex); pthread_cond_wait(&finish_cond, &finish_mutex); for(i=0; i