![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to calls.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [GCC 2.x] / gcc|
Return to calls.c CVS log | Up to [GCC 2.x] / gcc |
1.1 root 1: /* Convert function calls to rtl insns, for GNU C compiler. 1.1.1.7 ! root 2: Copyright (C) 1989, 1992, 1993, 1994 Free Software Foundation, Inc. 1.1 root 3: 4: This file is part of GNU CC. 5: 6: GNU CC is free software; you can redistribute it and/or modify 7: it under the terms of the GNU General Public License as published by 8: the Free Software Foundation; either version 2, or (at your option) 9: any later version. 10: 11: GNU CC is distributed in the hope that it will be useful, 12: but WITHOUT ANY WARRANTY; without even the implied warranty of 13: MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14: GNU General Public License for more details. 15: 16: You should have received a copy of the GNU General Public License 17: along with GNU CC; see the file COPYING. If not, write to 18: the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ 19: 20: #include "config.h" 21: #include "rtl.h" 22: #include "tree.h" 23: #include "flags.h" 24: #include "expr.h" 1.1.1.7 ! root 25: #ifdef __STDC__ ! 26: #include <stdarg.h> ! 27: #else ! 28: #include <varargs.h> ! 29: #endif 1.1 root 30: #include "insn-flags.h" 31: 32: /* Decide whether a function's arguments should be processed 1.1.1.5 root 33: from first to last or from last to first. 34: 35: They should if the stack and args grow in opposite directions, but 36: only if we have push insns. */ 1.1 root 37: 38: #ifdef PUSH_ROUNDING 1.1.1.5 root 39: 1.1.1.6 root 40: #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD) 1.1 root 41: #define PUSH_ARGS_REVERSED /* If it's last to first */ 42: #endif 1.1.1.5 root 43: 1.1 root 44: #endif 45: 46: /* Like STACK_BOUNDARY but in units of bytes, not bits. */ 47: #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT) 48: 49: /* Data structure and subroutines used within expand_call. */ 50: 51: struct arg_data 52: { 53: /* Tree node for this argument. */ 54: tree tree_value; 1.1.1.5 root 55: /* Mode for value; TYPE_MODE unless promoted. */ 56: enum machine_mode mode; 1.1 root 57: /* Current RTL value for argument, or 0 if it isn't precomputed. */ 58: rtx value; 59: /* Initially-compute RTL value for argument; only for const functions. */ 60: rtx initial_value; 61: /* Register to pass this argument in, 0 if passed on stack, or an 62: EXPR_LIST if the arg is to be copied into multiple different 63: registers. */ 64: rtx reg; 1.1.1.4 root 65: /* If REG was promoted from the actual mode of the argument expression, 66: indicates whether the promotion is sign- or zero-extended. */ 67: int unsignedp; 1.1 root 68: /* Number of registers to use. 0 means put the whole arg in registers. 69: Also 0 if not passed in registers. */ 70: int partial; 1.1.1.3 root 71: /* Non-zero if argument must be passed on stack. 72: Note that some arguments may be passed on the stack 73: even though pass_on_stack is zero, just because FUNCTION_ARG says so. 74: pass_on_stack identifies arguments that *cannot* go in registers. */ 1.1 root 75: int pass_on_stack; 76: /* Offset of this argument from beginning of stack-args. */ 77: struct args_size offset; 78: /* Similar, but offset to the start of the stack slot. Different from 79: OFFSET if this arg pads downward. */ 80: struct args_size slot_offset; 81: /* Size of this argument on the stack, rounded up for any padding it gets, 82: parts of the argument passed in registers do not count. 83: If REG_PARM_STACK_SPACE is defined, then register parms 84: are counted here as well. */ 85: struct args_size size; 86: /* Location on the stack at which parameter should be stored. The store 87: has already been done if STACK == VALUE. */ 88: rtx stack; 89: /* Location on the stack of the start of this argument slot. This can 90: differ from STACK if this arg pads downward. This location is known 91: to be aligned to FUNCTION_ARG_BOUNDARY. */ 92: rtx stack_slot; 93: #ifdef ACCUMULATE_OUTGOING_ARGS 94: /* Place that this stack area has been saved, if needed. */ 95: rtx save_area; 96: #endif 1.1.1.5 root 97: #ifdef STRICT_ALIGNMENT 98: /* If an argument's alignment does not permit direct copying into registers, 99: copy in smaller-sized pieces into pseudos. These are stored in a 100: block pointed to by this field. The next field says how many 101: word-sized pseudos we made. */ 102: rtx *aligned_regs; 103: int n_aligned_regs; 104: #endif 1.1 root 105: }; 106: 107: #ifdef ACCUMULATE_OUTGOING_ARGS 1.1.1.4 root 108: /* A vector of one char per byte of stack space. A byte if non-zero if 1.1 root 109: the corresponding stack location has been used. 110: This vector is used to prevent a function call within an argument from 111: clobbering any stack already set up. */ 112: static char *stack_usage_map; 113: 114: /* Size of STACK_USAGE_MAP. */ 115: static int highest_outgoing_arg_in_use; 1.1.1.3 root 116: 117: /* stack_arg_under_construction is nonzero when an argument may be 118: initialized with a constructor call (including a C function that 119: returns a BLKmode struct) and expand_call must take special action 120: to make sure the object being constructed does not overlap the 121: argument list for the constructor call. */ 122: int stack_arg_under_construction; 1.1 root 123: #endif 124: 1.1.1.5 root 125: static int calls_function PROTO((tree, int)); 1.1.1.6 root 126: static int calls_function_1 PROTO((tree, int)); 1.1.1.5 root 127: static void emit_call_1 PROTO((rtx, tree, int, int, rtx, rtx, int, 128: rtx, int)); 129: static void store_one_arg PROTO ((struct arg_data *, rtx, int, int, 130: tree, int)); 1.1 root 131: 1.1.1.5 root 132: /* If WHICH is 1, return 1 if EXP contains a call to the built-in function 133: `alloca'. 134: 135: If WHICH is 0, return 1 if EXP contains a call to any function. 136: Actually, we only need return 1 if evaluating EXP would require pushing 137: arguments on the stack, but that is too difficult to compute, so we just 138: assume any function call might require the stack. */ 1.1 root 139: 1.1.1.6 root 140: static tree calls_function_save_exprs; 141: 1.1 root 142: static int 1.1.1.5 root 143: calls_function (exp, which) 1.1 root 144: tree exp; 1.1.1.5 root 145: int which; 1.1 root 146: { 1.1.1.6 root 147: int val; 148: calls_function_save_exprs = 0; 149: val = calls_function_1 (exp, which); 150: calls_function_save_exprs = 0; 151: return val; 152: } 153: 154: static int 155: calls_function_1 (exp, which) 156: tree exp; 157: int which; 158: { 1.1 root 159: register int i; 1.1.1.7 ! root 160: enum tree_code code = TREE_CODE (exp); ! 161: int type = TREE_CODE_CLASS (code); ! 162: int length = tree_code_length[(int) code]; ! 163: ! 164: /* If this code is langauge-specific, we don't know what it will do. */ ! 165: if ((int) code >= NUM_TREE_CODES) ! 166: return 1; 1.1 root 167: 168: /* Only expressions and references can contain calls. */ 1.1.1.4 root 169: if (type != 'e' && type != '<' && type != '1' && type != '2' && type != 'r' 170: && type != 'b') 1.1 root 171: return 0; 172: 1.1.1.7 ! root 173: switch (code) 1.1 root 174: { 175: case CALL_EXPR: 1.1.1.5 root 176: if (which == 0) 177: return 1; 178: else if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR 179: && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)) 1.1.1.7 ! root 180: == FUNCTION_DECL)) ! 181: { ! 182: tree fndecl = TREE_OPERAND (TREE_OPERAND (exp, 0), 0); ! 183: ! 184: if ((DECL_BUILT_IN (fndecl) ! 185: && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_ALLOCA) ! 186: || (DECL_SAVED_INSNS (fndecl) ! 187: && (FUNCTION_FLAGS (DECL_SAVED_INSNS (fndecl)) ! 188: & FUNCTION_FLAGS_CALLS_ALLOCA))) ! 189: return 1; ! 190: } 1.1 root 191: 192: /* Third operand is RTL. */ 193: length = 2; 194: break; 195: 196: case SAVE_EXPR: 197: if (SAVE_EXPR_RTL (exp) != 0) 198: return 0; 1.1.1.6 root 199: if (value_member (exp, calls_function_save_exprs)) 200: return 0; 201: calls_function_save_exprs = tree_cons (NULL_TREE, exp, 202: calls_function_save_exprs); 203: return (TREE_OPERAND (exp, 0) != 0 204: && calls_function_1 (TREE_OPERAND (exp, 0), which)); 1.1 root 205: 206: case BLOCK: 1.1.1.4 root 207: { 208: register tree local; 209: 210: for (local = BLOCK_VARS (exp); local; local = TREE_CHAIN (local)) 1.1.1.5 root 211: if (DECL_INITIAL (local) != 0 1.1.1.6 root 212: && calls_function_1 (DECL_INITIAL (local), which)) 1.1.1.4 root 213: return 1; 214: } 215: { 216: register tree subblock; 217: 218: for (subblock = BLOCK_SUBBLOCKS (exp); 219: subblock; 220: subblock = TREE_CHAIN (subblock)) 1.1.1.6 root 221: if (calls_function_1 (subblock, which)) 1.1.1.4 root 222: return 1; 223: } 224: return 0; 1.1 root 225: 226: case METHOD_CALL_EXPR: 227: length = 3; 228: break; 229: 230: case WITH_CLEANUP_EXPR: 231: length = 1; 232: break; 233: 234: case RTL_EXPR: 235: return 0; 236: } 237: 238: for (i = 0; i < length; i++) 239: if (TREE_OPERAND (exp, i) != 0 1.1.1.6 root 240: && calls_function_1 (TREE_OPERAND (exp, i), which)) 1.1 root 241: return 1; 242: 243: return 0; 244: } 245: 246: /* Force FUNEXP into a form suitable for the address of a CALL, 247: and return that as an rtx. Also load the static chain register 248: if FNDECL is a nested function. 249: 1.1.1.7 ! root 250: CALL_FUSAGE points to a variable holding the prospective ! 251: CALL_INSN_FUNCTION_USAGE information. */ 1.1 root 252: 253: rtx 1.1.1.7 ! root 254: prepare_call_address (funexp, fndecl, call_fusage, reg_parm_seen) 1.1 root 255: rtx funexp; 256: tree fndecl; 1.1.1.7 ! root 257: rtx *call_fusage; ! 258: int reg_parm_seen; 1.1 root 259: { 260: rtx static_chain_value = 0; 261: 262: funexp = protect_from_queue (funexp, 0); 263: 264: if (fndecl != 0) 265: /* Get possible static chain value for nested function in C. */ 266: static_chain_value = lookup_static_chain (fndecl); 267: 268: /* Make a valid memory address and copy constants thru pseudo-regs, 269: but not for a constant address if -fno-function-cse. */ 270: if (GET_CODE (funexp) != SYMBOL_REF) 1.1.1.7 ! root 271: funexp = ! 272: #ifdef SMALL_REGISTER_CLASSES ! 273: /* If we are using registers for parameters, force the ! 274: function address into a register now. */ ! 275: reg_parm_seen ? force_not_mem (memory_address (FUNCTION_MODE, funexp)) ! 276: : ! 277: #endif ! 278: memory_address (FUNCTION_MODE, funexp); 1.1 root 279: else 280: { 281: #ifndef NO_FUNCTION_CSE 282: if (optimize && ! flag_no_function_cse) 283: #ifdef NO_RECURSIVE_FUNCTION_CSE 284: if (fndecl != current_function_decl) 285: #endif 286: funexp = force_reg (Pmode, funexp); 287: #endif 288: } 289: 290: if (static_chain_value != 0) 291: { 292: emit_move_insn (static_chain_rtx, static_chain_value); 293: 1.1.1.7 ! root 294: use_reg (call_fusage, static_chain_rtx); 1.1 root 295: } 296: 297: return funexp; 298: } 299: 300: /* Generate instructions to call function FUNEXP, 301: and optionally pop the results. 302: The CALL_INSN is the first insn generated. 303: 304: FUNTYPE is the data type of the function, or, for a library call, 305: the identifier for the name of the call. This is given to the 306: macro RETURN_POPS_ARGS to determine whether this function pops its own args. 307: 308: STACK_SIZE is the number of bytes of arguments on the stack, 309: rounded up to STACK_BOUNDARY; zero if the size is variable. 310: This is both to put into the call insn and 311: to generate explicit popping code if necessary. 312: 313: STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value. 314: It is zero if this call doesn't want a structure value. 315: 316: NEXT_ARG_REG is the rtx that results from executing 317: FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1) 318: just after all the args have had their registers assigned. 319: This could be whatever you like, but normally it is the first 320: arg-register beyond those used for args in this call, 321: or 0 if all the arg-registers are used in this call. 322: It is passed on to `gen_call' so you can put this info in the call insn. 323: 324: VALREG is a hard register in which a value is returned, 325: or 0 if the call does not return a value. 326: 327: OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before 328: the args to this call were processed. 329: We restore `inhibit_defer_pop' to that value. 330: 1.1.1.7 ! root 331: CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that ! 332: denote registers used by the called function. 1.1 root 333: 334: IS_CONST is true if this is a `const' call. */ 335: 1.1.1.5 root 336: static void 1.1 root 337: emit_call_1 (funexp, funtype, stack_size, struct_value_size, next_arg_reg, 1.1.1.7 ! root 338: valreg, old_inhibit_defer_pop, call_fusage, is_const) 1.1 root 339: rtx funexp; 340: tree funtype; 341: int stack_size; 342: int struct_value_size; 343: rtx next_arg_reg; 344: rtx valreg; 345: int old_inhibit_defer_pop; 1.1.1.7 ! root 346: rtx call_fusage; 1.1 root 347: int is_const; 348: { 1.1.1.4 root 349: rtx stack_size_rtx = GEN_INT (stack_size); 350: rtx struct_value_size_rtx = GEN_INT (struct_value_size); 1.1 root 351: rtx call_insn; 352: int already_popped = 0; 353: 354: /* Ensure address is valid. SYMBOL_REF is already valid, so no need, 355: and we don't want to load it into a register as an optimization, 356: because prepare_call_address already did it if it should be done. */ 357: if (GET_CODE (funexp) != SYMBOL_REF) 358: funexp = memory_address (FUNCTION_MODE, funexp); 359: 360: #ifndef ACCUMULATE_OUTGOING_ARGS 361: #if defined (HAVE_call_pop) && defined (HAVE_call_value_pop) 362: if (HAVE_call_pop && HAVE_call_value_pop 363: && (RETURN_POPS_ARGS (funtype, stack_size) > 0 || stack_size == 0)) 364: { 1.1.1.4 root 365: rtx n_pop = GEN_INT (RETURN_POPS_ARGS (funtype, stack_size)); 1.1 root 366: rtx pat; 367: 368: /* If this subroutine pops its own args, record that in the call insn 369: if possible, for the sake of frame pointer elimination. */ 370: if (valreg) 371: pat = gen_call_value_pop (valreg, 372: gen_rtx (MEM, FUNCTION_MODE, funexp), 373: stack_size_rtx, next_arg_reg, n_pop); 374: else 375: pat = gen_call_pop (gen_rtx (MEM, FUNCTION_MODE, funexp), 376: stack_size_rtx, next_arg_reg, n_pop); 377: 378: emit_call_insn (pat); 379: already_popped = 1; 380: } 381: else 382: #endif 383: #endif 384: 385: #if defined (HAVE_call) && defined (HAVE_call_value) 386: if (HAVE_call && HAVE_call_value) 387: { 388: if (valreg) 389: emit_call_insn (gen_call_value (valreg, 390: gen_rtx (MEM, FUNCTION_MODE, funexp), 1.1.1.5 root 391: stack_size_rtx, next_arg_reg, 392: NULL_RTX)); 1.1 root 393: else 394: emit_call_insn (gen_call (gen_rtx (MEM, FUNCTION_MODE, funexp), 395: stack_size_rtx, next_arg_reg, 396: struct_value_size_rtx)); 397: } 398: else 399: #endif 400: abort (); 401: 1.1.1.7 ! root 402: /* Find the CALL insn we just emitted. */ 1.1 root 403: for (call_insn = get_last_insn (); 404: call_insn && GET_CODE (call_insn) != CALL_INSN; 405: call_insn = PREV_INSN (call_insn)) 406: ; 407: 408: if (! call_insn) 409: abort (); 410: 1.1.1.7 ! root 411: /* Put the register usage information on the CALL. If there is already ! 412: some usage information, put ours at the end. */ ! 413: if (CALL_INSN_FUNCTION_USAGE (call_insn)) ! 414: { ! 415: rtx link; ! 416: ! 417: for (link = CALL_INSN_FUNCTION_USAGE (call_insn); XEXP (link, 1) != 0; ! 418: link = XEXP (link, 1)) ! 419: ; ! 420: ! 421: XEXP (link, 1) = call_fusage; ! 422: } ! 423: else ! 424: CALL_INSN_FUNCTION_USAGE (call_insn) = call_fusage; 1.1 root 425: 426: /* If this is a const call, then set the insn's unchanging bit. */ 427: if (is_const) 428: CONST_CALL_P (call_insn) = 1; 429: 1.1.1.5 root 430: /* Restore this now, so that we do defer pops for this call's args 431: if the context of the call as a whole permits. */ 432: inhibit_defer_pop = old_inhibit_defer_pop; 433: 1.1 root 434: #ifndef ACCUMULATE_OUTGOING_ARGS 435: /* If returning from the subroutine does not automatically pop the args, 436: we need an instruction to pop them sooner or later. 437: Perhaps do it now; perhaps just record how much space to pop later. 438: 439: If returning from the subroutine does pop the args, indicate that the 440: stack pointer will be changed. */ 441: 442: if (stack_size != 0 && RETURN_POPS_ARGS (funtype, stack_size) > 0) 443: { 444: if (!already_popped) 1.1.1.7 ! root 445: CALL_INSN_FUNCTION_USAGE (call_insn) = ! 446: gen_rtx (EXPR_LIST, VOIDmode, ! 447: gen_rtx (CLOBBER, VOIDmode, stack_pointer_rtx), ! 448: CALL_INSN_FUNCTION_USAGE (call_insn)); 1.1 root 449: stack_size -= RETURN_POPS_ARGS (funtype, stack_size); 1.1.1.4 root 450: stack_size_rtx = GEN_INT (stack_size); 1.1 root 451: } 452: 453: if (stack_size != 0) 454: { 1.1.1.5 root 455: if (flag_defer_pop && inhibit_defer_pop == 0 && !is_const) 1.1 root 456: pending_stack_adjust += stack_size; 457: else 458: adjust_stack (stack_size_rtx); 459: } 460: #endif 461: } 462: 463: /* Generate all the code for a function call 464: and return an rtx for its value. 465: Store the value in TARGET (specified as an rtx) if convenient. 466: If the value is stored in TARGET then TARGET is returned. 467: If IGNORE is nonzero, then we ignore the value of the function call. */ 468: 469: rtx 1.1.1.3 root 470: expand_call (exp, target, ignore) 1.1 root 471: tree exp; 472: rtx target; 473: int ignore; 474: { 475: /* List of actual parameters. */ 476: tree actparms = TREE_OPERAND (exp, 1); 477: /* RTX for the function to be called. */ 478: rtx funexp; 479: /* Tree node for the function to be called (not the address!). */ 480: tree funtree; 481: /* Data type of the function. */ 482: tree funtype; 483: /* Declaration of the function being called, 484: or 0 if the function is computed (not known by name). */ 485: tree fndecl = 0; 486: char *name = 0; 487: 488: /* Register in which non-BLKmode value will be returned, 489: or 0 if no value or if value is BLKmode. */ 490: rtx valreg; 491: /* Address where we should return a BLKmode value; 492: 0 if value not BLKmode. */ 493: rtx structure_value_addr = 0; 494: /* Nonzero if that address is being passed by treating it as 495: an extra, implicit first parameter. Otherwise, 496: it is passed by being copied directly into struct_value_rtx. */ 497: int structure_value_addr_parm = 0; 498: /* Size of aggregate value wanted, or zero if none wanted 499: or if we are using the non-reentrant PCC calling convention 500: or expecting the value in registers. */ 501: int struct_value_size = 0; 502: /* Nonzero if called function returns an aggregate in memory PCC style, 503: by returning the address of where to find it. */ 504: int pcc_struct_value = 0; 505: 506: /* Number of actual parameters in this call, including struct value addr. */ 507: int num_actuals; 508: /* Number of named args. Args after this are anonymous ones 509: and they must all go on the stack. */ 510: int n_named_args; 511: /* Count arg position in order args appear. */ 512: int argpos; 513: 514: /* Vector of information about each argument. 515: Arguments are numbered in the order they will be pushed, 516: not the order they are written. */ 517: struct arg_data *args; 518: 519: /* Total size in bytes of all the stack-parms scanned so far. */ 520: struct args_size args_size; 521: /* Size of arguments before any adjustments (such as rounding). */ 522: struct args_size original_args_size; 523: /* Data on reg parms scanned so far. */ 524: CUMULATIVE_ARGS args_so_far; 525: /* Nonzero if a reg parm has been scanned. */ 526: int reg_parm_seen; 1.1.1.5 root 527: /* Nonzero if this is an indirect function call. */ 528: int current_call_is_indirect = 0; 1.1 root 529: 530: /* Nonzero if we must avoid push-insns in the args for this call. 531: If stack space is allocated for register parameters, but not by the 532: caller, then it is preallocated in the fixed part of the stack frame. 533: So the entire argument block must then be preallocated (i.e., we 534: ignore PUSH_ROUNDING in that case). */ 535: 536: #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE) 537: int must_preallocate = 1; 538: #else 539: #ifdef PUSH_ROUNDING 540: int must_preallocate = 0; 541: #else 542: int must_preallocate = 1; 543: #endif 544: #endif 545: 1.1.1.4 root 546: /* Size of the stack reserved for parameter registers. */ 1.1.1.3 root 547: int reg_parm_stack_space = 0; 548: 1.1 root 549: /* 1 if scanning parms front to back, -1 if scanning back to front. */ 550: int inc; 551: /* Address of space preallocated for stack parms 552: (on machines that lack push insns), or 0 if space not preallocated. */ 553: rtx argblock = 0; 554: 555: /* Nonzero if it is plausible that this is a call to alloca. */ 556: int may_be_alloca; 557: /* Nonzero if this is a call to setjmp or a related function. */ 558: int returns_twice; 559: /* Nonzero if this is a call to `longjmp'. */ 560: int is_longjmp; 561: /* Nonzero if this is a call to an inline function. */ 562: int is_integrable = 0; 563: /* Nonzero if this is a call to a `const' function. 564: Note that only explicitly named functions are handled as `const' here. */ 565: int is_const = 0; 566: /* Nonzero if this is a call to a `volatile' function. */ 567: int is_volatile = 0; 568: #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE) 569: /* Define the boundary of the register parm stack space that needs to be 570: save, if any. */ 571: int low_to_save = -1, high_to_save; 572: rtx save_area = 0; /* Place that it is saved */ 573: #endif 574: 575: #ifdef ACCUMULATE_OUTGOING_ARGS 576: int initial_highest_arg_in_use = highest_outgoing_arg_in_use; 577: char *initial_stack_usage_map = stack_usage_map; 578: #endif 579: 580: rtx old_stack_level = 0; 1.1.1.7 ! root 581: int old_pending_adj = 0; 1.1.1.3 root 582: int old_stack_arg_under_construction; 1.1 root 583: int old_inhibit_defer_pop = inhibit_defer_pop; 584: tree old_cleanups = cleanups_this_call; 1.1.1.7 ! root 585: rtx call_fusage = 0; 1.1 root 586: register tree p; 1.1.1.5 root 587: register int i, j; 1.1 root 588: 589: /* See if we can find a DECL-node for the actual function. 590: As a result, decide whether this is a call to an integrable function. */ 591: 592: p = TREE_OPERAND (exp, 0); 593: if (TREE_CODE (p) == ADDR_EXPR) 594: { 595: fndecl = TREE_OPERAND (p, 0); 596: if (TREE_CODE (fndecl) != FUNCTION_DECL) 1.1.1.7 ! root 597: fndecl = 0; 1.1 root 598: else 599: { 600: if (!flag_no_inline 601: && fndecl != current_function_decl 602: && DECL_SAVED_INSNS (fndecl)) 603: is_integrable = 1; 604: else if (! TREE_ADDRESSABLE (fndecl)) 605: { 1.1.1.5 root 606: /* In case this function later becomes inlinable, 1.1 root 607: record that there was already a non-inline call to it. 608: 609: Use abstraction instead of setting TREE_ADDRESSABLE 610: directly. */ 1.1.1.7 ! root 611: if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline) ! 612: warning_with_decl (fndecl, "can't inline call to `%s'"); 1.1 root 613: mark_addressable (fndecl); 614: } 615: 616: if (TREE_READONLY (fndecl) && ! TREE_THIS_VOLATILE (fndecl) 617: && TYPE_MODE (TREE_TYPE (exp)) != VOIDmode) 618: is_const = 1; 1.1.1.6 root 619: 620: if (TREE_THIS_VOLATILE (fndecl)) 621: is_volatile = 1; 1.1 root 622: } 623: } 624: 1.1.1.7 ! root 625: /* If we don't have specific function to call, see if we have a ! 626: constant or `noreturn' function from the type. */ ! 627: if (fndecl == 0) ! 628: { ! 629: is_const = TREE_READONLY (TREE_TYPE (TREE_TYPE (p))); ! 630: is_volatile = TREE_THIS_VOLATILE (TREE_TYPE (TREE_TYPE (p))); ! 631: } ! 632: 1.1.1.3 root 633: #ifdef REG_PARM_STACK_SPACE 634: #ifdef MAYBE_REG_PARM_STACK_SPACE 635: reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE; 636: #else 637: reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl); 638: #endif 639: #endif 640: 1.1 root 641: /* Warn if this value is an aggregate type, 642: regardless of which calling convention we are using for it. */ 1.1.1.7 ! root 643: if (warn_aggregate_return && AGGREGATE_TYPE_P (TREE_TYPE (exp))) 1.1 root 644: warning ("function call has aggregate value"); 645: 646: /* Set up a place to return a structure. */ 647: 648: /* Cater to broken compilers. */ 649: if (aggregate_value_p (exp)) 650: { 651: /* This call returns a big structure. */ 652: is_const = 0; 653: 654: #ifdef PCC_STATIC_STRUCT_RETURN 1.1.1.5 root 655: { 656: pcc_struct_value = 1; 1.1.1.7 ! root 657: /* Easier than making that case work right. */ ! 658: if (is_integrable) ! 659: { ! 660: /* In case this is a static function, note that it has been ! 661: used. */ ! 662: if (! TREE_ADDRESSABLE (fndecl)) ! 663: mark_addressable (fndecl); ! 664: is_integrable = 0; ! 665: } 1.1.1.5 root 666: } 667: #else /* not PCC_STATIC_STRUCT_RETURN */ 668: { 669: struct_value_size = int_size_in_bytes (TREE_TYPE (exp)); 1.1 root 670: 1.1.1.5 root 671: if (target && GET_CODE (target) == MEM) 672: structure_value_addr = XEXP (target, 0); 673: else 674: { 675: /* Assign a temporary on the stack to hold the value. */ 1.1 root 676: 1.1.1.5 root 677: /* For variable-sized objects, we must be called with a target 678: specified. If we were to allocate space on the stack here, 679: we would have no way of knowing when to free it. */ 680: 1.1.1.7 ! root 681: if (struct_value_size < 0) ! 682: abort (); ! 683: 1.1.1.5 root 684: structure_value_addr 685: = XEXP (assign_stack_temp (BLKmode, struct_value_size, 1), 0); 686: target = 0; 687: } 688: } 689: #endif /* not PCC_STATIC_STRUCT_RETURN */ 1.1 root 690: } 691: 692: /* If called function is inline, try to integrate it. */ 693: 694: if (is_integrable) 695: { 696: rtx temp; 1.1.1.3 root 697: rtx before_call = get_last_insn (); 1.1 root 698: 699: temp = expand_inline_function (fndecl, actparms, target, 700: ignore, TREE_TYPE (exp), 701: structure_value_addr); 702: 703: /* If inlining succeeded, return. */ 1.1.1.4 root 704: if ((HOST_WIDE_INT) temp != -1) 1.1 root 705: { 1.1.1.7 ! root 706: if (flag_short_temps) ! 707: { ! 708: /* Perform all cleanups needed for the arguments of this ! 709: call (i.e. destructors in C++). It is ok if these ! 710: destructors clobber RETURN_VALUE_REG, because the ! 711: only time we care about this is when TARGET is that ! 712: register. But in C++, we take care to never return ! 713: that register directly. */ ! 714: expand_cleanups_to (old_cleanups); ! 715: } 1.1 root 716: 1.1.1.3 root 717: #ifdef ACCUMULATE_OUTGOING_ARGS 718: /* If the outgoing argument list must be preserved, push 719: the stack before executing the inlined function if it 720: makes any calls. */ 721: 722: for (i = reg_parm_stack_space - 1; i >= 0; i--) 723: if (i < highest_outgoing_arg_in_use && stack_usage_map[i] != 0) 724: break; 725: 726: if (stack_arg_under_construction || i >= 0) 727: { 728: rtx insn = NEXT_INSN (before_call), seq; 729: 730: /* Look for a call in the inline function code. 731: If OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl)) is 732: nonzero then there is a call and it is not necessary 733: to scan the insns. */ 734: 735: if (OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl)) == 0) 736: for (; insn; insn = NEXT_INSN (insn)) 737: if (GET_CODE (insn) == CALL_INSN) 738: break; 739: 740: if (insn) 741: { 742: /* Reserve enough stack space so that the largest 743: argument list of any function call in the inline 744: function does not overlap the argument list being 745: evaluated. This is usually an overestimate because 746: allocate_dynamic_stack_space reserves space for an 747: outgoing argument list in addition to the requested 748: space, but there is no way to ask for stack space such 749: that an argument list of a certain length can be 750: safely constructed. */ 751: 752: int adjust = OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl)); 753: #ifdef REG_PARM_STACK_SPACE 754: /* Add the stack space reserved for register arguments 755: in the inline function. What is really needed is the 756: largest value of reg_parm_stack_space in the inline 757: function, but that is not available. Using the current 758: value of reg_parm_stack_space is wrong, but gives 759: correct results on all supported machines. */ 760: adjust += reg_parm_stack_space; 761: #endif 762: start_sequence (); 1.1.1.5 root 763: emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX); 1.1.1.4 root 764: allocate_dynamic_stack_space (GEN_INT (adjust), 765: NULL_RTX, BITS_PER_UNIT); 1.1.1.3 root 766: seq = get_insns (); 767: end_sequence (); 768: emit_insns_before (seq, NEXT_INSN (before_call)); 1.1.1.4 root 769: emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX); 1.1.1.3 root 770: } 771: } 772: #endif 773: 1.1 root 774: /* If the result is equivalent to TARGET, return TARGET to simplify 775: checks in store_expr. They can be equivalent but not equal in the 776: case of a function that returns BLKmode. */ 777: if (temp != target && rtx_equal_p (temp, target)) 778: return target; 779: return temp; 780: } 781: 782: /* If inlining failed, mark FNDECL as needing to be compiled 1.1.1.7 ! root 783: separately after all. If function was declared inline, ! 784: give a warning. */ ! 785: if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline ! 786: && ! TREE_ADDRESSABLE (fndecl)) ! 787: warning_with_decl (fndecl, "can't inline call to `%s'"); 1.1 root 788: mark_addressable (fndecl); 789: } 790: 791: /* When calling a const function, we must pop the stack args right away, 792: so that the pop is deleted or moved with the call. */ 793: if (is_const) 794: NO_DEFER_POP; 795: 796: function_call_count++; 797: 798: if (fndecl && DECL_NAME (fndecl)) 799: name = IDENTIFIER_POINTER (DECL_NAME (fndecl)); 800: 1.1.1.5 root 801: /* On some machines (such as the PA) indirect calls have a different 802: calling convention than normal calls. FUNCTION_ARG in the target 803: description can look at current_call_is_indirect to determine which 804: calling convention to use. */ 805: current_call_is_indirect = (fndecl == 0); 806: #if 0 807: = TREE_CODE (TREE_OPERAND (exp, 0)) == NON_LVALUE_EXPR ? 1 : 0; 808: #endif 809: 1.1 root 810: #if 0 811: /* Unless it's a call to a specific function that isn't alloca, 812: if it has one argument, we must assume it might be alloca. */ 813: 814: may_be_alloca = 815: (!(fndecl != 0 && strcmp (name, "alloca")) 816: && actparms != 0 817: && TREE_CHAIN (actparms) == 0); 818: #else 819: /* We assume that alloca will always be called by name. It 820: makes no sense to pass it as a pointer-to-function to 821: anything that does not understand its behavior. */ 822: may_be_alloca = 823: (name && ((IDENTIFIER_LENGTH (DECL_NAME (fndecl)) == 6 824: && name[0] == 'a' 825: && ! strcmp (name, "alloca")) 826: || (IDENTIFIER_LENGTH (DECL_NAME (fndecl)) == 16 827: && name[0] == '_' 828: && ! strcmp (name, "__builtin_alloca")))); 829: #endif 830: 831: /* See if this is a call to a function that can return more than once 832: or a call to longjmp. */ 833: 834: returns_twice = 0; 835: is_longjmp = 0; 836: 837: if (name != 0 && IDENTIFIER_LENGTH (DECL_NAME (fndecl)) <= 15) 838: { 839: char *tname = name; 840: 1.1.1.6 root 841: /* Disregard prefix _, __ or __x. */ 1.1 root 842: if (name[0] == '_') 1.1.1.6 root 843: { 844: if (name[1] == '_' && name[2] == 'x') 845: tname += 3; 846: else if (name[1] == '_') 847: tname += 2; 848: else 849: tname += 1; 850: } 1.1 root 851: 852: if (tname[0] == 's') 853: { 854: returns_twice 855: = ((tname[1] == 'e' 856: && (! strcmp (tname, "setjmp") 857: || ! strcmp (tname, "setjmp_syscall"))) 858: || (tname[1] == 'i' 859: && ! strcmp (tname, "sigsetjmp")) 860: || (tname[1] == 'a' 861: && ! strcmp (tname, "savectx"))); 862: if (tname[1] == 'i' 863: && ! strcmp (tname, "siglongjmp")) 864: is_longjmp = 1; 865: } 866: else if ((tname[0] == 'q' && tname[1] == 's' 867: && ! strcmp (tname, "qsetjmp")) 868: || (tname[0] == 'v' && tname[1] == 'f' 869: && ! strcmp (tname, "vfork"))) 870: returns_twice = 1; 871: 872: else if (tname[0] == 'l' && tname[1] == 'o' 873: && ! strcmp (tname, "longjmp")) 874: is_longjmp = 1; 875: } 876: 877: if (may_be_alloca) 878: current_function_calls_alloca = 1; 879: 880: /* Don't let pending stack adjusts add up to too much. 881: Also, do all pending adjustments now 882: if there is any chance this might be a call to alloca. */ 883: 884: if (pending_stack_adjust >= 32 885: || (pending_stack_adjust > 0 && may_be_alloca)) 886: do_pending_stack_adjust (); 887: 888: /* Operand 0 is a pointer-to-function; get the type of the function. */ 889: funtype = TREE_TYPE (TREE_OPERAND (exp, 0)); 890: if (TREE_CODE (funtype) != POINTER_TYPE) 891: abort (); 892: funtype = TREE_TYPE (funtype); 893: 1.1.1.7 ! root 894: /* Push the temporary stack slot level so that we can free any temporaries ! 895: we make. */ 1.1 root 896: push_temp_slots (); 897: 898: /* Start updating where the next arg would go. */ 1.1.1.5 root 899: INIT_CUMULATIVE_ARGS (args_so_far, funtype, NULL_RTX); 1.1 root 900: 901: /* If struct_value_rtx is 0, it means pass the address 902: as if it were an extra parameter. */ 903: if (structure_value_addr && struct_value_rtx == 0) 904: { 1.1.1.7 ! root 905: /* If structure_value_addr is a REG other than ! 906: virtual_outgoing_args_rtx, we can use always use it. If it ! 907: is not a REG, we must always copy it into a register. ! 908: If it is virtual_outgoing_args_rtx, we must copy it to another ! 909: register in some cases. */ ! 910: rtx temp = (GET_CODE (structure_value_addr) != REG 1.1.1.3 root 911: #ifdef ACCUMULATE_OUTGOING_ARGS 1.1.1.7 ! root 912: || (stack_arg_under_construction ! 913: && structure_value_addr == virtual_outgoing_args_rtx) 1.1.1.3 root 914: #endif 1.1.1.7 ! root 915: ? copy_addr_to_reg (structure_value_addr) ! 916: : structure_value_addr); 1.1.1.3 root 917: 1.1 root 918: actparms 919: = tree_cons (error_mark_node, 920: make_tree (build_pointer_type (TREE_TYPE (funtype)), 1.1.1.3 root 921: temp), 1.1 root 922: actparms); 923: structure_value_addr_parm = 1; 924: } 925: 926: /* Count the arguments and set NUM_ACTUALS. */ 927: for (p = actparms, i = 0; p; p = TREE_CHAIN (p)) i++; 928: num_actuals = i; 929: 930: /* Compute number of named args. 931: Normally, don't include the last named arg if anonymous args follow. 932: (If no anonymous args follow, the result of list_length 933: is actually one too large.) 934: 935: If SETUP_INCOMING_VARARGS is defined, this machine will be able to 936: place unnamed args that were passed in registers into the stack. So 937: treat all args as named. This allows the insns emitting for a specific 1.1.1.2 root 938: argument list to be independent of the function declaration. 1.1 root 939: 940: If SETUP_INCOMING_VARARGS is not defined, we do not have any reliable 941: way to pass unnamed args in registers, so we must force them into 942: memory. */ 943: #ifndef SETUP_INCOMING_VARARGS 944: if (TYPE_ARG_TYPES (funtype) != 0) 945: n_named_args 946: = list_length (TYPE_ARG_TYPES (funtype)) - 1 947: /* Count the struct value address, if it is passed as a parm. */ 948: + structure_value_addr_parm; 949: else 950: #endif 951: /* If we know nothing, treat all args as named. */ 952: n_named_args = num_actuals; 953: 954: /* Make a vector to hold all the information about each arg. */ 955: args = (struct arg_data *) alloca (num_actuals * sizeof (struct arg_data)); 1.1.1.7 ! root 956: bzero ((char *) args, num_actuals * sizeof (struct arg_data)); 1.1 root 957: 958: args_size.constant = 0; 959: args_size.var = 0; 960: 961: /* In this loop, we consider args in the order they are written. 962: We fill up ARGS from the front of from the back if necessary 963: so that in any case the first arg to be pushed ends up at the front. */ 964: 965: #ifdef PUSH_ARGS_REVERSED 966: i = num_actuals - 1, inc = -1; 967: /* In this case, must reverse order of args 968: so that we compute and push the last arg first. */ 969: #else 970: i = 0, inc = 1; 971: #endif 972: 973: /* I counts args in order (to be) pushed; ARGPOS counts in order written. */ 974: for (p = actparms, argpos = 0; p; p = TREE_CHAIN (p), i += inc, argpos++) 975: { 976: tree type = TREE_TYPE (TREE_VALUE (p)); 1.1.1.7 ! root 977: int unsignedp; 1.1.1.4 root 978: enum machine_mode mode; 1.1 root 979: 980: args[i].tree_value = TREE_VALUE (p); 981: 982: /* Replace erroneous argument with constant zero. */ 983: if (type == error_mark_node || TYPE_SIZE (type) == 0) 984: args[i].tree_value = integer_zero_node, type = integer_type_node; 985: 1.1.1.7 ! root 986: /* If TYPE is a transparent union, pass things the way we would ! 987: pass the first field of the union. We have already verified that ! 988: the modes are the same. */ ! 989: if (TYPE_TRANSPARENT_UNION (type)) ! 990: type = TREE_TYPE (TYPE_FIELDS (type)); ! 991: 1.1 root 992: /* Decide where to pass this arg. 993: 994: args[i].reg is nonzero if all or part is passed in registers. 995: 996: args[i].partial is nonzero if part but not all is passed in registers, 997: and the exact value says how many words are passed in registers. 998: 999: args[i].pass_on_stack is nonzero if the argument must at least be 1000: computed on the stack. It may then be loaded back into registers 1001: if args[i].reg is nonzero. 1002: 1003: These decisions are driven by the FUNCTION_... macros and must agree 1004: with those made by function.c. */ 1005: 1006: /* See if this argument should be passed by invisible reference. */ 1.1.1.6 root 1007: if ((TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST 1008: && contains_placeholder_p (TYPE_SIZE (type))) 1.1.1.7 ! root 1009: || TYPE_NEEDS_CONSTRUCTING (type) 1.1.1.6 root 1010: #ifdef FUNCTION_ARG_PASS_BY_REFERENCE 1011: || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, TYPE_MODE (type), 1012: type, argpos < n_named_args) 1013: #endif 1014: ) 1.1 root 1015: { 1.1.1.5 root 1016: #ifdef FUNCTION_ARG_CALLEE_COPIES 1017: if (FUNCTION_ARG_CALLEE_COPIES (args_so_far, TYPE_MODE (type), type, 1018: argpos < n_named_args) 1019: /* If it's in a register, we must make a copy of it too. */ 1020: /* ??? Is this a sufficient test? Is there a better one? */ 1021: && !(TREE_CODE (args[i].tree_value) == VAR_DECL 1022: && REG_P (DECL_RTL (args[i].tree_value)))) 1023: { 1024: args[i].tree_value = build1 (ADDR_EXPR, 1025: build_pointer_type (type), 1026: args[i].tree_value); 1027: type = build_pointer_type (type); 1028: } 1029: else 1030: #endif 1.1 root 1031: { 1.1.1.5 root 1032: /* We make a copy of the object and pass the address to the 1033: function being called. */ 1034: rtx copy; 1.1 root 1035: 1.1.1.5 root 1036: if (TYPE_SIZE (type) == 0 1037: || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST) 1.1 root 1038: { 1.1.1.5 root 1039: /* This is a variable-sized object. Make space on the stack 1040: for it. */ 1041: rtx size_rtx = expr_size (TREE_VALUE (p)); 1042: 1043: if (old_stack_level == 0) 1044: { 1045: emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX); 1046: old_pending_adj = pending_stack_adjust; 1047: pending_stack_adjust = 0; 1048: } 1049: 1050: copy = gen_rtx (MEM, BLKmode, 1051: allocate_dynamic_stack_space (size_rtx, 1052: NULL_RTX, 1053: TYPE_ALIGN (type))); 1054: } 1055: else 1056: { 1057: int size = int_size_in_bytes (type); 1058: copy = assign_stack_temp (TYPE_MODE (type), size, 1); 1.1 root 1059: } 1060: 1.1.1.7 ! root 1061: MEM_IN_STRUCT_P (copy) = AGGREGATE_TYPE_P (type); 1.1.1.6 root 1062: 1.1.1.5 root 1063: store_expr (args[i].tree_value, copy, 0); 1.1 root 1064: 1.1.1.5 root 1065: args[i].tree_value = build1 (ADDR_EXPR, 1066: build_pointer_type (type), 1067: make_tree (type, copy)); 1068: type = build_pointer_type (type); 1069: } 1.1 root 1070: } 1071: 1.1.1.4 root 1072: mode = TYPE_MODE (type); 1.1.1.7 ! root 1073: unsignedp = TREE_UNSIGNED (type); 1.1.1.4 root 1074: 1075: #ifdef PROMOTE_FUNCTION_ARGS 1.1.1.7 ! root 1076: mode = promote_mode (type, mode, &unsignedp, 1); 1.1.1.4 root 1077: #endif 1078: 1.1.1.7 ! root 1079: args[i].unsignedp = unsignedp; 1.1.1.5 root 1080: args[i].mode = mode; 1.1.1.4 root 1081: args[i].reg = FUNCTION_ARG (args_so_far, mode, type, 1.1 root 1082: argpos < n_named_args); 1083: #ifdef FUNCTION_ARG_PARTIAL_NREGS 1084: if (args[i].reg) 1085: args[i].partial 1.1.1.4 root 1086: = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, type, 1.1 root 1087: argpos < n_named_args); 1088: #endif 1089: 1.1.1.4 root 1090: args[i].pass_on_stack = MUST_PASS_IN_STACK (mode, type); 1.1 root 1091: 1092: /* If FUNCTION_ARG returned an (expr_list (nil) FOO), it means that 1093: we are to pass this arg in the register(s) designated by FOO, but 1094: also to pass it in the stack. */ 1095: if (args[i].reg && GET_CODE (args[i].reg) == EXPR_LIST 1096: && XEXP (args[i].reg, 0) == 0) 1097: args[i].pass_on_stack = 1, args[i].reg = XEXP (args[i].reg, 1); 1098: 1099: /* If this is an addressable type, we must preallocate the stack 1100: since we must evaluate the object into its final location. 1101: 1102: If this is to be passed in both registers and the stack, it is simpler 1103: to preallocate. */ 1104: if (TREE_ADDRESSABLE (type) 1105: || (args[i].pass_on_stack && args[i].reg != 0)) 1106: must_preallocate = 1; 1107: 1108: /* If this is an addressable type, we cannot pre-evaluate it. Thus, 1109: we cannot consider this function call constant. */ 1110: if (TREE_ADDRESSABLE (type)) 1111: is_const = 0; 1112: 1113: /* Compute the stack-size of this argument. */ 1114: if (args[i].reg == 0 || args[i].partial != 0 1115: #ifdef REG_PARM_STACK_SPACE 1.1.1.3 root 1116: || reg_parm_stack_space > 0 1.1 root 1117: #endif 1118: || args[i].pass_on_stack) 1.1.1.5 root 1119: locate_and_pad_parm (mode, type, 1.1 root 1120: #ifdef STACK_PARMS_IN_REG_PARM_AREA 1121: 1, 1122: #else 1123: args[i].reg != 0, 1124: #endif 1125: fndecl, &args_size, &args[i].offset, 1126: &args[i].size); 1127: 1128: #ifndef ARGS_GROW_DOWNWARD 1129: args[i].slot_offset = args_size; 1130: #endif 1131: 1132: #ifndef REG_PARM_STACK_SPACE 1133: /* If a part of the arg was put into registers, 1134: don't include that part in the amount pushed. */ 1135: if (! args[i].pass_on_stack) 1136: args[i].size.constant -= ((args[i].partial * UNITS_PER_WORD) 1137: / (PARM_BOUNDARY / BITS_PER_UNIT) 1138: * (PARM_BOUNDARY / BITS_PER_UNIT)); 1139: #endif 1140: 1141: /* Update ARGS_SIZE, the total stack space for args so far. */ 1142: 1143: args_size.constant += args[i].size.constant; 1144: if (args[i].size.var) 1145: { 1146: ADD_PARM_SIZE (args_size, args[i].size.var); 1147: } 1148: 1149: /* Since the slot offset points to the bottom of the slot, 1150: we must record it after incrementing if the args grow down. */ 1151: #ifdef ARGS_GROW_DOWNWARD 1152: args[i].slot_offset = args_size; 1153: 1154: args[i].slot_offset.constant = -args_size.constant; 1155: if (args_size.var) 1156: { 1157: SUB_PARM_SIZE (args[i].slot_offset, args_size.var); 1158: } 1159: #endif 1160: 1161: /* Increment ARGS_SO_FAR, which has info about which arg-registers 1162: have been used, etc. */ 1163: 1164: FUNCTION_ARG_ADVANCE (args_so_far, TYPE_MODE (type), type, 1165: argpos < n_named_args); 1166: } 1167: 1.1.1.3 root 1168: #ifdef FINAL_REG_PARM_STACK_SPACE 1169: reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant, 1170: args_size.var); 1171: #endif 1172: 1.1 root 1173: /* Compute the actual size of the argument block required. The variable 1174: and constant sizes must be combined, the size may have to be rounded, 1175: and there may be a minimum required size. */ 1176: 1177: original_args_size = args_size; 1178: if (args_size.var) 1179: { 1180: /* If this function requires a variable-sized argument list, don't try to 1181: make a cse'able block for this call. We may be able to do this 1182: eventually, but it is too complicated to keep track of what insns go 1183: in the cse'able block and which don't. */ 1184: 1185: is_const = 0; 1186: must_preallocate = 1; 1187: 1188: args_size.var = ARGS_SIZE_TREE (args_size); 1189: args_size.constant = 0; 1190: 1191: #ifdef STACK_BOUNDARY 1192: if (STACK_BOUNDARY != BITS_PER_UNIT) 1193: args_size.var = round_up (args_size.var, STACK_BYTES); 1194: #endif 1195: 1196: #ifdef REG_PARM_STACK_SPACE 1.1.1.3 root 1197: if (reg_parm_stack_space > 0) 1.1 root 1198: { 1199: args_size.var 1200: = size_binop (MAX_EXPR, args_size.var, 1201: size_int (REG_PARM_STACK_SPACE (fndecl))); 1202: 1203: #ifndef OUTGOING_REG_PARM_STACK_SPACE 1204: /* The area corresponding to register parameters is not to count in 1205: the size of the block we need. So make the adjustment. */ 1206: args_size.var 1207: = size_binop (MINUS_EXPR, args_size.var, 1.1.1.3 root 1208: size_int (reg_parm_stack_space)); 1.1 root 1209: #endif 1210: } 1211: #endif 1212: } 1213: else 1214: { 1215: #ifdef STACK_BOUNDARY 1216: args_size.constant = (((args_size.constant + (STACK_BYTES - 1)) 1217: / STACK_BYTES) * STACK_BYTES); 1218: #endif 1219: 1220: #ifdef REG_PARM_STACK_SPACE 1221: args_size.constant = MAX (args_size.constant, 1.1.1.3 root 1222: reg_parm_stack_space); 1.1.1.5 root 1223: #ifdef MAYBE_REG_PARM_STACK_SPACE 1224: if (reg_parm_stack_space == 0) 1225: args_size.constant = 0; 1226: #endif 1.1 root 1227: #ifndef OUTGOING_REG_PARM_STACK_SPACE 1.1.1.3 root 1228: args_size.constant -= reg_parm_stack_space; 1.1 root 1229: #endif 1230: #endif 1231: } 1232: 1233: /* See if we have or want to preallocate stack space. 1234: 1235: If we would have to push a partially-in-regs parm 1236: before other stack parms, preallocate stack space instead. 1237: 1238: If the size of some parm is not a multiple of the required stack 1239: alignment, we must preallocate. 1240: 1241: If the total size of arguments that would otherwise create a copy in 1242: a temporary (such as a CALL) is more than half the total argument list 1243: size, preallocation is faster. 1244: 1245: Another reason to preallocate is if we have a machine (like the m88k) 1246: where stack alignment is required to be maintained between every 1247: pair of insns, not just when the call is made. However, we assume here 1248: that such machines either do not have push insns (and hence preallocation 1249: would occur anyway) or the problem is taken care of with 1250: PUSH_ROUNDING. */ 1251: 1252: if (! must_preallocate) 1253: { 1254: int partial_seen = 0; 1255: int copy_to_evaluate_size = 0; 1256: 1257: for (i = 0; i < num_actuals && ! must_preallocate; i++) 1258: { 1259: if (args[i].partial > 0 && ! args[i].pass_on_stack) 1260: partial_seen = 1; 1261: else if (partial_seen && args[i].reg == 0) 1262: must_preallocate = 1; 1263: 1264: if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode 1265: && (TREE_CODE (args[i].tree_value) == CALL_EXPR 1266: || TREE_CODE (args[i].tree_value) == TARGET_EXPR 1267: || TREE_CODE (args[i].tree_value) == COND_EXPR 1268: || TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value)))) 1269: copy_to_evaluate_size 1270: += int_size_in_bytes (TREE_TYPE (args[i].tree_value)); 1271: } 1272: 1.1.1.3 root 1273: if (copy_to_evaluate_size * 2 >= args_size.constant 1274: && args_size.constant > 0) 1.1 root 1275: must_preallocate = 1; 1276: } 1277: 1278: /* If the structure value address will reference the stack pointer, we must 1279: stabilize it. We don't need to do this if we know that we are not going 1280: to adjust the stack pointer in processing this call. */ 1281: 1282: if (structure_value_addr 1283: && (reg_mentioned_p (virtual_stack_dynamic_rtx, structure_value_addr) 1284: || reg_mentioned_p (virtual_outgoing_args_rtx, structure_value_addr)) 1285: && (args_size.var 1286: #ifndef ACCUMULATE_OUTGOING_ARGS 1287: || args_size.constant 1288: #endif 1289: )) 1290: structure_value_addr = copy_to_reg (structure_value_addr); 1291: 1292: /* If this function call is cse'able, precompute all the parameters. 1293: Note that if the parameter is constructed into a temporary, this will 1294: cause an additional copy because the parameter will be constructed 1295: into a temporary location and then copied into the outgoing arguments. 1296: If a parameter contains a call to alloca and this function uses the 1297: stack, precompute the parameter. */ 1298: 1.1.1.5 root 1299: /* If we preallocated the stack space, and some arguments must be passed 1300: on the stack, then we must precompute any parameter which contains a 1301: function call which will store arguments on the stack. 1302: Otherwise, evaluating the parameter may clobber previous parameters 1303: which have already been stored into the stack. */ 1304: 1.1 root 1305: for (i = 0; i < num_actuals; i++) 1306: if (is_const 1307: || ((args_size.var != 0 || args_size.constant != 0) 1.1.1.5 root 1308: && calls_function (args[i].tree_value, 1)) 1309: || (must_preallocate && (args_size.var != 0 || args_size.constant != 0) 1310: && calls_function (args[i].tree_value, 0))) 1.1 root 1311: { 1.1.1.7 ! root 1312: push_temp_slots (); ! 1313: 1.1 root 1314: args[i].initial_value = args[i].value 1.1.1.4 root 1315: = expand_expr (args[i].tree_value, NULL_RTX, VOIDmode, 0); 1.1.1.5 root 1316: 1.1.1.7 ! root 1317: if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) != args[i].mode) ! 1318: args[i].value ! 1319: = convert_modes (args[i].mode, ! 1320: TYPE_MODE (TREE_TYPE (args[i].tree_value)), ! 1321: args[i].value, args[i].unsignedp); 1.1.1.5 root 1322: 1.1.1.7 ! root 1323: preserve_temp_slots (args[i].value); ! 1324: pop_temp_slots (); 1.1 root 1325: 1326: /* ANSI doesn't require a sequence point here, 1327: but PCC has one, so this will avoid some problems. */ 1328: emit_queue (); 1329: } 1330: 1331: /* Now we are about to start emitting insns that can be deleted 1332: if a libcall is deleted. */ 1333: if (is_const) 1334: start_sequence (); 1335: 1336: /* If we have no actual push instructions, or shouldn't use them, 1337: make space for all args right now. */ 1338: 1339: if (args_size.var != 0) 1340: { 1341: if (old_stack_level == 0) 1342: { 1.1.1.4 root 1343: emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX); 1.1 root 1344: old_pending_adj = pending_stack_adjust; 1345: pending_stack_adjust = 0; 1.1.1.3 root 1346: #ifdef ACCUMULATE_OUTGOING_ARGS 1347: /* stack_arg_under_construction says whether a stack arg is 1348: being constructed at the old stack level. Pushing the stack 1349: gets a clean outgoing argument block. */ 1350: old_stack_arg_under_construction = stack_arg_under_construction; 1351: stack_arg_under_construction = 0; 1352: #endif 1.1 root 1353: } 1354: argblock = push_block (ARGS_SIZE_RTX (args_size), 0, 0); 1355: } 1.1.1.7 ! root 1356: else 1.1 root 1357: { 1358: /* Note that we must go through the motions of allocating an argument 1359: block even if the size is zero because we may be storing args 1360: in the area reserved for register arguments, which may be part of 1361: the stack frame. */ 1.1.1.7 ! root 1362: 1.1 root 1363: int needed = args_size.constant; 1364: 1365: /* Store the maximum argument space used. It will be pushed by the 1.1.1.7 ! root 1366: prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow checking). */ 1.1 root 1367: 1368: if (needed > current_function_outgoing_args_size) 1369: current_function_outgoing_args_size = needed; 1370: 1.1.1.7 ! root 1371: if (must_preallocate) ! 1372: { ! 1373: #ifdef ACCUMULATE_OUTGOING_ARGS ! 1374: /* Since the stack pointer will never be pushed, it is possible for ! 1375: the evaluation of a parm to clobber something we have already ! 1376: written to the stack. Since most function calls on RISC machines ! 1377: do not use the stack, this is uncommon, but must work correctly. ! 1378: ! 1379: Therefore, we save any area of the stack that was already written ! 1380: and that we are using. Here we set up to do this by making a new ! 1381: stack usage map from the old one. The actual save will be done ! 1382: by store_one_arg. ! 1383: ! 1384: Another approach might be to try to reorder the argument ! 1385: evaluations to avoid this conflicting stack usage. */ ! 1386: 1.1 root 1387: #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE) 1.1.1.7 ! root 1388: /* Since we will be writing into the entire argument area, the ! 1389: map must be allocated for its entire size, not just the part that ! 1390: is the responsibility of the caller. */ ! 1391: needed += reg_parm_stack_space; 1.1 root 1392: #endif 1393: 1394: #ifdef ARGS_GROW_DOWNWARD 1.1.1.7 ! root 1395: highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use, ! 1396: needed + 1); 1.1 root 1397: #else 1.1.1.7 ! root 1398: highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use, ! 1399: needed); 1.1 root 1400: #endif 1.1.1.7 ! root 1401: stack_usage_map = (char *) alloca (highest_outgoing_arg_in_use); 1.1 root 1402: 1.1.1.7 ! root 1403: if (initial_highest_arg_in_use) ! 1404: bcopy (initial_stack_usage_map, stack_usage_map, ! 1405: initial_highest_arg_in_use); ! 1406: ! 1407: if (initial_highest_arg_in_use != highest_outgoing_arg_in_use) ! 1408: bzero (&stack_usage_map[initial_highest_arg_in_use], ! 1409: highest_outgoing_arg_in_use - initial_highest_arg_in_use); ! 1410: needed = 0; ! 1411: ! 1412: /* The address of the outgoing argument list must not be copied to a ! 1413: register here, because argblock would be left pointing to the ! 1414: wrong place after the call to allocate_dynamic_stack_space below. ! 1415: */ 1.1.1.3 root 1416: 1.1.1.7 ! root 1417: argblock = virtual_outgoing_args_rtx; 1.1.1.3 root 1418: 1.1 root 1419: #else /* not ACCUMULATE_OUTGOING_ARGS */ 1.1.1.7 ! root 1420: if (inhibit_defer_pop == 0) 1.1 root 1421: { 1.1.1.7 ! root 1422: /* Try to reuse some or all of the pending_stack_adjust ! 1423: to get this space. Maybe we can avoid any pushing. */ ! 1424: if (needed > pending_stack_adjust) ! 1425: { ! 1426: needed -= pending_stack_adjust; ! 1427: pending_stack_adjust = 0; ! 1428: } ! 1429: else ! 1430: { ! 1431: pending_stack_adjust -= needed; ! 1432: needed = 0; ! 1433: } 1.1 root 1434: } 1.1.1.7 ! root 1435: /* Special case this because overhead of `push_block' in this ! 1436: case is non-trivial. */ ! 1437: if (needed == 0) ! 1438: argblock = virtual_outgoing_args_rtx; 1.1 root 1439: else 1.1.1.7 ! root 1440: argblock = push_block (GEN_INT (needed), 0, 0); 1.1 root 1441: 1.1.1.7 ! root 1442: /* We only really need to call `copy_to_reg' in the case where push ! 1443: insns are going to be used to pass ARGBLOCK to a function ! 1444: call in ARGS. In that case, the stack pointer changes value ! 1445: from the allocation point to the call point, and hence ! 1446: the value of VIRTUAL_OUTGOING_ARGS_RTX changes as well. ! 1447: But might as well always do it. */ ! 1448: argblock = copy_to_reg (argblock); 1.1 root 1449: #endif /* not ACCUMULATE_OUTGOING_ARGS */ 1.1.1.7 ! root 1450: } 1.1 root 1451: } 1452: 1.1.1.3 root 1453: #ifdef ACCUMULATE_OUTGOING_ARGS 1454: /* The save/restore code in store_one_arg handles all cases except one: 1455: a constructor call (including a C function returning a BLKmode struct) 1456: to initialize an argument. */ 1457: if (stack_arg_under_construction) 1458: { 1459: #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE) 1.1.1.4 root 1460: rtx push_size = GEN_INT (reg_parm_stack_space + args_size.constant); 1.1.1.3 root 1461: #else 1.1.1.4 root 1462: rtx push_size = GEN_INT (args_size.constant); 1.1.1.3 root 1463: #endif 1464: if (old_stack_level == 0) 1465: { 1.1.1.4 root 1466: emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX); 1.1.1.3 root 1467: old_pending_adj = pending_stack_adjust; 1468: pending_stack_adjust = 0; 1469: /* stack_arg_under_construction says whether a stack arg is 1470: being constructed at the old stack level. Pushing the stack 1471: gets a clean outgoing argument block. */ 1472: old_stack_arg_under_construction = stack_arg_under_construction; 1473: stack_arg_under_construction = 0; 1474: /* Make a new map for the new argument list. */ 1475: stack_usage_map = (char *)alloca (highest_outgoing_arg_in_use); 1476: bzero (stack_usage_map, highest_outgoing_arg_in_use); 1477: highest_outgoing_arg_in_use = 0; 1478: } 1.1.1.4 root 1479: allocate_dynamic_stack_space (push_size, NULL_RTX, BITS_PER_UNIT); 1.1.1.3 root 1480: } 1481: /* If argument evaluation might modify the stack pointer, copy the 1482: address of the argument list to a register. */ 1483: for (i = 0; i < num_actuals; i++) 1484: if (args[i].pass_on_stack) 1485: { 1486: argblock = copy_addr_to_reg (argblock); 1487: break; 1488: } 1489: #endif 1490: 1491: 1.1 root 1492: /* If we preallocated stack space, compute the address of each argument. 1493: We need not ensure it is a valid memory address here; it will be 1494: validized when it is used. */ 1495: if (argblock) 1496: { 1497: rtx arg_reg = argblock; 1498: int arg_offset = 0; 1499: 1500: if (GET_CODE (argblock) == PLUS) 1501: arg_reg = XEXP (argblock, 0), arg_offset = INTVAL (XEXP (argblock, 1)); 1502: 1503: for (i = 0; i < num_actuals; i++) 1504: { 1505: rtx offset = ARGS_SIZE_RTX (args[i].offset); 1506: rtx slot_offset = ARGS_SIZE_RTX (args[i].slot_offset); 1507: rtx addr; 1508: 1509: /* Skip this parm if it will not be passed on the stack. */ 1510: if (! args[i].pass_on_stack && args[i].reg != 0) 1511: continue; 1512: 1513: if (GET_CODE (offset) == CONST_INT) 1514: addr = plus_constant (arg_reg, INTVAL (offset)); 1515: else 1516: addr = gen_rtx (PLUS, Pmode, arg_reg, offset); 1517: 1518: addr = plus_constant (addr, arg_offset); 1.1.1.5 root 1519: args[i].stack = gen_rtx (MEM, args[i].mode, addr); 1.1.1.6 root 1520: MEM_IN_STRUCT_P (args[i].stack) 1.1.1.7 ! root 1521: = AGGREGATE_TYPE_P (TREE_TYPE (args[i].tree_value)); 1.1 root 1522: 1523: if (GET_CODE (slot_offset) == CONST_INT) 1524: addr = plus_constant (arg_reg, INTVAL (slot_offset)); 1525: else 1526: addr = gen_rtx (PLUS, Pmode, arg_reg, slot_offset); 1527: 1528: addr = plus_constant (addr, arg_offset); 1.1.1.5 root 1529: args[i].stack_slot = gen_rtx (MEM, args[i].mode, addr); 1.1 root 1530: } 1531: } 1532: 1533: #ifdef PUSH_ARGS_REVERSED 1534: #ifdef STACK_BOUNDARY 1535: /* If we push args individually in reverse order, perform stack alignment 1536: before the first push (the last arg). */ 1537: if (argblock == 0) 1.1.1.4 root 1538: anti_adjust_stack (GEN_INT (args_size.constant 1539: - original_args_size.constant)); 1.1 root 1540: #endif 1541: #endif 1542: 1543: /* Don't try to defer pops if preallocating, not even from the first arg, 1544: since ARGBLOCK probably refers to the SP. */ 1545: if (argblock) 1546: NO_DEFER_POP; 1547: 1548: /* Get the function to call, in the form of RTL. */ 1549: if (fndecl) 1.1.1.6 root 1550: { 1551: /* If this is the first use of the function, see if we need to 1552: make an external definition for it. */ 1553: if (! TREE_USED (fndecl)) 1554: { 1555: assemble_external (fndecl); 1556: TREE_USED (fndecl) = 1; 1557: } 1558: 1559: /* Get a SYMBOL_REF rtx for the function address. */ 1560: funexp = XEXP (DECL_RTL (fndecl), 0); 1561: } 1.1 root 1562: else 1563: /* Generate an rtx (probably a pseudo-register) for the address. */ 1564: { 1.1.1.7 ! root 1565: push_temp_slots (); 1.1.1.4 root 1566: funexp = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0); 1.1.1.7 ! root 1567: pop_temp_slots (); /* FUNEXP can't be BLKmode */ 1.1 root 1568: emit_queue (); 1569: } 1570: 1571: /* Figure out the register where the value, if any, will come back. */ 1572: valreg = 0; 1573: if (TYPE_MODE (TREE_TYPE (exp)) != VOIDmode 1574: && ! structure_value_addr) 1575: { 1576: if (pcc_struct_value) 1577: valreg = hard_function_value (build_pointer_type (TREE_TYPE (exp)), 1578: fndecl); 1579: else 1580: valreg = hard_function_value (TREE_TYPE (exp), fndecl); 1581: } 1582: 1583: /* Precompute all register parameters. It isn't safe to compute anything 1584: once we have started filling any specific hard regs. */ 1585: reg_parm_seen = 0; 1586: for (i = 0; i < num_actuals; i++) 1587: if (args[i].reg != 0 && ! args[i].pass_on_stack) 1588: { 1589: reg_parm_seen = 1; 1590: 1591: if (args[i].value == 0) 1592: { 1.1.1.7 ! root 1593: push_temp_slots (); 1.1.1.4 root 1594: args[i].value = expand_expr (args[i].tree_value, NULL_RTX, 1595: VOIDmode, 0); 1.1 root 1596: preserve_temp_slots (args[i].value); 1.1.1.7 ! root 1597: pop_temp_slots (); 1.1 root 1598: 1599: /* ANSI doesn't require a sequence point here, 1600: but PCC has one, so this will avoid some problems. */ 1601: emit_queue (); 1602: } 1.1.1.4 root 1603: 1604: /* If we are to promote the function arg to a wider mode, 1605: do it now. */ 1606: 1.1.1.6 root 1607: if (args[i].mode != TYPE_MODE (TREE_TYPE (args[i].tree_value))) 1608: args[i].value 1609: = convert_modes (args[i].mode, 1610: TYPE_MODE (TREE_TYPE (args[i].tree_value)), 1611: args[i].value, args[i].unsignedp); 1.1.1.7 ! root 1612: ! 1613: /* If the value is expensive, and we are inside an appropriately ! 1614: short loop, put the value into a pseudo and then put the pseudo ! 1615: into the hard reg. ! 1616: ! 1617: For small register classes, also do this if this call uses ! 1618: register parameters. This is to avoid reload conflicts while ! 1619: loading the parameters registers. */ ! 1620: ! 1621: if ((! (GET_CODE (args[i].value) == REG ! 1622: || (GET_CODE (args[i].value) == SUBREG ! 1623: && GET_CODE (SUBREG_REG (args[i].value)) == REG))) ! 1624: && args[i].mode != BLKmode ! 1625: && rtx_cost (args[i].value, SET) > 2 ! 1626: #ifdef SMALL_REGISTER_CLASSES ! 1627: && (reg_parm_seen || preserve_subexpressions_p ()) ! 1628: #else ! 1629: && preserve_subexpressions_p () ! 1630: #endif ! 1631: ) ! 1632: args[i].value = copy_to_mode_reg (args[i].mode, args[i].value); 1.1 root 1633: } 1634: 1635: #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE) 1636: /* The argument list is the property of the called routine and it 1637: may clobber it. If the fixed area has been used for previous 1638: parameters, we must save and restore it. 1639: 1640: Here we compute the boundary of the that needs to be saved, if any. */ 1641: 1.1.1.4 root 1642: #ifdef ARGS_GROW_DOWNWARD 1643: for (i = 0; i < reg_parm_stack_space + 1; i++) 1644: #else 1.1.1.3 root 1645: for (i = 0; i < reg_parm_stack_space; i++) 1.1.1.4 root 1646: #endif 1.1 root 1647: { 1648: if (i >= highest_outgoing_arg_in_use 1649: || stack_usage_map[i] == 0) 1650: continue; 1651: 1652: if (low_to_save == -1) 1653: low_to_save = i; 1654: 1655: high_to_save = i; 1656: } 1657: 1658: if (low_to_save >= 0) 1659: { 1660: int num_to_save = high_to_save - low_to_save + 1; 1661: enum machine_mode save_mode 1662: = mode_for_size (num_to_save * BITS_PER_UNIT, MODE_INT, 1); 1663: rtx stack_area; 1664: 1665: /* If we don't have the required alignment, must do this in BLKmode. */ 1666: if ((low_to_save & (MIN (GET_MODE_SIZE (save_mode), 1667: BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1))) 1668: save_mode = BLKmode; 1669: 1670: stack_area = gen_rtx (MEM, save_mode, 1671: memory_address (save_mode, 1.1.1.4 root 1672: 1673: #ifdef ARGS_GROW_DOWNWARD 1674: plus_constant (argblock, 1675: - high_to_save) 1676: #else 1.1 root 1677: plus_constant (argblock, 1.1.1.4 root 1678: low_to_save) 1679: #endif 1680: )); 1.1 root 1681: if (save_mode == BLKmode) 1682: { 1683: save_area = assign_stack_temp (BLKmode, num_to_save, 1); 1684: emit_block_move (validize_mem (save_area), stack_area, 1.1.1.4 root 1685: GEN_INT (num_to_save), 1.1 root 1686: PARM_BOUNDARY / BITS_PER_UNIT); 1687: } 1688: else 1689: { 1690: save_area = gen_reg_rtx (save_mode); 1691: emit_move_insn (save_area, stack_area); 1692: } 1693: } 1694: #endif 1695: 1696: 1697: /* Now store (and compute if necessary) all non-register parms. 1698: These come before register parms, since they can require block-moves, 1699: which could clobber the registers used for register parms. 1700: Parms which have partial registers are not stored here, 1701: but we do preallocate space here if they want that. */ 1702: 1703: for (i = 0; i < num_actuals; i++) 1704: if (args[i].reg == 0 || args[i].pass_on_stack) 1705: store_one_arg (&args[i], argblock, may_be_alloca, 1.1.1.3 root 1706: args_size.var != 0, fndecl, reg_parm_stack_space); 1.1 root 1707: 1.1.1.5 root 1708: #ifdef STRICT_ALIGNMENT 1709: /* If we have a parm that is passed in registers but not in memory 1710: and whose alignment does not permit a direct copy into registers, 1711: make a group of pseudos that correspond to each register that we 1712: will later fill. */ 1713: 1714: for (i = 0; i < num_actuals; i++) 1715: if (args[i].reg != 0 && ! args[i].pass_on_stack 1716: && args[i].mode == BLKmode 1717: && (TYPE_ALIGN (TREE_TYPE (args[i].tree_value)) 1718: < MIN (BIGGEST_ALIGNMENT, BITS_PER_WORD))) 1719: { 1720: int bytes = int_size_in_bytes (TREE_TYPE (args[i].tree_value)); 1.1.1.6 root 1721: int big_endian_correction = 0; 1.1.1.5 root 1722: 1723: args[i].n_aligned_regs 1724: = args[i].partial ? args[i].partial 1725: : (bytes + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD; 1726: 1727: args[i].aligned_regs = (rtx *) alloca (sizeof (rtx) 1728: * args[i].n_aligned_regs); 1729: 1.1.1.6 root 1730: /* Structures smaller than a word are aligned to the least signifcant 1731: byte (to the right). On a BYTES_BIG_ENDIAN machine, this means we 1732: must skip the empty high order bytes when calculating the bit 1733: offset. */ 1734: if (BYTES_BIG_ENDIAN && bytes < UNITS_PER_WORD) 1735: big_endian_correction = (BITS_PER_WORD - (bytes * BITS_PER_UNIT)); 1736: 1.1.1.5 root 1737: for (j = 0; j < args[i].n_aligned_regs; j++) 1738: { 1739: rtx reg = gen_reg_rtx (word_mode); 1740: rtx word = operand_subword_force (args[i].value, j, BLKmode); 1741: int bitsize = TYPE_ALIGN (TREE_TYPE (args[i].tree_value)); 1742: int bitpos; 1743: 1744: args[i].aligned_regs[j] = reg; 1745: 1746: /* Clobber REG and move each partword into it. Ensure we don't 1747: go past the end of the structure. Note that the loop below 1748: works because we've already verified that padding 1749: and endianness are compatible. */ 1750: 1751: emit_insn (gen_rtx (CLOBBER, VOIDmode, reg)); 1752: 1753: for (bitpos = 0; 1754: bitpos < BITS_PER_WORD && bytes > 0; 1755: bitpos += bitsize, bytes -= bitsize / BITS_PER_UNIT) 1756: { 1.1.1.6 root 1757: int xbitpos = bitpos + big_endian_correction; 1.1.1.5 root 1758: 1759: store_bit_field (reg, bitsize, xbitpos, word_mode, 1.1.1.6 root 1760: extract_bit_field (word, bitsize, bitpos, 1, 1.1.1.5 root 1761: NULL_RTX, word_mode, 1762: word_mode, 1763: bitsize / BITS_PER_UNIT, 1764: BITS_PER_WORD), 1765: bitsize / BITS_PER_UNIT, BITS_PER_WORD); 1766: } 1767: } 1768: } 1769: #endif 1770: 1.1 root 1771: /* Now store any partially-in-registers parm. 1772: This is the last place a block-move can happen. */ 1773: if (reg_parm_seen) 1774: for (i = 0; i < num_actuals; i++) 1775: if (args[i].partial != 0 && ! args[i].pass_on_stack) 1776: store_one_arg (&args[i], argblock, may_be_alloca, 1.1.1.3 root 1777: args_size.var != 0, fndecl, reg_parm_stack_space); 1.1 root 1778: 1779: #ifndef PUSH_ARGS_REVERSED 1780: #ifdef STACK_BOUNDARY 1781: /* If we pushed args in forward order, perform stack alignment 1782: after pushing the last arg. */ 1783: if (argblock == 0) 1.1.1.4 root 1784: anti_adjust_stack (GEN_INT (args_size.constant 1785: - original_args_size.constant)); 1.1 root 1786: #endif 1787: #endif 1788: 1.1.1.3 root 1789: /* If register arguments require space on the stack and stack space 1790: was not preallocated, allocate stack space here for arguments 1791: passed in registers. */ 1.1.1.6 root 1792: #if ! defined(ACCUMULATE_OUTGOING_ARGS) && defined(OUTGOING_REG_PARM_STACK_SPACE) 1.1.1.3 root 1793: if (must_preallocate == 0 && reg_parm_stack_space > 0) 1.1.1.4 root 1794: anti_adjust_stack (GEN_INT (reg_parm_stack_space)); 1.1.1.3 root 1795: #endif 1796: 1.1 root 1797: /* Pass the function the address in which to return a structure value. */ 1798: if (structure_value_addr && ! structure_value_addr_parm) 1799: { 1800: emit_move_insn (struct_value_rtx, 1801: force_reg (Pmode, 1.1.1.4 root 1802: force_operand (structure_value_addr, 1803: NULL_RTX))); 1.1 root 1804: if (GET_CODE (struct_value_rtx) == REG) 1.1.1.7 ! root 1805: use_reg (&call_fusage, struct_value_rtx); 1.1 root 1806: } 1807: 1.1.1.7 ! root 1808: funexp = prepare_call_address (funexp, fndecl, &call_fusage, reg_parm_seen); ! 1809: 1.1 root 1810: /* Now do the register loads required for any wholly-register parms or any 1811: parms which are passed both on the stack and in a register. Their 1812: expressions were already evaluated. 1813: 1814: Mark all register-parms as living through the call, putting these USE 1.1.1.7 ! root 1815: insns in the CALL_INSN_FUNCTION_USAGE field. */ 1.1 root 1816: 1817: for (i = 0; i < num_actuals; i++) 1818: { 1819: rtx list = args[i].reg; 1820: int partial = args[i].partial; 1821: 1822: while (list) 1823: { 1824: rtx reg; 1825: int nregs; 1826: 1827: /* Process each register that needs to get this arg. */ 1828: if (GET_CODE (list) == EXPR_LIST) 1829: reg = XEXP (list, 0), list = XEXP (list, 1); 1830: else 1831: reg = list, list = 0; 1832: 1.1.1.7 ! root 1833: /* Set to non-negative if must move a word at a time, even if just ! 1834: one word (e.g, partial == 1 && mode == DFmode). Set to -1 if ! 1835: we just use a normal move insn. This value can be zero if the ! 1836: argument is a zero size structure with no fields. */ 1.1 root 1837: nregs = (partial ? partial 1838: : (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode 1839: ? ((int_size_in_bytes (TREE_TYPE (args[i].tree_value)) 1840: + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD) 1.1.1.7 ! root 1841: : -1)); 1.1 root 1842: 1843: /* If simple case, just do move. If normal partial, store_one_arg 1844: has already loaded the register for us. In all other cases, 1845: load the register(s) from memory. */ 1846: 1.1.1.7 ! root 1847: if (nregs == -1) 1.1 root 1848: emit_move_insn (reg, args[i].value); 1.1.1.5 root 1849: 1850: #ifdef STRICT_ALIGNMENT 1851: /* If we have pre-computed the values to put in the registers in 1852: the case of non-aligned structures, copy them in now. */ 1853: 1854: else if (args[i].n_aligned_regs != 0) 1855: for (j = 0; j < args[i].n_aligned_regs; j++) 1856: emit_move_insn (gen_rtx (REG, word_mode, REGNO (reg) + j), 1857: args[i].aligned_regs[j]); 1858: #endif 1859: 1.1 root 1860: else if (args[i].partial == 0 || args[i].pass_on_stack) 1861: move_block_to_reg (REGNO (reg), 1862: validize_mem (args[i].value), nregs, 1.1.1.5 root 1863: args[i].mode); 1.1.1.7 ! root 1864: ! 1865: if (nregs == -1) ! 1866: use_reg (&call_fusage, reg); 1.1 root 1867: else 1.1.1.7 ! root 1868: use_regs (&call_fusage, REGNO (reg), nregs == 0 ? 1 : nregs); 1.1 root 1869: 1870: /* PARTIAL referred only to the first register, so clear it for the 1871: next time. */ 1872: partial = 0; 1873: } 1874: } 1875: 1876: /* Perform postincrements before actually calling the function. */ 1877: emit_queue (); 1878: 1879: /* All arguments and registers used for the call must be set up by now! */ 1880: 1881: /* Generate the actual call instruction. */ 1882: emit_call_1 (funexp, funtype, args_size.constant, struct_value_size, 1883: FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1), 1.1.1.7 ! root 1884: valreg, old_inhibit_defer_pop, call_fusage, is_const); 1.1 root 1885: 1886: /* If call is cse'able, make appropriate pair of reg-notes around it. 1887: Test valreg so we don't crash; may safely ignore `const' 1888: if return type is void. */ 1889: if (is_const && valreg != 0) 1890: { 1891: rtx note = 0; 1892: rtx temp = gen_reg_rtx (GET_MODE (valreg)); 1893: rtx insns; 1894: 1895: /* Construct an "equal form" for the value which mentions all the 1896: arguments in order as well as the function name. */ 1897: #ifdef PUSH_ARGS_REVERSED 1898: for (i = 0; i < num_actuals; i++) 1899: note = gen_rtx (EXPR_LIST, VOIDmode, args[i].initial_value, note); 1900: #else 1901: for (i = num_actuals - 1; i >= 0; i--) 1902: note = gen_rtx (EXPR_LIST, VOIDmode, args[i].initial_value, note); 1903: #endif 1904: note = gen_rtx (EXPR_LIST, VOIDmode, funexp, note); 1905: 1906: insns = get_insns (); 1907: end_sequence (); 1908: 1909: emit_libcall_block (insns, temp, valreg, note); 1910: 1911: valreg = temp; 1912: } 1.1.1.7 ! root 1913: else if (is_const) ! 1914: { ! 1915: /* Otherwise, just write out the sequence without a note. */ ! 1916: rtx insns = get_insns (); ! 1917: ! 1918: end_sequence (); ! 1919: emit_insns (insns); ! 1920: } 1.1 root 1921: 1922: /* For calls to `setjmp', etc., inform flow.c it should complain 1923: if nonvolatile values are live. */ 1924: 1925: if (returns_twice) 1926: { 1927: emit_note (name, NOTE_INSN_SETJMP); 1928: current_function_calls_setjmp = 1; 1929: } 1930: 1931: if (is_longjmp) 1932: current_function_calls_longjmp = 1; 1933: 1934: /* Notice functions that cannot return. 1935: If optimizing, insns emitted below will be dead. 1936: If not optimizing, they will exist, which is useful 1937: if the user uses the `return' command in the debugger. */ 1938: 1939: if (is_volatile || is_longjmp) 1940: emit_barrier (); 1941: 1942: /* If value type not void, return an rtx for the value. */ 1943: 1944: /* If there are cleanups to be called, don't use a hard reg as target. */ 1945: if (cleanups_this_call != old_cleanups 1946: && target && REG_P (target) 1947: && REGNO (target) < FIRST_PSEUDO_REGISTER) 1948: target = 0; 1949: 1950: if (TYPE_MODE (TREE_TYPE (exp)) == VOIDmode 1951: || ignore) 1952: { 1953: target = const0_rtx; 1954: } 1955: else if (structure_value_addr) 1956: { 1957: if (target == 0 || GET_CODE (target) != MEM) 1.1.1.3 root 1958: { 1959: target = gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)), 1960: memory_address (TYPE_MODE (TREE_TYPE (exp)), 1961: structure_value_addr)); 1.1.1.7 ! root 1962: MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp)); 1.1.1.3 root 1963: } 1.1 root 1964: } 1965: else if (pcc_struct_value) 1966: { 1967: if (target == 0) 1.1.1.3 root 1968: { 1.1.1.5 root 1969: /* We used leave the value in the location that it is 1970: returned in, but that causes problems if it is used more 1971: than once in one expression. Rather than trying to track 1972: when a copy is required, we always copy when TARGET is 1973: not specified. This calling sequence is only used on 1974: a few machines and TARGET is usually nonzero. */ 1975: if (TYPE_MODE (TREE_TYPE (exp)) == BLKmode) 1976: { 1977: target = assign_stack_temp (BLKmode, 1978: int_size_in_bytes (TREE_TYPE (exp)), 1979: 0); 1980: 1.1.1.7 ! root 1981: MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp)); ! 1982: 1.1.1.5 root 1983: /* Save this temp slot around the pop below. */ 1984: preserve_temp_slots (target); 1985: } 1986: else 1987: target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp))); 1.1.1.3 root 1988: } 1.1.1.5 root 1989: 1990: if (TYPE_MODE (TREE_TYPE (exp)) != BLKmode) 1.1 root 1991: emit_move_insn (target, gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)), 1992: copy_to_reg (valreg))); 1993: else 1994: emit_block_move (target, gen_rtx (MEM, BLKmode, copy_to_reg (valreg)), 1995: expr_size (exp), 1996: TYPE_ALIGN (TREE_TYPE (exp)) / BITS_PER_UNIT); 1997: } 1.1.1.4 root 1998: else if (target && GET_MODE (target) == TYPE_MODE (TREE_TYPE (exp)) 1999: && GET_MODE (target) == GET_MODE (valreg)) 1.1 root 2000: /* TARGET and VALREG cannot be equal at this point because the latter 2001: would not have REG_FUNCTION_VALUE_P true, while the former would if 2002: it were referring to the same register. 2003: 2004: If they refer to the same register, this move will be a no-op, except 2005: when function inlining is being done. */ 2006: emit_move_insn (target, valreg); 2007: else 2008: target = copy_to_reg (valreg); 2009: 1.1.1.4 root 2010: #ifdef PROMOTE_FUNCTION_RETURN 1.1.1.5 root 2011: /* If we promoted this return value, make the proper SUBREG. TARGET 2012: might be const0_rtx here, so be careful. */ 2013: if (GET_CODE (target) == REG 2014: && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp))) 1.1.1.4 root 2015: { 1.1.1.7 ! root 2016: tree type = TREE_TYPE (exp); ! 2017: int unsignedp = TREE_UNSIGNED (type); 1.1.1.4 root 2018: 1.1.1.7 ! root 2019: /* If we don't promote as expected, something is wrong. */ ! 2020: if (GET_MODE (target) ! 2021: != promote_mode (type, TYPE_MODE (type), &unsignedp, 1)) 1.1.1.5 root 2022: abort (); 2023: 1.1.1.7 ! root 2024: target = gen_rtx (SUBREG, TYPE_MODE (type), target, 0); 1.1.1.4 root 2025: SUBREG_PROMOTED_VAR_P (target) = 1; 2026: SUBREG_PROMOTED_UNSIGNED_P (target) = unsignedp; 2027: } 2028: #endif 2029: 1.1.1.7 ! root 2030: if (flag_short_temps) ! 2031: { ! 2032: /* Perform all cleanups needed for the arguments of this call ! 2033: (i.e. destructors in C++). */ ! 2034: expand_cleanups_to (old_cleanups); ! 2035: } 1.1 root 2036: 1.1.1.3 root 2037: /* If size of args is variable or this was a constructor call for a stack 2038: argument, restore saved stack-pointer value. */ 1.1 root 2039: 2040: if (old_stack_level) 2041: { 1.1.1.4 root 2042: emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX); 1.1 root 2043: pending_stack_adjust = old_pending_adj; 1.1.1.3 root 2044: #ifdef ACCUMULATE_OUTGOING_ARGS 2045: stack_arg_under_construction = old_stack_arg_under_construction; 2046: highest_outgoing_arg_in_use = initial_highest_arg_in_use; 2047: stack_usage_map = initial_stack_usage_map; 2048: #endif 1.1 root 2049: } 2050: #ifdef ACCUMULATE_OUTGOING_ARGS 2051: else 2052: { 2053: #ifdef REG_PARM_STACK_SPACE 2054: if (save_area) 2055: { 2056: enum machine_mode save_mode = GET_MODE (save_area); 2057: rtx stack_area 2058: = gen_rtx (MEM, save_mode, 2059: memory_address (save_mode, 1.1.1.4 root 2060: #ifdef ARGS_GROW_DOWNWARD 2061: plus_constant (argblock, - high_to_save) 2062: #else 2063: plus_constant (argblock, low_to_save) 2064: #endif 2065: )); 1.1 root 2066: 2067: if (save_mode != BLKmode) 2068: emit_move_insn (stack_area, save_area); 2069: else 2070: emit_block_move (stack_area, validize_mem (save_area), 1.1.1.4 root 2071: GEN_INT (high_to_save - low_to_save + 1), 2072: PARM_BOUNDARY / BITS_PER_UNIT); 1.1 root 2073: } 2074: #endif 2075: 2076: /* If we saved any argument areas, restore them. */ 2077: for (i = 0; i < num_actuals; i++) 2078: if (args[i].save_area) 2079: { 2080: enum machine_mode save_mode = GET_MODE (args[i].save_area); 2081: rtx stack_area 2082: = gen_rtx (MEM, save_mode, 2083: memory_address (save_mode, 2084: XEXP (args[i].stack_slot, 0))); 2085: 2086: if (save_mode != BLKmode) 2087: emit_move_insn (stack_area, args[i].save_area); 2088: else 2089: emit_block_move (stack_area, validize_mem (args[i].save_area), 1.1.1.4 root 2090: GEN_INT (args[i].size.constant), 1.1 root 2091: PARM_BOUNDARY / BITS_PER_UNIT); 2092: } 2093: 2094: highest_outgoing_arg_in_use = initial_highest_arg_in_use; 2095: stack_usage_map = initial_stack_usage_map; 2096: } 2097: #endif 2098: 1.1.1.3 root 2099: /* If this was alloca, record the new stack level for nonlocal gotos. 2100: Check for the handler slots since we might not have a save area 2101: for non-local gotos. */ 2102: 2103: if (may_be_alloca && nonlocal_goto_handler_slot != 0) 1.1.1.4 root 2104: emit_stack_save (SAVE_NONLOCAL, &nonlocal_goto_stack_level, NULL_RTX); 1.1 root 2105: 2106: pop_temp_slots (); 2107: 2108: return target; 2109: } 2110: 1.1.1.5 root 2111: /* Output a library call to function FUN (a SYMBOL_REF rtx) 2112: (emitting the queue unless NO_QUEUE is nonzero), 2113: for a value of mode OUTMODE, 2114: with NARGS different arguments, passed as alternating rtx values 2115: and machine_modes to convert them to. 2116: The rtx values should have been passed through protect_from_queue already. 2117: 2118: NO_QUEUE will be true if and only if the library call is a `const' call 2119: which will be enclosed in REG_LIBCALL/REG_RETVAL notes; it is equivalent 2120: to the variable is_const in expand_call. 2121: 2122: NO_QUEUE must be true for const calls, because if it isn't, then 2123: any pending increment will be emitted between REG_LIBCALL/REG_RETVAL notes, 2124: and will be lost if the libcall sequence is optimized away. 2125: 2126: NO_QUEUE must be false for non-const calls, because if it isn't, the 2127: call insn will have its CONST_CALL_P bit set, and it will be incorrectly 2128: optimized. For instance, the instruction scheduler may incorrectly 2129: move memory references across the non-const call. */ 2130: 2131: void 1.1.1.7 ! root 2132: emit_library_call VPROTO((rtx orgfun, int no_queue, enum machine_mode outmode, ! 2133: int nargs, ...)) 1.1.1.5 root 2134: { 1.1.1.7 ! root 2135: #ifndef __STDC__ ! 2136: rtx orgfun; ! 2137: int no_queue; ! 2138: enum machine_mode outmode; ! 2139: int nargs; ! 2140: #endif 1.1.1.5 root 2141: va_list p; 2142: /* Total size in bytes of all the stack-parms scanned so far. */ 2143: struct args_size args_size; 2144: /* Size of arguments before any adjustments (such as rounding). */ 2145: struct args_size original_args_size; 2146: register int argnum; 2147: rtx fun; 2148: int inc; 2149: int count; 2150: rtx argblock = 0; 2151: CUMULATIVE_ARGS args_so_far; 2152: struct arg { rtx value; enum machine_mode mode; rtx reg; int partial; 2153: struct args_size offset; struct args_size size; }; 2154: struct arg *argvec; 2155: int old_inhibit_defer_pop = inhibit_defer_pop; 1.1.1.7 ! root 2156: rtx call_fusage = 0; 1.1.1.5 root 2157: /* library calls are never indirect calls. */ 2158: int current_call_is_indirect = 0; 2159: 1.1.1.7 ! root 2160: VA_START (p, nargs); ! 2161: ! 2162: #ifndef __STDC__ ! 2163: orgfun = va_arg (p, rtx); 1.1.1.5 root 2164: no_queue = va_arg (p, int); 2165: outmode = va_arg (p, enum machine_mode); 2166: nargs = va_arg (p, int); 1.1.1.7 ! root 2167: #endif ! 2168: ! 2169: fun = orgfun; 1.1.1.5 root 2170: 2171: /* Copy all the libcall-arguments out of the varargs data 2172: and into a vector ARGVEC. 2173: 2174: Compute how to pass each argument. We only support a very small subset 2175: of the full argument passing conventions to limit complexity here since 2176: library functions shouldn't have many args. */ 2177: 2178: argvec = (struct arg *) alloca (nargs * sizeof (struct arg)); 2179: 2180: INIT_CUMULATIVE_ARGS (args_so_far, NULL_TREE, fun); 2181: 2182: args_size.constant = 0; 2183: args_size.var = 0; 2184: 1.1.1.6 root 2185: push_temp_slots (); 2186: 1.1.1.5 root 2187: for (count = 0; count < nargs; count++) 2188: { 2189: rtx val = va_arg (p, rtx); 2190: enum machine_mode mode = va_arg (p, enum machine_mode); 2191: 2192: /* We cannot convert the arg value to the mode the library wants here; 2193: must do it earlier where we know the signedness of the arg. */ 2194: if (mode == BLKmode 2195: || (GET_MODE (val) != mode && GET_MODE (val) != VOIDmode)) 2196: abort (); 2197: 2198: /* On some machines, there's no way to pass a float to a library fcn. 2199: Pass it as a double instead. */ 2200: #ifdef LIBGCC_NEEDS_DOUBLE 2201: if (LIBGCC_NEEDS_DOUBLE && mode == SFmode) 1.1.1.7 ! root 2202: val = convert_modes (DFmode, SFmode, val, 0), mode = DFmode; 1.1.1.5 root 2203: #endif 2204: 2205: /* There's no need to call protect_from_queue, because 2206: either emit_move_insn or emit_push_insn will do that. */ 2207: 2208: /* Make sure it is a reasonable operand for a move or push insn. */ 2209: if (GET_CODE (val) != REG && GET_CODE (val) != MEM 2210: && ! (CONSTANT_P (val) && LEGITIMATE_CONSTANT_P (val))) 2211: val = force_operand (val, NULL_RTX); 2212: 2213: #ifdef FUNCTION_ARG_PASS_BY_REFERENCE 2214: if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, mode, NULL_TREE, 1)) 1.1.1.6 root 2215: { 2216: /* We do not support FUNCTION_ARG_CALLEE_COPIES here since it can 2217: be viewed as just an efficiency improvement. */ 2218: rtx slot = assign_stack_temp (mode, GET_MODE_SIZE (mode), 0); 2219: emit_move_insn (slot, val); 1.1.1.7 ! root 2220: val = force_operand (XEXP (slot, 0), NULL_RTX); 1.1.1.6 root 2221: mode = Pmode; 2222: } 1.1.1.5 root 2223: #endif 2224: 1.1.1.6 root 2225: argvec[count].value = val; 2226: argvec[count].mode = mode; 2227: 1.1.1.5 root 2228: argvec[count].reg = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1); 2229: if (argvec[count].reg && GET_CODE (argvec[count].reg) == EXPR_LIST) 2230: abort (); 2231: #ifdef FUNCTION_ARG_PARTIAL_NREGS 2232: argvec[count].partial 2233: = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, NULL_TREE, 1); 2234: #else 2235: argvec[count].partial = 0; 2236: #endif 2237: 2238: locate_and_pad_parm (mode, NULL_TREE, 2239: argvec[count].reg && argvec[count].partial == 0, 2240: NULL_TREE, &args_size, &argvec[count].offset, 2241: &argvec[count].size); 2242: 2243: if (argvec[count].size.var) 2244: abort (); 2245: 2246: #ifndef REG_PARM_STACK_SPACE 2247: if (argvec[count].partial) 2248: argvec[count].size.constant -= argvec[count].partial * UNITS_PER_WORD; 2249: #endif 2250: 2251: if (argvec[count].reg == 0 || argvec[count].partial != 0 2252: #ifdef REG_PARM_STACK_SPACE 2253: || 1 2254: #endif 2255: ) 2256: args_size.constant += argvec[count].size.constant; 2257: 2258: #ifdef ACCUMULATE_OUTGOING_ARGS 2259: /* If this arg is actually passed on the stack, it might be 2260: clobbering something we already put there (this library call might 2261: be inside the evaluation of an argument to a function whose call 2262: requires the stack). This will only occur when the library call 2263: has sufficient args to run out of argument registers. Abort in 2264: this case; if this ever occurs, code must be added to save and 2265: restore the arg slot. */ 2266: 2267: if (argvec[count].reg == 0 || argvec[count].partial != 0) 2268: abort (); 2269: #endif 2270: 2271: FUNCTION_ARG_ADVANCE (args_so_far, mode, (tree)0, 1); 2272: } 2273: va_end (p); 2274: 2275: /* If this machine requires an external definition for library 2276: functions, write one out. */ 2277: assemble_external_libcall (fun); 2278: 2279: original_args_size = args_size; 2280: #ifdef STACK_BOUNDARY 2281: args_size.constant = (((args_size.constant + (STACK_BYTES - 1)) 2282: / STACK_BYTES) * STACK_BYTES); 2283: #endif 2284: 2285: #ifdef REG_PARM_STACK_SPACE 2286: args_size.constant = MAX (args_size.constant, 2287: REG_PARM_STACK_SPACE (NULL_TREE)); 2288: #ifndef OUTGOING_REG_PARM_STACK_SPACE 2289: args_size.constant -= REG_PARM_STACK_SPACE (NULL_TREE); 2290: #endif 2291: #endif 2292: 2293: if (args_size.constant > current_function_outgoing_args_size) 2294: current_function_outgoing_args_size = args_size.constant; 1.1.1.7 ! root 2295: ! 2296: #ifdef ACCUMULATE_OUTGOING_ARGS 1.1.1.5 root 2297: args_size.constant = 0; 2298: #endif 2299: 2300: #ifndef PUSH_ROUNDING 2301: argblock = push_block (GEN_INT (args_size.constant), 0, 0); 2302: #endif 2303: 2304: #ifdef PUSH_ARGS_REVERSED 2305: #ifdef STACK_BOUNDARY 2306: /* If we push args individually in reverse order, perform stack alignment 2307: before the first push (the last arg). */ 2308: if (argblock == 0) 2309: anti_adjust_stack (GEN_INT (args_size.constant 2310: - original_args_size.constant)); 2311: #endif 2312: #endif 2313: 2314: #ifdef PUSH_ARGS_REVERSED 2315: inc = -1; 2316: argnum = nargs - 1; 2317: #else 2318: inc = 1; 2319: argnum = 0; 2320: #endif 2321: 2322: /* Push the args that need to be pushed. */ 2323: 2324: for (count = 0; count < nargs; count++, argnum += inc) 2325: { 2326: register enum machine_mode mode = argvec[argnum].mode; 2327: register rtx val = argvec[argnum].value; 2328: rtx reg = argvec[argnum].reg; 2329: int partial = argvec[argnum].partial; 2330: 2331: if (! (reg != 0 && partial == 0)) 2332: emit_push_insn (val, mode, NULL_TREE, NULL_RTX, 0, partial, reg, 0, 2333: argblock, GEN_INT (argvec[count].offset.constant)); 2334: NO_DEFER_POP; 2335: } 2336: 2337: #ifndef PUSH_ARGS_REVERSED 2338: #ifdef STACK_BOUNDARY 2339: /* If we pushed args in forward order, perform stack alignment 2340: after pushing the last arg. */ 2341: if (argblock == 0) 2342: anti_adjust_stack (GEN_INT (args_size.constant 2343: - original_args_size.constant)); 2344: #endif 2345: #endif 2346: 2347: #ifdef PUSH_ARGS_REVERSED 2348: argnum = nargs - 1; 2349: #else 2350: argnum = 0; 2351: #endif 2352: 1.1.1.7 ! root 2353: fun = prepare_call_address (fun, NULL_TREE, &call_fusage, 0); ! 2354: 1.1.1.5 root 2355: /* Now load any reg parms into their regs. */ 2356: 2357: for (count = 0; count < nargs; count++, argnum += inc) 2358: { 2359: register enum machine_mode mode = argvec[argnum].mode; 2360: register rtx val = argvec[argnum].value; 2361: rtx reg = argvec[argnum].reg; 2362: int partial = argvec[argnum].partial; 2363: 2364: if (reg != 0 && partial == 0) 2365: emit_move_insn (reg, val); 2366: NO_DEFER_POP; 2367: } 2368: 2369: /* For version 1.37, try deleting this entirely. */ 2370: if (! no_queue) 2371: emit_queue (); 2372: 2373: /* Any regs containing parms remain in use through the call. */ 2374: for (count = 0; count < nargs; count++) 2375: if (argvec[count].reg != 0) 1.1.1.7 ! root 2376: use_reg (&call_fusage, argvec[count].reg); 1.1.1.5 root 2377: 2378: /* Don't allow popping to be deferred, since then 2379: cse'ing of library calls could delete a call and leave the pop. */ 2380: NO_DEFER_POP; 2381: 2382: /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which 2383: will set inhibit_defer_pop to that value. */ 2384: 2385: emit_call_1 (fun, get_identifier (XSTR (orgfun, 0)), args_size.constant, 0, 2386: FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1), 2387: outmode != VOIDmode ? hard_libcall_value (outmode) : NULL_RTX, 1.1.1.7 ! root 2388: old_inhibit_defer_pop + 1, call_fusage, no_queue); 1.1.1.5 root 2389: 1.1.1.6 root 2390: pop_temp_slots (); 2391: 1.1.1.5 root 2392: /* Now restore inhibit_defer_pop to its actual original value. */ 2393: OK_DEFER_POP; 2394: } 2395: 2396: /* Like emit_library_call except that an extra argument, VALUE, 2397: comes second and says where to store the result. 1.1.1.6 root 2398: (If VALUE is zero, this function chooses a convenient way 2399: to return the value. 1.1.1.5 root 2400: 1.1.1.6 root 2401: This function returns an rtx for where the value is to be found. 2402: If VALUE is nonzero, VALUE is returned. */ 2403: 2404: rtx 1.1.1.7 ! root 2405: emit_library_call_value VPROTO((rtx orgfun, rtx value, int no_queue, ! 2406: enum machine_mode outmode, int nargs, ...)) 1.1.1.5 root 2407: { 1.1.1.7 ! root 2408: #ifndef __STDC__ ! 2409: rtx orgfun; ! 2410: rtx value; ! 2411: int no_queue; ! 2412: enum machine_mode outmode; ! 2413: int nargs; ! 2414: #endif 1.1.1.5 root 2415: va_list p; 2416: /* Total size in bytes of all the stack-parms scanned so far. */ 2417: struct args_size args_size; 2418: /* Size of arguments before any adjustments (such as rounding). */ 2419: struct args_size original_args_size; 2420: register int argnum; 2421: rtx fun; 2422: int inc; 2423: int count; 2424: rtx argblock = 0; 2425: CUMULATIVE_ARGS args_so_far; 2426: struct arg { rtx value; enum machine_mode mode; rtx reg; int partial; 2427: struct args_size offset; struct args_size size; }; 2428: struct arg *argvec; 2429: int old_inhibit_defer_pop = inhibit_defer_pop; 1.1.1.7 ! root 2430: rtx call_fusage = 0; 1.1.1.5 root 2431: rtx mem_value = 0; 1.1.1.6 root 2432: int pcc_struct_value = 0; 2433: int struct_value_size = 0; 1.1.1.5 root 2434: /* library calls are never indirect calls. */ 2435: int current_call_is_indirect = 0; 1.1.1.7 ! root 2436: int is_const; 1.1.1.5 root 2437: 1.1.1.7 ! root 2438: VA_START (p, nargs); ! 2439: ! 2440: #ifndef __STDC__ ! 2441: orgfun = va_arg (p, rtx); 1.1.1.5 root 2442: value = va_arg (p, rtx); 2443: no_queue = va_arg (p, int); 2444: outmode = va_arg (p, enum machine_mode); 2445: nargs = va_arg (p, int); 1.1.1.7 ! root 2446: #endif ! 2447: ! 2448: is_const = no_queue; ! 2449: fun = orgfun; 1.1.1.5 root 2450: 2451: /* If this kind of value comes back in memory, 2452: decide where in memory it should come back. */ 1.1.1.6 root 2453: if (aggregate_value_p (type_for_mode (outmode, 0))) 1.1.1.5 root 2454: { 1.1.1.6 root 2455: #ifdef PCC_STATIC_STRUCT_RETURN 2456: rtx pointer_reg 2457: = hard_function_value (build_pointer_type (type_for_mode (outmode, 0)), 2458: 0); 2459: mem_value = gen_rtx (MEM, outmode, pointer_reg); 2460: pcc_struct_value = 1; 2461: if (value == 0) 2462: value = gen_reg_rtx (outmode); 2463: #else /* not PCC_STATIC_STRUCT_RETURN */ 2464: struct_value_size = GET_MODE_SIZE (outmode); 2465: if (value != 0 && GET_CODE (value) == MEM) 1.1.1.5 root 2466: mem_value = value; 2467: else 2468: mem_value = assign_stack_temp (outmode, GET_MODE_SIZE (outmode), 0); 1.1.1.6 root 2469: #endif 1.1.1.7 ! root 2470: ! 2471: /* This call returns a big structure. */ ! 2472: is_const = 0; 1.1.1.5 root 2473: } 2474: 2475: /* ??? Unfinished: must pass the memory address as an argument. */ 2476: 2477: /* Copy all the libcall-arguments out of the varargs data 2478: and into a vector ARGVEC. 2479: 2480: Compute how to pass each argument. We only support a very small subset 2481: of the full argument passing conventions to limit complexity here since 2482: library functions shouldn't have many args. */ 2483: 2484: argvec = (struct arg *) alloca ((nargs + 1) * sizeof (struct arg)); 2485: 2486: INIT_CUMULATIVE_ARGS (args_so_far, NULL_TREE, fun); 2487: 2488: args_size.constant = 0; 2489: args_size.var = 0; 2490: 2491: count = 0; 2492: 1.1.1.6 root 2493: push_temp_slots (); 2494: 1.1.1.5 root 2495: /* If there's a structure value address to be passed, 2496: either pass it in the special place, or pass it as an extra argument. */ 1.1.1.6 root 2497: if (mem_value && struct_value_rtx == 0 && ! pcc_struct_value) 1.1.1.5 root 2498: { 2499: rtx addr = XEXP (mem_value, 0); 1.1.1.6 root 2500: nargs++; 1.1.1.5 root 2501: 1.1.1.6 root 2502: /* Make sure it is a reasonable operand for a move or push insn. */ 2503: if (GET_CODE (addr) != REG && GET_CODE (addr) != MEM 2504: && ! (CONSTANT_P (addr) && LEGITIMATE_CONSTANT_P (addr))) 2505: addr = force_operand (addr, NULL_RTX); 1.1.1.5 root 2506: 1.1.1.6 root 2507: argvec[count].value = addr; 2508: argvec[count].mode = Pmode; 2509: argvec[count].partial = 0; 1.1.1.5 root 2510: 1.1.1.6 root 2511: argvec[count].reg = FUNCTION_ARG (args_so_far, Pmode, NULL_TREE, 1); 1.1.1.5 root 2512: #ifdef FUNCTION_ARG_PARTIAL_NREGS 1.1.1.6 root 2513: if (FUNCTION_ARG_PARTIAL_NREGS (args_so_far, Pmode, NULL_TREE, 1)) 2514: abort (); 1.1.1.5 root 2515: #endif 2516: 1.1.1.6 root 2517: locate_and_pad_parm (Pmode, NULL_TREE, 2518: argvec[count].reg && argvec[count].partial == 0, 2519: NULL_TREE, &args_size, &argvec[count].offset, 2520: &argvec[count].size); 1.1.1.5 root 2521: 2522: 1.1.1.6 root 2523: if (argvec[count].reg == 0 || argvec[count].partial != 0 1.1.1.5 root 2524: #ifdef REG_PARM_STACK_SPACE 1.1.1.6 root 2525: || 1 1.1.1.5 root 2526: #endif 1.1.1.6 root 2527: ) 2528: args_size.constant += argvec[count].size.constant; 1.1.1.5 root 2529: 1.1.1.6 root 2530: FUNCTION_ARG_ADVANCE (args_so_far, Pmode, (tree)0, 1); 2531: 2532: count++; 1.1.1.5 root 2533: } 2534: 2535: for (; count < nargs; count++) 2536: { 2537: rtx val = va_arg (p, rtx); 2538: enum machine_mode mode = va_arg (p, enum machine_mode); 2539: 2540: /* We cannot convert the arg value to the mode the library wants here; 2541: must do it earlier where we know the signedness of the arg. */ 2542: if (mode == BLKmode 2543: || (GET_MODE (val) != mode && GET_MODE (val) != VOIDmode)) 2544: abort (); 2545: 2546: /* On some machines, there's no way to pass a float to a library fcn. 2547: Pass it as a double instead. */ 2548: #ifdef LIBGCC_NEEDS_DOUBLE 2549: if (LIBGCC_NEEDS_DOUBLE && mode == SFmode) 1.1.1.7 ! root 2550: val = convert_modes (DFmode, SFmode, val, 0), mode = DFmode; 1.1.1.5 root 2551: #endif 2552: 2553: /* There's no need to call protect_from_queue, because 2554: either emit_move_insn or emit_push_insn will do that. */ 2555: 2556: /* Make sure it is a reasonable operand for a move or push insn. */ 2557: if (GET_CODE (val) != REG && GET_CODE (val) != MEM 2558: && ! (CONSTANT_P (val) && LEGITIMATE_CONSTANT_P (val))) 2559: val = force_operand (val, NULL_RTX); 2560: 2561: #ifdef FUNCTION_ARG_PASS_BY_REFERENCE 2562: if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, mode, NULL_TREE, 1)) 1.1.1.6 root 2563: { 2564: /* We do not support FUNCTION_ARG_CALLEE_COPIES here since it can 2565: be viewed as just an efficiency improvement. */ 2566: rtx slot = assign_stack_temp (mode, GET_MODE_SIZE (mode), 0); 2567: emit_move_insn (slot, val); 2568: val = XEXP (slot, 0); 2569: mode = Pmode; 2570: } 1.1.1.5 root 2571: #endif 2572: 1.1.1.6 root 2573: argvec[count].value = val; 2574: argvec[count].mode = mode; 2575: 1.1.1.5 root 2576: argvec[count].reg = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1); 2577: if (argvec[count].reg && GET_CODE (argvec[count].reg) == EXPR_LIST) 2578: abort (); 2579: #ifdef FUNCTION_ARG_PARTIAL_NREGS 2580: argvec[count].partial 2581: = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, NULL_TREE, 1); 2582: #else 2583: argvec[count].partial = 0; 2584: #endif 2585: 2586: locate_and_pad_parm (mode, NULL_TREE, 2587: argvec[count].reg && argvec[count].partial == 0, 2588: NULL_TREE, &args_size, &argvec[count].offset, 2589: &argvec[count].size); 2590: 2591: if (argvec[count].size.var) 2592: abort (); 2593: 2594: #ifndef REG_PARM_STACK_SPACE 2595: if (argvec[count].partial) 2596: argvec[count].size.constant -= argvec[count].partial * UNITS_PER_WORD; 2597: #endif 2598: 2599: if (argvec[count].reg == 0 || argvec[count].partial != 0 2600: #ifdef REG_PARM_STACK_SPACE 2601: || 1 2602: #endif 2603: ) 2604: args_size.constant += argvec[count].size.constant; 2605: 2606: #ifdef ACCUMULATE_OUTGOING_ARGS 2607: /* If this arg is actually passed on the stack, it might be 2608: clobbering something we already put there (this library call might 2609: be inside the evaluation of an argument to a function whose call 2610: requires the stack). This will only occur when the library call 2611: has sufficient args to run out of argument registers. Abort in 2612: this case; if this ever occurs, code must be added to save and 2613: restore the arg slot. */ 2614: 2615: if (argvec[count].reg == 0 || argvec[count].partial != 0) 2616: abort (); 2617: #endif 2618: 2619: FUNCTION_ARG_ADVANCE (args_so_far, mode, (tree)0, 1); 2620: } 2621: va_end (p); 2622: 2623: /* If this machine requires an external definition for library 2624: functions, write one out. */ 2625: assemble_external_libcall (fun); 2626: 2627: original_args_size = args_size; 2628: #ifdef STACK_BOUNDARY 2629: args_size.constant = (((args_size.constant + (STACK_BYTES - 1)) 2630: / STACK_BYTES) * STACK_BYTES); 2631: #endif 2632: 2633: #ifdef REG_PARM_STACK_SPACE 2634: args_size.constant = MAX (args_size.constant, 2635: REG_PARM_STACK_SPACE (NULL_TREE)); 2636: #ifndef OUTGOING_REG_PARM_STACK_SPACE 2637: args_size.constant -= REG_PARM_STACK_SPACE (NULL_TREE); 2638: #endif 2639: #endif 2640: 2641: if (args_size.constant > current_function_outgoing_args_size) 2642: current_function_outgoing_args_size = args_size.constant; 1.1.1.7 ! root 2643: ! 2644: #ifdef ACCUMULATE_OUTGOING_ARGS 1.1.1.5 root 2645: args_size.constant = 0; 2646: #endif 2647: 2648: #ifndef PUSH_ROUNDING 2649: argblock = push_block (GEN_INT (args_size.constant), 0, 0); 2650: #endif 2651: 2652: #ifdef PUSH_ARGS_REVERSED 2653: #ifdef STACK_BOUNDARY 2654: /* If we push args individually in reverse order, perform stack alignment 2655: before the first push (the last arg). */ 2656: if (argblock == 0) 2657: anti_adjust_stack (GEN_INT (args_size.constant 2658: - original_args_size.constant)); 2659: #endif 2660: #endif 2661: 2662: #ifdef PUSH_ARGS_REVERSED 2663: inc = -1; 2664: argnum = nargs - 1; 2665: #else 2666: inc = 1; 2667: argnum = 0; 2668: #endif 2669: 2670: /* Push the args that need to be pushed. */ 2671: 2672: for (count = 0; count < nargs; count++, argnum += inc) 2673: { 2674: register enum machine_mode mode = argvec[argnum].mode; 2675: register rtx val = argvec[argnum].value; 2676: rtx reg = argvec[argnum].reg; 2677: int partial = argvec[argnum].partial; 2678: 2679: if (! (reg != 0 && partial == 0)) 2680: emit_push_insn (val, mode, NULL_TREE, NULL_RTX, 0, partial, reg, 0, 2681: argblock, GEN_INT (argvec[count].offset.constant)); 2682: NO_DEFER_POP; 2683: } 2684: 2685: #ifndef PUSH_ARGS_REVERSED 2686: #ifdef STACK_BOUNDARY 2687: /* If we pushed args in forward order, perform stack alignment 2688: after pushing the last arg. */ 2689: if (argblock == 0) 2690: anti_adjust_stack (GEN_INT (args_size.constant 2691: - original_args_size.constant)); 2692: #endif 2693: #endif 2694: 2695: #ifdef PUSH_ARGS_REVERSED 2696: argnum = nargs - 1; 2697: #else 2698: argnum = 0; 2699: #endif 2700: 1.1.1.7 ! root 2701: fun = prepare_call_address (fun, NULL_TREE, &call_fusage, 0); ! 2702: 1.1.1.5 root 2703: /* Now load any reg parms into their regs. */ 2704: 2705: for (count = 0; count < nargs; count++, argnum += inc) 2706: { 2707: register enum machine_mode mode = argvec[argnum].mode; 2708: register rtx val = argvec[argnum].value; 2709: rtx reg = argvec[argnum].reg; 2710: int partial = argvec[argnum].partial; 2711: 2712: if (reg != 0 && partial == 0) 2713: emit_move_insn (reg, val); 2714: NO_DEFER_POP; 2715: } 2716: 2717: #if 0 2718: /* For version 1.37, try deleting this entirely. */ 2719: if (! no_queue) 2720: emit_queue (); 2721: #endif 2722: 2723: /* Any regs containing parms remain in use through the call. */ 2724: for (count = 0; count < nargs; count++) 2725: if (argvec[count].reg != 0) 1.1.1.7 ! root 2726: use_reg (&call_fusage, argvec[count].reg); 1.1.1.5 root 2727: 1.1.1.6 root 2728: /* Pass the function the address in which to return a structure value. */ 2729: if (mem_value != 0 && struct_value_rtx != 0 && ! pcc_struct_value) 2730: { 2731: emit_move_insn (struct_value_rtx, 2732: force_reg (Pmode, 2733: force_operand (XEXP (mem_value, 0), 2734: NULL_RTX))); 2735: if (GET_CODE (struct_value_rtx) == REG) 1.1.1.7 ! root 2736: use_reg (&call_fusage, struct_value_rtx); 1.1.1.6 root 2737: } 2738: 1.1.1.5 root 2739: /* Don't allow popping to be deferred, since then 2740: cse'ing of library calls could delete a call and leave the pop. */ 2741: NO_DEFER_POP; 2742: 2743: /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which 2744: will set inhibit_defer_pop to that value. */ 2745: 1.1.1.6 root 2746: emit_call_1 (fun, get_identifier (XSTR (orgfun, 0)), args_size.constant, 2747: struct_value_size, 1.1.1.5 root 2748: FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1), 1.1.1.6 root 2749: (outmode != VOIDmode && mem_value == 0 2750: ? hard_libcall_value (outmode) : NULL_RTX), 1.1.1.7 ! root 2751: old_inhibit_defer_pop + 1, call_fusage, is_const); 1.1.1.5 root 2752: 2753: /* Now restore inhibit_defer_pop to its actual original value. */ 2754: OK_DEFER_POP; 2755: 1.1.1.6 root 2756: pop_temp_slots (); 2757: 1.1.1.5 root 2758: /* Copy the value to the right place. */ 2759: if (outmode != VOIDmode) 2760: { 2761: if (mem_value) 2762: { 2763: if (value == 0) 1.1.1.6 root 2764: value = mem_value; 1.1.1.5 root 2765: if (value != mem_value) 2766: emit_move_insn (value, mem_value); 2767: } 2768: else if (value != 0) 2769: emit_move_insn (value, hard_libcall_value (outmode)); 1.1.1.6 root 2770: else 2771: value = hard_libcall_value (outmode); 1.1.1.5 root 2772: } 1.1.1.6 root 2773: 2774: return value; 1.1.1.5 root 2775: } 2776: 1.1 root 2777: #if 0 2778: /* Return an rtx which represents a suitable home on the stack 2779: given TYPE, the type of the argument looking for a home. 2780: This is called only for BLKmode arguments. 2781: 2782: SIZE is the size needed for this target. 2783: ARGS_ADDR is the address of the bottom of the argument block for this call. 2784: OFFSET describes this parameter's offset into ARGS_ADDR. It is meaningless 2785: if this machine uses push insns. */ 2786: 2787: static rtx 2788: target_for_arg (type, size, args_addr, offset) 2789: tree type; 2790: rtx size; 2791: rtx args_addr; 2792: struct args_size offset; 2793: { 2794: rtx target; 2795: rtx offset_rtx = ARGS_SIZE_RTX (offset); 2796: 2797: /* We do not call memory_address if possible, 2798: because we want to address as close to the stack 2799: as possible. For non-variable sized arguments, 2800: this will be stack-pointer relative addressing. */ 2801: if (GET_CODE (offset_rtx) == CONST_INT) 2802: target = plus_constant (args_addr, INTVAL (offset_rtx)); 2803: else 2804: { 2805: /* I have no idea how to guarantee that this 2806: will work in the presence of register parameters. */ 2807: target = gen_rtx (PLUS, Pmode, args_addr, offset_rtx); 2808: target = memory_address (QImode, target); 2809: } 2810: 2811: return gen_rtx (MEM, BLKmode, target); 2812: } 2813: #endif 2814: 2815: /* Store a single argument for a function call 2816: into the register or memory area where it must be passed. 2817: *ARG describes the argument value and where to pass it. 2818: 2819: ARGBLOCK is the address of the stack-block for all the arguments, 1.1.1.2 root 2820: or 0 on a machine where arguments are pushed individually. 1.1 root 2821: 2822: MAY_BE_ALLOCA nonzero says this could be a call to `alloca' 2823: so must be careful about how the stack is used. 2824: 2825: VARIABLE_SIZE nonzero says that this was a variable-sized outgoing 2826: argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate 2827: that we need not worry about saving and restoring the stack. 2828: 2829: FNDECL is the declaration of the function we are calling. */ 2830: 2831: static void 1.1.1.3 root 2832: store_one_arg (arg, argblock, may_be_alloca, variable_size, fndecl, 2833: reg_parm_stack_space) 1.1 root 2834: struct arg_data *arg; 2835: rtx argblock; 2836: int may_be_alloca; 2837: int variable_size; 2838: tree fndecl; 1.1.1.3 root 2839: int reg_parm_stack_space; 1.1 root 2840: { 2841: register tree pval = arg->tree_value; 2842: rtx reg = 0; 2843: int partial = 0; 2844: int used = 0; 2845: int i, lower_bound, upper_bound; 2846: 2847: if (TREE_CODE (pval) == ERROR_MARK) 2848: return; 2849: 1.1.1.7 ! root 2850: /* Push a new temporary level for any temporaries we make for ! 2851: this argument. */ ! 2852: push_temp_slots (); ! 2853: 1.1 root 2854: #ifdef ACCUMULATE_OUTGOING_ARGS 2855: /* If this is being stored into a pre-allocated, fixed-size, stack area, 2856: save any previous data at that location. */ 2857: if (argblock && ! variable_size && arg->stack) 2858: { 2859: #ifdef ARGS_GROW_DOWNWARD 2860: /* stack_slot is negative, but we want to index stack_usage_map */ 2861: /* with positive values. */ 2862: if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS) 2863: upper_bound = -INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1)) + 1; 2864: else 2865: abort (); 2866: 2867: lower_bound = upper_bound - arg->size.constant; 2868: #else 2869: if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS) 2870: lower_bound = INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1)); 2871: else 2872: lower_bound = 0; 2873: 2874: upper_bound = lower_bound + arg->size.constant; 2875: #endif 2876: 2877: for (i = lower_bound; i < upper_bound; i++) 2878: if (stack_usage_map[i] 2879: #ifdef REG_PARM_STACK_SPACE 2880: /* Don't store things in the fixed argument area at this point; 2881: it has already been saved. */ 1.1.1.3 root 2882: && i > reg_parm_stack_space 1.1 root 2883: #endif 2884: ) 2885: break; 2886: 2887: if (i != upper_bound) 2888: { 2889: /* We need to make a save area. See what mode we can make it. */ 2890: enum machine_mode save_mode 2891: = mode_for_size (arg->size.constant * BITS_PER_UNIT, MODE_INT, 1); 2892: rtx stack_area 2893: = gen_rtx (MEM, save_mode, 2894: memory_address (save_mode, XEXP (arg->stack_slot, 0))); 2895: 2896: if (save_mode == BLKmode) 2897: { 2898: arg->save_area = assign_stack_temp (BLKmode, 2899: arg->size.constant, 1); 1.1.1.7 ! root 2900: preserve_temp_slots (arg->save_area); 1.1 root 2901: emit_block_move (validize_mem (arg->save_area), stack_area, 1.1.1.4 root 2902: GEN_INT (arg->size.constant), 1.1 root 2903: PARM_BOUNDARY / BITS_PER_UNIT); 2904: } 2905: else 2906: { 2907: arg->save_area = gen_reg_rtx (save_mode); 2908: emit_move_insn (arg->save_area, stack_area); 2909: } 2910: } 2911: } 2912: #endif 2913: 2914: /* If this isn't going to be placed on both the stack and in registers, 2915: set up the register and number of words. */ 2916: if (! arg->pass_on_stack) 2917: reg = arg->reg, partial = arg->partial; 2918: 2919: if (reg != 0 && partial == 0) 2920: /* Being passed entirely in a register. We shouldn't be called in 2921: this case. */ 2922: abort (); 2923: 1.1.1.5 root 2924: #ifdef STRICT_ALIGNMENT 2925: /* If this arg needs special alignment, don't load the registers 2926: here. */ 2927: if (arg->n_aligned_regs != 0) 2928: reg = 0; 2929: #endif 2930: 1.1 root 2931: /* If this is being partially passed in a register, but multiple locations 2932: are specified, we assume that the one partially used is the one that is 2933: listed first. */ 2934: if (reg && GET_CODE (reg) == EXPR_LIST) 2935: reg = XEXP (reg, 0); 2936: 1.1.1.5 root 2937: /* If this is being passed partially in a register, we can't evaluate 1.1 root 2938: it directly into its stack slot. Otherwise, we can. */ 2939: if (arg->value == 0) 1.1.1.3 root 2940: { 2941: #ifdef ACCUMULATE_OUTGOING_ARGS 2942: /* stack_arg_under_construction is nonzero if a function argument is 2943: being evaluated directly into the outgoing argument list and 2944: expand_call must take special action to preserve the argument list 2945: if it is called recursively. 2946: 2947: For scalar function arguments stack_usage_map is sufficient to 2948: determine which stack slots must be saved and restored. Scalar 2949: arguments in general have pass_on_stack == 0. 2950: 2951: If this argument is initialized by a function which takes the 2952: address of the argument (a C++ constructor or a C function 2953: returning a BLKmode structure), then stack_usage_map is 2954: insufficient and expand_call must push the stack around the 2955: function call. Such arguments have pass_on_stack == 1. 2956: 2957: Note that it is always safe to set stack_arg_under_construction, 2958: but this generates suboptimal code if set when not needed. */ 2959: 2960: if (arg->pass_on_stack) 2961: stack_arg_under_construction++; 2962: #endif 1.1.1.6 root 2963: arg->value = expand_expr (pval, 2964: (partial 2965: || TYPE_MODE (TREE_TYPE (pval)) != arg->mode) 2966: ? NULL_RTX : arg->stack, 1.1.1.4 root 2967: VOIDmode, 0); 1.1.1.5 root 2968: 2969: /* If we are promoting object (or for any other reason) the mode 2970: doesn't agree, convert the mode. */ 2971: 1.1.1.7 ! root 2972: if (arg->mode != TYPE_MODE (TREE_TYPE (pval))) ! 2973: arg->value = convert_modes (arg->mode, TYPE_MODE (TREE_TYPE (pval)), ! 2974: arg->value, arg->unsignedp); 1.1.1.5 root 2975: 1.1.1.3 root 2976: #ifdef ACCUMULATE_OUTGOING_ARGS 2977: if (arg->pass_on_stack) 2978: stack_arg_under_construction--; 2979: #endif 2980: } 1.1 root 2981: 2982: /* Don't allow anything left on stack from computation 2983: of argument to alloca. */ 2984: if (may_be_alloca) 2985: do_pending_stack_adjust (); 2986: 2987: if (arg->value == arg->stack) 2988: /* If the value is already in the stack slot, we are done. */ 2989: ; 1.1.1.5 root 2990: else if (arg->mode != BLKmode) 1.1 root 2991: { 2992: register int size; 2993: 2994: /* Argument is a scalar, not entirely passed in registers. 2995: (If part is passed in registers, arg->partial says how much 2996: and emit_push_insn will take care of putting it there.) 2997: 2998: Push it, and if its size is less than the 2999: amount of space allocated to it, 3000: also bump stack pointer by the additional space. 3001: Note that in C the default argument promotions 3002: will prevent such mismatches. */ 3003: 1.1.1.5 root 3004: size = GET_MODE_SIZE (arg->mode); 1.1 root 3005: /* Compute how much space the push instruction will push. 3006: On many machines, pushing a byte will advance the stack 3007: pointer by a halfword. */ 3008: #ifdef PUSH_ROUNDING 3009: size = PUSH_ROUNDING (size); 3010: #endif 3011: used = size; 3012: 3013: /* Compute how much space the argument should get: 3014: round up to a multiple of the alignment for arguments. */ 1.1.1.5 root 3015: if (none != FUNCTION_ARG_PADDING (arg->mode, TREE_TYPE (pval))) 1.1 root 3016: used = (((size + PARM_BOUNDARY / BITS_PER_UNIT - 1) 3017: / (PARM_BOUNDARY / BITS_PER_UNIT)) 3018: * (PARM_BOUNDARY / BITS_PER_UNIT)); 3019: 3020: /* This isn't already where we want it on the stack, so put it there. 3021: This can either be done with push or copy insns. */ 1.1.1.5 root 3022: emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), NULL_RTX, 3023: 0, partial, reg, used - size, 3024: argblock, ARGS_SIZE_RTX (arg->offset)); 1.1 root 3025: } 3026: else 3027: { 3028: /* BLKmode, at least partly to be pushed. */ 3029: 3030: register int excess; 3031: rtx size_rtx; 3032: 3033: /* Pushing a nonscalar. 3034: If part is passed in registers, PARTIAL says how much 3035: and emit_push_insn will take care of putting it there. */ 3036: 3037: /* Round its size up to a multiple 3038: of the allocation unit for arguments. */ 3039: 3040: if (arg->size.var != 0) 3041: { 3042: excess = 0; 3043: size_rtx = ARGS_SIZE_RTX (arg->size); 3044: } 3045: else 3046: { 3047: /* PUSH_ROUNDING has no effect on us, because 3048: emit_push_insn for BLKmode is careful to avoid it. */ 1.1.1.5 root 3049: excess = (arg->size.constant - int_size_in_bytes (TREE_TYPE (pval)) 1.1 root 3050: + partial * UNITS_PER_WORD); 1.1.1.5 root 3051: size_rtx = expr_size (pval); 1.1 root 3052: } 3053: 1.1.1.5 root 3054: emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), size_rtx, 1.1 root 3055: TYPE_ALIGN (TREE_TYPE (pval)) / BITS_PER_UNIT, partial, 3056: reg, excess, argblock, ARGS_SIZE_RTX (arg->offset)); 3057: } 3058: 3059: 3060: /* Unless this is a partially-in-register argument, the argument is now 3061: in the stack. 3062: 3063: ??? Note that this can change arg->value from arg->stack to 3064: arg->stack_slot and it matters when they are not the same. 3065: It isn't totally clear that this is correct in all cases. */ 3066: if (partial == 0) 3067: arg->value = arg->stack_slot; 3068: 3069: /* Once we have pushed something, pops can't safely 3070: be deferred during the rest of the arguments. */ 3071: NO_DEFER_POP; 3072: 3073: /* ANSI doesn't require a sequence point here, 3074: but PCC has one, so this will avoid some problems. */ 3075: emit_queue (); 3076: 1.1.1.7 ! root 3077: /* Free any temporary slots made in processing this argument. Show ! 3078: that we might have taken the address of something and pushed that ! 3079: as an operand. */ ! 3080: preserve_temp_slots (NULL_RTX); 1.1 root 3081: free_temp_slots (); 1.1.1.7 ! root 3082: pop_temp_slots (); 1.1 root 3083: 3084: #ifdef ACCUMULATE_OUTGOING_ARGS 3085: /* Now mark the segment we just used. */ 3086: if (argblock && ! variable_size && arg->stack) 3087: for (i = lower_bound; i < upper_bound; i++) 3088: stack_usage_map[i] = 1; 3089: #endif 3090: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.