From 2508b2be4d58ae29cc0093688c50fefea15f6934 Mon Sep 17 00:00:00 2001
From: Pierre-Marie de Rodat <derodat@adacore.com>
Date: Fri, 23 Sep 2016 18:16:07 +0200
Subject: [PATCH] DWARF: fix scoping for descriptions of local types
In Ada, it is possible to have nested subprograms in the following
configuration:
procedure Parent is
type T;
[...]
procedure Child (Value : T) is
begin
[...]
end Child;
begin
[...]
end Parent;
As we currently generate debugging information for Child first before
Parent, the debug info for T appears in global scope since the DIE for
Parent does not exist yet.
First, this patch makes sure nested function cgraph_node's are created
after their parents'. Then, it reverses the iteration on the symbol
table that calls the early_global_decl debug hook so that debug info for
nested functions is generated after their parents'.
gcc/ChangeLog:
* cgraph.h (symbol_table::last_function_with_gimple_body,
symbol_table::previous_function_with_gimple_body): New methods.
(REVERSE_FOR_EACH_FUNCTION_WITH_GIMPLE_BODY): New iteration macro.
* cgraph.c (symbol_table::call_cgraph_duplication_hooks): Adjust so
that nested functions have their cgraph_node created after their
parents'.
* cgraphunit.c (symbol_table::finalize_compilation_unit): Call the
early_global_decl debug hook on last functions in the symtab list (i.e.
older ones first).
gcc/testsuite/
* gcc/testsuite/g++.dg/debug/dwarf2/auto1.C: Adjust pattern to
accomodate new DIEs output order.
---
gcc/cgraph.c | 12 ++++++++--
gcc/cgraph.h | 40 +++++++++++++++++++++++++++++++
gcc/cgraphunit.c | 5 ++--
gcc/testsuite/g++.dg/debug/dwarf2/auto1.C | 2 +-
4 files changed, 54 insertions(+), 5 deletions(-)
@@ -492,6 +492,14 @@ symbol_table::call_cgraph_duplication_hooks (cgraph_node *node,
cgraph_node *
cgraph_node::create (tree decl)
{
+ cgraph_node *origin = NULL;
+
+ /* If DECL is local to a function, make sure we have a node for this function
+ first so that the symbol table has parent functions created before their
+ children. This helps debug information generation. */
+ if (DECL_CONTEXT (decl) && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)
+ origin = cgraph_node::get_create (DECL_CONTEXT (decl));
+
cgraph_node *node = symtab->create_empty ();
gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
@@ -507,9 +515,9 @@ cgraph_node::create (tree decl)
node->register_symbol ();
- if (DECL_CONTEXT (decl) && TREE_CODE (DECL_CONTEXT (decl)) == FUNCTION_DECL)
+ if (origin != NULL)
{
- node->origin = cgraph_node::get_create (DECL_CONTEXT (decl));
+ node->origin = origin;
node->next_nested = node->origin->nested;
node->origin->nested = node;
}
@@ -2097,6 +2097,13 @@ public:
/* Return next reachable static variable with initializer after NODE. */
inline cgraph_node *next_function_with_gimple_body (cgraph_node *node);
+ /* Return last function with body defined. */
+ cgraph_node *last_function_with_gimple_body (void);
+
+ /* Return previous reachable static variable with initializer before
+ NODE. */
+ inline cgraph_node *previous_function_with_gimple_body (cgraph_node *node);
+
/* Register HOOK to be called with DATA on each removed edge. */
cgraph_edge_hook_list *add_edge_removal_hook (cgraph_edge_hook hook,
void *data);
@@ -2775,6 +2782,36 @@ symbol_table::next_function_with_gimple_body (cgraph_node *node)
return NULL;
}
+/* Return last function with body defined. */
+inline cgraph_node *
+symbol_table::last_function_with_gimple_body (void)
+{
+ cgraph_node *res = NULL;
+ symtab_node *node;
+
+ for (node = nodes; node; node = node->next)
+ {
+ cgraph_node *cn = dyn_cast <cgraph_node *> (node);
+ if (cn && cn->has_gimple_body_p ())
+ res = cn;
+ }
+ return res;
+}
+
+/* Return pverious reachable static variable with initializer before NODE. */
+inline cgraph_node *
+symbol_table::previous_function_with_gimple_body (cgraph_node *node)
+{
+ symtab_node *node1 = node->previous;
+ for (; node1; node1 = node1->previous)
+ {
+ cgraph_node *cn1 = dyn_cast <cgraph_node *> (node1);
+ if (cn1 && cn1->has_gimple_body_p ())
+ return cn1;
+ }
+ return NULL;
+}
+
/* Walk all functions. */
#define FOR_EACH_FUNCTION(node) \
for ((node) = symtab->first_function (); (node); \
@@ -2796,6 +2833,9 @@ cgraph_node::has_gimple_body_p (void)
#define FOR_EACH_FUNCTION_WITH_GIMPLE_BODY(node) \
for ((node) = symtab->first_function_with_gimple_body (); (node); \
(node) = symtab->next_function_with_gimple_body (node))
+#define REVERSE_FOR_EACH_FUNCTION_WITH_GIMPLE_BODY(node) \
+ for ((node) = symtab->last_function_with_gimple_body (); (node); \
+ (node) = symtab->previous_function_with_gimple_body (node))
/* Uniquize all constants that appear in memory.
Each constant in memory thus far output is recorded
@@ -2562,9 +2562,10 @@ symbol_table::finalize_compilation_unit (void)
if (!seen_error ())
{
/* Emit early debug for reachable functions, and by consequence,
- locally scoped symbols. */
+ locally scoped symbols. Process functions in reverse order so that
+ nested functions come after their parents. */
struct cgraph_node *cnode;
- FOR_EACH_FUNCTION_WITH_GIMPLE_BODY (cnode)
+ REVERSE_FOR_EACH_FUNCTION_WITH_GIMPLE_BODY (cnode)
(*debug_hooks->early_global_decl) (cnode->decl);
/* Clean up anything that needs cleaning up after initial debug
@@ -17,7 +17,7 @@
// .long 0x33 # DW_AT_specification
// .long 0x87 # DW_AT_type
-// { dg-final { scan-assembler "a1.*(0x\[0-9a-f]+)\[^\n\r]*DW_AT_type.*\\1. DW_TAG_unspecified_type.*(0x\[0-9a-f]+). DW_TAG_base_type.*DW_AT_specification\[\n\r]{1,2}\[^\n\r]*\\2\[^\n\r]*DW_AT_type" } }
+// { dg-final { scan-assembler "a1.*(0x\[0-9a-f]+)\[^\n\r]*DW_AT_type.*\\1. DW_TAG_unspecified_type.*DW_AT_specification\[\n\r]{1,2}\[^\n\r]*(0x\[0-9a-f]+)\[^\n\r]*DW_AT_type.*\\2. DW_TAG_base_type" } }
struct A
{
--
2.10.0