![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to expr.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [GCC 1.x] / gcc|
Return to expr.h CVS log | Up to [GCC 1.x] / gcc |
1.1 root 1: /* Definitions for code generation pass of GNU compiler.
2: Copyright (C) 1987 Free Software Foundation, Inc.
3:
4: This file is part of GNU CC.
5:
1.1.1.8 root 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 1, or (at your option)
9: any later version.
10:
1.1 root 11: GNU CC is distributed in the hope that it will be useful,
1.1.1.8 root 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. */
1.1 root 19:
20:
21: /* Macros to access the slots of a QUEUED rtx.
22: Here rather than in rtl.h because only the expansion pass
23: should ever encounter a QUEUED. */
24:
25: /* The variable for which an increment is queued. */
1.1.1.2 root 26: #define QUEUED_VAR(P) XEXP (P, 0)
1.1 root 27: /* If the increment has been emitted, this is the insn
28: that does the increment. It is zero before the increment is emitted. */
1.1.1.2 root 29: #define QUEUED_INSN(P) XEXP (P, 1)
1.1 root 30: /* If a pre-increment copy has been generated, this is the copy
31: (it is a temporary reg). Zero if no copy made yet. */
1.1.1.2 root 32: #define QUEUED_COPY(P) XEXP (P, 2)
1.1 root 33: /* This is the body to use for the insn to do the increment.
34: It is used to emit the increment. */
1.1.1.2 root 35: #define QUEUED_BODY(P) XEXP (P, 3)
1.1 root 36: /* Next QUEUED in the queue. */
1.1.1.2 root 37: #define QUEUED_NEXT(P) XEXP (P, 4)
38:
39: /* This is the 4th arg to `expand_expr'.
40: EXPAND_SUM means it is ok to return a PLUS rtx or MULT rtx.
41: EXPND_CONST_ADDRESS means it is ok to return a MEM whose address
42: is a constant that is not a legitimate address. */
43: enum expand_modifier {EXPAND_NORMAL, EXPAND_SUM, EXPAND_CONST_ADDRESS};
1.1 root 44:
45: /* If this is nonzero, we do not bother generating VOLATILE
46: around volatile memory references, and we are willing to
47: output indirect addresses. If cse is to follow, we reject
48: indirect addresses so a useful potential cse is generated;
49: if it is used only once, instruction combination will produce
50: the same indirect address eventually. */
51: extern int cse_not_expected;
52:
1.1.1.4 root 53: /* List (chain of EXPR_LISTs) of pseudo-regs of SAVE_EXPRs.
54: So we can mark them all live at the end of the function, if stupid. */
55: extern rtx save_expr_regs;
1.1.1.10! root 56:
! 57: extern int current_function_calls_alloca;
! 58:
! 59: /* Nonzero means stack pops must not be deferred, and deferred stack
! 60: pops must not be output. It is nonzero inside a function call,
! 61: inside a conditional expression, inside a statement expression,
! 62: and in other cases as well. */
! 63: extern int inhibit_defer_pop;
! 64:
! 65: #define NO_DEFER_POP (inhibit_defer_pop += 1)
! 66: #define OK_DEFER_POP (inhibit_defer_pop -= 1)
1.1.1.5 root 67:
1.1.1.2 root 68: #ifdef TREE_CODE /* Don't lose if tree.h not included. */
69: /* Structure to record the size of a sequence of arguments
70: as the sum of a tree-expression and a constant. */
71:
72: struct args_size
73: {
74: int constant;
75: tree var;
76: };
77: #endif
78:
79: /* Add the value of the tree INC to the `struct args_size' TO. */
80:
81: #define ADD_PARM_SIZE(TO, INC) \
82: { tree inc = (INC); \
83: if (TREE_CODE (inc) == INTEGER_CST) \
84: (TO).constant += TREE_INT_CST_LOW (inc); \
85: else if ((TO).var == 0) \
86: (TO).var = inc; \
87: else \
88: (TO).var = genop (PLUS_EXPR, (TO).var, inc); }
89:
1.1.1.5 root 90: #define SUB_PARM_SIZE(TO, DEC) \
91: { tree dec = (DEC); \
92: if (TREE_CODE (dec) == INTEGER_CST) \
93: (TO).constant -= TREE_INT_CST_LOW (dec); \
94: else if ((TO).var == 0) \
95: (TO).var = genop (MINUS_EXPR, integer_zero_node, dec); \
96: else \
97: (TO).var = genop (MINUS_EXPR, (TO).var, dec); }
98:
1.1.1.2 root 99: /* Convert the implicit sum in a `struct args_size' into an rtx. */
100: #define ARGS_SIZE_RTX(SIZE) \
101: ((SIZE).var == 0 ? gen_rtx (CONST_INT, VOIDmode, (SIZE).constant) \
102: : plus_constant (expand_expr ((SIZE).var, 0, VOIDmode, 0), \
103: (SIZE).constant))
1.1.1.5 root 104:
105: /* Supply a default definition for FUNCTION_ARG_PADDING:
106: usually pad upward, but pad short args downward on big-endian machines. */
107:
108: enum direction {none, upward, downward}; /* Value has this type. */
109:
110: #ifndef FUNCTION_ARG_PADDING
111: #ifdef BYTES_BIG_ENDIAN
112: #define FUNCTION_ARG_PADDING(mode, size) \
113: (((mode) == BLKmode \
114: ? (GET_CODE (size) == CONST_INT \
115: && INTVAL (size) < PARM_BOUNDARY / BITS_PER_UNIT) \
116: : GET_MODE_BITSIZE (mode) < PARM_BOUNDARY) \
117: ? downward : upward)
118: #else
119: #define FUNCTION_ARG_PADDING(mode, size) upward
120: #endif
121: #endif
1.1.1.9 root 122:
123: /* Nonzero if type TYPE should be returned in memory
124: (even though its mode is not BLKmode).
125: Most machines can use the following default definition. */
126:
127: #ifndef RETURN_IN_MEMORY
128: #define RETURN_IN_MEMORY(type) 0
129: #endif
1.1.1.2 root 130:
1.1 root 131: /* Optabs are tables saying how to generate insn bodies
132: for various machine modes and numbers of operands.
133: Each optab applies to one operation.
134: For example, add_optab applies to addition.
135:
136: The insn_code slot is the enum insn_code that says how to
137: generate an insn for this operation on a particular machine mode.
138: It is CODE_FOR_nothing if there is no such insn on the target machine.
139:
140: The `lib_call' slot is the name of the library function that
141: can be used to perform the operation.
142:
143: A few optabs, such as move_optab and cmp_optab, are used
144: by special code. */
145:
146: /* Everything that uses expr.h needs to define enum insn_code
147: but we don't list it in the Makefile dependencies just for that. */
148: #include "insn-codes.h"
149:
150: typedef struct optab
151: {
1.1.1.2 root 152: enum rtx_code code;
153: struct {
154: enum insn_code insn_code;
155: char *lib_call;
156: } handlers [NUM_MACHINE_MODES];
157: } * optab;
1.1 root 158:
159: /* Given an enum insn_code, access the function to construct
160: the body of that kind of insn. */
161: #define GEN_FCN(CODE) (*insn_gen_function[(int) (CODE)])
162: extern rtx (*insn_gen_function[]) ();
163:
164: extern optab add_optab;
165: extern optab sub_optab;
166: extern optab smul_optab; /* Signed multiply */
167: extern optab umul_optab; /* Unsigned multiply */
168: extern optab smul_widen_optab; /* Signed multiply with result
169: one machine mode wider than args */
170: extern optab umul_widen_optab;
171: extern optab sdiv_optab; /* Signed divide */
172: extern optab sdivmod_optab; /* Signed divide-and-remainder in one */
173: extern optab udiv_optab;
174: extern optab udivmod_optab;
175: extern optab smod_optab; /* Signed remainder */
176: extern optab umod_optab;
177: extern optab flodiv_optab; /* Optab for floating divide. */
1.1.1.2 root 178: extern optab ftrunc_optab; /* Convert float to integer in float fmt */
1.1 root 179: extern optab and_optab; /* Logical and */
180: extern optab andcb_optab; /* Logical and with complement of 2nd arg */
181: extern optab ior_optab; /* Logical or */
182: extern optab xor_optab; /* Logical xor */
183: extern optab ashl_optab; /* Arithmetic shift left */
184: extern optab ashr_optab; /* Arithmetic shift right */
185: extern optab lshl_optab; /* Logical shift left */
186: extern optab lshr_optab; /* Logical shift right */
187: extern optab rotl_optab; /* Rotate left */
188: extern optab rotr_optab; /* Rotate right */
189:
190: extern optab mov_optab; /* Move instruction. */
191: extern optab movstrict_optab; /* Move, preserving high part of register. */
192:
193: extern optab cmp_optab; /* Compare insn; two operands. */
194: extern optab tst_optab; /* tst insn; compare one operand against 0 */
195:
196: /* Unary operations */
197: extern optab neg_optab; /* Negation */
198: extern optab abs_optab; /* Abs value */
199: extern optab one_cmpl_optab; /* Bitwise not */
1.1.1.2 root 200: extern optab ffs_optab; /* Find first bit set */
1.1 root 201:
202: /* Passed to expand_binop and expand_unop to say which options to try to use
203: if the requested operation can't be open-coded on the requisite mode.
204: Either OPTAB_LIB or OPTAB_LIB_WIDEN says try using a library call.
1.1.1.10! root 205: Either OPTAB_WIDEN or OPTAB_LIB_WIDEN says try using a wider mode.
! 206: OPTAB_MUST_WIDEN says try widening and don't try anything else. */
1.1 root 207:
208: enum optab_methods
209: {
210: OPTAB_DIRECT,
211: OPTAB_LIB,
212: OPTAB_WIDEN,
213: OPTAB_LIB_WIDEN,
1.1.1.10! root 214: OPTAB_MUST_WIDEN,
1.1 root 215: };
216:
217: typedef rtx (*rtxfun) ();
218:
1.1.1.7 root 219: /* Indexed by the rtx-code for a conditional (eg. EQ, LT,...)
220: gives the gen_function to make a branch to test that condition. */
221:
222: extern rtxfun bcc_gen_fctn[NUM_RTX_CODE];
223:
224: /* Indexed by the rtx-code for a conditional (eg. EQ, LT,...)
225: gives the gen_function to make a store-condition insn
226: to test that condition. */
227:
228: extern rtxfun setcc_gen_fctn[NUM_RTX_CODE];
229:
1.1 root 230: /* Expand a binary operation given optab and rtx operands. */
231: rtx expand_binop ();
232:
1.1.1.8 root 233: /* Expand a binary operation with both signed and unsigned forms. */
234: rtx sign_expand_binop ();
235:
1.1 root 236: /* Expand a unary arithmetic operation given optab rtx operand. */
237: rtx expand_unop ();
238:
1.1.1.6 root 239: /* Arguments MODE, RTX: return an rtx for the negation of that value.
240: May emit insns. */
241: rtx negate_rtx ();
242:
1.1 root 243: /* Initialize the tables that control conversion between fixed and
244: floating values. */
245: void init_fixtab ();
246: void init_floattab ();
247:
248: /* Generate code for a FIX_EXPR. */
249: void expand_fix ();
250:
251: /* Generate code for a FLOAT_EXPR. */
252: void expand_float ();
253:
254: /* Create but don't emit one rtl instruction to add one rtx into another.
255: Modes must match.
256: Likewise for subtraction and for just copying.
257: These do not call protect_from_queue; caller must do so. */
258: rtx gen_add2_insn ();
259: rtx gen_sub2_insn ();
260: rtx gen_move_insn ();
261:
262: /* Emit one rtl instruction to store zero in specified rtx. */
263: void emit_clr_insn ();
264:
265: /* Emit one rtl insn to store 1 in specified rtx assuming it contains 0. */
266: void emit_0_to_1_insn ();
267:
268: /* Emit one rtl insn to compare two rtx's. */
269: void emit_cmp_insn ();
270:
271: /* Emit some rtl insns to move data between rtx's, converting machine modes.
272: Both modes must be floating or both fixed. */
273: void convert_move ();
274:
275: /* Convert an rtx to specified machine mode and return the result. */
276: rtx convert_to_mode ();
277:
278: /* Emit code to push some arguments and call a library routine,
279: storing the value in a specified place. Calling sequence is
280: complicated. */
281: void emit_library_call ();
282:
283: /* Given an rtx that may include add and multiply operations,
284: generate them as insns and return a pseudo-reg containing the value.
285: Useful after calling expand_expr with 1 as sum_ok. */
286: rtx force_operand ();
287:
288: /* Return an rtx for the size in bytes of the value of an expr. */
289: rtx expr_size ();
290:
291: /* Return an rtx for the sum of an rtx and an integer. */
292: rtx plus_constant ();
293:
294: rtx lookup_static_chain ();
295:
296: /* Return an rtx like arg but sans any constant terms.
297: Returns the original rtx if it has no constant terms.
298: The constant terms are added and stored via a second arg. */
299: rtx eliminate_constant_term ();
300:
301: /* Convert arg to a valid memory address for specified machine mode,
302: by emitting insns to perform arithmetic if nec. */
303: rtx memory_address ();
304:
1.1.1.3 root 305: /* Like `memory_address' but pretent `flag_force_addr' is 0. */
306: rtx memory_address_noforce ();
307:
1.1.1.2 root 308: /* Return a memory reference like MEMREF, but with its mode changed
309: to MODE and its address changed to ADDR.
310: (VOIDmode means don't change the mode.
311: NULL for ADDR means don't change the address.) */
312: rtx change_address ();
1.1 root 313:
314: /* Return 1 if two rtx's are equivalent in structure and elements. */
315: int rtx_equal_p ();
316:
317: /* Given rtx, return new rtx whose address won't be affected by
318: any side effects. It has been copied to a new temporary reg. */
319: rtx stabilize ();
320:
321: /* Given an rtx, copy all regs it refers to into new temps
322: and return a modified copy that refers to the new temps. */
323: rtx copy_all_regs ();
324:
325: /* Copy given rtx to a new temp reg and return that. */
326: rtx copy_to_reg ();
327:
1.1.1.2 root 328: /* Like copy_to_reg but always make the reg Pmode. */
329: rtx copy_addr_to_reg ();
330:
331: /* Like copy_to_reg but always make the reg the specified mode MODE. */
332: rtx copy_to_mode_reg ();
333:
1.1 root 334: /* Copy given rtx to given temp reg and return that. */
335: rtx copy_to_suggested_reg ();
336:
1.1.1.2 root 337: /* Copy a value to a register if it isn't already a register.
338: Args are mode (in case value is a constant) and the value. */
339: rtx force_reg ();
340:
1.1 root 341: /* Return given rtx, copied into a new temp reg if it was in memory. */
342: rtx force_not_mem ();
343:
344: /* Remove some bytes from the stack. An rtx says how many. */
345: void adjust_stack ();
346:
347: /* Add some bytes to the stack. An rtx says how many. */
348: void anti_adjust_stack ();
349:
350: /* Emit code to copy function value to a new temp reg and return that reg. */
351: rtx function_value ();
352:
353: /* Return an rtx that refers to the value returned by a function
354: in its original home. This becomes invalid if any more code is emitted. */
355: rtx hard_function_value ();
356:
1.1.1.2 root 357: /* Return an rtx that refers to the value returned by a library call
358: in its original home. This becomes invalid if any more code is emitted. */
359: rtx hard_libcall_value ();
360:
1.1 root 361: /* Emit code to copy function value to a specified place. */
362: void copy_function_value ();
363:
1.1.1.2 root 364: /* Given an rtx, return an rtx for a value rounded up to a multiple
365: of STACK_BOUNDARY / BITS_PER_UNIT. */
366: rtx round_push ();
367:
1.1 root 368: rtx store_bit_field ();
369: rtx extract_bit_field ();
370: rtx expand_shift ();
371: rtx expand_bit_and ();
372: rtx expand_mult ();
373: rtx expand_divmod ();
1.1.1.10! root 374: rtx expand_mult_add ();
1.1 root 375: rtx get_structure_value_addr ();
1.1.1.2 root 376: rtx expand_stmt_expr ();
377:
378: void jumpifnot ();
379: void jumpif ();
380: void do_jump ();
1.1.1.8 root 381:
382: rtx assemble_static_space ();
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.