1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
28 Enclosing_Body_Or_Block : Node_Id;
29 -- Innermost enclosing body or block statement
31 Label_Decl_Node : Node_Id;
32 -- Implicit label declaration node
34 Defining_Ident_Node : Node_Id;
35 -- Defining identifier node for implicit label declaration
37 Next_Label_Elmt : Elmt_Id;
38 -- Next element on label element list
41 -- Next label node to process
43 function Find_Enclosing_Body_Or_Block (N : Node_Id) return Node_Id;
44 -- Find the innermost body or block that encloses N
46 function Find_Enclosing_Body (N : Node_Id) return Node_Id;
47 -- Find the innermost body that encloses N
49 procedure Check_Distinct_Labels;
50 -- Checks the rule in RM-5.1(11), which requires distinct identifiers
51 -- for all the labels in a given body.
53 procedure Find_Natural_Loops;
54 -- Recognizes loops created by backward gotos, and rewrites the
55 -- corresponding statements into a proper loop, for optimization
56 -- purposes (for example, to control reclaiming local storage).
58 ---------------------------
59 -- Check_Distinct_Labels --
60 ---------------------------
62 procedure Check_Distinct_Labels is
63 Label_Id : constant Node_Id := Identifier (Label_Node);
65 Enclosing_Body : constant Node_Id :=
66 Find_Enclosing_Body (Enclosing_Body_Or_Block);
67 -- Innermost enclosing body
69 Next_Other_Label_Elmt : Elmt_Id := First_Elmt (Label_List);
70 -- Next element on label element list
72 Other_Label : Node_Id;
73 -- Next label node to process
76 -- Loop through all the labels, and if we find some other label
77 -- (i.e. not Label_Node) that has the same identifier,
78 -- and whose innermost enclosing body is the same,
79 -- then we have an error.
81 -- Note that in the worst case, this is quadratic in the number
82 -- of labels. However, labels are not all that common, and this
83 -- is only called for explicit labels.
85 -- ???Nonetheless, the efficiency could be improved. For example,
86 -- call Labl for each body, rather than once per compilation.
88 while Present (Next_Other_Label_Elmt) loop
89 Other_Label := Node (Next_Other_Label_Elmt);
91 exit when Label_Node = Other_Label;
93 if Chars (Label_Id) = Chars (Identifier (Other_Label))
94 and then Enclosing_Body = Find_Enclosing_Body (Other_Label)
96 Error_Msg_Sloc := Sloc (Other_Label);
97 Error_Msg_N ("& conflicts with label#", Label_Id);
101 Next_Elmt (Next_Other_Label_Elmt);
103 end Check_Distinct_Labels;
105 -------------------------
106 -- Find_Enclosing_Body --
107 -------------------------
109 function Find_Enclosing_Body (N : Node_Id) return Node_Id is
110 Result : Node_Id := N;
113 -- This is the same as Find_Enclosing_Body_Or_Block, except
114 -- that we skip block statements and accept statements, instead
115 -- of stopping at them.
117 while Present (Result)
118 and then Nkind (Result) /= N_Entry_Body
119 and then Nkind (Result) /= N_Task_Body
120 and then Nkind (Result) /= N_Package_Body
121 and then Nkind (Result) /= N_Subprogram_Body
123 Result := Parent (Result);
127 end Find_Enclosing_Body;
129 ----------------------------------
130 -- Find_Enclosing_Body_Or_Block --
131 ----------------------------------
133 function Find_Enclosing_Body_Or_Block (N : Node_Id) return Node_Id is
134 Result : Node_Id := Parent (N);
137 -- Climb up the parent chain until we find a body or block
139 while Present (Result)
140 and then Nkind (Result) /= N_Accept_Statement
141 and then Nkind (Result) /= N_Entry_Body
142 and then Nkind (Result) /= N_Task_Body
143 and then Nkind (Result) /= N_Package_Body
144 and then Nkind (Result) /= N_Subprogram_Body
145 and then Nkind (Result) /= N_Block_Statement
147 Result := Parent (Result);
151 end Find_Enclosing_Body_Or_Block;
153 ------------------------
154 -- Find_Natural_Loops --
155 ------------------------
157 procedure Find_Natural_Loops is
158 Node_List : constant Elist_Id := New_Elmt_List;
162 function Goto_Id (Goto_Node : Node_Id) return Name_Id;
163 -- Find Name_Id of goto statement, which may be an expanded name
166 (Label_Node : Node_Id;
167 Goto_Node : Node_Id) return Boolean;
168 -- A label and a goto are candidates for a loop if the names match,
169 -- and both nodes appear in the same body. In addition, both must
170 -- appear in the same statement list. If they are not in the same
171 -- statement list, the goto is from within an nested structure, and
172 -- the label is not a header. We ignore the case where the goto is
173 -- within a conditional structure, and capture only infinite loops.
176 -- Merge labels and goto statements in order of increasing sloc value.
177 -- Discard labels of loop and block statements.
179 procedure No_Header (N : Elmt_Id);
180 -- The label N is known not to be a loop header. Scan forward and
181 -- remove all subsequent gotos that may have this node as a target.
183 procedure Process_Goto (N : Elmt_Id);
184 -- N is a forward jump. Scan forward and remove all subsequent gotos
185 -- that may have the same target, to preclude spurious loops.
187 procedure Rewrite_As_Loop
188 (Loop_Header : Node_Id;
190 -- Given a label and a backwards goto, rewrite intervening statements
191 -- as a loop. Remove the label from the node list, and rewrite the
192 -- goto with the body of the new loop.
194 procedure Try_Loop (N : Elmt_Id);
195 -- N is a label that may be a loop header. Scan forward to find some
196 -- backwards goto with which to make a loop. Do nothing if there is
197 -- an intervening label that is not part of a loop, or more than one
198 -- goto with this target.
204 function Goto_Id (Goto_Node : Node_Id) return Name_Id is
206 if Nkind (Name (Goto_Node)) = N_Identifier then
207 return Chars (Name (Goto_Node));
209 elsif Nkind (Name (Goto_Node)) = N_Selected_Component then
210 return Chars (Selector_Name (Name (Goto_Node)));
213 -- In case of error, return Id that can't match anything
224 (Label_Node : Node_Id;
225 Goto_Node : Node_Id) return Boolean
228 return Chars (Identifier (Label_Node)) = Goto_Id (Goto_Node)
229 and then Find_Enclosing_Body (Label_Node) =
230 Find_Enclosing_Body (Goto_Node);
242 L1 := First_Elmt (Label_List);
243 G1 := First_Elmt (Goto_List);
246 and then Present (G1)
248 if Sloc (Node (L1)) < Sloc (Node (G1)) then
250 -- Optimization: remove labels of loops and blocks, which
251 -- play no role in what follows.
253 if Nkind (Node (L1)) /= N_Loop_Statement
254 and then Nkind (Node (L1)) /= N_Block_Statement
256 Append_Elmt (Node (L1), Node_List);
262 Append_Elmt (Node (G1), Node_List);
267 while Present (L1) loop
268 Append_Elmt (Node (L1), Node_List);
272 while Present (G1) loop
273 Append_Elmt (Node (G1), Node_List);
282 procedure No_Header (N : Elmt_Id) is
287 while Present (S1) loop
288 S2 := Next_Elmt (S1);
289 if Nkind (Node (S1)) = N_Goto_Statement
290 and then Matches (Node (N), Node (S1))
292 Remove_Elmt (Node_List, S1);
303 procedure Process_Goto (N : Elmt_Id) is
304 Goto1 : constant Node_Id := Node (N);
311 while Present (S) loop
315 if Nkind (Goto2) = N_Goto_Statement
316 and then Goto_Id (Goto1) = Goto_Id (Goto2)
317 and then Find_Enclosing_Body (Goto1) =
318 Find_Enclosing_Body (Goto2)
321 -- Goto2 may have the same target, remove it from
324 Remove_Elmt (Node_List, S);
331 ---------------------
332 -- Rewrite_As_Loop --
333 ---------------------
335 procedure Rewrite_As_Loop
336 (Loop_Header : Node_Id;
339 Loop_Body : constant List_Id := New_List;
340 Loop_Stmt : constant Node_Id :=
341 New_Node (N_Loop_Statement, Sloc (Loop_Header));
346 Stat := Next (Loop_Header);
347 while Stat /= Loop_End loop
348 Next_Stat := Next (Stat);
350 Append (Stat, Loop_Body);
354 Set_Statements (Loop_Stmt, Loop_Body);
355 Set_Identifier (Loop_Stmt, Identifier (Loop_Header));
357 Remove (Loop_Header);
358 Rewrite (Loop_End, Loop_Stmt);
360 ("info: code between label and backwards goto rewritten as loop??",
368 procedure Try_Loop (N : Elmt_Id) is
370 Found : Boolean := False;
375 while Present (S1) loop
376 if Nkind (Node (S1)) = N_Goto_Statement
377 and then Matches (Node (N), Node (S1))
381 -- If the label and the goto are both in the same statement
382 -- list, then we've found a loop. Note that labels and goto
383 -- statements are always part of some list, so In_Same_List
384 -- always makes sense.
386 if In_Same_List (Node (N), Node (S1)) then
390 -- The goto is within some nested structure
398 -- More than one goto with the same target
404 elsif Nkind (Node (S1)) = N_Label
407 -- Intervening label before possible end of loop. Current
408 -- label is not a candidate. This is conservative, because
409 -- the label might not be the target of any jumps, but not
410 -- worth dealing with useless labels.
416 -- If the node is a loop_statement, it corresponds to a
417 -- label-goto pair rewritten as a loop. Continue forward scan.
426 Rewrite_As_Loop (Node (N), Node (Source));
427 Remove_Elmt (Node_List, N);
428 Remove_Elmt (Node_List, Source);
433 -- Start of processing for Find_Natural_Loops
437 N := First_Elmt (Node_List);
438 while Present (N) loop
439 Succ := Next_Elmt (N);
441 if Nkind (Node (N)) = N_Label then
445 elsif Nkind (Node (Succ)) = N_Label then
448 -- If a loop was found, the label has been removed, and
449 -- the following goto rewritten as the loop body.
451 Succ := Next_Elmt (N);
453 if Nkind (Node (Succ)) = N_Label then
455 -- Following label was not removed, so current label
456 -- is not a candidate header.
462 -- Following label was part of inner loop. Current
463 -- label is still a candidate.
466 Succ := Next_Elmt (N);
469 elsif Nkind (Node (Succ)) = N_Goto_Statement then
471 Succ := Next_Elmt (N);
474 elsif Nkind (Node (N)) = N_Goto_Statement then
476 Succ := Next_Elmt (N);
481 end Find_Natural_Loops;
483 -- Start of processing for Par.Labl
486 Next_Label_Elmt := First_Elmt (Label_List);
487 while Present (Next_Label_Elmt) loop
488 Label_Node := Node (Next_Label_Elmt);
490 if not Comes_From_Source (Label_Node) then
494 -- Find the innermost enclosing body or block, which is where
495 -- we need to implicitly declare this label
497 Enclosing_Body_Or_Block := Find_Enclosing_Body_Or_Block (Label_Node);
499 -- If we didn't find a parent, then the label in question never got
500 -- hooked into a reasonable declarative part. This happens only in
501 -- error situations, and we simply ignore the entry (we aren't going
502 -- to get into the semantics in any case given the error).
504 if Present (Enclosing_Body_Or_Block) then
505 Check_Distinct_Labels;
507 -- Now create the implicit label declaration node and its
508 -- corresponding defining identifier. Note that the defining
509 -- occurrence of a label is the implicit label declaration that
510 -- we are creating. The label itself is an applied occurrence.
513 New_Node (N_Implicit_Label_Declaration, Sloc (Label_Node));
514 Defining_Ident_Node :=
515 New_Entity (N_Defining_Identifier, Sloc (Identifier (Label_Node)));
516 Set_Chars (Defining_Ident_Node, Chars (Identifier (Label_Node)));
517 Set_Defining_Identifier (Label_Decl_Node, Defining_Ident_Node);
518 Set_Label_Construct (Label_Decl_Node, Label_Node);
520 -- The following makes sure that Comes_From_Source is appropriately
521 -- set for the entity, depending on whether the label appeared in
522 -- the source explicitly or not.
524 Set_Comes_From_Source
525 (Defining_Ident_Node, Comes_From_Source (Identifier (Label_Node)));
527 -- Now attach the implicit label declaration to the appropriate
528 -- declarative region, creating a declaration list if none exists
530 if No (Declarations (Enclosing_Body_Or_Block)) then
531 Set_Declarations (Enclosing_Body_Or_Block, New_List);
534 Append (Label_Decl_Node, Declarations (Enclosing_Body_Or_Block));
538 Next_Elmt (Next_Label_Elmt);