Commit 96cdd379 by Yannick Moy Committed by Pierre-Marie de Rodat

[Ada] Complete the more extended AST traversal used in GNATprove

Following the work on the Ada 202X feature of iterated aggregates
(AI12-061), Loop_Actions should have been listed as a semantic field of
nodes of kind N_Iterated_Component_Association.  Fix this as well as the
new extended AST traversal which should traverse these fields.

There is no impact on compilation.

2019-08-13  Yannick Moy  <moy@adacore.com>

gcc/ada/

	* sem_util.adb (Traverse_More_Func): Take into account
	Loop_Actions inside N_Iterated_Component_Association nodes.
	* sinfo.ads: Document correctly Loop_Actions as a field of nodes
	of kind N_Iterated_Component_Association.

From-SVN: r274332
parent dfa6d55a
2019-08-13 Yannick Moy <moy@adacore.com>
* sem_util.adb (Traverse_More_Func): Take into account
Loop_Actions inside N_Iterated_Component_Association nodes.
* sinfo.ads: Document correctly Loop_Actions as a field of nodes
of kind N_Iterated_Component_Association.
2019-08-13 Claire Dross <dross@adacore.com> 2019-08-13 Claire Dross <dross@adacore.com>
* libgnat/a-cfinve.adb, libgnat/a-cofove.adb (Find_Index, * libgnat/a-cfinve.adb, libgnat/a-cofove.adb (Find_Index,
......
...@@ -25580,6 +25580,9 @@ package body Sem_Util is ...@@ -25580,6 +25580,9 @@ package body Sem_Util is
when N_Case_Expression_Alternative => when N_Case_Expression_Alternative =>
Traverse_More (Actions (Node), Result); Traverse_More (Actions (Node), Result);
when N_Iterated_Component_Association =>
Traverse_More (Loop_Actions (Node), Result);
when N_Iteration_Scheme => when N_Iteration_Scheme =>
Traverse_More (Condition_Actions (Node), Result); Traverse_More (Condition_Actions (Node), Result);
......
...@@ -11959,7 +11959,7 @@ package Sinfo is ...@@ -11959,7 +11959,7 @@ package Sinfo is
N_Iterated_Component_Association => N_Iterated_Component_Association =>
(1 => True, -- Defining_Identifier (Node1) (1 => True, -- Defining_Identifier (Node1)
2 => False, -- unused 2 => True, -- Loop_Actions (List2-Sem)
3 => True, -- Expression (Node3) 3 => True, -- Expression (Node3)
4 => True, -- Discrete_Choices (List4) 4 => True, -- Discrete_Choices (List4)
5 => False), -- unused 5 => False), -- unused
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment