1 /* Copyright (c) 1979 Regents of the University of California */ 2 3 static char sccsid[] = "@(#)p2put.c 1.9 06/01/81"; 4 5 /* 6 * functions to help pi put out 7 * polish postfix binary portable c compiler intermediate code 8 * thereby becoming the portable pascal compiler 9 */ 10 11 #include "whoami.h" 12 #ifdef PC 13 #include "0.h" 14 #include "pcops.h" 15 #include "pc.h" 16 17 /* 18 * mash into f77's format 19 * lovely, isn't it? 20 */ 21 #define TOF77( fop,val,rest ) ( ( ( (rest) & 0177777 ) << 16 ) \ 22 | ( ( (val) & 0377 ) << 8 ) \ 23 | ( (fop) & 0377 ) ) 24 25 /* 26 * emits an ftext operator and a string to the pcstream 27 */ 28 puttext( string ) 29 char *string; 30 { 31 int length = str4len( string ); 32 33 if ( !CGENNING ) 34 return; 35 p2word( TOF77( P2FTEXT , length , 0 ) ); 36 # ifdef DEBUG 37 if ( opt( 'k' ) ) { 38 fprintf( stdout , "P2FTEXT | %3d | 0 " , length ); 39 } 40 # endif 41 p2string( string ); 42 } 43 44 int 45 str4len( string ) 46 char *string; 47 { 48 49 return ( ( strlen( string ) + 3 ) / 4 ); 50 } 51 52 /* 53 * put formatted text into a buffer for printing to the pcstream. 54 * a call to putpflush actually puts out the text. 55 * none of arg1 .. arg5 need be present. 56 * and you can add more if you need them. 57 */ 58 /* VARARGS */ 59 putprintf( format , incomplete , arg1 , arg2 , arg3 , arg4 , arg5 ) 60 char *format; 61 int incomplete; 62 { 63 static char ppbuffer[ BUFSIZ ]; 64 static char *ppbufp = ppbuffer; 65 66 if ( !CGENNING ) 67 return; 68 sprintf( ppbufp , format , arg1 , arg2 , arg3 , arg4 , arg5 ); 69 ppbufp = &( ppbuffer[ strlen( ppbuffer ) ] ); 70 if ( ppbufp >= &( ppbuffer[ BUFSIZ ] ) ) 71 panic( "putprintf" ); 72 if ( ! incomplete ) { 73 puttext( ppbuffer ); 74 ppbufp = ppbuffer; 75 } 76 } 77 78 /* 79 * emit a left bracket operator to pcstream 80 * with function number, the maximum temp register, and total local bytes 81 * until i figure out how to use them, regs 0 .. 11 are free. 82 * one idea for one reg is to save the display pointer on block entry 83 */ 84 putlbracket( ftnno , localbytes ) 85 int ftnno; 86 int localbytes; 87 { 88 # define MAXTP2REG 11 89 90 p2word( TOF77( P2FLBRAC , MAXTP2REG , ftnno ) ); 91 p2word( BITSPERBYTE * localbytes ); 92 # ifdef DEBUG 93 if ( opt( 'k' ) ) { 94 fprintf( stdout 95 , "P2FLBRAC | %3d | %d " , MAXTP2REG , ftnno ); 96 fprintf( stdout , "%d\n" 97 , BITSPERBYTE * localbytes ); 98 } 99 # endif 100 } 101 102 /* 103 * emit a right bracket operator 104 * which for the binary (fortran) interface 105 * forces the stack allocate and register mask 106 */ 107 putrbracket( ftnno ) 108 int ftnno; 109 { 110 111 p2word( TOF77( P2FRBRAC , 0 , ftnno ) ); 112 # ifdef DEBUG 113 if ( opt( 'k' ) ) { 114 fprintf( stdout , "P2FRBRAC | 0 | %d\n" , ftnno ); 115 } 116 # endif 117 } 118 119 /* 120 * emit an eof operator 121 */ 122 puteof() 123 { 124 125 p2word( P2FEOF ); 126 # ifdef DEBUG 127 if ( opt( 'k' ) ) { 128 fprintf( stdout , "P2FEOF\n" ); 129 } 130 # endif 131 } 132 133 /* 134 * emit a dot operator, 135 * with a source file line number and name 136 * if line is negative, there was an error on that line, but who cares? 137 */ 138 putdot( filename , line ) 139 char *filename; 140 int line; 141 { 142 int length = str4len( filename ); 143 144 if ( line < 0 ) { 145 line = -line; 146 } 147 p2word( TOF77( P2FEXPR , length , line ) ); 148 # ifdef DEBUG 149 if ( opt( 'k' ) ) { 150 fprintf( stdout , "P2FEXPR | %3d | %d " , length , line ); 151 } 152 # endif 153 p2string( filename ); 154 } 155 156 /* 157 * put out a leaf node 158 */ 159 putleaf( op , lval , rval , type , name ) 160 int op; 161 int lval; 162 int rval; 163 int type; 164 char *name; 165 { 166 if ( !CGENNING ) 167 return; 168 switch ( op ) { 169 default: 170 panic( "[putleaf]" ); 171 case P2ICON: 172 p2word( TOF77( P2ICON , name != NIL , type ) ); 173 p2word( lval ); 174 # ifdef DEBUG 175 if ( opt( 'k' ) ) { 176 fprintf( stdout , "P2ICON | %3d | 0x%x " 177 , name != NIL , type ); 178 fprintf( stdout , "%d\n" , lval ); 179 } 180 # endif 181 if ( name ) 182 p2name( name ); 183 break; 184 case P2NAME: 185 p2word( TOF77( P2NAME , lval != 0 , type ) ); 186 if ( lval ) 187 p2word( lval ); 188 # ifdef DEBUG 189 if ( opt( 'k' ) ) { 190 fprintf( stdout , "P2NAME | %3d | 0x%x " 191 , lval != 0 , type ); 192 if ( lval ) 193 fprintf( stdout , "%d " , lval ); 194 } 195 # endif 196 p2name( name ); 197 break; 198 case P2REG: 199 p2word( TOF77( P2REG , rval , type ) ); 200 # ifdef DEBUG 201 if ( opt( 'k' ) ) { 202 fprintf( stdout , "P2REG | %3d | 0x%x\n" , 203 rval , type ); 204 } 205 # endif 206 break; 207 } 208 } 209 210 /* 211 * rvalues are just lvalues with indirection, except 212 * special cases for registers and for named globals, 213 * whose names are their rvalues. 214 */ 215 putRV( name , level , offset , extra_flags , type ) 216 char *name; 217 int level; 218 int offset; 219 char extra_flags; 220 int type; 221 { 222 char extname[ BUFSIZ ]; 223 char *printname; 224 int regnumber; 225 226 if ( !CGENNING ) 227 return; 228 if ( extra_flags & NREGVAR ) { 229 if ( ( offset < 0 ) || ( offset > P2FP ) ) { 230 panic( "putRV regvar" ); 231 } 232 putleaf( P2REG , 0 , offset , type , 0 ); 233 return; 234 } 235 if ( whereis( level , offset , extra_flags ) == GLOBALVAR ) { 236 if ( name != 0 ) { 237 if ( name[0] != '_' ) { 238 sprintf( extname , EXTFORMAT , name ); 239 printname = extname; 240 } else { 241 printname = name; 242 } 243 putleaf( P2NAME , offset , 0 , type , printname ); 244 return; 245 } else { 246 panic( "putRV no name" ); 247 } 248 } 249 putLV( name , level , offset , extra_flags , type ); 250 putop( P2UNARY P2MUL , type ); 251 } 252 253 /* 254 * put out an lvalue 255 * given a level and offset 256 * special case for 257 * named globals, whose lvalues are just their names as constants. 258 */ 259 putLV( name , level , offset , extra_flags , type ) 260 char *name; 261 int level; 262 int offset; 263 char extra_flags; 264 int type; 265 { 266 char extname[ BUFSIZ ]; 267 char *printname; 268 269 if ( !CGENNING ) 270 return; 271 if ( extra_flags & NREGVAR ) { 272 panic( "putLV regvar" ); 273 } 274 switch ( whereis( level , offset , extra_flags ) ) { 275 case GLOBALVAR: 276 if ( ( name != 0 ) ) { 277 if ( name[0] != '_' ) { 278 sprintf( extname , EXTFORMAT , name ); 279 printname = extname; 280 } else { 281 printname = name; 282 } 283 putleaf( P2ICON , offset , 0 , ADDTYPE( type , P2PTR ) 284 , printname ); 285 return; 286 } else { 287 panic( "putLV no name" ); 288 } 289 case PARAMVAR: 290 if ( level == cbn ) { 291 putleaf( P2REG , 0 , P2AP , ADDTYPE( type , P2PTR ) , 0 ); 292 } else { 293 putleaf( P2NAME , (level * sizeof(struct dispsave)) + AP_OFFSET 294 , 0 , P2PTR | P2CHAR , DISPLAYNAME ); 295 } 296 putleaf( P2ICON , offset , 0 , P2INT , 0 ); 297 putop( P2PLUS , P2PTR | P2CHAR ); 298 break; 299 case LOCALVAR: 300 if ( level == cbn ) { 301 putleaf( P2REG , 0 , P2FP , ADDTYPE( type , P2PTR ) , 0 ); 302 } else { 303 putleaf( P2NAME , (level * sizeof(struct dispsave)) + FP_OFFSET 304 , 0 , P2PTR | P2CHAR , DISPLAYNAME ); 305 } 306 putleaf( P2ICON , -offset , 0 , P2INT , 0 ); 307 putop( P2MINUS , P2PTR | P2CHAR ); 308 break; 309 } 310 return; 311 } 312 313 /* 314 * put out a floating point constant leaf node 315 * the constant is declared in aligned data space 316 * and a P2NAME leaf put out for it 317 */ 318 putCON8( value ) 319 double value; 320 { 321 int label; 322 char name[ BUFSIZ ]; 323 324 if ( !CGENNING ) 325 return; 326 putprintf( " .data" , 0 ); 327 putprintf( " .align 2" , 0 ); 328 label = getlab(); 329 putlab( label ); 330 putprintf( " .double 0d%.20e" , 0 , value ); 331 putprintf( " .text" , 0 ); 332 sprintf( name , PREFIXFORMAT , LABELPREFIX , label ); 333 putleaf( P2NAME , 0 , 0 , P2DOUBLE , name ); 334 } 335 336 /* 337 * put out either an lvalue or an rvalue for a constant string. 338 * an lvalue (for assignment rhs's) is the name as a constant, 339 * an rvalue (for parameters) is just the name. 340 */ 341 putCONG( string , length , required ) 342 char *string; 343 int length; 344 int required; 345 { 346 char name[ BUFSIZ ]; 347 int label; 348 char *cp; 349 int pad; 350 int others; 351 352 if ( !CGENNING ) 353 return; 354 putprintf( " .data" , 0 ); 355 label = getlab(); 356 putlab( label ); 357 cp = string; 358 while ( *cp ) { 359 putprintf( " .byte 0%o" , 1 , *cp ++ ); 360 for ( others = 2 ; ( others <= 8 ) && *cp ; others ++ ) { 361 putprintf( ",0%o" , 1 , *cp++ ); 362 } 363 putprintf( "" , 0 ); 364 } 365 pad = length - strlen( string ); 366 while ( pad-- > 0 ) { 367 putprintf( " .byte 0%o" , 1 , ' ' ); 368 for ( others = 2 ; ( others <= 8 ) && ( pad-- > 0 ) ; others++ ) { 369 putprintf( ",0%o" , 1 , ' ' ); 370 } 371 putprintf( "" , 0 ); 372 } 373 putprintf( " .byte 0" , 0 ); 374 putprintf( " .text" , 0 ); 375 sprintf( name , PREFIXFORMAT , LABELPREFIX , label ); 376 if ( required == RREQ ) { 377 putleaf( P2NAME , 0 , 0 , P2ARY | P2CHAR , name ); 378 } else { 379 putleaf( P2ICON , 0 , 0 , P2PTR | P2CHAR , name ); 380 } 381 } 382 383 /* 384 * map a pascal type to a c type 385 * this would be tail recursive, but i unfolded it into a for (;;). 386 * this is sort of like isa and lwidth 387 * a note on the types used by the portable c compiler: 388 * they are divided into a basic type (char, short, int, long, etc.) 389 * and qualifications on those basic types (pointer, function, array). 390 * the basic type is kept in the low 4 bits of the type descriptor, 391 * and the qualifications are arranged in two bit chunks, with the 392 * most significant on the right, 393 * and the least significant on the left 394 * e.g. int *foo(); 395 * (a function returning a pointer to an integer) 396 * is stored as 397 * <ptr><ftn><int> 398 * so, we build types recursively 399 * also, we know that /lib/f1 can only deal with 6 qualifications 400 * so we stop the recursion there. this stops infinite type recursion 401 * through mutually recursive pointer types. 402 */ 403 #define MAXQUALS 6 404 int 405 p2type( np ) 406 { 407 408 return typerecur( np , 0 ); 409 } 410 typerecur( np , quals ) 411 struct nl *np; 412 int quals; 413 { 414 415 if ( np == NIL || quals > MAXQUALS ) { 416 return P2UNDEF; 417 } 418 switch ( np -> class ) { 419 case SCAL : 420 case RANGE : 421 if ( np -> type == ( nl + TDOUBLE ) ) { 422 return P2DOUBLE; 423 } 424 switch ( bytes( np -> range[0] , np -> range[1] ) ) { 425 case 1: 426 return P2CHAR; 427 case 2: 428 return P2SHORT; 429 case 4: 430 return P2INT; 431 default: 432 panic( "p2type int" ); 433 } 434 case STR : 435 return ( P2ARY | P2CHAR ); 436 case RECORD : 437 case SET : 438 return P2STRTY; 439 case FILET : 440 return ( P2PTR | P2STRTY ); 441 case CONST : 442 case VAR : 443 case FIELD : 444 return p2type( np -> type ); 445 case TYPE : 446 switch ( nloff( np ) ) { 447 case TNIL : 448 return ( P2PTR | P2UNDEF ); 449 case TSTR : 450 return ( P2ARY | P2CHAR ); 451 case TSET : 452 return P2STRTY; 453 default : 454 return ( p2type( np -> type ) ); 455 } 456 case REF: 457 case WITHPTR: 458 case PTR : 459 return ADDTYPE( typerecur( np -> type , quals + 1 ) , P2PTR ); 460 case ARRAY : 461 return ADDTYPE( typerecur( np -> type , quals + 1 ) , P2ARY ); 462 case FUNC : 463 /* 464 * functions are really pointers to functions 465 * which return their underlying type. 466 */ 467 return ADDTYPE( ADDTYPE( typerecur( np -> type , quals + 2 ) , 468 P2FTN ) , P2PTR ); 469 case PROC : 470 /* 471 * procedures are pointers to functions 472 * which return integers (whether you look at them or not) 473 */ 474 return ADDTYPE( ADDTYPE( P2INT , P2FTN ) , P2PTR ); 475 case FFUNC : 476 case FPROC : 477 /* 478 * formal procedures and functions are pointers 479 * to structures which describe their environment. 480 */ 481 return ( P2PTR | P2STRTY ); 482 default : 483 panic( "p2type" ); 484 } 485 } 486 487 /* 488 * add a most significant type modifier to a type 489 */ 490 long 491 addtype( underlying , mtype ) 492 long underlying; 493 long mtype; 494 { 495 return ( ( ( underlying & ~P2BASETYPE ) << P2TYPESHIFT ) 496 | mtype 497 | ( underlying & P2BASETYPE ) ); 498 } 499 500 /* 501 * put a typed operator to the pcstream 502 */ 503 putop( op , type ) 504 int op; 505 int type; 506 { 507 extern char *p2opnames[]; 508 509 if ( !CGENNING ) 510 return; 511 p2word( TOF77( op , 0 , type ) ); 512 # ifdef DEBUG 513 if ( opt( 'k' ) ) { 514 fprintf( stdout , "%s (%d) | 0 | 0x%x\n" 515 , p2opnames[ op ] , op , type ); 516 } 517 # endif 518 } 519 520 /* 521 * put out a structure operator (STASG, STARG, STCALL, UNARY STCALL ) 522 * which looks just like a regular operator, only the size and 523 * alignment go in the next consecutive words 524 */ 525 putstrop( op , type , size , alignment ) 526 int op; 527 int type; 528 int size; 529 int alignment; 530 { 531 extern char *p2opnames[]; 532 533 if ( !CGENNING ) 534 return; 535 p2word( TOF77( op , 0 , type ) ); 536 p2word( size ); 537 p2word( alignment ); 538 # ifdef DEBUG 539 if ( opt( 'k' ) ) { 540 fprintf( stdout , "%s (%d) | 0 | 0x%x %d %d\n" 541 , p2opnames[ op ] , op , type , size , alignment ); 542 } 543 # endif 544 } 545 546 /* 547 * the string names of p2ops 548 */ 549 char *p2opnames[] = { 550 "", 551 "P2UNDEFINED", /* 1 */ 552 "P2NAME", /* 2 */ 553 "P2STRING", /* 3 */ 554 "P2ICON", /* 4 */ 555 "P2FCON", /* 5 */ 556 "P2PLUS", /* 6 */ 557 "", 558 "P2MINUS", /* 8 also unary == P2NEG */ 559 "", 560 "P2NEG", 561 "P2MUL", /* 11 also unary == P2INDIRECT */ 562 "", 563 "P2INDIRECT", 564 "P2AND", /* 14 also unary == P2ADDROF */ 565 "", 566 "P2ADDROF", 567 "P2OR", /* 17 */ 568 "", 569 "P2ER", /* 19 */ 570 "", 571 "P2QUEST", /* 21 */ 572 "P2COLON", /* 22 */ 573 "P2ANDAND", /* 23 */ 574 "P2OROR", /* 24 */ 575 "", /* 25 */ 576 "", /* 26 */ 577 "", /* 27 */ 578 "", /* 28 */ 579 "", /* 29 */ 580 "", /* 30 */ 581 "", /* 31 */ 582 "", /* 32 */ 583 "", /* 33 */ 584 "", /* 34 */ 585 "", /* 35 */ 586 "", /* 36 */ 587 "", /* 37 */ 588 "", /* 38 */ 589 "", /* 39 */ 590 "", /* 40 */ 591 "", /* 41 */ 592 "", /* 42 */ 593 "", /* 43 */ 594 "", /* 44 */ 595 "", /* 45 */ 596 "", /* 46 */ 597 "", /* 47 */ 598 "", /* 48 */ 599 "", /* 49 */ 600 "", /* 50 */ 601 "", /* 51 */ 602 "", /* 52 */ 603 "", /* 53 */ 604 "", /* 54 */ 605 "", /* 55 */ 606 "P2LISTOP", /* 56 */ 607 "", 608 "P2ASSIGN", /* 58 */ 609 "P2COMOP", /* 59 */ 610 "P2DIV", /* 60 */ 611 "", 612 "P2MOD", /* 62 */ 613 "", 614 "P2LS", /* 64 */ 615 "", 616 "P2RS", /* 66 */ 617 "", 618 "P2DOT", /* 68 */ 619 "P2STREF", /* 69 */ 620 "P2CALL", /* 70 also unary */ 621 "", 622 "P2UNARYCALL", 623 "P2FORTCALL", /* 73 also unary */ 624 "", 625 "P2UNARYFORTCALL", 626 "P2NOT", /* 76 */ 627 "P2COMPL", /* 77 */ 628 "P2INCR", /* 78 */ 629 "P2DECR", /* 79 */ 630 "P2EQ", /* 80 */ 631 "P2NE", /* 81 */ 632 "P2LE", /* 82 */ 633 "P2LT", /* 83 */ 634 "P2GE", /* 84 */ 635 "P2GT", /* 85 */ 636 "P2ULE", /* 86 */ 637 "P2ULT", /* 87 */ 638 "P2UGE", /* 88 */ 639 "P2UGT", /* 89 */ 640 "P2SETBIT", /* 90 */ 641 "P2TESTBIT", /* 91 */ 642 "P2RESETBIT", /* 92 */ 643 "P2ARS", /* 93 */ 644 "P2REG", /* 94 */ 645 "P2OREG", /* 95 */ 646 "P2CCODES", /* 96 */ 647 "P2FREE", /* 97 */ 648 "P2STASG", /* 98 */ 649 "P2STARG", /* 99 */ 650 "P2STCALL", /* 100 also unary */ 651 "", 652 "P2UNARYSTCALL", 653 "P2FLD", /* 103 */ 654 "P2SCONV", /* 104 */ 655 "P2PCONV", /* 105 */ 656 "P2PMCONV", /* 106 */ 657 "P2PVCONV", /* 107 */ 658 "P2FORCE", /* 108 */ 659 "P2CBRANCH", /* 109 */ 660 "P2INIT", /* 110 */ 661 "P2CAST", /* 111 */ 662 }; 663 664 /* 665 * low level routines 666 */ 667 668 /* 669 * puts a long word on the pcstream 670 */ 671 p2word( word ) 672 long word; 673 { 674 675 putw( word , pcstream ); 676 } 677 678 /* 679 * put a length 0 mod 4 null padded string onto the pcstream 680 */ 681 p2string( string ) 682 char *string; 683 { 684 int slen = strlen( string ); 685 int wlen = ( slen + 3 ) / 4; 686 int plen = ( wlen * 4 ) - slen; 687 char *cp; 688 int p; 689 690 for ( cp = string ; *cp ; cp++ ) 691 putc( *cp , pcstream ); 692 for ( p = 1 ; p <= plen ; p++ ) 693 putc( '\0' , pcstream ); 694 # ifdef DEBUG 695 if ( opt( 'k' ) ) { 696 fprintf( stdout , "\"%s" , string ); 697 for ( p = 1 ; p <= plen ; p++ ) 698 fprintf( stdout , "\\0" ); 699 fprintf( stdout , "\"\n" ); 700 } 701 # endif 702 } 703 704 /* 705 * puts a name on the pcstream 706 */ 707 p2name( name ) 708 char *name; 709 { 710 int pad; 711 712 fprintf( pcstream , NAMEFORMAT , name ); 713 pad = strlen( name ) % sizeof (long); 714 for ( ; pad < sizeof (long) ; pad++ ) { 715 putc( '\0' , pcstream ); 716 } 717 # ifdef DEBUG 718 if ( opt( 'k' ) ) { 719 fprintf( stdout , NAMEFORMAT , name ); 720 pad = strlen( name ) % sizeof (long); 721 for ( ; pad < sizeof (long) ; pad++ ) { 722 fprintf( stdout , "\\0" ); 723 } 724 fprintf( stdout , "\n" ); 725 } 726 # endif 727 } 728 729 /* 730 * put out a jump to a label 731 */ 732 putjbr( label ) 733 long label; 734 { 735 736 printjbr( LABELPREFIX , label ); 737 } 738 739 /* 740 * put out a jump to any kind of label 741 */ 742 printjbr( prefix , label ) 743 char *prefix; 744 long label; 745 { 746 747 putprintf( " jbr " , 1 ); 748 putprintf( PREFIXFORMAT , 0 , prefix , label ); 749 } 750 751 /* 752 * another version of put to catch calls to put 753 */ 754 put( arg1 , arg2 ) 755 { 756 757 putprintf( "# PUT CALLED!: arg1 = %d arg2 = 0%o" , 0 , arg1 , arg2 ); 758 } 759 760 #endif PC 761