Blame | Last modification | View Log | Download | RSS feed
/** Copyright 1997, Regents of the University of Minnesota** macros.h** This file contains macros used in multilevel** Started 9/25/94* George** $Id: macros.h,v 1.1 2003/12/31 21:32:30 bates Exp $**//************************************************************************** The following macro returns a random number in the specified range**************************************************************************/#ifdef __VC__#define RandomInRange(u) ((rand()>>3)%(u))#define RandomInRangeFast(u) ((rand()>>3)%(u))#else#define RandomInRange(u) ((int)(drand48()*((double)(u))))#define RandomInRangeFast(u) ((rand()>>3)%(u))#endif#define amax(a, b) ((a) >= (b) ? (a) : (b))#define amin(a, b) ((a) >= (b) ? (b) : (a))#define AND(a, b) ((a) < 0 ? ((-(a))&(b)) : ((a)&(b)))#define OR(a, b) ((a) < 0 ? -((-(a))|(b)) : ((a)|(b)))#define XOR(a, b) ((a) < 0 ? -((-(a))^(b)) : ((a)^(b)))#define SWAP(a, b, tmp) \do {(tmp) = (a); (a) = (b); (b) = (tmp);} while(0)#define INC_DEC(a, b, val) \do {(a) += (val); (b) -= (val);} while(0)#define scopy(n, a, b) (float *)memcpy((void *)(b), (void *)(a), sizeof(float)*(n))#define idxcopy(n, a, b) (idxtype *)memcpy((void *)(b), (void *)(a), sizeof(idxtype)*(n))#define HASHFCT(key, size) ((key)%(size))/************************************************************************** Timer macros**************************************************************************/#define cleartimer(tmr) (tmr = 0.0)#define starttimer(tmr) (tmr -= seconds())#define stoptimer(tmr) (tmr += seconds())#define gettimer(tmr) (tmr)/************************************************************************** This macro is used to handle dbglvl**************************************************************************/#define IFSET(a, flag, cmd) if ((a)&(flag)) (cmd);/************************************************************************** These macros are used for debuging memory leaks**************************************************************************/#ifdef DMALLOC#define imalloc(n, msg) (malloc(sizeof(int)*(n)))#define fmalloc(n, msg) (malloc(sizeof(float)*(n)))#define idxmalloc(n, msg) (malloc(sizeof(idxtype)*(n)))#define ismalloc(n, val, msg) (iset((n), (val), malloc(sizeof(int)*(n))))#define idxsmalloc(n, val, msg) (idxset((n), (val), malloc(sizeof(idxtype)*(n))))#define GKmalloc(a, b) (malloc((a)))#endif#ifdef DMALLOC# define MALLOC_CHECK(ptr) \if (malloc_verify((ptr)) == DMALLOC_VERIFY_ERROR) { \printf("***MALLOC_CHECK failed on line %d of file %s: " #ptr "\n", \__LINE__, __FILE__); \abort(); \}#else# define MALLOC_CHECK(ptr) ;#endif/************************************************************************** This macro converts a length array in a CSR one**************************************************************************/#define MAKECSR(i, n, a) \do { \for (i=1; i<n; i++) a[i] += a[i-1]; \for (i=n; i>0; i--) a[i] = a[i-1]; \a[0] = 0; \} while(0)/************************************************************************** These macros insert and remove nodes from the boundary list**************************************************************************/#define BNDInsert(nbnd, bndind, bndptr, vtx) \do { \ASSERT(bndptr[vtx] == -1); \bndind[nbnd] = vtx; \bndptr[vtx] = nbnd++;\} while(0)#define BNDDelete(nbnd, bndind, bndptr, vtx) \do { \ASSERT(bndptr[vtx] != -1); \bndind[bndptr[vtx]] = bndind[--nbnd]; \bndptr[bndind[nbnd]] = bndptr[vtx]; \bndptr[vtx] = -1; \} while(0)/************************************************************************** These are debugging macros**************************************************************************/#ifdef DEBUG# define ASSERT(expr) \if (!(expr)) { \printf("***ASSERTION failed on line %d of file %s: " #expr "\n", \__LINE__, __FILE__); \abort(); \}#else# define ASSERT(expr) ;#endif#ifdef DEBUG# define ASSERTP(expr, msg) \if (!(expr)) { \printf("***ASSERTION failed on line %d of file %s: " #expr "\n", \__LINE__, __FILE__); \printf msg ; \abort(); \}#else# define ASSERTP(expr, msg) ;#endif