/original-bsd/usr.bin/pascal/pdx/tree/ |
H A D | opinfo.c | 26 /* O_INDEX */ UNARY, 0, 27 /* O_INDIR */ UNARY, "^", 28 /* O_RVAL */ UNARY, 0, 30 /* O_ITOF */ UNARY|INTOP, 0, 35 /* O_NEG */ UNARY|INTOP, "-", 36 /* O_NEGF */ UNARY|REALOP, "-",
|
H A D | opinfo.h | 113 #define UNARY 02 macro 121 #define isunary(o) isbitset(opinfo[o].opflags, UNARY) 127 #define degree(o) (opinfo[o].opflags&(LEAF|UNARY|BINARY))
|
H A D | tfree.c | 60 case UNARY:
|
H A D | tr_equal.c | 65 case UNARY:
|
H A D | prtree.c | 115 case UNARY:
|
H A D | build.c | 54 case UNARY:
|
/original-bsd/old/dbx/ |
H A D | operators.c | 107 #define UNARY 02 macro 115 #define isunary(o) isbitset(opinfo[ord(o)].opflags, UNARY) 121 #define degree(o) (opinfo[ord(o)].opflags&(LEAF|UNARY|BINARY)) 138 /* O_RVAL */ 1, UNARY, 0, 140 /* O_INDIR */ 1, UNARY, "^", 143 /* O_ITOF */ 1, UNARY|INTOP, 0, 148 /* O_NEG */ 1, UNARY|INTOP, "-", 149 /* O_NEGF */ 1, UNARY|REALOP, "-", 216 /* O_TYPERENAME */ 2, UNARY, "type rename", 219 /* O_UP */ 1, UNARY, "up", [all …]
|
/original-bsd/old/pcc/ccom.tahoe/ |
H A D | order.c | 35 if( p->in.left->in.op == UNARY MUL ){ 105 case UNARY CALL: 106 case UNARY STCALL: 270 if( p->in.op == UNARY MUL && !canaddr(p) ) { 280 if( p->in.op == UNARY MUL ){ 294 if( ro == UNARY MUL ) { 337 if( p->in.right->in.op == UNARY MUL ) 343 if( p->in.left->in.op == UNARY MUL ) { 367 if( ro == UNARY MUL && rt != CHAR ){ 389 case UNARY MUL: [all …]
|
H A D | mac2defs.h | 66 (o) == OREG || ((o) == UNARY MUL && shumul((p)->in.left)))
|
H A D | table.c | 271 UNARY CALL, INAREG|INTAREG, 277 UNARY CALL, INAREG|INTAREG, 283 UNARY CALL, INAREG|INTAREG, 289 UNARY CALL, INAREG|INTAREG, 516 UNARY MUL, FOREFF, 684 UNARY MINUS, INAREG|INTAREG|FORCC, 690 UNARY MINUS, INAREG|INTAREG|FORCC, 1072 UNARY MUL, DF( UNARY MUL ), 1098 OPUNARY, DF(UNARY MINUS),
|
H A D | local2.c | 897 (src->in.op == UNARY MUL && src->in.left->in.op == ICON) || 1052 case UNARY MUL: 1115 case UNARY MUL: 1117 return( p->in.op != UNARY MUL && shtemp(p) ); 1253 case UNARY MUL: 1299 if(p->in.op==UNARY FORTCALL && p->in.type==FLOAT && 1336 if( p->in.op == STCALL || p->in.op == UNARY STCALL ){ 1378 p->in.op = UNARY CALL; 1498 if( (l->in.op == CALL || l->in.op == UNARY CALL) && 1816 if( q->in.op == UNARY MUL ){ [all …]
|
/original-bsd/old/pcc/mip/ |
H A D | reader.c | 337 case UNARY CALL: 339 case UNARY STCALL: 348 case UNARY MUL: 529 case UNARY CALL: 531 case UNARY STCALL: 616 case UNARY MINUS: 637 case UNARY CALL: 654 case UNARY MUL: 786 case UNARY CALL: 792 case UNARY MUL: [all …]
|
H A D | cgram.y | 257 $$ = bdty( UNARY MUL, $2, 0 ); } 260 $$ = bdty( UNARY CALL, $1, 0 ); } 685 $$ = buildtree( UNARY $1, $2, NIL ); 692 else if( $2->in.op == UNARY MUL && 695 $2->in.left->in.op == UNARY STCALL) ){ 726 ={ $$=buildtree(UNARY CALL,$1,NIL); } 732 !($1->in.op == UNARY MUL && 737 $1 = buildtree( UNARY AND, $1, NIL ); 797 ={ $$ = bdty( UNARY CALL, $2, 0 ); } 836 case UNARY MUL: [all …]
|
H A D | common.c | 230 UNARY MINUS, "U-", UTYPE, 231 UNARY MUL, "U*", UTYPE, 232 UNARY AND, "U&", UTYPE, 233 UNARY CALL, "UCALL", UTYPE|CALLFLG, 234 UNARY FORTCALL, "UFCALL", UTYPE|CALLFLG, 298 UNARY STCALL, "USTCALL", UTYPE|CALLFLG,
|
H A D | trees.c | 106 case UNARY MINUS: 129 case UNARY MINUS: 441 case UNARY MUL: 452 case UNARY AND: 455 case UNARY MUL: 554 case UNARY CALL: 747 case UNARY MINUS: 928 case UNARY MUL: 1388 case UNARY CALL: 1389 case UNARY MUL: [all …]
|
H A D | common | 175 UNARY MINUS, "U-", UTYPE, 176 UNARY MUL, "U*", UTYPE, 177 UNARY AND, "U&", UTYPE, 178 UNARY CALL, "UCALL", UTYPE|CALLFLG, 179 UNARY FORTCALL, "UFCALL", UTYPE|CALLFLG, 241 UNARY STCALL, "USTCALL", UTYPE|CALLFLG,
|
H A D | optim.c | 31 p = buildtree( UNARY MUL, p, NIL ); 67 case UNARY AND: 80 case UNARY MUL:
|
/original-bsd/old/pcc/ccom.vax/ |
H A D | order.c | 50 if( p->in.left->in.op == UNARY MUL ){ 124 case UNARY CALL: 125 case UNARY STCALL: 315 if( p->in.op == UNARY MUL && !canaddr(p) ) { 325 if( p->in.op == UNARY MUL ){ 339 if( ro == UNARY MUL ) { 384 if( p->in.right->in.op == UNARY MUL ) 390 if( p->in.left->in.op == UNARY MUL ) { 414 if( ro == UNARY MUL && rt != CHAR ){ 439 case UNARY MUL: [all …]
|
H A D | table.c | 225 UNARY CALL, INTAREG, 231 UNARY CALL, INTAREG, 237 UNARY CALL, INAREG|INTAREG, 243 UNARY CALL, INAREG|INTAREG, 376 UNARY MUL, FOREFF, 445 UNARY MINUS, INTAREG|FORCC, 453 UNARY MINUS, INTAREG|FORCC, 726 UNARY MUL, DF( UNARY MUL ), 752 OPUNARY, DF(UNARY MINUS),
|
H A D | mac2defs.h | 66 (o) == OREG || ((o) == UNARY MUL && shumul((p)->in.left)))
|
H A D | local.c | 168 if( p->in.right->in.op != UNARY MINUS ) 169 p->in.right = buildtree( UNARY MINUS, p->in.right, NIL ); 183 if( p->in.left->in.op == UNARY MUL
|
H A D | local2.c | 475 p->in.op = UNARY MUL; 865 if( o==UNARY MUL && p->in.left->in.op==INCR && p->in.left->in.left->in.op==REG 922 case UNARY MUL: 979 case UNARY MUL: 981 return( p->in.op != UNARY MUL && shtemp(p) ); 1124 case UNARY MUL: 1195 if( p->in.op == STCALL || p->in.op == UNARY STCALL ){ 1226 p->in.op = UNARY CALL; 1380 if( (l->in.op == CALL || l->in.op == UNARY CALL) && 1708 if( q->in.op == UNARY MUL ){ [all …]
|
H A D | code.c | 138 l = buildtree( UNARY MUL, l, NIL ); in efcode() 139 r = buildtree( UNARY MUL, r, NIL ); in efcode()
|
/original-bsd/old/awk/ |
H A D | b.c | 28 #define UNARY case FINAL: case STAR: case PLUS: case QUEST: macro 80 UNARY 105 UNARY 178 UNARY
|
/original-bsd/old/pcc/lint/lpass1/ |
H A D | lint.c | 77 case UNARY CALL: 79 case UNARY STCALL: 81 case UNARY FORTCALL: 88 …if( p->in.op == UNARY MUL && ( p->in.type == STRTY || p->in.type == UNIONTY || p->in.type == UNDEF… 336 else if( p->in.op == UNARY AND ) use1 = VALADDR; 404 case UNARY CALL: 405 case UNARY STCALL: 406 case UNARY FORTCALL:
|