1 /* Nested function decomposition for GIMPLE.
2 Copyright (C) 2004-2022 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3, or (at your option)
11 GCC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
22 #include "coretypes.h"
30 #include "stringpool.h"
32 #include "fold-const.h"
33 #include "stor-layout.h"
35 #include "tree-inline.h"
37 #include "gimple-iterator.h"
38 #include "gimple-walk.h"
41 #include "langhooks.h"
42 #include "gimple-low.h"
43 #include "gomp-constants.h"
44 #include "diagnostic.h"
45 #include "alloc-pool.h"
46 #include "tree-nested.h"
47 #include "symbol-summary.h"
48 #include "symtab-thunks.h"
50 /* Summary of nested functions. */
51 static function_summary <nested_function_info *>
52 *nested_function_sum = NULL;
54 /* Return nested_function_info, if available. */
55 nested_function_info *
56 nested_function_info::get (cgraph_node *node)
58 if (!nested_function_sum)
60 return nested_function_sum->get (node);
63 /* Return nested_function_info possibly creating new one. */
64 nested_function_info *
65 nested_function_info::get_create (cgraph_node *node)
67 if (!nested_function_sum)
69 nested_function_sum = new function_summary <nested_function_info *>
71 nested_function_sum->disable_insertion_hook ();
73 return nested_function_sum->get_create (node);
76 /* cgraph_node is no longer nested function; update cgraph accordingly. */
78 unnest_function (cgraph_node *node)
80 nested_function_info *info = nested_function_info::get (node);
81 cgraph_node **node2 = &nested_function_info::get
82 (nested_function_origin (node))->nested;
84 gcc_checking_assert (info->origin);
85 while (*node2 != node)
86 node2 = &nested_function_info::get (*node2)->next_nested;
87 *node2 = info->next_nested;
88 info->next_nested = NULL;
90 nested_function_sum->remove (node);
93 /* Destructor: unlink function from nested function lists. */
94 nested_function_info::~nested_function_info ()
97 for (cgraph_node *n = nested; n; n = next)
99 nested_function_info *info = nested_function_info::get (n);
100 next = info->next_nested;
102 info->next_nested = NULL;
108 = &nested_function_info::get (origin)->nested;
110 nested_function_info *info;
111 while ((info = nested_function_info::get (*node2)) != this && info)
112 node2 = &info->next_nested;
113 *node2 = next_nested;
117 /* Free nested function info summaries. */
119 nested_function_info::release ()
121 if (nested_function_sum)
122 delete (nested_function_sum);
123 nested_function_sum = NULL;
126 /* If NODE is nested function, record it. */
128 maybe_record_nested_function (cgraph_node *node)
130 /* All nested functions gets lowered during the construction of symtab. */
131 if (symtab->state > CONSTRUCTION)
133 if (DECL_CONTEXT (node->decl)
134 && TREE_CODE (DECL_CONTEXT (node->decl)) == FUNCTION_DECL)
136 cgraph_node *origin = cgraph_node::get_create (DECL_CONTEXT (node->decl));
137 nested_function_info *info = nested_function_info::get_create (node);
138 nested_function_info *origin_info
139 = nested_function_info::get_create (origin);
141 info->origin = origin;
142 info->next_nested = origin_info->nested;
143 origin_info->nested = node;
147 /* The object of this pass is to lower the representation of a set of nested
148 functions in order to expose all of the gory details of the various
149 nonlocal references. We want to do this sooner rather than later, in
150 order to give us more freedom in emitting all of the functions in question.
152 Back in olden times, when gcc was young, we developed an insanely
153 complicated scheme whereby variables which were referenced nonlocally
154 were forced to live in the stack of the declaring function, and then
155 the nested functions magically discovered where these variables were
156 placed. In order for this scheme to function properly, it required
157 that the outer function be partially expanded, then we switch to
158 compiling the inner function, and once done with those we switch back
159 to compiling the outer function. Such delicate ordering requirements
160 makes it difficult to do whole translation unit optimizations
161 involving such functions.
163 The implementation here is much more direct. Everything that can be
164 referenced by an inner function is a member of an explicitly created
165 structure herein called the "nonlocal frame struct". The incoming
166 static chain for a nested function is a pointer to this struct in
167 the parent. In this way, we settle on known offsets from a known
168 base, and so are decoupled from the logic that places objects in the
169 function's stack frame. More importantly, we don't have to wait for
170 that to happen -- since the compilation of the inner function is no
171 longer tied to a real stack frame, the nonlocal frame struct can be
172 allocated anywhere. Which means that the outer function is now
175 Theory of operation here is very simple. Iterate over all the
176 statements in all the functions (depth first) several times,
177 allocating structures and fields on demand. In general we want to
178 examine inner functions first, so that we can avoid making changes
179 to outer functions which are unnecessary.
181 The order of the passes matters a bit, in that later passes will be
182 skipped if it is discovered that the functions don't actually interact
183 at all. That is, they're nested in the lexical sense but could have
184 been written as independent functions without change. */
189 struct nesting_info *outer;
190 struct nesting_info *inner;
191 struct nesting_info *next;
193 hash_map<tree, tree> *field_map;
194 hash_map<tree, tree> *var_map;
195 hash_set<tree *> *mem_refs;
196 bitmap suppress_expansion;
199 tree new_local_var_chain;
200 tree debug_var_chain;
208 bool any_parm_remapped;
209 bool any_tramp_created;
210 bool any_descr_created;
211 char static_chain_added;
215 /* Iterate over the nesting tree, starting with ROOT, depth first. */
217 static inline struct nesting_info *
218 iter_nestinfo_start (struct nesting_info *root)
225 static inline struct nesting_info *
226 iter_nestinfo_next (struct nesting_info *node)
229 return iter_nestinfo_start (node->next);
233 #define FOR_EACH_NEST_INFO(I, ROOT) \
234 for ((I) = iter_nestinfo_start (ROOT); (I); (I) = iter_nestinfo_next (I))
236 /* Obstack used for the bitmaps in the struct above. */
237 static struct bitmap_obstack nesting_info_bitmap_obstack;
240 /* We're working in so many different function contexts simultaneously,
241 that create_tmp_var is dangerous. Prevent mishap. */
242 #define create_tmp_var cant_use_create_tmp_var_here_dummy
244 /* Like create_tmp_var, except record the variable for registration at
245 the given nesting level. */
248 create_tmp_var_for (struct nesting_info *info, tree type, const char *prefix)
252 /* If the type is of variable size or a type which must be created by the
253 frontend, something is wrong. Note that we explicitly allow
254 incomplete types here, since we create them ourselves here. */
255 gcc_assert (!TREE_ADDRESSABLE (type));
256 gcc_assert (!TYPE_SIZE_UNIT (type)
257 || TREE_CODE (TYPE_SIZE_UNIT (type)) == INTEGER_CST);
259 tmp_var = create_tmp_var_raw (type, prefix);
260 DECL_CONTEXT (tmp_var) = info->context;
261 DECL_CHAIN (tmp_var) = info->new_local_var_chain;
262 DECL_SEEN_IN_BIND_EXPR_P (tmp_var) = 1;
264 info->new_local_var_chain = tmp_var;
269 /* Like build_simple_mem_ref, but set TREE_THIS_NOTRAP on the result. */
272 build_simple_mem_ref_notrap (tree ptr)
274 tree t = build_simple_mem_ref (ptr);
275 TREE_THIS_NOTRAP (t) = 1;
279 /* Take the address of EXP to be used within function CONTEXT.
280 Mark it for addressability as necessary. */
283 build_addr (tree exp)
285 mark_addressable (exp);
286 return build_fold_addr_expr (exp);
289 /* Insert FIELD into TYPE, sorted by alignment requirements. */
292 insert_field_into_struct (tree type, tree field)
296 DECL_CONTEXT (field) = type;
298 for (p = &TYPE_FIELDS (type); *p ; p = &DECL_CHAIN (*p))
299 if (DECL_ALIGN (field) >= DECL_ALIGN (*p))
302 DECL_CHAIN (field) = *p;
305 /* Set correct alignment for frame struct type. */
306 if (TYPE_ALIGN (type) < DECL_ALIGN (field))
307 SET_TYPE_ALIGN (type, DECL_ALIGN (field));
310 /* Build or return the RECORD_TYPE that describes the frame state that is
311 shared between INFO->CONTEXT and its nested functions. This record will
312 not be complete until finalize_nesting_tree; up until that point we'll
313 be adding fields as necessary.
315 We also build the DECL that represents this frame in the function. */
318 get_frame_type (struct nesting_info *info)
320 tree type = info->frame_type;
325 type = make_node (RECORD_TYPE);
327 name = concat ("FRAME.",
328 IDENTIFIER_POINTER (DECL_NAME (info->context)),
330 TYPE_NAME (type) = get_identifier (name);
333 info->frame_type = type;
335 /* Do not put info->frame_decl on info->new_local_var_chain,
336 so that we can declare it in the lexical blocks, which
337 makes sure virtual regs that end up appearing in its RTL
338 expression get substituted in instantiate_virtual_regs. */
339 info->frame_decl = create_tmp_var_raw (type, "FRAME");
340 DECL_CONTEXT (info->frame_decl) = info->context;
341 DECL_NONLOCAL_FRAME (info->frame_decl) = 1;
342 DECL_SEEN_IN_BIND_EXPR_P (info->frame_decl) = 1;
344 /* ??? Always make it addressable for now, since it is meant to
345 be pointed to by the static chain pointer. This pessimizes
346 when it turns out that no static chains are needed because
347 the nested functions referencing non-local variables are not
348 reachable, but the true pessimization is to create the non-
349 local frame structure in the first place. */
350 TREE_ADDRESSABLE (info->frame_decl) = 1;
356 /* Return true if DECL should be referenced by pointer in the non-local frame
360 use_pointer_in_frame (tree decl)
362 if (TREE_CODE (decl) == PARM_DECL)
364 /* It's illegal to copy TREE_ADDRESSABLE, impossible to copy variable-
365 sized DECLs, and inefficient to copy large aggregates. Don't bother
366 moving anything but scalar parameters. */
367 return AGGREGATE_TYPE_P (TREE_TYPE (decl));
371 /* Variable-sized DECLs can only come from OMP clauses at this point
372 since the gimplifier has already turned the regular variables into
373 pointers. Do the same as the gimplifier. */
374 return !DECL_SIZE (decl) || TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST;
378 /* Given DECL, a non-locally accessed variable, find or create a field
379 in the non-local frame structure for the given nesting context. */
382 lookup_field_for_decl (struct nesting_info *info, tree decl,
383 enum insert_option insert)
385 gcc_checking_assert (decl_function_context (decl) == info->context);
387 if (insert == NO_INSERT)
389 tree *slot = info->field_map->get (decl);
390 return slot ? *slot : NULL_TREE;
393 tree *slot = &info->field_map->get_or_insert (decl);
396 tree type = get_frame_type (info);
397 tree field = make_node (FIELD_DECL);
398 DECL_NAME (field) = DECL_NAME (decl);
400 if (use_pointer_in_frame (decl))
402 TREE_TYPE (field) = build_pointer_type (TREE_TYPE (decl));
403 SET_DECL_ALIGN (field, TYPE_ALIGN (TREE_TYPE (field)));
404 DECL_NONADDRESSABLE_P (field) = 1;
408 TREE_TYPE (field) = TREE_TYPE (decl);
409 DECL_SOURCE_LOCATION (field) = DECL_SOURCE_LOCATION (decl);
410 SET_DECL_ALIGN (field, DECL_ALIGN (decl));
411 DECL_USER_ALIGN (field) = DECL_USER_ALIGN (decl);
412 DECL_IGNORED_P (field) = DECL_IGNORED_P (decl);
413 DECL_NONADDRESSABLE_P (field) = !TREE_ADDRESSABLE (decl);
414 TREE_THIS_VOLATILE (field) = TREE_THIS_VOLATILE (decl);
415 copy_warning (field, decl);
417 /* Declare the transformation and adjust the original DECL. For a
418 variable or for a parameter when not optimizing, we make it point
419 to the field in the frame directly. For a parameter, we don't do
420 it when optimizing because the variable tracking pass will already
422 if (VAR_P (decl) || !optimize)
425 = build3 (COMPONENT_REF, TREE_TYPE (field), info->frame_decl,
428 /* If the next declaration is a PARM_DECL pointing to the DECL,
429 we need to adjust its VALUE_EXPR directly, since chains of
430 VALUE_EXPRs run afoul of garbage collection. This occurs
431 in Ada for Out parameters that aren't copied in. */
432 tree next = DECL_CHAIN (decl);
434 && TREE_CODE (next) == PARM_DECL
435 && DECL_HAS_VALUE_EXPR_P (next)
436 && DECL_VALUE_EXPR (next) == decl)
437 SET_DECL_VALUE_EXPR (next, x);
439 SET_DECL_VALUE_EXPR (decl, x);
440 DECL_HAS_VALUE_EXPR_P (decl) = 1;
444 insert_field_into_struct (type, field);
447 if (TREE_CODE (decl) == PARM_DECL)
448 info->any_parm_remapped = true;
454 /* Build or return the variable that holds the static chain within
455 INFO->CONTEXT. This variable may only be used within INFO->CONTEXT. */
458 get_chain_decl (struct nesting_info *info)
460 tree decl = info->chain_decl;
466 type = get_frame_type (info->outer);
467 type = build_pointer_type (type);
469 /* Note that this variable is *not* entered into any BIND_EXPR;
470 the construction of this variable is handled specially in
471 expand_function_start and initialize_inlined_parameters.
472 Note also that it's represented as a parameter. This is more
473 close to the truth, since the initial value does come from
475 decl = build_decl (DECL_SOURCE_LOCATION (info->context),
476 PARM_DECL, create_tmp_var_name ("CHAIN"), type);
477 DECL_ARTIFICIAL (decl) = 1;
478 DECL_IGNORED_P (decl) = 1;
479 TREE_USED (decl) = 1;
480 DECL_CONTEXT (decl) = info->context;
481 DECL_ARG_TYPE (decl) = type;
483 /* Tell tree-inline.cc that we never write to this variable, so
484 it can copy-prop the replacement value immediately. */
485 TREE_READONLY (decl) = 1;
487 info->chain_decl = decl;
490 && (dump_flags & TDF_DETAILS)
491 && !DECL_STATIC_CHAIN (info->context))
492 fprintf (dump_file, "Setting static-chain for %s\n",
493 lang_hooks.decl_printable_name (info->context, 2));
495 DECL_STATIC_CHAIN (info->context) = 1;
500 /* Build or return the field within the non-local frame state that holds
501 the static chain for INFO->CONTEXT. This is the way to walk back up
502 multiple nesting levels. */
505 get_chain_field (struct nesting_info *info)
507 tree field = info->chain_field;
511 tree type = build_pointer_type (get_frame_type (info->outer));
513 field = make_node (FIELD_DECL);
514 DECL_NAME (field) = get_identifier ("__chain");
515 TREE_TYPE (field) = type;
516 SET_DECL_ALIGN (field, TYPE_ALIGN (type));
517 DECL_NONADDRESSABLE_P (field) = 1;
519 insert_field_into_struct (get_frame_type (info), field);
521 info->chain_field = field;
524 && (dump_flags & TDF_DETAILS)
525 && !DECL_STATIC_CHAIN (info->context))
526 fprintf (dump_file, "Setting static-chain for %s\n",
527 lang_hooks.decl_printable_name (info->context, 2));
529 DECL_STATIC_CHAIN (info->context) = 1;
534 /* Initialize a new temporary with the GIMPLE_CALL STMT. */
537 init_tmp_var_with_call (struct nesting_info *info, gimple_stmt_iterator *gsi,
542 t = create_tmp_var_for (info, gimple_call_return_type (call), NULL);
543 gimple_call_set_lhs (call, t);
544 if (! gsi_end_p (*gsi))
545 gimple_set_location (call, gimple_location (gsi_stmt (*gsi)));
546 gsi_insert_before (gsi, call, GSI_SAME_STMT);
552 /* Copy EXP into a temporary. Allocate the temporary in the context of
553 INFO and insert the initialization statement before GSI. */
556 init_tmp_var (struct nesting_info *info, tree exp, gimple_stmt_iterator *gsi)
561 t = create_tmp_var_for (info, TREE_TYPE (exp), NULL);
562 stmt = gimple_build_assign (t, exp);
563 if (! gsi_end_p (*gsi))
564 gimple_set_location (stmt, gimple_location (gsi_stmt (*gsi)));
565 gsi_insert_before_without_update (gsi, stmt, GSI_SAME_STMT);
571 /* Similarly, but only do so to force EXP to satisfy is_gimple_val. */
574 gsi_gimplify_val (struct nesting_info *info, tree exp,
575 gimple_stmt_iterator *gsi)
577 if (is_gimple_val (exp))
580 return init_tmp_var (info, exp, gsi);
583 /* Similarly, but copy from the temporary and insert the statement
584 after the iterator. */
587 save_tmp_var (struct nesting_info *info, tree exp, gimple_stmt_iterator *gsi)
592 t = create_tmp_var_for (info, TREE_TYPE (exp), NULL);
593 stmt = gimple_build_assign (exp, t);
594 if (! gsi_end_p (*gsi))
595 gimple_set_location (stmt, gimple_location (gsi_stmt (*gsi)));
596 gsi_insert_after_without_update (gsi, stmt, GSI_SAME_STMT);
601 /* Build or return the type used to represent a nested function trampoline. */
603 static GTY(()) tree trampoline_type;
606 get_trampoline_type (struct nesting_info *info)
608 unsigned align, size;
612 return trampoline_type;
614 align = TRAMPOLINE_ALIGNMENT;
615 size = TRAMPOLINE_SIZE;
617 /* If we won't be able to guarantee alignment simply via TYPE_ALIGN,
618 then allocate extra space so that we can do dynamic alignment. */
619 if (align > STACK_BOUNDARY)
621 size += ((align/BITS_PER_UNIT) - 1) & -(STACK_BOUNDARY/BITS_PER_UNIT);
622 align = STACK_BOUNDARY;
625 t = build_index_type (size_int (size - 1));
626 t = build_array_type (char_type_node, t);
627 t = build_decl (DECL_SOURCE_LOCATION (info->context),
628 FIELD_DECL, get_identifier ("__data"), t);
629 SET_DECL_ALIGN (t, align);
630 DECL_USER_ALIGN (t) = 1;
632 trampoline_type = make_node (RECORD_TYPE);
633 TYPE_NAME (trampoline_type) = get_identifier ("__builtin_trampoline");
634 TYPE_FIELDS (trampoline_type) = t;
635 layout_type (trampoline_type);
636 DECL_CONTEXT (t) = trampoline_type;
638 return trampoline_type;
641 /* Build or return the type used to represent a nested function descriptor. */
643 static GTY(()) tree descriptor_type;
646 get_descriptor_type (struct nesting_info *info)
648 /* The base alignment is that of a function. */
649 const unsigned align = FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY);
653 return descriptor_type;
655 t = build_index_type (integer_one_node);
656 t = build_array_type (ptr_type_node, t);
657 t = build_decl (DECL_SOURCE_LOCATION (info->context),
658 FIELD_DECL, get_identifier ("__data"), t);
659 SET_DECL_ALIGN (t, MAX (TYPE_ALIGN (ptr_type_node), align));
660 DECL_USER_ALIGN (t) = 1;
662 descriptor_type = make_node (RECORD_TYPE);
663 TYPE_NAME (descriptor_type) = get_identifier ("__builtin_descriptor");
664 TYPE_FIELDS (descriptor_type) = t;
665 layout_type (descriptor_type);
666 DECL_CONTEXT (t) = descriptor_type;
668 return descriptor_type;
671 /* Given DECL, a nested function, find or create an element in the
672 var map for this function. */
675 lookup_element_for_decl (struct nesting_info *info, tree decl,
676 enum insert_option insert)
678 if (insert == NO_INSERT)
680 tree *slot = info->var_map->get (decl);
681 return slot ? *slot : NULL_TREE;
684 tree *slot = &info->var_map->get_or_insert (decl);
686 *slot = build_tree_list (NULL_TREE, NULL_TREE);
691 /* Given DECL, a nested function, create a field in the non-local
692 frame structure for this function. */
695 create_field_for_decl (struct nesting_info *info, tree decl, tree type)
697 tree field = make_node (FIELD_DECL);
698 DECL_NAME (field) = DECL_NAME (decl);
699 TREE_TYPE (field) = type;
700 TREE_ADDRESSABLE (field) = 1;
701 insert_field_into_struct (get_frame_type (info), field);
705 /* Given DECL, a nested function, find or create a field in the non-local
706 frame structure for a trampoline for this function. */
709 lookup_tramp_for_decl (struct nesting_info *info, tree decl,
710 enum insert_option insert)
714 elt = lookup_element_for_decl (info, decl, insert);
718 field = TREE_PURPOSE (elt);
720 if (!field && insert == INSERT)
722 field = create_field_for_decl (info, decl, get_trampoline_type (info));
723 TREE_PURPOSE (elt) = field;
724 info->any_tramp_created = true;
730 /* Given DECL, a nested function, find or create a field in the non-local
731 frame structure for a descriptor for this function. */
734 lookup_descr_for_decl (struct nesting_info *info, tree decl,
735 enum insert_option insert)
739 elt = lookup_element_for_decl (info, decl, insert);
743 field = TREE_VALUE (elt);
745 if (!field && insert == INSERT)
747 field = create_field_for_decl (info, decl, get_descriptor_type (info));
748 TREE_VALUE (elt) = field;
749 info->any_descr_created = true;
755 /* Build or return the field within the non-local frame state that holds
756 the non-local goto "jmp_buf". The buffer itself is maintained by the
757 rtl middle-end as dynamic stack space is allocated. */
760 get_nl_goto_field (struct nesting_info *info)
762 tree field = info->nl_goto_field;
768 /* For __builtin_nonlocal_goto, we need N words. The first is the
769 frame pointer, the rest is for the target's stack pointer save
770 area. The number of words is controlled by STACK_SAVEAREA_MODE;
771 not the best interface, but it'll do for now. */
772 if (Pmode == ptr_mode)
773 type = ptr_type_node;
775 type = lang_hooks.types.type_for_mode (Pmode, 1);
778 = as_a <scalar_int_mode> (STACK_SAVEAREA_MODE (SAVE_NONLOCAL));
779 size = GET_MODE_SIZE (mode);
780 size = size / GET_MODE_SIZE (Pmode);
783 type = build_array_type
784 (type, build_index_type (size_int (size)));
786 field = make_node (FIELD_DECL);
787 DECL_NAME (field) = get_identifier ("__nl_goto_buf");
788 TREE_TYPE (field) = type;
789 SET_DECL_ALIGN (field, TYPE_ALIGN (type));
790 TREE_ADDRESSABLE (field) = 1;
792 insert_field_into_struct (get_frame_type (info), field);
794 info->nl_goto_field = field;
800 /* Invoke CALLBACK on all statements of GIMPLE sequence *PSEQ. */
803 walk_body (walk_stmt_fn callback_stmt, walk_tree_fn callback_op,
804 struct nesting_info *info, gimple_seq *pseq)
806 struct walk_stmt_info wi;
808 memset (&wi, 0, sizeof (wi));
811 walk_gimple_seq_mod (pseq, callback_stmt, callback_op, &wi);
815 /* Invoke CALLBACK_STMT/CALLBACK_OP on all statements of INFO->CONTEXT. */
818 walk_function (walk_stmt_fn callback_stmt, walk_tree_fn callback_op,
819 struct nesting_info *info)
821 gimple_seq body = gimple_body (info->context);
822 walk_body (callback_stmt, callback_op, info, &body);
823 gimple_set_body (info->context, body);
826 /* Invoke CALLBACK on a GIMPLE_OMP_FOR's init, cond, incr and pre-body. */
829 walk_gimple_omp_for (gomp_for *for_stmt,
830 walk_stmt_fn callback_stmt, walk_tree_fn callback_op,
831 struct nesting_info *info)
833 struct walk_stmt_info wi;
838 walk_body (callback_stmt, callback_op, info, gimple_omp_for_pre_body_ptr (for_stmt));
841 memset (&wi, 0, sizeof (wi));
843 wi.gsi = gsi_last (seq);
845 for (i = 0; i < gimple_omp_for_collapse (for_stmt); i++)
848 walk_tree (gimple_omp_for_index_ptr (for_stmt, i), callback_op,
852 walk_tree (gimple_omp_for_initial_ptr (for_stmt, i), callback_op,
857 walk_tree (gimple_omp_for_final_ptr (for_stmt, i), callback_op,
860 t = gimple_omp_for_incr (for_stmt, i);
861 gcc_assert (BINARY_CLASS_P (t));
863 walk_tree (&TREE_OPERAND (t, 0), callback_op, &wi, NULL);
866 walk_tree (&TREE_OPERAND (t, 1), callback_op, &wi, NULL);
869 seq = gsi_seq (wi.gsi);
870 if (!gimple_seq_empty_p (seq))
872 gimple_seq pre_body = gimple_omp_for_pre_body (for_stmt);
873 annotate_all_with_location (seq, gimple_location (for_stmt));
874 gimple_seq_add_seq (&pre_body, seq);
875 gimple_omp_for_set_pre_body (for_stmt, pre_body);
879 /* Similarly for ROOT and all functions nested underneath, depth first. */
882 walk_all_functions (walk_stmt_fn callback_stmt, walk_tree_fn callback_op,
883 struct nesting_info *root)
885 struct nesting_info *n;
886 FOR_EACH_NEST_INFO (n, root)
887 walk_function (callback_stmt, callback_op, n);
891 /* We have to check for a fairly pathological case. The operands of function
892 nested function are to be interpreted in the context of the enclosing
893 function. So if any are variably-sized, they will get remapped when the
894 enclosing function is inlined. But that remapping would also have to be
895 done in the types of the PARM_DECLs of the nested function, meaning the
896 argument types of that function will disagree with the arguments in the
897 calls to that function. So we'd either have to make a copy of the nested
898 function corresponding to each time the enclosing function was inlined or
899 add a VIEW_CONVERT_EXPR to each such operand for each call to the nested
900 function. The former is not practical. The latter would still require
901 detecting this case to know when to add the conversions. So, for now at
902 least, we don't inline such an enclosing function.
904 We have to do that check recursively, so here return indicating whether
905 FNDECL has such a nested function. ORIG_FN is the function we were
906 trying to inline to use for checking whether any argument is variably
907 modified by anything in it.
909 It would be better to do this in tree-inline.cc so that we could give
910 the appropriate warning for why a function can't be inlined, but that's
911 too late since the nesting structure has already been flattened and
912 adding a flag just to record this fact seems a waste of a flag. */
915 check_for_nested_with_variably_modified (tree fndecl, tree orig_fndecl)
917 struct cgraph_node *cgn = cgraph_node::get (fndecl);
920 for (cgn = first_nested_function (cgn); cgn;
921 cgn = next_nested_function (cgn))
923 for (arg = DECL_ARGUMENTS (cgn->decl); arg; arg = DECL_CHAIN (arg))
924 if (variably_modified_type_p (TREE_TYPE (arg), orig_fndecl))
927 if (check_for_nested_with_variably_modified (cgn->decl,
935 /* Construct our local datastructure describing the function nesting
936 tree rooted by CGN. */
938 static struct nesting_info *
939 create_nesting_tree (struct cgraph_node *cgn)
941 struct nesting_info *info = XCNEW (struct nesting_info);
942 info->field_map = new hash_map<tree, tree>;
943 info->var_map = new hash_map<tree, tree>;
944 info->mem_refs = new hash_set<tree *>;
945 info->suppress_expansion = BITMAP_ALLOC (&nesting_info_bitmap_obstack);
946 info->context = cgn->decl;
947 info->thunk_p = cgn->thunk;
949 for (cgn = first_nested_function (cgn); cgn;
950 cgn = next_nested_function (cgn))
952 struct nesting_info *sub = create_nesting_tree (cgn);
954 sub->next = info->inner;
958 /* See discussion at check_for_nested_with_variably_modified for a
959 discussion of why this has to be here. */
960 if (check_for_nested_with_variably_modified (info->context, info->context))
961 DECL_UNINLINABLE (info->context) = true;
966 /* Return an expression computing the static chain for TARGET_CONTEXT
967 from INFO->CONTEXT. Insert any necessary computations before TSI. */
970 get_static_chain (struct nesting_info *info, tree target_context,
971 gimple_stmt_iterator *gsi)
973 struct nesting_info *i;
976 if (info->context == target_context)
978 x = build_addr (info->frame_decl);
979 info->static_chain_added |= 1;
983 x = get_chain_decl (info);
984 info->static_chain_added |= 2;
986 for (i = info->outer; i->context != target_context; i = i->outer)
988 tree field = get_chain_field (i);
990 x = build_simple_mem_ref_notrap (x);
991 x = build3 (COMPONENT_REF, TREE_TYPE (field), x, field, NULL_TREE);
992 x = init_tmp_var (info, x, gsi);
1000 /* Return an expression referencing FIELD from TARGET_CONTEXT's non-local
1001 frame as seen from INFO->CONTEXT. Insert any necessary computations
1005 get_frame_field (struct nesting_info *info, tree target_context,
1006 tree field, gimple_stmt_iterator *gsi)
1008 struct nesting_info *i;
1011 if (info->context == target_context)
1013 /* Make sure frame_decl gets created. */
1014 (void) get_frame_type (info);
1015 x = info->frame_decl;
1016 info->static_chain_added |= 1;
1020 x = get_chain_decl (info);
1021 info->static_chain_added |= 2;
1023 for (i = info->outer; i->context != target_context; i = i->outer)
1025 tree field = get_chain_field (i);
1027 x = build_simple_mem_ref_notrap (x);
1028 x = build3 (COMPONENT_REF, TREE_TYPE (field), x, field, NULL_TREE);
1029 x = init_tmp_var (info, x, gsi);
1032 x = build_simple_mem_ref_notrap (x);
1035 x = build3 (COMPONENT_REF, TREE_TYPE (field), x, field, NULL_TREE);
1036 TREE_THIS_VOLATILE (x) = TREE_THIS_VOLATILE (field);
1040 static void note_nonlocal_vla_type (struct nesting_info *info, tree type);
1042 /* A subroutine of convert_nonlocal_reference_op. Create a local variable
1043 in the nested function with DECL_VALUE_EXPR set to reference the true
1044 variable in the parent function. This is used both for debug info
1045 and in OMP lowering. */
1048 get_nonlocal_debug_decl (struct nesting_info *info, tree decl)
1050 tree target_context;
1051 struct nesting_info *i;
1052 tree x, field, new_decl;
1054 tree *slot = &info->var_map->get_or_insert (decl);
1059 target_context = decl_function_context (decl);
1061 /* A copy of the code in get_frame_field, but without the temporaries. */
1062 if (info->context == target_context)
1064 /* Make sure frame_decl gets created. */
1065 (void) get_frame_type (info);
1066 x = info->frame_decl;
1068 info->static_chain_added |= 1;
1072 x = get_chain_decl (info);
1073 info->static_chain_added |= 2;
1074 for (i = info->outer; i->context != target_context; i = i->outer)
1076 field = get_chain_field (i);
1077 x = build_simple_mem_ref_notrap (x);
1078 x = build3 (COMPONENT_REF, TREE_TYPE (field), x, field, NULL_TREE);
1080 x = build_simple_mem_ref_notrap (x);
1083 field = lookup_field_for_decl (i, decl, INSERT);
1084 x = build3 (COMPONENT_REF, TREE_TYPE (field), x, field, NULL_TREE);
1085 if (use_pointer_in_frame (decl))
1086 x = build_simple_mem_ref_notrap (x);
1088 /* ??? We should be remapping types as well, surely. */
1089 new_decl = build_decl (DECL_SOURCE_LOCATION (decl),
1090 VAR_DECL, DECL_NAME (decl), TREE_TYPE (decl));
1091 DECL_CONTEXT (new_decl) = info->context;
1092 DECL_ARTIFICIAL (new_decl) = DECL_ARTIFICIAL (decl);
1093 DECL_IGNORED_P (new_decl) = DECL_IGNORED_P (decl);
1094 TREE_THIS_VOLATILE (new_decl) = TREE_THIS_VOLATILE (decl);
1095 TREE_SIDE_EFFECTS (new_decl) = TREE_SIDE_EFFECTS (decl);
1096 TREE_READONLY (new_decl) = TREE_READONLY (decl);
1097 TREE_ADDRESSABLE (new_decl) = TREE_ADDRESSABLE (decl);
1098 DECL_SEEN_IN_BIND_EXPR_P (new_decl) = 1;
1099 if ((TREE_CODE (decl) == PARM_DECL
1100 || TREE_CODE (decl) == RESULT_DECL
1102 && DECL_BY_REFERENCE (decl))
1103 DECL_BY_REFERENCE (new_decl) = 1;
1105 SET_DECL_VALUE_EXPR (new_decl, x);
1106 DECL_HAS_VALUE_EXPR_P (new_decl) = 1;
1109 DECL_CHAIN (new_decl) = info->debug_var_chain;
1110 info->debug_var_chain = new_decl;
1113 && info->context != target_context
1114 && variably_modified_type_p (TREE_TYPE (decl), NULL))
1115 note_nonlocal_vla_type (info, TREE_TYPE (decl));
1121 /* Callback for walk_gimple_stmt, rewrite all references to VAR
1122 and PARM_DECLs that belong to outer functions.
1124 The rewrite will involve some number of structure accesses back up
1125 the static chain. E.g. for a variable FOO up one nesting level it'll
1126 be CHAIN->FOO. For two levels it'll be CHAIN->__chain->FOO. Further
1127 indirections apply to decls for which use_pointer_in_frame is true. */
1130 convert_nonlocal_reference_op (tree *tp, int *walk_subtrees, void *data)
1132 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
1133 struct nesting_info *const info = (struct nesting_info *) wi->info;
1137 switch (TREE_CODE (t))
1140 /* Non-automatic variables are never processed. */
1141 if (TREE_STATIC (t) || DECL_EXTERNAL (t))
1147 tree x, target_context = decl_function_context (t);
1149 if (info->context == target_context)
1154 if (bitmap_bit_p (info->suppress_expansion, DECL_UID (t)))
1155 x = get_nonlocal_debug_decl (info, t);
1158 struct nesting_info *i = info;
1159 while (i && i->context != target_context)
1161 /* If none of the outer contexts is the target context, this means
1162 that the VAR or PARM_DECL is referenced in a wrong context. */
1164 internal_error ("%s from %s referenced in %s",
1165 IDENTIFIER_POINTER (DECL_NAME (t)),
1166 IDENTIFIER_POINTER (DECL_NAME (target_context)),
1167 IDENTIFIER_POINTER (DECL_NAME (info->context)));
1169 x = lookup_field_for_decl (i, t, INSERT);
1170 x = get_frame_field (info, target_context, x, &wi->gsi);
1171 if (use_pointer_in_frame (t))
1173 x = init_tmp_var (info, x, &wi->gsi);
1174 x = build_simple_mem_ref_notrap (x);
1181 x = save_tmp_var (info, x, &wi->gsi);
1183 x = init_tmp_var (info, x, &wi->gsi);
1191 /* We're taking the address of a label from a parent function, but
1192 this is not itself a non-local goto. Mark the label such that it
1193 will not be deleted, much as we would with a label address in
1195 if (decl_function_context (t) != info->context)
1196 FORCED_LABEL (t) = 1;
1201 bool save_val_only = wi->val_only;
1203 wi->val_only = false;
1205 wi->changed = false;
1206 walk_tree (&TREE_OPERAND (t, 0), convert_nonlocal_reference_op, wi, 0);
1207 wi->val_only = true;
1213 /* If we changed anything, we might no longer be directly
1214 referencing a decl. */
1215 save_context = current_function_decl;
1216 current_function_decl = info->context;
1217 recompute_tree_invariant_for_addr_expr (t);
1219 /* If the callback converted the address argument in a context
1220 where we only accept variables (and min_invariant, presumably),
1221 then compute the address into a temporary. */
1223 *tp = gsi_gimplify_val ((struct nesting_info *) wi->info,
1225 current_function_decl = save_context;
1234 case ARRAY_RANGE_REF:
1236 /* Go down this entire nest and just look at the final prefix and
1237 anything that describes the references. Otherwise, we lose track
1238 of whether a NOP_EXPR or VIEW_CONVERT_EXPR needs a simple value. */
1239 wi->val_only = true;
1241 for (; handled_component_p (t); tp = &TREE_OPERAND (t, 0), t = *tp)
1243 if (TREE_CODE (t) == COMPONENT_REF)
1244 walk_tree (&TREE_OPERAND (t, 2), convert_nonlocal_reference_op, wi,
1246 else if (TREE_CODE (t) == ARRAY_REF
1247 || TREE_CODE (t) == ARRAY_RANGE_REF)
1249 walk_tree (&TREE_OPERAND (t, 1), convert_nonlocal_reference_op,
1251 walk_tree (&TREE_OPERAND (t, 2), convert_nonlocal_reference_op,
1253 walk_tree (&TREE_OPERAND (t, 3), convert_nonlocal_reference_op,
1257 wi->val_only = false;
1258 walk_tree (tp, convert_nonlocal_reference_op, wi, NULL);
1261 case VIEW_CONVERT_EXPR:
1262 /* Just request to look at the subtrees, leaving val_only and lhs
1263 untouched. This might actually be for !val_only + lhs, in which
1264 case we don't want to force a replacement by a temporary. */
1269 if (!IS_TYPE_OR_DECL_P (t))
1272 wi->val_only = true;
1281 static tree convert_nonlocal_reference_stmt (gimple_stmt_iterator *, bool *,
1282 struct walk_stmt_info *);
1284 /* Helper for convert_nonlocal_references, rewrite all references to VAR
1285 and PARM_DECLs that belong to outer functions. */
1288 convert_nonlocal_omp_clauses (tree *pclauses, struct walk_stmt_info *wi)
1290 struct nesting_info *const info = (struct nesting_info *) wi->info;
1291 bool need_chain = false, need_stmts = false;
1292 tree clause, decl, *pdecl;
1294 bitmap new_suppress;
1296 new_suppress = BITMAP_GGC_ALLOC ();
1297 bitmap_copy (new_suppress, info->suppress_expansion);
1299 for (clause = *pclauses; clause ; clause = OMP_CLAUSE_CHAIN (clause))
1302 switch (OMP_CLAUSE_CODE (clause))
1304 case OMP_CLAUSE_REDUCTION:
1305 case OMP_CLAUSE_IN_REDUCTION:
1306 case OMP_CLAUSE_TASK_REDUCTION:
1307 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (clause))
1309 if (TREE_CODE (OMP_CLAUSE_DECL (clause)) == MEM_REF)
1311 pdecl = &TREE_OPERAND (OMP_CLAUSE_DECL (clause), 0);
1312 if (TREE_CODE (*pdecl) == POINTER_PLUS_EXPR)
1313 pdecl = &TREE_OPERAND (*pdecl, 0);
1314 if (TREE_CODE (*pdecl) == INDIRECT_REF
1315 || TREE_CODE (*pdecl) == ADDR_EXPR)
1316 pdecl = &TREE_OPERAND (*pdecl, 0);
1318 goto do_decl_clause;
1320 case OMP_CLAUSE_LASTPRIVATE:
1321 if (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (clause))
1323 goto do_decl_clause;
1325 case OMP_CLAUSE_LINEAR:
1326 if (OMP_CLAUSE_LINEAR_GIMPLE_SEQ (clause))
1328 wi->val_only = true;
1330 convert_nonlocal_reference_op (&OMP_CLAUSE_LINEAR_STEP (clause),
1332 goto do_decl_clause;
1334 case OMP_CLAUSE_PRIVATE:
1335 case OMP_CLAUSE_FIRSTPRIVATE:
1336 case OMP_CLAUSE_COPYPRIVATE:
1337 case OMP_CLAUSE_SHARED:
1338 case OMP_CLAUSE_ENTER:
1339 case OMP_CLAUSE_LINK:
1340 case OMP_CLAUSE_USE_DEVICE_PTR:
1341 case OMP_CLAUSE_USE_DEVICE_ADDR:
1342 case OMP_CLAUSE_HAS_DEVICE_ADDR:
1343 case OMP_CLAUSE_IS_DEVICE_PTR:
1344 case OMP_CLAUSE_DETACH:
1347 pdecl = &OMP_CLAUSE_DECL (clause);
1350 && (TREE_STATIC (decl) || DECL_EXTERNAL (decl)))
1352 if (decl_function_context (decl) != info->context)
1354 if (OMP_CLAUSE_CODE (clause) == OMP_CLAUSE_SHARED)
1355 OMP_CLAUSE_SHARED_READONLY (clause) = 0;
1356 bitmap_set_bit (new_suppress, DECL_UID (decl));
1357 *pdecl = get_nonlocal_debug_decl (info, decl);
1358 if (OMP_CLAUSE_CODE (clause) != OMP_CLAUSE_PRIVATE)
1363 case OMP_CLAUSE_SCHEDULE:
1364 if (OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (clause) == NULL)
1367 case OMP_CLAUSE_FINAL:
1369 case OMP_CLAUSE_NUM_THREADS:
1370 case OMP_CLAUSE_DEPEND:
1371 case OMP_CLAUSE_DOACROSS:
1372 case OMP_CLAUSE_DEVICE:
1373 case OMP_CLAUSE_NUM_TEAMS:
1374 case OMP_CLAUSE_THREAD_LIMIT:
1375 case OMP_CLAUSE_SAFELEN:
1376 case OMP_CLAUSE_SIMDLEN:
1377 case OMP_CLAUSE_PRIORITY:
1378 case OMP_CLAUSE_GRAINSIZE:
1379 case OMP_CLAUSE_NUM_TASKS:
1380 case OMP_CLAUSE_HINT:
1381 case OMP_CLAUSE_FILTER:
1382 case OMP_CLAUSE_NUM_GANGS:
1383 case OMP_CLAUSE_NUM_WORKERS:
1384 case OMP_CLAUSE_VECTOR_LENGTH:
1385 case OMP_CLAUSE_GANG:
1386 case OMP_CLAUSE_WORKER:
1387 case OMP_CLAUSE_VECTOR:
1388 case OMP_CLAUSE_ASYNC:
1389 case OMP_CLAUSE_WAIT:
1390 /* Several OpenACC clauses have optional arguments. Check if they
1392 if (OMP_CLAUSE_OPERAND (clause, 0))
1394 wi->val_only = true;
1396 convert_nonlocal_reference_op (&OMP_CLAUSE_OPERAND (clause, 0),
1400 /* The gang clause accepts two arguments. */
1401 if (OMP_CLAUSE_CODE (clause) == OMP_CLAUSE_GANG
1402 && OMP_CLAUSE_GANG_STATIC_EXPR (clause))
1404 wi->val_only = true;
1406 convert_nonlocal_reference_op
1407 (&OMP_CLAUSE_GANG_STATIC_EXPR (clause), &dummy, wi);
1411 case OMP_CLAUSE_DIST_SCHEDULE:
1412 if (OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (clause) != NULL)
1414 wi->val_only = true;
1416 convert_nonlocal_reference_op (&OMP_CLAUSE_OPERAND (clause, 0),
1421 case OMP_CLAUSE_MAP:
1423 case OMP_CLAUSE_FROM:
1424 if (OMP_CLAUSE_SIZE (clause))
1426 wi->val_only = true;
1428 convert_nonlocal_reference_op (&OMP_CLAUSE_SIZE (clause),
1431 if (DECL_P (OMP_CLAUSE_DECL (clause)))
1432 goto do_decl_clause;
1433 wi->val_only = true;
1435 walk_tree (&OMP_CLAUSE_DECL (clause), convert_nonlocal_reference_op,
1439 case OMP_CLAUSE_ALIGNED:
1440 if (OMP_CLAUSE_ALIGNED_ALIGNMENT (clause))
1442 wi->val_only = true;
1444 convert_nonlocal_reference_op
1445 (&OMP_CLAUSE_ALIGNED_ALIGNMENT (clause), &dummy, wi);
1448 case OMP_CLAUSE_NONTEMPORAL:
1449 do_decl_clause_no_supp:
1450 /* Like do_decl_clause, but don't add any suppression. */
1451 decl = OMP_CLAUSE_DECL (clause);
1453 && (TREE_STATIC (decl) || DECL_EXTERNAL (decl)))
1455 if (decl_function_context (decl) != info->context)
1457 OMP_CLAUSE_DECL (clause) = get_nonlocal_debug_decl (info, decl);
1462 case OMP_CLAUSE_ALLOCATE:
1463 if (OMP_CLAUSE_ALLOCATE_ALLOCATOR (clause))
1465 wi->val_only = true;
1467 convert_nonlocal_reference_op
1468 (&OMP_CLAUSE_ALLOCATE_ALLOCATOR (clause), &dummy, wi);
1470 goto do_decl_clause_no_supp;
1472 case OMP_CLAUSE_NOWAIT:
1473 case OMP_CLAUSE_ORDERED:
1474 case OMP_CLAUSE_DEFAULT:
1475 case OMP_CLAUSE_COPYIN:
1476 case OMP_CLAUSE_COLLAPSE:
1477 case OMP_CLAUSE_TILE:
1478 case OMP_CLAUSE_UNTIED:
1479 case OMP_CLAUSE_MERGEABLE:
1480 case OMP_CLAUSE_PROC_BIND:
1481 case OMP_CLAUSE_NOGROUP:
1482 case OMP_CLAUSE_THREADS:
1483 case OMP_CLAUSE_SIMD:
1484 case OMP_CLAUSE_DEFAULTMAP:
1485 case OMP_CLAUSE_ORDER:
1486 case OMP_CLAUSE_SEQ:
1487 case OMP_CLAUSE_INDEPENDENT:
1488 case OMP_CLAUSE_AUTO:
1489 case OMP_CLAUSE_IF_PRESENT:
1490 case OMP_CLAUSE_FINALIZE:
1491 case OMP_CLAUSE_BIND:
1492 case OMP_CLAUSE__CONDTEMP_:
1493 case OMP_CLAUSE__SCANTEMP_:
1496 /* The following clause belongs to the OpenACC cache directive, which
1497 is discarded during gimplification. */
1498 case OMP_CLAUSE__CACHE_:
1499 /* The following clauses are only allowed in the OpenMP declare simd
1500 directive, so not seen here. */
1501 case OMP_CLAUSE_UNIFORM:
1502 case OMP_CLAUSE_INBRANCH:
1503 case OMP_CLAUSE_NOTINBRANCH:
1504 /* The following clauses are only allowed on OpenMP cancel and
1505 cancellation point directives, which at this point have already
1506 been lowered into a function call. */
1507 case OMP_CLAUSE_FOR:
1508 case OMP_CLAUSE_PARALLEL:
1509 case OMP_CLAUSE_SECTIONS:
1510 case OMP_CLAUSE_TASKGROUP:
1511 /* The following clauses are only added during OMP lowering; nested
1512 function decomposition happens before that. */
1513 case OMP_CLAUSE__LOOPTEMP_:
1514 case OMP_CLAUSE__REDUCTEMP_:
1515 case OMP_CLAUSE__SIMDUID_:
1516 case OMP_CLAUSE__SIMT_:
1517 /* The following clauses are only allowed on OpenACC 'routine'
1518 directives, not seen here. */
1519 case OMP_CLAUSE_NOHOST:
1520 /* Anything else. */
1526 info->suppress_expansion = new_suppress;
1529 for (clause = *pclauses; clause ; clause = OMP_CLAUSE_CHAIN (clause))
1530 switch (OMP_CLAUSE_CODE (clause))
1532 case OMP_CLAUSE_REDUCTION:
1533 case OMP_CLAUSE_IN_REDUCTION:
1534 case OMP_CLAUSE_TASK_REDUCTION:
1535 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (clause))
1538 = DECL_CONTEXT (OMP_CLAUSE_REDUCTION_PLACEHOLDER (clause));
1539 DECL_CONTEXT (OMP_CLAUSE_REDUCTION_PLACEHOLDER (clause))
1541 if (OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (clause))
1542 DECL_CONTEXT (OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (clause))
1544 tree save_local_var_chain = info->new_local_var_chain;
1545 info->new_local_var_chain = NULL;
1546 gimple_seq *seq = &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (clause);
1547 walk_body (convert_nonlocal_reference_stmt,
1548 convert_nonlocal_reference_op, info, seq);
1549 if (info->new_local_var_chain)
1550 declare_vars (info->new_local_var_chain,
1551 gimple_seq_first_stmt (*seq), false);
1552 info->new_local_var_chain = NULL;
1553 seq = &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (clause);
1554 walk_body (convert_nonlocal_reference_stmt,
1555 convert_nonlocal_reference_op, info, seq);
1556 if (info->new_local_var_chain)
1557 declare_vars (info->new_local_var_chain,
1558 gimple_seq_first_stmt (*seq), false);
1559 info->new_local_var_chain = save_local_var_chain;
1560 DECL_CONTEXT (OMP_CLAUSE_REDUCTION_PLACEHOLDER (clause))
1562 if (OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (clause))
1563 DECL_CONTEXT (OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (clause))
1568 case OMP_CLAUSE_LASTPRIVATE:
1570 tree save_local_var_chain = info->new_local_var_chain;
1571 info->new_local_var_chain = NULL;
1572 gimple_seq *seq = &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (clause);
1573 walk_body (convert_nonlocal_reference_stmt,
1574 convert_nonlocal_reference_op, info, seq);
1575 if (info->new_local_var_chain)
1576 declare_vars (info->new_local_var_chain,
1577 gimple_seq_first_stmt (*seq), false);
1578 info->new_local_var_chain = save_local_var_chain;
1582 case OMP_CLAUSE_LINEAR:
1584 tree save_local_var_chain = info->new_local_var_chain;
1585 info->new_local_var_chain = NULL;
1586 gimple_seq *seq = &OMP_CLAUSE_LINEAR_GIMPLE_SEQ (clause);
1587 walk_body (convert_nonlocal_reference_stmt,
1588 convert_nonlocal_reference_op, info, seq);
1589 if (info->new_local_var_chain)
1590 declare_vars (info->new_local_var_chain,
1591 gimple_seq_first_stmt (*seq), false);
1592 info->new_local_var_chain = save_local_var_chain;
1603 /* Create nonlocal debug decls for nonlocal VLA array bounds. */
1606 note_nonlocal_vla_type (struct nesting_info *info, tree type)
1608 while (POINTER_TYPE_P (type) && !TYPE_NAME (type))
1609 type = TREE_TYPE (type);
1611 if (TYPE_NAME (type)
1612 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
1613 && DECL_ORIGINAL_TYPE (TYPE_NAME (type)))
1614 type = DECL_ORIGINAL_TYPE (TYPE_NAME (type));
1616 while (POINTER_TYPE_P (type)
1617 || TREE_CODE (type) == VECTOR_TYPE
1618 || TREE_CODE (type) == FUNCTION_TYPE
1619 || TREE_CODE (type) == METHOD_TYPE)
1620 type = TREE_TYPE (type);
1622 if (TREE_CODE (type) == ARRAY_TYPE)
1626 note_nonlocal_vla_type (info, TREE_TYPE (type));
1627 domain = TYPE_DOMAIN (type);
1630 t = TYPE_MIN_VALUE (domain);
1631 if (t && (VAR_P (t) || TREE_CODE (t) == PARM_DECL)
1632 && decl_function_context (t) != info->context)
1633 get_nonlocal_debug_decl (info, t);
1634 t = TYPE_MAX_VALUE (domain);
1635 if (t && (VAR_P (t) || TREE_CODE (t) == PARM_DECL)
1636 && decl_function_context (t) != info->context)
1637 get_nonlocal_debug_decl (info, t);
1642 /* Callback for walk_gimple_stmt. Rewrite all references to VAR and
1643 PARM_DECLs that belong to outer functions. This handles statements
1644 that are not handled via the standard recursion done in
1645 walk_gimple_stmt. STMT is the statement to examine, DATA is as in
1646 convert_nonlocal_reference_op. Set *HANDLED_OPS_P to true if all the
1647 operands of STMT have been handled by this function. */
1650 convert_nonlocal_reference_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
1651 struct walk_stmt_info *wi)
1653 struct nesting_info *info = (struct nesting_info *) wi->info;
1654 tree save_local_var_chain;
1655 bitmap save_suppress;
1656 gimple *stmt = gsi_stmt (*gsi);
1658 switch (gimple_code (stmt))
1661 /* Don't walk non-local gotos for now. */
1662 if (TREE_CODE (gimple_goto_dest (stmt)) != LABEL_DECL)
1664 wi->val_only = true;
1666 *handled_ops_p = false;
1671 case GIMPLE_OMP_TEAMS:
1672 if (!gimple_omp_teams_host (as_a <gomp_teams *> (stmt)))
1674 save_suppress = info->suppress_expansion;
1675 convert_nonlocal_omp_clauses (gimple_omp_teams_clauses_ptr (stmt),
1677 walk_body (convert_nonlocal_reference_stmt,
1678 convert_nonlocal_reference_op, info,
1679 gimple_omp_body_ptr (stmt));
1680 info->suppress_expansion = save_suppress;
1685 case GIMPLE_OMP_PARALLEL:
1686 case GIMPLE_OMP_TASK:
1687 save_suppress = info->suppress_expansion;
1688 if (convert_nonlocal_omp_clauses (gimple_omp_taskreg_clauses_ptr (stmt),
1692 decl = get_chain_decl (info);
1693 c = build_omp_clause (gimple_location (stmt),
1694 OMP_CLAUSE_FIRSTPRIVATE);
1695 OMP_CLAUSE_DECL (c) = decl;
1696 OMP_CLAUSE_CHAIN (c) = gimple_omp_taskreg_clauses (stmt);
1697 gimple_omp_taskreg_set_clauses (stmt, c);
1700 save_local_var_chain = info->new_local_var_chain;
1701 info->new_local_var_chain = NULL;
1703 walk_body (convert_nonlocal_reference_stmt, convert_nonlocal_reference_op,
1704 info, gimple_omp_body_ptr (stmt));
1706 if (info->new_local_var_chain)
1707 declare_vars (info->new_local_var_chain,
1708 gimple_seq_first_stmt (gimple_omp_body (stmt)),
1710 info->new_local_var_chain = save_local_var_chain;
1711 info->suppress_expansion = save_suppress;
1714 case GIMPLE_OMP_FOR:
1715 save_suppress = info->suppress_expansion;
1716 convert_nonlocal_omp_clauses (gimple_omp_for_clauses_ptr (stmt), wi);
1717 walk_gimple_omp_for (as_a <gomp_for *> (stmt),
1718 convert_nonlocal_reference_stmt,
1719 convert_nonlocal_reference_op, info);
1720 walk_body (convert_nonlocal_reference_stmt,
1721 convert_nonlocal_reference_op, info, gimple_omp_body_ptr (stmt));
1722 info->suppress_expansion = save_suppress;
1725 case GIMPLE_OMP_SECTIONS:
1726 save_suppress = info->suppress_expansion;
1727 convert_nonlocal_omp_clauses (gimple_omp_sections_clauses_ptr (stmt), wi);
1728 walk_body (convert_nonlocal_reference_stmt, convert_nonlocal_reference_op,
1729 info, gimple_omp_body_ptr (stmt));
1730 info->suppress_expansion = save_suppress;
1733 case GIMPLE_OMP_SINGLE:
1734 save_suppress = info->suppress_expansion;
1735 convert_nonlocal_omp_clauses (gimple_omp_single_clauses_ptr (stmt), wi);
1736 walk_body (convert_nonlocal_reference_stmt, convert_nonlocal_reference_op,
1737 info, gimple_omp_body_ptr (stmt));
1738 info->suppress_expansion = save_suppress;
1741 case GIMPLE_OMP_SCOPE:
1742 save_suppress = info->suppress_expansion;
1743 convert_nonlocal_omp_clauses (gimple_omp_scope_clauses_ptr (stmt), wi);
1744 walk_body (convert_nonlocal_reference_stmt, convert_nonlocal_reference_op,
1745 info, gimple_omp_body_ptr (stmt));
1746 info->suppress_expansion = save_suppress;
1749 case GIMPLE_OMP_TASKGROUP:
1750 save_suppress = info->suppress_expansion;
1751 convert_nonlocal_omp_clauses (gimple_omp_taskgroup_clauses_ptr (stmt), wi);
1752 walk_body (convert_nonlocal_reference_stmt, convert_nonlocal_reference_op,
1753 info, gimple_omp_body_ptr (stmt));
1754 info->suppress_expansion = save_suppress;
1757 case GIMPLE_OMP_TARGET:
1758 if (!is_gimple_omp_offloaded (stmt))
1760 save_suppress = info->suppress_expansion;
1761 convert_nonlocal_omp_clauses (gimple_omp_target_clauses_ptr (stmt),
1763 info->suppress_expansion = save_suppress;
1764 walk_body (convert_nonlocal_reference_stmt,
1765 convert_nonlocal_reference_op, info,
1766 gimple_omp_body_ptr (stmt));
1769 save_suppress = info->suppress_expansion;
1770 if (convert_nonlocal_omp_clauses (gimple_omp_target_clauses_ptr (stmt),
1774 decl = get_chain_decl (info);
1775 c = build_omp_clause (gimple_location (stmt), OMP_CLAUSE_MAP);
1776 OMP_CLAUSE_DECL (c) = decl;
1777 OMP_CLAUSE_SET_MAP_KIND (c, GOMP_MAP_TO);
1778 OMP_CLAUSE_SIZE (c) = DECL_SIZE_UNIT (decl);
1779 OMP_CLAUSE_CHAIN (c) = gimple_omp_target_clauses (stmt);
1780 gimple_omp_target_set_clauses (as_a <gomp_target *> (stmt), c);
1783 save_local_var_chain = info->new_local_var_chain;
1784 info->new_local_var_chain = NULL;
1786 walk_body (convert_nonlocal_reference_stmt, convert_nonlocal_reference_op,
1787 info, gimple_omp_body_ptr (stmt));
1789 if (info->new_local_var_chain)
1790 declare_vars (info->new_local_var_chain,
1791 gimple_seq_first_stmt (gimple_omp_body (stmt)),
1793 info->new_local_var_chain = save_local_var_chain;
1794 info->suppress_expansion = save_suppress;
1797 case GIMPLE_OMP_SECTION:
1798 case GIMPLE_OMP_MASTER:
1799 case GIMPLE_OMP_MASKED:
1800 case GIMPLE_OMP_ORDERED:
1801 case GIMPLE_OMP_SCAN:
1802 walk_body (convert_nonlocal_reference_stmt, convert_nonlocal_reference_op,
1803 info, gimple_omp_body_ptr (stmt));
1808 gbind *bind_stmt = as_a <gbind *> (stmt);
1810 for (tree var = gimple_bind_vars (bind_stmt); var; var = DECL_CHAIN (var))
1811 if (TREE_CODE (var) == NAMELIST_DECL)
1813 /* Adjust decls mentioned in NAMELIST_DECL. */
1814 tree decls = NAMELIST_DECL_ASSOCIATED_DECL (var);
1818 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (decls), i, decl)
1821 && (TREE_STATIC (decl) || DECL_EXTERNAL (decl)))
1823 if (decl_function_context (decl) != info->context)
1824 CONSTRUCTOR_ELT (decls, i)->value
1825 = get_nonlocal_debug_decl (info, decl);
1829 *handled_ops_p = false;
1833 wi->val_only = true;
1835 *handled_ops_p = false;
1839 if (gimple_clobber_p (stmt))
1841 tree lhs = gimple_assign_lhs (stmt);
1843 && !(TREE_STATIC (lhs) || DECL_EXTERNAL (lhs))
1844 && decl_function_context (lhs) != info->context)
1846 gsi_replace (gsi, gimple_build_nop (), true);
1850 *handled_ops_p = false;
1854 /* For every other statement that we are not interested in
1855 handling here, let the walker traverse the operands. */
1856 *handled_ops_p = false;
1860 /* We have handled all of STMT operands, no need to traverse the operands. */
1861 *handled_ops_p = true;
1866 /* A subroutine of convert_local_reference. Create a local variable
1867 in the parent function with DECL_VALUE_EXPR set to reference the
1868 field in FRAME. This is used both for debug info and in OMP
1872 get_local_debug_decl (struct nesting_info *info, tree decl, tree field)
1876 tree *slot = &info->var_map->get_or_insert (decl);
1880 /* Make sure frame_decl gets created. */
1881 (void) get_frame_type (info);
1882 x = info->frame_decl;
1883 x = build3 (COMPONENT_REF, TREE_TYPE (field), x, field, NULL_TREE);
1885 new_decl = build_decl (DECL_SOURCE_LOCATION (decl),
1886 VAR_DECL, DECL_NAME (decl), TREE_TYPE (decl));
1887 DECL_CONTEXT (new_decl) = info->context;
1888 DECL_ARTIFICIAL (new_decl) = DECL_ARTIFICIAL (decl);
1889 DECL_IGNORED_P (new_decl) = DECL_IGNORED_P (decl);
1890 TREE_THIS_VOLATILE (new_decl) = TREE_THIS_VOLATILE (decl);
1891 TREE_SIDE_EFFECTS (new_decl) = TREE_SIDE_EFFECTS (decl);
1892 TREE_READONLY (new_decl) = TREE_READONLY (decl);
1893 TREE_ADDRESSABLE (new_decl) = TREE_ADDRESSABLE (decl);
1894 DECL_SEEN_IN_BIND_EXPR_P (new_decl) = 1;
1895 if ((TREE_CODE (decl) == PARM_DECL
1896 || TREE_CODE (decl) == RESULT_DECL
1898 && DECL_BY_REFERENCE (decl))
1899 DECL_BY_REFERENCE (new_decl) = 1;
1901 SET_DECL_VALUE_EXPR (new_decl, x);
1902 DECL_HAS_VALUE_EXPR_P (new_decl) = 1;
1905 DECL_CHAIN (new_decl) = info->debug_var_chain;
1906 info->debug_var_chain = new_decl;
1908 /* Do not emit debug info twice. */
1909 DECL_IGNORED_P (decl) = 1;
1915 /* Called via walk_function+walk_gimple_stmt, rewrite all references to VAR
1916 and PARM_DECLs that were referenced by inner nested functions.
1917 The rewrite will be a structure reference to the local frame variable. */
1919 static bool convert_local_omp_clauses (tree *, struct walk_stmt_info *);
1922 convert_local_reference_op (tree *tp, int *walk_subtrees, void *data)
1924 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
1925 struct nesting_info *const info = (struct nesting_info *) wi->info;
1926 tree t = *tp, field, x;
1930 switch (TREE_CODE (t))
1933 /* Non-automatic variables are never processed. */
1934 if (TREE_STATIC (t) || DECL_EXTERNAL (t))
1939 if (t != info->frame_decl && decl_function_context (t) == info->context)
1941 /* If we copied a pointer to the frame, then the original decl
1942 is used unchanged in the parent function. */
1943 if (use_pointer_in_frame (t))
1946 /* No need to transform anything if no child references the
1948 field = lookup_field_for_decl (info, t, NO_INSERT);
1953 if (bitmap_bit_p (info->suppress_expansion, DECL_UID (t)))
1954 x = get_local_debug_decl (info, t, field);
1956 x = get_frame_field (info, info->context, field, &wi->gsi);
1961 x = save_tmp_var (info, x, &wi->gsi);
1963 x = init_tmp_var (info, x, &wi->gsi);
1971 save_val_only = wi->val_only;
1972 wi->val_only = false;
1974 wi->changed = false;
1975 walk_tree (&TREE_OPERAND (t, 0), convert_local_reference_op, wi, NULL);
1976 wi->val_only = save_val_only;
1978 /* If we converted anything ... */
1983 /* Then the frame decl is now addressable. */
1984 TREE_ADDRESSABLE (info->frame_decl) = 1;
1986 save_context = current_function_decl;
1987 current_function_decl = info->context;
1988 recompute_tree_invariant_for_addr_expr (t);
1990 /* If we are in a context where we only accept values, then
1991 compute the address into a temporary. */
1993 *tp = gsi_gimplify_val ((struct nesting_info *) wi->info,
1995 current_function_decl = save_context;
2003 case ARRAY_RANGE_REF:
2005 /* Go down this entire nest and just look at the final prefix and
2006 anything that describes the references. Otherwise, we lose track
2007 of whether a NOP_EXPR or VIEW_CONVERT_EXPR needs a simple value. */
2008 save_val_only = wi->val_only;
2009 wi->val_only = true;
2011 for (; handled_component_p (t); tp = &TREE_OPERAND (t, 0), t = *tp)
2013 if (TREE_CODE (t) == COMPONENT_REF)
2014 walk_tree (&TREE_OPERAND (t, 2), convert_local_reference_op, wi,
2016 else if (TREE_CODE (t) == ARRAY_REF
2017 || TREE_CODE (t) == ARRAY_RANGE_REF)
2019 walk_tree (&TREE_OPERAND (t, 1), convert_local_reference_op, wi,
2021 walk_tree (&TREE_OPERAND (t, 2), convert_local_reference_op, wi,
2023 walk_tree (&TREE_OPERAND (t, 3), convert_local_reference_op, wi,
2027 wi->val_only = false;
2028 walk_tree (tp, convert_local_reference_op, wi, NULL);
2029 wi->val_only = save_val_only;
2033 save_val_only = wi->val_only;
2034 wi->val_only = true;
2036 walk_tree (&TREE_OPERAND (t, 0), convert_local_reference_op,
2038 /* We need to re-fold the MEM_REF as component references as
2039 part of a ADDR_EXPR address are not allowed. But we cannot
2040 fold here, as the chain record type is not yet finalized. */
2041 if (TREE_CODE (TREE_OPERAND (t, 0)) == ADDR_EXPR
2042 && !DECL_P (TREE_OPERAND (TREE_OPERAND (t, 0), 0)))
2043 info->mem_refs->add (tp);
2044 wi->val_only = save_val_only;
2047 case VIEW_CONVERT_EXPR:
2048 /* Just request to look at the subtrees, leaving val_only and lhs
2049 untouched. This might actually be for !val_only + lhs, in which
2050 case we don't want to force a replacement by a temporary. */
2055 if (!IS_TYPE_OR_DECL_P (t))
2058 wi->val_only = true;
2067 static tree convert_local_reference_stmt (gimple_stmt_iterator *, bool *,
2068 struct walk_stmt_info *);
2070 /* Helper for convert_local_reference. Convert all the references in
2071 the chain of clauses at *PCLAUSES. WI is as in convert_local_reference. */
2074 convert_local_omp_clauses (tree *pclauses, struct walk_stmt_info *wi)
2076 struct nesting_info *const info = (struct nesting_info *) wi->info;
2077 bool need_frame = false, need_stmts = false;
2078 tree clause, decl, *pdecl;
2080 bitmap new_suppress;
2082 new_suppress = BITMAP_GGC_ALLOC ();
2083 bitmap_copy (new_suppress, info->suppress_expansion);
2085 for (clause = *pclauses; clause ; clause = OMP_CLAUSE_CHAIN (clause))
2088 switch (OMP_CLAUSE_CODE (clause))
2090 case OMP_CLAUSE_REDUCTION:
2091 case OMP_CLAUSE_IN_REDUCTION:
2092 case OMP_CLAUSE_TASK_REDUCTION:
2093 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (clause))
2095 if (TREE_CODE (OMP_CLAUSE_DECL (clause)) == MEM_REF)
2097 pdecl = &TREE_OPERAND (OMP_CLAUSE_DECL (clause), 0);
2098 if (TREE_CODE (*pdecl) == POINTER_PLUS_EXPR)
2099 pdecl = &TREE_OPERAND (*pdecl, 0);
2100 if (TREE_CODE (*pdecl) == INDIRECT_REF
2101 || TREE_CODE (*pdecl) == ADDR_EXPR)
2102 pdecl = &TREE_OPERAND (*pdecl, 0);
2104 goto do_decl_clause;
2106 case OMP_CLAUSE_LASTPRIVATE:
2107 if (OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (clause))
2109 goto do_decl_clause;
2111 case OMP_CLAUSE_LINEAR:
2112 if (OMP_CLAUSE_LINEAR_GIMPLE_SEQ (clause))
2114 wi->val_only = true;
2116 convert_local_reference_op (&OMP_CLAUSE_LINEAR_STEP (clause), &dummy,
2118 goto do_decl_clause;
2120 case OMP_CLAUSE_PRIVATE:
2121 case OMP_CLAUSE_FIRSTPRIVATE:
2122 case OMP_CLAUSE_COPYPRIVATE:
2123 case OMP_CLAUSE_SHARED:
2124 case OMP_CLAUSE_ENTER:
2125 case OMP_CLAUSE_LINK:
2126 case OMP_CLAUSE_USE_DEVICE_PTR:
2127 case OMP_CLAUSE_USE_DEVICE_ADDR:
2128 case OMP_CLAUSE_HAS_DEVICE_ADDR:
2129 case OMP_CLAUSE_IS_DEVICE_PTR:
2130 case OMP_CLAUSE_DETACH:
2133 pdecl = &OMP_CLAUSE_DECL (clause);
2136 && (TREE_STATIC (decl) || DECL_EXTERNAL (decl)))
2138 if (decl_function_context (decl) == info->context
2139 && !use_pointer_in_frame (decl))
2141 tree field = lookup_field_for_decl (info, decl, NO_INSERT);
2144 if (OMP_CLAUSE_CODE (clause) == OMP_CLAUSE_SHARED)
2145 OMP_CLAUSE_SHARED_READONLY (clause) = 0;
2146 bitmap_set_bit (new_suppress, DECL_UID (decl));
2147 *pdecl = get_local_debug_decl (info, decl, field);
2153 case OMP_CLAUSE_SCHEDULE:
2154 if (OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (clause) == NULL)
2157 case OMP_CLAUSE_FINAL:
2159 case OMP_CLAUSE_NUM_THREADS:
2160 case OMP_CLAUSE_DEPEND:
2161 case OMP_CLAUSE_DOACROSS:
2162 case OMP_CLAUSE_DEVICE:
2163 case OMP_CLAUSE_NUM_TEAMS:
2164 case OMP_CLAUSE_THREAD_LIMIT:
2165 case OMP_CLAUSE_SAFELEN:
2166 case OMP_CLAUSE_SIMDLEN:
2167 case OMP_CLAUSE_PRIORITY:
2168 case OMP_CLAUSE_GRAINSIZE:
2169 case OMP_CLAUSE_NUM_TASKS:
2170 case OMP_CLAUSE_HINT:
2171 case OMP_CLAUSE_FILTER:
2172 case OMP_CLAUSE_NUM_GANGS:
2173 case OMP_CLAUSE_NUM_WORKERS:
2174 case OMP_CLAUSE_VECTOR_LENGTH:
2175 case OMP_CLAUSE_GANG:
2176 case OMP_CLAUSE_WORKER:
2177 case OMP_CLAUSE_VECTOR:
2178 case OMP_CLAUSE_ASYNC:
2179 case OMP_CLAUSE_WAIT:
2180 /* Several OpenACC clauses have optional arguments. Check if they
2182 if (OMP_CLAUSE_OPERAND (clause, 0))
2184 wi->val_only = true;
2186 convert_local_reference_op (&OMP_CLAUSE_OPERAND (clause, 0),
2190 /* The gang clause accepts two arguments. */
2191 if (OMP_CLAUSE_CODE (clause) == OMP_CLAUSE_GANG
2192 && OMP_CLAUSE_GANG_STATIC_EXPR (clause))
2194 wi->val_only = true;
2196 convert_nonlocal_reference_op
2197 (&OMP_CLAUSE_GANG_STATIC_EXPR (clause), &dummy, wi);
2201 case OMP_CLAUSE_DIST_SCHEDULE:
2202 if (OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (clause) != NULL)
2204 wi->val_only = true;
2206 convert_local_reference_op (&OMP_CLAUSE_OPERAND (clause, 0),
2211 case OMP_CLAUSE_MAP:
2213 case OMP_CLAUSE_FROM:
2214 if (OMP_CLAUSE_SIZE (clause))
2216 wi->val_only = true;
2218 convert_local_reference_op (&OMP_CLAUSE_SIZE (clause),
2221 if (DECL_P (OMP_CLAUSE_DECL (clause)))
2222 goto do_decl_clause;
2223 wi->val_only = true;
2225 walk_tree (&OMP_CLAUSE_DECL (clause), convert_local_reference_op,
2229 case OMP_CLAUSE_ALIGNED:
2230 if (OMP_CLAUSE_ALIGNED_ALIGNMENT (clause))
2232 wi->val_only = true;
2234 convert_local_reference_op
2235 (&OMP_CLAUSE_ALIGNED_ALIGNMENT (clause), &dummy, wi);
2238 case OMP_CLAUSE_NONTEMPORAL:
2239 do_decl_clause_no_supp:
2240 /* Like do_decl_clause, but don't add any suppression. */
2241 decl = OMP_CLAUSE_DECL (clause);
2243 && (TREE_STATIC (decl) || DECL_EXTERNAL (decl)))
2245 if (decl_function_context (decl) == info->context
2246 && !use_pointer_in_frame (decl))
2248 tree field = lookup_field_for_decl (info, decl, NO_INSERT);
2251 OMP_CLAUSE_DECL (clause)
2252 = get_local_debug_decl (info, decl, field);
2258 case OMP_CLAUSE_ALLOCATE:
2259 if (OMP_CLAUSE_ALLOCATE_ALLOCATOR (clause))
2261 wi->val_only = true;
2263 convert_local_reference_op
2264 (&OMP_CLAUSE_ALLOCATE_ALLOCATOR (clause), &dummy, wi);
2266 goto do_decl_clause_no_supp;
2268 case OMP_CLAUSE_NOWAIT:
2269 case OMP_CLAUSE_ORDERED:
2270 case OMP_CLAUSE_DEFAULT:
2271 case OMP_CLAUSE_COPYIN:
2272 case OMP_CLAUSE_COLLAPSE:
2273 case OMP_CLAUSE_TILE:
2274 case OMP_CLAUSE_UNTIED:
2275 case OMP_CLAUSE_MERGEABLE:
2276 case OMP_CLAUSE_PROC_BIND:
2277 case OMP_CLAUSE_NOGROUP:
2278 case OMP_CLAUSE_THREADS:
2279 case OMP_CLAUSE_SIMD:
2280 case OMP_CLAUSE_DEFAULTMAP:
2281 case OMP_CLAUSE_ORDER:
2282 case OMP_CLAUSE_SEQ:
2283 case OMP_CLAUSE_INDEPENDENT:
2284 case OMP_CLAUSE_AUTO:
2285 case OMP_CLAUSE_IF_PRESENT:
2286 case OMP_CLAUSE_FINALIZE:
2287 case OMP_CLAUSE_BIND:
2288 case OMP_CLAUSE__CONDTEMP_:
2289 case OMP_CLAUSE__SCANTEMP_:
2292 /* The following clause belongs to the OpenACC cache directive, which
2293 is discarded during gimplification. */
2294 case OMP_CLAUSE__CACHE_:
2295 /* The following clauses are only allowed in the OpenMP declare simd
2296 directive, so not seen here. */
2297 case OMP_CLAUSE_UNIFORM:
2298 case OMP_CLAUSE_INBRANCH:
2299 case OMP_CLAUSE_NOTINBRANCH:
2300 /* The following clauses are only allowed on OpenMP cancel and
2301 cancellation point directives, which at this point have already
2302 been lowered into a function call. */
2303 case OMP_CLAUSE_FOR:
2304 case OMP_CLAUSE_PARALLEL:
2305 case OMP_CLAUSE_SECTIONS:
2306 case OMP_CLAUSE_TASKGROUP:
2307 /* The following clauses are only added during OMP lowering; nested
2308 function decomposition happens before that. */
2309 case OMP_CLAUSE__LOOPTEMP_:
2310 case OMP_CLAUSE__REDUCTEMP_:
2311 case OMP_CLAUSE__SIMDUID_:
2312 case OMP_CLAUSE__SIMT_:
2313 /* The following clauses are only allowed on OpenACC 'routine'
2314 directives, not seen here. */
2315 case OMP_CLAUSE_NOHOST:
2316 /* Anything else. */
2322 info->suppress_expansion = new_suppress;
2325 for (clause = *pclauses; clause ; clause = OMP_CLAUSE_CHAIN (clause))
2326 switch (OMP_CLAUSE_CODE (clause))
2328 case OMP_CLAUSE_REDUCTION:
2329 case OMP_CLAUSE_IN_REDUCTION:
2330 case OMP_CLAUSE_TASK_REDUCTION:
2331 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (clause))
2334 = DECL_CONTEXT (OMP_CLAUSE_REDUCTION_PLACEHOLDER (clause));
2335 DECL_CONTEXT (OMP_CLAUSE_REDUCTION_PLACEHOLDER (clause))
2337 if (OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (clause))
2338 DECL_CONTEXT (OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (clause))
2340 walk_body (convert_local_reference_stmt,
2341 convert_local_reference_op, info,
2342 &OMP_CLAUSE_REDUCTION_GIMPLE_INIT (clause));
2343 walk_body (convert_local_reference_stmt,
2344 convert_local_reference_op, info,
2345 &OMP_CLAUSE_REDUCTION_GIMPLE_MERGE (clause));
2346 DECL_CONTEXT (OMP_CLAUSE_REDUCTION_PLACEHOLDER (clause))
2348 if (OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (clause))
2349 DECL_CONTEXT (OMP_CLAUSE_REDUCTION_DECL_PLACEHOLDER (clause))
2354 case OMP_CLAUSE_LASTPRIVATE:
2355 walk_body (convert_local_reference_stmt,
2356 convert_local_reference_op, info,
2357 &OMP_CLAUSE_LASTPRIVATE_GIMPLE_SEQ (clause));
2360 case OMP_CLAUSE_LINEAR:
2361 walk_body (convert_local_reference_stmt,
2362 convert_local_reference_op, info,
2363 &OMP_CLAUSE_LINEAR_GIMPLE_SEQ (clause));
2374 /* Called via walk_function+walk_gimple_stmt, rewrite all references to VAR
2375 and PARM_DECLs that were referenced by inner nested functions.
2376 The rewrite will be a structure reference to the local frame variable. */
2379 convert_local_reference_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2380 struct walk_stmt_info *wi)
2382 struct nesting_info *info = (struct nesting_info *) wi->info;
2383 tree save_local_var_chain;
2384 bitmap save_suppress;
2385 char save_static_chain_added;
2386 bool frame_decl_added;
2387 gimple *stmt = gsi_stmt (*gsi);
2389 switch (gimple_code (stmt))
2391 case GIMPLE_OMP_TEAMS:
2392 if (!gimple_omp_teams_host (as_a <gomp_teams *> (stmt)))
2394 save_suppress = info->suppress_expansion;
2395 convert_local_omp_clauses (gimple_omp_teams_clauses_ptr (stmt), wi);
2396 walk_body (convert_local_reference_stmt, convert_local_reference_op,
2397 info, gimple_omp_body_ptr (stmt));
2398 info->suppress_expansion = save_suppress;
2403 case GIMPLE_OMP_PARALLEL:
2404 case GIMPLE_OMP_TASK:
2405 save_suppress = info->suppress_expansion;
2406 frame_decl_added = false;
2407 if (convert_local_omp_clauses (gimple_omp_taskreg_clauses_ptr (stmt),
2410 tree c = build_omp_clause (gimple_location (stmt),
2412 (void) get_frame_type (info);
2413 OMP_CLAUSE_DECL (c) = info->frame_decl;
2414 OMP_CLAUSE_CHAIN (c) = gimple_omp_taskreg_clauses (stmt);
2415 gimple_omp_taskreg_set_clauses (stmt, c);
2416 info->static_chain_added |= 4;
2417 frame_decl_added = true;
2420 save_local_var_chain = info->new_local_var_chain;
2421 save_static_chain_added = info->static_chain_added;
2422 info->new_local_var_chain = NULL;
2423 info->static_chain_added = 0;
2425 walk_body (convert_local_reference_stmt, convert_local_reference_op, info,
2426 gimple_omp_body_ptr (stmt));
2428 if ((info->static_chain_added & 4) != 0 && !frame_decl_added)
2430 tree c = build_omp_clause (gimple_location (stmt),
2432 (void) get_frame_type (info);
2433 OMP_CLAUSE_DECL (c) = info->frame_decl;
2434 OMP_CLAUSE_CHAIN (c) = gimple_omp_taskreg_clauses (stmt);
2435 info->static_chain_added |= 4;
2436 gimple_omp_taskreg_set_clauses (stmt, c);
2438 if (info->new_local_var_chain)
2439 declare_vars (info->new_local_var_chain,
2440 gimple_seq_first_stmt (gimple_omp_body (stmt)), false);
2441 info->new_local_var_chain = save_local_var_chain;
2442 info->suppress_expansion = save_suppress;
2443 info->static_chain_added |= save_static_chain_added;
2446 case GIMPLE_OMP_FOR:
2447 save_suppress = info->suppress_expansion;
2448 convert_local_omp_clauses (gimple_omp_for_clauses_ptr (stmt), wi);
2449 walk_gimple_omp_for (as_a <gomp_for *> (stmt),
2450 convert_local_reference_stmt,
2451 convert_local_reference_op, info);
2452 walk_body (convert_local_reference_stmt, convert_local_reference_op,
2453 info, gimple_omp_body_ptr (stmt));
2454 info->suppress_expansion = save_suppress;
2457 case GIMPLE_OMP_SECTIONS:
2458 save_suppress = info->suppress_expansion;
2459 convert_local_omp_clauses (gimple_omp_sections_clauses_ptr (stmt), wi);
2460 walk_body (convert_local_reference_stmt, convert_local_reference_op,
2461 info, gimple_omp_body_ptr (stmt));
2462 info->suppress_expansion = save_suppress;
2465 case GIMPLE_OMP_SINGLE:
2466 save_suppress = info->suppress_expansion;
2467 convert_local_omp_clauses (gimple_omp_single_clauses_ptr (stmt), wi);
2468 walk_body (convert_local_reference_stmt, convert_local_reference_op,
2469 info, gimple_omp_body_ptr (stmt));
2470 info->suppress_expansion = save_suppress;
2473 case GIMPLE_OMP_SCOPE:
2474 save_suppress = info->suppress_expansion;
2475 convert_local_omp_clauses (gimple_omp_scope_clauses_ptr (stmt), wi);
2476 walk_body (convert_local_reference_stmt, convert_local_reference_op,
2477 info, gimple_omp_body_ptr (stmt));
2478 info->suppress_expansion = save_suppress;
2481 case GIMPLE_OMP_TASKGROUP:
2482 save_suppress = info->suppress_expansion;
2483 convert_local_omp_clauses (gimple_omp_taskgroup_clauses_ptr (stmt), wi);
2484 walk_body (convert_local_reference_stmt, convert_local_reference_op,
2485 info, gimple_omp_body_ptr (stmt));
2486 info->suppress_expansion = save_suppress;
2489 case GIMPLE_OMP_TARGET:
2490 if (!is_gimple_omp_offloaded (stmt))
2492 save_suppress = info->suppress_expansion;
2493 convert_local_omp_clauses (gimple_omp_target_clauses_ptr (stmt), wi);
2494 info->suppress_expansion = save_suppress;
2495 walk_body (convert_local_reference_stmt, convert_local_reference_op,
2496 info, gimple_omp_body_ptr (stmt));
2499 save_suppress = info->suppress_expansion;
2500 frame_decl_added = false;
2501 if (convert_local_omp_clauses (gimple_omp_target_clauses_ptr (stmt), wi))
2503 tree c = build_omp_clause (gimple_location (stmt), OMP_CLAUSE_MAP);
2504 (void) get_frame_type (info);
2505 OMP_CLAUSE_DECL (c) = info->frame_decl;
2506 OMP_CLAUSE_SET_MAP_KIND (c, GOMP_MAP_TOFROM);
2507 OMP_CLAUSE_SIZE (c) = DECL_SIZE_UNIT (info->frame_decl);
2508 OMP_CLAUSE_CHAIN (c) = gimple_omp_target_clauses (stmt);
2509 gimple_omp_target_set_clauses (as_a <gomp_target *> (stmt), c);
2510 info->static_chain_added |= 4;
2511 frame_decl_added = true;
2514 save_local_var_chain = info->new_local_var_chain;
2515 save_static_chain_added = info->static_chain_added;
2516 info->new_local_var_chain = NULL;
2517 info->static_chain_added = 0;
2519 walk_body (convert_local_reference_stmt, convert_local_reference_op, info,
2520 gimple_omp_body_ptr (stmt));
2522 if ((info->static_chain_added & 4) != 0 && !frame_decl_added)
2524 tree c = build_omp_clause (gimple_location (stmt), OMP_CLAUSE_MAP);
2525 (void) get_frame_type (info);
2526 OMP_CLAUSE_DECL (c) = info->frame_decl;
2527 OMP_CLAUSE_SET_MAP_KIND (c, GOMP_MAP_TOFROM);
2528 OMP_CLAUSE_SIZE (c) = DECL_SIZE_UNIT (info->frame_decl);
2529 OMP_CLAUSE_CHAIN (c) = gimple_omp_target_clauses (stmt);
2530 gimple_omp_target_set_clauses (as_a <gomp_target *> (stmt), c);
2531 info->static_chain_added |= 4;
2534 if (info->new_local_var_chain)
2535 declare_vars (info->new_local_var_chain,
2536 gimple_seq_first_stmt (gimple_omp_body (stmt)), false);
2537 info->new_local_var_chain = save_local_var_chain;
2538 info->suppress_expansion = save_suppress;
2539 info->static_chain_added |= save_static_chain_added;
2542 case GIMPLE_OMP_SECTION:
2543 case GIMPLE_OMP_MASTER:
2544 case GIMPLE_OMP_MASKED:
2545 case GIMPLE_OMP_ORDERED:
2546 case GIMPLE_OMP_SCAN:
2547 walk_body (convert_local_reference_stmt, convert_local_reference_op,
2548 info, gimple_omp_body_ptr (stmt));
2552 wi->val_only = true;
2554 *handled_ops_p = false;
2558 if (gimple_clobber_p (stmt))
2560 tree lhs = gimple_assign_lhs (stmt);
2562 && decl_function_context (lhs) == info->context
2563 && !use_pointer_in_frame (lhs)
2564 && lookup_field_for_decl (info, lhs, NO_INSERT))
2566 gsi_replace (gsi, gimple_build_nop (), true);
2570 *handled_ops_p = false;
2574 for (tree var = gimple_bind_vars (as_a <gbind *> (stmt));
2576 var = DECL_CHAIN (var))
2577 if (TREE_CODE (var) == NAMELIST_DECL)
2579 /* Adjust decls mentioned in NAMELIST_DECL. */
2580 tree decls = NAMELIST_DECL_ASSOCIATED_DECL (var);
2584 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (decls), i, decl)
2587 && (TREE_STATIC (decl) || DECL_EXTERNAL (decl)))
2589 if (decl_function_context (decl) == info->context
2590 && !use_pointer_in_frame (decl))
2592 tree field = lookup_field_for_decl (info, decl, NO_INSERT);
2595 CONSTRUCTOR_ELT (decls, i)->value
2596 = get_local_debug_decl (info, decl, field);
2602 *handled_ops_p = false;
2606 /* For every other statement that we are not interested in
2607 handling here, let the walker traverse the operands. */
2608 *handled_ops_p = false;
2612 /* Indicate that we have handled all the operands ourselves. */
2613 *handled_ops_p = true;
2618 /* Called via walk_function+walk_gimple_stmt, rewrite all GIMPLE_GOTOs
2619 that reference labels from outer functions. The rewrite will be a
2620 call to __builtin_nonlocal_goto. */
2623 convert_nl_goto_reference (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2624 struct walk_stmt_info *wi)
2626 struct nesting_info *const info = (struct nesting_info *) wi->info, *i;
2627 tree label, new_label, target_context, x, field;
2629 gimple *stmt = gsi_stmt (*gsi);
2631 if (gimple_code (stmt) != GIMPLE_GOTO)
2633 *handled_ops_p = false;
2637 label = gimple_goto_dest (stmt);
2638 if (TREE_CODE (label) != LABEL_DECL)
2640 *handled_ops_p = false;
2644 target_context = decl_function_context (label);
2645 if (target_context == info->context)
2647 *handled_ops_p = false;
2651 for (i = info->outer; target_context != i->context; i = i->outer)
2654 /* The original user label may also be use for a normal goto, therefore
2655 we must create a new label that will actually receive the abnormal
2656 control transfer. This new label will be marked LABEL_NONLOCAL; this
2657 mark will trigger proper behavior in the cfg, as well as cause the
2658 (hairy target-specific) non-local goto receiver code to be generated
2659 when we expand rtl. Enter this association into var_map so that we
2660 can insert the new label into the IL during a second pass. */
2661 tree *slot = &i->var_map->get_or_insert (label);
2664 new_label = create_artificial_label (UNKNOWN_LOCATION);
2665 DECL_NONLOCAL (new_label) = 1;
2671 /* Build: __builtin_nl_goto(new_label, &chain->nl_goto_field). */
2672 field = get_nl_goto_field (i);
2673 x = get_frame_field (info, target_context, field, gsi);
2675 x = gsi_gimplify_val (info, x, gsi);
2676 call = gimple_build_call (builtin_decl_implicit (BUILT_IN_NONLOCAL_GOTO),
2677 2, build_addr (new_label), x);
2678 gsi_replace (gsi, call, false);
2680 /* We have handled all of STMT's operands, no need to keep going. */
2681 *handled_ops_p = true;
2686 /* Called via walk_function+walk_tree, rewrite all GIMPLE_LABELs whose labels
2687 are referenced via nonlocal goto from a nested function. The rewrite
2688 will involve installing a newly generated DECL_NONLOCAL label, and
2689 (potentially) a branch around the rtl gunk that is assumed to be
2690 attached to such a label. */
2693 convert_nl_goto_receiver (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2694 struct walk_stmt_info *wi)
2696 struct nesting_info *const info = (struct nesting_info *) wi->info;
2697 tree label, new_label;
2698 gimple_stmt_iterator tmp_gsi;
2699 glabel *stmt = dyn_cast <glabel *> (gsi_stmt (*gsi));
2703 *handled_ops_p = false;
2707 label = gimple_label_label (stmt);
2709 tree *slot = info->var_map->get (label);
2712 *handled_ops_p = false;
2716 /* If there's any possibility that the previous statement falls through,
2717 then we must branch around the new non-local label. */
2719 gsi_prev (&tmp_gsi);
2720 if (gsi_end_p (tmp_gsi) || gimple_stmt_may_fallthru (gsi_stmt (tmp_gsi)))
2722 gimple *stmt = gimple_build_goto (label);
2723 gsi_insert_before (gsi, stmt, GSI_SAME_STMT);
2726 new_label = (tree) *slot;
2727 stmt = gimple_build_label (new_label);
2728 gsi_insert_before (gsi, stmt, GSI_SAME_STMT);
2730 *handled_ops_p = true;
2735 /* Called via walk_function+walk_stmt, rewrite all references to addresses
2736 of nested functions that require the use of trampolines. The rewrite
2737 will involve a reference a trampoline generated for the occasion. */
2740 convert_tramp_reference_op (tree *tp, int *walk_subtrees, void *data)
2742 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
2743 struct nesting_info *const info = (struct nesting_info *) wi->info, *i;
2744 tree t = *tp, decl, target_context, x, builtin;
2749 switch (TREE_CODE (t))
2753 T.1 = &CHAIN->tramp;
2754 T.2 = __builtin_adjust_trampoline (T.1);
2755 T.3 = (func_type)T.2;
2758 decl = TREE_OPERAND (t, 0);
2759 if (TREE_CODE (decl) != FUNCTION_DECL)
2762 /* Only need to process nested functions. */
2763 target_context = decl_function_context (decl);
2764 if (!target_context)
2767 /* If the nested function doesn't use a static chain, then
2768 it doesn't need a trampoline. */
2769 if (!DECL_STATIC_CHAIN (decl))
2772 /* If we don't want a trampoline, then don't build one. */
2773 if (TREE_NO_TRAMPOLINE (t))
2776 /* Lookup the immediate parent of the callee, as that's where
2777 we need to insert the trampoline. */
2778 for (i = info; i->context != target_context; i = i->outer)
2781 /* Decide whether to generate a descriptor or a trampoline. */
2782 descr = FUNC_ADDR_BY_DESCRIPTOR (t) && !flag_trampolines;
2785 x = lookup_descr_for_decl (i, decl, INSERT);
2787 x = lookup_tramp_for_decl (i, decl, INSERT);
2789 /* Compute the address of the field holding the trampoline. */
2790 x = get_frame_field (info, target_context, x, &wi->gsi);
2792 x = gsi_gimplify_val (info, x, &wi->gsi);
2794 /* Do machine-specific ugliness. Normally this will involve
2795 computing extra alignment, but it can really be anything. */
2797 builtin = builtin_decl_implicit (BUILT_IN_ADJUST_DESCRIPTOR);
2799 builtin = builtin_decl_implicit (BUILT_IN_ADJUST_TRAMPOLINE);
2800 call = gimple_build_call (builtin, 1, x);
2801 x = init_tmp_var_with_call (info, &wi->gsi, call);
2803 /* Cast back to the proper function type. */
2804 x = build1 (NOP_EXPR, TREE_TYPE (t), x);
2805 x = init_tmp_var (info, x, &wi->gsi);
2811 if (!IS_TYPE_OR_DECL_P (t))
2820 /* Called via walk_function+walk_gimple_stmt, rewrite all references
2821 to addresses of nested functions that require the use of
2822 trampolines. The rewrite will involve a reference a trampoline
2823 generated for the occasion. */
2826 convert_tramp_reference_stmt (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2827 struct walk_stmt_info *wi)
2829 struct nesting_info *info = (struct nesting_info *) wi->info;
2830 gimple *stmt = gsi_stmt (*gsi);
2832 switch (gimple_code (stmt))
2836 /* Only walk call arguments, lest we generate trampolines for
2838 unsigned long i, nargs = gimple_call_num_args (stmt);
2839 for (i = 0; i < nargs; i++)
2840 walk_tree (gimple_call_arg_ptr (stmt, i), convert_tramp_reference_op,
2845 case GIMPLE_OMP_TEAMS:
2846 if (!gimple_omp_teams_host (as_a <gomp_teams *> (stmt)))
2848 *handled_ops_p = false;
2853 case GIMPLE_OMP_TARGET:
2854 if (!is_gimple_omp_offloaded (stmt))
2856 *handled_ops_p = false;
2860 case GIMPLE_OMP_PARALLEL:
2861 case GIMPLE_OMP_TASK:
2864 tree save_local_var_chain = info->new_local_var_chain;
2865 walk_gimple_op (stmt, convert_tramp_reference_op, wi);
2866 info->new_local_var_chain = NULL;
2867 char save_static_chain_added = info->static_chain_added;
2868 info->static_chain_added = 0;
2869 walk_body (convert_tramp_reference_stmt, convert_tramp_reference_op,
2870 info, gimple_omp_body_ptr (stmt));
2871 if (info->new_local_var_chain)
2872 declare_vars (info->new_local_var_chain,
2873 gimple_seq_first_stmt (gimple_omp_body (stmt)),
2875 for (int i = 0; i < 2; i++)
2878 if ((info->static_chain_added & (1 << i)) == 0)
2880 decl = i ? get_chain_decl (info) : info->frame_decl;
2881 /* Don't add CHAIN.* or FRAME.* twice. */
2882 for (c = gimple_omp_taskreg_clauses (stmt);
2884 c = OMP_CLAUSE_CHAIN (c))
2885 if ((OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE
2886 || OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED)
2887 && OMP_CLAUSE_DECL (c) == decl)
2889 if (c == NULL && gimple_code (stmt) != GIMPLE_OMP_TARGET)
2891 c = build_omp_clause (gimple_location (stmt),
2892 i ? OMP_CLAUSE_FIRSTPRIVATE
2893 : OMP_CLAUSE_SHARED);
2894 OMP_CLAUSE_DECL (c) = decl;
2895 OMP_CLAUSE_CHAIN (c) = gimple_omp_taskreg_clauses (stmt);
2896 gimple_omp_taskreg_set_clauses (stmt, c);
2900 c = build_omp_clause (gimple_location (stmt),
2902 OMP_CLAUSE_DECL (c) = decl;
2903 OMP_CLAUSE_SET_MAP_KIND (c,
2904 i ? GOMP_MAP_TO : GOMP_MAP_TOFROM);
2905 OMP_CLAUSE_SIZE (c) = DECL_SIZE_UNIT (decl);
2906 OMP_CLAUSE_CHAIN (c) = gimple_omp_target_clauses (stmt);
2907 gimple_omp_target_set_clauses (as_a <gomp_target *> (stmt),
2911 info->new_local_var_chain = save_local_var_chain;
2912 info->static_chain_added |= save_static_chain_added;
2917 *handled_ops_p = false;
2921 *handled_ops_p = true;
2927 /* Called via walk_function+walk_gimple_stmt, rewrite all GIMPLE_CALLs
2928 that reference nested functions to make sure that the static chain
2929 is set up properly for the call. */
2932 convert_gimple_call (gimple_stmt_iterator *gsi, bool *handled_ops_p,
2933 struct walk_stmt_info *wi)
2935 struct nesting_info *const info = (struct nesting_info *) wi->info;
2936 tree decl, target_context;
2937 char save_static_chain_added;
2939 gimple *stmt = gsi_stmt (*gsi);
2941 switch (gimple_code (stmt))
2944 if (gimple_call_chain (stmt))
2946 decl = gimple_call_fndecl (stmt);
2949 target_context = decl_function_context (decl);
2950 if (target_context && DECL_STATIC_CHAIN (decl))
2952 struct nesting_info *i = info;
2953 while (i && i->context != target_context)
2955 /* If none of the outer contexts is the target context, this means
2956 that the function is called in a wrong context. */
2958 internal_error ("%s from %s called in %s",
2959 IDENTIFIER_POINTER (DECL_NAME (decl)),
2960 IDENTIFIER_POINTER (DECL_NAME (target_context)),
2961 IDENTIFIER_POINTER (DECL_NAME (info->context)));
2963 gimple_call_set_chain (as_a <gcall *> (stmt),
2964 get_static_chain (info, target_context,
2966 info->static_chain_added |= (1 << (info->context != target_context));
2970 case GIMPLE_OMP_TEAMS:
2971 if (!gimple_omp_teams_host (as_a <gomp_teams *> (stmt)))
2973 walk_body (convert_gimple_call, NULL, info,
2974 gimple_omp_body_ptr (stmt));
2979 case GIMPLE_OMP_PARALLEL:
2980 case GIMPLE_OMP_TASK:
2981 save_static_chain_added = info->static_chain_added;
2982 info->static_chain_added = 0;
2983 walk_body (convert_gimple_call, NULL, info, gimple_omp_body_ptr (stmt));
2984 for (i = 0; i < 2; i++)
2987 if ((info->static_chain_added & (1 << i)) == 0)
2989 decl = i ? get_chain_decl (info) : info->frame_decl;
2990 /* Don't add CHAIN.* or FRAME.* twice. */
2991 for (c = gimple_omp_taskreg_clauses (stmt);
2993 c = OMP_CLAUSE_CHAIN (c))
2994 if ((OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE
2995 || OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED)
2996 && OMP_CLAUSE_DECL (c) == decl)
3000 c = build_omp_clause (gimple_location (stmt),
3001 i ? OMP_CLAUSE_FIRSTPRIVATE
3002 : OMP_CLAUSE_SHARED);
3003 OMP_CLAUSE_DECL (c) = decl;
3004 OMP_CLAUSE_CHAIN (c) = gimple_omp_taskreg_clauses (stmt);
3005 gimple_omp_taskreg_set_clauses (stmt, c);
3008 info->static_chain_added |= save_static_chain_added;
3011 case GIMPLE_OMP_TARGET:
3012 if (!is_gimple_omp_offloaded (stmt))
3014 walk_body (convert_gimple_call, NULL, info, gimple_omp_body_ptr (stmt));
3017 save_static_chain_added = info->static_chain_added;
3018 info->static_chain_added = 0;
3019 walk_body (convert_gimple_call, NULL, info, gimple_omp_body_ptr (stmt));
3020 for (i = 0; i < 2; i++)
3023 if ((info->static_chain_added & (1 << i)) == 0)
3025 decl = i ? get_chain_decl (info) : info->frame_decl;
3026 /* Don't add CHAIN.* or FRAME.* twice. */
3027 for (c = gimple_omp_target_clauses (stmt);
3029 c = OMP_CLAUSE_CHAIN (c))
3030 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP
3031 && OMP_CLAUSE_DECL (c) == decl)
3035 c = build_omp_clause (gimple_location (stmt), OMP_CLAUSE_MAP);
3036 OMP_CLAUSE_DECL (c) = decl;
3037 OMP_CLAUSE_SET_MAP_KIND (c, i ? GOMP_MAP_TO : GOMP_MAP_TOFROM);
3038 OMP_CLAUSE_SIZE (c) = DECL_SIZE_UNIT (decl);
3039 OMP_CLAUSE_CHAIN (c) = gimple_omp_target_clauses (stmt);
3040 gimple_omp_target_set_clauses (as_a <gomp_target *> (stmt),
3044 info->static_chain_added |= save_static_chain_added;
3047 case GIMPLE_OMP_FOR:
3048 walk_body (convert_gimple_call, NULL, info,
3049 gimple_omp_for_pre_body_ptr (stmt));
3051 case GIMPLE_OMP_SECTIONS:
3052 case GIMPLE_OMP_SECTION:
3053 case GIMPLE_OMP_SINGLE:
3054 case GIMPLE_OMP_SCOPE:
3055 case GIMPLE_OMP_MASTER:
3056 case GIMPLE_OMP_MASKED:
3057 case GIMPLE_OMP_TASKGROUP:
3058 case GIMPLE_OMP_ORDERED:
3059 case GIMPLE_OMP_SCAN:
3060 case GIMPLE_OMP_CRITICAL:
3061 walk_body (convert_gimple_call, NULL, info, gimple_omp_body_ptr (stmt));
3065 /* Keep looking for other operands. */
3066 *handled_ops_p = false;
3070 *handled_ops_p = true;
3074 /* Walk the nesting tree starting with ROOT. Convert all trampolines and
3075 call expressions. At the same time, determine if a nested function
3076 actually uses its static chain; if not, remember that. */
3079 convert_all_function_calls (struct nesting_info *root)
3081 unsigned int chain_count = 0, old_chain_count, iter_count;
3082 struct nesting_info *n;
3084 /* First, optimistically clear static_chain for all decls that haven't
3085 used the static chain already for variable access. But always create
3086 it if not optimizing. This makes it possible to reconstruct the static
3087 nesting tree at run time and thus to resolve up-level references from
3088 within the debugger. */
3089 FOR_EACH_NEST_INFO (n, root)
3093 tree decl = n->context;
3097 (void) get_frame_type (n);
3099 (void) get_chain_decl (n);
3101 else if (!n->outer || (!n->chain_decl && !n->chain_field))
3103 DECL_STATIC_CHAIN (decl) = 0;
3104 if (dump_file && (dump_flags & TDF_DETAILS))
3105 fprintf (dump_file, "Guessing no static-chain for %s\n",
3106 lang_hooks.decl_printable_name (decl, 2));
3109 DECL_STATIC_CHAIN (decl) = 1;
3110 chain_count += DECL_STATIC_CHAIN (decl);
3113 FOR_EACH_NEST_INFO (n, root)
3116 tree decl = n->context;
3117 tree alias = thunk_info::get (cgraph_node::get (decl))->alias;
3118 DECL_STATIC_CHAIN (decl) = DECL_STATIC_CHAIN (alias);
3121 /* Walk the functions and perform transformations. Note that these
3122 transformations can induce new uses of the static chain, which in turn
3123 require re-examining all users of the decl. */
3124 /* ??? It would make sense to try to use the call graph to speed this up,
3125 but the call graph hasn't really been built yet. Even if it did, we
3126 would still need to iterate in this loop since address-of references
3127 wouldn't show up in the callgraph anyway. */
3131 old_chain_count = chain_count;
3135 if (dump_file && (dump_flags & TDF_DETAILS))
3136 fputc ('\n', dump_file);
3138 FOR_EACH_NEST_INFO (n, root)
3142 tree decl = n->context;
3143 walk_function (convert_tramp_reference_stmt,
3144 convert_tramp_reference_op, n);
3145 walk_function (convert_gimple_call, NULL, n);
3146 chain_count += DECL_STATIC_CHAIN (decl);
3149 FOR_EACH_NEST_INFO (n, root)
3152 tree decl = n->context;
3153 tree alias = thunk_info::get (cgraph_node::get (decl))->alias;
3154 DECL_STATIC_CHAIN (decl) = DECL_STATIC_CHAIN (alias);
3157 while (chain_count != old_chain_count);
3159 if (dump_file && (dump_flags & TDF_DETAILS))
3160 fprintf (dump_file, "convert_all_function_calls iterations: %u\n\n",
3164 struct nesting_copy_body_data
3167 struct nesting_info *root;
3170 /* A helper subroutine for debug_var_chain type remapping. */
3173 nesting_copy_decl (tree decl, copy_body_data *id)
3175 struct nesting_copy_body_data *nid = (struct nesting_copy_body_data *) id;
3176 tree *slot = nid->root->var_map->get (decl);
3179 return (tree) *slot;
3181 if (TREE_CODE (decl) == TYPE_DECL && DECL_ORIGINAL_TYPE (decl))
3183 tree new_decl = copy_decl_no_change (decl, id);
3184 DECL_ORIGINAL_TYPE (new_decl)
3185 = remap_type (DECL_ORIGINAL_TYPE (decl), id);
3190 || TREE_CODE (decl) == PARM_DECL
3191 || TREE_CODE (decl) == RESULT_DECL)
3194 return copy_decl_no_change (decl, id);
3197 /* A helper function for remap_vla_decls. See if *TP contains
3198 some remapped variables. */
3201 contains_remapped_vars (tree *tp, int *walk_subtrees, void *data)
3203 struct nesting_info *root = (struct nesting_info *) data;
3209 tree *slot = root->var_map->get (t);
3217 /* Remap VLA decls in BLOCK and subblocks if remapped variables are
3221 remap_vla_decls (tree block, struct nesting_info *root)
3223 tree var, subblock, val, type;
3224 struct nesting_copy_body_data id;
3226 for (subblock = BLOCK_SUBBLOCKS (block);
3228 subblock = BLOCK_CHAIN (subblock))
3229 remap_vla_decls (subblock, root);
3231 for (var = BLOCK_VARS (block); var; var = DECL_CHAIN (var))
3232 if (VAR_P (var) && DECL_HAS_VALUE_EXPR_P (var))
3234 val = DECL_VALUE_EXPR (var);
3235 type = TREE_TYPE (var);
3237 if (!(TREE_CODE (val) == INDIRECT_REF
3238 && TREE_CODE (TREE_OPERAND (val, 0)) == VAR_DECL
3239 && variably_modified_type_p (type, NULL)))
3242 if (root->var_map->get (TREE_OPERAND (val, 0))
3243 || walk_tree (&type, contains_remapped_vars, root, NULL))
3247 if (var == NULL_TREE)
3250 memset (&id, 0, sizeof (id));
3251 id.cb.copy_decl = nesting_copy_decl;
3252 id.cb.decl_map = new hash_map<tree, tree>;
3255 for (; var; var = DECL_CHAIN (var))
3256 if (VAR_P (var) && DECL_HAS_VALUE_EXPR_P (var))
3258 struct nesting_info *i;
3261 val = DECL_VALUE_EXPR (var);
3262 type = TREE_TYPE (var);
3264 if (!(TREE_CODE (val) == INDIRECT_REF
3265 && TREE_CODE (TREE_OPERAND (val, 0)) == VAR_DECL
3266 && variably_modified_type_p (type, NULL)))
3269 tree *slot = root->var_map->get (TREE_OPERAND (val, 0));
3270 if (!slot && !walk_tree (&type, contains_remapped_vars, root, NULL))
3273 context = decl_function_context (var);
3274 for (i = root; i; i = i->outer)
3275 if (i->context == context)
3281 /* Fully expand value expressions. This avoids having debug variables
3282 only referenced from them and that can be swept during GC. */
3285 tree t = (tree) *slot;
3286 gcc_assert (DECL_P (t) && DECL_HAS_VALUE_EXPR_P (t));
3287 val = build1 (INDIRECT_REF, TREE_TYPE (val), DECL_VALUE_EXPR (t));
3290 id.cb.src_fn = i->context;
3291 id.cb.dst_fn = i->context;
3292 id.cb.src_cfun = DECL_STRUCT_FUNCTION (root->context);
3294 TREE_TYPE (var) = newt = remap_type (type, &id.cb);
3295 while (POINTER_TYPE_P (newt) && !TYPE_NAME (newt))
3297 newt = TREE_TYPE (newt);
3298 type = TREE_TYPE (type);
3300 if (TYPE_NAME (newt)
3301 && TREE_CODE (TYPE_NAME (newt)) == TYPE_DECL
3302 && DECL_ORIGINAL_TYPE (TYPE_NAME (newt))
3304 && TYPE_NAME (newt) == TYPE_NAME (type))
3305 TYPE_NAME (newt) = remap_decl (TYPE_NAME (newt), &id.cb);
3307 walk_tree (&val, copy_tree_body_r, &id.cb, NULL);
3308 if (val != DECL_VALUE_EXPR (var))
3309 SET_DECL_VALUE_EXPR (var, val);
3312 delete id.cb.decl_map;
3315 /* Fixup VLA decls in BLOCK and subblocks if remapped variables are
3319 fixup_vla_decls (tree block)
3321 for (tree var = BLOCK_VARS (block); var; var = DECL_CHAIN (var))
3322 if (VAR_P (var) && DECL_HAS_VALUE_EXPR_P (var))
3324 tree val = DECL_VALUE_EXPR (var);
3326 if (!(TREE_CODE (val) == INDIRECT_REF
3327 && VAR_P (TREE_OPERAND (val, 0))
3328 && DECL_HAS_VALUE_EXPR_P (TREE_OPERAND (val, 0))))
3331 /* Fully expand value expressions. This avoids having debug variables
3332 only referenced from them and that can be swept during GC. */
3333 val = build1 (INDIRECT_REF, TREE_TYPE (val),
3334 DECL_VALUE_EXPR (TREE_OPERAND (val, 0)));
3335 SET_DECL_VALUE_EXPR (var, val);
3338 for (tree sub = BLOCK_SUBBLOCKS (block); sub; sub = BLOCK_CHAIN (sub))
3339 fixup_vla_decls (sub);
3342 /* Fold the MEM_REF *E. */
3344 fold_mem_refs (tree *const &e, void *data ATTRIBUTE_UNUSED)
3346 tree *ref_p = CONST_CAST2 (tree *, const tree *, (const tree *)e);
3347 *ref_p = fold (*ref_p);
3351 /* Given DECL, a nested function, build an initialization call for FIELD,
3352 the trampoline or descriptor for DECL, using FUNC as the function. */
3355 build_init_call_stmt (struct nesting_info *info, tree decl, tree field,
3358 tree arg1, arg2, arg3, x;
3360 gcc_assert (DECL_STATIC_CHAIN (decl));
3361 arg3 = build_addr (info->frame_decl);
3363 arg2 = build_addr (decl);
3365 x = build3 (COMPONENT_REF, TREE_TYPE (field),
3366 info->frame_decl, field, NULL_TREE);
3367 arg1 = build_addr (x);
3369 return gimple_build_call (func, 3, arg1, arg2, arg3);
3372 /* Do "everything else" to clean up or complete state collected by the various
3373 walking passes -- create a field to hold the frame base address, lay out the
3374 types and decls, generate code to initialize the frame decl, store critical
3375 expressions in the struct function for rtl to find. */
3378 finalize_nesting_tree_1 (struct nesting_info *root)
3380 gimple_seq stmt_list = NULL;
3382 tree context = root->context;
3383 struct function *sf;
3388 /* If we created a non-local frame type or decl, we need to lay them
3389 out at this time. */
3390 if (root->frame_type)
3392 /* Debugging information needs to compute the frame base address of the
3393 parent frame out of the static chain from the nested frame.
3395 The static chain is the address of the FRAME record, so one could
3396 imagine it would be possible to compute the frame base address just
3397 adding a constant offset to this address. Unfortunately, this is not
3398 possible: if the FRAME object has alignment constraints that are
3399 stronger than the stack, then the offset between the frame base and
3400 the FRAME object will be dynamic.
3402 What we do instead is to append a field to the FRAME object that holds
3403 the frame base address: then debug info just has to fetch this
3406 /* Debugging information will refer to the CFA as the frame base
3407 address: we will do the same here. */
3408 const tree frame_addr_fndecl
3409 = builtin_decl_explicit (BUILT_IN_DWARF_CFA);
3411 /* Create a field in the FRAME record to hold the frame base address for
3412 this stack frame. Since it will be used only by the debugger, put it
3413 at the end of the record in order not to shift all other offsets. */
3414 tree fb_decl = make_node (FIELD_DECL);
3416 DECL_NAME (fb_decl) = get_identifier ("FRAME_BASE.PARENT");
3417 TREE_TYPE (fb_decl) = ptr_type_node;
3418 TREE_ADDRESSABLE (fb_decl) = 1;
3419 DECL_CONTEXT (fb_decl) = root->frame_type;
3420 TYPE_FIELDS (root->frame_type) = chainon (TYPE_FIELDS (root->frame_type),
3423 /* In some cases the frame type will trigger the -Wpadded warning.
3424 This is not helpful; suppress it. */
3425 int save_warn_padded = warn_padded;
3427 layout_type (root->frame_type);
3428 warn_padded = save_warn_padded;
3429 layout_decl (root->frame_decl, 0);
3431 /* Initialize the frame base address field. If the builtin we need is
3432 not available, set it to NULL so that debugging information does not
3434 tree fb_ref = build3 (COMPONENT_REF, TREE_TYPE (fb_decl),
3435 root->frame_decl, fb_decl, NULL_TREE);
3438 if (frame_addr_fndecl != NULL_TREE)
3440 gcall *fb_gimple = gimple_build_call (frame_addr_fndecl, 1,
3442 gimple_stmt_iterator gsi = gsi_last (stmt_list);
3444 fb_tmp = init_tmp_var_with_call (root, &gsi, fb_gimple);
3447 fb_tmp = build_int_cst (TREE_TYPE (fb_ref), 0);
3448 gimple_seq_add_stmt (&stmt_list,
3449 gimple_build_assign (fb_ref, fb_tmp));
3451 declare_vars (root->frame_decl,
3452 gimple_seq_first_stmt (gimple_body (context)), true);
3455 /* If any parameters were referenced non-locally, then we need to insert
3456 a copy or a pointer. */
3457 if (root->any_parm_remapped)
3460 for (p = DECL_ARGUMENTS (context); p ; p = DECL_CHAIN (p))
3464 field = lookup_field_for_decl (root, p, NO_INSERT);
3468 if (use_pointer_in_frame (p))
3473 /* If the assignment is from a non-register the stmt is
3474 not valid gimple. Make it so by using a temporary instead. */
3475 if (!is_gimple_reg (x)
3476 && is_gimple_reg_type (TREE_TYPE (x)))
3478 gimple_stmt_iterator gsi = gsi_last (stmt_list);
3479 x = init_tmp_var (root, x, &gsi);
3482 y = build3 (COMPONENT_REF, TREE_TYPE (field),
3483 root->frame_decl, field, NULL_TREE);
3484 stmt = gimple_build_assign (y, x);
3485 gimple_seq_add_stmt (&stmt_list, stmt);
3489 /* If a chain_field was created, then it needs to be initialized
3491 if (root->chain_field)
3493 tree x = build3 (COMPONENT_REF, TREE_TYPE (root->chain_field),
3494 root->frame_decl, root->chain_field, NULL_TREE);
3495 stmt = gimple_build_assign (x, get_chain_decl (root));
3496 gimple_seq_add_stmt (&stmt_list, stmt);
3499 /* If trampolines were created, then we need to initialize them. */
3500 if (root->any_tramp_created)
3502 struct nesting_info *i;
3503 for (i = root->inner; i ; i = i->next)
3507 field = lookup_tramp_for_decl (root, i->context, NO_INSERT);
3511 x = builtin_decl_implicit (BUILT_IN_INIT_TRAMPOLINE);
3512 stmt = build_init_call_stmt (root, i->context, field, x);
3513 gimple_seq_add_stmt (&stmt_list, stmt);
3517 /* If descriptors were created, then we need to initialize them. */
3518 if (root->any_descr_created)
3520 struct nesting_info *i;
3521 for (i = root->inner; i ; i = i->next)
3525 field = lookup_descr_for_decl (root, i->context, NO_INSERT);
3529 x = builtin_decl_implicit (BUILT_IN_INIT_DESCRIPTOR);
3530 stmt = build_init_call_stmt (root, i->context, field, x);
3531 gimple_seq_add_stmt (&stmt_list, stmt);
3535 /* If we created initialization statements, insert them. */
3539 annotate_all_with_location (stmt_list, DECL_SOURCE_LOCATION (context));
3540 bind = gimple_seq_first_stmt_as_a_bind (gimple_body (context));
3541 gimple_seq_add_seq (&stmt_list, gimple_bind_body (bind));
3542 gimple_bind_set_body (bind, stmt_list);
3545 /* If a chain_decl was created, then it needs to be registered with
3546 struct function so that it gets initialized from the static chain
3547 register at the beginning of the function. */
3548 sf = DECL_STRUCT_FUNCTION (root->context);
3549 sf->static_chain_decl = root->chain_decl;
3551 /* Similarly for the non-local goto save area. */
3552 if (root->nl_goto_field)
3554 sf->nonlocal_goto_save_area
3555 = get_frame_field (root, context, root->nl_goto_field, NULL);
3556 sf->has_nonlocal_label = 1;
3559 /* Make sure all new local variables get inserted into the
3560 proper BIND_EXPR. */
3561 if (root->new_local_var_chain)
3562 declare_vars (root->new_local_var_chain,
3563 gimple_seq_first_stmt (gimple_body (root->context)),
3566 if (root->debug_var_chain)
3571 remap_vla_decls (DECL_INITIAL (root->context), root);
3573 for (debug_var = root->debug_var_chain; debug_var;
3574 debug_var = DECL_CHAIN (debug_var))
3575 if (variably_modified_type_p (TREE_TYPE (debug_var), NULL))
3578 /* If there are any debug decls with variable length types,
3579 remap those types using other debug_var_chain variables. */
3582 struct nesting_copy_body_data id;
3584 memset (&id, 0, sizeof (id));
3585 id.cb.copy_decl = nesting_copy_decl;
3586 id.cb.decl_map = new hash_map<tree, tree>;
3589 for (; debug_var; debug_var = DECL_CHAIN (debug_var))
3590 if (variably_modified_type_p (TREE_TYPE (debug_var), NULL))
3592 tree type = TREE_TYPE (debug_var);
3593 tree newt, t = type;
3594 struct nesting_info *i;
3596 for (i = root; i; i = i->outer)
3597 if (variably_modified_type_p (type, i->context))
3603 id.cb.src_fn = i->context;
3604 id.cb.dst_fn = i->context;
3605 id.cb.src_cfun = DECL_STRUCT_FUNCTION (root->context);
3607 TREE_TYPE (debug_var) = newt = remap_type (type, &id.cb);
3608 while (POINTER_TYPE_P (newt) && !TYPE_NAME (newt))
3610 newt = TREE_TYPE (newt);
3613 if (TYPE_NAME (newt)
3614 && TREE_CODE (TYPE_NAME (newt)) == TYPE_DECL
3615 && DECL_ORIGINAL_TYPE (TYPE_NAME (newt))
3617 && TYPE_NAME (newt) == TYPE_NAME (t))
3618 TYPE_NAME (newt) = remap_decl (TYPE_NAME (newt), &id.cb);
3621 delete id.cb.decl_map;
3624 scope = gimple_seq_first_stmt_as_a_bind (gimple_body (root->context));
3625 if (gimple_bind_block (scope))
3626 declare_vars (root->debug_var_chain, scope, true);
3628 BLOCK_VARS (DECL_INITIAL (root->context))
3629 = chainon (BLOCK_VARS (DECL_INITIAL (root->context)),
3630 root->debug_var_chain);
3633 fixup_vla_decls (DECL_INITIAL (root->context));
3635 /* Fold the rewritten MEM_REF trees. */
3636 root->mem_refs->traverse<void *, fold_mem_refs> (NULL);
3638 /* Dump the translated tree function. */
3641 fputs ("\n\n", dump_file);
3642 dump_function_to_file (root->context, dump_file, dump_flags);
3647 finalize_nesting_tree (struct nesting_info *root)
3649 struct nesting_info *n;
3650 FOR_EACH_NEST_INFO (n, root)
3651 finalize_nesting_tree_1 (n);
3654 /* Unnest the nodes and pass them to cgraph. */
3657 unnest_nesting_tree_1 (struct nesting_info *root)
3659 struct cgraph_node *node = cgraph_node::get (root->context);
3661 /* For nested functions update the cgraph to reflect unnesting.
3662 We also delay finalizing of these functions up to this point. */
3663 if (nested_function_info::get (node)->origin)
3665 unnest_function (node);
3667 cgraph_node::finalize_function (root->context, true);
3672 unnest_nesting_tree (struct nesting_info *root)
3674 struct nesting_info *n;
3675 FOR_EACH_NEST_INFO (n, root)
3676 unnest_nesting_tree_1 (n);
3679 /* Free the data structures allocated during this pass. */
3682 free_nesting_tree (struct nesting_info *root)
3684 struct nesting_info *node, *next;
3686 node = iter_nestinfo_start (root);
3689 next = iter_nestinfo_next (node);
3690 delete node->var_map;
3691 delete node->field_map;
3692 delete node->mem_refs;
3699 /* Gimplify a function and all its nested functions. */
3701 gimplify_all_functions (struct cgraph_node *root)
3703 struct cgraph_node *iter;
3704 if (!gimple_body (root->decl))
3705 gimplify_function_tree (root->decl);
3706 for (iter = first_nested_function (root); iter;
3707 iter = next_nested_function (iter))
3709 gimplify_all_functions (iter);
3712 /* Main entry point for this pass. Process FNDECL and all of its nested
3713 subroutines and turn them into something less tightly bound. */
3716 lower_nested_functions (tree fndecl)
3718 struct cgraph_node *cgn;
3719 struct nesting_info *root;
3721 /* If there are no nested functions, there's nothing to do. */
3722 cgn = cgraph_node::get (fndecl);
3723 if (!first_nested_function (cgn))
3726 gimplify_all_functions (cgn);
3728 set_dump_file (dump_begin (TDI_nested, &dump_flags));
3730 fprintf (dump_file, "\n;; Function %s\n\n",
3731 lang_hooks.decl_printable_name (fndecl, 2));
3733 bitmap_obstack_initialize (&nesting_info_bitmap_obstack);
3734 root = create_nesting_tree (cgn);
3736 walk_all_functions (convert_nonlocal_reference_stmt,
3737 convert_nonlocal_reference_op,
3739 walk_all_functions (convert_local_reference_stmt,
3740 convert_local_reference_op,
3742 walk_all_functions (convert_nl_goto_reference, NULL, root);
3743 walk_all_functions (convert_nl_goto_receiver, NULL, root);
3745 convert_all_function_calls (root);
3746 finalize_nesting_tree (root);
3747 unnest_nesting_tree (root);
3749 free_nesting_tree (root);
3750 bitmap_obstack_release (&nesting_info_bitmap_obstack);
3754 dump_end (TDI_nested, dump_file);
3755 set_dump_file (NULL);
3759 #include "gt-tree-nested.h"