|
|
1.1 ! root 1: ! 2: /* basic typedefs & defines */ ! 3: /* $Header: imPdefs.h,v 10.2 86/02/01 16:00:23 tony Rel $ */ ! 4: ! 5: typedef short I16; ! 6: typedef short BDIM; ! 7: typedef char SDIM; ! 8: typedef unsigned short DISP; ! 9: typedef unsigned long LONGDISP; ! 10: typedef unsigned short RFC; ! 11: typedef unsigned short MSKWORD; ! 12: typedef unsigned short GLINK; ! 13: typedef unsigned short SYSCNV; ! 14: typedef unsigned char BYTE; ! 15: ! 16: #define MSKSHFT 4 ! 17: #define MSKHIGH 15 ! 18: #define NILPTR 0 ! 19: #define OOPTR ((char *)0xFFFFFFFF) ! 20: #define NILIDX -1 ! 21: #define TRUE 1 ! 22: #define FALSE 0 ! 23: ! 24: #define not ~ ! 25: #define REG register ! 26: ! 27: #define ADVPTR(p,n) ((char *)p+n) /* advances pointer 'p' 'n' bytes */ ! 28: ! 29: #define MLIWSIZ(w) ((w+15)>>4) ! 30: #define MLIBSIZ(w) ((w+7)>>3) ! 31: #define MSKWSIZ(w,h) (MLIWSIZ(w)*h) ! 32: #define SMWSIZ(p) MSKWSIZ(p->sgw,p->sgh) ! 33: #define BMWSIZ(p) MSKWSIZ(p->bgw,p->bgh) ! 34: #define GVWSIZ(t,p) (t==SMALL ? SGDWSIZ+SMWSIZ(((sgdims *)(p))) : \ ! 35: BGDWSIZ+BMWSIZ(((bgdims *)(p))) \ ! 36: ) ! 37: #define GLYWSIZ(p) (GHWSIZ+GVWSIZ(p->gsize,(char *)(p)+GHBSIZ)) ! 38: #define GPRECOMP(r,f) (((r<<14)|(f<<7)) % GHTLEN) /* not used by imPRESS */ ! 39: #define GPREHASH(r,f) gprehtab[(r<<7)|f] ! 40: #define GHASHIX(rfc) gprehtab[(rfc>>7)&0777] + (rfc&0177) ! 41: ! 42: #define FNAMLEN 8 ! 43: ! 44: typedef union { /******** DECODE PARAMETERS ***********/ ! 45: BDIM pval; /* parameter value */ ! 46: struct { ! 47: #ifdef XWIND ! 48: char loval; ! 49: char hival; ! 50: #else ! 51: char hival; ! 52: char loval; ! 53: #endif ! 54: } ! 55: pval2; ! 56: char *pptr; /* parameter address (w/input area) */ ! 57: } parva; /**************************************/ ! 58: parva param[10]; ! 59: #define V(i) (param[i].pval) ! 60: #define v(i) (param[i].pval2.loval) ! 61: #define P(i) (param[i].pptr) ! 62: /* extend sign for an int */ ! 63: #define EXTSIGN(n) if (v(n)<0) param[n].pval2.hival = 0377
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.