expr.h 30.2 KB
Newer Older
Richard Kenner committed
1
/* Definitions for code generation pass of GNU compiler.
Jeff Law committed
2
   Copyright (C) 1987, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3
   1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
Richard Kenner committed
4

5
This file is part of GCC.
Richard Kenner committed
6

7 8 9 10
GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 2, or (at your option) any later
version.
Richard Kenner committed
11

12 13 14 15
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
for more details.
Richard Kenner committed
16 17

You should have received a copy of the GNU General Public License
18 19 20
along with GCC; see the file COPYING.  If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA.  */
Richard Kenner committed
21

22 23 24 25 26 27 28 29 30 31 32 33 34 35 36
#ifndef GCC_EXPR_H
#define GCC_EXPR_H

/* For inhibit_defer_pop */
#include "function.h"
/* For XEXP, GEN_INT, rtx_code */
#include "rtl.h"
/* For optimize_size */
#include "flags.h"
/* For host_integerp, tree_low_cst, convert, size_binop, ssize_int, TREE_CODE,
   TYPE_SIZE, int_size_in_bytes,    */
#include "tree.h"
/* For GET_MODE_BITSIZE, word_mode */
#include "machmode.h"

Richard Kenner committed
37 38 39 40 41 42 43 44 45 46 47 48
/* The default branch cost is 1.  */
#ifndef BRANCH_COST
#define BRANCH_COST 1
#endif

/* Macros to access the slots of a QUEUED rtx.
   Here rather than in rtl.h because only the expansion pass
   should ever encounter a QUEUED.  */

/* The variable for which an increment is queued.  */
#define QUEUED_VAR(P) XEXP (P, 0)
/* If the increment has been emitted, this is the insn
49 50
   that does the increment.  It is zero before the increment is emitted.
   If more than one insn is emitted, this is the first insn.  */
Richard Kenner committed
51 52 53 54 55 56 57 58 59 60 61
#define QUEUED_INSN(P) XEXP (P, 1)
/* If a pre-increment copy has been generated, this is the copy
   (it is a temporary reg).  Zero if no copy made yet.  */
#define QUEUED_COPY(P) XEXP (P, 2)
/* This is the body to use for the insn to do the increment.
   It is used to emit the increment.  */
#define QUEUED_BODY(P) XEXP (P, 3)
/* Next QUEUED in the queue.  */
#define QUEUED_NEXT(P) XEXP (P, 4)

/* This is the 4th arg to `expand_expr'.
62 63 64
   EXPAND_STACK_PARM means we are possibly expanding a call param onto
   the stack.  Choosing a value of 2 isn't special;  It just allows
   some code optimization in store_expr.
Richard Kenner committed
65 66 67
   EXPAND_SUM means it is ok to return a PLUS rtx or MULT rtx.
   EXPAND_INITIALIZER is similar but also record any labels on forced_labels.
   EXPAND_CONST_ADDRESS means it is ok to return a MEM whose address
68
    is a constant that is not a legitimate address.
69 70 71
   EXPAND_WRITE means we are only going to write to the resulting rtx.
   EXPAND_MEMORY means we are interested in a memory result, even if
    the memory is constant and we could have propagated a constant value.  */
72
enum expand_modifier {EXPAND_NORMAL = 0, EXPAND_STACK_PARM = 2, EXPAND_SUM,
73 74
		      EXPAND_CONST_ADDRESS, EXPAND_INITIALIZER, EXPAND_WRITE,
		      EXPAND_MEMORY};
Richard Kenner committed
75

76 77 78 79 80 81 82
/* Prevent the compiler from deferring stack pops.  See
   inhibit_defer_pop for more information.  */
#define NO_DEFER_POP (inhibit_defer_pop += 1)

/* Allow the compiler to defer stack pops.  See inhibit_defer_pop for
   more information.  */
#define OK_DEFER_POP (inhibit_defer_pop -= 1)
Richard Kenner committed
83

84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107
/* If a memory-to-memory move would take MOVE_RATIO or more simple
   move-instruction sequences, we will do a movstr or libcall instead.  */

#ifndef MOVE_RATIO
#if defined (HAVE_movstrqi) || defined (HAVE_movstrhi) || defined (HAVE_movstrsi) || defined (HAVE_movstrdi) || defined (HAVE_movstrti)
#define MOVE_RATIO 2
#else
/* If we are optimizing for space (-Os), cut down the default move ratio.  */
#define MOVE_RATIO (optimize_size ? 3 : 15)
#endif
#endif

/* If a clear memory operation would take CLEAR_RATIO or more simple
   move-instruction sequences, we will do a clrstr or libcall instead.  */

#ifndef CLEAR_RATIO
#if defined (HAVE_clrstrqi) || defined (HAVE_clrstrhi) || defined (HAVE_clrstrsi) || defined (HAVE_clrstrdi) || defined (HAVE_clrstrti)
#define CLEAR_RATIO 2
#else
/* If we are optimizing for space, cut down the default clear ratio.  */
#define CLEAR_RATIO (optimize_size ? 3 : 15)
#endif
#endif

108 109
enum direction {none, upward, downward};

Richard Kenner committed
110
/* Structure to record the size of a sequence of arguments
111 112 113
   as the sum of a tree-expression and a constant.  This structure is
   also used to store offsets from the stack, which might be negative,
   so the variable part must be ssizetype, not sizetype.  */
Richard Kenner committed
114 115 116

struct args_size
{
117
  HOST_WIDE_INT constant;
Richard Kenner committed
118 119
  tree var;
};
120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136

/* Package up various arg related fields of struct args for
   locate_and_pad_parm.  */
struct locate_and_pad_arg_data
{
  /* Size of this argument on the stack, rounded up for any padding it
     gets.  If REG_PARM_STACK_SPACE is defined, then register parms are
     counted here, otherwise they aren't.  */
  struct args_size size;
  /* Offset of this argument from beginning of stack-args.  */
  struct args_size offset;
  /* Offset to the start of the stack slot.  Different from OFFSET
     if this arg pads downward.  */
  struct args_size slot_offset;
  /* The amount that the stack pointer needs to be adjusted to
     force alignment for the next argument.  */
  struct args_size alignment_pad;
137 138
  /* Which way we should pad this arg.  */
  enum direction where_pad;
139
};
Richard Kenner committed
140 141 142

/* Add the value of the tree INC to the `struct args_size' TO.  */

143 144 145 146 147 148
#define ADD_PARM_SIZE(TO, INC)				\
do {							\
  tree inc = (INC);					\
  if (host_integerp (inc, 0))				\
    (TO).constant += tree_low_cst (inc, 0);		\
  else if ((TO).var == 0)				\
149
    (TO).var = convert (ssizetype, inc);		\
150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166
  else							\
    (TO).var = size_binop (PLUS_EXPR, (TO).var,		\
			   convert (ssizetype, inc));	\
} while (0)

#define SUB_PARM_SIZE(TO, DEC)				\
do {							\
  tree dec = (DEC);					\
  if (host_integerp (dec, 0))				\
    (TO).constant -= tree_low_cst (dec, 0);		\
  else if ((TO).var == 0)				\
    (TO).var = size_binop (MINUS_EXPR, ssize_int (0),	\
			   convert (ssizetype, dec));	\
  else							\
    (TO).var = size_binop (MINUS_EXPR, (TO).var,	\
			   convert (ssizetype, dec));	\
} while (0)
Richard Kenner committed
167

168 169 170 171
/* Convert the implicit sum in a `struct args_size' into a tree
   of type ssizetype.  */
#define ARGS_SIZE_TREE(SIZE)					\
((SIZE).var == 0 ? ssize_int ((SIZE).constant)			\
172 173
 : size_binop (PLUS_EXPR, convert (ssizetype, (SIZE).var),	\
	       ssize_int ((SIZE).constant)))
174

Richard Kenner committed
175
/* Convert the implicit sum in a `struct args_size' into an rtx.  */
176 177
#define ARGS_SIZE_RTX(SIZE)					\
((SIZE).var == 0 ? GEN_INT ((SIZE).constant)			\
178
 : expand_expr (ARGS_SIZE_TREE (SIZE), NULL_RTX, VOIDmode, 0))
Richard Kenner committed
179 180

/* Supply a default definition for FUNCTION_ARG_PADDING:
Richard Stallman committed
181
   usually pad upward, but pad short args downward on
Richard Kenner committed
182 183
   big-endian machines.  */

184
#define DEFAULT_FUNCTION_ARG_PADDING(MODE, TYPE)			\
185 186 187 188 189 190 191
  (! BYTES_BIG_ENDIAN							\
   ? upward								\
   : (((MODE) == BLKmode						\
       ? ((TYPE) && TREE_CODE (TYPE_SIZE (TYPE)) == INTEGER_CST		\
	  && int_size_in_bytes (TYPE) < (PARM_BOUNDARY / BITS_PER_UNIT)) \
       : GET_MODE_BITSIZE (MODE) < PARM_BOUNDARY)			\
      ? downward : upward))
192 193 194 195

#ifndef FUNCTION_ARG_PADDING
#define FUNCTION_ARG_PADDING(MODE, TYPE)	\
  DEFAULT_FUNCTION_ARG_PADDING ((MODE), (TYPE))
Richard Kenner committed
196 197 198 199 200
#endif

/* Supply a default definition for FUNCTION_ARG_BOUNDARY.  Normally, we let
   FUNCTION_ARG_PADDING, which also pads the length, handle any needed
   alignment.  */
Kazu Hirata committed
201

Richard Kenner committed
202 203 204 205
#ifndef FUNCTION_ARG_BOUNDARY
#define FUNCTION_ARG_BOUNDARY(MODE, TYPE)	PARM_BOUNDARY
#endif

206 207 208
tree split_complex_types (tree);
tree split_complex_values (tree);

209
/* Nonzero if we do not know how to pass TYPE solely in registers.  */
210
extern bool default_must_pass_in_stack (enum machine_mode, tree);
211
#ifndef MUST_PASS_IN_STACK
212
#define MUST_PASS_IN_STACK(MODE,TYPE) default_must_pass_in_stack(MODE, TYPE)
213
#endif
Richard Kenner committed
214

215 216 217 218 219 220 221
/* Supply a default definition of STACK_SAVEAREA_MODE for emit_stack_save.
   Normally move_insn, so Pmode stack pointer.  */

#ifndef STACK_SAVEAREA_MODE
#define STACK_SAVEAREA_MODE(LEVEL) Pmode
#endif

222 223 224 225 226 227 228
/* Supply a default definition of STACK_SIZE_MODE for
   allocate_dynamic_stack_space.  Normally PLUS/MINUS, so word_mode.  */

#ifndef STACK_SIZE_MODE
#define STACK_SIZE_MODE word_mode
#endif

229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267
/* Provide default values for the macros controlling stack checking.  */

#ifndef STACK_CHECK_BUILTIN
#define STACK_CHECK_BUILTIN 0
#endif

/* The default interval is one page.  */
#ifndef STACK_CHECK_PROBE_INTERVAL
#define STACK_CHECK_PROBE_INTERVAL 4096
#endif

/* The default is to do a store into the stack.  */
#ifndef STACK_CHECK_PROBE_LOAD
#define STACK_CHECK_PROBE_LOAD 0
#endif

/* This value is arbitrary, but should be sufficient for most machines.  */
#ifndef STACK_CHECK_PROTECT
#define STACK_CHECK_PROTECT (75 * UNITS_PER_WORD)
#endif

/* Make the maximum frame size be the largest we can and still only need
   one probe per function.  */
#ifndef STACK_CHECK_MAX_FRAME_SIZE
#define STACK_CHECK_MAX_FRAME_SIZE \
  (STACK_CHECK_PROBE_INTERVAL - UNITS_PER_WORD)
#endif

/* This is arbitrary, but should be large enough everywhere.  */
#ifndef STACK_CHECK_FIXED_FRAME_SIZE
#define STACK_CHECK_FIXED_FRAME_SIZE (4 * UNITS_PER_WORD)
#endif

/* Provide a reasonable default for the maximum size of an object to
   allocate in the fixed frame.  We may need to be able to make this
   controllable by the user at some point.  */
#ifndef STACK_CHECK_MAX_VAR_SIZE
#define STACK_CHECK_MAX_VAR_SIZE (STACK_CHECK_MAX_FRAME_SIZE / 100)
#endif
Richard Kenner committed
268

269 270
/* Functions from optabs.c, commonly used, and without need for the optabs
   tables:  */
Richard Kenner committed
271

272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290
/* Passed to expand_simple_binop and expand_binop to say which options
   to try to use if the requested operation can't be open-coded on the
   requisite mode.  Either OPTAB_LIB or OPTAB_LIB_WIDEN says try using
   a library call.  Either OPTAB_WIDEN or OPTAB_LIB_WIDEN says try
   using a wider mode.  OPTAB_MUST_WIDEN says try widening and don't
   try anything else.  */

enum optab_methods
{
  OPTAB_DIRECT,
  OPTAB_LIB,
  OPTAB_WIDEN,
  OPTAB_LIB_WIDEN,
  OPTAB_MUST_WIDEN
};

/* Generate code for a simple binary or unary operation.  "Simple" in
   this case means "can be unambiguously described by a (mode, code)
   pair and mapped to a single optab."  */
291 292 293 294
extern rtx expand_simple_binop (enum machine_mode, enum rtx_code, rtx,
				rtx, rtx, int, enum optab_methods);
extern rtx expand_simple_unop (enum machine_mode, enum rtx_code, rtx, rtx,
			       int);
295 296 297

/* Report whether the machine description contains an insn which can
   perform the operation described by CODE and MODE.  */
298
extern int have_insn_for (enum rtx_code, enum machine_mode);
299

300
/* Emit code to make a call to a constant function or a library call.  */
301
extern void emit_libcall_block (rtx, rtx, rtx, rtx);
Richard Kenner committed
302

303 304 305 306
/* Create but don't emit one rtl instruction to perform certain operations.
   Modes must match; operands must meet the operation's predicates.
   Likewise for subtraction and for just copying.
   These do not call protect_from_queue; caller must do so.  */
307 308 309 310 311 312 313
extern rtx gen_add2_insn (rtx, rtx);
extern rtx gen_add3_insn (rtx, rtx, rtx);
extern rtx gen_sub2_insn (rtx, rtx);
extern rtx gen_sub3_insn (rtx, rtx, rtx);
extern rtx gen_move_insn (rtx, rtx);
extern int have_add2_insn (rtx, rtx);
extern int have_sub2_insn (rtx, rtx);
314

Kazu Hirata committed
315
/* Emit a pair of rtl insns to compare two rtx's and to jump
316
   to a label if the comparison is true.  */
317 318
extern void emit_cmp_and_jump_insns (rtx, rtx, enum rtx_code, rtx,
				     enum machine_mode, int, rtx);
319

320
/* Generate code to indirectly jump to a location given in the rtx LOC.  */
321
extern void emit_indirect_jump (rtx);
322

323 324
#include "insn-config.h"

325 326
#ifdef HAVE_conditional_move
/* Emit a conditional move operation.  */
327 328
rtx emit_conditional_move (rtx, enum rtx_code, rtx, rtx, enum machine_mode,
			   rtx, rtx, enum machine_mode, int);
329

330
/* Return nonzero if the conditional move is supported.  */
331
int can_conditionally_move_p (enum machine_mode mode);
332

333
#endif
334 335
rtx emit_conditional_add (rtx, enum rtx_code, rtx, rtx, enum machine_mode,
			  rtx, rtx, enum machine_mode, int);
336

337

338
/* Functions from expmed.c:  */
Richard Kenner committed
339

340 341
/* Arguments MODE, RTX: return an rtx for the negation of that value.
   May emit insns.  */
342
extern rtx negate_rtx (enum machine_mode, rtx);
Richard Kenner committed
343

344
/* Expand a logical AND operation.  */
345
extern rtx expand_and (enum machine_mode, rtx, rtx, rtx);
Richard Kenner committed
346

347
/* Emit a store-flag operation.  */
348 349
extern rtx emit_store_flag (rtx, enum rtx_code, rtx, rtx, enum machine_mode,
			    int, int);
Richard Kenner committed
350

351
/* Like emit_store_flag, but always succeeds.  */
352 353
extern rtx emit_store_flag_force (rtx, enum rtx_code, rtx, rtx,
				  enum machine_mode, int, int);
354

355
/* Functions from loop.c:  */
Richard Kenner committed
356

357 358
/* Given an insn and condition, return a canonical description of
   the test being made.  */
359
extern rtx canonicalize_condition (rtx, rtx, int, rtx *, rtx, int);
360 361 362

/* Given a JUMP_INSN, return a canonical description of the test
   being made.  */
363
extern rtx get_condition (rtx, rtx *, int);
364 365

/* Generate a conditional trap instruction.  */
366
extern rtx gen_cond_trap (enum rtx_code, rtx, rtx, rtx);
367

368
/* Functions from builtins.c:  */
369
extern rtx expand_builtin (tree, rtx, rtx, enum machine_mode, int);
370
extern tree std_build_builtin_va_list (void);
371 372 373 374 375 376 377 378 379
extern void std_expand_builtin_va_start (tree, rtx);
extern rtx std_expand_builtin_va_arg (tree, tree);
extern rtx expand_builtin_va_arg (tree, tree);
extern rtx default_expand_builtin (tree, rtx, rtx, enum machine_mode, int);
extern void expand_builtin_setjmp_setup (rtx, rtx);
extern void expand_builtin_setjmp_receiver (rtx);
extern void expand_builtin_longjmp (rtx, rtx);
extern rtx expand_builtin_saveregs (void);
extern void expand_builtin_trap (void);
380 381 382
extern tree simplify_builtin_fputs (tree, int, int, tree);
extern tree simplify_builtin_strcpy (tree, tree);
extern tree simplify_builtin_strncpy (tree, tree);
383

384
/* Functions from expr.c:  */
385

386 387
/* This is run once per compilation to set up which modes can be used
   directly in memory and to initialize the block move optab.  */
388
extern void init_expr_once (void);
389 390

/* This is run at the start of compiling a function.  */
391
extern void init_expr (void);
392

393
/* This is run at the end of compiling a function.  */
394
extern void finish_expr_for_function (void);
395

396 397
/* Use protect_from_queue to convert a QUEUED expression
   into something that you can put immediately into an instruction.  */
398
extern rtx protect_from_queue (rtx, int);
399 400

/* Perform all the pending incrementations.  */
401
extern void emit_queue (void);
402

403
/* Tell if something has a queued subexpression.  */
404
extern int queued_subexp_p (rtx);
405

Richard Kenner committed
406 407
/* Emit some rtl insns to move data between rtx's, converting machine modes.
   Both modes must be floating or both fixed.  */
408
extern void convert_move (rtx, rtx, int);
Richard Kenner committed
409 410

/* Convert an rtx to specified machine mode and return the result.  */
411
extern rtx convert_to_mode (enum machine_mode, rtx, int);
Richard Kenner committed
412

413
/* Convert an rtx to MODE from OLDMODE and return the result.  */
414
extern rtx convert_modes (enum machine_mode, enum machine_mode, rtx, int);
415

416
/* Emit code to move a block Y to a block X.  */
417 418 419 420

enum block_op_methods
{
  BLOCK_OP_NORMAL,
421 422
  BLOCK_OP_NO_LIBCALL,
  BLOCK_OP_CALL_PARM
423 424
};

425 426
extern void init_block_move_fn (const char *);
extern void init_block_clear_fn (const char *);
427

428
extern rtx emit_block_move (rtx, rtx, rtx, enum block_op_methods);
429 430 431

/* Copy all or part of a value X into registers starting at REGNO.
   The number of registers to be filled is NREGS.  */
432
extern void move_block_to_reg (int, rtx, int, enum machine_mode);
433 434 435

/* Copy all or part of a BLKmode value X out of registers starting at REGNO.
   The number of registers to be filled is NREGS.  */
436
extern void move_block_from_reg (int, rtx, int);
437

438
/* Generate a non-consecutive group of registers represented by a PARALLEL.  */
439
extern rtx gen_group_rtx (rtx);
440

441 442
/* Load a BLKmode value into non-consecutive registers represented by a
   PARALLEL.  */
443
extern void emit_group_load (rtx, rtx, tree, int);
444

445 446
/* Move a non-consecutive group of registers represented by a PARALLEL into
   a non-consecutive group of registers represented by a PARALLEL.  */
447
extern void emit_group_move (rtx, rtx);
448

449 450
/* Store a BLKmode value from non-consecutive registers represented by a
   PARALLEL.  */
451
extern void emit_group_store (rtx, rtx, tree, int);
452

453
/* Copy BLKmode object from a set of registers.  */
454
extern rtx copy_blkmode_from_reg (rtx, rtx, tree);
455

456
/* Mark REG as holding a parameter for the next CALL_INSN.  */
457
extern void use_reg (rtx *, rtx);
458

459 460
/* Mark NREGS consecutive regs, starting at REGNO, as holding parameters
   for the next CALL_INSN.  */
461
extern void use_regs (rtx *, int, int);
462

463
/* Mark a PARALLEL as holding a parameter for the next CALL_INSN.  */
464
extern void use_group_regs (rtx *, rtx);
465 466

/* Write zeros through the storage of OBJECT.
467
   If OBJECT has BLKmode, SIZE is its length in bytes.  */
468
extern rtx clear_storage (rtx, rtx);
469

470 471 472
/* Determine whether the LEN bytes can be moved by using several move
   instructions.  Return nonzero if a call to move_by_pieces should
   succeed.  */
473
extern int can_move_by_pieces (unsigned HOST_WIDE_INT, unsigned int);
474

475
/* Return nonzero if it is desirable to store LEN bytes generated by
476 477 478 479
   CONSTFUN with several move instructions by store_by_pieces
   function.  CONSTFUNDATA is a pointer which will be passed as argument
   in every CONSTFUN call.
   ALIGN is maximum alignment we can assume.  */
480 481 482 483
extern int can_store_by_pieces (unsigned HOST_WIDE_INT,
				rtx (*) (void *, HOST_WIDE_INT,
					 enum machine_mode),
				void *, unsigned int);
484 485 486 487

/* Generate several move instructions to store LEN bytes generated by
   CONSTFUN to block TO.  (A MEM rtx with BLKmode).  CONSTFUNDATA is a
   pointer which will be passed as argument in every CONSTFUN call.
488 489
   ALIGN is maximum alignment we can assume.
   Returns TO + LEN.  */
490 491 492
extern rtx store_by_pieces (rtx, unsigned HOST_WIDE_INT,
			    rtx (*) (void *, HOST_WIDE_INT, enum machine_mode),
			    void *, unsigned int, int);
493

494
/* Emit insns to set X from Y.  */
495
extern rtx emit_move_insn (rtx, rtx);
496 497

/* Emit insns to set X from Y, with no frills.  */
498
extern rtx emit_move_insn_1 (rtx, rtx);
499 500 501

/* Push a block of length SIZE (perhaps variable)
   and return an rtx to address the beginning of the block.  */
502
extern rtx push_block (rtx, int, int);
503 504

/* Generate code to push something onto the stack, given its mode and type.  */
505 506
extern void emit_push_insn (rtx, enum machine_mode, tree, rtx, unsigned int,
			    int, rtx, int, rtx, rtx, int, rtx);
507

508
/* Expand an assignment that stores the value of FROM into TO.  */
509
extern rtx expand_assignment (tree, tree, int);
510 511 512 513 514

/* Generate code for computing expression EXP,
   and storing the value into TARGET.
   If SUGGEST_REG is nonzero, copy the value through a register
   and return that register, if that is possible.  */
515
extern rtx store_expr (tree, rtx, int);
Richard Kenner committed
516 517 518 519

/* Given an rtx that may include add and multiply operations,
   generate them as insns and return a pseudo-reg containing the value.
   Useful after calling expand_expr with 1 as sum_ok.  */
520
extern rtx force_operand (rtx, rtx);
Richard Kenner committed
521

522 523 524 525
/* Work horse for expand_expr.  */
extern rtx expand_expr_real (tree, rtx, enum machine_mode, 
			     enum expand_modifier, rtx *);

526 527 528
/* Generate code for computing expression EXP.
   An rtx for the computed value is returned.  The value is never null.
   In the case of a void EXP, const0_rtx is returned.  */
529 530 531 532 533 534
static inline rtx
expand_expr (tree exp, rtx target, enum machine_mode mode,
	     enum expand_modifier modifier)
{
  return expand_expr_real(exp, target, mode, modifier, NULL);
}
535

536 537
extern void expand_var (tree);

538 539
/* At the start of a function, record that we have no previously-pushed
   arguments waiting to be popped.  */
540
extern void init_pending_stack_adjust (void);
541 542 543

/* When exiting from function, if safe, clear out any pending stack adjust
   so the adjustment won't get done.  */
544
extern void clear_pending_stack_adjust (void);
545 546

/* Pop any previously-pushed arguments that have not been popped yet.  */
547
extern void do_pending_stack_adjust (void);
548

549 550
/* Return the tree node and offset if a given argument corresponds to
   a string constant.  */
551
extern tree string_constant (tree, tree *);
552

553
/* Generate code to evaluate EXP and jump to LABEL if the value is zero.  */
554
extern void jumpifnot (tree, rtx);
555 556

/* Generate code to evaluate EXP and jump to LABEL if the value is nonzero.  */
557
extern void jumpif (tree, rtx);
558 559 560

/* Generate code to evaluate EXP and jump to IF_FALSE_LABEL if
   the result is zero, or IF_TRUE_LABEL if the result is one.  */
561
extern void do_jump (tree, rtx, rtx);
562 563

/* Generate rtl to compare two rtx's, will call emit_cmp_insn.  */
564 565 566 567
extern rtx compare_from_rtx (rtx, rtx, enum rtx_code, int, enum machine_mode,
			     rtx);
extern void do_compare_rtx_and_jump (rtx, rtx, enum rtx_code, int,
				     enum machine_mode, rtx, rtx, rtx);
568

569
/* Two different ways of generating switch statements.  */
570 571
extern int try_casesi (tree, tree, tree, tree, rtx, rtx);
extern int try_tablejump (tree, tree, tree, tree, rtx, rtx);
572 573 574

/* Smallest number of adjacent cases before we use a jump table.
   XXX Should be a target hook.  */
575
extern unsigned int case_values_threshold (void);
576

577 578 579 580 581 582 583 584 585
/* Functions from alias.c */
#include "alias.h"
/* extern HOST_WIDE_INT get_varargs_alias_set (void); */
/* extern HOST_WIDE_INT get_frame_alias_set (void); */
/* extern void record_base_value (unsigned int, rtx, int); */
/* extern void record_alias_subset (HOST_WIDE_INT, HOST_WIDE_INT); */
/* extern HOST_WIDE_INT new_alias_set (void); */
/* extern int can_address_p (tree); */

586

587 588
/* rtl.h and tree.h were included.  */
/* Return an rtx for the size in bytes of the value of an expr.  */
589
extern rtx expr_size (tree);
590

591 592
/* Return a wide integer for the size in bytes of the value of EXP, or -1
   if the size can vary or is larger than an integer.  */
593
extern HOST_WIDE_INT int_expr_size (tree);
594

595 596
/* Convert a stack slot address ADDR valid in function FNDECL
   into an address valid in this function (using a static chain).  */
597
extern rtx fix_lexical_addr (rtx, tree);
598 599

/* Return the address of the trampoline for entering nested fn FUNCTION.  */
600
extern rtx trampoline_address (tree);
601 602 603

/* Return an rtx that refers to the value returned by a function
   in its original home.  This becomes invalid if any more code is emitted.  */
604
extern rtx hard_function_value (tree, tree, int);
605

606
extern rtx prepare_call_address (rtx, rtx, rtx *, int, int);
607

608
extern rtx expand_call (tree, rtx, int);
609

610 611
extern void fixup_tail_calls (void);

612
#ifdef TREE_CODE
613 614 615 616
extern rtx expand_shift (enum tree_code, enum machine_mode, rtx, tree, rtx,
			 int);
extern rtx expand_divmod (int, enum tree_code, enum machine_mode, rtx, rtx,
			  rtx, int);
617 618
#endif

619 620 621
extern void locate_and_pad_parm (enum machine_mode, tree, int, int, tree,
				 struct args_size *,
				 struct locate_and_pad_arg_data *);
622

623
/* Return the CODE_LABEL rtx for a LABEL_DECL, creating it if necessary.  */
624
extern rtx label_rtx (tree);
625 626 627 628

/* As label_rtx, but additionally the label is placed on the forced label
   list of its containing function (i.e. it is treated as reachable even
   if how is not obvious).  */
629
extern rtx force_label_rtx (tree);
630

631
/* Indicate how an input argument register was promoted.  */
632
extern rtx promoted_input_arg (unsigned int, enum machine_mode *, int *);
633

Richard Kenner committed
634 635 636
/* Return an rtx like arg but sans any constant terms.
   Returns the original rtx if it has no constant terms.
   The constant terms are added and stored via a second arg.  */
637
extern rtx eliminate_constant_term (rtx, rtx *);
Richard Kenner committed
638 639 640

/* Convert arg to a valid memory address for specified machine mode,
   by emitting insns to perform arithmetic if nec.  */
641
extern rtx memory_address (enum machine_mode, rtx);
Richard Kenner committed
642 643

/* Like `memory_address' but pretent `flag_force_addr' is 0.  */
644
extern rtx memory_address_noforce (enum machine_mode, rtx);
Richard Kenner committed
645 646 647 648

/* Return a memory reference like MEMREF, but with its mode changed
   to MODE and its address changed to ADDR.
   (VOIDmode means don't change the mode.
649
   NULL for ADDR means don't change the address.)  */
650
extern rtx change_address (rtx, enum machine_mode, rtx);
Richard Kenner committed
651

652 653
/* Return a memory reference like MEMREF, but with its mode changed
   to MODE and its address offset by OFFSET bytes.  */
654
#define adjust_address(MEMREF, MODE, OFFSET) \
Jakub Jelinek committed
655
  adjust_address_1 (MEMREF, MODE, OFFSET, 1, 1)
656

Richard Kenner committed
657
/* Likewise, but the reference is not required to be valid.  */
658
#define adjust_address_nv(MEMREF, MODE, OFFSET) \
Jakub Jelinek committed
659 660 661 662 663 664 665 666 667 668 669
  adjust_address_1 (MEMREF, MODE, OFFSET, 0, 1)

/* Return a memory reference like MEMREF, but with its mode changed
   to MODE and its address changed to ADDR, which is assumed to be
   increased by OFFSET bytes from MEMREF.  */
#define adjust_automodify_address(MEMREF, MODE, ADDR, OFFSET) \
  adjust_automodify_address_1 (MEMREF, MODE, ADDR, OFFSET, 1)

/* Likewise, but the reference is not required to be valid.  */
#define adjust_automodify_address_nv(MEMREF, MODE, ADDR, OFFSET) \
  adjust_automodify_address_1 (MEMREF, MODE, ADDR, OFFSET, 0)
670

671 672 673
extern rtx adjust_address_1 (rtx, enum machine_mode, HOST_WIDE_INT, int, int);
extern rtx adjust_automodify_address_1 (rtx, enum machine_mode, rtx,
					HOST_WIDE_INT, int);
Richard Kenner committed
674

675 676 677
/* Return a memory reference like MEMREF, but whose address is changed by
   adding OFFSET, an RTX, to it.  POW2 is the highest power of two factor
   known to be in OFFSET (possibly 1).  */
678
extern rtx offset_address (rtx, rtx, unsigned HOST_WIDE_INT);
679

680 681
/* Definitions from emit-rtl.c */
#include "emit-rtl.h"
Richard Kenner committed
682

683 684
/* Return a memory reference like MEMREF, but with its mode widened to
   MODE and adjusted by OFFSET.  */
685
extern rtx widen_memory_access (rtx, enum machine_mode, HOST_WIDE_INT);
686

Richard Kenner committed
687 688
/* Return a memory reference like MEMREF, but which is known to have a
   valid address.  */
689
extern rtx validize_mem (rtx);
Richard Kenner committed
690

691 692 693
/* Given REF, either a MEM or a REG, and T, either the type of X or
   the expression corresponding to REF, set RTX_UNCHANGING_P if
   appropriate.  */
694
extern void maybe_set_unchanging (rtx, tree);
695

696 697 698
/* Given REF, a MEM, and T, either the type of X or the expression
   corresponding to REF, set the memory attributes.  OBJECTP is nonzero
   if we are making a new object of this type.  */
699
extern void set_mem_attributes (rtx, tree, int);
700 701 702 703

/* Similar, except that BITPOS has not yet been applied to REF, so if
   we alter MEM_OFFSET according to T then we should subtract BITPOS
   expecting that it'll be added back in later.  */
704
extern void set_mem_attributes_minus_bitpos (rtx, tree, int, HOST_WIDE_INT);
705

Richard Kenner committed
706
/* Assemble the static constant template for function entry trampolines.  */
707
extern rtx assemble_trampoline_template (void);
Richard Kenner committed
708 709 710

/* Given rtx, return new rtx whose address won't be affected by
   any side effects.  It has been copied to a new temporary reg.  */
711
extern rtx stabilize (rtx);
Richard Kenner committed
712 713 714

/* Given an rtx, copy all regs it refers to into new temps
   and return a modified copy that refers to the new temps.  */
715
extern rtx copy_all_regs (rtx);
Richard Kenner committed
716 717

/* Copy given rtx to a new temp reg and return that.  */
718
extern rtx copy_to_reg (rtx);
Richard Kenner committed
719 720

/* Like copy_to_reg but always make the reg Pmode.  */
721
extern rtx copy_addr_to_reg (rtx);
Richard Kenner committed
722 723

/* Like copy_to_reg but always make the reg the specified mode MODE.  */
724
extern rtx copy_to_mode_reg (enum machine_mode, rtx);
Richard Kenner committed
725 726

/* Copy given rtx to given temp reg and return that.  */
727
extern rtx copy_to_suggested_reg (rtx, rtx, enum machine_mode);
Richard Kenner committed
728 729 730

/* Copy a value to a register if it isn't already a register.
   Args are mode (in case value is a constant) and the value.  */
731
extern rtx force_reg (enum machine_mode, rtx);
Richard Kenner committed
732 733

/* Return given rtx, copied into a new temp reg if it was in memory.  */
734
extern rtx force_not_mem (rtx);
Richard Kenner committed
735

736
/* Return mode and signedness to use when object is promoted.  */
737
extern enum machine_mode promote_mode (tree, enum machine_mode, int *, int);
738

Richard Kenner committed
739
/* Remove some bytes from the stack.  An rtx says how many.  */
740
extern void adjust_stack (rtx);
Richard Kenner committed
741 742

/* Add some bytes to the stack.  An rtx says how many.  */
743
extern void anti_adjust_stack (rtx);
Richard Kenner committed
744

745 746 747 748
/* This enum is used for the following two functions.  */
enum save_level {SAVE_BLOCK, SAVE_FUNCTION, SAVE_NONLOCAL};

/* Save the stack pointer at the specified level.  */
749
extern void emit_stack_save (enum save_level, rtx *, rtx);
750 751

/* Restore the stack pointer from a save area of the specified level.  */
752
extern void emit_stack_restore (enum save_level, rtx, rtx);
753

754 755 756
/* Invoke emit_stack_save for the nonlocal_goto_save_area.  */
extern void update_nonlocal_goto_save_area (void);

Richard Kenner committed
757 758
/* Allocate some space on the stack dynamically and return its address.  An rtx
   says how many bytes.  */
759
extern rtx allocate_dynamic_stack_space (rtx, rtx, int);
Richard Kenner committed
760

Kazu Hirata committed
761
/* Probe a range of stack addresses from FIRST to FIRST+SIZE, inclusive.
762 763 764 765
   FIRST is a constant and size is a Pmode RTX.  These are offsets from the
   current stack pointer.  STACK_GROWS_DOWNWARD says whether to add or
   subtract from the stack.  If SIZE is constant, this is done
   with a fixed number of probes.  Otherwise, we must make a loop.  */
766
extern void probe_stack_range (HOST_WIDE_INT, rtx);
767

Richard Kenner committed
768 769
/* Return an rtx that refers to the value returned by a library call
   in its original home.  This becomes invalid if any more code is emitted.  */
770
extern rtx hard_libcall_value (enum machine_mode);
Richard Kenner committed
771 772 773

/* Given an rtx, return an rtx for a value rounded up to a multiple
   of STACK_BOUNDARY / BITS_PER_UNIT.  */
774
extern rtx round_push (rtx);
Richard Kenner committed
775

776 777 778 779 780 781
/* Return the mode desired by operand N of a particular bitfield
   insert/extract insn, or MAX_MACHINE_MODE if no such insn is
   available.  */

enum extraction_pattern { EP_insv, EP_extv, EP_extzv };
extern enum machine_mode
782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797
mode_for_extraction (enum extraction_pattern, int);

extern rtx store_bit_field (rtx, unsigned HOST_WIDE_INT,
			    unsigned HOST_WIDE_INT, enum machine_mode, rtx,
			    HOST_WIDE_INT);
extern rtx extract_bit_field (rtx, unsigned HOST_WIDE_INT,
			      unsigned HOST_WIDE_INT, int, rtx,
			      enum machine_mode, enum machine_mode,
			      HOST_WIDE_INT);
extern rtx expand_mult (enum machine_mode, rtx, rtx, rtx, int);
extern bool const_mult_add_overflow_p (rtx, rtx, rtx, enum machine_mode, int);
extern rtx expand_mult_add (rtx, rtx, rtx, rtx,enum machine_mode, int);
extern rtx expand_mult_highpart_adjust (enum machine_mode, rtx, rtx, rtx, rtx, int);

extern rtx assemble_static_space (unsigned HOST_WIDE_INT);
extern int safe_from_p (rtx, tree, int);
798

799 800
/* Call this once to initialize the contents of the optabs
   appropriately for the current target machine.  */
801 802
extern void init_optabs (void);
extern void init_all_optabs (void);
803 804

/* Call this to initialize an optab function entry.  */
805
extern rtx init_one_libfunc (const char *);
806

807 808 809
extern void do_jump_by_parts_equality_rtx (rtx, rtx, rtx);
extern void do_jump_by_parts_greater_rtx (enum machine_mode, int, rtx, rtx,
					  rtx, rtx);
810

811
extern int vector_mode_valid_p (enum machine_mode);
812 813

#endif /* GCC_EXPR_H */