]>
Commit | Line | Data |
---|---|---|
75a70cf9 | 1 | /* GIMPLE lowering pass. Converts High GIMPLE into Low GIMPLE. |
4ee9c684 | 2 | |
711789cc | 3 | Copyright (C) 2003-2013 Free Software Foundation, Inc. |
4ee9c684 | 4 | |
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
8c4c00c1 | 9 | Software Foundation; either version 3, or (at your option) any later |
4ee9c684 | 10 | version. |
11 | ||
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
8c4c00c1 | 18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
4ee9c684 | 20 | |
21 | #include "config.h" | |
22 | #include "system.h" | |
23 | #include "coretypes.h" | |
24 | #include "tm.h" | |
25 | #include "tree.h" | |
75a70cf9 | 26 | #include "gimple.h" |
27 | #include "tree-iterator.h" | |
4ee9c684 | 28 | #include "tree-inline.h" |
4ee9c684 | 29 | #include "tree-flow.h" |
4ee9c684 | 30 | #include "flags.h" |
31 | #include "function.h" | |
0b205f4c | 32 | #include "diagnostic-core.h" |
4ee9c684 | 33 | #include "tree-pass.h" |
6cb25bec | 34 | #include "langhooks.h" |
4ee9c684 | 35 | |
75a70cf9 | 36 | /* The differences between High GIMPLE and Low GIMPLE are the |
37 | following: | |
38 | ||
39 | 1- Lexical scopes are removed (i.e., GIMPLE_BIND disappears). | |
40 | ||
41 | 2- GIMPLE_TRY and GIMPLE_CATCH are converted to abnormal control | |
42 | flow and exception regions are built as an on-the-side region | |
43 | hierarchy (See tree-eh.c:lower_eh_constructs). | |
44 | ||
45 | 3- Multiple identical return statements are grouped into a single | |
46 | return and gotos to the unique return site. */ | |
47 | ||
48 | /* Match a return statement with a label. During lowering, we identify | |
49 | identical return statements and replace duplicates with a jump to | |
50 | the corresponding label. */ | |
51 | struct return_statements_t | |
52 | { | |
53 | tree label; | |
54 | gimple stmt; | |
55 | }; | |
56 | typedef struct return_statements_t return_statements_t; | |
57 | ||
75a70cf9 | 58 | |
4ee9c684 | 59 | struct lower_data |
60 | { | |
61 | /* Block the current statement belongs to. */ | |
62 | tree block; | |
22e30d4e | 63 | |
75a70cf9 | 64 | /* A vector of label and return statements to be moved to the end |
6c6a0f2f | 65 | of the function. */ |
f1f41a6c | 66 | vec<return_statements_t> return_statements; |
2c8a1497 | 67 | |
a2159096 | 68 | /* True if the current statement cannot fall through. */ |
69 | bool cannot_fallthru; | |
70 | ||
2c8a1497 | 71 | /* True if the function calls __builtin_setjmp. */ |
72 | bool calls_builtin_setjmp; | |
4ee9c684 | 73 | }; |
74 | ||
75a70cf9 | 75 | static void lower_stmt (gimple_stmt_iterator *, struct lower_data *); |
76 | static void lower_gimple_bind (gimple_stmt_iterator *, struct lower_data *); | |
929384bb | 77 | static void lower_try_catch (gimple_stmt_iterator *, struct lower_data *); |
75a70cf9 | 78 | static void lower_gimple_return (gimple_stmt_iterator *, struct lower_data *); |
79 | static void lower_builtin_setjmp (gimple_stmt_iterator *); | |
4ee9c684 | 80 | |
75a70cf9 | 81 | |
82 | /* Lower the body of current_function_decl from High GIMPLE into Low | |
83 | GIMPLE. */ | |
4ee9c684 | 84 | |
2a1990e9 | 85 | static unsigned int |
4ee9c684 | 86 | lower_function_body (void) |
87 | { | |
88 | struct lower_data data; | |
75a70cf9 | 89 | gimple_seq body = gimple_body (current_function_decl); |
90 | gimple_seq lowered_body; | |
91 | gimple_stmt_iterator i; | |
92 | gimple bind; | |
93 | tree t; | |
94 | gimple x; | |
95 | ||
96 | /* The gimplifier should've left a body of exactly one statement, | |
97 | namely a GIMPLE_BIND. */ | |
98 | gcc_assert (gimple_seq_first (body) == gimple_seq_last (body) | |
99 | && gimple_code (gimple_seq_first_stmt (body)) == GIMPLE_BIND); | |
4ee9c684 | 100 | |
1e8e9920 | 101 | memset (&data, 0, sizeof (data)); |
4ee9c684 | 102 | data.block = DECL_INITIAL (current_function_decl); |
103 | BLOCK_SUBBLOCKS (data.block) = NULL_TREE; | |
104 | BLOCK_CHAIN (data.block) = NULL_TREE; | |
105 | TREE_ASM_WRITTEN (data.block) = 1; | |
f1f41a6c | 106 | data.return_statements.create (8); |
75a70cf9 | 107 | |
108 | bind = gimple_seq_first_stmt (body); | |
109 | lowered_body = NULL; | |
110 | gimple_seq_add_stmt (&lowered_body, bind); | |
111 | i = gsi_start (lowered_body); | |
112 | lower_gimple_bind (&i, &data); | |
4ee9c684 | 113 | |
75a70cf9 | 114 | i = gsi_last (lowered_body); |
751ddc2b | 115 | |
116 | /* If the function falls off the end, we need a null return statement. | |
75a70cf9 | 117 | If we've already got one in the return_statements vector, we don't |
751ddc2b | 118 | need to do anything special. Otherwise build one by hand. */ |
75a70cf9 | 119 | if (gimple_seq_may_fallthru (lowered_body) |
f1f41a6c | 120 | && (data.return_statements.is_empty () |
121 | || gimple_return_retval (data.return_statements.last().stmt) != NULL)) | |
751ddc2b | 122 | { |
75a70cf9 | 123 | x = gimple_build_return (NULL); |
124 | gimple_set_location (x, cfun->function_end_locus); | |
32dedf8f | 125 | gimple_set_block (x, DECL_INITIAL (current_function_decl)); |
75a70cf9 | 126 | gsi_insert_after (&i, x, GSI_CONTINUE_LINKING); |
751ddc2b | 127 | } |
128 | ||
129 | /* If we lowered any return statements, emit the representative | |
130 | at the end of the function. */ | |
f1f41a6c | 131 | while (!data.return_statements.is_empty ()) |
22e30d4e | 132 | { |
f1f41a6c | 133 | return_statements_t t = data.return_statements.pop (); |
75a70cf9 | 134 | x = gimple_build_label (t.label); |
135 | gsi_insert_after (&i, x, GSI_CONTINUE_LINKING); | |
75a70cf9 | 136 | gsi_insert_after (&i, t.stmt, GSI_CONTINUE_LINKING); |
22e30d4e | 137 | } |
138 | ||
2c8a1497 | 139 | /* If the function calls __builtin_setjmp, we need to emit the computed |
140 | goto that will serve as the unique dispatcher for all the receivers. */ | |
141 | if (data.calls_builtin_setjmp) | |
142 | { | |
143 | tree disp_label, disp_var, arg; | |
144 | ||
145 | /* Build 'DISP_LABEL:' and insert. */ | |
e60a6f7b | 146 | disp_label = create_artificial_label (cfun->function_end_locus); |
2c8a1497 | 147 | /* This mark will create forward edges from every call site. */ |
148 | DECL_NONLOCAL (disp_label) = 1; | |
18d50ae6 | 149 | cfun->has_nonlocal_label = 1; |
75a70cf9 | 150 | x = gimple_build_label (disp_label); |
151 | gsi_insert_after (&i, x, GSI_CONTINUE_LINKING); | |
2c8a1497 | 152 | |
153 | /* Build 'DISP_VAR = __builtin_setjmp_dispatcher (DISP_LABEL);' | |
154 | and insert. */ | |
155 | disp_var = create_tmp_var (ptr_type_node, "setjmpvar"); | |
c2f47e15 | 156 | arg = build_addr (disp_label, current_function_decl); |
b9a16870 | 157 | t = builtin_decl_implicit (BUILT_IN_SETJMP_DISPATCHER); |
75a70cf9 | 158 | x = gimple_build_call (t, 1, arg); |
159 | gimple_call_set_lhs (x, disp_var); | |
2c8a1497 | 160 | |
161 | /* Build 'goto DISP_VAR;' and insert. */ | |
75a70cf9 | 162 | gsi_insert_after (&i, x, GSI_CONTINUE_LINKING); |
163 | x = gimple_build_goto (disp_var); | |
164 | gsi_insert_after (&i, x, GSI_CONTINUE_LINKING); | |
2c8a1497 | 165 | } |
166 | ||
e3a19533 | 167 | /* Once the old body has been lowered, replace it with the new |
168 | lowered sequence. */ | |
169 | gimple_set_body (current_function_decl, lowered_body); | |
170 | ||
0d59b19d | 171 | gcc_assert (data.block == DECL_INITIAL (current_function_decl)); |
4ee9c684 | 172 | BLOCK_SUBBLOCKS (data.block) |
173 | = blocks_nreverse (BLOCK_SUBBLOCKS (data.block)); | |
174 | ||
175 | clear_block_marks (data.block); | |
f1f41a6c | 176 | data.return_statements.release (); |
2a1990e9 | 177 | return 0; |
4ee9c684 | 178 | } |
179 | ||
cbe8bda8 | 180 | namespace { |
181 | ||
182 | const pass_data pass_data_lower_cf = | |
4ee9c684 | 183 | { |
cbe8bda8 | 184 | GIMPLE_PASS, /* type */ |
185 | "lower", /* name */ | |
186 | OPTGROUP_NONE, /* optinfo_flags */ | |
187 | false, /* has_gate */ | |
188 | true, /* has_execute */ | |
189 | TV_NONE, /* tv_id */ | |
190 | PROP_gimple_any, /* properties_required */ | |
191 | PROP_gimple_lcf, /* properties_provided */ | |
192 | 0, /* properties_destroyed */ | |
193 | 0, /* todo_flags_start */ | |
194 | 0, /* todo_flags_finish */ | |
4ee9c684 | 195 | }; |
196 | ||
cbe8bda8 | 197 | class pass_lower_cf : public gimple_opt_pass |
198 | { | |
199 | public: | |
200 | pass_lower_cf(gcc::context *ctxt) | |
201 | : gimple_opt_pass(pass_data_lower_cf, ctxt) | |
202 | {} | |
203 | ||
204 | /* opt_pass methods: */ | |
205 | unsigned int execute () { return lower_function_body (); } | |
206 | ||
207 | }; // class pass_lower_cf | |
208 | ||
209 | } // anon namespace | |
210 | ||
211 | gimple_opt_pass * | |
212 | make_pass_lower_cf (gcc::context *ctxt) | |
213 | { | |
214 | return new pass_lower_cf (ctxt); | |
215 | } | |
216 | ||
4ee9c684 | 217 | |
850ff64c | 218 | |
fdcb802d | 219 | /* Verify if the type of the argument matches that of the function |
220 | declaration. If we cannot verify this or there is a mismatch, | |
19bcf521 | 221 | return false. */ |
fdcb802d | 222 | |
850ff64c | 223 | static bool |
341de017 | 224 | gimple_check_call_args (gimple stmt, tree fndecl, bool args_count_match) |
fdcb802d | 225 | { |
850ff64c | 226 | tree parms, p; |
fdcb802d | 227 | unsigned int i, nargs; |
228 | ||
fb049fba | 229 | /* Calls to internal functions always match their signature. */ |
230 | if (gimple_call_internal_p (stmt)) | |
231 | return true; | |
232 | ||
fdcb802d | 233 | nargs = gimple_call_num_args (stmt); |
234 | ||
235 | /* Get argument types for verification. */ | |
fdcb802d | 236 | if (fndecl) |
237 | parms = TYPE_ARG_TYPES (TREE_TYPE (fndecl)); | |
2de00a2d | 238 | else |
239 | parms = TYPE_ARG_TYPES (gimple_call_fntype (stmt)); | |
fdcb802d | 240 | |
241 | /* Verify if the type of the argument matches that of the function | |
242 | declaration. If we cannot verify this or there is a mismatch, | |
19bcf521 | 243 | return false. */ |
fdcb802d | 244 | if (fndecl && DECL_ARGUMENTS (fndecl)) |
245 | { | |
246 | for (i = 0, p = DECL_ARGUMENTS (fndecl); | |
247 | i < nargs; | |
1767a056 | 248 | i++, p = DECL_CHAIN (p)) |
fdcb802d | 249 | { |
0b06d494 | 250 | tree arg; |
fdcb802d | 251 | /* We cannot distinguish a varargs function from the case |
252 | of excess parameters, still deferring the inlining decision | |
253 | to the callee is possible. */ | |
254 | if (!p) | |
255 | break; | |
0b06d494 | 256 | arg = gimple_call_arg (stmt, i); |
fdcb802d | 257 | if (p == error_mark_node |
0b06d494 | 258 | || arg == error_mark_node |
259 | || (!types_compatible_p (DECL_ARG_TYPE (p), TREE_TYPE (arg)) | |
260 | && !fold_convertible_p (DECL_ARG_TYPE (p), arg))) | |
19bcf521 | 261 | return false; |
fdcb802d | 262 | } |
341de017 | 263 | if (args_count_match && p) |
264 | return false; | |
fdcb802d | 265 | } |
266 | else if (parms) | |
267 | { | |
268 | for (i = 0, p = parms; i < nargs; i++, p = TREE_CHAIN (p)) | |
269 | { | |
0b06d494 | 270 | tree arg; |
fdcb802d | 271 | /* If this is a varargs function defer inlining decision |
272 | to callee. */ | |
273 | if (!p) | |
274 | break; | |
0b06d494 | 275 | arg = gimple_call_arg (stmt, i); |
fdcb802d | 276 | if (TREE_VALUE (p) == error_mark_node |
0b06d494 | 277 | || arg == error_mark_node |
fdcb802d | 278 | || TREE_CODE (TREE_VALUE (p)) == VOID_TYPE |
0b06d494 | 279 | || (!types_compatible_p (TREE_VALUE (p), TREE_TYPE (arg)) |
280 | && !fold_convertible_p (TREE_VALUE (p), arg))) | |
19bcf521 | 281 | return false; |
fdcb802d | 282 | } |
283 | } | |
284 | else | |
285 | { | |
286 | if (nargs != 0) | |
19bcf521 | 287 | return false; |
fdcb802d | 288 | } |
19bcf521 | 289 | return true; |
fdcb802d | 290 | } |
291 | ||
850ff64c | 292 | /* Verify if the type of the argument and lhs of CALL_STMT matches |
341de017 | 293 | that of the function declaration CALLEE. If ARGS_COUNT_MATCH is |
294 | true, the arg count needs to be the same. | |
850ff64c | 295 | If we cannot verify this or there is a mismatch, return false. */ |
296 | ||
297 | bool | |
341de017 | 298 | gimple_check_call_matching_types (gimple call_stmt, tree callee, |
299 | bool args_count_match) | |
850ff64c | 300 | { |
301 | tree lhs; | |
302 | ||
303 | if ((DECL_RESULT (callee) | |
304 | && !DECL_BY_REFERENCE (DECL_RESULT (callee)) | |
305 | && (lhs = gimple_call_lhs (call_stmt)) != NULL_TREE | |
306 | && !useless_type_conversion_p (TREE_TYPE (DECL_RESULT (callee)), | |
307 | TREE_TYPE (lhs)) | |
308 | && !fold_convertible_p (TREE_TYPE (DECL_RESULT (callee)), lhs)) | |
341de017 | 309 | || !gimple_check_call_args (call_stmt, callee, args_count_match)) |
850ff64c | 310 | return false; |
311 | return true; | |
312 | } | |
fdcb802d | 313 | |
75a70cf9 | 314 | /* Lower sequence SEQ. Unlike gimplification the statements are not relowered |
4ee9c684 | 315 | when they are changed -- if this has to be done, the lowering routine must |
316 | do it explicitly. DATA is passed through the recursion. */ | |
317 | ||
c939e803 | 318 | static void |
e3a19533 | 319 | lower_sequence (gimple_seq *seq, struct lower_data *data) |
4ee9c684 | 320 | { |
75a70cf9 | 321 | gimple_stmt_iterator gsi; |
4ee9c684 | 322 | |
e3a19533 | 323 | for (gsi = gsi_start (*seq); !gsi_end_p (gsi); ) |
75a70cf9 | 324 | lower_stmt (&gsi, data); |
4ee9c684 | 325 | } |
326 | ||
773c5ba7 | 327 | |
75a70cf9 | 328 | /* Lower the OpenMP directive statement pointed by GSI. DATA is |
773c5ba7 | 329 | passed through the recursion. */ |
330 | ||
331 | static void | |
75a70cf9 | 332 | lower_omp_directive (gimple_stmt_iterator *gsi, struct lower_data *data) |
773c5ba7 | 333 | { |
75a70cf9 | 334 | gimple stmt; |
48e1416a | 335 | |
75a70cf9 | 336 | stmt = gsi_stmt (*gsi); |
773c5ba7 | 337 | |
e3a19533 | 338 | lower_sequence (gimple_omp_body_ptr (stmt), data); |
339 | gsi_insert_seq_after (gsi, gimple_omp_body (stmt), GSI_CONTINUE_LINKING); | |
75a70cf9 | 340 | gimple_omp_set_body (stmt, NULL); |
e3a19533 | 341 | gsi_next (gsi); |
773c5ba7 | 342 | } |
343 | ||
344 | ||
a2159096 | 345 | /* Lower statement GSI. DATA is passed through the recursion. We try to |
346 | track the fallthruness of statements and get rid of unreachable return | |
347 | statements in order to prevent the EH lowering pass from adding useless | |
348 | edges that can cause bogus warnings to be issued later; this guess need | |
349 | not be 100% accurate, simply be conservative and reset cannot_fallthru | |
350 | to false if we don't know. */ | |
4ee9c684 | 351 | |
352 | static void | |
75a70cf9 | 353 | lower_stmt (gimple_stmt_iterator *gsi, struct lower_data *data) |
4ee9c684 | 354 | { |
75a70cf9 | 355 | gimple stmt = gsi_stmt (*gsi); |
4ee9c684 | 356 | |
75a70cf9 | 357 | gimple_set_block (stmt, data->block); |
4ee9c684 | 358 | |
75a70cf9 | 359 | switch (gimple_code (stmt)) |
4ee9c684 | 360 | { |
75a70cf9 | 361 | case GIMPLE_BIND: |
362 | lower_gimple_bind (gsi, data); | |
a2159096 | 363 | /* Propagate fallthruness. */ |
22e30d4e | 364 | return; |
4ee9c684 | 365 | |
75a70cf9 | 366 | case GIMPLE_COND: |
a2159096 | 367 | case GIMPLE_GOTO: |
368 | case GIMPLE_SWITCH: | |
369 | data->cannot_fallthru = true; | |
370 | gsi_next (gsi); | |
371 | return; | |
75a70cf9 | 372 | |
373 | case GIMPLE_RETURN: | |
a2159096 | 374 | if (data->cannot_fallthru) |
375 | { | |
376 | gsi_remove (gsi, false); | |
377 | /* Propagate fallthruness. */ | |
378 | } | |
379 | else | |
380 | { | |
381 | lower_gimple_return (gsi, data); | |
382 | data->cannot_fallthru = true; | |
383 | } | |
75a70cf9 | 384 | return; |
385 | ||
386 | case GIMPLE_TRY: | |
929384bb | 387 | if (gimple_try_kind (stmt) == GIMPLE_TRY_CATCH) |
388 | lower_try_catch (gsi, data); | |
389 | else | |
390 | { | |
391 | /* It must be a GIMPLE_TRY_FINALLY. */ | |
392 | bool cannot_fallthru; | |
393 | lower_sequence (gimple_try_eval_ptr (stmt), data); | |
394 | cannot_fallthru = data->cannot_fallthru; | |
395 | ||
396 | /* The finally clause is always executed after the try clause, | |
397 | so if it does not fall through, then the try-finally will not | |
398 | fall through. Otherwise, if the try clause does not fall | |
399 | through, then when the finally clause falls through it will | |
400 | resume execution wherever the try clause was going. So the | |
401 | whole try-finally will only fall through if both the try | |
402 | clause and the finally clause fall through. */ | |
403 | data->cannot_fallthru = false; | |
404 | lower_sequence (gimple_try_cleanup_ptr (stmt), data); | |
405 | data->cannot_fallthru |= cannot_fallthru; | |
406 | gsi_next (gsi); | |
407 | } | |
408 | return; | |
61e47ac8 | 409 | |
4c0315d0 | 410 | case GIMPLE_EH_ELSE: |
e3a19533 | 411 | lower_sequence (gimple_eh_else_n_body_ptr (stmt), data); |
412 | lower_sequence (gimple_eh_else_e_body_ptr (stmt), data); | |
4c0315d0 | 413 | break; |
414 | ||
75a70cf9 | 415 | case GIMPLE_NOP: |
416 | case GIMPLE_ASM: | |
417 | case GIMPLE_ASSIGN: | |
75a70cf9 | 418 | case GIMPLE_PREDICT: |
419 | case GIMPLE_LABEL: | |
e38def9c | 420 | case GIMPLE_EH_MUST_NOT_THROW: |
75a70cf9 | 421 | case GIMPLE_OMP_FOR: |
422 | case GIMPLE_OMP_SECTIONS: | |
423 | case GIMPLE_OMP_SECTIONS_SWITCH: | |
424 | case GIMPLE_OMP_SECTION: | |
425 | case GIMPLE_OMP_SINGLE: | |
426 | case GIMPLE_OMP_MASTER: | |
427 | case GIMPLE_OMP_ORDERED: | |
428 | case GIMPLE_OMP_CRITICAL: | |
429 | case GIMPLE_OMP_RETURN: | |
430 | case GIMPLE_OMP_ATOMIC_LOAD: | |
431 | case GIMPLE_OMP_ATOMIC_STORE: | |
432 | case GIMPLE_OMP_CONTINUE: | |
433 | break; | |
2c8a1497 | 434 | |
75a70cf9 | 435 | case GIMPLE_CALL: |
2c8a1497 | 436 | { |
75a70cf9 | 437 | tree decl = gimple_call_fndecl (stmt); |
3c8c0942 | 438 | unsigned i; |
439 | ||
440 | for (i = 0; i < gimple_call_num_args (stmt); i++) | |
441 | { | |
442 | tree arg = gimple_call_arg (stmt, i); | |
443 | if (EXPR_P (arg)) | |
444 | TREE_SET_BLOCK (arg, data->block); | |
445 | } | |
75a70cf9 | 446 | |
2c8a1497 | 447 | if (decl |
448 | && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL | |
449 | && DECL_FUNCTION_CODE (decl) == BUILT_IN_SETJMP) | |
450 | { | |
75a70cf9 | 451 | lower_builtin_setjmp (gsi); |
a2159096 | 452 | data->cannot_fallthru = false; |
453 | data->calls_builtin_setjmp = true; | |
2c8a1497 | 454 | return; |
455 | } | |
264ee46d | 456 | |
264ee46d | 457 | if (decl && (flags_from_decl_or_type (decl) & ECF_NORETURN)) |
458 | { | |
a2159096 | 459 | data->cannot_fallthru = true; |
264ee46d | 460 | gsi_next (gsi); |
264ee46d | 461 | return; |
462 | } | |
2c8a1497 | 463 | } |
464 | break; | |
465 | ||
75a70cf9 | 466 | case GIMPLE_OMP_PARALLEL: |
467 | case GIMPLE_OMP_TASK: | |
a2159096 | 468 | data->cannot_fallthru = false; |
75a70cf9 | 469 | lower_omp_directive (gsi, data); |
a2159096 | 470 | data->cannot_fallthru = false; |
773c5ba7 | 471 | return; |
472 | ||
4c0315d0 | 473 | case GIMPLE_TRANSACTION: |
e3a19533 | 474 | lower_sequence (gimple_transaction_body_ptr (stmt), data); |
4c0315d0 | 475 | break; |
476 | ||
4ee9c684 | 477 | default: |
0d59b19d | 478 | gcc_unreachable (); |
4ee9c684 | 479 | } |
480 | ||
a2159096 | 481 | data->cannot_fallthru = false; |
75a70cf9 | 482 | gsi_next (gsi); |
4ee9c684 | 483 | } |
484 | ||
2c8a1497 | 485 | /* Lower a bind_expr TSI. DATA is passed through the recursion. */ |
4ee9c684 | 486 | |
487 | static void | |
75a70cf9 | 488 | lower_gimple_bind (gimple_stmt_iterator *gsi, struct lower_data *data) |
4ee9c684 | 489 | { |
490 | tree old_block = data->block; | |
75a70cf9 | 491 | gimple stmt = gsi_stmt (*gsi); |
492 | tree new_block = gimple_bind_block (stmt); | |
4ee9c684 | 493 | |
494 | if (new_block) | |
495 | { | |
496 | if (new_block == old_block) | |
497 | { | |
498 | /* The outermost block of the original function may not be the | |
499 | outermost statement chain of the gimplified function. So we | |
500 | may see the outermost block just inside the function. */ | |
0d59b19d | 501 | gcc_assert (new_block == DECL_INITIAL (current_function_decl)); |
4ee9c684 | 502 | new_block = NULL; |
503 | } | |
504 | else | |
505 | { | |
506 | /* We do not expect to handle duplicate blocks. */ | |
0d59b19d | 507 | gcc_assert (!TREE_ASM_WRITTEN (new_block)); |
4ee9c684 | 508 | TREE_ASM_WRITTEN (new_block) = 1; |
509 | ||
510 | /* Block tree may get clobbered by inlining. Normally this would | |
511 | be fixed in rest_of_decl_compilation using block notes, but | |
512 | since we are not going to emit them, it is up to us. */ | |
513 | BLOCK_CHAIN (new_block) = BLOCK_SUBBLOCKS (old_block); | |
514 | BLOCK_SUBBLOCKS (old_block) = new_block; | |
515 | BLOCK_SUBBLOCKS (new_block) = NULL_TREE; | |
516 | BLOCK_SUPERCONTEXT (new_block) = old_block; | |
517 | ||
518 | data->block = new_block; | |
519 | } | |
520 | } | |
521 | ||
75a70cf9 | 522 | record_vars (gimple_bind_vars (stmt)); |
e3a19533 | 523 | lower_sequence (gimple_bind_body_ptr (stmt), data); |
4ee9c684 | 524 | |
525 | if (new_block) | |
526 | { | |
0d59b19d | 527 | gcc_assert (data->block == new_block); |
4ee9c684 | 528 | |
529 | BLOCK_SUBBLOCKS (new_block) | |
530 | = blocks_nreverse (BLOCK_SUBBLOCKS (new_block)); | |
531 | data->block = old_block; | |
532 | } | |
533 | ||
75a70cf9 | 534 | /* The GIMPLE_BIND no longer carries any useful information -- kill it. */ |
535 | gsi_insert_seq_before (gsi, gimple_bind_body (stmt), GSI_SAME_STMT); | |
536 | gsi_remove (gsi, false); | |
4ee9c684 | 537 | } |
538 | ||
929384bb | 539 | /* Same as above, but for a GIMPLE_TRY_CATCH. */ |
540 | ||
541 | static void | |
542 | lower_try_catch (gimple_stmt_iterator *gsi, struct lower_data *data) | |
543 | { | |
544 | bool cannot_fallthru; | |
545 | gimple stmt = gsi_stmt (*gsi); | |
546 | gimple_stmt_iterator i; | |
547 | ||
548 | /* We don't handle GIMPLE_TRY_FINALLY. */ | |
549 | gcc_assert (gimple_try_kind (stmt) == GIMPLE_TRY_CATCH); | |
550 | ||
551 | lower_sequence (gimple_try_eval_ptr (stmt), data); | |
552 | cannot_fallthru = data->cannot_fallthru; | |
553 | ||
554 | i = gsi_start (*gimple_try_cleanup_ptr (stmt)); | |
555 | switch (gimple_code (gsi_stmt (i))) | |
556 | { | |
557 | case GIMPLE_CATCH: | |
558 | /* We expect to see a sequence of GIMPLE_CATCH stmts, each with a | |
559 | catch expression and a body. The whole try/catch may fall | |
560 | through iff any of the catch bodies falls through. */ | |
561 | for (; !gsi_end_p (i); gsi_next (&i)) | |
562 | { | |
563 | data->cannot_fallthru = false; | |
564 | lower_sequence (gimple_catch_handler_ptr (gsi_stmt (i)), data); | |
565 | if (!data->cannot_fallthru) | |
566 | cannot_fallthru = false; | |
567 | } | |
568 | break; | |
569 | ||
570 | case GIMPLE_EH_FILTER: | |
571 | /* The exception filter expression only matters if there is an | |
572 | exception. If the exception does not match EH_FILTER_TYPES, | |
573 | we will execute EH_FILTER_FAILURE, and we will fall through | |
574 | if that falls through. If the exception does match | |
575 | EH_FILTER_TYPES, the stack unwinder will continue up the | |
576 | stack, so we will not fall through. We don't know whether we | |
577 | will throw an exception which matches EH_FILTER_TYPES or not, | |
578 | so we just ignore EH_FILTER_TYPES and assume that we might | |
579 | throw an exception which doesn't match. */ | |
580 | data->cannot_fallthru = false; | |
581 | lower_sequence (gimple_eh_filter_failure_ptr (gsi_stmt (i)), data); | |
582 | if (!data->cannot_fallthru) | |
583 | cannot_fallthru = false; | |
584 | break; | |
585 | ||
586 | default: | |
587 | /* This case represents statements to be executed when an | |
588 | exception occurs. Those statements are implicitly followed | |
589 | by a GIMPLE_RESX to resume execution after the exception. So | |
590 | in this case the try/catch never falls through. */ | |
591 | data->cannot_fallthru = false; | |
592 | lower_sequence (gimple_try_cleanup_ptr (stmt), data); | |
593 | break; | |
594 | } | |
595 | ||
596 | data->cannot_fallthru = cannot_fallthru; | |
597 | gsi_next (gsi); | |
598 | } | |
599 | ||
93f29170 | 600 | /* Try to determine whether a TRY_CATCH expression can fall through. |
601 | This is a subroutine of block_may_fallthru. */ | |
602 | ||
603 | static bool | |
1f1872fd | 604 | try_catch_may_fallthru (const_tree stmt) |
93f29170 | 605 | { |
606 | tree_stmt_iterator i; | |
607 | ||
608 | /* If the TRY block can fall through, the whole TRY_CATCH can | |
609 | fall through. */ | |
610 | if (block_may_fallthru (TREE_OPERAND (stmt, 0))) | |
611 | return true; | |
612 | ||
613 | i = tsi_start (TREE_OPERAND (stmt, 1)); | |
614 | switch (TREE_CODE (tsi_stmt (i))) | |
615 | { | |
616 | case CATCH_EXPR: | |
617 | /* We expect to see a sequence of CATCH_EXPR trees, each with a | |
618 | catch expression and a body. The whole TRY_CATCH may fall | |
619 | through iff any of the catch bodies falls through. */ | |
620 | for (; !tsi_end_p (i); tsi_next (&i)) | |
621 | { | |
622 | if (block_may_fallthru (CATCH_BODY (tsi_stmt (i)))) | |
623 | return true; | |
624 | } | |
625 | return false; | |
626 | ||
627 | case EH_FILTER_EXPR: | |
5cf68346 | 628 | /* The exception filter expression only matters if there is an |
629 | exception. If the exception does not match EH_FILTER_TYPES, | |
630 | we will execute EH_FILTER_FAILURE, and we will fall through | |
631 | if that falls through. If the exception does match | |
632 | EH_FILTER_TYPES, the stack unwinder will continue up the | |
633 | stack, so we will not fall through. We don't know whether we | |
634 | will throw an exception which matches EH_FILTER_TYPES or not, | |
635 | so we just ignore EH_FILTER_TYPES and assume that we might | |
636 | throw an exception which doesn't match. */ | |
637 | return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i))); | |
93f29170 | 638 | |
639 | default: | |
640 | /* This case represents statements to be executed when an | |
641 | exception occurs. Those statements are implicitly followed | |
e38def9c | 642 | by a RESX statement to resume execution after the exception. |
643 | So in this case the TRY_CATCH never falls through. */ | |
93f29170 | 644 | return false; |
645 | } | |
646 | } | |
647 | ||
75a70cf9 | 648 | |
649 | /* Same as above, but for a GIMPLE_TRY_CATCH. */ | |
650 | ||
651 | static bool | |
652 | gimple_try_catch_may_fallthru (gimple stmt) | |
653 | { | |
654 | gimple_stmt_iterator i; | |
655 | ||
656 | /* We don't handle GIMPLE_TRY_FINALLY. */ | |
657 | gcc_assert (gimple_try_kind (stmt) == GIMPLE_TRY_CATCH); | |
658 | ||
659 | /* If the TRY block can fall through, the whole TRY_CATCH can | |
660 | fall through. */ | |
661 | if (gimple_seq_may_fallthru (gimple_try_eval (stmt))) | |
662 | return true; | |
663 | ||
e3a19533 | 664 | i = gsi_start (*gimple_try_cleanup_ptr (stmt)); |
75a70cf9 | 665 | switch (gimple_code (gsi_stmt (i))) |
666 | { | |
667 | case GIMPLE_CATCH: | |
668 | /* We expect to see a sequence of GIMPLE_CATCH stmts, each with a | |
669 | catch expression and a body. The whole try/catch may fall | |
670 | through iff any of the catch bodies falls through. */ | |
671 | for (; !gsi_end_p (i); gsi_next (&i)) | |
672 | { | |
673 | if (gimple_seq_may_fallthru (gimple_catch_handler (gsi_stmt (i)))) | |
674 | return true; | |
675 | } | |
676 | return false; | |
677 | ||
678 | case GIMPLE_EH_FILTER: | |
679 | /* The exception filter expression only matters if there is an | |
680 | exception. If the exception does not match EH_FILTER_TYPES, | |
681 | we will execute EH_FILTER_FAILURE, and we will fall through | |
682 | if that falls through. If the exception does match | |
683 | EH_FILTER_TYPES, the stack unwinder will continue up the | |
684 | stack, so we will not fall through. We don't know whether we | |
685 | will throw an exception which matches EH_FILTER_TYPES or not, | |
686 | so we just ignore EH_FILTER_TYPES and assume that we might | |
687 | throw an exception which doesn't match. */ | |
688 | return gimple_seq_may_fallthru (gimple_eh_filter_failure (gsi_stmt (i))); | |
689 | ||
690 | default: | |
691 | /* This case represents statements to be executed when an | |
692 | exception occurs. Those statements are implicitly followed | |
693 | by a GIMPLE_RESX to resume execution after the exception. So | |
694 | in this case the try/catch never falls through. */ | |
695 | return false; | |
696 | } | |
697 | } | |
698 | ||
699 | ||
4ee9c684 | 700 | /* Try to determine if we can fall out of the bottom of BLOCK. This guess |
701 | need not be 100% accurate; simply be conservative and return true if we | |
702 | don't know. This is used only to avoid stupidly generating extra code. | |
703 | If we're wrong, we'll just delete the extra code later. */ | |
704 | ||
705 | bool | |
1f1872fd | 706 | block_may_fallthru (const_tree block) |
4ee9c684 | 707 | { |
5ca94202 | 708 | /* This CONST_CAST is okay because expr_last returns its argument |
ce4469fa | 709 | unmodified and we assign it to a const_tree. */ |
e47a6f81 | 710 | const_tree stmt = expr_last (CONST_CAST_TREE(block)); |
4ee9c684 | 711 | |
712 | switch (stmt ? TREE_CODE (stmt) : ERROR_MARK) | |
713 | { | |
714 | case GOTO_EXPR: | |
715 | case RETURN_EXPR: | |
48e1416a | 716 | /* Easy cases. If the last statement of the block implies |
4ee9c684 | 717 | control transfer, then we can't fall through. */ |
718 | return false; | |
719 | ||
7f0f308d | 720 | case SWITCH_EXPR: |
721 | /* If SWITCH_LABELS is set, this is lowered, and represents a | |
722 | branch to a selected label and hence can not fall through. | |
723 | Otherwise SWITCH_BODY is set, and the switch can fall | |
724 | through. */ | |
ec20cf72 | 725 | return SWITCH_LABELS (stmt) == NULL_TREE; |
7f0f308d | 726 | |
4ee9c684 | 727 | case COND_EXPR: |
728 | if (block_may_fallthru (COND_EXPR_THEN (stmt))) | |
729 | return true; | |
730 | return block_may_fallthru (COND_EXPR_ELSE (stmt)); | |
731 | ||
732 | case BIND_EXPR: | |
733 | return block_may_fallthru (BIND_EXPR_BODY (stmt)); | |
734 | ||
93f29170 | 735 | case TRY_CATCH_EXPR: |
736 | return try_catch_may_fallthru (stmt); | |
737 | ||
4ee9c684 | 738 | case TRY_FINALLY_EXPR: |
0ac5fbe2 | 739 | /* The finally clause is always executed after the try clause, |
740 | so if it does not fall through, then the try-finally will not | |
741 | fall through. Otherwise, if the try clause does not fall | |
742 | through, then when the finally clause falls through it will | |
743 | resume execution wherever the try clause was going. So the | |
744 | whole try-finally will only fall through if both the try | |
745 | clause and the finally clause fall through. */ | |
746 | return (block_may_fallthru (TREE_OPERAND (stmt, 0)) | |
747 | && block_may_fallthru (TREE_OPERAND (stmt, 1))); | |
4ee9c684 | 748 | |
75a70cf9 | 749 | case MODIFY_EXPR: |
750 | if (TREE_CODE (TREE_OPERAND (stmt, 1)) == CALL_EXPR) | |
751 | stmt = TREE_OPERAND (stmt, 1); | |
4ee9c684 | 752 | else |
753 | return true; | |
754 | /* FALLTHRU */ | |
755 | ||
756 | case CALL_EXPR: | |
757 | /* Functions that do not return do not fall through. */ | |
758 | return (call_expr_flags (stmt) & ECF_NORETURN) == 0; | |
48e1416a | 759 | |
17fd1194 | 760 | case CLEANUP_POINT_EXPR: |
761 | return block_may_fallthru (TREE_OPERAND (stmt, 0)); | |
4ee9c684 | 762 | |
6cb25bec | 763 | case TARGET_EXPR: |
764 | return block_may_fallthru (TREE_OPERAND (stmt, 1)); | |
765 | ||
766 | case ERROR_MARK: | |
4ee9c684 | 767 | return true; |
6cb25bec | 768 | |
769 | default: | |
770 | return lang_hooks.block_may_fallthru (stmt); | |
4ee9c684 | 771 | } |
772 | } | |
773 | ||
4ee9c684 | 774 | |
75a70cf9 | 775 | /* Try to determine if we can continue executing the statement |
776 | immediately following STMT. This guess need not be 100% accurate; | |
777 | simply be conservative and return true if we don't know. This is | |
778 | used only to avoid stupidly generating extra code. If we're wrong, | |
779 | we'll just delete the extra code later. */ | |
780 | ||
781 | bool | |
782 | gimple_stmt_may_fallthru (gimple stmt) | |
4ee9c684 | 783 | { |
75a70cf9 | 784 | if (!stmt) |
785 | return true; | |
4ee9c684 | 786 | |
75a70cf9 | 787 | switch (gimple_code (stmt)) |
788 | { | |
789 | case GIMPLE_GOTO: | |
790 | case GIMPLE_RETURN: | |
791 | case GIMPLE_RESX: | |
48e1416a | 792 | /* Easy cases. If the last statement of the seq implies |
75a70cf9 | 793 | control transfer, then we can't fall through. */ |
794 | return false; | |
4ee9c684 | 795 | |
75a70cf9 | 796 | case GIMPLE_SWITCH: |
a2159096 | 797 | /* Switch has already been lowered and represents a branch |
798 | to a selected label and hence can't fall through. */ | |
799 | return false; | |
4ee9c684 | 800 | |
75a70cf9 | 801 | case GIMPLE_COND: |
802 | /* GIMPLE_COND's are already lowered into a two-way branch. They | |
803 | can't fall through. */ | |
804 | return false; | |
4ee9c684 | 805 | |
75a70cf9 | 806 | case GIMPLE_BIND: |
807 | return gimple_seq_may_fallthru (gimple_bind_body (stmt)); | |
4ee9c684 | 808 | |
75a70cf9 | 809 | case GIMPLE_TRY: |
810 | if (gimple_try_kind (stmt) == GIMPLE_TRY_CATCH) | |
811 | return gimple_try_catch_may_fallthru (stmt); | |
4ee9c684 | 812 | |
75a70cf9 | 813 | /* It must be a GIMPLE_TRY_FINALLY. */ |
4ee9c684 | 814 | |
75a70cf9 | 815 | /* The finally clause is always executed after the try clause, |
816 | so if it does not fall through, then the try-finally will not | |
817 | fall through. Otherwise, if the try clause does not fall | |
818 | through, then when the finally clause falls through it will | |
819 | resume execution wherever the try clause was going. So the | |
820 | whole try-finally will only fall through if both the try | |
821 | clause and the finally clause fall through. */ | |
822 | return (gimple_seq_may_fallthru (gimple_try_eval (stmt)) | |
823 | && gimple_seq_may_fallthru (gimple_try_cleanup (stmt))); | |
824 | ||
4c0315d0 | 825 | case GIMPLE_EH_ELSE: |
826 | return (gimple_seq_may_fallthru (gimple_eh_else_n_body (stmt)) | |
827 | || gimple_seq_may_fallthru (gimple_eh_else_e_body (stmt))); | |
828 | ||
75a70cf9 | 829 | case GIMPLE_CALL: |
830 | /* Functions that do not return do not fall through. */ | |
831 | return (gimple_call_flags (stmt) & ECF_NORETURN) == 0; | |
a2159096 | 832 | |
75a70cf9 | 833 | default: |
834 | return true; | |
4ee9c684 | 835 | } |
75a70cf9 | 836 | } |
837 | ||
4ee9c684 | 838 | |
75a70cf9 | 839 | /* Same as gimple_stmt_may_fallthru, but for the gimple sequence SEQ. */ |
4ee9c684 | 840 | |
75a70cf9 | 841 | bool |
842 | gimple_seq_may_fallthru (gimple_seq seq) | |
843 | { | |
844 | return gimple_stmt_may_fallthru (gimple_seq_last_stmt (seq)); | |
4ee9c684 | 845 | } |
22e30d4e | 846 | |
75a70cf9 | 847 | |
848 | /* Lower a GIMPLE_RETURN GSI. DATA is passed through the recursion. */ | |
2c8a1497 | 849 | |
22e30d4e | 850 | static void |
75a70cf9 | 851 | lower_gimple_return (gimple_stmt_iterator *gsi, struct lower_data *data) |
22e30d4e | 852 | { |
75a70cf9 | 853 | gimple stmt = gsi_stmt (*gsi); |
854 | gimple t; | |
855 | int i; | |
856 | return_statements_t tmp_rs; | |
22e30d4e | 857 | |
6c6a0f2f | 858 | /* Match this up with an existing return statement that's been created. */ |
f1f41a6c | 859 | for (i = data->return_statements.length () - 1; |
75a70cf9 | 860 | i >= 0; i--) |
22e30d4e | 861 | { |
f1f41a6c | 862 | tmp_rs = data->return_statements[i]; |
6c6a0f2f | 863 | |
75a70cf9 | 864 | if (gimple_return_retval (stmt) == gimple_return_retval (tmp_rs.stmt)) |
417a43d7 | 865 | { |
866 | /* Remove the line number from the representative return statement. | |
867 | It now fills in for many such returns. Failure to remove this | |
868 | will result in incorrect results for coverage analysis. */ | |
869 | gimple_set_location (tmp_rs.stmt, UNKNOWN_LOCATION); | |
870 | ||
871 | goto found; | |
872 | } | |
22e30d4e | 873 | } |
874 | ||
6c6a0f2f | 875 | /* Not found. Create a new label and record the return statement. */ |
e60a6f7b | 876 | tmp_rs.label = create_artificial_label (cfun->function_end_locus); |
75a70cf9 | 877 | tmp_rs.stmt = stmt; |
f1f41a6c | 878 | data->return_statements.safe_push (tmp_rs); |
6c6a0f2f | 879 | |
880 | /* Generate a goto statement and remove the return statement. */ | |
881 | found: | |
28f9c1a1 | 882 | /* When not optimizing, make sure user returns are preserved. */ |
883 | if (!optimize && gimple_has_location (stmt)) | |
884 | DECL_ARTIFICIAL (tmp_rs.label) = 0; | |
75a70cf9 | 885 | t = gimple_build_goto (tmp_rs.label); |
886 | gimple_set_location (t, gimple_location (stmt)); | |
32dedf8f | 887 | gimple_set_block (t, gimple_block (stmt)); |
75a70cf9 | 888 | gsi_insert_before (gsi, t, GSI_SAME_STMT); |
889 | gsi_remove (gsi, false); | |
2c8a1497 | 890 | } |
891 | ||
a2159096 | 892 | /* Lower a __builtin_setjmp GSI. |
2c8a1497 | 893 | |
894 | __builtin_setjmp is passed a pointer to an array of five words (not | |
895 | all will be used on all machines). It operates similarly to the C | |
896 | library function of the same name, but is more efficient. | |
897 | ||
898 | It is lowered into 3 other builtins, namely __builtin_setjmp_setup, | |
899 | __builtin_setjmp_dispatcher and __builtin_setjmp_receiver, but with | |
900 | __builtin_setjmp_dispatcher shared among all the instances; that's | |
901 | why it is only emitted at the end by lower_function_body. | |
902 | ||
903 | After full lowering, the body of the function should look like: | |
904 | ||
905 | { | |
906 | void * setjmpvar.0; | |
907 | int D.1844; | |
908 | int D.2844; | |
909 | ||
910 | [...] | |
911 | ||
912 | __builtin_setjmp_setup (&buf, &<D1847>); | |
913 | D.1844 = 0; | |
914 | goto <D1846>; | |
915 | <D1847>:; | |
916 | __builtin_setjmp_receiver (&<D1847>); | |
917 | D.1844 = 1; | |
918 | <D1846>:; | |
919 | if (D.1844 == 0) goto <D1848>; else goto <D1849>; | |
920 | ||
921 | [...] | |
922 | ||
923 | __builtin_setjmp_setup (&buf, &<D2847>); | |
924 | D.2844 = 0; | |
925 | goto <D2846>; | |
926 | <D2847>:; | |
927 | __builtin_setjmp_receiver (&<D2847>); | |
928 | D.2844 = 1; | |
929 | <D2846>:; | |
930 | if (D.2844 == 0) goto <D2848>; else goto <D2849>; | |
931 | ||
932 | [...] | |
933 | ||
934 | <D3850>:; | |
935 | return; | |
936 | <D3853>: [non-local]; | |
937 | setjmpvar.0 = __builtin_setjmp_dispatcher (&<D3853>); | |
938 | goto setjmpvar.0; | |
939 | } | |
940 | ||
941 | The dispatcher block will be both the unique destination of all the | |
942 | abnormal call edges and the unique source of all the abnormal edges | |
943 | to the receivers, thus keeping the complexity explosion localized. */ | |
944 | ||
945 | static void | |
75a70cf9 | 946 | lower_builtin_setjmp (gimple_stmt_iterator *gsi) |
2c8a1497 | 947 | { |
75a70cf9 | 948 | gimple stmt = gsi_stmt (*gsi); |
e60a6f7b | 949 | location_t loc = gimple_location (stmt); |
950 | tree cont_label = create_artificial_label (loc); | |
951 | tree next_label = create_artificial_label (loc); | |
2c8a1497 | 952 | tree dest, t, arg; |
75a70cf9 | 953 | gimple g; |
2c8a1497 | 954 | |
955 | /* NEXT_LABEL is the label __builtin_longjmp will jump to. Its address is | |
956 | passed to both __builtin_setjmp_setup and __builtin_setjmp_receiver. */ | |
957 | FORCED_LABEL (next_label) = 1; | |
958 | ||
75a70cf9 | 959 | dest = gimple_call_lhs (stmt); |
2c8a1497 | 960 | |
961 | /* Build '__builtin_setjmp_setup (BUF, NEXT_LABEL)' and insert. */ | |
c2f47e15 | 962 | arg = build_addr (next_label, current_function_decl); |
b9a16870 | 963 | t = builtin_decl_implicit (BUILT_IN_SETJMP_SETUP); |
75a70cf9 | 964 | g = gimple_build_call (t, 2, gimple_call_arg (stmt, 0), arg); |
389dd41b | 965 | gimple_set_location (g, loc); |
32dedf8f | 966 | gimple_set_block (g, gimple_block (stmt)); |
75a70cf9 | 967 | gsi_insert_before (gsi, g, GSI_SAME_STMT); |
2c8a1497 | 968 | |
969 | /* Build 'DEST = 0' and insert. */ | |
970 | if (dest) | |
971 | { | |
385f3f36 | 972 | g = gimple_build_assign (dest, build_zero_cst (TREE_TYPE (dest))); |
389dd41b | 973 | gimple_set_location (g, loc); |
32dedf8f | 974 | gimple_set_block (g, gimple_block (stmt)); |
75a70cf9 | 975 | gsi_insert_before (gsi, g, GSI_SAME_STMT); |
2c8a1497 | 976 | } |
977 | ||
978 | /* Build 'goto CONT_LABEL' and insert. */ | |
75a70cf9 | 979 | g = gimple_build_goto (cont_label); |
b9c74b4d | 980 | gsi_insert_before (gsi, g, GSI_SAME_STMT); |
2c8a1497 | 981 | |
982 | /* Build 'NEXT_LABEL:' and insert. */ | |
75a70cf9 | 983 | g = gimple_build_label (next_label); |
984 | gsi_insert_before (gsi, g, GSI_SAME_STMT); | |
2c8a1497 | 985 | |
986 | /* Build '__builtin_setjmp_receiver (NEXT_LABEL)' and insert. */ | |
c2f47e15 | 987 | arg = build_addr (next_label, current_function_decl); |
b9a16870 | 988 | t = builtin_decl_implicit (BUILT_IN_SETJMP_RECEIVER); |
75a70cf9 | 989 | g = gimple_build_call (t, 1, arg); |
389dd41b | 990 | gimple_set_location (g, loc); |
32dedf8f | 991 | gimple_set_block (g, gimple_block (stmt)); |
75a70cf9 | 992 | gsi_insert_before (gsi, g, GSI_SAME_STMT); |
2c8a1497 | 993 | |
994 | /* Build 'DEST = 1' and insert. */ | |
995 | if (dest) | |
996 | { | |
389dd41b | 997 | g = gimple_build_assign (dest, fold_convert_loc (loc, TREE_TYPE (dest), |
998 | integer_one_node)); | |
999 | gimple_set_location (g, loc); | |
32dedf8f | 1000 | gimple_set_block (g, gimple_block (stmt)); |
75a70cf9 | 1001 | gsi_insert_before (gsi, g, GSI_SAME_STMT); |
2c8a1497 | 1002 | } |
1003 | ||
1004 | /* Build 'CONT_LABEL:' and insert. */ | |
75a70cf9 | 1005 | g = gimple_build_label (cont_label); |
1006 | gsi_insert_before (gsi, g, GSI_SAME_STMT); | |
2c8a1497 | 1007 | |
1008 | /* Remove the call to __builtin_setjmp. */ | |
75a70cf9 | 1009 | gsi_remove (gsi, false); |
22e30d4e | 1010 | } |
4ee9c684 | 1011 | \f |
1012 | ||
773c5ba7 | 1013 | /* Record the variables in VARS into function FN. */ |
4ee9c684 | 1014 | |
1015 | void | |
773c5ba7 | 1016 | record_vars_into (tree vars, tree fn) |
4ee9c684 | 1017 | { |
9078126c | 1018 | bool change_cfun = fn != current_function_decl; |
1019 | ||
1020 | if (change_cfun) | |
87d4aa85 | 1021 | push_cfun (DECL_STRUCT_FUNCTION (fn)); |
773c5ba7 | 1022 | |
1767a056 | 1023 | for (; vars; vars = DECL_CHAIN (vars)) |
4ee9c684 | 1024 | { |
1025 | tree var = vars; | |
1026 | ||
b3d24a23 | 1027 | /* BIND_EXPRs contains also function/type/constant declarations |
1028 | we don't need to care about. */ | |
1029 | if (TREE_CODE (var) != VAR_DECL) | |
1030 | continue; | |
773c5ba7 | 1031 | |
4ee9c684 | 1032 | /* Nothing to do in this case. */ |
1033 | if (DECL_EXTERNAL (var)) | |
1034 | continue; | |
4ee9c684 | 1035 | |
1036 | /* Record the variable. */ | |
2ab2ce89 | 1037 | add_local_decl (cfun, var); |
4ee9c684 | 1038 | } |
773c5ba7 | 1039 | |
9078126c | 1040 | if (change_cfun) |
87d4aa85 | 1041 | pop_cfun (); |
773c5ba7 | 1042 | } |
1043 | ||
1044 | ||
1045 | /* Record the variables in VARS into current_function_decl. */ | |
1046 | ||
1047 | void | |
1048 | record_vars (tree vars) | |
1049 | { | |
1050 | record_vars_into (vars, current_function_decl); | |
4ee9c684 | 1051 | } |