]>
Commit | Line | Data |
---|---|---|
28d81abb | 1 | /* Expands front end tree to back end RTL for GNU C-Compiler |
4559fd9e RK |
2 | Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, |
3 | 1998, 1999, 2000 Free Software Foundation, Inc. | |
28d81abb RK |
4 | |
5 | This file is part of GNU CC. | |
6 | ||
7 | GNU CC is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2, or (at your option) | |
10 | any later version. | |
11 | ||
12 | GNU CC is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GNU CC; see the file COPYING. If not, write to | |
e9fa0c7c RK |
19 | the Free Software Foundation, 59 Temple Place - Suite 330, |
20 | Boston, MA 02111-1307, USA. */ | |
28d81abb RK |
21 | |
22 | ||
23 | /* This file handles the generation of rtl code from tree structure | |
24 | above the level of expressions, using subroutines in exp*.c and emit-rtl.c. | |
25 | It also creates the rtl expressions for parameters and auto variables | |
26 | and has full responsibility for allocating stack slots. | |
27 | ||
28 | The functions whose names start with `expand_' are called by the | |
29 | parser to generate RTL instructions for various kinds of constructs. | |
30 | ||
31 | Some control and binding constructs require calling several such | |
32 | functions at different times. For example, a simple if-then | |
33 | is expanded by calling `expand_start_cond' (with the condition-expression | |
34 | as argument) before parsing the then-clause and calling `expand_end_cond' | |
35 | after parsing the then-clause. */ | |
36 | ||
37 | #include "config.h" | |
670ee920 | 38 | #include "system.h" |
ccd043a9 | 39 | |
28d81abb RK |
40 | #include "rtl.h" |
41 | #include "tree.h" | |
6baf1cc8 | 42 | #include "tm_p.h" |
28d81abb | 43 | #include "flags.h" |
6adb4e3a | 44 | #include "except.h" |
28d81abb RK |
45 | #include "function.h" |
46 | #include "insn-flags.h" | |
47 | #include "insn-config.h" | |
48 | #include "insn-codes.h" | |
49 | #include "expr.h" | |
50 | #include "hard-reg-set.h" | |
51 | #include "obstack.h" | |
52 | #include "loop.h" | |
53 | #include "recog.h" | |
ca695ac9 | 54 | #include "machmode.h" |
10f0ad3d | 55 | #include "toplev.h" |
d6f4ec51 | 56 | #include "output.h" |
87ff9c8e | 57 | #include "ggc.h" |
ca695ac9 | 58 | |
28d81abb RK |
59 | #define obstack_chunk_alloc xmalloc |
60 | #define obstack_chunk_free free | |
61 | struct obstack stmt_obstack; | |
62 | ||
18543a22 ILT |
63 | /* Assume that case vectors are not pc-relative. */ |
64 | #ifndef CASE_VECTOR_PC_RELATIVE | |
65 | #define CASE_VECTOR_PC_RELATIVE 0 | |
66 | #endif | |
67 | ||
28d81abb RK |
68 | \f |
69 | /* Functions and data structures for expanding case statements. */ | |
70 | ||
71 | /* Case label structure, used to hold info on labels within case | |
72 | statements. We handle "range" labels; for a single-value label | |
73 | as in C, the high and low limits are the same. | |
74 | ||
5720c7e7 RK |
75 | An AVL tree of case nodes is initially created, and later transformed |
76 | to a list linked via the RIGHT fields in the nodes. Nodes with | |
77 | higher case values are later in the list. | |
28d81abb RK |
78 | |
79 | Switch statements can be output in one of two forms. A branch table | |
80 | is used if there are more than a few labels and the labels are dense | |
81 | within the range between the smallest and largest case value. If a | |
82 | branch table is used, no further manipulations are done with the case | |
83 | node chain. | |
84 | ||
85 | The alternative to the use of a branch table is to generate a series | |
86 | of compare and jump insns. When that is done, we use the LEFT, RIGHT, | |
87 | and PARENT fields to hold a binary tree. Initially the tree is | |
de14fd73 RK |
88 | totally unbalanced, with everything on the right. We balance the tree |
89 | with nodes on the left having lower case values than the parent | |
28d81abb RK |
90 | and nodes on the right having higher values. We then output the tree |
91 | in order. */ | |
92 | ||
93 | struct case_node | |
94 | { | |
95 | struct case_node *left; /* Left son in binary tree */ | |
96 | struct case_node *right; /* Right son in binary tree; also node chain */ | |
97 | struct case_node *parent; /* Parent of node in binary tree */ | |
98 | tree low; /* Lowest index value for this label */ | |
99 | tree high; /* Highest index value for this label */ | |
100 | tree code_label; /* Label to jump to when node matches */ | |
57641239 | 101 | int balance; |
28d81abb RK |
102 | }; |
103 | ||
104 | typedef struct case_node case_node; | |
105 | typedef struct case_node *case_node_ptr; | |
106 | ||
107 | /* These are used by estimate_case_costs and balance_case_nodes. */ | |
108 | ||
109 | /* This must be a signed type, and non-ANSI compilers lack signed char. */ | |
e7749837 | 110 | static short cost_table_[129]; |
28d81abb RK |
111 | static short *cost_table; |
112 | static int use_cost_table; | |
28d81abb RK |
113 | \f |
114 | /* Stack of control and binding constructs we are currently inside. | |
115 | ||
116 | These constructs begin when you call `expand_start_WHATEVER' | |
117 | and end when you call `expand_end_WHATEVER'. This stack records | |
118 | info about how the construct began that tells the end-function | |
119 | what to do. It also may provide information about the construct | |
120 | to alter the behavior of other constructs within the body. | |
121 | For example, they may affect the behavior of C `break' and `continue'. | |
122 | ||
123 | Each construct gets one `struct nesting' object. | |
124 | All of these objects are chained through the `all' field. | |
125 | `nesting_stack' points to the first object (innermost construct). | |
126 | The position of an entry on `nesting_stack' is in its `depth' field. | |
127 | ||
128 | Each type of construct has its own individual stack. | |
129 | For example, loops have `loop_stack'. Each object points to the | |
130 | next object of the same type through the `next' field. | |
131 | ||
132 | Some constructs are visible to `break' exit-statements and others | |
133 | are not. Which constructs are visible depends on the language. | |
134 | Therefore, the data structure allows each construct to be visible | |
135 | or not, according to the args given when the construct is started. | |
136 | The construct is visible if the `exit_label' field is non-null. | |
137 | In that case, the value should be a CODE_LABEL rtx. */ | |
138 | ||
139 | struct nesting | |
140 | { | |
141 | struct nesting *all; | |
142 | struct nesting *next; | |
143 | int depth; | |
144 | rtx exit_label; | |
145 | union | |
146 | { | |
147 | /* For conds (if-then and if-then-else statements). */ | |
148 | struct | |
149 | { | |
150 | /* Label for the end of the if construct. | |
151 | There is none if EXITFLAG was not set | |
152 | and no `else' has been seen yet. */ | |
153 | rtx endif_label; | |
154 | /* Label for the end of this alternative. | |
0f41302f | 155 | This may be the end of the if or the next else/elseif. */ |
28d81abb RK |
156 | rtx next_label; |
157 | } cond; | |
158 | /* For loops. */ | |
159 | struct | |
160 | { | |
161 | /* Label at the top of the loop; place to loop back to. */ | |
162 | rtx start_label; | |
163 | /* Label at the end of the whole construct. */ | |
164 | rtx end_label; | |
8afad312 JW |
165 | /* Label before a jump that branches to the end of the whole |
166 | construct. This is where destructors go if any. */ | |
167 | rtx alt_end_label; | |
28d81abb RK |
168 | /* Label for `continue' statement to jump to; |
169 | this is in front of the stepper of the loop. */ | |
170 | rtx continue_label; | |
171 | } loop; | |
172 | /* For variable binding contours. */ | |
173 | struct | |
174 | { | |
175 | /* Sequence number of this binding contour within the function, | |
176 | in order of entry. */ | |
177 | int block_start_count; | |
b93a436e | 178 | /* Nonzero => value to restore stack to on exit. */ |
28d81abb RK |
179 | rtx stack_level; |
180 | /* The NOTE that starts this contour. | |
181 | Used by expand_goto to check whether the destination | |
182 | is within each contour or not. */ | |
183 | rtx first_insn; | |
184 | /* Innermost containing binding contour that has a stack level. */ | |
185 | struct nesting *innermost_stack_block; | |
186 | /* List of cleanups to be run on exit from this contour. | |
187 | This is a list of expressions to be evaluated. | |
188 | The TREE_PURPOSE of each link is the ..._DECL node | |
189 | which the cleanup pertains to. */ | |
190 | tree cleanups; | |
191 | /* List of cleanup-lists of blocks containing this block, | |
192 | as they were at the locus where this block appears. | |
193 | There is an element for each containing block, | |
194 | ordered innermost containing block first. | |
e976b8b2 | 195 | The tail of this list can be 0, |
28d81abb RK |
196 | if all remaining elements would be empty lists. |
197 | The element's TREE_VALUE is the cleanup-list of that block, | |
198 | which may be null. */ | |
199 | tree outer_cleanups; | |
200 | /* Chain of labels defined inside this binding contour. | |
201 | For contours that have stack levels or cleanups. */ | |
202 | struct label_chain *label_chain; | |
203 | /* Number of function calls seen, as of start of this block. */ | |
3f1d071b | 204 | int n_function_calls; |
e976b8b2 MS |
205 | /* Nonzero if this is associated with a EH region. */ |
206 | int exception_region; | |
207 | /* The saved target_temp_slot_level from our outer block. | |
208 | We may reset target_temp_slot_level to be the level of | |
209 | this block, if that is done, target_temp_slot_level | |
210 | reverts to the saved target_temp_slot_level at the very | |
211 | end of the block. */ | |
3f1d071b | 212 | int block_target_temp_slot_level; |
e976b8b2 MS |
213 | /* True if we are currently emitting insns in an area of |
214 | output code that is controlled by a conditional | |
215 | expression. This is used by the cleanup handling code to | |
216 | generate conditional cleanup actions. */ | |
217 | int conditional_code; | |
218 | /* A place to move the start of the exception region for any | |
219 | of the conditional cleanups, must be at the end or after | |
220 | the start of the last unconditional cleanup, and before any | |
221 | conditional branch points. */ | |
222 | rtx last_unconditional_cleanup; | |
223 | /* When in a conditional context, this is the specific | |
224 | cleanup list associated with last_unconditional_cleanup, | |
225 | where we place the conditionalized cleanups. */ | |
226 | tree *cleanup_ptr; | |
28d81abb RK |
227 | } block; |
228 | /* For switch (C) or case (Pascal) statements, | |
229 | and also for dummies (see `expand_start_case_dummy'). */ | |
230 | struct | |
231 | { | |
232 | /* The insn after which the case dispatch should finally | |
233 | be emitted. Zero for a dummy. */ | |
234 | rtx start; | |
57641239 RK |
235 | /* A list of case labels; it is first built as an AVL tree. |
236 | During expand_end_case, this is converted to a list, and may be | |
237 | rearranged into a nearly balanced binary tree. */ | |
28d81abb RK |
238 | struct case_node *case_list; |
239 | /* Label to jump to if no case matches. */ | |
240 | tree default_label; | |
241 | /* The expression to be dispatched on. */ | |
242 | tree index_expr; | |
243 | /* Type that INDEX_EXPR should be converted to. */ | |
244 | tree nominal_type; | |
245 | /* Number of range exprs in case statement. */ | |
246 | int num_ranges; | |
247 | /* Name of this kind of statement, for warnings. */ | |
dff01034 | 248 | const char *printname; |
a11759a3 JR |
249 | /* Used to save no_line_numbers till we see the first case label. |
250 | We set this to -1 when we see the first case label in this | |
251 | case statement. */ | |
252 | int line_number_status; | |
28d81abb | 253 | } case_stmt; |
28d81abb RK |
254 | } data; |
255 | }; | |
256 | ||
28d81abb RK |
257 | /* Allocate and return a new `struct nesting'. */ |
258 | ||
259 | #define ALLOC_NESTING() \ | |
260 | (struct nesting *) obstack_alloc (&stmt_obstack, sizeof (struct nesting)) | |
261 | ||
6ed1d6c5 RS |
262 | /* Pop the nesting stack element by element until we pop off |
263 | the element which is at the top of STACK. | |
264 | Update all the other stacks, popping off elements from them | |
265 | as we pop them from nesting_stack. */ | |
28d81abb RK |
266 | |
267 | #define POPSTACK(STACK) \ | |
6ed1d6c5 RS |
268 | do { struct nesting *target = STACK; \ |
269 | struct nesting *this; \ | |
270 | do { this = nesting_stack; \ | |
271 | if (loop_stack == this) \ | |
272 | loop_stack = loop_stack->next; \ | |
273 | if (cond_stack == this) \ | |
274 | cond_stack = cond_stack->next; \ | |
275 | if (block_stack == this) \ | |
276 | block_stack = block_stack->next; \ | |
277 | if (stack_block_stack == this) \ | |
278 | stack_block_stack = stack_block_stack->next; \ | |
279 | if (case_stack == this) \ | |
280 | case_stack = case_stack->next; \ | |
6ed1d6c5 | 281 | nesting_depth = nesting_stack->depth - 1; \ |
28d81abb | 282 | nesting_stack = this->all; \ |
28d81abb | 283 | obstack_free (&stmt_obstack, this); } \ |
6ed1d6c5 | 284 | while (this != target); } while (0) |
28d81abb RK |
285 | \f |
286 | /* In some cases it is impossible to generate code for a forward goto | |
287 | until the label definition is seen. This happens when it may be necessary | |
288 | for the goto to reset the stack pointer: we don't yet know how to do that. | |
289 | So expand_goto puts an entry on this fixup list. | |
290 | Each time a binding contour that resets the stack is exited, | |
291 | we check each fixup. | |
292 | If the target label has now been defined, we can insert the proper code. */ | |
293 | ||
294 | struct goto_fixup | |
295 | { | |
296 | /* Points to following fixup. */ | |
297 | struct goto_fixup *next; | |
298 | /* Points to the insn before the jump insn. | |
299 | If more code must be inserted, it goes after this insn. */ | |
300 | rtx before_jump; | |
301 | /* The LABEL_DECL that this jump is jumping to, or 0 | |
302 | for break, continue or return. */ | |
303 | tree target; | |
7629c936 RS |
304 | /* The BLOCK for the place where this goto was found. */ |
305 | tree context; | |
28d81abb RK |
306 | /* The CODE_LABEL rtx that this is jumping to. */ |
307 | rtx target_rtl; | |
308 | /* Number of binding contours started in current function | |
309 | before the label reference. */ | |
310 | int block_start_count; | |
311 | /* The outermost stack level that should be restored for this jump. | |
312 | Each time a binding contour that resets the stack is exited, | |
313 | if the target label is *not* yet defined, this slot is updated. */ | |
314 | rtx stack_level; | |
315 | /* List of lists of cleanup expressions to be run by this goto. | |
316 | There is one element for each block that this goto is within. | |
e976b8b2 | 317 | The tail of this list can be 0, |
28d81abb RK |
318 | if all remaining elements would be empty. |
319 | The TREE_VALUE contains the cleanup list of that block as of the | |
320 | time this goto was seen. | |
321 | The TREE_ADDRESSABLE flag is 1 for a block that has been exited. */ | |
322 | tree cleanup_list_list; | |
323 | }; | |
324 | ||
28d81abb RK |
325 | /* Within any binding contour that must restore a stack level, |
326 | all labels are recorded with a chain of these structures. */ | |
327 | ||
328 | struct label_chain | |
329 | { | |
330 | /* Points to following fixup. */ | |
331 | struct label_chain *next; | |
332 | tree label; | |
333 | }; | |
e9a25f70 | 334 | |
3f1d071b BS |
335 | struct stmt_status |
336 | { | |
337 | /* Chain of all pending binding contours. */ | |
338 | struct nesting *x_block_stack; | |
339 | ||
340 | /* If any new stacks are added here, add them to POPSTACKS too. */ | |
341 | ||
342 | /* Chain of all pending binding contours that restore stack levels | |
343 | or have cleanups. */ | |
344 | struct nesting *x_stack_block_stack; | |
345 | ||
346 | /* Chain of all pending conditional statements. */ | |
347 | struct nesting *x_cond_stack; | |
348 | ||
349 | /* Chain of all pending loops. */ | |
350 | struct nesting *x_loop_stack; | |
351 | ||
352 | /* Chain of all pending case or switch statements. */ | |
353 | struct nesting *x_case_stack; | |
354 | ||
355 | /* Separate chain including all of the above, | |
356 | chained through the `all' field. */ | |
357 | struct nesting *x_nesting_stack; | |
358 | ||
359 | /* Number of entries on nesting_stack now. */ | |
360 | int x_nesting_depth; | |
361 | ||
362 | /* Number of binding contours started so far in this function. */ | |
363 | int x_block_start_count; | |
364 | ||
365 | /* Each time we expand an expression-statement, | |
366 | record the expr's type and its RTL value here. */ | |
367 | tree x_last_expr_type; | |
368 | rtx x_last_expr_value; | |
369 | ||
370 | /* Nonzero if within a ({...}) grouping, in which case we must | |
371 | always compute a value for each expr-stmt in case it is the last one. */ | |
372 | int x_expr_stmts_for_value; | |
373 | ||
374 | /* Filename and line number of last line-number note, | |
375 | whether we actually emitted it or not. */ | |
47ee9bcb | 376 | const char *x_emit_filename; |
3f1d071b BS |
377 | int x_emit_lineno; |
378 | ||
379 | struct goto_fixup *x_goto_fixup_chain; | |
380 | }; | |
381 | ||
01d939e8 BS |
382 | #define block_stack (cfun->stmt->x_block_stack) |
383 | #define stack_block_stack (cfun->stmt->x_stack_block_stack) | |
384 | #define cond_stack (cfun->stmt->x_cond_stack) | |
385 | #define loop_stack (cfun->stmt->x_loop_stack) | |
386 | #define case_stack (cfun->stmt->x_case_stack) | |
387 | #define nesting_stack (cfun->stmt->x_nesting_stack) | |
388 | #define nesting_depth (cfun->stmt->x_nesting_depth) | |
389 | #define current_block_start_count (cfun->stmt->x_block_start_count) | |
390 | #define last_expr_type (cfun->stmt->x_last_expr_type) | |
391 | #define last_expr_value (cfun->stmt->x_last_expr_value) | |
392 | #define expr_stmts_for_value (cfun->stmt->x_expr_stmts_for_value) | |
393 | #define emit_filename (cfun->stmt->x_emit_filename) | |
394 | #define emit_lineno (cfun->stmt->x_emit_lineno) | |
395 | #define goto_fixup_chain (cfun->stmt->x_goto_fixup_chain) | |
e9a25f70 JL |
396 | |
397 | /* Non-zero if we are using EH to handle cleanus. */ | |
398 | static int using_eh_for_cleanups_p = 0; | |
399 | ||
21a427cc AS |
400 | /* Character strings, each containing a single decimal digit. */ |
401 | static char *digit_strings[10]; | |
402 | ||
e9a25f70 | 403 | |
cdadb1dd KG |
404 | static int n_occurrences PARAMS ((int, const char *)); |
405 | static void expand_goto_internal PARAMS ((tree, rtx, rtx)); | |
406 | static int expand_fixup PARAMS ((tree, rtx, rtx)); | |
407 | static rtx expand_nl_handler_label PARAMS ((rtx, rtx)); | |
408 | static void expand_nl_goto_receiver PARAMS ((void)); | |
409 | static void expand_nl_goto_receivers PARAMS ((struct nesting *)); | |
410 | static void fixup_gotos PARAMS ((struct nesting *, rtx, tree, | |
cfc3d13f | 411 | rtx, int)); |
cdadb1dd KG |
412 | static void expand_null_return_1 PARAMS ((rtx, int)); |
413 | static void expand_value_return PARAMS ((rtx)); | |
414 | static int tail_recursion_args PARAMS ((tree, tree)); | |
415 | static void expand_cleanups PARAMS ((tree, tree, int, int)); | |
416 | static void check_seenlabel PARAMS ((void)); | |
417 | static void do_jump_if_equal PARAMS ((rtx, rtx, rtx, int)); | |
418 | static int estimate_case_costs PARAMS ((case_node_ptr)); | |
419 | static void group_case_nodes PARAMS ((case_node_ptr)); | |
420 | static void balance_case_nodes PARAMS ((case_node_ptr *, | |
cfc3d13f | 421 | case_node_ptr)); |
cdadb1dd KG |
422 | static int node_has_low_bound PARAMS ((case_node_ptr, tree)); |
423 | static int node_has_high_bound PARAMS ((case_node_ptr, tree)); | |
424 | static int node_is_bounded PARAMS ((case_node_ptr, tree)); | |
425 | static void emit_jump_if_reachable PARAMS ((rtx)); | |
426 | static void emit_case_nodes PARAMS ((rtx, case_node_ptr, rtx, tree)); | |
427 | static int add_case_node PARAMS ((tree, tree, tree, tree *)); | |
428 | static struct case_node *case_tree2list PARAMS ((case_node *, case_node *)); | |
429 | static void mark_cond_nesting PARAMS ((struct nesting *)); | |
430 | static void mark_loop_nesting PARAMS ((struct nesting *)); | |
431 | static void mark_block_nesting PARAMS ((struct nesting *)); | |
432 | static void mark_case_nesting PARAMS ((struct nesting *)); | |
433 | static void mark_goto_fixup PARAMS ((struct goto_fixup *)); | |
87ff9c8e | 434 | |
28d81abb | 435 | \f |
e9a25f70 JL |
436 | void |
437 | using_eh_for_cleanups () | |
438 | { | |
439 | using_eh_for_cleanups_p = 1; | |
440 | } | |
441 | ||
87ff9c8e RH |
442 | /* Mark N (known to be a cond-nesting) for GC. */ |
443 | ||
444 | static void | |
445 | mark_cond_nesting (n) | |
446 | struct nesting *n; | |
447 | { | |
448 | while (n) | |
449 | { | |
450 | ggc_mark_rtx (n->exit_label); | |
451 | ggc_mark_rtx (n->data.cond.endif_label); | |
452 | ggc_mark_rtx (n->data.cond.next_label); | |
453 | ||
454 | n = n->next; | |
455 | } | |
456 | } | |
457 | ||
458 | /* Mark N (known to be a loop-nesting) for GC. */ | |
459 | ||
460 | static void | |
461 | mark_loop_nesting (n) | |
462 | struct nesting *n; | |
463 | { | |
464 | ||
465 | while (n) | |
466 | { | |
467 | ggc_mark_rtx (n->exit_label); | |
468 | ggc_mark_rtx (n->data.loop.start_label); | |
469 | ggc_mark_rtx (n->data.loop.end_label); | |
470 | ggc_mark_rtx (n->data.loop.alt_end_label); | |
471 | ggc_mark_rtx (n->data.loop.continue_label); | |
472 | ||
473 | n = n->next; | |
474 | } | |
475 | } | |
476 | ||
477 | /* Mark N (known to be a block-nesting) for GC. */ | |
478 | ||
479 | static void | |
480 | mark_block_nesting (n) | |
481 | struct nesting *n; | |
482 | { | |
483 | while (n) | |
484 | { | |
485 | struct label_chain *l; | |
486 | ||
487 | ggc_mark_rtx (n->exit_label); | |
488 | ggc_mark_rtx (n->data.block.stack_level); | |
489 | ggc_mark_rtx (n->data.block.first_insn); | |
490 | ggc_mark_tree (n->data.block.cleanups); | |
491 | ggc_mark_tree (n->data.block.outer_cleanups); | |
492 | ||
493 | for (l = n->data.block.label_chain; l != NULL; l = l->next) | |
494 | ggc_mark_tree (l->label); | |
495 | ||
496 | ggc_mark_rtx (n->data.block.last_unconditional_cleanup); | |
497 | ||
498 | /* ??? cleanup_ptr never points outside the stack, does it? */ | |
499 | ||
500 | n = n->next; | |
501 | } | |
502 | } | |
503 | ||
504 | /* Mark N (known to be a case-nesting) for GC. */ | |
505 | ||
506 | static void | |
507 | mark_case_nesting (n) | |
508 | struct nesting *n; | |
509 | { | |
510 | while (n) | |
511 | { | |
512 | struct case_node *node; | |
513 | ||
514 | ggc_mark_rtx (n->exit_label); | |
515 | ggc_mark_rtx (n->data.case_stmt.start); | |
516 | ||
517 | node = n->data.case_stmt.case_list; | |
518 | while (node) | |
519 | { | |
520 | ggc_mark_tree (node->low); | |
521 | ggc_mark_tree (node->high); | |
522 | ggc_mark_tree (node->code_label); | |
523 | node = node->right; | |
524 | } | |
525 | ||
526 | ggc_mark_tree (n->data.case_stmt.default_label); | |
527 | ggc_mark_tree (n->data.case_stmt.index_expr); | |
528 | ggc_mark_tree (n->data.case_stmt.nominal_type); | |
529 | ||
530 | n = n->next; | |
531 | } | |
532 | } | |
533 | ||
534 | /* Mark G for GC. */ | |
535 | ||
536 | static void | |
537 | mark_goto_fixup (g) | |
538 | struct goto_fixup *g; | |
539 | { | |
540 | while (g) | |
541 | { | |
542 | ggc_mark_rtx (g->before_jump); | |
543 | ggc_mark_tree (g->target); | |
544 | ggc_mark_tree (g->context); | |
545 | ggc_mark_rtx (g->target_rtl); | |
546 | ggc_mark_rtx (g->stack_level); | |
547 | ggc_mark_tree (g->cleanup_list_list); | |
548 | ||
549 | g = g->next; | |
550 | } | |
551 | } | |
552 | ||
21cd906e MM |
553 | /* Clear out all parts of the state in F that can safely be discarded |
554 | after the function has been compiled, to let garbage collection | |
0a8a198c | 555 | reclaim the memory. */ |
21cd906e MM |
556 | |
557 | void | |
0a8a198c | 558 | free_stmt_status (f) |
21cd906e | 559 | struct function *f; |
21cd906e MM |
560 | { |
561 | /* We're about to free the function obstack. If we hold pointers to | |
562 | things allocated there, then we'll try to mark them when we do | |
563 | GC. So, we clear them out here explicitly. */ | |
5faf03ae MM |
564 | if (f->stmt) |
565 | free (f->stmt); | |
fa51b01b | 566 | f->stmt = NULL; |
21cd906e MM |
567 | } |
568 | ||
87ff9c8e RH |
569 | /* Mark P for GC. */ |
570 | ||
571 | void | |
fa51b01b | 572 | mark_stmt_status (p) |
87ff9c8e RH |
573 | struct stmt_status *p; |
574 | { | |
575 | if (p == 0) | |
576 | return; | |
577 | ||
578 | mark_block_nesting (p->x_block_stack); | |
579 | mark_cond_nesting (p->x_cond_stack); | |
580 | mark_loop_nesting (p->x_loop_stack); | |
581 | mark_case_nesting (p->x_case_stack); | |
582 | ||
583 | ggc_mark_tree (p->x_last_expr_type); | |
584 | /* last_epxr_value is only valid if last_expr_type is nonzero. */ | |
585 | if (p->x_last_expr_type) | |
586 | ggc_mark_rtx (p->x_last_expr_value); | |
587 | ||
588 | mark_goto_fixup (p->x_goto_fixup_chain); | |
589 | } | |
590 | ||
28d81abb RK |
591 | void |
592 | init_stmt () | |
593 | { | |
21a427cc AS |
594 | int i; |
595 | ||
28d81abb | 596 | gcc_obstack_init (&stmt_obstack); |
21a427cc AS |
597 | |
598 | for (i = 0; i < 10; i++) | |
599 | { | |
600 | digit_strings[i] = ggc_alloc_string (NULL, 1); | |
601 | digit_strings[i][0] = '0' + i; | |
602 | } | |
603 | ggc_add_string_root (digit_strings, 10); | |
28d81abb RK |
604 | } |
605 | ||
606 | void | |
607 | init_stmt_for_function () | |
608 | { | |
01d939e8 | 609 | cfun->stmt = (struct stmt_status *) xmalloc (sizeof (struct stmt_status)); |
3f1d071b | 610 | |
28d81abb RK |
611 | /* We are not currently within any block, conditional, loop or case. */ |
612 | block_stack = 0; | |
0b931590 | 613 | stack_block_stack = 0; |
28d81abb RK |
614 | loop_stack = 0; |
615 | case_stack = 0; | |
616 | cond_stack = 0; | |
617 | nesting_stack = 0; | |
618 | nesting_depth = 0; | |
619 | ||
3f1d071b | 620 | current_block_start_count = 0; |
28d81abb RK |
621 | |
622 | /* No gotos have been expanded yet. */ | |
623 | goto_fixup_chain = 0; | |
624 | ||
625 | /* We are not processing a ({...}) grouping. */ | |
626 | expr_stmts_for_value = 0; | |
627 | last_expr_type = 0; | |
21cd906e | 628 | last_expr_value = NULL_RTX; |
28d81abb | 629 | } |
3f1d071b BS |
630 | \f |
631 | /* Return nonzero if anything is pushed on the loop, condition, or case | |
632 | stack. */ | |
633 | int | |
634 | in_control_zone_p () | |
635 | { | |
636 | return cond_stack || loop_stack || case_stack; | |
28d81abb RK |
637 | } |
638 | ||
3f1d071b | 639 | /* Record the current file and line. Called from emit_line_note. */ |
28d81abb | 640 | void |
3f1d071b | 641 | set_file_and_line_for_stmt (file, line) |
47ee9bcb | 642 | const char *file; |
3f1d071b BS |
643 | int line; |
644 | { | |
61d84605 MM |
645 | /* If we're outputting an inline function, and we add a line note, |
646 | there may be no CFUN->STMT information. So, there's no need to | |
647 | update it. */ | |
648 | if (cfun->stmt) | |
649 | { | |
650 | emit_filename = file; | |
651 | emit_lineno = line; | |
652 | } | |
28d81abb | 653 | } |
3f1d071b | 654 | |
28d81abb RK |
655 | /* Emit a no-op instruction. */ |
656 | ||
657 | void | |
658 | emit_nop () | |
659 | { | |
ca695ac9 JB |
660 | rtx last_insn; |
661 | ||
b93a436e JL |
662 | last_insn = get_last_insn (); |
663 | if (!optimize | |
664 | && (GET_CODE (last_insn) == CODE_LABEL | |
665 | || (GET_CODE (last_insn) == NOTE | |
666 | && prev_real_insn (last_insn) == 0))) | |
667 | emit_insn (gen_nop ()); | |
28d81abb RK |
668 | } |
669 | \f | |
670 | /* Return the rtx-label that corresponds to a LABEL_DECL, | |
671 | creating it if necessary. */ | |
672 | ||
673 | rtx | |
674 | label_rtx (label) | |
675 | tree label; | |
676 | { | |
677 | if (TREE_CODE (label) != LABEL_DECL) | |
678 | abort (); | |
679 | ||
680 | if (DECL_RTL (label)) | |
681 | return DECL_RTL (label); | |
682 | ||
683 | return DECL_RTL (label) = gen_label_rtx (); | |
684 | } | |
685 | ||
686 | /* Add an unconditional jump to LABEL as the next sequential instruction. */ | |
687 | ||
688 | void | |
689 | emit_jump (label) | |
690 | rtx label; | |
691 | { | |
692 | do_pending_stack_adjust (); | |
693 | emit_jump_insn (gen_jump (label)); | |
694 | emit_barrier (); | |
695 | } | |
696 | ||
697 | /* Emit code to jump to the address | |
698 | specified by the pointer expression EXP. */ | |
699 | ||
700 | void | |
701 | expand_computed_goto (exp) | |
702 | tree exp; | |
703 | { | |
b93a436e | 704 | rtx x = expand_expr (exp, NULL_RTX, VOIDmode, 0); |
ed9a9db1 RK |
705 | |
706 | #ifdef POINTERS_EXTEND_UNSIGNED | |
b93a436e | 707 | x = convert_memory_address (Pmode, x); |
ed9a9db1 | 708 | #endif |
ffa1a1ce | 709 | |
b93a436e JL |
710 | emit_queue (); |
711 | /* Be sure the function is executable. */ | |
7d384cc0 | 712 | if (current_function_check_memory_usage) |
b93a436e JL |
713 | emit_library_call (chkr_check_exec_libfunc, 1, |
714 | VOIDmode, 1, x, ptr_mode); | |
17f5f329 | 715 | |
b93a436e JL |
716 | do_pending_stack_adjust (); |
717 | emit_indirect_jump (x); | |
acd693d1 RH |
718 | |
719 | current_function_has_computed_jump = 1; | |
28d81abb RK |
720 | } |
721 | \f | |
722 | /* Handle goto statements and the labels that they can go to. */ | |
723 | ||
724 | /* Specify the location in the RTL code of a label LABEL, | |
725 | which is a LABEL_DECL tree node. | |
726 | ||
727 | This is used for the kind of label that the user can jump to with a | |
728 | goto statement, and for alternatives of a switch or case statement. | |
729 | RTL labels generated for loops and conditionals don't go through here; | |
730 | they are generated directly at the RTL level, by other functions below. | |
731 | ||
732 | Note that this has nothing to do with defining label *names*. | |
733 | Languages vary in how they do that and what that even means. */ | |
734 | ||
735 | void | |
736 | expand_label (label) | |
737 | tree label; | |
738 | { | |
739 | struct label_chain *p; | |
740 | ||
741 | do_pending_stack_adjust (); | |
742 | emit_label (label_rtx (label)); | |
743 | if (DECL_NAME (label)) | |
744 | LABEL_NAME (DECL_RTL (label)) = IDENTIFIER_POINTER (DECL_NAME (label)); | |
745 | ||
746 | if (stack_block_stack != 0) | |
747 | { | |
748 | p = (struct label_chain *) oballoc (sizeof (struct label_chain)); | |
749 | p->next = stack_block_stack->data.block.label_chain; | |
750 | stack_block_stack->data.block.label_chain = p; | |
751 | p->label = label; | |
752 | } | |
753 | } | |
754 | ||
755 | /* Declare that LABEL (a LABEL_DECL) may be used for nonlocal gotos | |
756 | from nested functions. */ | |
757 | ||
758 | void | |
759 | declare_nonlocal_label (label) | |
760 | tree label; | |
761 | { | |
ba716ac9 BS |
762 | rtx slot = assign_stack_local (Pmode, GET_MODE_SIZE (Pmode), 0); |
763 | ||
28d81abb RK |
764 | nonlocal_labels = tree_cons (NULL_TREE, label, nonlocal_labels); |
765 | LABEL_PRESERVE_P (label_rtx (label)) = 1; | |
ba716ac9 | 766 | if (nonlocal_goto_handler_slots == 0) |
28d81abb | 767 | { |
59257ff7 RK |
768 | emit_stack_save (SAVE_NONLOCAL, |
769 | &nonlocal_goto_stack_level, | |
770 | PREV_INSN (tail_recursion_reentry)); | |
28d81abb | 771 | } |
ba716ac9 BS |
772 | nonlocal_goto_handler_slots |
773 | = gen_rtx_EXPR_LIST (VOIDmode, slot, nonlocal_goto_handler_slots); | |
28d81abb RK |
774 | } |
775 | ||
776 | /* Generate RTL code for a `goto' statement with target label LABEL. | |
777 | LABEL should be a LABEL_DECL tree node that was or will later be | |
778 | defined with `expand_label'. */ | |
779 | ||
780 | void | |
781 | expand_goto (label) | |
782 | tree label; | |
783 | { | |
ca695ac9 JB |
784 | tree context; |
785 | ||
28d81abb | 786 | /* Check for a nonlocal goto to a containing function. */ |
ca695ac9 | 787 | context = decl_function_context (label); |
28d81abb RK |
788 | if (context != 0 && context != current_function_decl) |
789 | { | |
790 | struct function *p = find_function_data (context); | |
38a448ca | 791 | rtx label_ref = gen_rtx_LABEL_REF (Pmode, label_rtx (label)); |
ba716ac9 BS |
792 | rtx temp, handler_slot; |
793 | tree link; | |
794 | ||
795 | /* Find the corresponding handler slot for this label. */ | |
49ad7cfa BS |
796 | handler_slot = p->x_nonlocal_goto_handler_slots; |
797 | for (link = p->x_nonlocal_labels; TREE_VALUE (link) != label; | |
ba716ac9 BS |
798 | link = TREE_CHAIN (link)) |
799 | handler_slot = XEXP (handler_slot, 1); | |
800 | handler_slot = XEXP (handler_slot, 0); | |
dd132134 | 801 | |
28d81abb | 802 | p->has_nonlocal_label = 1; |
c1255328 | 803 | current_function_has_nonlocal_goto = 1; |
dd132134 | 804 | LABEL_REF_NONLOCAL_P (label_ref) = 1; |
59257ff7 RK |
805 | |
806 | /* Copy the rtl for the slots so that they won't be shared in | |
807 | case the virtual stack vars register gets instantiated differently | |
808 | in the parent than in the child. */ | |
809 | ||
28d81abb RK |
810 | #if HAVE_nonlocal_goto |
811 | if (HAVE_nonlocal_goto) | |
812 | emit_insn (gen_nonlocal_goto (lookup_static_chain (label), | |
ba716ac9 | 813 | copy_rtx (handler_slot), |
49ad7cfa | 814 | copy_rtx (p->x_nonlocal_goto_stack_level), |
dd132134 | 815 | label_ref)); |
28d81abb RK |
816 | else |
817 | #endif | |
818 | { | |
59257ff7 RK |
819 | rtx addr; |
820 | ||
28d81abb RK |
821 | /* Restore frame pointer for containing function. |
822 | This sets the actual hard register used for the frame pointer | |
823 | to the location of the function's incoming static chain info. | |
824 | The non-local goto handler will then adjust it to contain the | |
825 | proper value and reload the argument pointer, if needed. */ | |
a35ad168 | 826 | emit_move_insn (hard_frame_pointer_rtx, lookup_static_chain (label)); |
59257ff7 RK |
827 | |
828 | /* We have now loaded the frame pointer hardware register with | |
829 | the address of that corresponds to the start of the virtual | |
830 | stack vars. So replace virtual_stack_vars_rtx in all | |
831 | addresses we use with stack_pointer_rtx. */ | |
832 | ||
28d81abb RK |
833 | /* Get addr of containing function's current nonlocal goto handler, |
834 | which will do any cleanups and then jump to the label. */ | |
ba716ac9 | 835 | addr = copy_rtx (handler_slot); |
59257ff7 | 836 | temp = copy_to_reg (replace_rtx (addr, virtual_stack_vars_rtx, |
a35ad168 | 837 | hard_frame_pointer_rtx)); |
59257ff7 | 838 | |
28d81abb | 839 | /* Restore the stack pointer. Note this uses fp just restored. */ |
49ad7cfa | 840 | addr = p->x_nonlocal_goto_stack_level; |
59257ff7 | 841 | if (addr) |
5e116627 | 842 | addr = replace_rtx (copy_rtx (addr), |
a35ad168 DE |
843 | virtual_stack_vars_rtx, |
844 | hard_frame_pointer_rtx); | |
59257ff7 | 845 | |
37366632 | 846 | emit_stack_restore (SAVE_NONLOCAL, addr, NULL_RTX); |
59257ff7 | 847 | |
a35ad168 | 848 | /* USE of hard_frame_pointer_rtx added for consistency; not clear if |
28d81abb | 849 | really needed. */ |
38a448ca RH |
850 | emit_insn (gen_rtx_USE (VOIDmode, hard_frame_pointer_rtx)); |
851 | emit_insn (gen_rtx_USE (VOIDmode, stack_pointer_rtx)); | |
28d81abb RK |
852 | emit_indirect_jump (temp); |
853 | } | |
854 | } | |
855 | else | |
37366632 | 856 | expand_goto_internal (label, label_rtx (label), NULL_RTX); |
28d81abb RK |
857 | } |
858 | ||
859 | /* Generate RTL code for a `goto' statement with target label BODY. | |
860 | LABEL should be a LABEL_REF. | |
861 | LAST_INSN, if non-0, is the rtx we should consider as the last | |
862 | insn emitted (for the purposes of cleaning up a return). */ | |
863 | ||
864 | static void | |
865 | expand_goto_internal (body, label, last_insn) | |
866 | tree body; | |
867 | rtx label; | |
868 | rtx last_insn; | |
869 | { | |
870 | struct nesting *block; | |
871 | rtx stack_level = 0; | |
872 | ||
873 | if (GET_CODE (label) != CODE_LABEL) | |
874 | abort (); | |
875 | ||
876 | /* If label has already been defined, we can tell now | |
877 | whether and how we must alter the stack level. */ | |
878 | ||
879 | if (PREV_INSN (label) != 0) | |
880 | { | |
881 | /* Find the innermost pending block that contains the label. | |
882 | (Check containment by comparing insn-uids.) | |
883 | Then restore the outermost stack level within that block, | |
884 | and do cleanups of all blocks contained in it. */ | |
885 | for (block = block_stack; block; block = block->next) | |
886 | { | |
887 | if (INSN_UID (block->data.block.first_insn) < INSN_UID (label)) | |
888 | break; | |
889 | if (block->data.block.stack_level != 0) | |
890 | stack_level = block->data.block.stack_level; | |
891 | /* Execute the cleanups for blocks we are exiting. */ | |
892 | if (block->data.block.cleanups != 0) | |
893 | { | |
50d1b7a1 | 894 | expand_cleanups (block->data.block.cleanups, NULL_TREE, 1, 1); |
28d81abb RK |
895 | do_pending_stack_adjust (); |
896 | } | |
897 | } | |
898 | ||
899 | if (stack_level) | |
900 | { | |
0f41302f MS |
901 | /* Ensure stack adjust isn't done by emit_jump, as this |
902 | would clobber the stack pointer. This one should be | |
903 | deleted as dead by flow. */ | |
28d81abb RK |
904 | clear_pending_stack_adjust (); |
905 | do_pending_stack_adjust (); | |
37366632 | 906 | emit_stack_restore (SAVE_BLOCK, stack_level, NULL_RTX); |
28d81abb RK |
907 | } |
908 | ||
909 | if (body != 0 && DECL_TOO_LATE (body)) | |
910 | error ("jump to `%s' invalidly jumps into binding contour", | |
911 | IDENTIFIER_POINTER (DECL_NAME (body))); | |
912 | } | |
913 | /* Label not yet defined: may need to put this goto | |
914 | on the fixup list. */ | |
915 | else if (! expand_fixup (body, label, last_insn)) | |
916 | { | |
917 | /* No fixup needed. Record that the label is the target | |
918 | of at least one goto that has no fixup. */ | |
919 | if (body != 0) | |
920 | TREE_ADDRESSABLE (body) = 1; | |
921 | } | |
922 | ||
923 | emit_jump (label); | |
924 | } | |
925 | \f | |
926 | /* Generate if necessary a fixup for a goto | |
927 | whose target label in tree structure (if any) is TREE_LABEL | |
928 | and whose target in rtl is RTL_LABEL. | |
929 | ||
930 | If LAST_INSN is nonzero, we pretend that the jump appears | |
931 | after insn LAST_INSN instead of at the current point in the insn stream. | |
932 | ||
023b57e6 RS |
933 | The fixup will be used later to insert insns just before the goto. |
934 | Those insns will restore the stack level as appropriate for the | |
935 | target label, and will (in the case of C++) also invoke any object | |
936 | destructors which have to be invoked when we exit the scopes which | |
937 | are exited by the goto. | |
28d81abb RK |
938 | |
939 | Value is nonzero if a fixup is made. */ | |
940 | ||
941 | static int | |
942 | expand_fixup (tree_label, rtl_label, last_insn) | |
943 | tree tree_label; | |
944 | rtx rtl_label; | |
945 | rtx last_insn; | |
946 | { | |
947 | struct nesting *block, *end_block; | |
948 | ||
949 | /* See if we can recognize which block the label will be output in. | |
950 | This is possible in some very common cases. | |
951 | If we succeed, set END_BLOCK to that block. | |
952 | Otherwise, set it to 0. */ | |
953 | ||
954 | if (cond_stack | |
955 | && (rtl_label == cond_stack->data.cond.endif_label | |
956 | || rtl_label == cond_stack->data.cond.next_label)) | |
957 | end_block = cond_stack; | |
958 | /* If we are in a loop, recognize certain labels which | |
959 | are likely targets. This reduces the number of fixups | |
960 | we need to create. */ | |
961 | else if (loop_stack | |
962 | && (rtl_label == loop_stack->data.loop.start_label | |
963 | || rtl_label == loop_stack->data.loop.end_label | |
964 | || rtl_label == loop_stack->data.loop.continue_label)) | |
965 | end_block = loop_stack; | |
966 | else | |
967 | end_block = 0; | |
968 | ||
969 | /* Now set END_BLOCK to the binding level to which we will return. */ | |
970 | ||
971 | if (end_block) | |
972 | { | |
973 | struct nesting *next_block = end_block->all; | |
974 | block = block_stack; | |
975 | ||
976 | /* First see if the END_BLOCK is inside the innermost binding level. | |
977 | If so, then no cleanups or stack levels are relevant. */ | |
978 | while (next_block && next_block != block) | |
979 | next_block = next_block->all; | |
980 | ||
981 | if (next_block) | |
982 | return 0; | |
983 | ||
984 | /* Otherwise, set END_BLOCK to the innermost binding level | |
985 | which is outside the relevant control-structure nesting. */ | |
986 | next_block = block_stack->next; | |
987 | for (block = block_stack; block != end_block; block = block->all) | |
988 | if (block == next_block) | |
989 | next_block = next_block->next; | |
990 | end_block = next_block; | |
991 | } | |
992 | ||
993 | /* Does any containing block have a stack level or cleanups? | |
994 | If not, no fixup is needed, and that is the normal case | |
995 | (the only case, for standard C). */ | |
996 | for (block = block_stack; block != end_block; block = block->next) | |
997 | if (block->data.block.stack_level != 0 | |
998 | || block->data.block.cleanups != 0) | |
999 | break; | |
1000 | ||
1001 | if (block != end_block) | |
1002 | { | |
1003 | /* Ok, a fixup is needed. Add a fixup to the list of such. */ | |
1004 | struct goto_fixup *fixup | |
1005 | = (struct goto_fixup *) oballoc (sizeof (struct goto_fixup)); | |
1006 | /* In case an old stack level is restored, make sure that comes | |
1007 | after any pending stack adjust. */ | |
1008 | /* ?? If the fixup isn't to come at the present position, | |
1009 | doing the stack adjust here isn't useful. Doing it with our | |
1010 | settings at that location isn't useful either. Let's hope | |
1011 | someone does it! */ | |
1012 | if (last_insn == 0) | |
1013 | do_pending_stack_adjust (); | |
28d81abb RK |
1014 | fixup->target = tree_label; |
1015 | fixup->target_rtl = rtl_label; | |
023b57e6 RS |
1016 | |
1017 | /* Create a BLOCK node and a corresponding matched set of | |
12f61228 | 1018 | NOTE_INSN_BLOCK_BEG and NOTE_INSN_BLOCK_END notes at |
023b57e6 RS |
1019 | this point. The notes will encapsulate any and all fixup |
1020 | code which we might later insert at this point in the insn | |
1021 | stream. Also, the BLOCK node will be the parent (i.e. the | |
1022 | `SUPERBLOCK') of any other BLOCK nodes which we might create | |
0679e3fc JM |
1023 | later on when we are expanding the fixup code. |
1024 | ||
1025 | Note that optimization passes (including expand_end_loop) | |
1026 | might move the *_BLOCK notes away, so we use a NOTE_INSN_DELETED | |
1027 | as a placeholder. */ | |
023b57e6 RS |
1028 | |
1029 | { | |
1030 | register rtx original_before_jump | |
1031 | = last_insn ? last_insn : get_last_insn (); | |
0679e3fc | 1032 | rtx start; |
a97901e6 | 1033 | rtx end; |
e6fd097e MM |
1034 | tree block; |
1035 | ||
1036 | block = make_node (BLOCK); | |
1037 | TREE_USED (block) = 1; | |
1038 | ||
01d939e8 | 1039 | if (!cfun->x_whole_function_mode_p) |
a97901e6 MM |
1040 | insert_block (block); |
1041 | else | |
e6fd097e | 1042 | { |
a97901e6 MM |
1043 | BLOCK_CHAIN (block) |
1044 | = BLOCK_CHAIN (DECL_INITIAL (current_function_decl)); | |
1045 | BLOCK_CHAIN (DECL_INITIAL (current_function_decl)) | |
1046 | = block; | |
e6fd097e | 1047 | } |
023b57e6 RS |
1048 | |
1049 | start_sequence (); | |
0679e3fc | 1050 | start = emit_note (NULL_PTR, NOTE_INSN_BLOCK_BEG); |
01d939e8 | 1051 | if (cfun->x_whole_function_mode_p) |
a97901e6 | 1052 | NOTE_BLOCK (start) = block; |
0679e3fc | 1053 | fixup->before_jump = emit_note (NULL_PTR, NOTE_INSN_DELETED); |
a97901e6 | 1054 | end = emit_note (NULL_PTR, NOTE_INSN_BLOCK_END); |
01d939e8 | 1055 | if (cfun->x_whole_function_mode_p) |
a97901e6 | 1056 | NOTE_BLOCK (end) = block; |
e6fd097e | 1057 | fixup->context = block; |
023b57e6 | 1058 | end_sequence (); |
0679e3fc | 1059 | emit_insns_after (start, original_before_jump); |
023b57e6 RS |
1060 | } |
1061 | ||
3f1d071b | 1062 | fixup->block_start_count = current_block_start_count; |
28d81abb RK |
1063 | fixup->stack_level = 0; |
1064 | fixup->cleanup_list_list | |
e976b8b2 | 1065 | = ((block->data.block.outer_cleanups |
28d81abb | 1066 | || block->data.block.cleanups) |
37366632 | 1067 | ? tree_cons (NULL_TREE, block->data.block.cleanups, |
28d81abb RK |
1068 | block->data.block.outer_cleanups) |
1069 | : 0); | |
1070 | fixup->next = goto_fixup_chain; | |
1071 | goto_fixup_chain = fixup; | |
1072 | } | |
1073 | ||
1074 | return block != 0; | |
1075 | } | |
1076 | ||
ca695ac9 | 1077 | |
cfc3d13f RK |
1078 | \f |
1079 | /* Expand any needed fixups in the outputmost binding level of the | |
1080 | function. FIRST_INSN is the first insn in the function. */ | |
ca695ac9 | 1081 | |
cfc3d13f RK |
1082 | void |
1083 | expand_fixups (first_insn) | |
1084 | rtx first_insn; | |
1085 | { | |
1086 | fixup_gotos (NULL_PTR, NULL_RTX, NULL_TREE, first_insn, 0); | |
1087 | } | |
ca695ac9 | 1088 | |
28d81abb RK |
1089 | /* When exiting a binding contour, process all pending gotos requiring fixups. |
1090 | THISBLOCK is the structure that describes the block being exited. | |
1091 | STACK_LEVEL is the rtx for the stack level to restore exiting this contour. | |
1092 | CLEANUP_LIST is a list of expressions to evaluate on exiting this contour. | |
1093 | FIRST_INSN is the insn that began this contour. | |
1094 | ||
1095 | Gotos that jump out of this contour must restore the | |
1096 | stack level and do the cleanups before actually jumping. | |
1097 | ||
1098 | DONT_JUMP_IN nonzero means report error there is a jump into this | |
1099 | contour from before the beginning of the contour. | |
1100 | This is also done if STACK_LEVEL is nonzero. */ | |
1101 | ||
704f4dca | 1102 | static void |
28d81abb RK |
1103 | fixup_gotos (thisblock, stack_level, cleanup_list, first_insn, dont_jump_in) |
1104 | struct nesting *thisblock; | |
1105 | rtx stack_level; | |
1106 | tree cleanup_list; | |
1107 | rtx first_insn; | |
1108 | int dont_jump_in; | |
1109 | { | |
1110 | register struct goto_fixup *f, *prev; | |
1111 | ||
1112 | /* F is the fixup we are considering; PREV is the previous one. */ | |
1113 | /* We run this loop in two passes so that cleanups of exited blocks | |
1114 | are run first, and blocks that are exited are marked so | |
1115 | afterwards. */ | |
1116 | ||
1117 | for (prev = 0, f = goto_fixup_chain; f; prev = f, f = f->next) | |
1118 | { | |
1119 | /* Test for a fixup that is inactive because it is already handled. */ | |
1120 | if (f->before_jump == 0) | |
1121 | { | |
1122 | /* Delete inactive fixup from the chain, if that is easy to do. */ | |
1123 | if (prev != 0) | |
1124 | prev->next = f->next; | |
1125 | } | |
1126 | /* Has this fixup's target label been defined? | |
1127 | If so, we can finalize it. */ | |
1128 | else if (PREV_INSN (f->target_rtl) != 0) | |
1129 | { | |
7629c936 | 1130 | register rtx cleanup_insns; |
7629c936 | 1131 | |
28d81abb | 1132 | /* If this fixup jumped into this contour from before the beginning |
14a774a9 RK |
1133 | of this contour, report an error. This code used to use |
1134 | the first non-label insn after f->target_rtl, but that's | |
1135 | wrong since such can be added, by things like put_var_into_stack | |
1136 | and have INSN_UIDs that are out of the range of the block. */ | |
28d81abb RK |
1137 | /* ??? Bug: this does not detect jumping in through intermediate |
1138 | blocks that have stack levels or cleanups. | |
1139 | It detects only a problem with the innermost block | |
1140 | around the label. */ | |
1141 | if (f->target != 0 | |
1142 | && (dont_jump_in || stack_level || cleanup_list) | |
14a774a9 | 1143 | && INSN_UID (first_insn) < INSN_UID (f->target_rtl) |
28d81abb | 1144 | && INSN_UID (first_insn) > INSN_UID (f->before_jump) |
33bc3ff5 | 1145 | && ! DECL_ERROR_ISSUED (f->target)) |
28d81abb RK |
1146 | { |
1147 | error_with_decl (f->target, | |
1148 | "label `%s' used before containing binding contour"); | |
1149 | /* Prevent multiple errors for one label. */ | |
33bc3ff5 | 1150 | DECL_ERROR_ISSUED (f->target) = 1; |
28d81abb RK |
1151 | } |
1152 | ||
7629c936 RS |
1153 | /* We will expand the cleanups into a sequence of their own and |
1154 | then later on we will attach this new sequence to the insn | |
1155 | stream just ahead of the actual jump insn. */ | |
1156 | ||
1157 | start_sequence (); | |
1158 | ||
023b57e6 RS |
1159 | /* Temporarily restore the lexical context where we will |
1160 | logically be inserting the fixup code. We do this for the | |
1161 | sake of getting the debugging information right. */ | |
1162 | ||
7629c936 | 1163 | pushlevel (0); |
023b57e6 | 1164 | set_block (f->context); |
7629c936 RS |
1165 | |
1166 | /* Expand the cleanups for blocks this jump exits. */ | |
28d81abb RK |
1167 | if (f->cleanup_list_list) |
1168 | { | |
1169 | tree lists; | |
1170 | for (lists = f->cleanup_list_list; lists; lists = TREE_CHAIN (lists)) | |
1171 | /* Marked elements correspond to blocks that have been closed. | |
1172 | Do their cleanups. */ | |
1173 | if (TREE_ADDRESSABLE (lists) | |
1174 | && TREE_VALUE (lists) != 0) | |
7629c936 | 1175 | { |
50d1b7a1 | 1176 | expand_cleanups (TREE_VALUE (lists), NULL_TREE, 1, 1); |
7629c936 RS |
1177 | /* Pop any pushes done in the cleanups, |
1178 | in case function is about to return. */ | |
1179 | do_pending_stack_adjust (); | |
1180 | } | |
28d81abb RK |
1181 | } |
1182 | ||
1183 | /* Restore stack level for the biggest contour that this | |
1184 | jump jumps out of. */ | |
1185 | if (f->stack_level) | |
59257ff7 | 1186 | emit_stack_restore (SAVE_BLOCK, f->stack_level, f->before_jump); |
7629c936 RS |
1187 | |
1188 | /* Finish up the sequence containing the insns which implement the | |
1189 | necessary cleanups, and then attach that whole sequence to the | |
1190 | insn stream just ahead of the actual jump insn. Attaching it | |
1191 | at that point insures that any cleanups which are in fact | |
1192 | implicit C++ object destructions (which must be executed upon | |
1193 | leaving the block) appear (to the debugger) to be taking place | |
1194 | in an area of the generated code where the object(s) being | |
1195 | destructed are still "in scope". */ | |
1196 | ||
1197 | cleanup_insns = get_insns (); | |
023b57e6 | 1198 | poplevel (1, 0, 0); |
7629c936 RS |
1199 | |
1200 | end_sequence (); | |
1201 | emit_insns_after (cleanup_insns, f->before_jump); | |
1202 | ||
7629c936 | 1203 | |
28d81abb RK |
1204 | f->before_jump = 0; |
1205 | } | |
1206 | } | |
1207 | ||
6bc2f582 RK |
1208 | /* For any still-undefined labels, do the cleanups for this block now. |
1209 | We must do this now since items in the cleanup list may go out | |
0f41302f | 1210 | of scope when the block ends. */ |
28d81abb RK |
1211 | for (prev = 0, f = goto_fixup_chain; f; prev = f, f = f->next) |
1212 | if (f->before_jump != 0 | |
1213 | && PREV_INSN (f->target_rtl) == 0 | |
1214 | /* Label has still not appeared. If we are exiting a block with | |
1215 | a stack level to restore, that started before the fixup, | |
1216 | mark this stack level as needing restoration | |
6bc2f582 | 1217 | when the fixup is later finalized. */ |
28d81abb | 1218 | && thisblock != 0 |
6bc2f582 RK |
1219 | /* Note: if THISBLOCK == 0 and we have a label that hasn't appeared, it |
1220 | means the label is undefined. That's erroneous, but possible. */ | |
28d81abb RK |
1221 | && (thisblock->data.block.block_start_count |
1222 | <= f->block_start_count)) | |
1223 | { | |
1224 | tree lists = f->cleanup_list_list; | |
6bc2f582 RK |
1225 | rtx cleanup_insns; |
1226 | ||
28d81abb RK |
1227 | for (; lists; lists = TREE_CHAIN (lists)) |
1228 | /* If the following elt. corresponds to our containing block | |
1229 | then the elt. must be for this block. */ | |
1230 | if (TREE_CHAIN (lists) == thisblock->data.block.outer_cleanups) | |
6bc2f582 RK |
1231 | { |
1232 | start_sequence (); | |
1233 | pushlevel (0); | |
1234 | set_block (f->context); | |
1235 | expand_cleanups (TREE_VALUE (lists), NULL_TREE, 1, 1); | |
f0959e58 | 1236 | do_pending_stack_adjust (); |
6bc2f582 RK |
1237 | cleanup_insns = get_insns (); |
1238 | poplevel (1, 0, 0); | |
1239 | end_sequence (); | |
412c00dc RK |
1240 | if (cleanup_insns != 0) |
1241 | f->before_jump | |
1242 | = emit_insns_after (cleanup_insns, f->before_jump); | |
6bc2f582 | 1243 | |
e07ed33f | 1244 | f->cleanup_list_list = TREE_CHAIN (lists); |
6bc2f582 | 1245 | } |
28d81abb RK |
1246 | |
1247 | if (stack_level) | |
1248 | f->stack_level = stack_level; | |
1249 | } | |
1250 | } | |
2a230e9d BS |
1251 | \f |
1252 | /* Return the number of times character C occurs in string S. */ | |
1253 | static int | |
1254 | n_occurrences (c, s) | |
1255 | int c; | |
dff01034 | 1256 | const char *s; |
2a230e9d BS |
1257 | { |
1258 | int n = 0; | |
1259 | while (*s) | |
1260 | n += (*s++ == c); | |
1261 | return n; | |
1262 | } | |
28d81abb RK |
1263 | \f |
1264 | /* Generate RTL for an asm statement (explicit assembler code). | |
1265 | BODY is a STRING_CST node containing the assembler code text, | |
1266 | or an ADDR_EXPR containing a STRING_CST. */ | |
1267 | ||
1268 | void | |
1269 | expand_asm (body) | |
1270 | tree body; | |
1271 | { | |
7d384cc0 | 1272 | if (current_function_check_memory_usage) |
17f5f329 | 1273 | { |
c5c76735 | 1274 | error ("`asm' cannot be used in function where memory usage is checked"); |
17f5f329 RK |
1275 | return; |
1276 | } | |
1277 | ||
28d81abb RK |
1278 | if (TREE_CODE (body) == ADDR_EXPR) |
1279 | body = TREE_OPERAND (body, 0); | |
1280 | ||
38a448ca RH |
1281 | emit_insn (gen_rtx_ASM_INPUT (VOIDmode, |
1282 | TREE_STRING_POINTER (body))); | |
28d81abb RK |
1283 | last_expr_type = 0; |
1284 | } | |
1285 | ||
1286 | /* Generate RTL for an asm statement with arguments. | |
1287 | STRING is the instruction template. | |
1288 | OUTPUTS is a list of output arguments (lvalues); INPUTS a list of inputs. | |
1289 | Each output or input has an expression in the TREE_VALUE and | |
1290 | a constraint-string in the TREE_PURPOSE. | |
1291 | CLOBBERS is a list of STRING_CST nodes each naming a hard register | |
1292 | that is clobbered by this insn. | |
1293 | ||
1294 | Not all kinds of lvalue that may appear in OUTPUTS can be stored directly. | |
1295 | Some elements of OUTPUTS may be replaced with trees representing temporary | |
1296 | values. The caller should copy those temporary values to the originally | |
1297 | specified lvalues. | |
1298 | ||
1299 | VOL nonzero means the insn is volatile; don't optimize it. */ | |
1300 | ||
1301 | void | |
1302 | expand_asm_operands (string, outputs, inputs, clobbers, vol, filename, line) | |
1303 | tree string, outputs, inputs, clobbers; | |
1304 | int vol; | |
1305 | char *filename; | |
1306 | int line; | |
1307 | { | |
1308 | rtvec argvec, constraints; | |
1309 | rtx body; | |
1310 | int ninputs = list_length (inputs); | |
1311 | int noutputs = list_length (outputs); | |
235c5021 | 1312 | int ninout = 0; |
b4ccaa16 | 1313 | int nclobbers; |
28d81abb RK |
1314 | tree tail; |
1315 | register int i; | |
1316 | /* Vector of RTX's of evaluated output operands. */ | |
1317 | rtx *output_rtx = (rtx *) alloca (noutputs * sizeof (rtx)); | |
235c5021 | 1318 | int *inout_opnum = (int *) alloca (noutputs * sizeof (int)); |
947255ed | 1319 | rtx *real_output_rtx = (rtx *) alloca (noutputs * sizeof (rtx)); |
235c5021 RK |
1320 | enum machine_mode *inout_mode |
1321 | = (enum machine_mode *) alloca (noutputs * sizeof (enum machine_mode)); | |
28d81abb RK |
1322 | /* The insn we have emitted. */ |
1323 | rtx insn; | |
1324 | ||
e5e809f4 | 1325 | /* An ASM with no outputs needs to be treated as volatile, for now. */ |
296f8acc JL |
1326 | if (noutputs == 0) |
1327 | vol = 1; | |
1328 | ||
7d384cc0 | 1329 | if (current_function_check_memory_usage) |
17f5f329 RK |
1330 | { |
1331 | error ("`asm' cannot be used with `-fcheck-memory-usage'"); | |
1332 | return; | |
1333 | } | |
1334 | ||
57bcb97a RH |
1335 | #ifdef MD_ASM_CLOBBERS |
1336 | /* Sometimes we wish to automatically clobber registers across an asm. | |
1337 | Case in point is when the i386 backend moved from cc0 to a hard reg -- | |
1338 | maintaining source-level compatability means automatically clobbering | |
1339 | the flags register. */ | |
1340 | MD_ASM_CLOBBERS (clobbers); | |
1341 | #endif | |
1342 | ||
c5c76735 JL |
1343 | if (current_function_check_memory_usage) |
1344 | { | |
1345 | error ("`asm' cannot be used in function where memory usage is checked"); | |
1346 | return; | |
1347 | } | |
1348 | ||
b4ccaa16 RS |
1349 | /* Count the number of meaningful clobbered registers, ignoring what |
1350 | we would ignore later. */ | |
1351 | nclobbers = 0; | |
1352 | for (tail = clobbers; tail; tail = TREE_CHAIN (tail)) | |
1353 | { | |
47ee9bcb | 1354 | const char *regname = TREE_STRING_POINTER (TREE_VALUE (tail)); |
14a774a9 | 1355 | |
c09e6498 RS |
1356 | i = decode_reg_name (regname); |
1357 | if (i >= 0 || i == -4) | |
b4ccaa16 | 1358 | ++nclobbers; |
7859e3ac DE |
1359 | else if (i == -2) |
1360 | error ("unknown register name `%s' in `asm'", regname); | |
b4ccaa16 RS |
1361 | } |
1362 | ||
28d81abb RK |
1363 | last_expr_type = 0; |
1364 | ||
2a230e9d BS |
1365 | /* Check that the number of alternatives is constant across all |
1366 | operands. */ | |
1367 | if (outputs || inputs) | |
1368 | { | |
1369 | tree tmp = TREE_PURPOSE (outputs ? outputs : inputs); | |
1370 | int nalternatives = n_occurrences (',', TREE_STRING_POINTER (tmp)); | |
1371 | tree next = inputs; | |
1372 | ||
f62a15e3 BS |
1373 | if (nalternatives + 1 > MAX_RECOG_ALTERNATIVES) |
1374 | { | |
1375 | error ("too many alternatives in `asm'"); | |
1376 | return; | |
1377 | } | |
1378 | ||
2a230e9d BS |
1379 | tmp = outputs; |
1380 | while (tmp) | |
1381 | { | |
47ee9bcb | 1382 | const char *constraint = TREE_STRING_POINTER (TREE_PURPOSE (tmp)); |
14a774a9 | 1383 | |
2a230e9d BS |
1384 | if (n_occurrences (',', constraint) != nalternatives) |
1385 | { | |
1386 | error ("operand constraints for `asm' differ in number of alternatives"); | |
1387 | return; | |
1388 | } | |
14a774a9 | 1389 | |
2a230e9d BS |
1390 | if (TREE_CHAIN (tmp)) |
1391 | tmp = TREE_CHAIN (tmp); | |
1392 | else | |
1393 | tmp = next, next = 0; | |
1394 | } | |
1395 | } | |
1396 | ||
28d81abb RK |
1397 | for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++) |
1398 | { | |
1399 | tree val = TREE_VALUE (tail); | |
b50a024d | 1400 | tree type = TREE_TYPE (val); |
2a230e9d | 1401 | char *constraint; |
3fbd5c2c | 1402 | char *p; |
2a230e9d | 1403 | int c_len; |
28d81abb | 1404 | int j; |
2a230e9d | 1405 | int is_inout = 0; |
d09a75ae | 1406 | int allows_reg = 0; |
1afbe1c4 | 1407 | int allows_mem = 0; |
28d81abb RK |
1408 | |
1409 | /* If there's an erroneous arg, emit no insn. */ | |
1410 | if (TREE_TYPE (val) == error_mark_node) | |
1411 | return; | |
1412 | ||
d09a75ae RK |
1413 | /* Make sure constraint has `=' and does not have `+'. Also, see |
1414 | if it allows any register. Be liberal on the latter test, since | |
1415 | the worst that happens if we get it wrong is we issue an error | |
1416 | message. */ | |
28d81abb | 1417 | |
14a774a9 | 1418 | c_len = strlen (TREE_STRING_POINTER (TREE_PURPOSE (tail))); |
2a230e9d BS |
1419 | constraint = TREE_STRING_POINTER (TREE_PURPOSE (tail)); |
1420 | ||
3fbd5c2c RH |
1421 | /* Allow the `=' or `+' to not be at the beginning of the string, |
1422 | since it wasn't explicitly documented that way, and there is a | |
1423 | large body of code that puts it last. Swap the character to | |
1424 | the front, so as not to uglify any place else. */ | |
1425 | switch (c_len) | |
2a230e9d | 1426 | { |
3fbd5c2c RH |
1427 | default: |
1428 | if ((p = strchr (constraint, '=')) != NULL) | |
1429 | break; | |
1430 | if ((p = strchr (constraint, '+')) != NULL) | |
1431 | break; | |
1432 | case 0: | |
2a230e9d BS |
1433 | error ("output operand constraint lacks `='"); |
1434 | return; | |
1435 | } | |
1436 | ||
3fbd5c2c RH |
1437 | if (p != constraint) |
1438 | { | |
1439 | j = *p; | |
1440 | bcopy (constraint, constraint+1, p-constraint); | |
1441 | *constraint = j; | |
1442 | ||
1443 | warning ("output constraint `%c' for operand %d is not at the beginning", j, i); | |
1444 | } | |
1445 | ||
2a230e9d BS |
1446 | is_inout = constraint[0] == '+'; |
1447 | /* Replace '+' with '='. */ | |
1448 | constraint[0] = '='; | |
1449 | /* Make sure we can specify the matching operand. */ | |
1450 | if (is_inout && i > 9) | |
1451 | { | |
1452 | error ("output operand constraint %d contains `+'", i); | |
1453 | return; | |
1454 | } | |
1455 | ||
1456 | for (j = 1; j < c_len; j++) | |
1457 | switch (constraint[j]) | |
d09a75ae RK |
1458 | { |
1459 | case '+': | |
2a230e9d BS |
1460 | case '=': |
1461 | error ("operand constraint contains '+' or '=' at illegal position."); | |
1462 | return; | |
1463 | ||
1464 | case '%': | |
1465 | if (i + 1 == ninputs + noutputs) | |
235c5021 | 1466 | { |
2a230e9d | 1467 | error ("`%%' constraint used with last operand"); |
235c5021 RK |
1468 | return; |
1469 | } | |
235c5021 | 1470 | break; |
d09a75ae | 1471 | |
2a230e9d | 1472 | case '?': case '!': case '*': case '&': |
1afbe1c4 | 1473 | case 'E': case 'F': case 'G': case 'H': |
d09a75ae RK |
1474 | case 's': case 'i': case 'n': |
1475 | case 'I': case 'J': case 'K': case 'L': case 'M': | |
1476 | case 'N': case 'O': case 'P': case ',': | |
1477 | #ifdef EXTRA_CONSTRAINT | |
1478 | case 'Q': case 'R': case 'S': case 'T': case 'U': | |
1479 | #endif | |
1480 | break; | |
1481 | ||
7b7a33b3 | 1482 | case '0': case '1': case '2': case '3': case '4': |
cd76ea33 RK |
1483 | case '5': case '6': case '7': case '8': case '9': |
1484 | error ("matching constraint not valid in output operand"); | |
1485 | break; | |
1486 | ||
1afbe1c4 RH |
1487 | case 'V': case 'm': case 'o': |
1488 | allows_mem = 1; | |
1489 | break; | |
1490 | ||
1491 | case '<': case '>': | |
1492 | /* ??? Before flow, auto inc/dec insns are not supposed to exist, | |
1493 | excepting those that expand_call created. So match memory | |
1494 | and hope. */ | |
1495 | allows_mem = 1; | |
1496 | break; | |
1497 | ||
1498 | case 'g': case 'X': | |
1499 | allows_reg = 1; | |
1500 | allows_mem = 1; | |
1501 | break; | |
1502 | ||
1503 | case 'p': case 'r': | |
d09a75ae RK |
1504 | default: |
1505 | allows_reg = 1; | |
1506 | break; | |
1507 | } | |
1508 | ||
d09a75ae RK |
1509 | /* If an output operand is not a decl or indirect ref and our constraint |
1510 | allows a register, make a temporary to act as an intermediate. | |
1511 | Make the asm insn write into that, then our caller will copy it to | |
1512 | the real output operand. Likewise for promoted variables. */ | |
28d81abb | 1513 | |
947255ed | 1514 | real_output_rtx[i] = NULL_RTX; |
1afbe1c4 RH |
1515 | if ((TREE_CODE (val) == INDIRECT_REF |
1516 | && allows_mem) | |
b50a024d | 1517 | || (TREE_CODE_CLASS (TREE_CODE (val)) == 'd' |
1afbe1c4 | 1518 | && (allows_mem || GET_CODE (DECL_RTL (val)) == REG) |
b50a024d | 1519 | && ! (GET_CODE (DECL_RTL (val)) == REG |
d09a75ae | 1520 | && GET_MODE (DECL_RTL (val)) != TYPE_MODE (type))) |
235c5021 | 1521 | || ! allows_reg |
2a230e9d | 1522 | || is_inout) |
d09a75ae RK |
1523 | { |
1524 | if (! allows_reg) | |
1525 | mark_addressable (TREE_VALUE (tail)); | |
1526 | ||
1527 | output_rtx[i] | |
17f5f329 RK |
1528 | = expand_expr (TREE_VALUE (tail), NULL_RTX, VOIDmode, |
1529 | EXPAND_MEMORY_USE_WO); | |
d09a75ae RK |
1530 | |
1531 | if (! allows_reg && GET_CODE (output_rtx[i]) != MEM) | |
1532 | error ("output number %d not directly addressable", i); | |
1afbe1c4 | 1533 | if (! allows_mem && GET_CODE (output_rtx[i]) == MEM) |
947255ed RH |
1534 | { |
1535 | real_output_rtx[i] = protect_from_queue (output_rtx[i], 1); | |
1536 | output_rtx[i] = gen_reg_rtx (GET_MODE (output_rtx[i])); | |
1537 | if (is_inout) | |
1538 | emit_move_insn (output_rtx[i], real_output_rtx[i]); | |
1539 | } | |
d09a75ae | 1540 | } |
b50a024d | 1541 | else |
e619bb8d | 1542 | { |
6e81958a | 1543 | output_rtx[i] = assign_temp (type, 0, 0, 0); |
b50a024d RK |
1544 | TREE_VALUE (tail) = make_tree (type, output_rtx[i]); |
1545 | } | |
235c5021 | 1546 | |
2a230e9d | 1547 | if (is_inout) |
235c5021 RK |
1548 | { |
1549 | inout_mode[ninout] = TYPE_MODE (TREE_TYPE (TREE_VALUE (tail))); | |
1550 | inout_opnum[ninout++] = i; | |
1551 | } | |
28d81abb RK |
1552 | } |
1553 | ||
235c5021 | 1554 | ninputs += ninout; |
28d81abb RK |
1555 | if (ninputs + noutputs > MAX_RECOG_OPERANDS) |
1556 | { | |
1557 | error ("more than %d operands in `asm'", MAX_RECOG_OPERANDS); | |
1558 | return; | |
1559 | } | |
1560 | ||
1561 | /* Make vectors for the expression-rtx and constraint strings. */ | |
1562 | ||
1563 | argvec = rtvec_alloc (ninputs); | |
1564 | constraints = rtvec_alloc (ninputs); | |
1565 | ||
21a427cc AS |
1566 | body = gen_rtx_ASM_OPERANDS (VOIDmode, TREE_STRING_POINTER (string), |
1567 | empty_string, 0, argvec, constraints, | |
1568 | filename, line); | |
c85f7c16 | 1569 | |
78418280 | 1570 | MEM_VOLATILE_P (body) = vol; |
28d81abb RK |
1571 | |
1572 | /* Eval the inputs and put them into ARGVEC. | |
1573 | Put their constraints into ASM_INPUTs and store in CONSTRAINTS. */ | |
1574 | ||
1575 | i = 0; | |
1576 | for (tail = inputs; tail; tail = TREE_CHAIN (tail)) | |
1577 | { | |
1578 | int j; | |
1f06ee8d RH |
1579 | int allows_reg = 0, allows_mem = 0; |
1580 | char *constraint, *orig_constraint; | |
2a230e9d | 1581 | int c_len; |
1f06ee8d | 1582 | rtx op; |
28d81abb RK |
1583 | |
1584 | /* If there's an erroneous arg, emit no insn, | |
1585 | because the ASM_INPUT would get VOIDmode | |
1586 | and that could cause a crash in reload. */ | |
1587 | if (TREE_TYPE (TREE_VALUE (tail)) == error_mark_node) | |
1588 | return; | |
2a230e9d BS |
1589 | |
1590 | /* ??? Can this happen, and does the error message make any sense? */ | |
28d81abb RK |
1591 | if (TREE_PURPOSE (tail) == NULL_TREE) |
1592 | { | |
1593 | error ("hard register `%s' listed as input operand to `asm'", | |
1594 | TREE_STRING_POINTER (TREE_VALUE (tail)) ); | |
1595 | return; | |
1596 | } | |
1597 | ||
14a774a9 | 1598 | c_len = strlen (TREE_STRING_POINTER (TREE_PURPOSE (tail))); |
2a230e9d | 1599 | constraint = TREE_STRING_POINTER (TREE_PURPOSE (tail)); |
1f06ee8d | 1600 | orig_constraint = constraint; |
28d81abb | 1601 | |
2a230e9d BS |
1602 | /* Make sure constraint has neither `=', `+', nor '&'. */ |
1603 | ||
1604 | for (j = 0; j < c_len; j++) | |
1605 | switch (constraint[j]) | |
28d81abb | 1606 | { |
2a230e9d | 1607 | case '+': case '=': case '&': |
1f06ee8d RH |
1608 | if (constraint == orig_constraint) |
1609 | { | |
14a774a9 RK |
1610 | error ("input operand constraint contains `%c'", |
1611 | constraint[j]); | |
1f06ee8d RH |
1612 | return; |
1613 | } | |
1614 | break; | |
65fed0cb | 1615 | |
2a230e9d | 1616 | case '%': |
1f06ee8d RH |
1617 | if (constraint == orig_constraint |
1618 | && i + 1 == ninputs - ninout) | |
2a230e9d BS |
1619 | { |
1620 | error ("`%%' constraint used with last operand"); | |
1621 | return; | |
1622 | } | |
1623 | break; | |
1624 | ||
1f06ee8d RH |
1625 | case 'V': case 'm': case 'o': |
1626 | allows_mem = 1; | |
1627 | break; | |
1628 | ||
1629 | case '<': case '>': | |
2a230e9d | 1630 | case '?': case '!': case '*': |
65fed0cb RK |
1631 | case 'E': case 'F': case 'G': case 'H': case 'X': |
1632 | case 's': case 'i': case 'n': | |
1633 | case 'I': case 'J': case 'K': case 'L': case 'M': | |
1634 | case 'N': case 'O': case 'P': case ',': | |
1635 | #ifdef EXTRA_CONSTRAINT | |
1636 | case 'Q': case 'R': case 'S': case 'T': case 'U': | |
1637 | #endif | |
1638 | break; | |
1639 | ||
7b7a33b3 JW |
1640 | /* Whether or not a numeric constraint allows a register is |
1641 | decided by the matching constraint, and so there is no need | |
1642 | to do anything special with them. We must handle them in | |
1643 | the default case, so that we don't unnecessarily force | |
1644 | operands to memory. */ | |
1645 | case '0': case '1': case '2': case '3': case '4': | |
cd76ea33 | 1646 | case '5': case '6': case '7': case '8': case '9': |
2a230e9d | 1647 | if (constraint[j] >= '0' + noutputs) |
956d6950 JL |
1648 | { |
1649 | error | |
1650 | ("matching constraint references invalid operand number"); | |
1651 | return; | |
1652 | } | |
cd76ea33 | 1653 | |
1f06ee8d | 1654 | /* Try and find the real constraint for this dup. */ |
1afbe1c4 RH |
1655 | if ((j == 0 && c_len == 1) |
1656 | || (j == 1 && c_len == 2 && constraint[0] == '%')) | |
1f06ee8d RH |
1657 | { |
1658 | tree o = outputs; | |
14a774a9 | 1659 | |
1f06ee8d RH |
1660 | for (j = constraint[j] - '0'; j > 0; --j) |
1661 | o = TREE_CHAIN (o); | |
1662 | ||
14a774a9 | 1663 | c_len = strlen (TREE_STRING_POINTER (TREE_PURPOSE (o))); |
1f06ee8d RH |
1664 | constraint = TREE_STRING_POINTER (TREE_PURPOSE (o)); |
1665 | j = 0; | |
1666 | break; | |
1667 | } | |
1668 | ||
cd76ea33 RK |
1669 | /* ... fall through ... */ |
1670 | ||
1f06ee8d | 1671 | case 'p': case 'r': |
65fed0cb RK |
1672 | default: |
1673 | allows_reg = 1; | |
1674 | break; | |
1f06ee8d RH |
1675 | |
1676 | case 'g': | |
1677 | allows_reg = 1; | |
1678 | allows_mem = 1; | |
1679 | break; | |
28d81abb RK |
1680 | } |
1681 | ||
1f06ee8d | 1682 | if (! allows_reg && allows_mem) |
65fed0cb RK |
1683 | mark_addressable (TREE_VALUE (tail)); |
1684 | ||
1f06ee8d | 1685 | op = expand_expr (TREE_VALUE (tail), NULL_RTX, VOIDmode, 0); |
65fed0cb | 1686 | |
1afbe1c4 | 1687 | if (asm_operand_ok (op, constraint) <= 0) |
65fed0cb | 1688 | { |
1f06ee8d RH |
1689 | if (allows_reg) |
1690 | op = force_reg (TYPE_MODE (TREE_TYPE (TREE_VALUE (tail))), op); | |
1691 | else if (!allows_mem) | |
1692 | warning ("asm operand %d probably doesn't match constraints", i); | |
1693 | else if (CONSTANT_P (op)) | |
1694 | op = force_const_mem (TYPE_MODE (TREE_TYPE (TREE_VALUE (tail))), | |
1695 | op); | |
1696 | else if (GET_CODE (op) == REG | |
1697 | || GET_CODE (op) == SUBREG | |
1698 | || GET_CODE (op) == CONCAT) | |
1699 | { | |
1700 | tree type = TREE_TYPE (TREE_VALUE (tail)); | |
1701 | rtx memloc = assign_temp (type, 1, 1, 1); | |
65fed0cb | 1702 | |
1f06ee8d RH |
1703 | emit_move_insn (memloc, op); |
1704 | op = memloc; | |
1705 | } | |
14a774a9 | 1706 | |
1f06ee8d RH |
1707 | else if (GET_CODE (op) == MEM && MEM_VOLATILE_P (op)) |
1708 | /* We won't recognize volatile memory as available a | |
1709 | memory_operand at this point. Ignore it. */ | |
1710 | ; | |
1711 | else if (queued_subexp_p (op)) | |
1712 | ; | |
1713 | else | |
1714 | /* ??? Leave this only until we have experience with what | |
1715 | happens in combine and elsewhere when constraints are | |
1716 | not satisfied. */ | |
1717 | warning ("asm operand %d probably doesn't match constraints", i); | |
65fed0cb | 1718 | } |
1f06ee8d | 1719 | XVECEXP (body, 3, i) = op; |
2a230e9d | 1720 | |
28d81abb | 1721 | XVECEXP (body, 4, i) /* constraints */ |
38a448ca | 1722 | = gen_rtx_ASM_INPUT (TYPE_MODE (TREE_TYPE (TREE_VALUE (tail))), |
1f06ee8d | 1723 | orig_constraint); |
28d81abb RK |
1724 | i++; |
1725 | } | |
1726 | ||
14a774a9 RK |
1727 | /* Protect all the operands from the queue now that they have all been |
1728 | evaluated. */ | |
28d81abb | 1729 | |
235c5021 | 1730 | for (i = 0; i < ninputs - ninout; i++) |
28d81abb RK |
1731 | XVECEXP (body, 3, i) = protect_from_queue (XVECEXP (body, 3, i), 0); |
1732 | ||
1733 | for (i = 0; i < noutputs; i++) | |
1734 | output_rtx[i] = protect_from_queue (output_rtx[i], 1); | |
1735 | ||
235c5021 RK |
1736 | /* For in-out operands, copy output rtx to input rtx. */ |
1737 | for (i = 0; i < ninout; i++) | |
1738 | { | |
235c5021 RK |
1739 | int j = inout_opnum[i]; |
1740 | ||
1741 | XVECEXP (body, 3, ninputs - ninout + i) /* argvec */ | |
1742 | = output_rtx[j]; | |
1743 | XVECEXP (body, 4, ninputs - ninout + i) /* constraints */ | |
21a427cc | 1744 | = gen_rtx_ASM_INPUT (inout_mode[i], digit_strings[j]); |
235c5021 RK |
1745 | } |
1746 | ||
28d81abb RK |
1747 | /* Now, for each output, construct an rtx |
1748 | (set OUTPUT (asm_operands INSN OUTPUTNUMBER OUTPUTCONSTRAINT | |
1749 | ARGVEC CONSTRAINTS)) | |
1750 | If there is more than one, put them inside a PARALLEL. */ | |
1751 | ||
1752 | if (noutputs == 1 && nclobbers == 0) | |
1753 | { | |
1754 | XSTR (body, 1) = TREE_STRING_POINTER (TREE_PURPOSE (outputs)); | |
38a448ca | 1755 | insn = emit_insn (gen_rtx_SET (VOIDmode, output_rtx[0], body)); |
28d81abb | 1756 | } |
14a774a9 | 1757 | |
28d81abb RK |
1758 | else if (noutputs == 0 && nclobbers == 0) |
1759 | { | |
1760 | /* No output operands: put in a raw ASM_OPERANDS rtx. */ | |
1761 | insn = emit_insn (body); | |
1762 | } | |
14a774a9 | 1763 | |
28d81abb RK |
1764 | else |
1765 | { | |
1766 | rtx obody = body; | |
1767 | int num = noutputs; | |
14a774a9 RK |
1768 | |
1769 | if (num == 0) | |
1770 | num = 1; | |
1771 | ||
38a448ca | 1772 | body = gen_rtx_PARALLEL (VOIDmode, rtvec_alloc (num + nclobbers)); |
28d81abb RK |
1773 | |
1774 | /* For each output operand, store a SET. */ | |
28d81abb RK |
1775 | for (i = 0, tail = outputs; tail; tail = TREE_CHAIN (tail), i++) |
1776 | { | |
1777 | XVECEXP (body, 0, i) | |
38a448ca RH |
1778 | = gen_rtx_SET (VOIDmode, |
1779 | output_rtx[i], | |
c5c76735 JL |
1780 | gen_rtx_ASM_OPERANDS |
1781 | (VOIDmode, | |
1782 | TREE_STRING_POINTER (string), | |
1783 | TREE_STRING_POINTER (TREE_PURPOSE (tail)), | |
1784 | i, argvec, constraints, | |
1785 | filename, line)); | |
1786 | ||
28d81abb RK |
1787 | MEM_VOLATILE_P (SET_SRC (XVECEXP (body, 0, i))) = vol; |
1788 | } | |
1789 | ||
1790 | /* If there are no outputs (but there are some clobbers) | |
1791 | store the bare ASM_OPERANDS into the PARALLEL. */ | |
1792 | ||
1793 | if (i == 0) | |
1794 | XVECEXP (body, 0, i++) = obody; | |
1795 | ||
1796 | /* Store (clobber REG) for each clobbered register specified. */ | |
1797 | ||
b4ccaa16 | 1798 | for (tail = clobbers; tail; tail = TREE_CHAIN (tail)) |
28d81abb | 1799 | { |
47ee9bcb | 1800 | const char *regname = TREE_STRING_POINTER (TREE_VALUE (tail)); |
b4ac57ab | 1801 | int j = decode_reg_name (regname); |
28d81abb | 1802 | |
b4ac57ab | 1803 | if (j < 0) |
28d81abb | 1804 | { |
c09e6498 | 1805 | if (j == -3) /* `cc', which is not a register */ |
dcfedcd0 RK |
1806 | continue; |
1807 | ||
c09e6498 RS |
1808 | if (j == -4) /* `memory', don't cache memory across asm */ |
1809 | { | |
bffc6177 | 1810 | XVECEXP (body, 0, i++) |
38a448ca | 1811 | = gen_rtx_CLOBBER (VOIDmode, |
c5c76735 JL |
1812 | gen_rtx_MEM |
1813 | (BLKmode, | |
1814 | gen_rtx_SCRATCH (VOIDmode))); | |
c09e6498 RS |
1815 | continue; |
1816 | } | |
1817 | ||
956d6950 | 1818 | /* Ignore unknown register, error already signaled. */ |
cc1f5387 | 1819 | continue; |
28d81abb RK |
1820 | } |
1821 | ||
1822 | /* Use QImode since that's guaranteed to clobber just one reg. */ | |
b4ccaa16 | 1823 | XVECEXP (body, 0, i++) |
38a448ca | 1824 | = gen_rtx_CLOBBER (VOIDmode, gen_rtx_REG (QImode, j)); |
28d81abb RK |
1825 | } |
1826 | ||
1827 | insn = emit_insn (body); | |
1828 | } | |
1829 | ||
947255ed RH |
1830 | /* For any outputs that needed reloading into registers, spill them |
1831 | back to where they belong. */ | |
1832 | for (i = 0; i < noutputs; ++i) | |
1833 | if (real_output_rtx[i]) | |
1834 | emit_move_insn (real_output_rtx[i], output_rtx[i]); | |
1835 | ||
28d81abb RK |
1836 | free_temp_slots (); |
1837 | } | |
1838 | \f | |
1839 | /* Generate RTL to evaluate the expression EXP | |
1840 | and remember it in case this is the VALUE in a ({... VALUE; }) constr. */ | |
1841 | ||
1842 | void | |
1843 | expand_expr_stmt (exp) | |
1844 | tree exp; | |
1845 | { | |
1846 | /* If -W, warn about statements with no side effects, | |
1847 | except for an explicit cast to void (e.g. for assert()), and | |
1848 | except inside a ({...}) where they may be useful. */ | |
1849 | if (expr_stmts_for_value == 0 && exp != error_mark_node) | |
1850 | { | |
1851 | if (! TREE_SIDE_EFFECTS (exp) && (extra_warnings || warn_unused) | |
1852 | && !(TREE_CODE (exp) == CONVERT_EXPR | |
1853 | && TREE_TYPE (exp) == void_type_node)) | |
1854 | warning_with_file_and_line (emit_filename, emit_lineno, | |
1855 | "statement with no effect"); | |
1856 | else if (warn_unused) | |
1857 | warn_if_unused_value (exp); | |
1858 | } | |
b6ec8c5f RK |
1859 | |
1860 | /* If EXP is of function type and we are expanding statements for | |
1861 | value, convert it to pointer-to-function. */ | |
1862 | if (expr_stmts_for_value && TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE) | |
1863 | exp = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (exp)), exp); | |
1864 | ||
28d81abb | 1865 | last_expr_type = TREE_TYPE (exp); |
a2cf7deb CB |
1866 | last_expr_value = expand_expr (exp, |
1867 | (expr_stmts_for_value | |
1868 | ? NULL_RTX : const0_rtx), | |
1869 | VOIDmode, 0); | |
28d81abb RK |
1870 | |
1871 | /* If all we do is reference a volatile value in memory, | |
1872 | copy it to a register to be sure it is actually touched. */ | |
1873 | if (last_expr_value != 0 && GET_CODE (last_expr_value) == MEM | |
1874 | && TREE_THIS_VOLATILE (exp)) | |
1875 | { | |
6a5bbbe6 RS |
1876 | if (TYPE_MODE (TREE_TYPE (exp)) == VOIDmode) |
1877 | ; | |
1878 | else if (TYPE_MODE (TREE_TYPE (exp)) != BLKmode) | |
28d81abb RK |
1879 | copy_to_reg (last_expr_value); |
1880 | else | |
ddbe9812 RS |
1881 | { |
1882 | rtx lab = gen_label_rtx (); | |
1883 | ||
1884 | /* Compare the value with itself to reference it. */ | |
c5d5d461 JL |
1885 | emit_cmp_and_jump_insns (last_expr_value, last_expr_value, EQ, |
1886 | expand_expr (TYPE_SIZE (last_expr_type), | |
1887 | NULL_RTX, VOIDmode, 0), | |
1888 | BLKmode, 0, | |
1889 | TYPE_ALIGN (last_expr_type) / BITS_PER_UNIT, | |
1890 | lab); | |
ddbe9812 RS |
1891 | emit_label (lab); |
1892 | } | |
28d81abb RK |
1893 | } |
1894 | ||
1895 | /* If this expression is part of a ({...}) and is in memory, we may have | |
1896 | to preserve temporaries. */ | |
1897 | preserve_temp_slots (last_expr_value); | |
1898 | ||
1899 | /* Free any temporaries used to evaluate this expression. Any temporary | |
1900 | used as a result of this expression will already have been preserved | |
1901 | above. */ | |
1902 | free_temp_slots (); | |
1903 | ||
1904 | emit_queue (); | |
1905 | } | |
1906 | ||
1907 | /* Warn if EXP contains any computations whose results are not used. | |
1908 | Return 1 if a warning is printed; 0 otherwise. */ | |
1909 | ||
150a992a | 1910 | int |
28d81abb RK |
1911 | warn_if_unused_value (exp) |
1912 | tree exp; | |
1913 | { | |
1914 | if (TREE_USED (exp)) | |
1915 | return 0; | |
1916 | ||
1917 | switch (TREE_CODE (exp)) | |
1918 | { | |
1919 | case PREINCREMENT_EXPR: | |
1920 | case POSTINCREMENT_EXPR: | |
1921 | case PREDECREMENT_EXPR: | |
1922 | case POSTDECREMENT_EXPR: | |
1923 | case MODIFY_EXPR: | |
1924 | case INIT_EXPR: | |
1925 | case TARGET_EXPR: | |
1926 | case CALL_EXPR: | |
1927 | case METHOD_CALL_EXPR: | |
1928 | case RTL_EXPR: | |
81797aba | 1929 | case TRY_CATCH_EXPR: |
28d81abb RK |
1930 | case WITH_CLEANUP_EXPR: |
1931 | case EXIT_EXPR: | |
1932 | /* We don't warn about COND_EXPR because it may be a useful | |
1933 | construct if either arm contains a side effect. */ | |
1934 | case COND_EXPR: | |
1935 | return 0; | |
1936 | ||
1937 | case BIND_EXPR: | |
1938 | /* For a binding, warn if no side effect within it. */ | |
1939 | return warn_if_unused_value (TREE_OPERAND (exp, 1)); | |
1940 | ||
de73f171 RK |
1941 | case SAVE_EXPR: |
1942 | return warn_if_unused_value (TREE_OPERAND (exp, 1)); | |
1943 | ||
28d81abb RK |
1944 | case TRUTH_ORIF_EXPR: |
1945 | case TRUTH_ANDIF_EXPR: | |
1946 | /* In && or ||, warn if 2nd operand has no side effect. */ | |
1947 | return warn_if_unused_value (TREE_OPERAND (exp, 1)); | |
1948 | ||
1949 | case COMPOUND_EXPR: | |
a646a211 JM |
1950 | if (TREE_NO_UNUSED_WARNING (exp)) |
1951 | return 0; | |
28d81abb RK |
1952 | if (warn_if_unused_value (TREE_OPERAND (exp, 0))) |
1953 | return 1; | |
4d23e509 RS |
1954 | /* Let people do `(foo (), 0)' without a warning. */ |
1955 | if (TREE_CONSTANT (TREE_OPERAND (exp, 1))) | |
1956 | return 0; | |
28d81abb RK |
1957 | return warn_if_unused_value (TREE_OPERAND (exp, 1)); |
1958 | ||
1959 | case NOP_EXPR: | |
1960 | case CONVERT_EXPR: | |
b4ac57ab | 1961 | case NON_LVALUE_EXPR: |
28d81abb RK |
1962 | /* Don't warn about values cast to void. */ |
1963 | if (TREE_TYPE (exp) == void_type_node) | |
1964 | return 0; | |
1965 | /* Don't warn about conversions not explicit in the user's program. */ | |
1966 | if (TREE_NO_UNUSED_WARNING (exp)) | |
1967 | return 0; | |
1968 | /* Assignment to a cast usually results in a cast of a modify. | |
55cd1c09 JW |
1969 | Don't complain about that. There can be an arbitrary number of |
1970 | casts before the modify, so we must loop until we find the first | |
1971 | non-cast expression and then test to see if that is a modify. */ | |
1972 | { | |
1973 | tree tem = TREE_OPERAND (exp, 0); | |
1974 | ||
1975 | while (TREE_CODE (tem) == CONVERT_EXPR || TREE_CODE (tem) == NOP_EXPR) | |
1976 | tem = TREE_OPERAND (tem, 0); | |
1977 | ||
de73f171 RK |
1978 | if (TREE_CODE (tem) == MODIFY_EXPR || TREE_CODE (tem) == INIT_EXPR |
1979 | || TREE_CODE (tem) == CALL_EXPR) | |
55cd1c09 JW |
1980 | return 0; |
1981 | } | |
d1e1adfb | 1982 | goto warn; |
28d81abb | 1983 | |
d1e1adfb JM |
1984 | case INDIRECT_REF: |
1985 | /* Don't warn about automatic dereferencing of references, since | |
1986 | the user cannot control it. */ | |
1987 | if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == REFERENCE_TYPE) | |
1988 | return warn_if_unused_value (TREE_OPERAND (exp, 0)); | |
0f41302f | 1989 | /* ... fall through ... */ |
d1e1adfb | 1990 | |
28d81abb | 1991 | default: |
ddbe9812 RS |
1992 | /* Referencing a volatile value is a side effect, so don't warn. */ |
1993 | if ((TREE_CODE_CLASS (TREE_CODE (exp)) == 'd' | |
1994 | || TREE_CODE_CLASS (TREE_CODE (exp)) == 'r') | |
1995 | && TREE_THIS_VOLATILE (exp)) | |
1996 | return 0; | |
d1e1adfb | 1997 | warn: |
28d81abb RK |
1998 | warning_with_file_and_line (emit_filename, emit_lineno, |
1999 | "value computed is not used"); | |
2000 | return 1; | |
2001 | } | |
2002 | } | |
2003 | ||
2004 | /* Clear out the memory of the last expression evaluated. */ | |
2005 | ||
2006 | void | |
2007 | clear_last_expr () | |
2008 | { | |
2009 | last_expr_type = 0; | |
2010 | } | |
2011 | ||
2012 | /* Begin a statement which will return a value. | |
2013 | Return the RTL_EXPR for this statement expr. | |
2014 | The caller must save that value and pass it to expand_end_stmt_expr. */ | |
2015 | ||
2016 | tree | |
2017 | expand_start_stmt_expr () | |
2018 | { | |
ca695ac9 JB |
2019 | int momentary; |
2020 | tree t; | |
2021 | ||
28d81abb RK |
2022 | /* Make the RTL_EXPR node temporary, not momentary, |
2023 | so that rtl_expr_chain doesn't become garbage. */ | |
ca695ac9 JB |
2024 | momentary = suspend_momentary (); |
2025 | t = make_node (RTL_EXPR); | |
28d81abb | 2026 | resume_momentary (momentary); |
33c6ab80 | 2027 | do_pending_stack_adjust (); |
591ccf92 | 2028 | start_sequence_for_rtl_expr (t); |
28d81abb RK |
2029 | NO_DEFER_POP; |
2030 | expr_stmts_for_value++; | |
2031 | return t; | |
2032 | } | |
2033 | ||
2034 | /* Restore the previous state at the end of a statement that returns a value. | |
2035 | Returns a tree node representing the statement's value and the | |
2036 | insns to compute the value. | |
2037 | ||
2038 | The nodes of that expression have been freed by now, so we cannot use them. | |
2039 | But we don't want to do that anyway; the expression has already been | |
2040 | evaluated and now we just want to use the value. So generate a RTL_EXPR | |
2041 | with the proper type and RTL value. | |
2042 | ||
2043 | If the last substatement was not an expression, | |
2044 | return something with type `void'. */ | |
2045 | ||
2046 | tree | |
2047 | expand_end_stmt_expr (t) | |
2048 | tree t; | |
2049 | { | |
2050 | OK_DEFER_POP; | |
2051 | ||
2052 | if (last_expr_type == 0) | |
2053 | { | |
2054 | last_expr_type = void_type_node; | |
2055 | last_expr_value = const0_rtx; | |
2056 | } | |
2057 | else if (last_expr_value == 0) | |
2058 | /* There are some cases where this can happen, such as when the | |
2059 | statement is void type. */ | |
2060 | last_expr_value = const0_rtx; | |
2061 | else if (GET_CODE (last_expr_value) != REG && ! CONSTANT_P (last_expr_value)) | |
2062 | /* Remove any possible QUEUED. */ | |
2063 | last_expr_value = protect_from_queue (last_expr_value, 0); | |
2064 | ||
2065 | emit_queue (); | |
2066 | ||
2067 | TREE_TYPE (t) = last_expr_type; | |
2068 | RTL_EXPR_RTL (t) = last_expr_value; | |
2069 | RTL_EXPR_SEQUENCE (t) = get_insns (); | |
2070 | ||
2071 | rtl_expr_chain = tree_cons (NULL_TREE, t, rtl_expr_chain); | |
2072 | ||
2073 | end_sequence (); | |
2074 | ||
2075 | /* Don't consider deleting this expr or containing exprs at tree level. */ | |
2076 | TREE_SIDE_EFFECTS (t) = 1; | |
2077 | /* Propagate volatility of the actual RTL expr. */ | |
2078 | TREE_THIS_VOLATILE (t) = volatile_refs_p (last_expr_value); | |
2079 | ||
2080 | last_expr_type = 0; | |
2081 | expr_stmts_for_value--; | |
2082 | ||
2083 | return t; | |
2084 | } | |
2085 | \f | |
28d81abb RK |
2086 | /* Generate RTL for the start of an if-then. COND is the expression |
2087 | whose truth should be tested. | |
2088 | ||
2089 | If EXITFLAG is nonzero, this conditional is visible to | |
2090 | `exit_something'. */ | |
2091 | ||
2092 | void | |
2093 | expand_start_cond (cond, exitflag) | |
2094 | tree cond; | |
2095 | int exitflag; | |
2096 | { | |
2097 | struct nesting *thiscond = ALLOC_NESTING (); | |
2098 | ||
2099 | /* Make an entry on cond_stack for the cond we are entering. */ | |
2100 | ||
2101 | thiscond->next = cond_stack; | |
2102 | thiscond->all = nesting_stack; | |
2103 | thiscond->depth = ++nesting_depth; | |
2104 | thiscond->data.cond.next_label = gen_label_rtx (); | |
2105 | /* Before we encounter an `else', we don't need a separate exit label | |
2106 | unless there are supposed to be exit statements | |
2107 | to exit this conditional. */ | |
2108 | thiscond->exit_label = exitflag ? gen_label_rtx () : 0; | |
2109 | thiscond->data.cond.endif_label = thiscond->exit_label; | |
2110 | cond_stack = thiscond; | |
2111 | nesting_stack = thiscond; | |
2112 | ||
b93a436e | 2113 | do_jump (cond, thiscond->data.cond.next_label, NULL_RTX); |
28d81abb RK |
2114 | } |
2115 | ||
2116 | /* Generate RTL between then-clause and the elseif-clause | |
2117 | of an if-then-elseif-.... */ | |
2118 | ||
2119 | void | |
2120 | expand_start_elseif (cond) | |
2121 | tree cond; | |
2122 | { | |
2123 | if (cond_stack->data.cond.endif_label == 0) | |
2124 | cond_stack->data.cond.endif_label = gen_label_rtx (); | |
2125 | emit_jump (cond_stack->data.cond.endif_label); | |
2126 | emit_label (cond_stack->data.cond.next_label); | |
2127 | cond_stack->data.cond.next_label = gen_label_rtx (); | |
37366632 | 2128 | do_jump (cond, cond_stack->data.cond.next_label, NULL_RTX); |
28d81abb RK |
2129 | } |
2130 | ||
2131 | /* Generate RTL between the then-clause and the else-clause | |
2132 | of an if-then-else. */ | |
2133 | ||
2134 | void | |
2135 | expand_start_else () | |
2136 | { | |
2137 | if (cond_stack->data.cond.endif_label == 0) | |
2138 | cond_stack->data.cond.endif_label = gen_label_rtx (); | |
ca695ac9 | 2139 | |
28d81abb RK |
2140 | emit_jump (cond_stack->data.cond.endif_label); |
2141 | emit_label (cond_stack->data.cond.next_label); | |
0f41302f | 2142 | cond_stack->data.cond.next_label = 0; /* No more _else or _elseif calls. */ |
28d81abb RK |
2143 | } |
2144 | ||
d947ba59 RK |
2145 | /* After calling expand_start_else, turn this "else" into an "else if" |
2146 | by providing another condition. */ | |
2147 | ||
2148 | void | |
2149 | expand_elseif (cond) | |
2150 | tree cond; | |
2151 | { | |
2152 | cond_stack->data.cond.next_label = gen_label_rtx (); | |
2153 | do_jump (cond, cond_stack->data.cond.next_label, NULL_RTX); | |
2154 | } | |
2155 | ||
28d81abb RK |
2156 | /* Generate RTL for the end of an if-then. |
2157 | Pop the record for it off of cond_stack. */ | |
2158 | ||
2159 | void | |
2160 | expand_end_cond () | |
2161 | { | |
2162 | struct nesting *thiscond = cond_stack; | |
2163 | ||
b93a436e JL |
2164 | do_pending_stack_adjust (); |
2165 | if (thiscond->data.cond.next_label) | |
2166 | emit_label (thiscond->data.cond.next_label); | |
2167 | if (thiscond->data.cond.endif_label) | |
2168 | emit_label (thiscond->data.cond.endif_label); | |
28d81abb RK |
2169 | |
2170 | POPSTACK (cond_stack); | |
2171 | last_expr_type = 0; | |
2172 | } | |
ca695ac9 JB |
2173 | |
2174 | ||
28d81abb RK |
2175 | \f |
2176 | /* Generate RTL for the start of a loop. EXIT_FLAG is nonzero if this | |
2177 | loop should be exited by `exit_something'. This is a loop for which | |
2178 | `expand_continue' will jump to the top of the loop. | |
2179 | ||
2180 | Make an entry on loop_stack to record the labels associated with | |
2181 | this loop. */ | |
2182 | ||
2183 | struct nesting * | |
2184 | expand_start_loop (exit_flag) | |
2185 | int exit_flag; | |
2186 | { | |
2187 | register struct nesting *thisloop = ALLOC_NESTING (); | |
2188 | ||
2189 | /* Make an entry on loop_stack for the loop we are entering. */ | |
2190 | ||
2191 | thisloop->next = loop_stack; | |
2192 | thisloop->all = nesting_stack; | |
2193 | thisloop->depth = ++nesting_depth; | |
2194 | thisloop->data.loop.start_label = gen_label_rtx (); | |
2195 | thisloop->data.loop.end_label = gen_label_rtx (); | |
8afad312 | 2196 | thisloop->data.loop.alt_end_label = 0; |
28d81abb RK |
2197 | thisloop->data.loop.continue_label = thisloop->data.loop.start_label; |
2198 | thisloop->exit_label = exit_flag ? thisloop->data.loop.end_label : 0; | |
2199 | loop_stack = thisloop; | |
2200 | nesting_stack = thisloop; | |
2201 | ||
2202 | do_pending_stack_adjust (); | |
2203 | emit_queue (); | |
37366632 | 2204 | emit_note (NULL_PTR, NOTE_INSN_LOOP_BEG); |
28d81abb RK |
2205 | emit_label (thisloop->data.loop.start_label); |
2206 | ||
2207 | return thisloop; | |
2208 | } | |
2209 | ||
2210 | /* Like expand_start_loop but for a loop where the continuation point | |
2211 | (for expand_continue_loop) will be specified explicitly. */ | |
2212 | ||
2213 | struct nesting * | |
2214 | expand_start_loop_continue_elsewhere (exit_flag) | |
2215 | int exit_flag; | |
2216 | { | |
2217 | struct nesting *thisloop = expand_start_loop (exit_flag); | |
2218 | loop_stack->data.loop.continue_label = gen_label_rtx (); | |
2219 | return thisloop; | |
2220 | } | |
2221 | ||
2222 | /* Specify the continuation point for a loop started with | |
2223 | expand_start_loop_continue_elsewhere. | |
2224 | Use this at the point in the code to which a continue statement | |
2225 | should jump. */ | |
2226 | ||
2227 | void | |
2228 | expand_loop_continue_here () | |
2229 | { | |
2230 | do_pending_stack_adjust (); | |
37366632 | 2231 | emit_note (NULL_PTR, NOTE_INSN_LOOP_CONT); |
28d81abb RK |
2232 | emit_label (loop_stack->data.loop.continue_label); |
2233 | } | |
2234 | ||
2235 | /* Finish a loop. Generate a jump back to the top and the loop-exit label. | |
2236 | Pop the block off of loop_stack. */ | |
2237 | ||
2238 | void | |
2239 | expand_end_loop () | |
2240 | { | |
0720f6fb MM |
2241 | rtx start_label = loop_stack->data.loop.start_label; |
2242 | rtx insn = get_last_insn (); | |
a7d308f7 | 2243 | int needs_end_jump = 1; |
28d81abb RK |
2244 | |
2245 | /* Mark the continue-point at the top of the loop if none elsewhere. */ | |
2246 | if (start_label == loop_stack->data.loop.continue_label) | |
2247 | emit_note_before (NOTE_INSN_LOOP_CONT, start_label); | |
2248 | ||
2249 | do_pending_stack_adjust (); | |
2250 | ||
a7d308f7 R |
2251 | /* If optimizing, perhaps reorder the loop. |
2252 | First, try to use a condjump near the end. | |
2253 | expand_exit_loop_if_false ends loops with unconditional jumps, | |
2254 | like this: | |
2255 | ||
2256 | if (test) goto label; | |
2257 | optional: cleanup | |
2258 | goto loop_stack->data.loop.end_label | |
2259 | barrier | |
2260 | label: | |
2261 | ||
2262 | If we find such a pattern, we can end the loop earlier. */ | |
2263 | ||
2264 | if (optimize | |
2265 | && GET_CODE (insn) == CODE_LABEL | |
2266 | && LABEL_NAME (insn) == NULL | |
2267 | && GET_CODE (PREV_INSN (insn)) == BARRIER) | |
2268 | { | |
2269 | rtx label = insn; | |
2270 | rtx jump = PREV_INSN (PREV_INSN (label)); | |
2271 | ||
2272 | if (GET_CODE (jump) == JUMP_INSN | |
2273 | && GET_CODE (PATTERN (jump)) == SET | |
2274 | && SET_DEST (PATTERN (jump)) == pc_rtx | |
2275 | && GET_CODE (SET_SRC (PATTERN (jump))) == LABEL_REF | |
2276 | && (XEXP (SET_SRC (PATTERN (jump)), 0) | |
2277 | == loop_stack->data.loop.end_label)) | |
2278 | { | |
2279 | rtx prev; | |
2280 | ||
2281 | /* The test might be complex and reference LABEL multiple times, | |
2282 | like the loop in loop_iterations to set vtop. To handle this, | |
2283 | we move LABEL. */ | |
2284 | insn = PREV_INSN (label); | |
2285 | reorder_insns (label, label, start_label); | |
2286 | ||
2287 | for (prev = PREV_INSN (jump); ; prev = PREV_INSN (prev)) | |
2288 | { | |
2289 | /* We ignore line number notes, but if we see any other note, | |
2290 | in particular NOTE_INSN_BLOCK_*, NOTE_INSN_EH_REGION_*, | |
2291 | NOTE_INSN_LOOP_*, we disable this optimization. */ | |
2292 | if (GET_CODE (prev) == NOTE) | |
2293 | { | |
2294 | if (NOTE_LINE_NUMBER (prev) < 0) | |
2295 | break; | |
2296 | continue; | |
2297 | } | |
2298 | if (GET_CODE (prev) == CODE_LABEL) | |
2299 | break; | |
2300 | if (GET_CODE (prev) == JUMP_INSN) | |
2301 | { | |
2302 | if (GET_CODE (PATTERN (prev)) == SET | |
2303 | && SET_DEST (PATTERN (prev)) == pc_rtx | |
2304 | && GET_CODE (SET_SRC (PATTERN (prev))) == IF_THEN_ELSE | |
2305 | && (GET_CODE (XEXP (SET_SRC (PATTERN (prev)), 1)) | |
2306 | == LABEL_REF) | |
2307 | && XEXP (XEXP (SET_SRC (PATTERN (prev)), 1), 0) == label) | |
2308 | { | |
2309 | XEXP (XEXP (SET_SRC (PATTERN (prev)), 1), 0) | |
2310 | = start_label; | |
2311 | emit_note_after (NOTE_INSN_LOOP_END, prev); | |
2312 | needs_end_jump = 0; | |
2313 | } | |
2314 | break; | |
2315 | } | |
2316 | } | |
2317 | } | |
2318 | } | |
2319 | ||
2320 | /* If the loop starts with a loop exit, roll that to the end where | |
2321 | it will optimize together with the jump back. | |
93de5c31 MM |
2322 | |
2323 | We look for the conditional branch to the exit, except that once | |
2324 | we find such a branch, we don't look past 30 instructions. | |
2325 | ||
2326 | In more detail, if the loop presently looks like this (in pseudo-C): | |
2327 | ||
2328 | start_label: | |
2329 | if (test) goto end_label; | |
2330 | body; | |
2331 | goto start_label; | |
0720f6fb | 2332 | end_label: |
93de5c31 MM |
2333 | |
2334 | transform it to look like: | |
2335 | ||
2336 | goto start_label; | |
2337 | newstart_label: | |
2338 | body; | |
2339 | start_label: | |
2340 | if (test) goto end_label; | |
2341 | goto newstart_label; | |
0720f6fb | 2342 | end_label: |
93de5c31 MM |
2343 | |
2344 | Here, the `test' may actually consist of some reasonably complex | |
2345 | code, terminating in a test. */ | |
0720f6fb | 2346 | |
28d81abb | 2347 | if (optimize |
a7d308f7 | 2348 | && needs_end_jump |
28d81abb RK |
2349 | && |
2350 | ! (GET_CODE (insn) == JUMP_INSN | |
2351 | && GET_CODE (PATTERN (insn)) == SET | |
2352 | && SET_DEST (PATTERN (insn)) == pc_rtx | |
2353 | && GET_CODE (SET_SRC (PATTERN (insn))) == IF_THEN_ELSE)) | |
2354 | { | |
93de5c31 | 2355 | int eh_regions = 0; |
0720f6fb MM |
2356 | int num_insns = 0; |
2357 | rtx last_test_insn = NULL_RTX; | |
93de5c31 | 2358 | |
28d81abb RK |
2359 | /* Scan insns from the top of the loop looking for a qualified |
2360 | conditional exit. */ | |
2361 | for (insn = NEXT_INSN (loop_stack->data.loop.start_label); insn; | |
2362 | insn = NEXT_INSN (insn)) | |
2363 | { | |
93de5c31 MM |
2364 | if (GET_CODE (insn) == NOTE) |
2365 | { | |
2366 | if (optimize < 2 | |
2367 | && (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG | |
2368 | || NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)) | |
2369 | /* The code that actually moves the exit test will | |
2370 | carefully leave BLOCK notes in their original | |
2371 | location. That means, however, that we can't debug | |
2372 | the exit test itself. So, we refuse to move code | |
2373 | containing BLOCK notes at low optimization levels. */ | |
2374 | break; | |
2375 | ||
2376 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG) | |
2377 | ++eh_regions; | |
2378 | else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END) | |
2379 | { | |
2380 | --eh_regions; | |
2381 | if (eh_regions < 0) | |
2382 | /* We've come to the end of an EH region, but | |
2383 | never saw the beginning of that region. That | |
2384 | means that an EH region begins before the top | |
2385 | of the loop, and ends in the middle of it. The | |
2386 | existence of such a situation violates a basic | |
2387 | assumption in this code, since that would imply | |
2388 | that even when EH_REGIONS is zero, we might | |
2389 | move code out of an exception region. */ | |
2390 | abort (); | |
2391 | } | |
28d81abb | 2392 | |
f114df20 JL |
2393 | /* We must not walk into a nested loop. */ |
2394 | if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG) | |
2395 | break; | |
2396 | ||
93de5c31 MM |
2397 | /* We already know this INSN is a NOTE, so there's no |
2398 | point in looking at it to see if it's a JUMP. */ | |
2399 | continue; | |
2400 | } | |
28d81abb RK |
2401 | |
2402 | if (GET_CODE (insn) == JUMP_INSN || GET_CODE (insn) == INSN) | |
2403 | num_insns++; | |
2404 | ||
2405 | if (last_test_insn && num_insns > 30) | |
2406 | break; | |
2407 | ||
93de5c31 MM |
2408 | if (eh_regions > 0) |
2409 | /* We don't want to move a partial EH region. Consider: | |
2410 | ||
2411 | while ( ( { try { | |
2412 | if (cond ()) 0; | |
2413 | else { | |
2414 | bar(); | |
2415 | 1; | |
2416 | } | |
2417 | } catch (...) { | |
2418 | 1; | |
2419 | } )) { | |
2420 | body; | |
2421 | } | |
2422 | ||
2423 | This isn't legal C++, but here's what it's supposed to | |
2424 | mean: if cond() is true, stop looping. Otherwise, | |
2425 | call bar, and keep looping. In addition, if cond | |
2426 | throws an exception, catch it and keep looping. Such | |
2427 | constructs are certainy legal in LISP. | |
2428 | ||
2429 | We should not move the `if (cond()) 0' test since then | |
2430 | the EH-region for the try-block would be broken up. | |
2431 | (In this case we would the EH_BEG note for the `try' | |
2432 | and `if cond()' but not the call to bar() or the | |
2433 | EH_END note.) | |
2434 | ||
2435 | So we don't look for tests within an EH region. */ | |
2436 | continue; | |
2437 | ||
0720f6fb | 2438 | if (GET_CODE (insn) == JUMP_INSN |
28d81abb | 2439 | && GET_CODE (PATTERN (insn)) == SET |
0720f6fb MM |
2440 | && SET_DEST (PATTERN (insn)) == pc_rtx) |
2441 | { | |
2442 | /* This is indeed a jump. */ | |
2443 | rtx dest1 = NULL_RTX; | |
2444 | rtx dest2 = NULL_RTX; | |
2445 | rtx potential_last_test; | |
2446 | if (GET_CODE (SET_SRC (PATTERN (insn))) == IF_THEN_ELSE) | |
2447 | { | |
2448 | /* A conditional jump. */ | |
2449 | dest1 = XEXP (SET_SRC (PATTERN (insn)), 1); | |
2450 | dest2 = XEXP (SET_SRC (PATTERN (insn)), 2); | |
2451 | potential_last_test = insn; | |
2452 | } | |
2453 | else | |
2454 | { | |
2455 | /* An unconditional jump. */ | |
2456 | dest1 = SET_SRC (PATTERN (insn)); | |
2457 | /* Include the BARRIER after the JUMP. */ | |
2458 | potential_last_test = NEXT_INSN (insn); | |
2459 | } | |
2460 | ||
2461 | do { | |
2462 | if (dest1 && GET_CODE (dest1) == LABEL_REF | |
2463 | && ((XEXP (dest1, 0) | |
2464 | == loop_stack->data.loop.alt_end_label) | |
2465 | || (XEXP (dest1, 0) | |
2466 | == loop_stack->data.loop.end_label))) | |
2467 | { | |
2468 | last_test_insn = potential_last_test; | |
2469 | break; | |
2470 | } | |
2471 | ||
2472 | /* If this was a conditional jump, there may be | |
2473 | another label at which we should look. */ | |
2474 | dest1 = dest2; | |
2475 | dest2 = NULL_RTX; | |
2476 | } while (dest1); | |
2477 | } | |
28d81abb RK |
2478 | } |
2479 | ||
2480 | if (last_test_insn != 0 && last_test_insn != get_last_insn ()) | |
2481 | { | |
2482 | /* We found one. Move everything from there up | |
2483 | to the end of the loop, and add a jump into the loop | |
2484 | to jump to there. */ | |
2485 | register rtx newstart_label = gen_label_rtx (); | |
2486 | register rtx start_move = start_label; | |
93de5c31 | 2487 | rtx next_insn; |
28d81abb | 2488 | |
b4ac57ab | 2489 | /* If the start label is preceded by a NOTE_INSN_LOOP_CONT note, |
28d81abb RK |
2490 | then we want to move this note also. */ |
2491 | if (GET_CODE (PREV_INSN (start_move)) == NOTE | |
2492 | && (NOTE_LINE_NUMBER (PREV_INSN (start_move)) | |
2493 | == NOTE_INSN_LOOP_CONT)) | |
2494 | start_move = PREV_INSN (start_move); | |
2495 | ||
2496 | emit_label_after (newstart_label, PREV_INSN (start_move)); | |
93de5c31 MM |
2497 | |
2498 | /* Actually move the insns. Start at the beginning, and | |
2499 | keep copying insns until we've copied the | |
2500 | last_test_insn. */ | |
2501 | for (insn = start_move; insn; insn = next_insn) | |
2502 | { | |
2503 | /* Figure out which insn comes after this one. We have | |
2504 | to do this before we move INSN. */ | |
2505 | if (insn == last_test_insn) | |
2506 | /* We've moved all the insns. */ | |
2507 | next_insn = NULL_RTX; | |
2508 | else | |
2509 | next_insn = NEXT_INSN (insn); | |
2510 | ||
2511 | if (GET_CODE (insn) == NOTE | |
2512 | && (NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_BEG | |
2513 | || NOTE_LINE_NUMBER (insn) == NOTE_INSN_BLOCK_END)) | |
2514 | /* We don't want to move NOTE_INSN_BLOCK_BEGs or | |
2515 | NOTE_INSN_BLOCK_ENDs because the correct generation | |
2516 | of debugging information depends on these appearing | |
2517 | in the same order in the RTL and in the tree | |
2518 | structure, where they are represented as BLOCKs. | |
2519 | So, we don't move block notes. Of course, moving | |
2520 | the code inside the block is likely to make it | |
2521 | impossible to debug the instructions in the exit | |
2522 | test, but such is the price of optimization. */ | |
2523 | continue; | |
2524 | ||
2525 | /* Move the INSN. */ | |
2526 | reorder_insns (insn, insn, get_last_insn ()); | |
2527 | } | |
2528 | ||
28d81abb RK |
2529 | emit_jump_insn_after (gen_jump (start_label), |
2530 | PREV_INSN (newstart_label)); | |
2531 | emit_barrier_after (PREV_INSN (newstart_label)); | |
2532 | start_label = newstart_label; | |
2533 | } | |
2534 | } | |
2535 | ||
a7d308f7 R |
2536 | if (needs_end_jump) |
2537 | { | |
2538 | emit_jump (start_label); | |
2539 | emit_note (NULL_PTR, NOTE_INSN_LOOP_END); | |
2540 | } | |
28d81abb RK |
2541 | emit_label (loop_stack->data.loop.end_label); |
2542 | ||
2543 | POPSTACK (loop_stack); | |
2544 | ||
2545 | last_expr_type = 0; | |
2546 | } | |
2547 | ||
2548 | /* Generate a jump to the current loop's continue-point. | |
2549 | This is usually the top of the loop, but may be specified | |
2550 | explicitly elsewhere. If not currently inside a loop, | |
2551 | return 0 and do nothing; caller will print an error message. */ | |
2552 | ||
2553 | int | |
2554 | expand_continue_loop (whichloop) | |
2555 | struct nesting *whichloop; | |
2556 | { | |
2557 | last_expr_type = 0; | |
2558 | if (whichloop == 0) | |
2559 | whichloop = loop_stack; | |
2560 | if (whichloop == 0) | |
2561 | return 0; | |
37366632 RK |
2562 | expand_goto_internal (NULL_TREE, whichloop->data.loop.continue_label, |
2563 | NULL_RTX); | |
28d81abb RK |
2564 | return 1; |
2565 | } | |
2566 | ||
2567 | /* Generate a jump to exit the current loop. If not currently inside a loop, | |
2568 | return 0 and do nothing; caller will print an error message. */ | |
2569 | ||
2570 | int | |
2571 | expand_exit_loop (whichloop) | |
2572 | struct nesting *whichloop; | |
2573 | { | |
2574 | last_expr_type = 0; | |
2575 | if (whichloop == 0) | |
2576 | whichloop = loop_stack; | |
2577 | if (whichloop == 0) | |
2578 | return 0; | |
37366632 | 2579 | expand_goto_internal (NULL_TREE, whichloop->data.loop.end_label, NULL_RTX); |
28d81abb RK |
2580 | return 1; |
2581 | } | |
2582 | ||
2583 | /* Generate a conditional jump to exit the current loop if COND | |
2584 | evaluates to zero. If not currently inside a loop, | |
2585 | return 0 and do nothing; caller will print an error message. */ | |
2586 | ||
2587 | int | |
2588 | expand_exit_loop_if_false (whichloop, cond) | |
2589 | struct nesting *whichloop; | |
2590 | tree cond; | |
2591 | { | |
b93a436e JL |
2592 | rtx label = gen_label_rtx (); |
2593 | rtx last_insn; | |
28d81abb | 2594 | last_expr_type = 0; |
b93a436e | 2595 | |
28d81abb RK |
2596 | if (whichloop == 0) |
2597 | whichloop = loop_stack; | |
2598 | if (whichloop == 0) | |
2599 | return 0; | |
b93a436e JL |
2600 | /* In order to handle fixups, we actually create a conditional jump |
2601 | around a unconditional branch to exit the loop. If fixups are | |
2602 | necessary, they go before the unconditional branch. */ | |
d902c7ea | 2603 | |
b93a436e JL |
2604 | |
2605 | do_jump (cond, NULL_RTX, label); | |
2606 | last_insn = get_last_insn (); | |
2607 | if (GET_CODE (last_insn) == CODE_LABEL) | |
2608 | whichloop->data.loop.alt_end_label = last_insn; | |
2609 | expand_goto_internal (NULL_TREE, whichloop->data.loop.end_label, | |
2610 | NULL_RTX); | |
2611 | emit_label (label); | |
ca695ac9 | 2612 | |
28d81abb RK |
2613 | return 1; |
2614 | } | |
2615 | ||
4a050cc2 JL |
2616 | /* Return nonzero if the loop nest is empty. Else return zero. */ |
2617 | ||
2618 | int | |
2619 | stmt_loop_nest_empty () | |
2620 | { | |
2621 | return (loop_stack == NULL); | |
2622 | } | |
2623 | ||
28d81abb RK |
2624 | /* Return non-zero if we should preserve sub-expressions as separate |
2625 | pseudos. We never do so if we aren't optimizing. We always do so | |
2626 | if -fexpensive-optimizations. | |
2627 | ||
2628 | Otherwise, we only do so if we are in the "early" part of a loop. I.e., | |
2629 | the loop may still be a small one. */ | |
2630 | ||
2631 | int | |
2632 | preserve_subexpressions_p () | |
2633 | { | |
2634 | rtx insn; | |
2635 | ||
2636 | if (flag_expensive_optimizations) | |
2637 | return 1; | |
2638 | ||
01d939e8 | 2639 | if (optimize == 0 || cfun == 0 || cfun->stmt == 0 || loop_stack == 0) |
28d81abb RK |
2640 | return 0; |
2641 | ||
2642 | insn = get_last_insn_anywhere (); | |
2643 | ||
2644 | return (insn | |
2645 | && (INSN_UID (insn) - INSN_UID (loop_stack->data.loop.start_label) | |
2646 | < n_non_fixed_regs * 3)); | |
2647 | ||
2648 | } | |
2649 | ||
2650 | /* Generate a jump to exit the current loop, conditional, binding contour | |
2651 | or case statement. Not all such constructs are visible to this function, | |
2652 | only those started with EXIT_FLAG nonzero. Individual languages use | |
2653 | the EXIT_FLAG parameter to control which kinds of constructs you can | |
2654 | exit this way. | |
2655 | ||
2656 | If not currently inside anything that can be exited, | |
2657 | return 0 and do nothing; caller will print an error message. */ | |
2658 | ||
2659 | int | |
2660 | expand_exit_something () | |
2661 | { | |
2662 | struct nesting *n; | |
2663 | last_expr_type = 0; | |
2664 | for (n = nesting_stack; n; n = n->all) | |
2665 | if (n->exit_label != 0) | |
2666 | { | |
37366632 | 2667 | expand_goto_internal (NULL_TREE, n->exit_label, NULL_RTX); |
28d81abb RK |
2668 | return 1; |
2669 | } | |
2670 | ||
2671 | return 0; | |
2672 | } | |
2673 | \f | |
2674 | /* Generate RTL to return from the current function, with no value. | |
2675 | (That is, we do not do anything about returning any value.) */ | |
2676 | ||
2677 | void | |
2678 | expand_null_return () | |
2679 | { | |
2680 | struct nesting *block = block_stack; | |
bd695e1e RH |
2681 | rtx last_insn = get_last_insn (); |
2682 | ||
2683 | /* If this function was declared to return a value, but we | |
2684 | didn't, clobber the return registers so that they are not | |
2685 | propogated live to the rest of the function. */ | |
c13fde05 | 2686 | clobber_return_register (); |
28d81abb RK |
2687 | |
2688 | /* Does any pending block have cleanups? */ | |
28d81abb RK |
2689 | while (block && block->data.block.cleanups == 0) |
2690 | block = block->next; | |
2691 | ||
2692 | /* If yes, use a goto to return, since that runs cleanups. */ | |
2693 | ||
2694 | expand_null_return_1 (last_insn, block != 0); | |
2695 | } | |
2696 | ||
2697 | /* Generate RTL to return from the current function, with value VAL. */ | |
2698 | ||
8d800403 | 2699 | static void |
28d81abb RK |
2700 | expand_value_return (val) |
2701 | rtx val; | |
2702 | { | |
2703 | struct nesting *block = block_stack; | |
2704 | rtx last_insn = get_last_insn (); | |
2705 | rtx return_reg = DECL_RTL (DECL_RESULT (current_function_decl)); | |
2706 | ||
2707 | /* Copy the value to the return location | |
2708 | unless it's already there. */ | |
2709 | ||
2710 | if (return_reg != val) | |
77636079 | 2711 | { |
77636079 | 2712 | tree type = TREE_TYPE (DECL_RESULT (current_function_decl)); |
37877eb0 | 2713 | #ifdef PROMOTE_FUNCTION_RETURN |
77636079 | 2714 | int unsignedp = TREE_UNSIGNED (type); |
14a774a9 RK |
2715 | enum machine_mode old_mode |
2716 | = DECL_MODE (DECL_RESULT (current_function_decl)); | |
28612f9e | 2717 | enum machine_mode mode |
14a774a9 | 2718 | = promote_mode (type, old_mode, &unsignedp, 1); |
77636079 | 2719 | |
14a774a9 RK |
2720 | if (mode != old_mode) |
2721 | val = convert_modes (mode, old_mode, val, unsignedp); | |
77636079 | 2722 | #endif |
14a774a9 RK |
2723 | if (GET_CODE (return_reg) == PARALLEL) |
2724 | emit_group_load (return_reg, val, int_size_in_bytes (type), | |
2725 | TYPE_ALIGN (type) / BITS_PER_UNIT); | |
2726 | else | |
77636079 RS |
2727 | emit_move_insn (return_reg, val); |
2728 | } | |
14a774a9 | 2729 | |
28d81abb RK |
2730 | /* Does any pending block have cleanups? */ |
2731 | ||
2732 | while (block && block->data.block.cleanups == 0) | |
2733 | block = block->next; | |
2734 | ||
2735 | /* If yes, use a goto to return, since that runs cleanups. | |
2736 | Use LAST_INSN to put cleanups *before* the move insn emitted above. */ | |
2737 | ||
2738 | expand_null_return_1 (last_insn, block != 0); | |
2739 | } | |
2740 | ||
2741 | /* Output a return with no value. If LAST_INSN is nonzero, | |
2742 | pretend that the return takes place after LAST_INSN. | |
2743 | If USE_GOTO is nonzero then don't use a return instruction; | |
2744 | go to the return label instead. This causes any cleanups | |
2745 | of pending blocks to be executed normally. */ | |
2746 | ||
2747 | static void | |
2748 | expand_null_return_1 (last_insn, use_goto) | |
2749 | rtx last_insn; | |
2750 | int use_goto; | |
2751 | { | |
2752 | rtx end_label = cleanup_label ? cleanup_label : return_label; | |
2753 | ||
2754 | clear_pending_stack_adjust (); | |
2755 | do_pending_stack_adjust (); | |
2756 | last_expr_type = 0; | |
2757 | ||
2758 | /* PCC-struct return always uses an epilogue. */ | |
2759 | if (current_function_returns_pcc_struct || use_goto) | |
2760 | { | |
2761 | if (end_label == 0) | |
2762 | end_label = return_label = gen_label_rtx (); | |
37366632 | 2763 | expand_goto_internal (NULL_TREE, end_label, last_insn); |
28d81abb RK |
2764 | return; |
2765 | } | |
2766 | ||
2767 | /* Otherwise output a simple return-insn if one is available, | |
2768 | unless it won't do the job. */ | |
2769 | #ifdef HAVE_return | |
2770 | if (HAVE_return && use_goto == 0 && cleanup_label == 0) | |
2771 | { | |
2772 | emit_jump_insn (gen_return ()); | |
2773 | emit_barrier (); | |
2774 | return; | |
2775 | } | |
2776 | #endif | |
2777 | ||
2778 | /* Otherwise jump to the epilogue. */ | |
37366632 | 2779 | expand_goto_internal (NULL_TREE, end_label, last_insn); |
28d81abb RK |
2780 | } |
2781 | \f | |
2782 | /* Generate RTL to evaluate the expression RETVAL and return it | |
2783 | from the current function. */ | |
2784 | ||
2785 | void | |
2786 | expand_return (retval) | |
2787 | tree retval; | |
2788 | { | |
2789 | /* If there are any cleanups to be performed, then they will | |
2790 | be inserted following LAST_INSN. It is desirable | |
2791 | that the last_insn, for such purposes, should be the | |
2792 | last insn before computing the return value. Otherwise, cleanups | |
2793 | which call functions can clobber the return value. */ | |
2794 | /* ??? rms: I think that is erroneous, because in C++ it would | |
2795 | run destructors on variables that might be used in the subsequent | |
2796 | computation of the return value. */ | |
2797 | rtx last_insn = 0; | |
14a774a9 | 2798 | rtx result_rtl = DECL_RTL (DECL_RESULT (current_function_decl)); |
28d81abb | 2799 | register rtx val = 0; |
7bdb32b9 | 2800 | #ifdef HAVE_return |
28d81abb | 2801 | register rtx op0; |
7bdb32b9 | 2802 | #endif |
28d81abb RK |
2803 | tree retval_rhs; |
2804 | int cleanups; | |
28d81abb RK |
2805 | |
2806 | /* If function wants no value, give it none. */ | |
2807 | if (TREE_CODE (TREE_TYPE (TREE_TYPE (current_function_decl))) == VOID_TYPE) | |
2808 | { | |
37366632 | 2809 | expand_expr (retval, NULL_RTX, VOIDmode, 0); |
7e70e7c5 | 2810 | emit_queue (); |
28d81abb RK |
2811 | expand_null_return (); |
2812 | return; | |
2813 | } | |
2814 | ||
2815 | /* Are any cleanups needed? E.g. C++ destructors to be run? */ | |
7a9a00be MS |
2816 | /* This is not sufficient. We also need to watch for cleanups of the |
2817 | expression we are about to expand. Unfortunately, we cannot know | |
2818 | if it has cleanups until we expand it, and we want to change how we | |
2819 | expand it depending upon if we need cleanups. We can't win. */ | |
2820 | #if 0 | |
28d81abb | 2821 | cleanups = any_pending_cleanups (1); |
7a9a00be MS |
2822 | #else |
2823 | cleanups = 1; | |
2824 | #endif | |
28d81abb RK |
2825 | |
2826 | if (TREE_CODE (retval) == RESULT_DECL) | |
2827 | retval_rhs = retval; | |
2828 | else if ((TREE_CODE (retval) == MODIFY_EXPR || TREE_CODE (retval) == INIT_EXPR) | |
2829 | && TREE_CODE (TREE_OPERAND (retval, 0)) == RESULT_DECL) | |
2830 | retval_rhs = TREE_OPERAND (retval, 1); | |
2831 | else if (TREE_TYPE (retval) == void_type_node) | |
2832 | /* Recognize tail-recursive call to void function. */ | |
2833 | retval_rhs = retval; | |
2834 | else | |
2835 | retval_rhs = NULL_TREE; | |
2836 | ||
2837 | /* Only use `last_insn' if there are cleanups which must be run. */ | |
2838 | if (cleanups || cleanup_label != 0) | |
2839 | last_insn = get_last_insn (); | |
2840 | ||
2841 | /* Distribute return down conditional expr if either of the sides | |
2842 | may involve tail recursion (see test below). This enhances the number | |
2843 | of tail recursions we see. Don't do this always since it can produce | |
2844 | sub-optimal code in some cases and we distribute assignments into | |
2845 | conditional expressions when it would help. */ | |
2846 | ||
2847 | if (optimize && retval_rhs != 0 | |
2848 | && frame_offset == 0 | |
2849 | && TREE_CODE (retval_rhs) == COND_EXPR | |
2850 | && (TREE_CODE (TREE_OPERAND (retval_rhs, 1)) == CALL_EXPR | |
2851 | || TREE_CODE (TREE_OPERAND (retval_rhs, 2)) == CALL_EXPR)) | |
2852 | { | |
2853 | rtx label = gen_label_rtx (); | |
a0a34f94 RK |
2854 | tree expr; |
2855 | ||
37366632 | 2856 | do_jump (TREE_OPERAND (retval_rhs, 0), label, NULL_RTX); |
1483bddb | 2857 | start_cleanup_deferral (); |
dd98f85c | 2858 | expr = build (MODIFY_EXPR, TREE_TYPE (TREE_TYPE (current_function_decl)), |
a0a34f94 RK |
2859 | DECL_RESULT (current_function_decl), |
2860 | TREE_OPERAND (retval_rhs, 1)); | |
2861 | TREE_SIDE_EFFECTS (expr) = 1; | |
2862 | expand_return (expr); | |
28d81abb | 2863 | emit_label (label); |
a0a34f94 | 2864 | |
dd98f85c | 2865 | expr = build (MODIFY_EXPR, TREE_TYPE (TREE_TYPE (current_function_decl)), |
a0a34f94 RK |
2866 | DECL_RESULT (current_function_decl), |
2867 | TREE_OPERAND (retval_rhs, 2)); | |
2868 | TREE_SIDE_EFFECTS (expr) = 1; | |
2869 | expand_return (expr); | |
1483bddb | 2870 | end_cleanup_deferral (); |
28d81abb RK |
2871 | return; |
2872 | } | |
2873 | ||
642cac7b | 2874 | /* Attempt to optimize the call if it is tail recursive. */ |
564ea051 JW |
2875 | if (optimize_tail_recursion (retval_rhs, last_insn)) |
2876 | return; | |
642cac7b | 2877 | |
28d81abb RK |
2878 | #ifdef HAVE_return |
2879 | /* This optimization is safe if there are local cleanups | |
2880 | because expand_null_return takes care of them. | |
2881 | ??? I think it should also be safe when there is a cleanup label, | |
2882 | because expand_null_return takes care of them, too. | |
2883 | Any reason why not? */ | |
2884 | if (HAVE_return && cleanup_label == 0 | |
5eb94e4e RK |
2885 | && ! current_function_returns_pcc_struct |
2886 | && BRANCH_COST <= 1) | |
28d81abb RK |
2887 | { |
2888 | /* If this is return x == y; then generate | |
2889 | if (x == y) return 1; else return 0; | |
3f8b69de TG |
2890 | if we can do it with explicit return insns and branches are cheap, |
2891 | but not if we have the corresponding scc insn. */ | |
2892 | int has_scc = 0; | |
28d81abb RK |
2893 | if (retval_rhs) |
2894 | switch (TREE_CODE (retval_rhs)) | |
2895 | { | |
2896 | case EQ_EXPR: | |
3f8b69de TG |
2897 | #ifdef HAVE_seq |
2898 | has_scc = HAVE_seq; | |
2899 | #endif | |
28d81abb | 2900 | case NE_EXPR: |
3f8b69de TG |
2901 | #ifdef HAVE_sne |
2902 | has_scc = HAVE_sne; | |
2903 | #endif | |
28d81abb | 2904 | case GT_EXPR: |
3f8b69de TG |
2905 | #ifdef HAVE_sgt |
2906 | has_scc = HAVE_sgt; | |
2907 | #endif | |
28d81abb | 2908 | case GE_EXPR: |
3f8b69de TG |
2909 | #ifdef HAVE_sge |
2910 | has_scc = HAVE_sge; | |
2911 | #endif | |
28d81abb | 2912 | case LT_EXPR: |
3f8b69de TG |
2913 | #ifdef HAVE_slt |
2914 | has_scc = HAVE_slt; | |
2915 | #endif | |
28d81abb | 2916 | case LE_EXPR: |
3f8b69de TG |
2917 | #ifdef HAVE_sle |
2918 | has_scc = HAVE_sle; | |
2919 | #endif | |
28d81abb RK |
2920 | case TRUTH_ANDIF_EXPR: |
2921 | case TRUTH_ORIF_EXPR: | |
2922 | case TRUTH_AND_EXPR: | |
2923 | case TRUTH_OR_EXPR: | |
2924 | case TRUTH_NOT_EXPR: | |
94ed3915 | 2925 | case TRUTH_XOR_EXPR: |
3f8b69de TG |
2926 | if (! has_scc) |
2927 | { | |
2928 | op0 = gen_label_rtx (); | |
2929 | jumpifnot (retval_rhs, op0); | |
2930 | expand_value_return (const1_rtx); | |
2931 | emit_label (op0); | |
2932 | expand_value_return (const0_rtx); | |
2933 | return; | |
2934 | } | |
e9a25f70 JL |
2935 | break; |
2936 | ||
2937 | default: | |
2938 | break; | |
28d81abb RK |
2939 | } |
2940 | } | |
2941 | #endif /* HAVE_return */ | |
2942 | ||
4c485b63 JL |
2943 | /* If the result is an aggregate that is being returned in one (or more) |
2944 | registers, load the registers here. The compiler currently can't handle | |
2945 | copying a BLKmode value into registers. We could put this code in a | |
2946 | more general area (for use by everyone instead of just function | |
2947 | call/return), but until this feature is generally usable it is kept here | |
3ffeb8f1 JW |
2948 | (and in expand_call). The value must go into a pseudo in case there |
2949 | are cleanups that will clobber the real return register. */ | |
4c485b63 JL |
2950 | |
2951 | if (retval_rhs != 0 | |
2952 | && TYPE_MODE (TREE_TYPE (retval_rhs)) == BLKmode | |
14a774a9 | 2953 | && GET_CODE (result_rtl) == REG) |
4c485b63 | 2954 | { |
a7f875d7 | 2955 | int i, bitpos, xbitpos; |
4c485b63 JL |
2956 | int big_endian_correction = 0; |
2957 | int bytes = int_size_in_bytes (TREE_TYPE (retval_rhs)); | |
2958 | int n_regs = (bytes + UNITS_PER_WORD - 1) / UNITS_PER_WORD; | |
c84e2712 KG |
2959 | int bitsize = MIN (TYPE_ALIGN (TREE_TYPE (retval_rhs)), |
2960 | (unsigned int)BITS_PER_WORD); | |
4c485b63 | 2961 | rtx *result_pseudos = (rtx *) alloca (sizeof (rtx) * n_regs); |
c16ddde3 | 2962 | rtx result_reg, src = NULL_RTX, dst = NULL_RTX; |
4c485b63 | 2963 | rtx result_val = expand_expr (retval_rhs, NULL_RTX, VOIDmode, 0); |
af55da56 | 2964 | enum machine_mode tmpmode, result_reg_mode; |
4c485b63 | 2965 | |
a7f875d7 RK |
2966 | /* Structures whose size is not a multiple of a word are aligned |
2967 | to the least significant byte (to the right). On a BYTES_BIG_ENDIAN | |
2968 | machine, this means we must skip the empty high order bytes when | |
2969 | calculating the bit offset. */ | |
2970 | if (BYTES_BIG_ENDIAN && bytes % UNITS_PER_WORD) | |
2971 | big_endian_correction = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) | |
2972 | * BITS_PER_UNIT)); | |
2973 | ||
2974 | /* Copy the structure BITSIZE bits at a time. */ | |
2975 | for (bitpos = 0, xbitpos = big_endian_correction; | |
2976 | bitpos < bytes * BITS_PER_UNIT; | |
2977 | bitpos += bitsize, xbitpos += bitsize) | |
4c485b63 | 2978 | { |
a7f875d7 | 2979 | /* We need a new destination pseudo each time xbitpos is |
abc95ed3 | 2980 | on a word boundary and when xbitpos == big_endian_correction |
a7f875d7 RK |
2981 | (the first time through). */ |
2982 | if (xbitpos % BITS_PER_WORD == 0 | |
2983 | || xbitpos == big_endian_correction) | |
4c485b63 | 2984 | { |
a7f875d7 RK |
2985 | /* Generate an appropriate register. */ |
2986 | dst = gen_reg_rtx (word_mode); | |
2987 | result_pseudos[xbitpos / BITS_PER_WORD] = dst; | |
2988 | ||
2989 | /* Clobber the destination before we move anything into it. */ | |
38a448ca | 2990 | emit_insn (gen_rtx_CLOBBER (VOIDmode, dst)); |
4c485b63 | 2991 | } |
a7f875d7 RK |
2992 | |
2993 | /* We need a new source operand each time bitpos is on a word | |
2994 | boundary. */ | |
2995 | if (bitpos % BITS_PER_WORD == 0) | |
2996 | src = operand_subword_force (result_val, | |
2997 | bitpos / BITS_PER_WORD, | |
2998 | BLKmode); | |
2999 | ||
3000 | /* Use bitpos for the source extraction (left justified) and | |
3001 | xbitpos for the destination store (right justified). */ | |
3002 | store_bit_field (dst, bitsize, xbitpos % BITS_PER_WORD, word_mode, | |
3003 | extract_bit_field (src, bitsize, | |
3004 | bitpos % BITS_PER_WORD, 1, | |
3005 | NULL_RTX, word_mode, | |
3006 | word_mode, | |
3007 | bitsize / BITS_PER_UNIT, | |
3008 | BITS_PER_WORD), | |
3009 | bitsize / BITS_PER_UNIT, BITS_PER_WORD); | |
4c485b63 JL |
3010 | } |
3011 | ||
4c485b63 JL |
3012 | /* Find the smallest integer mode large enough to hold the |
3013 | entire structure and use that mode instead of BLKmode | |
3014 | on the USE insn for the return register. */ | |
3015 | bytes = int_size_in_bytes (TREE_TYPE (retval_rhs)); | |
3016 | for (tmpmode = GET_CLASS_NARROWEST_MODE (MODE_INT); | |
0c61f541 | 3017 | tmpmode != VOIDmode; |
4c485b63 | 3018 | tmpmode = GET_MODE_WIDER_MODE (tmpmode)) |
3ffeb8f1 JW |
3019 | { |
3020 | /* Have we found a large enough mode? */ | |
3021 | if (GET_MODE_SIZE (tmpmode) >= bytes) | |
3022 | break; | |
3023 | } | |
4c485b63 JL |
3024 | |
3025 | /* No suitable mode found. */ | |
0c61f541 | 3026 | if (tmpmode == VOIDmode) |
3ffeb8f1 | 3027 | abort (); |
4c485b63 | 3028 | |
14a774a9 | 3029 | PUT_MODE (result_rtl, tmpmode); |
3ffeb8f1 | 3030 | |
af55da56 JW |
3031 | if (GET_MODE_SIZE (tmpmode) < GET_MODE_SIZE (word_mode)) |
3032 | result_reg_mode = word_mode; | |
3033 | else | |
3034 | result_reg_mode = tmpmode; | |
3035 | result_reg = gen_reg_rtx (result_reg_mode); | |
3036 | ||
3ffeb8f1 | 3037 | emit_queue (); |
3ffeb8f1 | 3038 | for (i = 0; i < n_regs; i++) |
af55da56 | 3039 | emit_move_insn (operand_subword (result_reg, i, 0, result_reg_mode), |
3ffeb8f1 | 3040 | result_pseudos[i]); |
4c485b63 | 3041 | |
af55da56 JW |
3042 | if (tmpmode != result_reg_mode) |
3043 | result_reg = gen_lowpart (tmpmode, result_reg); | |
3044 | ||
4c485b63 JL |
3045 | expand_value_return (result_reg); |
3046 | } | |
3047 | else if (cleanups | |
28d81abb RK |
3048 | && retval_rhs != 0 |
3049 | && TREE_TYPE (retval_rhs) != void_type_node | |
14a774a9 RK |
3050 | && (GET_CODE (result_rtl) == REG |
3051 | || (GET_CODE (result_rtl) == PARALLEL))) | |
28d81abb | 3052 | { |
14a774a9 RK |
3053 | /* Calculate the return value into a temporary (usually a pseudo |
3054 | reg). */ | |
3055 | val = assign_temp (TREE_TYPE (DECL_RESULT (current_function_decl)), | |
3056 | 0, 0, 1); | |
dd98f85c JM |
3057 | val = expand_expr (retval_rhs, val, GET_MODE (val), 0); |
3058 | val = force_not_mem (val); | |
28d81abb | 3059 | emit_queue (); |
28d81abb RK |
3060 | /* Return the calculated value, doing cleanups first. */ |
3061 | expand_value_return (val); | |
3062 | } | |
3063 | else | |
3064 | { | |
3065 | /* No cleanups or no hard reg used; | |
3066 | calculate value into hard return reg. */ | |
cba389cd | 3067 | expand_expr (retval, const0_rtx, VOIDmode, 0); |
28d81abb | 3068 | emit_queue (); |
14a774a9 | 3069 | expand_value_return (result_rtl); |
28d81abb RK |
3070 | } |
3071 | } | |
3072 | ||
3073 | /* Return 1 if the end of the generated RTX is not a barrier. | |
3074 | This means code already compiled can drop through. */ | |
3075 | ||
3076 | int | |
3077 | drop_through_at_end_p () | |
3078 | { | |
3079 | rtx insn = get_last_insn (); | |
3080 | while (insn && GET_CODE (insn) == NOTE) | |
3081 | insn = PREV_INSN (insn); | |
3082 | return insn && GET_CODE (insn) != BARRIER; | |
3083 | } | |
3084 | \f | |
642cac7b JL |
3085 | /* Test CALL_EXPR to determine if it is a potential tail recursion call |
3086 | and emit code to optimize the tail recursion. LAST_INSN indicates where | |
564ea051 JW |
3087 | to place the jump to the tail recursion label. Return TRUE if the |
3088 | call was optimized into a goto. | |
642cac7b JL |
3089 | |
3090 | This is only used by expand_return, but expand_call is expected to | |
3091 | use it soon. */ | |
3092 | ||
564ea051 | 3093 | int |
642cac7b JL |
3094 | optimize_tail_recursion (call_expr, last_insn) |
3095 | tree call_expr; | |
3096 | rtx last_insn; | |
3097 | { | |
3098 | /* For tail-recursive call to current function, | |
3099 | just jump back to the beginning. | |
3100 | It's unsafe if any auto variable in this function | |
3101 | has its address taken; for simplicity, | |
3102 | require stack frame to be empty. */ | |
3103 | if (optimize && call_expr != 0 | |
3104 | && frame_offset == 0 | |
3105 | && TREE_CODE (call_expr) == CALL_EXPR | |
3106 | && TREE_CODE (TREE_OPERAND (call_expr, 0)) == ADDR_EXPR | |
3107 | && TREE_OPERAND (TREE_OPERAND (call_expr, 0), 0) == current_function_decl | |
3108 | /* Finish checking validity, and if valid emit code | |
3109 | to set the argument variables for the new call. */ | |
3110 | && tail_recursion_args (TREE_OPERAND (call_expr, 1), | |
3111 | DECL_ARGUMENTS (current_function_decl))) | |
3112 | { | |
3113 | if (tail_recursion_label == 0) | |
3114 | { | |
3115 | tail_recursion_label = gen_label_rtx (); | |
3116 | emit_label_after (tail_recursion_label, | |
3117 | tail_recursion_reentry); | |
3118 | } | |
3119 | emit_queue (); | |
3120 | expand_goto_internal (NULL_TREE, tail_recursion_label, last_insn); | |
3121 | emit_barrier (); | |
564ea051 | 3122 | return 1; |
642cac7b | 3123 | } |
564ea051 JW |
3124 | |
3125 | return 0; | |
642cac7b JL |
3126 | } |
3127 | ||
28d81abb RK |
3128 | /* Emit code to alter this function's formal parms for a tail-recursive call. |
3129 | ACTUALS is a list of actual parameter expressions (chain of TREE_LISTs). | |
3130 | FORMALS is the chain of decls of formals. | |
3131 | Return 1 if this can be done; | |
3132 | otherwise return 0 and do not emit any code. */ | |
3133 | ||
3134 | static int | |
3135 | tail_recursion_args (actuals, formals) | |
3136 | tree actuals, formals; | |
3137 | { | |
3138 | register tree a = actuals, f = formals; | |
3139 | register int i; | |
3140 | register rtx *argvec; | |
3141 | ||
3142 | /* Check that number and types of actuals are compatible | |
3143 | with the formals. This is not always true in valid C code. | |
3144 | Also check that no formal needs to be addressable | |
3145 | and that all formals are scalars. */ | |
3146 | ||
3147 | /* Also count the args. */ | |
3148 | ||
3149 | for (a = actuals, f = formals, i = 0; a && f; a = TREE_CHAIN (a), f = TREE_CHAIN (f), i++) | |
3150 | { | |
5c7fe359 RK |
3151 | if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (a))) |
3152 | != TYPE_MAIN_VARIANT (TREE_TYPE (f))) | |
28d81abb RK |
3153 | return 0; |
3154 | if (GET_CODE (DECL_RTL (f)) != REG || DECL_MODE (f) == BLKmode) | |
3155 | return 0; | |
3156 | } | |
3157 | if (a != 0 || f != 0) | |
3158 | return 0; | |
3159 | ||
3160 | /* Compute all the actuals. */ | |
3161 | ||
3162 | argvec = (rtx *) alloca (i * sizeof (rtx)); | |
3163 | ||
3164 | for (a = actuals, i = 0; a; a = TREE_CHAIN (a), i++) | |
37366632 | 3165 | argvec[i] = expand_expr (TREE_VALUE (a), NULL_RTX, VOIDmode, 0); |
28d81abb RK |
3166 | |
3167 | /* Find which actual values refer to current values of previous formals. | |
3168 | Copy each of them now, before any formal is changed. */ | |
3169 | ||
3170 | for (a = actuals, i = 0; a; a = TREE_CHAIN (a), i++) | |
3171 | { | |
3172 | int copy = 0; | |
3173 | register int j; | |
3174 | for (f = formals, j = 0; j < i; f = TREE_CHAIN (f), j++) | |
3175 | if (reg_mentioned_p (DECL_RTL (f), argvec[i])) | |
3176 | { copy = 1; break; } | |
3177 | if (copy) | |
3178 | argvec[i] = copy_to_reg (argvec[i]); | |
3179 | } | |
3180 | ||
3181 | /* Store the values of the actuals into the formals. */ | |
3182 | ||
3183 | for (f = formals, a = actuals, i = 0; f; | |
3184 | f = TREE_CHAIN (f), a = TREE_CHAIN (a), i++) | |
3185 | { | |
98f3b471 | 3186 | if (GET_MODE (DECL_RTL (f)) == GET_MODE (argvec[i])) |
28d81abb RK |
3187 | emit_move_insn (DECL_RTL (f), argvec[i]); |
3188 | else | |
3189 | convert_move (DECL_RTL (f), argvec[i], | |
3190 | TREE_UNSIGNED (TREE_TYPE (TREE_VALUE (a)))); | |
3191 | } | |
3192 | ||
3193 | free_temp_slots (); | |
3194 | return 1; | |
3195 | } | |
3196 | \f | |
3197 | /* Generate the RTL code for entering a binding contour. | |
3198 | The variables are declared one by one, by calls to `expand_decl'. | |
3199 | ||
8e91754e MM |
3200 | FLAGS is a bitwise or of the following flags: |
3201 | ||
3202 | 1 - Nonzero if this construct should be visible to | |
3203 | `exit_something'. | |
3204 | ||
3205 | 2 - Nonzero if this contour does not require a | |
3206 | NOTE_INSN_BLOCK_BEG note. Virtually all calls from | |
3207 | language-independent code should set this flag because they | |
3208 | will not create corresponding BLOCK nodes. (There should be | |
3209 | a one-to-one correspondence between NOTE_INSN_BLOCK_BEG notes | |
3210 | and BLOCKs.) If this flag is set, MARK_ENDS should be zero | |
a97901e6 MM |
3211 | when expand_end_bindings is called. |
3212 | ||
3213 | If we are creating a NOTE_INSN_BLOCK_BEG note, a BLOCK may | |
3214 | optionally be supplied. If so, it becomes the NOTE_BLOCK for the | |
3215 | note. */ | |
28d81abb RK |
3216 | |
3217 | void | |
a97901e6 | 3218 | expand_start_bindings_and_block (flags, block) |
8e91754e | 3219 | int flags; |
a97901e6 | 3220 | tree block; |
28d81abb RK |
3221 | { |
3222 | struct nesting *thisblock = ALLOC_NESTING (); | |
8e91754e MM |
3223 | rtx note; |
3224 | int exit_flag = ((flags & 1) != 0); | |
3225 | int block_flag = ((flags & 2) == 0); | |
a97901e6 MM |
3226 | |
3227 | /* If a BLOCK is supplied, then the caller should be requesting a | |
3228 | NOTE_INSN_BLOCK_BEG note. */ | |
3229 | if (!block_flag && block) | |
3230 | abort (); | |
8e91754e | 3231 | |
a97901e6 MM |
3232 | /* Create a note to mark the beginning of the block. */ |
3233 | if (block_flag) | |
3234 | { | |
3235 | note = emit_note (NULL_PTR, NOTE_INSN_BLOCK_BEG); | |
3236 | NOTE_BLOCK (note) = block; | |
3237 | } | |
3238 | else | |
3239 | note = emit_note (NULL_PTR, NOTE_INSN_DELETED); | |
3240 | ||
28d81abb RK |
3241 | /* Make an entry on block_stack for the block we are entering. */ |
3242 | ||
3243 | thisblock->next = block_stack; | |
3244 | thisblock->all = nesting_stack; | |
3245 | thisblock->depth = ++nesting_depth; | |
3246 | thisblock->data.block.stack_level = 0; | |
3247 | thisblock->data.block.cleanups = 0; | |
3f1d071b | 3248 | thisblock->data.block.n_function_calls = 0; |
e976b8b2 | 3249 | thisblock->data.block.exception_region = 0; |
3f1d071b | 3250 | thisblock->data.block.block_target_temp_slot_level = target_temp_slot_level; |
e976b8b2 MS |
3251 | |
3252 | thisblock->data.block.conditional_code = 0; | |
3253 | thisblock->data.block.last_unconditional_cleanup = note; | |
a571f7a0 MM |
3254 | /* When we insert instructions after the last unconditional cleanup, |
3255 | we don't adjust last_insn. That means that a later add_insn will | |
3256 | clobber the instructions we've just added. The easiest way to | |
3257 | fix this is to just insert another instruction here, so that the | |
3258 | instructions inserted after the last unconditional cleanup are | |
3259 | never the last instruction. */ | |
3260 | emit_note (NULL_PTR, NOTE_INSN_DELETED); | |
e976b8b2 MS |
3261 | thisblock->data.block.cleanup_ptr = &thisblock->data.block.cleanups; |
3262 | ||
28d81abb RK |
3263 | if (block_stack |
3264 | && !(block_stack->data.block.cleanups == NULL_TREE | |
3265 | && block_stack->data.block.outer_cleanups == NULL_TREE)) | |
3266 | thisblock->data.block.outer_cleanups | |
3267 | = tree_cons (NULL_TREE, block_stack->data.block.cleanups, | |
3268 | block_stack->data.block.outer_cleanups); | |
3269 | else | |
3270 | thisblock->data.block.outer_cleanups = 0; | |
28d81abb RK |
3271 | thisblock->data.block.label_chain = 0; |
3272 | thisblock->data.block.innermost_stack_block = stack_block_stack; | |
3273 | thisblock->data.block.first_insn = note; | |
3f1d071b | 3274 | thisblock->data.block.block_start_count = ++current_block_start_count; |
28d81abb RK |
3275 | thisblock->exit_label = exit_flag ? gen_label_rtx () : 0; |
3276 | block_stack = thisblock; | |
3277 | nesting_stack = thisblock; | |
3278 | ||
b93a436e JL |
3279 | /* Make a new level for allocating stack slots. */ |
3280 | push_temp_slots (); | |
28d81abb RK |
3281 | } |
3282 | ||
e976b8b2 MS |
3283 | /* Specify the scope of temporaries created by TARGET_EXPRs. Similar |
3284 | to CLEANUP_POINT_EXPR, but handles cases when a series of calls to | |
3285 | expand_expr are made. After we end the region, we know that all | |
3286 | space for all temporaries that were created by TARGET_EXPRs will be | |
3287 | destroyed and their space freed for reuse. */ | |
3288 | ||
3289 | void | |
3290 | expand_start_target_temps () | |
3291 | { | |
3292 | /* This is so that even if the result is preserved, the space | |
3293 | allocated will be freed, as we know that it is no longer in use. */ | |
3294 | push_temp_slots (); | |
3295 | ||
3296 | /* Start a new binding layer that will keep track of all cleanup | |
3297 | actions to be performed. */ | |
8e91754e | 3298 | expand_start_bindings (2); |
e976b8b2 MS |
3299 | |
3300 | target_temp_slot_level = temp_slot_level; | |
3301 | } | |
3302 | ||
3303 | void | |
3304 | expand_end_target_temps () | |
3305 | { | |
3306 | expand_end_bindings (NULL_TREE, 0, 0); | |
3307 | ||
3308 | /* This is so that even if the result is preserved, the space | |
3309 | allocated will be freed, as we know that it is no longer in use. */ | |
3310 | pop_temp_slots (); | |
3311 | } | |
3312 | ||
deb5e280 JM |
3313 | /* Given a pointer to a BLOCK node return non-zero if (and only if) the node |
3314 | in question represents the outermost pair of curly braces (i.e. the "body | |
3315 | block") of a function or method. | |
3316 | ||
3317 | For any BLOCK node representing a "body block" of a function or method, the | |
3318 | BLOCK_SUPERCONTEXT of the node will point to another BLOCK node which | |
3319 | represents the outermost (function) scope for the function or method (i.e. | |
3320 | the one which includes the formal parameters). The BLOCK_SUPERCONTEXT of | |
3321 | *that* node in turn will point to the relevant FUNCTION_DECL node. */ | |
3322 | ||
3323 | int | |
3324 | is_body_block (stmt) | |
3325 | register tree stmt; | |
3326 | { | |
3327 | if (TREE_CODE (stmt) == BLOCK) | |
3328 | { | |
3329 | tree parent = BLOCK_SUPERCONTEXT (stmt); | |
3330 | ||
3331 | if (parent && TREE_CODE (parent) == BLOCK) | |
3332 | { | |
3333 | tree grandparent = BLOCK_SUPERCONTEXT (parent); | |
3334 | ||
3335 | if (grandparent && TREE_CODE (grandparent) == FUNCTION_DECL) | |
3336 | return 1; | |
3337 | } | |
3338 | } | |
3339 | ||
3340 | return 0; | |
3341 | } | |
3342 | ||
e976b8b2 MS |
3343 | /* Mark top block of block_stack as an implicit binding for an |
3344 | exception region. This is used to prevent infinite recursion when | |
3345 | ending a binding with expand_end_bindings. It is only ever called | |
3346 | by expand_eh_region_start, as that it the only way to create a | |
3347 | block stack for a exception region. */ | |
3348 | ||
3349 | void | |
3350 | mark_block_as_eh_region () | |
3351 | { | |
3352 | block_stack->data.block.exception_region = 1; | |
3353 | if (block_stack->next | |
3354 | && block_stack->next->data.block.conditional_code) | |
3355 | { | |
3356 | block_stack->data.block.conditional_code | |
3357 | = block_stack->next->data.block.conditional_code; | |
3358 | block_stack->data.block.last_unconditional_cleanup | |
3359 | = block_stack->next->data.block.last_unconditional_cleanup; | |
3360 | block_stack->data.block.cleanup_ptr | |
3361 | = block_stack->next->data.block.cleanup_ptr; | |
3362 | } | |
3363 | } | |
3364 | ||
3365 | /* True if we are currently emitting insns in an area of output code | |
3366 | that is controlled by a conditional expression. This is used by | |
3367 | the cleanup handling code to generate conditional cleanup actions. */ | |
3368 | ||
3369 | int | |
3370 | conditional_context () | |
3371 | { | |
3372 | return block_stack && block_stack->data.block.conditional_code; | |
3373 | } | |
3374 | ||
3375 | /* Mark top block of block_stack as not for an implicit binding for an | |
3376 | exception region. This is only ever done by expand_eh_region_end | |
3377 | to let expand_end_bindings know that it is being called explicitly | |
3378 | to end the binding layer for just the binding layer associated with | |
3379 | the exception region, otherwise expand_end_bindings would try and | |
3380 | end all implicit binding layers for exceptions regions, and then | |
3381 | one normal binding layer. */ | |
3382 | ||
3383 | void | |
3384 | mark_block_as_not_eh_region () | |
3385 | { | |
3386 | block_stack->data.block.exception_region = 0; | |
3387 | } | |
3388 | ||
3389 | /* True if the top block of block_stack was marked as for an exception | |
3390 | region by mark_block_as_eh_region. */ | |
3391 | ||
3392 | int | |
3393 | is_eh_region () | |
3394 | { | |
01d939e8 | 3395 | return cfun && block_stack && block_stack->data.block.exception_region; |
e976b8b2 MS |
3396 | } |
3397 | ||
ba716ac9 BS |
3398 | /* Emit a handler label for a nonlocal goto handler. |
3399 | Also emit code to store the handler label in SLOT before BEFORE_INSN. */ | |
3400 | ||
e881bb1b | 3401 | static rtx |
ba716ac9 BS |
3402 | expand_nl_handler_label (slot, before_insn) |
3403 | rtx slot, before_insn; | |
3404 | { | |
3405 | rtx insns; | |
3406 | rtx handler_label = gen_label_rtx (); | |
3407 | ||
3408 | /* Don't let jump_optimize delete the handler. */ | |
3409 | LABEL_PRESERVE_P (handler_label) = 1; | |
3410 | ||
3411 | start_sequence (); | |
3412 | emit_move_insn (slot, gen_rtx_LABEL_REF (Pmode, handler_label)); | |
3413 | insns = get_insns (); | |
3414 | end_sequence (); | |
3415 | emit_insns_before (insns, before_insn); | |
3416 | ||
3417 | emit_label (handler_label); | |
e881bb1b RH |
3418 | |
3419 | return handler_label; | |
ba716ac9 BS |
3420 | } |
3421 | ||
3422 | /* Emit code to restore vital registers at the beginning of a nonlocal goto | |
3423 | handler. */ | |
3424 | static void | |
3425 | expand_nl_goto_receiver () | |
3426 | { | |
3427 | #ifdef HAVE_nonlocal_goto | |
3428 | if (! HAVE_nonlocal_goto) | |
3429 | #endif | |
3430 | /* First adjust our frame pointer to its actual value. It was | |
3431 | previously set to the start of the virtual area corresponding to | |
3432 | the stacked variables when we branched here and now needs to be | |
3433 | adjusted to the actual hardware fp value. | |
3434 | ||
3435 | Assignments are to virtual registers are converted by | |
3436 | instantiate_virtual_regs into the corresponding assignment | |
3437 | to the underlying register (fp in this case) that makes | |
3438 | the original assignment true. | |
3439 | So the following insn will actually be | |
3440 | decrementing fp by STARTING_FRAME_OFFSET. */ | |
3441 | emit_move_insn (virtual_stack_vars_rtx, hard_frame_pointer_rtx); | |
3442 | ||
3443 | #if ARG_POINTER_REGNUM != HARD_FRAME_POINTER_REGNUM | |
3444 | if (fixed_regs[ARG_POINTER_REGNUM]) | |
3445 | { | |
3446 | #ifdef ELIMINABLE_REGS | |
3447 | /* If the argument pointer can be eliminated in favor of the | |
3448 | frame pointer, we don't need to restore it. We assume here | |
3449 | that if such an elimination is present, it can always be used. | |
3450 | This is the case on all known machines; if we don't make this | |
3451 | assumption, we do unnecessary saving on many machines. */ | |
3452 | static struct elims {int from, to;} elim_regs[] = ELIMINABLE_REGS; | |
3453 | size_t i; | |
3454 | ||
3455 | for (i = 0; i < sizeof elim_regs / sizeof elim_regs[0]; i++) | |
3456 | if (elim_regs[i].from == ARG_POINTER_REGNUM | |
3457 | && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM) | |
3458 | break; | |
3459 | ||
3460 | if (i == sizeof elim_regs / sizeof elim_regs [0]) | |
3461 | #endif | |
3462 | { | |
3463 | /* Now restore our arg pointer from the address at which it | |
3464 | was saved in our stack frame. | |
3465 | If there hasn't be space allocated for it yet, make | |
3466 | some now. */ | |
3467 | if (arg_pointer_save_area == 0) | |
3468 | arg_pointer_save_area | |
3469 | = assign_stack_local (Pmode, GET_MODE_SIZE (Pmode), 0); | |
3470 | emit_move_insn (virtual_incoming_args_rtx, | |
3471 | /* We need a pseudo here, or else | |
3472 | instantiate_virtual_regs_1 complains. */ | |
3473 | copy_to_reg (arg_pointer_save_area)); | |
3474 | } | |
3475 | } | |
3476 | #endif | |
3477 | ||
3478 | #ifdef HAVE_nonlocal_goto_receiver | |
3479 | if (HAVE_nonlocal_goto_receiver) | |
3480 | emit_insn (gen_nonlocal_goto_receiver ()); | |
3481 | #endif | |
3482 | } | |
3483 | ||
3484 | /* Make handlers for nonlocal gotos taking place in the function calls in | |
3485 | block THISBLOCK. */ | |
3486 | ||
3487 | static void | |
3488 | expand_nl_goto_receivers (thisblock) | |
3489 | struct nesting *thisblock; | |
3490 | { | |
3491 | tree link; | |
3492 | rtx afterward = gen_label_rtx (); | |
3493 | rtx insns, slot; | |
e881bb1b | 3494 | rtx label_list; |
ba716ac9 BS |
3495 | int any_invalid; |
3496 | ||
3497 | /* Record the handler address in the stack slot for that purpose, | |
3498 | during this block, saving and restoring the outer value. */ | |
3499 | if (thisblock->next != 0) | |
3500 | for (slot = nonlocal_goto_handler_slots; slot; slot = XEXP (slot, 1)) | |
3501 | { | |
3502 | rtx save_receiver = gen_reg_rtx (Pmode); | |
3503 | emit_move_insn (XEXP (slot, 0), save_receiver); | |
3504 | ||
3505 | start_sequence (); | |
3506 | emit_move_insn (save_receiver, XEXP (slot, 0)); | |
3507 | insns = get_insns (); | |
3508 | end_sequence (); | |
3509 | emit_insns_before (insns, thisblock->data.block.first_insn); | |
3510 | } | |
3511 | ||
3512 | /* Jump around the handlers; they run only when specially invoked. */ | |
3513 | emit_jump (afterward); | |
3514 | ||
3515 | /* Make a separate handler for each label. */ | |
3516 | link = nonlocal_labels; | |
3517 | slot = nonlocal_goto_handler_slots; | |
e881bb1b | 3518 | label_list = NULL_RTX; |
ba716ac9 BS |
3519 | for (; link; link = TREE_CHAIN (link), slot = XEXP (slot, 1)) |
3520 | /* Skip any labels we shouldn't be able to jump to from here, | |
3521 | we generate one special handler for all of them below which just calls | |
3522 | abort. */ | |
3523 | if (! DECL_TOO_LATE (TREE_VALUE (link))) | |
3524 | { | |
e881bb1b RH |
3525 | rtx lab; |
3526 | lab = expand_nl_handler_label (XEXP (slot, 0), | |
3527 | thisblock->data.block.first_insn); | |
3528 | label_list = gen_rtx_EXPR_LIST (VOIDmode, lab, label_list); | |
3529 | ||
ba716ac9 BS |
3530 | expand_nl_goto_receiver (); |
3531 | ||
3532 | /* Jump to the "real" nonlocal label. */ | |
3533 | expand_goto (TREE_VALUE (link)); | |
3534 | } | |
3535 | ||
3536 | /* A second pass over all nonlocal labels; this time we handle those | |
3537 | we should not be able to jump to at this point. */ | |
3538 | link = nonlocal_labels; | |
3539 | slot = nonlocal_goto_handler_slots; | |
3540 | any_invalid = 0; | |
3541 | for (; link; link = TREE_CHAIN (link), slot = XEXP (slot, 1)) | |
3542 | if (DECL_TOO_LATE (TREE_VALUE (link))) | |
3543 | { | |
e881bb1b RH |
3544 | rtx lab; |
3545 | lab = expand_nl_handler_label (XEXP (slot, 0), | |
3546 | thisblock->data.block.first_insn); | |
3547 | label_list = gen_rtx_EXPR_LIST (VOIDmode, lab, label_list); | |
ba716ac9 BS |
3548 | any_invalid = 1; |
3549 | } | |
3550 | ||
3551 | if (any_invalid) | |
3552 | { | |
3553 | expand_nl_goto_receiver (); | |
3554 | emit_library_call (gen_rtx_SYMBOL_REF (Pmode, "abort"), 0, | |
3555 | VOIDmode, 0); | |
3556 | emit_barrier (); | |
3557 | } | |
3558 | ||
e881bb1b | 3559 | nonlocal_goto_handler_labels = label_list; |
ba716ac9 BS |
3560 | emit_label (afterward); |
3561 | } | |
3562 | ||
ba716677 MM |
3563 | /* Warn about any unused VARS (which may contain nodes other than |
3564 | VAR_DECLs, but such nodes are ignored). The nodes are connected | |
3565 | via the TREE_CHAIN field. */ | |
3566 | ||
3567 | void | |
3568 | warn_about_unused_variables (vars) | |
3569 | tree vars; | |
3570 | { | |
3571 | tree decl; | |
3572 | ||
3573 | if (warn_unused) | |
3574 | for (decl = vars; decl; decl = TREE_CHAIN (decl)) | |
3575 | if (TREE_CODE (decl) == VAR_DECL | |
3576 | && ! TREE_USED (decl) | |
3577 | && ! DECL_IN_SYSTEM_HEADER (decl) | |
3578 | && DECL_NAME (decl) && ! DECL_ARTIFICIAL (decl)) | |
3579 | warning_with_decl (decl, "unused variable `%s'"); | |
3580 | } | |
3581 | ||
28d81abb | 3582 | /* Generate RTL code to terminate a binding contour. |
e97b5c12 MM |
3583 | |
3584 | VARS is the chain of VAR_DECL nodes for the variables bound in this | |
3585 | contour. There may actually be other nodes in this chain, but any | |
3586 | nodes other than VAR_DECLS are ignored. | |
3587 | ||
28d81abb RK |
3588 | MARK_ENDS is nonzero if we should put a note at the beginning |
3589 | and end of this binding contour. | |
3590 | ||
3591 | DONT_JUMP_IN is nonzero if it is not valid to jump into this contour. | |
3592 | (That is true automatically if the contour has a saved stack level.) */ | |
3593 | ||
3594 | void | |
3595 | expand_end_bindings (vars, mark_ends, dont_jump_in) | |
3596 | tree vars; | |
3597 | int mark_ends; | |
3598 | int dont_jump_in; | |
3599 | { | |
e976b8b2 | 3600 | register struct nesting *thisblock; |
28d81abb | 3601 | |
e976b8b2 MS |
3602 | while (block_stack->data.block.exception_region) |
3603 | { | |
3604 | /* Because we don't need or want a new temporary level and | |
3605 | because we didn't create one in expand_eh_region_start, | |
3606 | create a fake one now to avoid removing one in | |
3607 | expand_end_bindings. */ | |
3608 | push_temp_slots (); | |
3609 | ||
3610 | block_stack->data.block.exception_region = 0; | |
3611 | ||
3612 | expand_end_bindings (NULL_TREE, 0, 0); | |
3613 | } | |
3614 | ||
e976b8b2 MS |
3615 | /* Since expand_eh_region_start does an expand_start_bindings, we |
3616 | have to first end all the bindings that were created by | |
3617 | expand_eh_region_start. */ | |
3618 | ||
3619 | thisblock = block_stack; | |
3620 | ||
ba716677 MM |
3621 | /* If any of the variables in this scope were not used, warn the |
3622 | user. */ | |
3623 | warn_about_unused_variables (vars); | |
28d81abb | 3624 | |
28d81abb RK |
3625 | if (thisblock->exit_label) |
3626 | { | |
3627 | do_pending_stack_adjust (); | |
3628 | emit_label (thisblock->exit_label); | |
3629 | } | |
3630 | ||
ba716ac9 | 3631 | /* If necessary, make handlers for nonlocal gotos taking |
28d81abb | 3632 | place in the function calls in this block. */ |
3f1d071b | 3633 | if (function_call_count != thisblock->data.block.n_function_calls |
28d81abb RK |
3634 | && nonlocal_labels |
3635 | /* Make handler for outermost block | |
3636 | if there were any nonlocal gotos to this function. */ | |
3637 | && (thisblock->next == 0 ? current_function_has_nonlocal_label | |
3638 | /* Make handler for inner block if it has something | |
3639 | special to do when you jump out of it. */ | |
3640 | : (thisblock->data.block.cleanups != 0 | |
3641 | || thisblock->data.block.stack_level != 0))) | |
ba716ac9 | 3642 | expand_nl_goto_receivers (thisblock); |
28d81abb | 3643 | |
72eb1038 BH |
3644 | /* Don't allow jumping into a block that has a stack level. |
3645 | Cleanups are allowed, though. */ | |
28d81abb | 3646 | if (dont_jump_in |
72eb1038 | 3647 | || thisblock->data.block.stack_level != 0) |
28d81abb RK |
3648 | { |
3649 | struct label_chain *chain; | |
3650 | ||
3651 | /* Any labels in this block are no longer valid to go to. | |
3652 | Mark them to cause an error message. */ | |
3653 | for (chain = thisblock->data.block.label_chain; chain; chain = chain->next) | |
3654 | { | |
3655 | DECL_TOO_LATE (chain->label) = 1; | |
3656 | /* If any goto without a fixup came to this label, | |
3657 | that must be an error, because gotos without fixups | |
72eb1038 | 3658 | come from outside all saved stack-levels. */ |
28d81abb RK |
3659 | if (TREE_ADDRESSABLE (chain->label)) |
3660 | error_with_decl (chain->label, | |
3661 | "label `%s' used before containing binding contour"); | |
3662 | } | |
3663 | } | |
3664 | ||
3665 | /* Restore stack level in effect before the block | |
3666 | (only if variable-size objects allocated). */ | |
3667 | /* Perform any cleanups associated with the block. */ | |
3668 | ||
3669 | if (thisblock->data.block.stack_level != 0 | |
3670 | || thisblock->data.block.cleanups != 0) | |
3671 | { | |
413ec213 | 3672 | /* Only clean up here if this point can actually be reached. */ |
50d1b7a1 | 3673 | int reachable = GET_CODE (get_last_insn ()) != BARRIER; |
28d81abb | 3674 | |
50d1b7a1 MS |
3675 | /* Don't let cleanups affect ({...}) constructs. */ |
3676 | int old_expr_stmts_for_value = expr_stmts_for_value; | |
3677 | rtx old_last_expr_value = last_expr_value; | |
3678 | tree old_last_expr_type = last_expr_type; | |
3679 | expr_stmts_for_value = 0; | |
28d81abb | 3680 | |
50d1b7a1 MS |
3681 | /* Do the cleanups. */ |
3682 | expand_cleanups (thisblock->data.block.cleanups, NULL_TREE, 0, reachable); | |
3683 | if (reachable) | |
3684 | do_pending_stack_adjust (); | |
28d81abb | 3685 | |
50d1b7a1 MS |
3686 | expr_stmts_for_value = old_expr_stmts_for_value; |
3687 | last_expr_value = old_last_expr_value; | |
3688 | last_expr_type = old_last_expr_type; | |
3689 | ||
3690 | /* Restore the stack level. */ | |
3691 | ||
3692 | if (reachable && thisblock->data.block.stack_level != 0) | |
3693 | { | |
3694 | emit_stack_restore (thisblock->next ? SAVE_BLOCK : SAVE_FUNCTION, | |
3695 | thisblock->data.block.stack_level, NULL_RTX); | |
ba716ac9 | 3696 | if (nonlocal_goto_handler_slots != 0) |
50d1b7a1 MS |
3697 | emit_stack_save (SAVE_NONLOCAL, &nonlocal_goto_stack_level, |
3698 | NULL_RTX); | |
28d81abb RK |
3699 | } |
3700 | ||
3701 | /* Any gotos out of this block must also do these things. | |
59257ff7 RK |
3702 | Also report any gotos with fixups that came to labels in this |
3703 | level. */ | |
28d81abb RK |
3704 | fixup_gotos (thisblock, |
3705 | thisblock->data.block.stack_level, | |
3706 | thisblock->data.block.cleanups, | |
3707 | thisblock->data.block.first_insn, | |
3708 | dont_jump_in); | |
3709 | } | |
3710 | ||
c7d2d61d RS |
3711 | /* Mark the beginning and end of the scope if requested. |
3712 | We do this now, after running cleanups on the variables | |
3713 | just going out of scope, so they are in scope for their cleanups. */ | |
3714 | ||
3715 | if (mark_ends) | |
a97901e6 MM |
3716 | { |
3717 | rtx note = emit_note (NULL_PTR, NOTE_INSN_BLOCK_END); | |
3718 | NOTE_BLOCK (note) = NOTE_BLOCK (thisblock->data.block.first_insn); | |
3719 | } | |
c7d2d61d RS |
3720 | else |
3721 | /* Get rid of the beginning-mark if we don't make an end-mark. */ | |
3722 | NOTE_LINE_NUMBER (thisblock->data.block.first_insn) = NOTE_INSN_DELETED; | |
3723 | ||
e976b8b2 | 3724 | /* Restore the temporary level of TARGET_EXPRs. */ |
3f1d071b | 3725 | target_temp_slot_level = thisblock->data.block.block_target_temp_slot_level; |
e976b8b2 | 3726 | |
28d81abb RK |
3727 | /* Restore block_stack level for containing block. */ |
3728 | ||
3729 | stack_block_stack = thisblock->data.block.innermost_stack_block; | |
3730 | POPSTACK (block_stack); | |
3731 | ||
3732 | /* Pop the stack slot nesting and free any slots at this level. */ | |
3733 | pop_temp_slots (); | |
3734 | } | |
3735 | \f | |
3736 | /* Generate RTL for the automatic variable declaration DECL. | |
ec5cd386 | 3737 | (Other kinds of declarations are simply ignored if seen here.) */ |
28d81abb RK |
3738 | |
3739 | void | |
3740 | expand_decl (decl) | |
3741 | register tree decl; | |
3742 | { | |
3f1d071b | 3743 | struct nesting *thisblock; |
ca695ac9 JB |
3744 | tree type; |
3745 | ||
ca695ac9 | 3746 | type = TREE_TYPE (decl); |
28d81abb RK |
3747 | |
3748 | /* Only automatic variables need any expansion done. | |
3749 | Static and external variables, and external functions, | |
3750 | will be handled by `assemble_variable' (called from finish_decl). | |
3751 | TYPE_DECL and CONST_DECL require nothing. | |
3752 | PARM_DECLs are handled in `assign_parms'. */ | |
3753 | ||
3754 | if (TREE_CODE (decl) != VAR_DECL) | |
3755 | return; | |
44fe2e80 | 3756 | if (TREE_STATIC (decl) || DECL_EXTERNAL (decl)) |
28d81abb RK |
3757 | return; |
3758 | ||
3f1d071b BS |
3759 | thisblock = block_stack; |
3760 | ||
28d81abb RK |
3761 | /* Create the RTL representation for the variable. */ |
3762 | ||
3763 | if (type == error_mark_node) | |
38a448ca | 3764 | DECL_RTL (decl) = gen_rtx_MEM (BLKmode, const0_rtx); |
28d81abb RK |
3765 | else if (DECL_SIZE (decl) == 0) |
3766 | /* Variable with incomplete type. */ | |
3767 | { | |
3768 | if (DECL_INITIAL (decl) == 0) | |
3769 | /* Error message was already done; now avoid a crash. */ | |
3770 | DECL_RTL (decl) = assign_stack_temp (DECL_MODE (decl), 0, 1); | |
3771 | else | |
3772 | /* An initializer is going to decide the size of this array. | |
3773 | Until we know the size, represent its address with a reg. */ | |
38a448ca | 3774 | DECL_RTL (decl) = gen_rtx_MEM (BLKmode, gen_reg_rtx (Pmode)); |
c6df88cb | 3775 | MEM_SET_IN_STRUCT_P (DECL_RTL (decl), AGGREGATE_TYPE_P (type)); |
28d81abb RK |
3776 | } |
3777 | else if (DECL_MODE (decl) != BLKmode | |
3778 | /* If -ffloat-store, don't put explicit float vars | |
3779 | into regs. */ | |
3780 | && !(flag_float_store | |
3781 | && TREE_CODE (type) == REAL_TYPE) | |
3782 | && ! TREE_THIS_VOLATILE (decl) | |
3783 | && ! TREE_ADDRESSABLE (decl) | |
d29c259b | 3784 | && (DECL_REGISTER (decl) || optimize) |
e5e809f4 | 3785 | /* if -fcheck-memory-usage, check all variables. */ |
7d384cc0 | 3786 | && ! current_function_check_memory_usage) |
28d81abb RK |
3787 | { |
3788 | /* Automatic variable that can go in a register. */ | |
98f3b471 | 3789 | int unsignedp = TREE_UNSIGNED (type); |
28612f9e RK |
3790 | enum machine_mode reg_mode |
3791 | = promote_mode (type, DECL_MODE (decl), &unsignedp, 0); | |
98f3b471 | 3792 | |
7f070d5e RK |
3793 | DECL_RTL (decl) = gen_reg_rtx (reg_mode); |
3794 | mark_user_reg (DECL_RTL (decl)); | |
3795 | ||
e5e809f4 | 3796 | if (POINTER_TYPE_P (type)) |
7f070d5e RK |
3797 | mark_reg_pointer (DECL_RTL (decl), |
3798 | (TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))) | |
3799 | / BITS_PER_UNIT)); | |
28d81abb | 3800 | } |
0df15c2c | 3801 | |
4559fd9e | 3802 | else if (TREE_CODE (DECL_SIZE_UNIT (decl)) == INTEGER_CST |
5e4ef18a | 3803 | && ! (flag_stack_check && ! STACK_CHECK_BUILTIN |
05bccae2 RK |
3804 | && 0 < compare_tree_int (DECL_SIZE_UNIT (decl), |
3805 | STACK_CHECK_MAX_VAR_SIZE))) | |
28d81abb RK |
3806 | { |
3807 | /* Variable of fixed size that goes on the stack. */ | |
3808 | rtx oldaddr = 0; | |
3809 | rtx addr; | |
3810 | ||
3811 | /* If we previously made RTL for this decl, it must be an array | |
3812 | whose size was determined by the initializer. | |
3813 | The old address was a register; set that register now | |
3814 | to the proper address. */ | |
3815 | if (DECL_RTL (decl) != 0) | |
3816 | { | |
3817 | if (GET_CODE (DECL_RTL (decl)) != MEM | |
3818 | || GET_CODE (XEXP (DECL_RTL (decl), 0)) != REG) | |
3819 | abort (); | |
3820 | oldaddr = XEXP (DECL_RTL (decl), 0); | |
3821 | } | |
3822 | ||
d16790f2 | 3823 | DECL_RTL (decl) = assign_temp (TREE_TYPE (decl), 1, 1, 1); |
c6df88cb MM |
3824 | MEM_SET_IN_STRUCT_P (DECL_RTL (decl), |
3825 | AGGREGATE_TYPE_P (TREE_TYPE (decl))); | |
28d81abb RK |
3826 | |
3827 | /* Set alignment we actually gave this decl. */ | |
3828 | DECL_ALIGN (decl) = (DECL_MODE (decl) == BLKmode ? BIGGEST_ALIGNMENT | |
3829 | : GET_MODE_BITSIZE (DECL_MODE (decl))); | |
3830 | ||
3831 | if (oldaddr) | |
3832 | { | |
3833 | addr = force_operand (XEXP (DECL_RTL (decl), 0), oldaddr); | |
3834 | if (addr != oldaddr) | |
3835 | emit_move_insn (oldaddr, addr); | |
3836 | } | |
3837 | ||
3838 | /* If this is a memory ref that contains aggregate components, | |
3839 | mark it as such for cse and loop optimize. */ | |
c6df88cb MM |
3840 | MEM_SET_IN_STRUCT_P (DECL_RTL (decl), |
3841 | AGGREGATE_TYPE_P (TREE_TYPE (decl))); | |
28d81abb RK |
3842 | #if 0 |
3843 | /* If this is in memory because of -ffloat-store, | |
3844 | set the volatile bit, to prevent optimizations from | |
3845 | undoing the effects. */ | |
3846 | if (flag_float_store && TREE_CODE (type) == REAL_TYPE) | |
3847 | MEM_VOLATILE_P (DECL_RTL (decl)) = 1; | |
3848 | #endif | |
41472af8 MM |
3849 | |
3850 | MEM_ALIAS_SET (DECL_RTL (decl)) = get_alias_set (decl); | |
28d81abb RK |
3851 | } |
3852 | else | |
3853 | /* Dynamic-size object: must push space on the stack. */ | |
3854 | { | |
3855 | rtx address, size; | |
3856 | ||
3857 | /* Record the stack pointer on entry to block, if have | |
3858 | not already done so. */ | |
3859 | if (thisblock->data.block.stack_level == 0) | |
3860 | { | |
3861 | do_pending_stack_adjust (); | |
59257ff7 RK |
3862 | emit_stack_save (thisblock->next ? SAVE_BLOCK : SAVE_FUNCTION, |
3863 | &thisblock->data.block.stack_level, | |
3864 | thisblock->data.block.first_insn); | |
28d81abb RK |
3865 | stack_block_stack = thisblock; |
3866 | } | |
3867 | ||
4d9af632 JM |
3868 | /* In function-at-a-time mode, variable_size doesn't expand this, |
3869 | so do it now. */ | |
3870 | if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type)) | |
3871 | expand_expr (TYPE_MAX_VALUE (TYPE_DOMAIN (type)), | |
3872 | const0_rtx, VOIDmode, 0); | |
3873 | ||
28d81abb | 3874 | /* Compute the variable's size, in bytes. */ |
4559fd9e | 3875 | size = expand_expr (DECL_SIZE_UNIT (decl), NULL_RTX, VOIDmode, 0); |
28d81abb RK |
3876 | free_temp_slots (); |
3877 | ||
ff91ad08 RK |
3878 | /* Allocate space on the stack for the variable. Note that |
3879 | DECL_ALIGN says how the variable is to be aligned and we | |
3880 | cannot use it to conclude anything about the alignment of | |
3881 | the size. */ | |
37366632 | 3882 | address = allocate_dynamic_stack_space (size, NULL_RTX, |
ff91ad08 | 3883 | TYPE_ALIGN (TREE_TYPE (decl))); |
28d81abb | 3884 | |
28d81abb | 3885 | /* Reference the variable indirect through that rtx. */ |
38a448ca | 3886 | DECL_RTL (decl) = gen_rtx_MEM (DECL_MODE (decl), address); |
28d81abb | 3887 | |
2207e295 RS |
3888 | /* If this is a memory ref that contains aggregate components, |
3889 | mark it as such for cse and loop optimize. */ | |
c6df88cb MM |
3890 | MEM_SET_IN_STRUCT_P (DECL_RTL (decl), |
3891 | AGGREGATE_TYPE_P (TREE_TYPE (decl))); | |
2207e295 | 3892 | |
28d81abb RK |
3893 | /* Indicate the alignment we actually gave this variable. */ |
3894 | #ifdef STACK_BOUNDARY | |
3895 | DECL_ALIGN (decl) = STACK_BOUNDARY; | |
3896 | #else | |
3897 | DECL_ALIGN (decl) = BIGGEST_ALIGNMENT; | |
3898 | #endif | |
3899 | } | |
3900 | ||
3901 | if (TREE_THIS_VOLATILE (decl)) | |
3902 | MEM_VOLATILE_P (DECL_RTL (decl)) = 1; | |
f5a50010 | 3903 | |
28d81abb RK |
3904 | if (TREE_READONLY (decl)) |
3905 | RTX_UNCHANGING_P (DECL_RTL (decl)) = 1; | |
28d81abb RK |
3906 | } |
3907 | \f | |
3908 | /* Emit code to perform the initialization of a declaration DECL. */ | |
3909 | ||
3910 | void | |
3911 | expand_decl_init (decl) | |
3912 | tree decl; | |
3913 | { | |
b4ac57ab RS |
3914 | int was_used = TREE_USED (decl); |
3915 | ||
3564e40e RK |
3916 | /* If this is a CONST_DECL, we don't have to generate any code, but |
3917 | if DECL_INITIAL is a constant, call expand_expr to force TREE_CST_RTL | |
3918 | to be set while in the obstack containing the constant. If we don't | |
3919 | do this, we can lose if we have functions nested three deep and the middle | |
3920 | function makes a CONST_DECL whose DECL_INITIAL is a STRING_CST while | |
3921 | the innermost function is the first to expand that STRING_CST. */ | |
3922 | if (TREE_CODE (decl) == CONST_DECL) | |
3923 | { | |
3924 | if (DECL_INITIAL (decl) && TREE_CONSTANT (DECL_INITIAL (decl))) | |
3925 | expand_expr (DECL_INITIAL (decl), NULL_RTX, VOIDmode, | |
3926 | EXPAND_INITIALIZER); | |
3927 | return; | |
3928 | } | |
3929 | ||
28d81abb RK |
3930 | if (TREE_STATIC (decl)) |
3931 | return; | |
3932 | ||
3933 | /* Compute and store the initial value now. */ | |
3934 | ||
3935 | if (DECL_INITIAL (decl) == error_mark_node) | |
3936 | { | |
3937 | enum tree_code code = TREE_CODE (TREE_TYPE (decl)); | |
e5e809f4 | 3938 | |
28d81abb | 3939 | if (code == INTEGER_TYPE || code == REAL_TYPE || code == ENUMERAL_TYPE |
e5e809f4 | 3940 | || code == POINTER_TYPE || code == REFERENCE_TYPE) |
28d81abb RK |
3941 | expand_assignment (decl, convert (TREE_TYPE (decl), integer_zero_node), |
3942 | 0, 0); | |
3943 | emit_queue (); | |
3944 | } | |
3945 | else if (DECL_INITIAL (decl) && TREE_CODE (DECL_INITIAL (decl)) != TREE_LIST) | |
3946 | { | |
3947 | emit_line_note (DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl)); | |
3948 | expand_assignment (decl, DECL_INITIAL (decl), 0, 0); | |
3949 | emit_queue (); | |
3950 | } | |
3951 | ||
b4ac57ab RS |
3952 | /* Don't let the initialization count as "using" the variable. */ |
3953 | TREE_USED (decl) = was_used; | |
3954 | ||
28d81abb | 3955 | /* Free any temporaries we made while initializing the decl. */ |
ae8c59c0 | 3956 | preserve_temp_slots (NULL_RTX); |
28d81abb RK |
3957 | free_temp_slots (); |
3958 | } | |
3959 | ||
3960 | /* CLEANUP is an expression to be executed at exit from this binding contour; | |
3961 | for example, in C++, it might call the destructor for this variable. | |
3962 | ||
4847c938 MS |
3963 | We wrap CLEANUP in an UNSAVE_EXPR node, so that we can expand the |
3964 | CLEANUP multiple times, and have the correct semantics. This | |
e976b8b2 MS |
3965 | happens in exception handling, for gotos, returns, breaks that |
3966 | leave the current scope. | |
28d81abb RK |
3967 | |
3968 | If CLEANUP is nonzero and DECL is zero, we record a cleanup | |
3969 | that is not associated with any particular variable. */ | |
3970 | ||
3971 | int | |
3972 | expand_decl_cleanup (decl, cleanup) | |
3973 | tree decl, cleanup; | |
3974 | { | |
3f1d071b | 3975 | struct nesting *thisblock; |
28d81abb RK |
3976 | |
3977 | /* Error if we are not in any block. */ | |
01d939e8 | 3978 | if (cfun == 0 || block_stack == 0) |
28d81abb RK |
3979 | return 0; |
3980 | ||
3f1d071b BS |
3981 | thisblock = block_stack; |
3982 | ||
28d81abb RK |
3983 | /* Record the cleanup if there is one. */ |
3984 | ||
3985 | if (cleanup != 0) | |
3986 | { | |
e976b8b2 MS |
3987 | tree t; |
3988 | rtx seq; | |
3989 | tree *cleanups = &thisblock->data.block.cleanups; | |
3990 | int cond_context = conditional_context (); | |
3991 | ||
3992 | if (cond_context) | |
3993 | { | |
3994 | rtx flag = gen_reg_rtx (word_mode); | |
3995 | rtx set_flag_0; | |
3996 | tree cond; | |
3997 | ||
3998 | start_sequence (); | |
3999 | emit_move_insn (flag, const0_rtx); | |
4000 | set_flag_0 = get_insns (); | |
4001 | end_sequence (); | |
4002 | ||
4003 | thisblock->data.block.last_unconditional_cleanup | |
4004 | = emit_insns_after (set_flag_0, | |
4005 | thisblock->data.block.last_unconditional_cleanup); | |
4006 | ||
4007 | emit_move_insn (flag, const1_rtx); | |
4008 | ||
4009 | /* All cleanups must be on the function_obstack. */ | |
4010 | push_obstacks_nochange (); | |
4011 | resume_temporary_allocation (); | |
4012 | ||
4013 | cond = build_decl (VAR_DECL, NULL_TREE, type_for_mode (word_mode, 1)); | |
4014 | DECL_RTL (cond) = flag; | |
4015 | ||
4016 | /* Conditionalize the cleanup. */ | |
4017 | cleanup = build (COND_EXPR, void_type_node, | |
4018 | truthvalue_conversion (cond), | |
4019 | cleanup, integer_zero_node); | |
4020 | cleanup = fold (cleanup); | |
4021 | ||
4022 | pop_obstacks (); | |
4023 | ||
4024 | cleanups = thisblock->data.block.cleanup_ptr; | |
4025 | } | |
4026 | ||
4027 | /* All cleanups must be on the function_obstack. */ | |
4028 | push_obstacks_nochange (); | |
4029 | resume_temporary_allocation (); | |
4847c938 | 4030 | cleanup = unsave_expr (cleanup); |
e976b8b2 MS |
4031 | pop_obstacks (); |
4032 | ||
4033 | t = *cleanups = temp_tree_cons (decl, cleanup, *cleanups); | |
4034 | ||
4035 | if (! cond_context) | |
4036 | /* If this block has a cleanup, it belongs in stack_block_stack. */ | |
4037 | stack_block_stack = thisblock; | |
4038 | ||
4039 | if (cond_context) | |
4040 | { | |
4041 | start_sequence (); | |
4042 | } | |
4847c938 | 4043 | |
e976b8b2 MS |
4044 | /* If this was optimized so that there is no exception region for the |
4045 | cleanup, then mark the TREE_LIST node, so that we can later tell | |
4046 | if we need to call expand_eh_region_end. */ | |
e9a25f70 JL |
4047 | if (! using_eh_for_cleanups_p |
4048 | || expand_eh_region_start_tree (decl, cleanup)) | |
e976b8b2 | 4049 | TREE_ADDRESSABLE (t) = 1; |
716cc7f7 JM |
4050 | /* If that started a new EH region, we're in a new block. */ |
4051 | thisblock = block_stack; | |
e976b8b2 MS |
4052 | |
4053 | if (cond_context) | |
4054 | { | |
4055 | seq = get_insns (); | |
4056 | end_sequence (); | |
7e82801f MS |
4057 | if (seq) |
4058 | thisblock->data.block.last_unconditional_cleanup | |
4059 | = emit_insns_after (seq, | |
4060 | thisblock->data.block.last_unconditional_cleanup); | |
e976b8b2 MS |
4061 | } |
4062 | else | |
4063 | { | |
4064 | thisblock->data.block.last_unconditional_cleanup | |
4065 | = get_last_insn (); | |
4066 | thisblock->data.block.cleanup_ptr = &thisblock->data.block.cleanups; | |
4067 | } | |
28d81abb RK |
4068 | } |
4069 | return 1; | |
4070 | } | |
e976b8b2 | 4071 | |
c7ae64f2 JM |
4072 | /* Like expand_decl_cleanup, but suppress generating an exception handler |
4073 | to perform the cleanup. */ | |
4074 | ||
95d75019 | 4075 | #if 0 |
c7ae64f2 JM |
4076 | int |
4077 | expand_decl_cleanup_no_eh (decl, cleanup) | |
4078 | tree decl, cleanup; | |
4079 | { | |
4080 | int save_eh = using_eh_for_cleanups_p; | |
b472527b JL |
4081 | int result; |
4082 | ||
c7ae64f2 | 4083 | using_eh_for_cleanups_p = 0; |
b472527b | 4084 | result = expand_decl_cleanup (decl, cleanup); |
c7ae64f2 | 4085 | using_eh_for_cleanups_p = save_eh; |
b472527b JL |
4086 | |
4087 | return result; | |
c7ae64f2 | 4088 | } |
95d75019 | 4089 | #endif |
c7ae64f2 | 4090 | |
e976b8b2 | 4091 | /* Arrange for the top element of the dynamic cleanup chain to be |
4c581243 MS |
4092 | popped if we exit the current binding contour. DECL is the |
4093 | associated declaration, if any, otherwise NULL_TREE. If the | |
4094 | current contour is left via an exception, then __sjthrow will pop | |
4095 | the top element off the dynamic cleanup chain. The code that | |
4096 | avoids doing the action we push into the cleanup chain in the | |
4097 | exceptional case is contained in expand_cleanups. | |
e976b8b2 MS |
4098 | |
4099 | This routine is only used by expand_eh_region_start, and that is | |
4100 | the only way in which an exception region should be started. This | |
4101 | routine is only used when using the setjmp/longjmp codegen method | |
4102 | for exception handling. */ | |
4103 | ||
4104 | int | |
4c581243 MS |
4105 | expand_dcc_cleanup (decl) |
4106 | tree decl; | |
e976b8b2 | 4107 | { |
3f1d071b | 4108 | struct nesting *thisblock; |
e976b8b2 MS |
4109 | tree cleanup; |
4110 | ||
4111 | /* Error if we are not in any block. */ | |
01d939e8 | 4112 | if (cfun == 0 || block_stack == 0) |
e976b8b2 | 4113 | return 0; |
3f1d071b | 4114 | thisblock = block_stack; |
e976b8b2 MS |
4115 | |
4116 | /* Record the cleanup for the dynamic handler chain. */ | |
4117 | ||
4118 | /* All cleanups must be on the function_obstack. */ | |
4119 | push_obstacks_nochange (); | |
4120 | resume_temporary_allocation (); | |
4121 | cleanup = make_node (POPDCC_EXPR); | |
4122 | pop_obstacks (); | |
4123 | ||
4124 | /* Add the cleanup in a manner similar to expand_decl_cleanup. */ | |
4125 | thisblock->data.block.cleanups | |
4c581243 | 4126 | = temp_tree_cons (decl, cleanup, thisblock->data.block.cleanups); |
e976b8b2 MS |
4127 | |
4128 | /* If this block has a cleanup, it belongs in stack_block_stack. */ | |
4129 | stack_block_stack = thisblock; | |
4130 | return 1; | |
4131 | } | |
4132 | ||
4133 | /* Arrange for the top element of the dynamic handler chain to be | |
4c581243 | 4134 | popped if we exit the current binding contour. DECL is the |
956d6950 | 4135 | associated declaration, if any, otherwise NULL_TREE. If the current |
4c581243 MS |
4136 | contour is left via an exception, then __sjthrow will pop the top |
4137 | element off the dynamic handler chain. The code that avoids doing | |
4138 | the action we push into the handler chain in the exceptional case | |
4139 | is contained in expand_cleanups. | |
e976b8b2 MS |
4140 | |
4141 | This routine is only used by expand_eh_region_start, and that is | |
4142 | the only way in which an exception region should be started. This | |
4143 | routine is only used when using the setjmp/longjmp codegen method | |
4144 | for exception handling. */ | |
4145 | ||
4146 | int | |
4c581243 MS |
4147 | expand_dhc_cleanup (decl) |
4148 | tree decl; | |
e976b8b2 | 4149 | { |
3f1d071b | 4150 | struct nesting *thisblock; |
e976b8b2 MS |
4151 | tree cleanup; |
4152 | ||
4153 | /* Error if we are not in any block. */ | |
01d939e8 | 4154 | if (cfun == 0 || block_stack == 0) |
e976b8b2 | 4155 | return 0; |
3f1d071b | 4156 | thisblock = block_stack; |
e976b8b2 MS |
4157 | |
4158 | /* Record the cleanup for the dynamic handler chain. */ | |
4159 | ||
4160 | /* All cleanups must be on the function_obstack. */ | |
4161 | push_obstacks_nochange (); | |
4162 | resume_temporary_allocation (); | |
4163 | cleanup = make_node (POPDHC_EXPR); | |
4164 | pop_obstacks (); | |
4165 | ||
4166 | /* Add the cleanup in a manner similar to expand_decl_cleanup. */ | |
4167 | thisblock->data.block.cleanups | |
4c581243 | 4168 | = temp_tree_cons (decl, cleanup, thisblock->data.block.cleanups); |
e976b8b2 MS |
4169 | |
4170 | /* If this block has a cleanup, it belongs in stack_block_stack. */ | |
4171 | stack_block_stack = thisblock; | |
4172 | return 1; | |
4173 | } | |
28d81abb RK |
4174 | \f |
4175 | /* DECL is an anonymous union. CLEANUP is a cleanup for DECL. | |
4176 | DECL_ELTS is the list of elements that belong to DECL's type. | |
4177 | In each, the TREE_VALUE is a VAR_DECL, and the TREE_PURPOSE a cleanup. */ | |
4178 | ||
4179 | void | |
4180 | expand_anon_union_decl (decl, cleanup, decl_elts) | |
4181 | tree decl, cleanup, decl_elts; | |
4182 | { | |
01d939e8 | 4183 | struct nesting *thisblock = cfun == 0 ? 0 : block_stack; |
28d81abb | 4184 | rtx x; |
8a693bd0 | 4185 | tree t; |
28d81abb | 4186 | |
8a693bd0 MM |
4187 | /* If any of the elements are addressable, so is the entire union. */ |
4188 | for (t = decl_elts; t; t = TREE_CHAIN (t)) | |
4189 | if (TREE_ADDRESSABLE (TREE_VALUE (t))) | |
4190 | { | |
4191 | TREE_ADDRESSABLE (decl) = 1; | |
4192 | break; | |
4193 | } | |
4194 | ||
ec5cd386 RK |
4195 | expand_decl (decl); |
4196 | expand_decl_cleanup (decl, cleanup); | |
28d81abb RK |
4197 | x = DECL_RTL (decl); |
4198 | ||
8a693bd0 MM |
4199 | /* Go through the elements, assigning RTL to each. */ |
4200 | for (t = decl_elts; t; t = TREE_CHAIN (t)) | |
28d81abb | 4201 | { |
8a693bd0 MM |
4202 | tree decl_elt = TREE_VALUE (t); |
4203 | tree cleanup_elt = TREE_PURPOSE (t); | |
28d81abb RK |
4204 | enum machine_mode mode = TYPE_MODE (TREE_TYPE (decl_elt)); |
4205 | ||
7b9032dd JM |
4206 | /* Propagate the union's alignment to the elements. */ |
4207 | DECL_ALIGN (decl_elt) = DECL_ALIGN (decl); | |
4208 | ||
4209 | /* If the element has BLKmode and the union doesn't, the union is | |
4210 | aligned such that the element doesn't need to have BLKmode, so | |
4211 | change the element's mode to the appropriate one for its size. */ | |
4212 | if (mode == BLKmode && DECL_MODE (decl) != BLKmode) | |
4213 | DECL_MODE (decl_elt) = mode | |
05bccae2 | 4214 | = mode_for_size_tree (DECL_SIZE (decl_elt), MODE_INT, 1); |
7b9032dd | 4215 | |
28d81abb RK |
4216 | /* (SUBREG (MEM ...)) at RTL generation time is invalid, so we |
4217 | instead create a new MEM rtx with the proper mode. */ | |
4218 | if (GET_CODE (x) == MEM) | |
4219 | { | |
4220 | if (mode == GET_MODE (x)) | |
4221 | DECL_RTL (decl_elt) = x; | |
4222 | else | |
4223 | { | |
38a448ca | 4224 | DECL_RTL (decl_elt) = gen_rtx_MEM (mode, copy_rtx (XEXP (x, 0))); |
c6df88cb | 4225 | MEM_COPY_ATTRIBUTES (DECL_RTL (decl_elt), x); |
28d81abb RK |
4226 | RTX_UNCHANGING_P (DECL_RTL (decl_elt)) = RTX_UNCHANGING_P (x); |
4227 | } | |
4228 | } | |
4229 | else if (GET_CODE (x) == REG) | |
4230 | { | |
4231 | if (mode == GET_MODE (x)) | |
4232 | DECL_RTL (decl_elt) = x; | |
4233 | else | |
38a448ca | 4234 | DECL_RTL (decl_elt) = gen_rtx_SUBREG (mode, x, 0); |
28d81abb RK |
4235 | } |
4236 | else | |
4237 | abort (); | |
4238 | ||
4239 | /* Record the cleanup if there is one. */ | |
4240 | ||
4241 | if (cleanup != 0) | |
4242 | thisblock->data.block.cleanups | |
4243 | = temp_tree_cons (decl_elt, cleanup_elt, | |
4244 | thisblock->data.block.cleanups); | |
28d81abb RK |
4245 | } |
4246 | } | |
4247 | \f | |
4248 | /* Expand a list of cleanups LIST. | |
4249 | Elements may be expressions or may be nested lists. | |
4250 | ||
4251 | If DONT_DO is nonnull, then any list-element | |
4252 | whose TREE_PURPOSE matches DONT_DO is omitted. | |
4253 | This is sometimes used to avoid a cleanup associated with | |
4e44807b MS |
4254 | a value that is being returned out of the scope. |
4255 | ||
4256 | If IN_FIXUP is non-zero, we are generating this cleanup for a fixup | |
50d1b7a1 MS |
4257 | goto and handle protection regions specially in that case. |
4258 | ||
4259 | If REACHABLE, we emit code, otherwise just inform the exception handling | |
4260 | code about this finalization. */ | |
28d81abb RK |
4261 | |
4262 | static void | |
50d1b7a1 | 4263 | expand_cleanups (list, dont_do, in_fixup, reachable) |
28d81abb RK |
4264 | tree list; |
4265 | tree dont_do; | |
4e44807b | 4266 | int in_fixup; |
50d1b7a1 | 4267 | int reachable; |
28d81abb RK |
4268 | { |
4269 | tree tail; | |
4270 | for (tail = list; tail; tail = TREE_CHAIN (tail)) | |
4271 | if (dont_do == 0 || TREE_PURPOSE (tail) != dont_do) | |
4272 | { | |
4273 | if (TREE_CODE (TREE_VALUE (tail)) == TREE_LIST) | |
50d1b7a1 | 4274 | expand_cleanups (TREE_VALUE (tail), dont_do, in_fixup, reachable); |
28d81abb RK |
4275 | else |
4276 | { | |
4e44807b | 4277 | if (! in_fixup) |
e976b8b2 MS |
4278 | { |
4279 | tree cleanup = TREE_VALUE (tail); | |
4280 | ||
4281 | /* See expand_d{h,c}c_cleanup for why we avoid this. */ | |
4282 | if (TREE_CODE (cleanup) != POPDHC_EXPR | |
4283 | && TREE_CODE (cleanup) != POPDCC_EXPR | |
4284 | /* See expand_eh_region_start_tree for this case. */ | |
4285 | && ! TREE_ADDRESSABLE (tail)) | |
4286 | { | |
4287 | cleanup = protect_with_terminate (cleanup); | |
4288 | expand_eh_region_end (cleanup); | |
4289 | } | |
4290 | } | |
61d6b1cc | 4291 | |
50d1b7a1 MS |
4292 | if (reachable) |
4293 | { | |
4294 | /* Cleanups may be run multiple times. For example, | |
4295 | when exiting a binding contour, we expand the | |
4296 | cleanups associated with that contour. When a goto | |
4297 | within that binding contour has a target outside that | |
4298 | contour, it will expand all cleanups from its scope to | |
4299 | the target. Though the cleanups are expanded multiple | |
4300 | times, the control paths are non-overlapping so the | |
4301 | cleanups will not be executed twice. */ | |
9762d48d JM |
4302 | |
4303 | /* We may need to protect fixups with rethrow regions. */ | |
4304 | int protect = (in_fixup && ! TREE_ADDRESSABLE (tail)); | |
e5e809f4 | 4305 | |
9762d48d JM |
4306 | if (protect) |
4307 | expand_fixup_region_start (); | |
e5e809f4 | 4308 | |
f54a7f6f MM |
4309 | /* The cleanup might contain try-blocks, so we have to |
4310 | preserve our current queue. */ | |
4311 | push_ehqueue (); | |
50d1b7a1 | 4312 | expand_expr (TREE_VALUE (tail), const0_rtx, VOIDmode, 0); |
f54a7f6f | 4313 | pop_ehqueue (); |
9762d48d JM |
4314 | if (protect) |
4315 | expand_fixup_region_end (TREE_VALUE (tail)); | |
50d1b7a1 MS |
4316 | free_temp_slots (); |
4317 | } | |
28d81abb RK |
4318 | } |
4319 | } | |
4320 | } | |
4321 | ||
e976b8b2 MS |
4322 | /* Mark when the context we are emitting RTL for as a conditional |
4323 | context, so that any cleanup actions we register with | |
4324 | expand_decl_init will be properly conditionalized when those | |
4325 | cleanup actions are later performed. Must be called before any | |
956d6950 | 4326 | expression (tree) is expanded that is within a conditional context. */ |
e976b8b2 MS |
4327 | |
4328 | void | |
956d6950 | 4329 | start_cleanup_deferral () |
e976b8b2 | 4330 | { |
e3eef942 JW |
4331 | /* block_stack can be NULL if we are inside the parameter list. It is |
4332 | OK to do nothing, because cleanups aren't possible here. */ | |
4333 | if (block_stack) | |
4334 | ++block_stack->data.block.conditional_code; | |
e976b8b2 MS |
4335 | } |
4336 | ||
4337 | /* Mark the end of a conditional region of code. Because cleanup | |
956d6950 | 4338 | deferrals may be nested, we may still be in a conditional region |
e976b8b2 MS |
4339 | after we end the currently deferred cleanups, only after we end all |
4340 | deferred cleanups, are we back in unconditional code. */ | |
4341 | ||
4342 | void | |
956d6950 | 4343 | end_cleanup_deferral () |
e976b8b2 | 4344 | { |
e3eef942 JW |
4345 | /* block_stack can be NULL if we are inside the parameter list. It is |
4346 | OK to do nothing, because cleanups aren't possible here. */ | |
4347 | if (block_stack) | |
4348 | --block_stack->data.block.conditional_code; | |
e976b8b2 MS |
4349 | } |
4350 | ||
28d81abb RK |
4351 | /* Move all cleanups from the current block_stack |
4352 | to the containing block_stack, where they are assumed to | |
4353 | have been created. If anything can cause a temporary to | |
4354 | be created, but not expanded for more than one level of | |
4355 | block_stacks, then this code will have to change. */ | |
4356 | ||
4357 | void | |
4358 | move_cleanups_up () | |
4359 | { | |
4360 | struct nesting *block = block_stack; | |
4361 | struct nesting *outer = block->next; | |
4362 | ||
4363 | outer->data.block.cleanups | |
4364 | = chainon (block->data.block.cleanups, | |
4365 | outer->data.block.cleanups); | |
4366 | block->data.block.cleanups = 0; | |
4367 | } | |
4368 | ||
4369 | tree | |
4370 | last_cleanup_this_contour () | |
4371 | { | |
4372 | if (block_stack == 0) | |
4373 | return 0; | |
4374 | ||
4375 | return block_stack->data.block.cleanups; | |
4376 | } | |
4377 | ||
4378 | /* Return 1 if there are any pending cleanups at this point. | |
4379 | If THIS_CONTOUR is nonzero, check the current contour as well. | |
4380 | Otherwise, look only at the contours that enclose this one. */ | |
4381 | ||
4382 | int | |
4383 | any_pending_cleanups (this_contour) | |
4384 | int this_contour; | |
4385 | { | |
4386 | struct nesting *block; | |
4387 | ||
01d939e8 | 4388 | if (cfun == NULL || cfun->stmt == NULL || block_stack == 0) |
28d81abb RK |
4389 | return 0; |
4390 | ||
4391 | if (this_contour && block_stack->data.block.cleanups != NULL) | |
4392 | return 1; | |
4393 | if (block_stack->data.block.cleanups == 0 | |
e976b8b2 | 4394 | && block_stack->data.block.outer_cleanups == 0) |
28d81abb RK |
4395 | return 0; |
4396 | ||
4397 | for (block = block_stack->next; block; block = block->next) | |
4398 | if (block->data.block.cleanups != 0) | |
4399 | return 1; | |
4400 | ||
4401 | return 0; | |
4402 | } | |
4403 | \f | |
4404 | /* Enter a case (Pascal) or switch (C) statement. | |
4405 | Push a block onto case_stack and nesting_stack | |
4406 | to accumulate the case-labels that are seen | |
4407 | and to record the labels generated for the statement. | |
4408 | ||
4409 | EXIT_FLAG is nonzero if `exit_something' should exit this case stmt. | |
4410 | Otherwise, this construct is transparent for `exit_something'. | |
4411 | ||
4412 | EXPR is the index-expression to be dispatched on. | |
4413 | TYPE is its nominal type. We could simply convert EXPR to this type, | |
4414 | but instead we take short cuts. */ | |
4415 | ||
4416 | void | |
4417 | expand_start_case (exit_flag, expr, type, printname) | |
4418 | int exit_flag; | |
4419 | tree expr; | |
4420 | tree type; | |
dff01034 | 4421 | const char *printname; |
28d81abb RK |
4422 | { |
4423 | register struct nesting *thiscase = ALLOC_NESTING (); | |
4424 | ||
4425 | /* Make an entry on case_stack for the case we are entering. */ | |
4426 | ||
4427 | thiscase->next = case_stack; | |
4428 | thiscase->all = nesting_stack; | |
4429 | thiscase->depth = ++nesting_depth; | |
4430 | thiscase->exit_label = exit_flag ? gen_label_rtx () : 0; | |
4431 | thiscase->data.case_stmt.case_list = 0; | |
4432 | thiscase->data.case_stmt.index_expr = expr; | |
4433 | thiscase->data.case_stmt.nominal_type = type; | |
4434 | thiscase->data.case_stmt.default_label = 0; | |
4435 | thiscase->data.case_stmt.num_ranges = 0; | |
4436 | thiscase->data.case_stmt.printname = printname; | |
a11759a3 | 4437 | thiscase->data.case_stmt.line_number_status = force_line_numbers (); |
28d81abb RK |
4438 | case_stack = thiscase; |
4439 | nesting_stack = thiscase; | |
4440 | ||
4441 | do_pending_stack_adjust (); | |
4442 | ||
4443 | /* Make sure case_stmt.start points to something that won't | |
4444 | need any transformation before expand_end_case. */ | |
4445 | if (GET_CODE (get_last_insn ()) != NOTE) | |
37366632 | 4446 | emit_note (NULL_PTR, NOTE_INSN_DELETED); |
28d81abb RK |
4447 | |
4448 | thiscase->data.case_stmt.start = get_last_insn (); | |
4c581243 | 4449 | |
956d6950 | 4450 | start_cleanup_deferral (); |
28d81abb RK |
4451 | } |
4452 | ||
ca695ac9 | 4453 | |
28d81abb RK |
4454 | /* Start a "dummy case statement" within which case labels are invalid |
4455 | and are not connected to any larger real case statement. | |
4456 | This can be used if you don't want to let a case statement jump | |
4457 | into the middle of certain kinds of constructs. */ | |
4458 | ||
4459 | void | |
4460 | expand_start_case_dummy () | |
4461 | { | |
4462 | register struct nesting *thiscase = ALLOC_NESTING (); | |
4463 | ||
4464 | /* Make an entry on case_stack for the dummy. */ | |
4465 | ||
4466 | thiscase->next = case_stack; | |
4467 | thiscase->all = nesting_stack; | |
4468 | thiscase->depth = ++nesting_depth; | |
4469 | thiscase->exit_label = 0; | |
4470 | thiscase->data.case_stmt.case_list = 0; | |
4471 | thiscase->data.case_stmt.start = 0; | |
4472 | thiscase->data.case_stmt.nominal_type = 0; | |
4473 | thiscase->data.case_stmt.default_label = 0; | |
4474 | thiscase->data.case_stmt.num_ranges = 0; | |
4475 | case_stack = thiscase; | |
4476 | nesting_stack = thiscase; | |
956d6950 | 4477 | start_cleanup_deferral (); |
28d81abb RK |
4478 | } |
4479 | ||
4480 | /* End a dummy case statement. */ | |
4481 | ||
4482 | void | |
4483 | expand_end_case_dummy () | |
4484 | { | |
956d6950 | 4485 | end_cleanup_deferral (); |
28d81abb RK |
4486 | POPSTACK (case_stack); |
4487 | } | |
4488 | ||
4489 | /* Return the data type of the index-expression | |
4490 | of the innermost case statement, or null if none. */ | |
4491 | ||
4492 | tree | |
4493 | case_index_expr_type () | |
4494 | { | |
4495 | if (case_stack) | |
4496 | return TREE_TYPE (case_stack->data.case_stmt.index_expr); | |
4497 | return 0; | |
4498 | } | |
4499 | \f | |
a11759a3 JR |
4500 | static void |
4501 | check_seenlabel () | |
4502 | { | |
4503 | /* If this is the first label, warn if any insns have been emitted. */ | |
4504 | if (case_stack->data.case_stmt.line_number_status >= 0) | |
4505 | { | |
4506 | rtx insn; | |
4507 | ||
4508 | restore_line_number_status | |
4509 | (case_stack->data.case_stmt.line_number_status); | |
4510 | case_stack->data.case_stmt.line_number_status = -1; | |
4511 | ||
4512 | for (insn = case_stack->data.case_stmt.start; | |
4513 | insn; | |
4514 | insn = NEXT_INSN (insn)) | |
4515 | { | |
4516 | if (GET_CODE (insn) == CODE_LABEL) | |
4517 | break; | |
4518 | if (GET_CODE (insn) != NOTE | |
4519 | && (GET_CODE (insn) != INSN || GET_CODE (PATTERN (insn)) != USE)) | |
4520 | { | |
4521 | do | |
4522 | insn = PREV_INSN (insn); | |
0dacbd0e JW |
4523 | while (insn && (GET_CODE (insn) != NOTE || NOTE_LINE_NUMBER (insn) < 0)); |
4524 | ||
4525 | /* If insn is zero, then there must have been a syntax error. */ | |
4526 | if (insn) | |
4527 | warning_with_file_and_line (NOTE_SOURCE_FILE(insn), | |
4528 | NOTE_LINE_NUMBER(insn), | |
4529 | "unreachable code at beginning of %s", | |
4530 | case_stack->data.case_stmt.printname); | |
a11759a3 JR |
4531 | break; |
4532 | } | |
4533 | } | |
4534 | } | |
4535 | } | |
4536 | ||
28d81abb RK |
4537 | /* Accumulate one case or default label inside a case or switch statement. |
4538 | VALUE is the value of the case (a null pointer, for a default label). | |
f52fba84 PE |
4539 | The function CONVERTER, when applied to arguments T and V, |
4540 | converts the value V to the type T. | |
28d81abb RK |
4541 | |
4542 | If not currently inside a case or switch statement, return 1 and do | |
4543 | nothing. The caller will print a language-specific error message. | |
4544 | If VALUE is a duplicate or overlaps, return 2 and do nothing | |
4545 | except store the (first) duplicate node in *DUPLICATE. | |
4546 | If VALUE is out of range, return 3 and do nothing. | |
e976b8b2 | 4547 | If we are jumping into the scope of a cleanup or var-sized array, return 5. |
28d81abb RK |
4548 | Return 0 on success. |
4549 | ||
4550 | Extended to handle range statements. */ | |
4551 | ||
4552 | int | |
f52fba84 | 4553 | pushcase (value, converter, label, duplicate) |
28d81abb | 4554 | register tree value; |
cdadb1dd | 4555 | tree (*converter) PARAMS ((tree, tree)); |
28d81abb RK |
4556 | register tree label; |
4557 | tree *duplicate; | |
4558 | { | |
28d81abb RK |
4559 | tree index_type; |
4560 | tree nominal_type; | |
4561 | ||
4562 | /* Fail if not inside a real case statement. */ | |
4563 | if (! (case_stack && case_stack->data.case_stmt.start)) | |
4564 | return 1; | |
4565 | ||
4566 | if (stack_block_stack | |
4567 | && stack_block_stack->depth > case_stack->depth) | |
4568 | return 5; | |
4569 | ||
4570 | index_type = TREE_TYPE (case_stack->data.case_stmt.index_expr); | |
4571 | nominal_type = case_stack->data.case_stmt.nominal_type; | |
4572 | ||
4573 | /* If the index is erroneous, avoid more problems: pretend to succeed. */ | |
4574 | if (index_type == error_mark_node) | |
4575 | return 0; | |
4576 | ||
2f985ca6 JW |
4577 | /* Convert VALUE to the type in which the comparisons are nominally done. */ |
4578 | if (value != 0) | |
4579 | value = (*converter) (nominal_type, value); | |
4580 | ||
feb60352 R |
4581 | check_seenlabel (); |
4582 | ||
28d81abb RK |
4583 | /* Fail if this value is out of range for the actual type of the index |
4584 | (which may be narrower than NOMINAL_TYPE). */ | |
14a774a9 RK |
4585 | if (value != 0 |
4586 | && (TREE_CONSTANT_OVERFLOW (value) | |
4587 | || ! int_fits_type_p (value, index_type))) | |
28d81abb RK |
4588 | return 3; |
4589 | ||
4590 | /* Fail if this is a duplicate or overlaps another entry. */ | |
4591 | if (value == 0) | |
4592 | { | |
4593 | if (case_stack->data.case_stmt.default_label != 0) | |
4594 | { | |
4595 | *duplicate = case_stack->data.case_stmt.default_label; | |
4596 | return 2; | |
4597 | } | |
4598 | case_stack->data.case_stmt.default_label = label; | |
4599 | } | |
4600 | else | |
57641239 | 4601 | return add_case_node (value, value, label, duplicate); |
28d81abb RK |
4602 | |
4603 | expand_label (label); | |
4604 | return 0; | |
4605 | } | |
4606 | ||
956d6950 JL |
4607 | /* Like pushcase but this case applies to all values between VALUE1 and |
4608 | VALUE2 (inclusive). If VALUE1 is NULL, the range starts at the lowest | |
4609 | value of the index type and ends at VALUE2. If VALUE2 is NULL, the range | |
4610 | starts at VALUE1 and ends at the highest value of the index type. | |
4611 | If both are NULL, this case applies to all values. | |
4612 | ||
4613 | The return value is the same as that of pushcase but there is one | |
4614 | additional error code: 4 means the specified range was empty. */ | |
28d81abb RK |
4615 | |
4616 | int | |
f52fba84 | 4617 | pushcase_range (value1, value2, converter, label, duplicate) |
28d81abb | 4618 | register tree value1, value2; |
cdadb1dd | 4619 | tree (*converter) PARAMS ((tree, tree)); |
28d81abb RK |
4620 | register tree label; |
4621 | tree *duplicate; | |
4622 | { | |
28d81abb RK |
4623 | tree index_type; |
4624 | tree nominal_type; | |
4625 | ||
4626 | /* Fail if not inside a real case statement. */ | |
4627 | if (! (case_stack && case_stack->data.case_stmt.start)) | |
4628 | return 1; | |
4629 | ||
4630 | if (stack_block_stack | |
4631 | && stack_block_stack->depth > case_stack->depth) | |
4632 | return 5; | |
4633 | ||
4634 | index_type = TREE_TYPE (case_stack->data.case_stmt.index_expr); | |
4635 | nominal_type = case_stack->data.case_stmt.nominal_type; | |
4636 | ||
4637 | /* If the index is erroneous, avoid more problems: pretend to succeed. */ | |
4638 | if (index_type == error_mark_node) | |
4639 | return 0; | |
4640 | ||
a11759a3 | 4641 | check_seenlabel (); |
28d81abb | 4642 | |
956d6950 JL |
4643 | /* Convert VALUEs to type in which the comparisons are nominally done |
4644 | and replace any unspecified value with the corresponding bound. */ | |
4645 | if (value1 == 0) | |
1974bfb1 | 4646 | value1 = TYPE_MIN_VALUE (index_type); |
956d6950 | 4647 | if (value2 == 0) |
1974bfb1 | 4648 | value2 = TYPE_MAX_VALUE (index_type); |
956d6950 JL |
4649 | |
4650 | /* Fail if the range is empty. Do this before any conversion since | |
4651 | we want to allow out-of-range empty ranges. */ | |
14a774a9 | 4652 | if (value2 != 0 && tree_int_cst_lt (value2, value1)) |
956d6950 JL |
4653 | return 4; |
4654 | ||
e1ee5cdc RH |
4655 | /* If the max was unbounded, use the max of the nominal_type we are |
4656 | converting to. Do this after the < check above to suppress false | |
4657 | positives. */ | |
14a774a9 | 4658 | if (value2 == 0) |
e1ee5cdc | 4659 | value2 = TYPE_MAX_VALUE (nominal_type); |
28d81abb | 4660 | |
2f985ca6 JW |
4661 | value1 = (*converter) (nominal_type, value1); |
4662 | value2 = (*converter) (nominal_type, value2); | |
4663 | ||
28d81abb | 4664 | /* Fail if these values are out of range. */ |
956d6950 JL |
4665 | if (TREE_CONSTANT_OVERFLOW (value1) |
4666 | || ! int_fits_type_p (value1, index_type)) | |
28d81abb RK |
4667 | return 3; |
4668 | ||
956d6950 JL |
4669 | if (TREE_CONSTANT_OVERFLOW (value2) |
4670 | || ! int_fits_type_p (value2, index_type)) | |
28d81abb RK |
4671 | return 3; |
4672 | ||
57641239 RK |
4673 | return add_case_node (value1, value2, label, duplicate); |
4674 | } | |
4675 | ||
4676 | /* Do the actual insertion of a case label for pushcase and pushcase_range | |
4677 | into case_stack->data.case_stmt.case_list. Use an AVL tree to avoid | |
4678 | slowdown for large switch statements. */ | |
4679 | ||
4680 | static int | |
4681 | add_case_node (low, high, label, duplicate) | |
4682 | tree low, high; | |
4683 | tree label; | |
4684 | tree *duplicate; | |
4685 | { | |
4686 | struct case_node *p, **q, *r; | |
4687 | ||
4688 | q = &case_stack->data.case_stmt.case_list; | |
4689 | p = *q; | |
4690 | ||
69d4ca36 | 4691 | while ((r = *q)) |
28d81abb | 4692 | { |
57641239 RK |
4693 | p = r; |
4694 | ||
4695 | /* Keep going past elements distinctly greater than HIGH. */ | |
4696 | if (tree_int_cst_lt (high, p->low)) | |
4697 | q = &p->left; | |
4698 | ||
4699 | /* or distinctly less than LOW. */ | |
4700 | else if (tree_int_cst_lt (p->high, low)) | |
4701 | q = &p->right; | |
4702 | ||
4703 | else | |
28d81abb | 4704 | { |
57641239 RK |
4705 | /* We have an overlap; this is an error. */ |
4706 | *duplicate = p->code_label; | |
28d81abb RK |
4707 | return 2; |
4708 | } | |
4709 | } | |
4710 | ||
4711 | /* Add this label to the chain, and succeed. | |
57641239 | 4712 | Copy LOW, HIGH so they are on temporary rather than momentary |
28d81abb RK |
4713 | obstack and will thus survive till the end of the case statement. */ |
4714 | ||
57641239 RK |
4715 | r = (struct case_node *) oballoc (sizeof (struct case_node)); |
4716 | r->low = copy_node (low); | |
28d81abb | 4717 | |
57641239 RK |
4718 | /* If the bounds are equal, turn this into the one-value case. */ |
4719 | ||
4720 | if (tree_int_cst_equal (low, high)) | |
4721 | r->high = r->low; | |
4722 | else | |
4723 | { | |
4724 | r->high = copy_node (high); | |
4725 | case_stack->data.case_stmt.num_ranges++; | |
4726 | } | |
4727 | ||
4728 | r->code_label = label; | |
28d81abb RK |
4729 | expand_label (label); |
4730 | ||
57641239 RK |
4731 | *q = r; |
4732 | r->parent = p; | |
4733 | r->left = 0; | |
4734 | r->right = 0; | |
4735 | r->balance = 0; | |
4736 | ||
4737 | while (p) | |
4738 | { | |
4739 | struct case_node *s; | |
4740 | ||
4741 | if (r == p->left) | |
4742 | { | |
4743 | int b; | |
4744 | ||
4745 | if (! (b = p->balance)) | |
4746 | /* Growth propagation from left side. */ | |
4747 | p->balance = -1; | |
4748 | else if (b < 0) | |
4749 | { | |
4750 | if (r->balance < 0) | |
4751 | { | |
4752 | /* R-Rotation */ | |
51723711 | 4753 | if ((p->left = s = r->right)) |
57641239 RK |
4754 | s->parent = p; |
4755 | ||
4756 | r->right = p; | |
4757 | p->balance = 0; | |
4758 | r->balance = 0; | |
4759 | s = p->parent; | |
4760 | p->parent = r; | |
4761 | ||
51723711 | 4762 | if ((r->parent = s)) |
57641239 RK |
4763 | { |
4764 | if (s->left == p) | |
4765 | s->left = r; | |
4766 | else | |
4767 | s->right = r; | |
4768 | } | |
4769 | else | |
4770 | case_stack->data.case_stmt.case_list = r; | |
4771 | } | |
4772 | else | |
4773 | /* r->balance == +1 */ | |
4774 | { | |
5720c7e7 RK |
4775 | /* LR-Rotation */ |
4776 | ||
57641239 RK |
4777 | int b2; |
4778 | struct case_node *t = r->right; | |
4779 | ||
51723711 | 4780 | if ((p->left = s = t->right)) |
57641239 RK |
4781 | s->parent = p; |
4782 | ||
4783 | t->right = p; | |
51723711 | 4784 | if ((r->right = s = t->left)) |
57641239 RK |
4785 | s->parent = r; |
4786 | ||
4787 | t->left = r; | |
4788 | b = t->balance; | |
4789 | b2 = b < 0; | |
4790 | p->balance = b2; | |
4791 | b2 = -b2 - b; | |
4792 | r->balance = b2; | |
4793 | t->balance = 0; | |
4794 | s = p->parent; | |
4795 | p->parent = t; | |
4796 | r->parent = t; | |
4797 | ||
51723711 | 4798 | if ((t->parent = s)) |
57641239 RK |
4799 | { |
4800 | if (s->left == p) | |
4801 | s->left = t; | |
4802 | else | |
4803 | s->right = t; | |
4804 | } | |
4805 | else | |
4806 | case_stack->data.case_stmt.case_list = t; | |
4807 | } | |
4808 | break; | |
4809 | } | |
4810 | ||
4811 | else | |
4812 | { | |
4813 | /* p->balance == +1; growth of left side balances the node. */ | |
4814 | p->balance = 0; | |
4815 | break; | |
4816 | } | |
4817 | } | |
4818 | else | |
4819 | /* r == p->right */ | |
4820 | { | |
4821 | int b; | |
4822 | ||
4823 | if (! (b = p->balance)) | |
4824 | /* Growth propagation from right side. */ | |
4825 | p->balance++; | |
4826 | else if (b > 0) | |
4827 | { | |
4828 | if (r->balance > 0) | |
4829 | { | |
4830 | /* L-Rotation */ | |
4831 | ||
51723711 | 4832 | if ((p->right = s = r->left)) |
57641239 RK |
4833 | s->parent = p; |
4834 | ||
4835 | r->left = p; | |
4836 | p->balance = 0; | |
4837 | r->balance = 0; | |
4838 | s = p->parent; | |
4839 | p->parent = r; | |
51723711 | 4840 | if ((r->parent = s)) |
57641239 RK |
4841 | { |
4842 | if (s->left == p) | |
4843 | s->left = r; | |
4844 | else | |
4845 | s->right = r; | |
4846 | } | |
4847 | ||
4848 | else | |
4849 | case_stack->data.case_stmt.case_list = r; | |
4850 | } | |
4851 | ||
4852 | else | |
4853 | /* r->balance == -1 */ | |
4854 | { | |
4855 | /* RL-Rotation */ | |
4856 | int b2; | |
4857 | struct case_node *t = r->left; | |
4858 | ||
51723711 | 4859 | if ((p->right = s = t->left)) |
57641239 RK |
4860 | s->parent = p; |
4861 | ||
4862 | t->left = p; | |
4863 | ||
51723711 | 4864 | if ((r->left = s = t->right)) |
57641239 RK |
4865 | s->parent = r; |
4866 | ||
4867 | t->right = r; | |
4868 | b = t->balance; | |
4869 | b2 = b < 0; | |
4870 | r->balance = b2; | |
4871 | b2 = -b2 - b; | |
4872 | p->balance = b2; | |
4873 | t->balance = 0; | |
4874 | s = p->parent; | |
4875 | p->parent = t; | |
4876 | r->parent = t; | |
4877 | ||
51723711 | 4878 | if ((t->parent = s)) |
57641239 RK |
4879 | { |
4880 | if (s->left == p) | |
4881 | s->left = t; | |
4882 | else | |
4883 | s->right = t; | |
4884 | } | |
4885 | ||
4886 | else | |
4887 | case_stack->data.case_stmt.case_list = t; | |
4888 | } | |
4889 | break; | |
4890 | } | |
4891 | else | |
4892 | { | |
4893 | /* p->balance == -1; growth of right side balances the node. */ | |
4894 | p->balance = 0; | |
4895 | break; | |
4896 | } | |
4897 | } | |
4898 | ||
4899 | r = p; | |
4900 | p = p->parent; | |
4901 | } | |
28d81abb RK |
4902 | |
4903 | return 0; | |
4904 | } | |
ca695ac9 | 4905 | |
28d81abb | 4906 | \f |
94d6511c PB |
4907 | /* Returns the number of possible values of TYPE. |
4908 | Returns -1 if the number is unknown or variable. | |
4909 | Returns -2 if the number does not fit in a HOST_WIDE_INT. | |
4910 | Sets *SPARENESS to 2 if TYPE is an ENUMERAL_TYPE whose values | |
4911 | do not increase monotonically (there may be duplicates); | |
4912 | to 1 if the values increase monotonically, but not always by 1; | |
4913 | otherwise sets it to 0. */ | |
4914 | ||
4915 | HOST_WIDE_INT | |
4916 | all_cases_count (type, spareness) | |
4917 | tree type; | |
4918 | int *spareness; | |
4919 | { | |
69d4ca36 | 4920 | HOST_WIDE_INT count; |
94d6511c PB |
4921 | *spareness = 0; |
4922 | ||
4923 | switch (TREE_CODE (type)) | |
4924 | { | |
4925 | tree t; | |
4926 | case BOOLEAN_TYPE: | |
4927 | count = 2; | |
4928 | break; | |
4929 | case CHAR_TYPE: | |
4930 | count = 1 << BITS_PER_UNIT; | |
4931 | break; | |
4932 | default: | |
4933 | case INTEGER_TYPE: | |
4934 | if (TREE_CODE (TYPE_MIN_VALUE (type)) != INTEGER_CST | |
e1ee5cdc | 4935 | || TYPE_MAX_VALUE (type) == NULL |
c02aebe2 | 4936 | || TREE_CODE (TYPE_MAX_VALUE (type)) != INTEGER_CST) |
94d6511c PB |
4937 | return -1; |
4938 | else | |
4939 | { | |
4940 | /* count | |
4941 | = TREE_INT_CST_LOW (TYPE_MAX_VALUE (type)) | |
4942 | - TREE_INT_CST_LOW (TYPE_MIN_VALUE (type)) + 1 | |
0f41302f | 4943 | but with overflow checking. */ |
94d6511c PB |
4944 | tree mint = TYPE_MIN_VALUE (type); |
4945 | tree maxt = TYPE_MAX_VALUE (type); | |
4946 | HOST_WIDE_INT lo, hi; | |
4947 | neg_double(TREE_INT_CST_LOW (mint), TREE_INT_CST_HIGH (mint), | |
4948 | &lo, &hi); | |
4949 | add_double(TREE_INT_CST_LOW (maxt), TREE_INT_CST_HIGH (maxt), | |
4950 | lo, hi, &lo, &hi); | |
4951 | add_double (lo, hi, 1, 0, &lo, &hi); | |
4952 | if (hi != 0 || lo < 0) | |
4953 | return -2; | |
4954 | count = lo; | |
4955 | } | |
4956 | break; | |
4957 | case ENUMERAL_TYPE: | |
4958 | count = 0; | |
4959 | for (t = TYPE_VALUES (type); t != NULL_TREE; t = TREE_CHAIN (t)) | |
4960 | { | |
4961 | if (TREE_CODE (TYPE_MIN_VALUE (type)) != INTEGER_CST | |
4962 | || TREE_CODE (TREE_VALUE (t)) != INTEGER_CST | |
05bccae2 RK |
4963 | || (TREE_INT_CST_LOW (TYPE_MIN_VALUE (type)) + count |
4964 | != TREE_INT_CST_LOW (TREE_VALUE (t)))) | |
94d6511c PB |
4965 | *spareness = 1; |
4966 | count++; | |
4967 | } | |
4968 | if (*spareness == 1) | |
4969 | { | |
4970 | tree prev = TREE_VALUE (TYPE_VALUES (type)); | |
4971 | for (t = TYPE_VALUES (type); t = TREE_CHAIN (t), t != NULL_TREE; ) | |
4972 | { | |
4973 | if (! tree_int_cst_lt (prev, TREE_VALUE (t))) | |
4974 | { | |
4975 | *spareness = 2; | |
4976 | break; | |
4977 | } | |
4978 | prev = TREE_VALUE (t); | |
4979 | } | |
4980 | ||
4981 | } | |
4982 | } | |
4983 | return count; | |
4984 | } | |
4985 | ||
4986 | ||
4987 | #define BITARRAY_TEST(ARRAY, INDEX) \ | |
0f41302f MS |
4988 | ((ARRAY)[(unsigned) (INDEX) / HOST_BITS_PER_CHAR]\ |
4989 | & (1 << ((unsigned) (INDEX) % HOST_BITS_PER_CHAR))) | |
94d6511c | 4990 | #define BITARRAY_SET(ARRAY, INDEX) \ |
0f41302f MS |
4991 | ((ARRAY)[(unsigned) (INDEX) / HOST_BITS_PER_CHAR]\ |
4992 | |= 1 << ((unsigned) (INDEX) % HOST_BITS_PER_CHAR)) | |
94d6511c PB |
4993 | |
4994 | /* Set the elements of the bitstring CASES_SEEN (which has length COUNT), | |
4995 | with the case values we have seen, assuming the case expression | |
4996 | has the given TYPE. | |
4997 | SPARSENESS is as determined by all_cases_count. | |
4998 | ||
9faa82d8 | 4999 | The time needed is proportional to COUNT, unless |
94d6511c PB |
5000 | SPARSENESS is 2, in which case quadratic time is needed. */ |
5001 | ||
df03cab5 | 5002 | void |
94d6511c PB |
5003 | mark_seen_cases (type, cases_seen, count, sparseness) |
5004 | tree type; | |
5005 | unsigned char *cases_seen; | |
5006 | long count; | |
5007 | int sparseness; | |
5008 | { | |
94d6511c PB |
5009 | tree next_node_to_try = NULL_TREE; |
5010 | long next_node_offset = 0; | |
5011 | ||
5720c7e7 | 5012 | register struct case_node *n, *root = case_stack->data.case_stmt.case_list; |
94d6511c PB |
5013 | tree val = make_node (INTEGER_CST); |
5014 | TREE_TYPE (val) = type; | |
5720c7e7 RK |
5015 | if (! root) |
5016 | ; /* Do nothing */ | |
5017 | else if (sparseness == 2) | |
94d6511c | 5018 | { |
5720c7e7 RK |
5019 | tree t; |
5020 | HOST_WIDE_INT xlo; | |
5021 | ||
5022 | /* This less efficient loop is only needed to handle | |
5023 | duplicate case values (multiple enum constants | |
5024 | with the same value). */ | |
5025 | TREE_TYPE (val) = TREE_TYPE (root->low); | |
5026 | for (t = TYPE_VALUES (type), xlo = 0; t != NULL_TREE; | |
5027 | t = TREE_CHAIN (t), xlo++) | |
94d6511c | 5028 | { |
5720c7e7 RK |
5029 | TREE_INT_CST_LOW (val) = TREE_INT_CST_LOW (TREE_VALUE (t)); |
5030 | TREE_INT_CST_HIGH (val) = TREE_INT_CST_HIGH (TREE_VALUE (t)); | |
5031 | n = root; | |
5032 | do | |
94d6511c | 5033 | { |
5720c7e7 RK |
5034 | /* Keep going past elements distinctly greater than VAL. */ |
5035 | if (tree_int_cst_lt (val, n->low)) | |
5036 | n = n->left; | |
5037 | ||
5038 | /* or distinctly less than VAL. */ | |
5039 | else if (tree_int_cst_lt (n->high, val)) | |
5040 | n = n->right; | |
5041 | ||
5042 | else | |
94d6511c | 5043 | { |
5720c7e7 RK |
5044 | /* We have found a matching range. */ |
5045 | BITARRAY_SET (cases_seen, xlo); | |
5046 | break; | |
94d6511c PB |
5047 | } |
5048 | } | |
5720c7e7 RK |
5049 | while (n); |
5050 | } | |
5051 | } | |
5052 | else | |
5053 | { | |
5054 | if (root->left) | |
5055 | case_stack->data.case_stmt.case_list = root = case_tree2list (root, 0); | |
5056 | for (n = root; n; n = n->right) | |
5057 | { | |
5058 | TREE_INT_CST_LOW (val) = TREE_INT_CST_LOW (n->low); | |
5059 | TREE_INT_CST_HIGH (val) = TREE_INT_CST_HIGH (n->low); | |
5060 | while ( ! tree_int_cst_lt (n->high, val)) | |
94d6511c | 5061 | { |
5720c7e7 RK |
5062 | /* Calculate (into xlo) the "offset" of the integer (val). |
5063 | The element with lowest value has offset 0, the next smallest | |
5064 | element has offset 1, etc. */ | |
5065 | ||
5066 | HOST_WIDE_INT xlo, xhi; | |
5067 | tree t; | |
94d6511c PB |
5068 | if (sparseness && TYPE_VALUES (type) != NULL_TREE) |
5069 | { | |
5070 | /* The TYPE_VALUES will be in increasing order, so | |
5071 | starting searching where we last ended. */ | |
5072 | t = next_node_to_try; | |
5073 | xlo = next_node_offset; | |
5074 | xhi = 0; | |
5075 | for (;;) | |
5076 | { | |
5077 | if (t == NULL_TREE) | |
5078 | { | |
5079 | t = TYPE_VALUES (type); | |
5080 | xlo = 0; | |
5081 | } | |
5082 | if (tree_int_cst_equal (val, TREE_VALUE (t))) | |
5083 | { | |
5084 | next_node_to_try = TREE_CHAIN (t); | |
5085 | next_node_offset = xlo + 1; | |
5086 | break; | |
5087 | } | |
5088 | xlo++; | |
5089 | t = TREE_CHAIN (t); | |
5090 | if (t == next_node_to_try) | |
5720c7e7 RK |
5091 | { |
5092 | xlo = -1; | |
5093 | break; | |
5094 | } | |
94d6511c PB |
5095 | } |
5096 | } | |
5097 | else | |
5098 | { | |
5099 | t = TYPE_MIN_VALUE (type); | |
5100 | if (t) | |
5101 | neg_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), | |
5102 | &xlo, &xhi); | |
5103 | else | |
5104 | xlo = xhi = 0; | |
5105 | add_double (xlo, xhi, | |
5106 | TREE_INT_CST_LOW (val), TREE_INT_CST_HIGH (val), | |
5107 | &xlo, &xhi); | |
5108 | } | |
5109 | ||
9dd53f1e | 5110 | if (xhi == 0 && xlo >= 0 && xlo < count) |
94d6511c | 5111 | BITARRAY_SET (cases_seen, xlo); |
5720c7e7 RK |
5112 | add_double (TREE_INT_CST_LOW (val), TREE_INT_CST_HIGH (val), |
5113 | 1, 0, | |
5114 | &TREE_INT_CST_LOW (val), &TREE_INT_CST_HIGH (val)); | |
94d6511c | 5115 | } |
94d6511c PB |
5116 | } |
5117 | } | |
5118 | } | |
5119 | ||
28d81abb RK |
5120 | /* Called when the index of a switch statement is an enumerated type |
5121 | and there is no default label. | |
5122 | ||
5123 | Checks that all enumeration literals are covered by the case | |
5124 | expressions of a switch. Also, warn if there are any extra | |
5125 | switch cases that are *not* elements of the enumerated type. | |
5126 | ||
5127 | If all enumeration literals were covered by the case expressions, | |
5128 | turn one of the expressions into the default expression since it should | |
5129 | not be possible to fall through such a switch. */ | |
5130 | ||
5131 | void | |
5132 | check_for_full_enumeration_handling (type) | |
5133 | tree type; | |
5134 | { | |
5135 | register struct case_node *n; | |
28d81abb | 5136 | register tree chain; |
69d4ca36 RL |
5137 | #if 0 /* variable used by 'if 0'ed code below. */ |
5138 | register struct case_node **l; | |
28d81abb | 5139 | int all_values = 1; |
69d4ca36 | 5140 | #endif |
28d81abb | 5141 | |
0f41302f | 5142 | /* True iff the selector type is a numbered set mode. */ |
94d6511c PB |
5143 | int sparseness = 0; |
5144 | ||
0f41302f | 5145 | /* The number of possible selector values. */ |
94d6511c PB |
5146 | HOST_WIDE_INT size; |
5147 | ||
5148 | /* For each possible selector value. a one iff it has been matched | |
0f41302f | 5149 | by a case value alternative. */ |
94d6511c PB |
5150 | unsigned char *cases_seen; |
5151 | ||
0f41302f | 5152 | /* The allocated size of cases_seen, in chars. */ |
94d6511c | 5153 | long bytes_needed; |
94d6511c | 5154 | |
94d6511c PB |
5155 | if (! warn_switch) |
5156 | return; | |
5157 | ||
5158 | size = all_cases_count (type, &sparseness); | |
5159 | bytes_needed = (size + HOST_BITS_PER_CHAR) / HOST_BITS_PER_CHAR; | |
28d81abb | 5160 | |
94d6511c | 5161 | if (size > 0 && size < 600000 |
c5c76735 JL |
5162 | /* We deliberately use calloc here, not cmalloc, so that we can suppress |
5163 | this optimization if we don't have enough memory rather than | |
5164 | aborting, as xmalloc would do. */ | |
3de90026 | 5165 | && (cases_seen = (unsigned char *) calloc (bytes_needed, 1)) != NULL) |
28d81abb | 5166 | { |
94d6511c PB |
5167 | long i; |
5168 | tree v = TYPE_VALUES (type); | |
28d81abb | 5169 | |
94d6511c PB |
5170 | /* The time complexity of this code is normally O(N), where |
5171 | N being the number of members in the enumerated type. | |
5172 | However, if type is a ENUMERAL_TYPE whose values do not | |
0f41302f | 5173 | increase monotonically, O(N*log(N)) time may be needed. */ |
94d6511c PB |
5174 | |
5175 | mark_seen_cases (type, cases_seen, size, sparseness); | |
5176 | ||
5177 | for (i = 0; v != NULL_TREE && i < size; i++, v = TREE_CHAIN (v)) | |
28d81abb | 5178 | { |
94d6511c | 5179 | if (BITARRAY_TEST(cases_seen, i) == 0) |
1ddde1cd | 5180 | warning ("enumeration value `%s' not handled in switch", |
94d6511c | 5181 | IDENTIFIER_POINTER (TREE_PURPOSE (v))); |
28d81abb | 5182 | } |
94d6511c PB |
5183 | |
5184 | free (cases_seen); | |
28d81abb RK |
5185 | } |
5186 | ||
5187 | /* Now we go the other way around; we warn if there are case | |
ac2a9454 | 5188 | expressions that don't correspond to enumerators. This can |
28d81abb | 5189 | occur since C and C++ don't enforce type-checking of |
0f41302f | 5190 | assignments to enumeration variables. */ |
28d81abb | 5191 | |
5720c7e7 RK |
5192 | if (case_stack->data.case_stmt.case_list |
5193 | && case_stack->data.case_stmt.case_list->left) | |
5194 | case_stack->data.case_stmt.case_list | |
5195 | = case_tree2list (case_stack->data.case_stmt.case_list, 0); | |
28d81abb RK |
5196 | if (warn_switch) |
5197 | for (n = case_stack->data.case_stmt.case_list; n; n = n->right) | |
5198 | { | |
5199 | for (chain = TYPE_VALUES (type); | |
5200 | chain && !tree_int_cst_equal (n->low, TREE_VALUE (chain)); | |
5201 | chain = TREE_CHAIN (chain)) | |
5202 | ; | |
5203 | ||
5204 | if (!chain) | |
3b24f55b RS |
5205 | { |
5206 | if (TYPE_NAME (type) == 0) | |
e016950d KG |
5207 | warning ("case value `%ld' not in enumerated type", |
5208 | (long) TREE_INT_CST_LOW (n->low)); | |
3b24f55b | 5209 | else |
e016950d KG |
5210 | warning ("case value `%ld' not in enumerated type `%s'", |
5211 | (long) TREE_INT_CST_LOW (n->low), | |
3b24f55b RS |
5212 | IDENTIFIER_POINTER ((TREE_CODE (TYPE_NAME (type)) |
5213 | == IDENTIFIER_NODE) | |
5214 | ? TYPE_NAME (type) | |
5215 | : DECL_NAME (TYPE_NAME (type)))); | |
5216 | } | |
1ddde1cd RS |
5217 | if (!tree_int_cst_equal (n->low, n->high)) |
5218 | { | |
5219 | for (chain = TYPE_VALUES (type); | |
5220 | chain && !tree_int_cst_equal (n->high, TREE_VALUE (chain)); | |
5221 | chain = TREE_CHAIN (chain)) | |
5222 | ; | |
5223 | ||
5224 | if (!chain) | |
3b24f55b RS |
5225 | { |
5226 | if (TYPE_NAME (type) == 0) | |
e016950d KG |
5227 | warning ("case value `%ld' not in enumerated type", |
5228 | (long) TREE_INT_CST_LOW (n->high)); | |
3b24f55b | 5229 | else |
e016950d KG |
5230 | warning ("case value `%ld' not in enumerated type `%s'", |
5231 | (long) TREE_INT_CST_LOW (n->high), | |
3b24f55b RS |
5232 | IDENTIFIER_POINTER ((TREE_CODE (TYPE_NAME (type)) |
5233 | == IDENTIFIER_NODE) | |
5234 | ? TYPE_NAME (type) | |
5235 | : DECL_NAME (TYPE_NAME (type)))); | |
5236 | } | |
1ddde1cd | 5237 | } |
28d81abb RK |
5238 | } |
5239 | ||
ae8cb346 RS |
5240 | #if 0 |
5241 | /* ??? This optimization is disabled because it causes valid programs to | |
5242 | fail. ANSI C does not guarantee that an expression with enum type | |
9faa82d8 | 5243 | will have a value that is the same as one of the enumeration literals. */ |
ae8cb346 | 5244 | |
28d81abb RK |
5245 | /* If all values were found as case labels, make one of them the default |
5246 | label. Thus, this switch will never fall through. We arbitrarily pick | |
5247 | the last one to make the default since this is likely the most | |
5248 | efficient choice. */ | |
5249 | ||
5250 | if (all_values) | |
5251 | { | |
5252 | for (l = &case_stack->data.case_stmt.case_list; | |
5253 | (*l)->right != 0; | |
5254 | l = &(*l)->right) | |
5255 | ; | |
5256 | ||
5257 | case_stack->data.case_stmt.default_label = (*l)->code_label; | |
5258 | *l = 0; | |
5259 | } | |
ae8cb346 | 5260 | #endif /* 0 */ |
28d81abb | 5261 | } |
ca695ac9 | 5262 | |
28d81abb RK |
5263 | \f |
5264 | /* Terminate a case (Pascal) or switch (C) statement | |
9ab0ddd7 | 5265 | in which ORIG_INDEX is the expression to be tested. |
28d81abb RK |
5266 | Generate the code to test it and jump to the right place. */ |
5267 | ||
5268 | void | |
5269 | expand_end_case (orig_index) | |
5270 | tree orig_index; | |
5271 | { | |
95d75019 | 5272 | tree minval = NULL_TREE, maxval = NULL_TREE, range = NULL_TREE, orig_minval; |
28d81abb RK |
5273 | rtx default_label = 0; |
5274 | register struct case_node *n; | |
85066503 | 5275 | unsigned int count; |
28d81abb | 5276 | rtx index; |
ca695ac9 | 5277 | rtx table_label; |
28d81abb RK |
5278 | int ncases; |
5279 | rtx *labelvec; | |
5280 | register int i; | |
5281 | rtx before_case; | |
5282 | register struct nesting *thiscase = case_stack; | |
1b0cb6fc | 5283 | tree index_expr, index_type; |
ca695ac9 JB |
5284 | int unsignedp; |
5285 | ||
03c03770 AS |
5286 | /* Don't crash due to previous errors. */ |
5287 | if (thiscase == NULL) | |
5288 | return; | |
5289 | ||
ca695ac9 JB |
5290 | table_label = gen_label_rtx (); |
5291 | index_expr = thiscase->data.case_stmt.index_expr; | |
1b0cb6fc RK |
5292 | index_type = TREE_TYPE (index_expr); |
5293 | unsignedp = TREE_UNSIGNED (index_type); | |
28d81abb RK |
5294 | |
5295 | do_pending_stack_adjust (); | |
5296 | ||
feb60352 R |
5297 | /* This might get an spurious warning in the presence of a syntax error; |
5298 | it could be fixed by moving the call to check_seenlabel after the | |
5299 | check for error_mark_node, and copying the code of check_seenlabel that | |
5300 | deals with case_stack->data.case_stmt.line_number_status / | |
5301 | restore_line_number_status in front of the call to end_cleanup_deferral; | |
5302 | However, this might miss some useful warnings in the presence of | |
5303 | non-syntax errors. */ | |
a11759a3 JR |
5304 | check_seenlabel (); |
5305 | ||
28d81abb | 5306 | /* An ERROR_MARK occurs for various reasons including invalid data type. */ |
1b0cb6fc | 5307 | if (index_type != error_mark_node) |
28d81abb RK |
5308 | { |
5309 | /* If switch expression was an enumerated type, check that all | |
5310 | enumeration literals are covered by the cases. | |
5311 | No sense trying this if there's a default case, however. */ | |
5312 | ||
5313 | if (!thiscase->data.case_stmt.default_label | |
5314 | && TREE_CODE (TREE_TYPE (orig_index)) == ENUMERAL_TYPE | |
5315 | && TREE_CODE (index_expr) != INTEGER_CST) | |
5316 | check_for_full_enumeration_handling (TREE_TYPE (orig_index)); | |
5317 | ||
28d81abb RK |
5318 | /* If we don't have a default-label, create one here, |
5319 | after the body of the switch. */ | |
5320 | if (thiscase->data.case_stmt.default_label == 0) | |
5321 | { | |
5322 | thiscase->data.case_stmt.default_label | |
5323 | = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); | |
5324 | expand_label (thiscase->data.case_stmt.default_label); | |
5325 | } | |
5326 | default_label = label_rtx (thiscase->data.case_stmt.default_label); | |
5327 | ||
5328 | before_case = get_last_insn (); | |
5329 | ||
5720c7e7 RK |
5330 | if (thiscase->data.case_stmt.case_list |
5331 | && thiscase->data.case_stmt.case_list->left) | |
b059139c RK |
5332 | thiscase->data.case_stmt.case_list |
5333 | = case_tree2list(thiscase->data.case_stmt.case_list, 0); | |
5334 | ||
28d81abb RK |
5335 | /* Simplify the case-list before we count it. */ |
5336 | group_case_nodes (thiscase->data.case_stmt.case_list); | |
5337 | ||
5338 | /* Get upper and lower bounds of case values. | |
5339 | Also convert all the case values to the index expr's data type. */ | |
5340 | ||
5341 | count = 0; | |
5342 | for (n = thiscase->data.case_stmt.case_list; n; n = n->right) | |
5343 | { | |
5344 | /* Check low and high label values are integers. */ | |
5345 | if (TREE_CODE (n->low) != INTEGER_CST) | |
5346 | abort (); | |
5347 | if (TREE_CODE (n->high) != INTEGER_CST) | |
5348 | abort (); | |
5349 | ||
1b0cb6fc RK |
5350 | n->low = convert (index_type, n->low); |
5351 | n->high = convert (index_type, n->high); | |
28d81abb RK |
5352 | |
5353 | /* Count the elements and track the largest and smallest | |
5354 | of them (treating them as signed even if they are not). */ | |
5355 | if (count++ == 0) | |
5356 | { | |
5357 | minval = n->low; | |
5358 | maxval = n->high; | |
5359 | } | |
5360 | else | |
5361 | { | |
5362 | if (INT_CST_LT (n->low, minval)) | |
5363 | minval = n->low; | |
5364 | if (INT_CST_LT (maxval, n->high)) | |
5365 | maxval = n->high; | |
5366 | } | |
5367 | /* A range counts double, since it requires two compares. */ | |
5368 | if (! tree_int_cst_equal (n->low, n->high)) | |
5369 | count++; | |
5370 | } | |
5371 | ||
3474db0e RS |
5372 | orig_minval = minval; |
5373 | ||
28d81abb RK |
5374 | /* Compute span of values. */ |
5375 | if (count != 0) | |
1b0cb6fc | 5376 | range = fold (build (MINUS_EXPR, index_type, maxval, minval)); |
28d81abb | 5377 | |
956d6950 | 5378 | end_cleanup_deferral (); |
4c581243 | 5379 | |
1b0cb6fc | 5380 | if (count == 0) |
28d81abb RK |
5381 | { |
5382 | expand_expr (index_expr, const0_rtx, VOIDmode, 0); | |
5383 | emit_queue (); | |
5384 | emit_jump (default_label); | |
5385 | } | |
3474db0e | 5386 | |
28d81abb RK |
5387 | /* If range of values is much bigger than number of values, |
5388 | make a sequence of conditional branches instead of a dispatch. | |
5389 | If the switch-index is a constant, do it this way | |
5390 | because we can optimize it. */ | |
4f73c5dd TW |
5391 | |
5392 | #ifndef CASE_VALUES_THRESHOLD | |
28d81abb | 5393 | #ifdef HAVE_casesi |
4f73c5dd | 5394 | #define CASE_VALUES_THRESHOLD (HAVE_casesi ? 4 : 5) |
28d81abb | 5395 | #else |
4f73c5dd TW |
5396 | /* If machine does not have a case insn that compares the |
5397 | bounds, this means extra overhead for dispatch tables | |
5398 | which raises the threshold for using them. */ | |
5399 | #define CASE_VALUES_THRESHOLD 5 | |
5400 | #endif /* HAVE_casesi */ | |
5401 | #endif /* CASE_VALUES_THRESHOLD */ | |
5402 | ||
05bccae2 RK |
5403 | else if (count < CASE_VALUES_THRESHOLD |
5404 | || compare_tree_int (range, 10 * count) > 0 | |
3f6fe18e RK |
5405 | #ifndef ASM_OUTPUT_ADDR_DIFF_ELT |
5406 | || flag_pic | |
5407 | #endif | |
28d81abb | 5408 | || TREE_CODE (index_expr) == INTEGER_CST |
b4ac57ab | 5409 | /* These will reduce to a constant. */ |
28d81abb | 5410 | || (TREE_CODE (index_expr) == CALL_EXPR |
de14fd73 | 5411 | && TREE_CODE (TREE_OPERAND (index_expr, 0)) == ADDR_EXPR |
28d81abb | 5412 | && TREE_CODE (TREE_OPERAND (TREE_OPERAND (index_expr, 0), 0)) == FUNCTION_DECL |
95815af9 | 5413 | && DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (index_expr, 0), 0)) == BUILT_IN_NORMAL |
b4ac57ab RS |
5414 | && DECL_FUNCTION_CODE (TREE_OPERAND (TREE_OPERAND (index_expr, 0), 0)) == BUILT_IN_CLASSIFY_TYPE) |
5415 | || (TREE_CODE (index_expr) == COMPOUND_EXPR | |
5416 | && TREE_CODE (TREE_OPERAND (index_expr, 1)) == INTEGER_CST)) | |
28d81abb | 5417 | { |
37366632 | 5418 | index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0); |
28d81abb RK |
5419 | |
5420 | /* If the index is a short or char that we do not have | |
5421 | an insn to handle comparisons directly, convert it to | |
5422 | a full integer now, rather than letting each comparison | |
5423 | generate the conversion. */ | |
5424 | ||
5425 | if (GET_MODE_CLASS (GET_MODE (index)) == MODE_INT | |
5426 | && (cmp_optab->handlers[(int) GET_MODE(index)].insn_code | |
5427 | == CODE_FOR_nothing)) | |
5428 | { | |
5429 | enum machine_mode wider_mode; | |
5430 | for (wider_mode = GET_MODE (index); wider_mode != VOIDmode; | |
5431 | wider_mode = GET_MODE_WIDER_MODE (wider_mode)) | |
5432 | if (cmp_optab->handlers[(int) wider_mode].insn_code | |
5433 | != CODE_FOR_nothing) | |
5434 | { | |
5435 | index = convert_to_mode (wider_mode, index, unsignedp); | |
5436 | break; | |
5437 | } | |
5438 | } | |
5439 | ||
5440 | emit_queue (); | |
5441 | do_pending_stack_adjust (); | |
5442 | ||
5443 | index = protect_from_queue (index, 0); | |
5444 | if (GET_CODE (index) == MEM) | |
5445 | index = copy_to_reg (index); | |
5446 | if (GET_CODE (index) == CONST_INT | |
5447 | || TREE_CODE (index_expr) == INTEGER_CST) | |
5448 | { | |
5449 | /* Make a tree node with the proper constant value | |
5450 | if we don't already have one. */ | |
5451 | if (TREE_CODE (index_expr) != INTEGER_CST) | |
5452 | { | |
5453 | index_expr | |
5454 | = build_int_2 (INTVAL (index), | |
e9a042b6 | 5455 | unsignedp || INTVAL (index) >= 0 ? 0 : -1); |
1b0cb6fc | 5456 | index_expr = convert (index_type, index_expr); |
28d81abb RK |
5457 | } |
5458 | ||
5459 | /* For constant index expressions we need only | |
5460 | issue a unconditional branch to the appropriate | |
5461 | target code. The job of removing any unreachable | |
5462 | code is left to the optimisation phase if the | |
5463 | "-O" option is specified. */ | |
1b0cb6fc RK |
5464 | for (n = thiscase->data.case_stmt.case_list; n; n = n->right) |
5465 | if (! tree_int_cst_lt (index_expr, n->low) | |
5466 | && ! tree_int_cst_lt (n->high, index_expr)) | |
5467 | break; | |
5468 | ||
28d81abb RK |
5469 | if (n) |
5470 | emit_jump (label_rtx (n->code_label)); | |
5471 | else | |
5472 | emit_jump (default_label); | |
5473 | } | |
5474 | else | |
5475 | { | |
5476 | /* If the index expression is not constant we generate | |
5477 | a binary decision tree to select the appropriate | |
5478 | target code. This is done as follows: | |
5479 | ||
5480 | The list of cases is rearranged into a binary tree, | |
5481 | nearly optimal assuming equal probability for each case. | |
5482 | ||
5483 | The tree is transformed into RTL, eliminating | |
5484 | redundant test conditions at the same time. | |
5485 | ||
5486 | If program flow could reach the end of the | |
5487 | decision tree an unconditional jump to the | |
5488 | default code is emitted. */ | |
5489 | ||
5490 | use_cost_table | |
5491 | = (TREE_CODE (TREE_TYPE (orig_index)) != ENUMERAL_TYPE | |
28d81abb | 5492 | && estimate_case_costs (thiscase->data.case_stmt.case_list)); |
37366632 RK |
5493 | balance_case_nodes (&thiscase->data.case_stmt.case_list, |
5494 | NULL_PTR); | |
28d81abb | 5495 | emit_case_nodes (index, thiscase->data.case_stmt.case_list, |
1b0cb6fc | 5496 | default_label, index_type); |
28d81abb RK |
5497 | emit_jump_if_reachable (default_label); |
5498 | } | |
5499 | } | |
5500 | else | |
5501 | { | |
5502 | int win = 0; | |
5503 | #ifdef HAVE_casesi | |
5504 | if (HAVE_casesi) | |
5505 | { | |
c4fcf531 | 5506 | enum machine_mode index_mode = SImode; |
5130a5cc | 5507 | int index_bits = GET_MODE_BITSIZE (index_mode); |
086f237d JW |
5508 | rtx op1, op2; |
5509 | enum machine_mode op_mode; | |
c4fcf531 | 5510 | |
28d81abb | 5511 | /* Convert the index to SImode. */ |
1b0cb6fc | 5512 | if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) |
c4fcf531 | 5513 | > GET_MODE_BITSIZE (index_mode)) |
28d81abb | 5514 | { |
1b0cb6fc | 5515 | enum machine_mode omode = TYPE_MODE (index_type); |
37366632 | 5516 | rtx rangertx = expand_expr (range, NULL_RTX, VOIDmode, 0); |
af2682ef RS |
5517 | |
5518 | /* We must handle the endpoints in the original mode. */ | |
1b0cb6fc | 5519 | index_expr = build (MINUS_EXPR, index_type, |
28d81abb RK |
5520 | index_expr, minval); |
5521 | minval = integer_zero_node; | |
37366632 | 5522 | index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0); |
c5d5d461 JL |
5523 | emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX, |
5524 | omode, 1, 0, default_label); | |
af2682ef RS |
5525 | /* Now we can safely truncate. */ |
5526 | index = convert_to_mode (index_mode, index, 0); | |
5527 | } | |
5528 | else | |
5529 | { | |
1b0cb6fc | 5530 | if (TYPE_MODE (index_type) != index_mode) |
d3b35d75 RK |
5531 | { |
5532 | index_expr = convert (type_for_size (index_bits, 0), | |
5533 | index_expr); | |
5534 | index_type = TREE_TYPE (index_expr); | |
5535 | } | |
5536 | ||
37366632 | 5537 | index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0); |
28d81abb | 5538 | } |
28d81abb RK |
5539 | emit_queue (); |
5540 | index = protect_from_queue (index, 0); | |
5541 | do_pending_stack_adjust (); | |
5542 | ||
a995e389 RH |
5543 | op_mode = insn_data[(int)CODE_FOR_casesi].operand[0].mode; |
5544 | if (! (*insn_data[(int)CODE_FOR_casesi].operand[0].predicate) | |
086f237d JW |
5545 | (index, op_mode)) |
5546 | index = copy_to_mode_reg (op_mode, index); | |
5547 | ||
5548 | op1 = expand_expr (minval, NULL_RTX, VOIDmode, 0); | |
5549 | ||
a995e389 RH |
5550 | op_mode = insn_data[(int)CODE_FOR_casesi].operand[1].mode; |
5551 | if (! (*insn_data[(int)CODE_FOR_casesi].operand[1].predicate) | |
086f237d JW |
5552 | (op1, op_mode)) |
5553 | op1 = copy_to_mode_reg (op_mode, op1); | |
5554 | ||
5555 | op2 = expand_expr (range, NULL_RTX, VOIDmode, 0); | |
5556 | ||
a995e389 RH |
5557 | op_mode = insn_data[(int)CODE_FOR_casesi].operand[2].mode; |
5558 | if (! (*insn_data[(int)CODE_FOR_casesi].operand[2].predicate) | |
086f237d JW |
5559 | (op2, op_mode)) |
5560 | op2 = copy_to_mode_reg (op_mode, op2); | |
5561 | ||
5562 | emit_jump_insn (gen_casesi (index, op1, op2, | |
28d81abb RK |
5563 | table_label, default_label)); |
5564 | win = 1; | |
5565 | } | |
5566 | #endif | |
5567 | #ifdef HAVE_tablejump | |
5568 | if (! win && HAVE_tablejump) | |
5569 | { | |
5570 | index_expr = convert (thiscase->data.case_stmt.nominal_type, | |
1b0cb6fc | 5571 | fold (build (MINUS_EXPR, index_type, |
b4ac57ab | 5572 | index_expr, minval))); |
d3b35d75 | 5573 | index_type = TREE_TYPE (index_expr); |
37366632 | 5574 | index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0); |
28d81abb | 5575 | emit_queue (); |
af2682ef | 5576 | index = protect_from_queue (index, 0); |
28d81abb RK |
5577 | do_pending_stack_adjust (); |
5578 | ||
1b0cb6fc | 5579 | do_tablejump (index, TYPE_MODE (index_type), |
37366632 | 5580 | expand_expr (range, NULL_RTX, VOIDmode, 0), |
28d81abb RK |
5581 | table_label, default_label); |
5582 | win = 1; | |
5583 | } | |
5584 | #endif | |
5585 | if (! win) | |
5586 | abort (); | |
5587 | ||
5588 | /* Get table of labels to jump to, in order of case index. */ | |
5589 | ||
5590 | ncases = TREE_INT_CST_LOW (range) + 1; | |
5591 | labelvec = (rtx *) alloca (ncases * sizeof (rtx)); | |
4c9a05bc | 5592 | bzero ((char *) labelvec, ncases * sizeof (rtx)); |
28d81abb RK |
5593 | |
5594 | for (n = thiscase->data.case_stmt.case_list; n; n = n->right) | |
5595 | { | |
37366632 | 5596 | register HOST_WIDE_INT i |
3474db0e | 5597 | = TREE_INT_CST_LOW (n->low) - TREE_INT_CST_LOW (orig_minval); |
28d81abb RK |
5598 | |
5599 | while (1) | |
5600 | { | |
5601 | labelvec[i] | |
38a448ca | 5602 | = gen_rtx_LABEL_REF (Pmode, label_rtx (n->code_label)); |
3474db0e | 5603 | if (i + TREE_INT_CST_LOW (orig_minval) |
28d81abb RK |
5604 | == TREE_INT_CST_LOW (n->high)) |
5605 | break; | |
5606 | i++; | |
5607 | } | |
5608 | } | |
5609 | ||
5610 | /* Fill in the gaps with the default. */ | |
5611 | for (i = 0; i < ncases; i++) | |
5612 | if (labelvec[i] == 0) | |
38a448ca | 5613 | labelvec[i] = gen_rtx_LABEL_REF (Pmode, default_label); |
28d81abb RK |
5614 | |
5615 | /* Output the table */ | |
5616 | emit_label (table_label); | |
5617 | ||
18543a22 | 5618 | if (CASE_VECTOR_PC_RELATIVE || flag_pic) |
38a448ca RH |
5619 | emit_jump_insn (gen_rtx_ADDR_DIFF_VEC (CASE_VECTOR_MODE, |
5620 | gen_rtx_LABEL_REF (Pmode, table_label), | |
33f7f353 | 5621 | gen_rtvec_v (ncases, labelvec), |
8f985ec4 | 5622 | const0_rtx, const0_rtx)); |
28d81abb | 5623 | else |
38a448ca RH |
5624 | emit_jump_insn (gen_rtx_ADDR_VEC (CASE_VECTOR_MODE, |
5625 | gen_rtvec_v (ncases, labelvec))); | |
28d81abb RK |
5626 | |
5627 | /* If the case insn drops through the table, | |
5628 | after the table we must jump to the default-label. | |
5629 | Otherwise record no drop-through after the table. */ | |
5630 | #ifdef CASE_DROPS_THROUGH | |
5631 | emit_jump (default_label); | |
5632 | #else | |
5633 | emit_barrier (); | |
5634 | #endif | |
5635 | } | |
5636 | ||
915f619f JW |
5637 | before_case = squeeze_notes (NEXT_INSN (before_case), get_last_insn ()); |
5638 | reorder_insns (before_case, get_last_insn (), | |
28d81abb RK |
5639 | thiscase->data.case_stmt.start); |
5640 | } | |
4c581243 | 5641 | else |
956d6950 | 5642 | end_cleanup_deferral (); |
1b0cb6fc | 5643 | |
28d81abb RK |
5644 | if (thiscase->exit_label) |
5645 | emit_label (thiscase->exit_label); | |
5646 | ||
5647 | POPSTACK (case_stack); | |
5648 | ||
5649 | free_temp_slots (); | |
5650 | } | |
5651 | ||
57641239 RK |
5652 | /* Convert the tree NODE into a list linked by the right field, with the left |
5653 | field zeroed. RIGHT is used for recursion; it is a list to be placed | |
5654 | rightmost in the resulting list. */ | |
5655 | ||
5656 | static struct case_node * | |
5657 | case_tree2list (node, right) | |
5658 | struct case_node *node, *right; | |
5659 | { | |
5660 | struct case_node *left; | |
5661 | ||
5662 | if (node->right) | |
5663 | right = case_tree2list (node->right, right); | |
5664 | ||
5665 | node->right = right; | |
51723711 | 5666 | if ((left = node->left)) |
57641239 RK |
5667 | { |
5668 | node->left = 0; | |
5669 | return case_tree2list (left, node); | |
5670 | } | |
5671 | ||
5672 | return node; | |
5673 | } | |
ca695ac9 | 5674 | |
28d81abb RK |
5675 | /* Generate code to jump to LABEL if OP1 and OP2 are equal. */ |
5676 | ||
5677 | static void | |
5678 | do_jump_if_equal (op1, op2, label, unsignedp) | |
5679 | rtx op1, op2, label; | |
5680 | int unsignedp; | |
5681 | { | |
5682 | if (GET_CODE (op1) == CONST_INT | |
5683 | && GET_CODE (op2) == CONST_INT) | |
5684 | { | |
5685 | if (INTVAL (op1) == INTVAL (op2)) | |
5686 | emit_jump (label); | |
5687 | } | |
5688 | else | |
5689 | { | |
5690 | enum machine_mode mode = GET_MODE (op1); | |
5691 | if (mode == VOIDmode) | |
5692 | mode = GET_MODE (op2); | |
c5d5d461 JL |
5693 | emit_cmp_and_jump_insns (op1, op2, EQ, NULL_RTX, mode, unsignedp, |
5694 | 0, label); | |
28d81abb RK |
5695 | } |
5696 | } | |
5697 | \f | |
5698 | /* Not all case values are encountered equally. This function | |
5699 | uses a heuristic to weight case labels, in cases where that | |
5700 | looks like a reasonable thing to do. | |
5701 | ||
5702 | Right now, all we try to guess is text, and we establish the | |
5703 | following weights: | |
5704 | ||
5705 | chars above space: 16 | |
5706 | digits: 16 | |
5707 | default: 12 | |
5708 | space, punct: 8 | |
5709 | tab: 4 | |
5710 | newline: 2 | |
5711 | other "\" chars: 1 | |
5712 | remaining chars: 0 | |
5713 | ||
5714 | If we find any cases in the switch that are not either -1 or in the range | |
5715 | of valid ASCII characters, or are control characters other than those | |
5716 | commonly used with "\", don't treat this switch scanning text. | |
5717 | ||
5718 | Return 1 if these nodes are suitable for cost estimation, otherwise | |
5719 | return 0. */ | |
5720 | ||
5721 | static int | |
5722 | estimate_case_costs (node) | |
5723 | case_node_ptr node; | |
5724 | { | |
5725 | tree min_ascii = build_int_2 (-1, -1); | |
5726 | tree max_ascii = convert (TREE_TYPE (node->high), build_int_2 (127, 0)); | |
5727 | case_node_ptr n; | |
5728 | int i; | |
5729 | ||
5730 | /* If we haven't already made the cost table, make it now. Note that the | |
5731 | lower bound of the table is -1, not zero. */ | |
5732 | ||
5733 | if (cost_table == NULL) | |
5734 | { | |
e7749837 | 5735 | cost_table = cost_table_ + 1; |
28d81abb RK |
5736 | |
5737 | for (i = 0; i < 128; i++) | |
5738 | { | |
e9a780ec | 5739 | if (ISALNUM (i)) |
28d81abb | 5740 | cost_table[i] = 16; |
e9a780ec | 5741 | else if (ISPUNCT (i)) |
28d81abb | 5742 | cost_table[i] = 8; |
e9a780ec | 5743 | else if (ISCNTRL (i)) |
28d81abb RK |
5744 | cost_table[i] = -1; |
5745 | } | |
5746 | ||
5747 | cost_table[' '] = 8; | |
5748 | cost_table['\t'] = 4; | |
5749 | cost_table['\0'] = 4; | |
5750 | cost_table['\n'] = 2; | |
5751 | cost_table['\f'] = 1; | |
5752 | cost_table['\v'] = 1; | |
5753 | cost_table['\b'] = 1; | |
5754 | } | |
5755 | ||
5756 | /* See if all the case expressions look like text. It is text if the | |
5757 | constant is >= -1 and the highest constant is <= 127. Do all comparisons | |
5758 | as signed arithmetic since we don't want to ever access cost_table with a | |
5759 | value less than -1. Also check that none of the constants in a range | |
5760 | are strange control characters. */ | |
5761 | ||
5762 | for (n = node; n; n = n->right) | |
5763 | { | |
5764 | if ((INT_CST_LT (n->low, min_ascii)) || INT_CST_LT (max_ascii, n->high)) | |
5765 | return 0; | |
5766 | ||
05bccae2 RK |
5767 | for (i = (HOST_WIDE_INT) TREE_INT_CST_LOW (n->low); |
5768 | i <= (HOST_WIDE_INT) TREE_INT_CST_LOW (n->high); i++) | |
28d81abb RK |
5769 | if (cost_table[i] < 0) |
5770 | return 0; | |
5771 | } | |
5772 | ||
5773 | /* All interesting values are within the range of interesting | |
5774 | ASCII characters. */ | |
5775 | return 1; | |
5776 | } | |
5777 | ||
5778 | /* Scan an ordered list of case nodes | |
5779 | combining those with consecutive values or ranges. | |
5780 | ||
5781 | Eg. three separate entries 1: 2: 3: become one entry 1..3: */ | |
5782 | ||
5783 | static void | |
5784 | group_case_nodes (head) | |
5785 | case_node_ptr head; | |
5786 | { | |
5787 | case_node_ptr node = head; | |
5788 | ||
5789 | while (node) | |
5790 | { | |
5791 | rtx lb = next_real_insn (label_rtx (node->code_label)); | |
ad7e369f | 5792 | rtx lb2; |
28d81abb RK |
5793 | case_node_ptr np = node; |
5794 | ||
5795 | /* Try to group the successors of NODE with NODE. */ | |
5796 | while (((np = np->right) != 0) | |
5797 | /* Do they jump to the same place? */ | |
ad7e369f JL |
5798 | && ((lb2 = next_real_insn (label_rtx (np->code_label))) == lb |
5799 | || (lb != 0 && lb2 != 0 | |
5800 | && simplejump_p (lb) | |
5801 | && simplejump_p (lb2) | |
5802 | && rtx_equal_p (SET_SRC (PATTERN (lb)), | |
5803 | SET_SRC (PATTERN (lb2))))) | |
28d81abb RK |
5804 | /* Are their ranges consecutive? */ |
5805 | && tree_int_cst_equal (np->low, | |
5806 | fold (build (PLUS_EXPR, | |
5807 | TREE_TYPE (node->high), | |
5808 | node->high, | |
5809 | integer_one_node))) | |
5810 | /* An overflow is not consecutive. */ | |
5811 | && tree_int_cst_lt (node->high, | |
5812 | fold (build (PLUS_EXPR, | |
5813 | TREE_TYPE (node->high), | |
5814 | node->high, | |
5815 | integer_one_node)))) | |
5816 | { | |
5817 | node->high = np->high; | |
5818 | } | |
5819 | /* NP is the first node after NODE which can't be grouped with it. | |
5820 | Delete the nodes in between, and move on to that node. */ | |
5821 | node->right = np; | |
5822 | node = np; | |
5823 | } | |
5824 | } | |
5825 | ||
5826 | /* Take an ordered list of case nodes | |
5827 | and transform them into a near optimal binary tree, | |
6dc42e49 | 5828 | on the assumption that any target code selection value is as |
28d81abb RK |
5829 | likely as any other. |
5830 | ||
5831 | The transformation is performed by splitting the ordered | |
5832 | list into two equal sections plus a pivot. The parts are | |
5833 | then attached to the pivot as left and right branches. Each | |
38e01259 | 5834 | branch is then transformed recursively. */ |
28d81abb RK |
5835 | |
5836 | static void | |
5837 | balance_case_nodes (head, parent) | |
5838 | case_node_ptr *head; | |
5839 | case_node_ptr parent; | |
5840 | { | |
5841 | register case_node_ptr np; | |
5842 | ||
5843 | np = *head; | |
5844 | if (np) | |
5845 | { | |
5846 | int cost = 0; | |
5847 | int i = 0; | |
5848 | int ranges = 0; | |
5849 | register case_node_ptr *npp; | |
5850 | case_node_ptr left; | |
5851 | ||
5852 | /* Count the number of entries on branch. Also count the ranges. */ | |
5853 | ||
5854 | while (np) | |
5855 | { | |
5856 | if (!tree_int_cst_equal (np->low, np->high)) | |
5857 | { | |
5858 | ranges++; | |
5859 | if (use_cost_table) | |
5860 | cost += cost_table[TREE_INT_CST_LOW (np->high)]; | |
5861 | } | |
5862 | ||
5863 | if (use_cost_table) | |
5864 | cost += cost_table[TREE_INT_CST_LOW (np->low)]; | |
5865 | ||
5866 | i++; | |
5867 | np = np->right; | |
5868 | } | |
5869 | ||
5870 | if (i > 2) | |
5871 | { | |
5872 | /* Split this list if it is long enough for that to help. */ | |
5873 | npp = head; | |
5874 | left = *npp; | |
5875 | if (use_cost_table) | |
5876 | { | |
5877 | /* Find the place in the list that bisects the list's total cost, | |
5878 | Here I gets half the total cost. */ | |
5879 | int n_moved = 0; | |
5880 | i = (cost + 1) / 2; | |
5881 | while (1) | |
5882 | { | |
5883 | /* Skip nodes while their cost does not reach that amount. */ | |
5884 | if (!tree_int_cst_equal ((*npp)->low, (*npp)->high)) | |
5885 | i -= cost_table[TREE_INT_CST_LOW ((*npp)->high)]; | |
5886 | i -= cost_table[TREE_INT_CST_LOW ((*npp)->low)]; | |
5887 | if (i <= 0) | |
5888 | break; | |
5889 | npp = &(*npp)->right; | |
5890 | n_moved += 1; | |
5891 | } | |
5892 | if (n_moved == 0) | |
5893 | { | |
5894 | /* Leave this branch lopsided, but optimize left-hand | |
5895 | side and fill in `parent' fields for right-hand side. */ | |
5896 | np = *head; | |
5897 | np->parent = parent; | |
5898 | balance_case_nodes (&np->left, np); | |
5899 | for (; np->right; np = np->right) | |
5900 | np->right->parent = np; | |
5901 | return; | |
5902 | } | |
5903 | } | |
5904 | /* If there are just three nodes, split at the middle one. */ | |
5905 | else if (i == 3) | |
5906 | npp = &(*npp)->right; | |
5907 | else | |
5908 | { | |
5909 | /* Find the place in the list that bisects the list's total cost, | |
5910 | where ranges count as 2. | |
5911 | Here I gets half the total cost. */ | |
5912 | i = (i + ranges + 1) / 2; | |
5913 | while (1) | |
5914 | { | |
5915 | /* Skip nodes while their cost does not reach that amount. */ | |
5916 | if (!tree_int_cst_equal ((*npp)->low, (*npp)->high)) | |
5917 | i--; | |
5918 | i--; | |
5919 | if (i <= 0) | |
5920 | break; | |
5921 | npp = &(*npp)->right; | |
5922 | } | |
5923 | } | |
5924 | *head = np = *npp; | |
5925 | *npp = 0; | |
5926 | np->parent = parent; | |
5927 | np->left = left; | |
5928 | ||
5929 | /* Optimize each of the two split parts. */ | |
5930 | balance_case_nodes (&np->left, np); | |
5931 | balance_case_nodes (&np->right, np); | |
5932 | } | |
5933 | else | |
5934 | { | |
5935 | /* Else leave this branch as one level, | |
5936 | but fill in `parent' fields. */ | |
5937 | np = *head; | |
5938 | np->parent = parent; | |
5939 | for (; np->right; np = np->right) | |
5940 | np->right->parent = np; | |
5941 | } | |
5942 | } | |
5943 | } | |
5944 | \f | |
5945 | /* Search the parent sections of the case node tree | |
5946 | to see if a test for the lower bound of NODE would be redundant. | |
5947 | INDEX_TYPE is the type of the index expression. | |
5948 | ||
5949 | The instructions to generate the case decision tree are | |
5950 | output in the same order as nodes are processed so it is | |
5951 | known that if a parent node checks the range of the current | |
5952 | node minus one that the current node is bounded at its lower | |
5953 | span. Thus the test would be redundant. */ | |
5954 | ||
5955 | static int | |
5956 | node_has_low_bound (node, index_type) | |
5957 | case_node_ptr node; | |
5958 | tree index_type; | |
5959 | { | |
5960 | tree low_minus_one; | |
5961 | case_node_ptr pnode; | |
5962 | ||
5963 | /* If the lower bound of this node is the lowest value in the index type, | |
5964 | we need not test it. */ | |
5965 | ||
5966 | if (tree_int_cst_equal (node->low, TYPE_MIN_VALUE (index_type))) | |
5967 | return 1; | |
5968 | ||
5969 | /* If this node has a left branch, the value at the left must be less | |
5970 | than that at this node, so it cannot be bounded at the bottom and | |
5971 | we need not bother testing any further. */ | |
5972 | ||
5973 | if (node->left) | |
5974 | return 0; | |
5975 | ||
5976 | low_minus_one = fold (build (MINUS_EXPR, TREE_TYPE (node->low), | |
5977 | node->low, integer_one_node)); | |
5978 | ||
5979 | /* If the subtraction above overflowed, we can't verify anything. | |
5980 | Otherwise, look for a parent that tests our value - 1. */ | |
5981 | ||
5982 | if (! tree_int_cst_lt (low_minus_one, node->low)) | |
5983 | return 0; | |
5984 | ||
5985 | for (pnode = node->parent; pnode; pnode = pnode->parent) | |
5986 | if (tree_int_cst_equal (low_minus_one, pnode->high)) | |
5987 | return 1; | |
5988 | ||
5989 | return 0; | |
5990 | } | |
5991 | ||
5992 | /* Search the parent sections of the case node tree | |
5993 | to see if a test for the upper bound of NODE would be redundant. | |
5994 | INDEX_TYPE is the type of the index expression. | |
5995 | ||
5996 | The instructions to generate the case decision tree are | |
5997 | output in the same order as nodes are processed so it is | |
5998 | known that if a parent node checks the range of the current | |
5999 | node plus one that the current node is bounded at its upper | |
6000 | span. Thus the test would be redundant. */ | |
6001 | ||
6002 | static int | |
6003 | node_has_high_bound (node, index_type) | |
6004 | case_node_ptr node; | |
6005 | tree index_type; | |
6006 | { | |
6007 | tree high_plus_one; | |
6008 | case_node_ptr pnode; | |
6009 | ||
e1ee5cdc RH |
6010 | /* If there is no upper bound, obviously no test is needed. */ |
6011 | ||
6012 | if (TYPE_MAX_VALUE (index_type) == NULL) | |
6013 | return 1; | |
6014 | ||
28d81abb RK |
6015 | /* If the upper bound of this node is the highest value in the type |
6016 | of the index expression, we need not test against it. */ | |
6017 | ||
6018 | if (tree_int_cst_equal (node->high, TYPE_MAX_VALUE (index_type))) | |
6019 | return 1; | |
6020 | ||
6021 | /* If this node has a right branch, the value at the right must be greater | |
6022 | than that at this node, so it cannot be bounded at the top and | |
6023 | we need not bother testing any further. */ | |
6024 | ||
6025 | if (node->right) | |
6026 | return 0; | |
6027 | ||
6028 | high_plus_one = fold (build (PLUS_EXPR, TREE_TYPE (node->high), | |
6029 | node->high, integer_one_node)); | |
6030 | ||
6031 | /* If the addition above overflowed, we can't verify anything. | |
6032 | Otherwise, look for a parent that tests our value + 1. */ | |
6033 | ||
6034 | if (! tree_int_cst_lt (node->high, high_plus_one)) | |
6035 | return 0; | |
6036 | ||
6037 | for (pnode = node->parent; pnode; pnode = pnode->parent) | |
6038 | if (tree_int_cst_equal (high_plus_one, pnode->low)) | |
6039 | return 1; | |
6040 | ||
6041 | return 0; | |
6042 | } | |
6043 | ||
6044 | /* Search the parent sections of the | |
6045 | case node tree to see if both tests for the upper and lower | |
6046 | bounds of NODE would be redundant. */ | |
6047 | ||
6048 | static int | |
6049 | node_is_bounded (node, index_type) | |
6050 | case_node_ptr node; | |
6051 | tree index_type; | |
6052 | { | |
6053 | return (node_has_low_bound (node, index_type) | |
6054 | && node_has_high_bound (node, index_type)); | |
6055 | } | |
6056 | ||
6057 | /* Emit an unconditional jump to LABEL unless it would be dead code. */ | |
6058 | ||
6059 | static void | |
6060 | emit_jump_if_reachable (label) | |
6061 | rtx label; | |
6062 | { | |
6063 | if (GET_CODE (get_last_insn ()) != BARRIER) | |
6064 | emit_jump (label); | |
6065 | } | |
6066 | \f | |
6067 | /* Emit step-by-step code to select a case for the value of INDEX. | |
6068 | The thus generated decision tree follows the form of the | |
6069 | case-node binary tree NODE, whose nodes represent test conditions. | |
6070 | INDEX_TYPE is the type of the index of the switch. | |
6071 | ||
6072 | Care is taken to prune redundant tests from the decision tree | |
6073 | by detecting any boundary conditions already checked by | |
6074 | emitted rtx. (See node_has_high_bound, node_has_low_bound | |
6075 | and node_is_bounded, above.) | |
6076 | ||
6077 | Where the test conditions can be shown to be redundant we emit | |
6078 | an unconditional jump to the target code. As a further | |
6079 | optimization, the subordinates of a tree node are examined to | |
6080 | check for bounded nodes. In this case conditional and/or | |
6081 | unconditional jumps as a result of the boundary check for the | |
6082 | current node are arranged to target the subordinates associated | |
38e01259 | 6083 | code for out of bound conditions on the current node. |
28d81abb | 6084 | |
f72aed24 | 6085 | We can assume that when control reaches the code generated here, |
28d81abb RK |
6086 | the index value has already been compared with the parents |
6087 | of this node, and determined to be on the same side of each parent | |
6088 | as this node is. Thus, if this node tests for the value 51, | |
6089 | and a parent tested for 52, we don't need to consider | |
6090 | the possibility of a value greater than 51. If another parent | |
6091 | tests for the value 50, then this node need not test anything. */ | |
6092 | ||
6093 | static void | |
6094 | emit_case_nodes (index, node, default_label, index_type) | |
6095 | rtx index; | |
6096 | case_node_ptr node; | |
6097 | rtx default_label; | |
6098 | tree index_type; | |
6099 | { | |
6100 | /* If INDEX has an unsigned type, we must make unsigned branches. */ | |
6101 | int unsignedp = TREE_UNSIGNED (index_type); | |
28d81abb RK |
6102 | enum machine_mode mode = GET_MODE (index); |
6103 | ||
6104 | /* See if our parents have already tested everything for us. | |
6105 | If they have, emit an unconditional jump for this node. */ | |
6106 | if (node_is_bounded (node, index_type)) | |
6107 | emit_jump (label_rtx (node->code_label)); | |
6108 | ||
6109 | else if (tree_int_cst_equal (node->low, node->high)) | |
6110 | { | |
6111 | /* Node is single valued. First see if the index expression matches | |
0f41302f | 6112 | this node and then check our children, if any. */ |
28d81abb | 6113 | |
37366632 | 6114 | do_jump_if_equal (index, expand_expr (node->low, NULL_RTX, VOIDmode, 0), |
28d81abb RK |
6115 | label_rtx (node->code_label), unsignedp); |
6116 | ||
6117 | if (node->right != 0 && node->left != 0) | |
6118 | { | |
6119 | /* This node has children on both sides. | |
6120 | Dispatch to one side or the other | |
6121 | by comparing the index value with this node's value. | |
6122 | If one subtree is bounded, check that one first, | |
6123 | so we can avoid real branches in the tree. */ | |
6124 | ||
6125 | if (node_is_bounded (node->right, index_type)) | |
6126 | { | |
c5d5d461 JL |
6127 | emit_cmp_and_jump_insns (index, expand_expr (node->high, NULL_RTX, |
6128 | VOIDmode, 0), | |
6129 | GT, NULL_RTX, mode, unsignedp, 0, | |
6130 | label_rtx (node->right->code_label)); | |
28d81abb RK |
6131 | emit_case_nodes (index, node->left, default_label, index_type); |
6132 | } | |
6133 | ||
6134 | else if (node_is_bounded (node->left, index_type)) | |
6135 | { | |
c5d5d461 JL |
6136 | emit_cmp_and_jump_insns (index, expand_expr (node->high, NULL_RTX, |
6137 | VOIDmode, 0), | |
6138 | LT, NULL_RTX, mode, unsignedp, 0, | |
6139 | label_rtx (node->left->code_label)); | |
28d81abb RK |
6140 | emit_case_nodes (index, node->right, default_label, index_type); |
6141 | } | |
6142 | ||
6143 | else | |
6144 | { | |
6145 | /* Neither node is bounded. First distinguish the two sides; | |
6146 | then emit the code for one side at a time. */ | |
6147 | ||
6148 | tree test_label | |
6149 | = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); | |
6150 | ||
6151 | /* See if the value is on the right. */ | |
c5d5d461 JL |
6152 | emit_cmp_and_jump_insns (index, expand_expr (node->high, NULL_RTX, |
6153 | VOIDmode, 0), | |
6154 | GT, NULL_RTX, mode, unsignedp, 0, | |
6155 | label_rtx (test_label)); | |
28d81abb RK |
6156 | |
6157 | /* Value must be on the left. | |
6158 | Handle the left-hand subtree. */ | |
6159 | emit_case_nodes (index, node->left, default_label, index_type); | |
6160 | /* If left-hand subtree does nothing, | |
6161 | go to default. */ | |
6162 | emit_jump_if_reachable (default_label); | |
6163 | ||
6164 | /* Code branches here for the right-hand subtree. */ | |
6165 | expand_label (test_label); | |
6166 | emit_case_nodes (index, node->right, default_label, index_type); | |
6167 | } | |
6168 | } | |
6169 | ||
6170 | else if (node->right != 0 && node->left == 0) | |
6171 | { | |
6172 | /* Here we have a right child but no left so we issue conditional | |
6173 | branch to default and process the right child. | |
6174 | ||
6175 | Omit the conditional branch to default if we it avoid only one | |
6176 | right child; it costs too much space to save so little time. */ | |
6177 | ||
de14fd73 | 6178 | if (node->right->right || node->right->left |
28d81abb RK |
6179 | || !tree_int_cst_equal (node->right->low, node->right->high)) |
6180 | { | |
6181 | if (!node_has_low_bound (node, index_type)) | |
6182 | { | |
c5d5d461 JL |
6183 | emit_cmp_and_jump_insns (index, expand_expr (node->high, |
6184 | NULL_RTX, | |
6185 | VOIDmode, 0), | |
6186 | LT, NULL_RTX, mode, unsignedp, 0, | |
6187 | default_label); | |
28d81abb RK |
6188 | } |
6189 | ||
6190 | emit_case_nodes (index, node->right, default_label, index_type); | |
6191 | } | |
6192 | else | |
6193 | /* We cannot process node->right normally | |
6194 | since we haven't ruled out the numbers less than | |
6195 | this node's value. So handle node->right explicitly. */ | |
6196 | do_jump_if_equal (index, | |
37366632 RK |
6197 | expand_expr (node->right->low, NULL_RTX, |
6198 | VOIDmode, 0), | |
28d81abb RK |
6199 | label_rtx (node->right->code_label), unsignedp); |
6200 | } | |
6201 | ||
6202 | else if (node->right == 0 && node->left != 0) | |
6203 | { | |
6204 | /* Just one subtree, on the left. */ | |
6205 | ||
de14fd73 RK |
6206 | #if 0 /* The following code and comment were formerly part |
6207 | of the condition here, but they didn't work | |
6208 | and I don't understand what the idea was. -- rms. */ | |
6209 | /* If our "most probable entry" is less probable | |
28d81abb RK |
6210 | than the default label, emit a jump to |
6211 | the default label using condition codes | |
6212 | already lying around. With no right branch, | |
6213 | a branch-greater-than will get us to the default | |
6214 | label correctly. */ | |
de14fd73 RK |
6215 | if (use_cost_table |
6216 | && cost_table[TREE_INT_CST_LOW (node->high)] < 12) | |
6217 | ; | |
6218 | #endif /* 0 */ | |
6219 | if (node->left->left || node->left->right | |
28d81abb RK |
6220 | || !tree_int_cst_equal (node->left->low, node->left->high)) |
6221 | { | |
6222 | if (!node_has_high_bound (node, index_type)) | |
6223 | { | |
c5d5d461 JL |
6224 | emit_cmp_and_jump_insns (index, expand_expr (node->high, |
6225 | NULL_RTX, | |
6226 | VOIDmode, 0), | |
6227 | GT, NULL_RTX, mode, unsignedp, 0, | |
6228 | default_label); | |
28d81abb RK |
6229 | } |
6230 | ||
6231 | emit_case_nodes (index, node->left, default_label, index_type); | |
6232 | } | |
6233 | else | |
6234 | /* We cannot process node->left normally | |
6235 | since we haven't ruled out the numbers less than | |
6236 | this node's value. So handle node->left explicitly. */ | |
6237 | do_jump_if_equal (index, | |
37366632 RK |
6238 | expand_expr (node->left->low, NULL_RTX, |
6239 | VOIDmode, 0), | |
28d81abb RK |
6240 | label_rtx (node->left->code_label), unsignedp); |
6241 | } | |
6242 | } | |
6243 | else | |
6244 | { | |
6245 | /* Node is a range. These cases are very similar to those for a single | |
6246 | value, except that we do not start by testing whether this node | |
6247 | is the one to branch to. */ | |
6248 | ||
6249 | if (node->right != 0 && node->left != 0) | |
6250 | { | |
6251 | /* Node has subtrees on both sides. | |
6252 | If the right-hand subtree is bounded, | |
6253 | test for it first, since we can go straight there. | |
6254 | Otherwise, we need to make a branch in the control structure, | |
6255 | then handle the two subtrees. */ | |
6256 | tree test_label = 0; | |
6257 | ||
28d81abb RK |
6258 | |
6259 | if (node_is_bounded (node->right, index_type)) | |
6260 | /* Right hand node is fully bounded so we can eliminate any | |
6261 | testing and branch directly to the target code. */ | |
c5d5d461 JL |
6262 | emit_cmp_and_jump_insns (index, expand_expr (node->high, NULL_RTX, |
6263 | VOIDmode, 0), | |
6264 | GT, NULL_RTX, mode, unsignedp, 0, | |
6265 | label_rtx (node->right->code_label)); | |
28d81abb RK |
6266 | else |
6267 | { | |
6268 | /* Right hand node requires testing. | |
6269 | Branch to a label where we will handle it later. */ | |
6270 | ||
6271 | test_label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); | |
c5d5d461 JL |
6272 | emit_cmp_and_jump_insns (index, expand_expr (node->high, NULL_RTX, |
6273 | VOIDmode, 0), | |
6274 | GT, NULL_RTX, mode, unsignedp, 0, | |
6275 | label_rtx (test_label)); | |
28d81abb RK |
6276 | } |
6277 | ||
6278 | /* Value belongs to this node or to the left-hand subtree. */ | |
6279 | ||
c5d5d461 JL |
6280 | emit_cmp_and_jump_insns (index, expand_expr (node->low, NULL_RTX, |
6281 | VOIDmode, 0), | |
6282 | GE, NULL_RTX, mode, unsignedp, 0, | |
6283 | label_rtx (node->code_label)); | |
28d81abb RK |
6284 | |
6285 | /* Handle the left-hand subtree. */ | |
6286 | emit_case_nodes (index, node->left, default_label, index_type); | |
6287 | ||
6288 | /* If right node had to be handled later, do that now. */ | |
6289 | ||
6290 | if (test_label) | |
6291 | { | |
6292 | /* If the left-hand subtree fell through, | |
6293 | don't let it fall into the right-hand subtree. */ | |
6294 | emit_jump_if_reachable (default_label); | |
6295 | ||
6296 | expand_label (test_label); | |
6297 | emit_case_nodes (index, node->right, default_label, index_type); | |
6298 | } | |
6299 | } | |
6300 | ||
6301 | else if (node->right != 0 && node->left == 0) | |
6302 | { | |
6303 | /* Deal with values to the left of this node, | |
6304 | if they are possible. */ | |
6305 | if (!node_has_low_bound (node, index_type)) | |
6306 | { | |
c5d5d461 JL |
6307 | emit_cmp_and_jump_insns (index, expand_expr (node->low, NULL_RTX, |
6308 | VOIDmode, 0), | |
6309 | LT, NULL_RTX, mode, unsignedp, 0, | |
6310 | default_label); | |
28d81abb RK |
6311 | } |
6312 | ||
6313 | /* Value belongs to this node or to the right-hand subtree. */ | |
6314 | ||
c5d5d461 JL |
6315 | emit_cmp_and_jump_insns (index, expand_expr (node->high, NULL_RTX, |
6316 | VOIDmode, 0), | |
6317 | LE, NULL_RTX, mode, unsignedp, 0, | |
6318 | label_rtx (node->code_label)); | |
28d81abb RK |
6319 | |
6320 | emit_case_nodes (index, node->right, default_label, index_type); | |
6321 | } | |
6322 | ||
6323 | else if (node->right == 0 && node->left != 0) | |
6324 | { | |
6325 | /* Deal with values to the right of this node, | |
6326 | if they are possible. */ | |
6327 | if (!node_has_high_bound (node, index_type)) | |
6328 | { | |
c5d5d461 JL |
6329 | emit_cmp_and_jump_insns (index, expand_expr (node->high, NULL_RTX, |
6330 | VOIDmode, 0), | |
6331 | GT, NULL_RTX, mode, unsignedp, 0, | |
6332 | default_label); | |
28d81abb RK |
6333 | } |
6334 | ||
6335 | /* Value belongs to this node or to the left-hand subtree. */ | |
6336 | ||
c5d5d461 JL |
6337 | emit_cmp_and_jump_insns (index, expand_expr (node->low, NULL_RTX, |
6338 | VOIDmode, 0), | |
6339 | GE, NULL_RTX, mode, unsignedp, 0, | |
6340 | label_rtx (node->code_label)); | |
28d81abb RK |
6341 | |
6342 | emit_case_nodes (index, node->left, default_label, index_type); | |
6343 | } | |
6344 | ||
6345 | else | |
6346 | { | |
6347 | /* Node has no children so we check low and high bounds to remove | |
6348 | redundant tests. Only one of the bounds can exist, | |
6349 | since otherwise this node is bounded--a case tested already. */ | |
6350 | ||
6351 | if (!node_has_high_bound (node, index_type)) | |
6352 | { | |
c5d5d461 JL |
6353 | emit_cmp_and_jump_insns (index, expand_expr (node->high, NULL_RTX, |
6354 | VOIDmode, 0), | |
6355 | GT, NULL_RTX, mode, unsignedp, 0, | |
6356 | default_label); | |
28d81abb RK |
6357 | } |
6358 | ||
6359 | if (!node_has_low_bound (node, index_type)) | |
6360 | { | |
c5d5d461 JL |
6361 | emit_cmp_and_jump_insns (index, expand_expr (node->low, NULL_RTX, |
6362 | VOIDmode, 0), | |
6363 | LT, NULL_RTX, mode, unsignedp, 0, | |
6364 | default_label); | |
28d81abb RK |
6365 | } |
6366 | ||
6367 | emit_jump (label_rtx (node->code_label)); | |
6368 | } | |
6369 | } | |
6370 | } | |
6371 | \f | |
6372 | /* These routines are used by the loop unrolling code. They copy BLOCK trees | |
6373 | so that the debugging info will be correct for the unrolled loop. */ | |
6374 | ||
28d81abb | 6375 | void |
94dc8b56 | 6376 | find_loop_tree_blocks () |
28d81abb | 6377 | { |
1a4450c7 | 6378 | identify_blocks (DECL_INITIAL (current_function_decl), get_insns ()); |
28d81abb RK |
6379 | } |
6380 | ||
28d81abb | 6381 | void |
94dc8b56 | 6382 | unroll_block_trees () |
28d81abb | 6383 | { |
94dc8b56 | 6384 | tree block = DECL_INITIAL (current_function_decl); |
28d81abb | 6385 | |
1a4450c7 | 6386 | reorder_blocks (block, get_insns ()); |
28d81abb | 6387 | } |