442e89737edaa593c90713bc51ff91f296dc5b93
[gcc.git] / gcc / ada / sem.adb
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT COMPILER COMPONENTS --
4 -- --
5 -- S E M --
6 -- --
7 -- B o d y --
8 -- --
9 -- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
10 -- --
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. --
20 -- --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
23 -- --
24 ------------------------------------------------------------------------------
25
26 with Atree; use Atree;
27 with Debug; use Debug;
28 with Debug_A; use Debug_A;
29 with Elists; use Elists;
30 with Expander; use Expander;
31 with Fname; use Fname;
32 with Lib; use Lib;
33 with Lib.Load; use Lib.Load;
34 with Nlists; use Nlists;
35 with Output; use Output;
36 with Restrict; use Restrict;
37 with Sem_Attr; use Sem_Attr;
38 with Sem_Aux; use Sem_Aux;
39 with Sem_Ch2; use Sem_Ch2;
40 with Sem_Ch3; use Sem_Ch3;
41 with Sem_Ch4; use Sem_Ch4;
42 with Sem_Ch5; use Sem_Ch5;
43 with Sem_Ch6; use Sem_Ch6;
44 with Sem_Ch7; use Sem_Ch7;
45 with Sem_Ch8; use Sem_Ch8;
46 with Sem_Ch9; use Sem_Ch9;
47 with Sem_Ch10; use Sem_Ch10;
48 with Sem_Ch11; use Sem_Ch11;
49 with Sem_Ch12; use Sem_Ch12;
50 with Sem_Ch13; use Sem_Ch13;
51 with Sem_Prag; use Sem_Prag;
52 with Sem_Util; use Sem_Util;
53 with Sinfo; use Sinfo;
54 with Stand; use Stand;
55 with Uintp; use Uintp;
56 with Uname; use Uname;
57
58 with Unchecked_Deallocation;
59
60 pragma Warnings (Off, Sem_Util);
61 -- Suppress warnings of unused with for Sem_Util (used only in asserts)
62
63 package body Sem is
64
65 Debug_Unit_Walk : Boolean renames Debug_Flag_Dot_WW;
66 -- Controls debugging printouts for Walk_Library_Items
67
68 Outer_Generic_Scope : Entity_Id := Empty;
69 -- Global reference to the outer scope that is generic. In a non-generic
70 -- context, it is empty. At the moment, it is only used for avoiding
71 -- freezing of external references in generics.
72
73 Comp_Unit_List : Elist_Id := No_Elist;
74 -- Used by Walk_Library_Items. This is a list of N_Compilation_Unit nodes
75 -- processed by Semantics, in an appropriate order. Initialized to
76 -- No_Elist, because it's too early to call New_Elmt_List; we will set it
77 -- to New_Elmt_List on first use.
78
79 generic
80 with procedure Action (Withed_Unit : Node_Id);
81 procedure Walk_Withs_Immediate (CU : Node_Id; Include_Limited : Boolean);
82 -- Walk all the with clauses of CU, and call Action for the with'ed unit.
83 -- Ignore limited withs, unless Include_Limited is True. CU must be an
84 -- N_Compilation_Unit.
85
86 generic
87 with procedure Action (Withed_Unit : Node_Id);
88 procedure Walk_Withs (CU : Node_Id; Include_Limited : Boolean);
89 -- Same as Walk_Withs_Immediate, but also include with clauses on subunits
90 -- of this unit, since they count as dependences on their parent library
91 -- item. CU must be an N_Compilation_Unit whose Unit is not an N_Subunit.
92
93 -------------
94 -- Analyze --
95 -------------
96
97 procedure Analyze (N : Node_Id) is
98 begin
99 Debug_A_Entry ("analyzing ", N);
100
101 -- Immediate return if already analyzed
102
103 if Analyzed (N) then
104 Debug_A_Exit ("analyzing ", N, " (done, analyzed already)");
105 return;
106 end if;
107
108 -- Otherwise processing depends on the node kind
109
110 case Nkind (N) is
111
112 when N_Abort_Statement =>
113 Analyze_Abort_Statement (N);
114
115 when N_Abstract_Subprogram_Declaration =>
116 Analyze_Abstract_Subprogram_Declaration (N);
117
118 when N_Accept_Alternative =>
119 Analyze_Accept_Alternative (N);
120
121 when N_Accept_Statement =>
122 Analyze_Accept_Statement (N);
123
124 when N_Aggregate =>
125 Analyze_Aggregate (N);
126
127 when N_Allocator =>
128 Analyze_Allocator (N);
129
130 when N_And_Then =>
131 Analyze_Short_Circuit (N);
132
133 when N_Assignment_Statement =>
134 Analyze_Assignment (N);
135
136 when N_Asynchronous_Select =>
137 Analyze_Asynchronous_Select (N);
138
139 when N_At_Clause =>
140 Analyze_At_Clause (N);
141
142 when N_Attribute_Reference =>
143 Analyze_Attribute (N);
144
145 when N_Attribute_Definition_Clause =>
146 Analyze_Attribute_Definition_Clause (N);
147
148 when N_Block_Statement =>
149 Analyze_Block_Statement (N);
150
151 when N_Case_Expression =>
152 Analyze_Case_Expression (N);
153
154 when N_Case_Statement =>
155 Analyze_Case_Statement (N);
156
157 when N_Character_Literal =>
158 Analyze_Character_Literal (N);
159
160 when N_Code_Statement =>
161 Analyze_Code_Statement (N);
162
163 when N_Compilation_Unit =>
164 Analyze_Compilation_Unit (N);
165
166 when N_Component_Declaration =>
167 Analyze_Component_Declaration (N);
168
169 when N_Compound_Statement =>
170 Analyze_Compound_Statement (N);
171
172 when N_Conditional_Entry_Call =>
173 Analyze_Conditional_Entry_Call (N);
174
175 when N_Delay_Alternative =>
176 Analyze_Delay_Alternative (N);
177
178 when N_Delay_Relative_Statement =>
179 Analyze_Delay_Relative (N);
180
181 when N_Delay_Until_Statement =>
182 Analyze_Delay_Until (N);
183
184 when N_Entry_Body =>
185 Analyze_Entry_Body (N);
186
187 when N_Entry_Body_Formal_Part =>
188 Analyze_Entry_Body_Formal_Part (N);
189
190 when N_Entry_Call_Alternative =>
191 Analyze_Entry_Call_Alternative (N);
192
193 when N_Entry_Declaration =>
194 Analyze_Entry_Declaration (N);
195
196 when N_Entry_Index_Specification =>
197 Analyze_Entry_Index_Specification (N);
198
199 when N_Enumeration_Representation_Clause =>
200 Analyze_Enumeration_Representation_Clause (N);
201
202 when N_Exception_Declaration =>
203 Analyze_Exception_Declaration (N);
204
205 when N_Exception_Renaming_Declaration =>
206 Analyze_Exception_Renaming (N);
207
208 when N_Exit_Statement =>
209 Analyze_Exit_Statement (N);
210
211 when N_Expanded_Name =>
212 Analyze_Expanded_Name (N);
213
214 when N_Explicit_Dereference =>
215 Analyze_Explicit_Dereference (N);
216
217 when N_Expression_Function =>
218 Analyze_Expression_Function (N);
219
220 when N_Expression_With_Actions =>
221 Analyze_Expression_With_Actions (N);
222
223 when N_Extended_Return_Statement =>
224 Analyze_Extended_Return_Statement (N);
225
226 when N_Extension_Aggregate =>
227 Analyze_Aggregate (N);
228
229 when N_Formal_Object_Declaration =>
230 Analyze_Formal_Object_Declaration (N);
231
232 when N_Formal_Package_Declaration =>
233 Analyze_Formal_Package_Declaration (N);
234
235 when N_Formal_Subprogram_Declaration =>
236 Analyze_Formal_Subprogram_Declaration (N);
237
238 when N_Formal_Type_Declaration =>
239 Analyze_Formal_Type_Declaration (N);
240
241 when N_Free_Statement =>
242 Analyze_Free_Statement (N);
243
244 when N_Freeze_Entity =>
245 Analyze_Freeze_Entity (N);
246
247 when N_Freeze_Generic_Entity =>
248 Analyze_Freeze_Generic_Entity (N);
249
250 when N_Full_Type_Declaration =>
251 Analyze_Full_Type_Declaration (N);
252
253 when N_Function_Call =>
254 Analyze_Function_Call (N);
255
256 when N_Function_Instantiation =>
257 Analyze_Function_Instantiation (N);
258
259 when N_Generic_Function_Renaming_Declaration =>
260 Analyze_Generic_Function_Renaming (N);
261
262 when N_Generic_Package_Declaration =>
263 Analyze_Generic_Package_Declaration (N);
264
265 when N_Generic_Package_Renaming_Declaration =>
266 Analyze_Generic_Package_Renaming (N);
267
268 when N_Generic_Procedure_Renaming_Declaration =>
269 Analyze_Generic_Procedure_Renaming (N);
270
271 when N_Generic_Subprogram_Declaration =>
272 Analyze_Generic_Subprogram_Declaration (N);
273
274 when N_Goto_Statement =>
275 Analyze_Goto_Statement (N);
276
277 when N_Handled_Sequence_Of_Statements =>
278 Analyze_Handled_Statements (N);
279
280 when N_Identifier =>
281 Analyze_Identifier (N);
282
283 when N_If_Expression =>
284 Analyze_If_Expression (N);
285
286 when N_If_Statement =>
287 Analyze_If_Statement (N);
288
289 when N_Implicit_Label_Declaration =>
290 Analyze_Implicit_Label_Declaration (N);
291
292 when N_In =>
293 Analyze_Membership_Op (N);
294
295 when N_Incomplete_Type_Declaration =>
296 Analyze_Incomplete_Type_Decl (N);
297
298 when N_Indexed_Component =>
299 Analyze_Indexed_Component_Form (N);
300
301 when N_Integer_Literal =>
302 Analyze_Integer_Literal (N);
303
304 when N_Iterator_Specification =>
305 Analyze_Iterator_Specification (N);
306
307 when N_Itype_Reference =>
308 Analyze_Itype_Reference (N);
309
310 when N_Label =>
311 Analyze_Label (N);
312
313 when N_Loop_Parameter_Specification =>
314 Analyze_Loop_Parameter_Specification (N);
315
316 when N_Loop_Statement =>
317 Analyze_Loop_Statement (N);
318
319 when N_Not_In =>
320 Analyze_Membership_Op (N);
321
322 when N_Null =>
323 Analyze_Null (N);
324
325 when N_Null_Statement =>
326 Analyze_Null_Statement (N);
327
328 when N_Number_Declaration =>
329 Analyze_Number_Declaration (N);
330
331 when N_Object_Declaration =>
332 Analyze_Object_Declaration (N);
333
334 when N_Object_Renaming_Declaration =>
335 Analyze_Object_Renaming (N);
336
337 when N_Operator_Symbol =>
338 Analyze_Operator_Symbol (N);
339
340 when N_Op_Abs =>
341 Analyze_Unary_Op (N);
342
343 when N_Op_Add =>
344 Analyze_Arithmetic_Op (N);
345
346 when N_Op_And =>
347 Analyze_Logical_Op (N);
348
349 when N_Op_Concat =>
350 Analyze_Concatenation (N);
351
352 when N_Op_Divide =>
353 Analyze_Arithmetic_Op (N);
354
355 when N_Op_Eq =>
356 Analyze_Equality_Op (N);
357
358 when N_Op_Expon =>
359 Analyze_Arithmetic_Op (N);
360
361 when N_Op_Ge =>
362 Analyze_Comparison_Op (N);
363
364 when N_Op_Gt =>
365 Analyze_Comparison_Op (N);
366
367 when N_Op_Le =>
368 Analyze_Comparison_Op (N);
369
370 when N_Op_Lt =>
371 Analyze_Comparison_Op (N);
372
373 when N_Op_Minus =>
374 Analyze_Unary_Op (N);
375
376 when N_Op_Mod =>
377 Analyze_Mod (N);
378
379 when N_Op_Multiply =>
380 Analyze_Arithmetic_Op (N);
381
382 when N_Op_Ne =>
383 Analyze_Equality_Op (N);
384
385 when N_Op_Not =>
386 Analyze_Negation (N);
387
388 when N_Op_Or =>
389 Analyze_Logical_Op (N);
390
391 when N_Op_Plus =>
392 Analyze_Unary_Op (N);
393
394 when N_Op_Rem =>
395 Analyze_Arithmetic_Op (N);
396
397 when N_Op_Rotate_Left =>
398 Analyze_Arithmetic_Op (N);
399
400 when N_Op_Rotate_Right =>
401 Analyze_Arithmetic_Op (N);
402
403 when N_Op_Shift_Left =>
404 Analyze_Arithmetic_Op (N);
405
406 when N_Op_Shift_Right =>
407 Analyze_Arithmetic_Op (N);
408
409 when N_Op_Shift_Right_Arithmetic =>
410 Analyze_Arithmetic_Op (N);
411
412 when N_Op_Subtract =>
413 Analyze_Arithmetic_Op (N);
414
415 when N_Op_Xor =>
416 Analyze_Logical_Op (N);
417
418 when N_Or_Else =>
419 Analyze_Short_Circuit (N);
420
421 when N_Others_Choice =>
422 Analyze_Others_Choice (N);
423
424 when N_Package_Body =>
425 Analyze_Package_Body (N);
426
427 when N_Package_Body_Stub =>
428 Analyze_Package_Body_Stub (N);
429
430 when N_Package_Declaration =>
431 Analyze_Package_Declaration (N);
432
433 when N_Package_Instantiation =>
434 Analyze_Package_Instantiation (N);
435
436 when N_Package_Renaming_Declaration =>
437 Analyze_Package_Renaming (N);
438
439 when N_Package_Specification =>
440 Analyze_Package_Specification (N);
441
442 when N_Parameter_Association =>
443 Analyze_Parameter_Association (N);
444
445 when N_Pragma =>
446 Analyze_Pragma (N);
447
448 when N_Private_Extension_Declaration =>
449 Analyze_Private_Extension_Declaration (N);
450
451 when N_Private_Type_Declaration =>
452 Analyze_Private_Type_Declaration (N);
453
454 when N_Procedure_Call_Statement =>
455 Analyze_Procedure_Call (N);
456
457 when N_Procedure_Instantiation =>
458 Analyze_Procedure_Instantiation (N);
459
460 when N_Protected_Body =>
461 Analyze_Protected_Body (N);
462
463 when N_Protected_Body_Stub =>
464 Analyze_Protected_Body_Stub (N);
465
466 when N_Protected_Definition =>
467 Analyze_Protected_Definition (N);
468
469 when N_Protected_Type_Declaration =>
470 Analyze_Protected_Type_Declaration (N);
471
472 when N_Qualified_Expression =>
473 Analyze_Qualified_Expression (N);
474
475 when N_Quantified_Expression =>
476 Analyze_Quantified_Expression (N);
477
478 when N_Raise_Expression =>
479 Analyze_Raise_Expression (N);
480
481 when N_Raise_Statement =>
482 Analyze_Raise_Statement (N);
483
484 when N_Raise_xxx_Error =>
485 Analyze_Raise_xxx_Error (N);
486
487 when N_Range =>
488 Analyze_Range (N);
489
490 when N_Range_Constraint =>
491 Analyze_Range (Range_Expression (N));
492
493 when N_Real_Literal =>
494 Analyze_Real_Literal (N);
495
496 when N_Record_Representation_Clause =>
497 Analyze_Record_Representation_Clause (N);
498
499 when N_Reference =>
500 Analyze_Reference (N);
501
502 when N_Requeue_Statement =>
503 Analyze_Requeue (N);
504
505 when N_Simple_Return_Statement =>
506 Analyze_Simple_Return_Statement (N);
507
508 when N_Selected_Component =>
509 Find_Selected_Component (N);
510 -- ??? why not Analyze_Selected_Component, needs comments
511
512 when N_Selective_Accept =>
513 Analyze_Selective_Accept (N);
514
515 when N_Single_Protected_Declaration =>
516 Analyze_Single_Protected_Declaration (N);
517
518 when N_Single_Task_Declaration =>
519 Analyze_Single_Task_Declaration (N);
520
521 when N_Slice =>
522 Analyze_Slice (N);
523
524 when N_String_Literal =>
525 Analyze_String_Literal (N);
526
527 when N_Subprogram_Body =>
528 Analyze_Subprogram_Body (N);
529
530 when N_Subprogram_Body_Stub =>
531 Analyze_Subprogram_Body_Stub (N);
532
533 when N_Subprogram_Declaration =>
534 Analyze_Subprogram_Declaration (N);
535
536 when N_Subprogram_Renaming_Declaration =>
537 Analyze_Subprogram_Renaming (N);
538
539 when N_Subtype_Declaration =>
540 Analyze_Subtype_Declaration (N);
541
542 when N_Subtype_Indication =>
543 Analyze_Subtype_Indication (N);
544
545 when N_Subunit =>
546 Analyze_Subunit (N);
547
548 when N_Task_Body =>
549 Analyze_Task_Body (N);
550
551 when N_Task_Body_Stub =>
552 Analyze_Task_Body_Stub (N);
553
554 when N_Task_Definition =>
555 Analyze_Task_Definition (N);
556
557 when N_Task_Type_Declaration =>
558 Analyze_Task_Type_Declaration (N);
559
560 when N_Terminate_Alternative =>
561 Analyze_Terminate_Alternative (N);
562
563 when N_Timed_Entry_Call =>
564 Analyze_Timed_Entry_Call (N);
565
566 when N_Triggering_Alternative =>
567 Analyze_Triggering_Alternative (N);
568
569 when N_Type_Conversion =>
570 Analyze_Type_Conversion (N);
571
572 when N_Unchecked_Expression =>
573 Analyze_Unchecked_Expression (N);
574
575 when N_Unchecked_Type_Conversion =>
576 Analyze_Unchecked_Type_Conversion (N);
577
578 when N_Use_Package_Clause =>
579 Analyze_Use_Package (N);
580
581 when N_Use_Type_Clause =>
582 Analyze_Use_Type (N);
583
584 when N_Validate_Unchecked_Conversion =>
585 null;
586
587 when N_Variant_Part =>
588 Analyze_Variant_Part (N);
589
590 when N_With_Clause =>
591 Analyze_With_Clause (N);
592
593 -- A call to analyze the Empty node is an error, but most likely it
594 -- is an error caused by an attempt to analyze a malformed piece of
595 -- tree caused by some other error, so if there have been any other
596 -- errors, we just ignore it, otherwise it is a real internal error
597 -- which we complain about.
598
599 -- We must also consider the case of call to a runtime function that
600 -- is not available in the configurable runtime.
601
602 when N_Empty =>
603 pragma Assert (Serious_Errors_Detected /= 0
604 or else Configurable_Run_Time_Violations /= 0);
605 null;
606
607 -- A call to analyze the error node is simply ignored, to avoid
608 -- causing cascaded errors (happens of course only in error cases)
609
610 when N_Error =>
611 null;
612
613 -- Push/Pop nodes normally don't come through an analyze call. An
614 -- exception is the dummy ones bracketing a subprogram body. In any
615 -- case there is nothing to be done to analyze such nodes.
616
617 when N_Push_Pop_xxx_Label =>
618 null;
619
620 -- SCIL nodes don't need analysis because they are decorated when
621 -- they are built. They are added to the tree by Insert_Actions and
622 -- the call to analyze them is generated when the full list is
623 -- analyzed.
624
625 when
626 N_SCIL_Dispatch_Table_Tag_Init |
627 N_SCIL_Dispatching_Call |
628 N_SCIL_Membership_Test =>
629 null;
630
631 -- For the remaining node types, we generate compiler abort, because
632 -- these nodes are always analyzed within the Sem_Chn routines and
633 -- there should never be a case of making a call to the main Analyze
634 -- routine for these node kinds. For example, an N_Access_Definition
635 -- node appears only in the context of a type declaration, and is
636 -- processed by the analyze routine for type declarations.
637
638 when
639 N_Abortable_Part |
640 N_Access_Definition |
641 N_Access_Function_Definition |
642 N_Access_Procedure_Definition |
643 N_Access_To_Object_Definition |
644 N_Aspect_Specification |
645 N_Case_Expression_Alternative |
646 N_Case_Statement_Alternative |
647 N_Compilation_Unit_Aux |
648 N_Component_Association |
649 N_Component_Clause |
650 N_Component_Definition |
651 N_Component_List |
652 N_Constrained_Array_Definition |
653 N_Contract |
654 N_Decimal_Fixed_Point_Definition |
655 N_Defining_Character_Literal |
656 N_Defining_Identifier |
657 N_Defining_Operator_Symbol |
658 N_Defining_Program_Unit_Name |
659 N_Delta_Constraint |
660 N_Derived_Type_Definition |
661 N_Designator |
662 N_Digits_Constraint |
663 N_Discriminant_Association |
664 N_Discriminant_Specification |
665 N_Elsif_Part |
666 N_Entry_Call_Statement |
667 N_Enumeration_Type_Definition |
668 N_Exception_Handler |
669 N_Floating_Point_Definition |
670 N_Formal_Decimal_Fixed_Point_Definition |
671 N_Formal_Derived_Type_Definition |
672 N_Formal_Discrete_Type_Definition |
673 N_Formal_Floating_Point_Definition |
674 N_Formal_Modular_Type_Definition |
675 N_Formal_Ordinary_Fixed_Point_Definition |
676 N_Formal_Private_Type_Definition |
677 N_Formal_Incomplete_Type_Definition |
678 N_Formal_Signed_Integer_Type_Definition |
679 N_Function_Specification |
680 N_Generic_Association |
681 N_Index_Or_Discriminant_Constraint |
682 N_Iteration_Scheme |
683 N_Mod_Clause |
684 N_Modular_Type_Definition |
685 N_Ordinary_Fixed_Point_Definition |
686 N_Parameter_Specification |
687 N_Pragma_Argument_Association |
688 N_Procedure_Specification |
689 N_Real_Range_Specification |
690 N_Record_Definition |
691 N_Signed_Integer_Type_Definition |
692 N_Unconstrained_Array_Definition |
693 N_Unused_At_Start |
694 N_Unused_At_End |
695 N_Variant =>
696
697 raise Program_Error;
698 end case;
699
700 Debug_A_Exit ("analyzing ", N, " (done)");
701
702 -- Now that we have analyzed the node, we call the expander to perform
703 -- possible expansion. We skip this for subexpressions, because we don't
704 -- have the type yet, and the expander will need to know the type before
705 -- it can do its job. For subexpression nodes, the call to the expander
706 -- happens in Sem_Res.Resolve. A special exception is Raise_xxx_Error,
707 -- which can appear in a statement context, and needs expanding now in
708 -- the case (distinguished by Etype, as documented in Sinfo).
709
710 -- The Analyzed flag is also set at this point for non-subexpression
711 -- nodes (in the case of subexpression nodes, we can't set the flag yet,
712 -- since resolution and expansion have not yet been completed). Note
713 -- that for N_Raise_xxx_Error we have to distinguish the expression
714 -- case from the statement case.
715
716 if Nkind (N) not in N_Subexpr
717 or else (Nkind (N) in N_Raise_xxx_Error
718 and then Etype (N) = Standard_Void_Type)
719 then
720 Expand (N);
721 end if;
722 end Analyze;
723
724 -- Version with check(s) suppressed
725
726 procedure Analyze (N : Node_Id; Suppress : Check_Id) is
727 begin
728 if Suppress = All_Checks then
729 declare
730 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
731 begin
732 Scope_Suppress.Suppress := (others => True);
733 Analyze (N);
734 Scope_Suppress.Suppress := Svs;
735 end;
736
737 elsif Suppress = Overflow_Check then
738 declare
739 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
740 begin
741 Scope_Suppress.Suppress (Suppress) := True;
742 Analyze (N);
743 Scope_Suppress.Suppress (Suppress) := Svg;
744 end;
745 end if;
746 end Analyze;
747
748 ------------------
749 -- Analyze_List --
750 ------------------
751
752 procedure Analyze_List (L : List_Id) is
753 Node : Node_Id;
754
755 begin
756 Node := First (L);
757 while Present (Node) loop
758 Analyze (Node);
759 Next (Node);
760 end loop;
761 end Analyze_List;
762
763 -- Version with check(s) suppressed
764
765 procedure Analyze_List (L : List_Id; Suppress : Check_Id) is
766 begin
767 if Suppress = All_Checks then
768 declare
769 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
770 begin
771 Scope_Suppress.Suppress := (others => True);
772 Analyze_List (L);
773 Scope_Suppress.Suppress := Svs;
774 end;
775
776 else
777 declare
778 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
779 begin
780 Scope_Suppress.Suppress (Suppress) := True;
781 Analyze_List (L);
782 Scope_Suppress.Suppress (Suppress) := Svg;
783 end;
784 end if;
785 end Analyze_List;
786
787 --------------------------
788 -- Copy_Suppress_Status --
789 --------------------------
790
791 procedure Copy_Suppress_Status
792 (C : Check_Id;
793 From : Entity_Id;
794 To : Entity_Id)
795 is
796 Found : Boolean;
797 pragma Warnings (Off, Found);
798
799 procedure Search_Stack
800 (Top : Suppress_Stack_Entry_Ptr;
801 Found : out Boolean);
802 -- Search given suppress stack for matching entry for entity. If found
803 -- then set Checks_May_Be_Suppressed on To, and push an appropriate
804 -- entry for To onto the local suppress stack.
805
806 ------------------
807 -- Search_Stack --
808 ------------------
809
810 procedure Search_Stack
811 (Top : Suppress_Stack_Entry_Ptr;
812 Found : out Boolean)
813 is
814 Ptr : Suppress_Stack_Entry_Ptr;
815
816 begin
817 Ptr := Top;
818 while Ptr /= null loop
819 if Ptr.Entity = From
820 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
821 then
822 if Ptr.Suppress then
823 Set_Checks_May_Be_Suppressed (To, True);
824 Push_Local_Suppress_Stack_Entry
825 (Entity => To,
826 Check => C,
827 Suppress => True);
828 Found := True;
829 return;
830 end if;
831 end if;
832
833 Ptr := Ptr.Prev;
834 end loop;
835
836 Found := False;
837 return;
838 end Search_Stack;
839
840 -- Start of processing for Copy_Suppress_Status
841
842 begin
843 if not Checks_May_Be_Suppressed (From) then
844 return;
845 end if;
846
847 -- First search the global entity suppress table for a matching entry.
848 -- We also search this in reverse order so that if there are multiple
849 -- pragmas for the same entity, the last one applies.
850
851 Search_Stack (Global_Suppress_Stack_Top, Found);
852
853 if Found then
854 return;
855 end if;
856
857 -- Now search the local entity suppress stack, we search this in
858 -- reverse order so that we get the innermost entry that applies to
859 -- this case if there are nested entries. Note that for the purpose
860 -- of this procedure we are ONLY looking for entries corresponding
861 -- to a two-argument Suppress, where the second argument matches From.
862
863 Search_Stack (Local_Suppress_Stack_Top, Found);
864 end Copy_Suppress_Status;
865
866 -------------------------
867 -- Enter_Generic_Scope --
868 -------------------------
869
870 procedure Enter_Generic_Scope (S : Entity_Id) is
871 begin
872 if No (Outer_Generic_Scope) then
873 Outer_Generic_Scope := S;
874 end if;
875 end Enter_Generic_Scope;
876
877 ------------------------
878 -- Exit_Generic_Scope --
879 ------------------------
880
881 procedure Exit_Generic_Scope (S : Entity_Id) is
882 begin
883 if S = Outer_Generic_Scope then
884 Outer_Generic_Scope := Empty;
885 end if;
886 end Exit_Generic_Scope;
887
888 -----------------------
889 -- Explicit_Suppress --
890 -----------------------
891
892 function Explicit_Suppress (E : Entity_Id; C : Check_Id) return Boolean is
893 Ptr : Suppress_Stack_Entry_Ptr;
894
895 begin
896 if not Checks_May_Be_Suppressed (E) then
897 return False;
898
899 else
900 Ptr := Global_Suppress_Stack_Top;
901 while Ptr /= null loop
902 if Ptr.Entity = E
903 and then (Ptr.Check = All_Checks or else Ptr.Check = C)
904 then
905 return Ptr.Suppress;
906 end if;
907
908 Ptr := Ptr.Prev;
909 end loop;
910 end if;
911
912 return False;
913 end Explicit_Suppress;
914
915 -----------------------------
916 -- External_Ref_In_Generic --
917 -----------------------------
918
919 function External_Ref_In_Generic (E : Entity_Id) return Boolean is
920 Scop : Entity_Id;
921
922 begin
923 -- Entity is global if defined outside of current outer_generic_scope:
924 -- Either the entity has a smaller depth that the outer generic, or it
925 -- is in a different compilation unit, or it is defined within a unit
926 -- in the same compilation, that is not within the outer_generic.
927
928 if No (Outer_Generic_Scope) then
929 return False;
930
931 elsif Scope_Depth (Scope (E)) < Scope_Depth (Outer_Generic_Scope)
932 or else not In_Same_Source_Unit (E, Outer_Generic_Scope)
933 then
934 return True;
935
936 else
937 Scop := Scope (E);
938 while Present (Scop) loop
939 if Scop = Outer_Generic_Scope then
940 return False;
941 elsif Scope_Depth (Scop) < Scope_Depth (Outer_Generic_Scope) then
942 return True;
943 else
944 Scop := Scope (Scop);
945 end if;
946 end loop;
947
948 return True;
949 end if;
950 end External_Ref_In_Generic;
951
952 ----------------
953 -- Initialize --
954 ----------------
955
956 procedure Initialize is
957 Next : Suppress_Stack_Entry_Ptr;
958
959 procedure Free is new Unchecked_Deallocation
960 (Suppress_Stack_Entry, Suppress_Stack_Entry_Ptr);
961
962 begin
963 -- Free any global suppress stack entries from a previous invocation
964 -- of the compiler (in the normal case this loop does nothing).
965
966 while Suppress_Stack_Entries /= null loop
967 Next := Suppress_Stack_Entries.Next;
968 Free (Suppress_Stack_Entries);
969 Suppress_Stack_Entries := Next;
970 end loop;
971
972 Local_Suppress_Stack_Top := null;
973 Global_Suppress_Stack_Top := null;
974
975 -- Clear scope stack, and reset global variables
976
977 Scope_Stack.Init;
978 Unloaded_Subunits := False;
979 end Initialize;
980
981 ------------------------------
982 -- Insert_After_And_Analyze --
983 ------------------------------
984
985 procedure Insert_After_And_Analyze (N : Node_Id; M : Node_Id) is
986 Node : Node_Id;
987
988 begin
989 if Present (M) then
990
991 -- If we are not at the end of the list, then the easiest
992 -- coding is simply to insert before our successor
993
994 if Present (Next (N)) then
995 Insert_Before_And_Analyze (Next (N), M);
996
997 -- Case of inserting at the end of the list
998
999 else
1000 -- Capture the Node_Id of the node to be inserted. This Node_Id
1001 -- will still be the same after the insert operation.
1002
1003 Node := M;
1004 Insert_After (N, M);
1005
1006 -- Now just analyze from the inserted node to the end of
1007 -- the new list (note that this properly handles the case
1008 -- where any of the analyze calls result in the insertion of
1009 -- nodes after the analyzed node, expecting analysis).
1010
1011 while Present (Node) loop
1012 Analyze (Node);
1013 Mark_Rewrite_Insertion (Node);
1014 Next (Node);
1015 end loop;
1016 end if;
1017 end if;
1018 end Insert_After_And_Analyze;
1019
1020 -- Version with check(s) suppressed
1021
1022 procedure Insert_After_And_Analyze
1023 (N : Node_Id;
1024 M : Node_Id;
1025 Suppress : Check_Id)
1026 is
1027 begin
1028 if Suppress = All_Checks then
1029 declare
1030 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
1031 begin
1032 Scope_Suppress.Suppress := (others => True);
1033 Insert_After_And_Analyze (N, M);
1034 Scope_Suppress.Suppress := Svs;
1035 end;
1036
1037 else
1038 declare
1039 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
1040 begin
1041 Scope_Suppress.Suppress (Suppress) := True;
1042 Insert_After_And_Analyze (N, M);
1043 Scope_Suppress.Suppress (Suppress) := Svg;
1044 end;
1045 end if;
1046 end Insert_After_And_Analyze;
1047
1048 -------------------------------
1049 -- Insert_Before_And_Analyze --
1050 -------------------------------
1051
1052 procedure Insert_Before_And_Analyze (N : Node_Id; M : Node_Id) is
1053 Node : Node_Id;
1054
1055 begin
1056 if Present (M) then
1057
1058 -- Capture the Node_Id of the first list node to be inserted.
1059 -- This will still be the first node after the insert operation,
1060 -- since Insert_List_After does not modify the Node_Id values.
1061
1062 Node := M;
1063 Insert_Before (N, M);
1064
1065 -- The insertion does not change the Id's of any of the nodes in
1066 -- the list, and they are still linked, so we can simply loop from
1067 -- the original first node until we meet the node before which the
1068 -- insertion is occurring. Note that this properly handles the case
1069 -- where any of the analyzed nodes insert nodes after themselves,
1070 -- expecting them to get analyzed.
1071
1072 while Node /= N loop
1073 Analyze (Node);
1074 Mark_Rewrite_Insertion (Node);
1075 Next (Node);
1076 end loop;
1077 end if;
1078 end Insert_Before_And_Analyze;
1079
1080 -- Version with check(s) suppressed
1081
1082 procedure Insert_Before_And_Analyze
1083 (N : Node_Id;
1084 M : Node_Id;
1085 Suppress : Check_Id)
1086 is
1087 begin
1088 if Suppress = All_Checks then
1089 declare
1090 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
1091 begin
1092 Scope_Suppress.Suppress := (others => True);
1093 Insert_Before_And_Analyze (N, M);
1094 Scope_Suppress.Suppress := Svs;
1095 end;
1096
1097 else
1098 declare
1099 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
1100 begin
1101 Scope_Suppress.Suppress (Suppress) := True;
1102 Insert_Before_And_Analyze (N, M);
1103 Scope_Suppress.Suppress (Suppress) := Svg;
1104 end;
1105 end if;
1106 end Insert_Before_And_Analyze;
1107
1108 -----------------------------------
1109 -- Insert_List_After_And_Analyze --
1110 -----------------------------------
1111
1112 procedure Insert_List_After_And_Analyze (N : Node_Id; L : List_Id) is
1113 After : constant Node_Id := Next (N);
1114 Node : Node_Id;
1115
1116 begin
1117 if Is_Non_Empty_List (L) then
1118
1119 -- Capture the Node_Id of the first list node to be inserted.
1120 -- This will still be the first node after the insert operation,
1121 -- since Insert_List_After does not modify the Node_Id values.
1122
1123 Node := First (L);
1124 Insert_List_After (N, L);
1125
1126 -- Now just analyze from the original first node until we get to the
1127 -- successor of the original insertion point (which may be Empty if
1128 -- the insertion point was at the end of the list). Note that this
1129 -- properly handles the case where any of the analyze calls result in
1130 -- the insertion of nodes after the analyzed node (possibly calling
1131 -- this routine recursively).
1132
1133 while Node /= After loop
1134 Analyze (Node);
1135 Mark_Rewrite_Insertion (Node);
1136 Next (Node);
1137 end loop;
1138 end if;
1139 end Insert_List_After_And_Analyze;
1140
1141 -- Version with check(s) suppressed
1142
1143 procedure Insert_List_After_And_Analyze
1144 (N : Node_Id; L : List_Id; Suppress : Check_Id)
1145 is
1146 begin
1147 if Suppress = All_Checks then
1148 declare
1149 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
1150 begin
1151 Scope_Suppress.Suppress := (others => True);
1152 Insert_List_After_And_Analyze (N, L);
1153 Scope_Suppress.Suppress := Svs;
1154 end;
1155
1156 else
1157 declare
1158 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
1159 begin
1160 Scope_Suppress.Suppress (Suppress) := True;
1161 Insert_List_After_And_Analyze (N, L);
1162 Scope_Suppress.Suppress (Suppress) := Svg;
1163 end;
1164 end if;
1165 end Insert_List_After_And_Analyze;
1166
1167 ------------------------------------
1168 -- Insert_List_Before_And_Analyze --
1169 ------------------------------------
1170
1171 procedure Insert_List_Before_And_Analyze (N : Node_Id; L : List_Id) is
1172 Node : Node_Id;
1173
1174 begin
1175 if Is_Non_Empty_List (L) then
1176
1177 -- Capture the Node_Id of the first list node to be inserted. This
1178 -- will still be the first node after the insert operation, since
1179 -- Insert_List_After does not modify the Node_Id values.
1180
1181 Node := First (L);
1182 Insert_List_Before (N, L);
1183
1184 -- The insertion does not change the Id's of any of the nodes in
1185 -- the list, and they are still linked, so we can simply loop from
1186 -- the original first node until we meet the node before which the
1187 -- insertion is occurring. Note that this properly handles the case
1188 -- where any of the analyzed nodes insert nodes after themselves,
1189 -- expecting them to get analyzed.
1190
1191 while Node /= N loop
1192 Analyze (Node);
1193 Mark_Rewrite_Insertion (Node);
1194 Next (Node);
1195 end loop;
1196 end if;
1197 end Insert_List_Before_And_Analyze;
1198
1199 -- Version with check(s) suppressed
1200
1201 procedure Insert_List_Before_And_Analyze
1202 (N : Node_Id; L : List_Id; Suppress : Check_Id)
1203 is
1204 begin
1205 if Suppress = All_Checks then
1206 declare
1207 Svs : constant Suppress_Array := Scope_Suppress.Suppress;
1208 begin
1209 Scope_Suppress.Suppress := (others => True);
1210 Insert_List_Before_And_Analyze (N, L);
1211 Scope_Suppress.Suppress := Svs;
1212 end;
1213
1214 else
1215 declare
1216 Svg : constant Boolean := Scope_Suppress.Suppress (Suppress);
1217 begin
1218 Scope_Suppress.Suppress (Suppress) := True;
1219 Insert_List_Before_And_Analyze (N, L);
1220 Scope_Suppress.Suppress (Suppress) := Svg;
1221 end;
1222 end if;
1223 end Insert_List_Before_And_Analyze;
1224
1225 ----------
1226 -- Lock --
1227 ----------
1228
1229 procedure Lock is
1230 begin
1231 Scope_Stack.Locked := True;
1232 Scope_Stack.Release;
1233 end Lock;
1234
1235 ----------------
1236 -- Preanalyze --
1237 ----------------
1238
1239 procedure Preanalyze (N : Node_Id) is
1240 Save_Full_Analysis : constant Boolean := Full_Analysis;
1241
1242 begin
1243 Full_Analysis := False;
1244 Expander_Mode_Save_And_Set (False);
1245
1246 Analyze (N);
1247
1248 Expander_Mode_Restore;
1249 Full_Analysis := Save_Full_Analysis;
1250 end Preanalyze;
1251
1252 --------------------------------------
1253 -- Push_Global_Suppress_Stack_Entry --
1254 --------------------------------------
1255
1256 procedure Push_Global_Suppress_Stack_Entry
1257 (Entity : Entity_Id;
1258 Check : Check_Id;
1259 Suppress : Boolean)
1260 is
1261 begin
1262 Global_Suppress_Stack_Top :=
1263 new Suppress_Stack_Entry'
1264 (Entity => Entity,
1265 Check => Check,
1266 Suppress => Suppress,
1267 Prev => Global_Suppress_Stack_Top,
1268 Next => Suppress_Stack_Entries);
1269 Suppress_Stack_Entries := Global_Suppress_Stack_Top;
1270 return;
1271 end Push_Global_Suppress_Stack_Entry;
1272
1273 -------------------------------------
1274 -- Push_Local_Suppress_Stack_Entry --
1275 -------------------------------------
1276
1277 procedure Push_Local_Suppress_Stack_Entry
1278 (Entity : Entity_Id;
1279 Check : Check_Id;
1280 Suppress : Boolean)
1281 is
1282 begin
1283 Local_Suppress_Stack_Top :=
1284 new Suppress_Stack_Entry'
1285 (Entity => Entity,
1286 Check => Check,
1287 Suppress => Suppress,
1288 Prev => Local_Suppress_Stack_Top,
1289 Next => Suppress_Stack_Entries);
1290 Suppress_Stack_Entries := Local_Suppress_Stack_Top;
1291
1292 return;
1293 end Push_Local_Suppress_Stack_Entry;
1294
1295 ---------------
1296 -- Semantics --
1297 ---------------
1298
1299 procedure Semantics (Comp_Unit : Node_Id) is
1300
1301 -- The following locations save the corresponding global flags and
1302 -- variables so that they can be restored on completion. This is needed
1303 -- so that calls to Rtsfind start with the proper default values for
1304 -- these variables, and also that such calls do not disturb the settings
1305 -- for units being analyzed at a higher level.
1306
1307 S_Current_Sem_Unit : constant Unit_Number_Type := Current_Sem_Unit;
1308 S_Full_Analysis : constant Boolean := Full_Analysis;
1309 S_GNAT_Mode : constant Boolean := GNAT_Mode;
1310 S_Global_Dis_Names : constant Boolean := Global_Discard_Names;
1311 S_In_Assertion_Expr : constant Nat := In_Assertion_Expr;
1312 S_In_Default_Expr : constant Boolean := In_Default_Expr;
1313 S_In_Spec_Expr : constant Boolean := In_Spec_Expression;
1314 S_Inside_A_Generic : constant Boolean := Inside_A_Generic;
1315 S_Outer_Gen_Scope : constant Entity_Id := Outer_Generic_Scope;
1316 S_Style_Check : constant Boolean := Style_Check;
1317
1318 Curunit : constant Unit_Number_Type := Get_Cunit_Unit_Number (Comp_Unit);
1319 -- New value of Current_Sem_Unit
1320
1321 Generic_Main : constant Boolean :=
1322 Nkind (Unit (Cunit (Main_Unit))) in N_Generic_Declaration;
1323 -- If the main unit is generic, every compiled unit, including its
1324 -- context, is compiled with expansion disabled.
1325
1326 Is_Main_Unit_Or_Main_Unit_Spec : constant Boolean :=
1327 Curunit = Main_Unit
1328 or else
1329 (Nkind (Unit (Cunit (Main_Unit))) = N_Package_Body
1330 and then Library_Unit (Cunit (Main_Unit)) = Cunit (Curunit));
1331 -- Configuration flags have special settings when compiling a predefined
1332 -- file as a main unit. This applies to its spec as well.
1333
1334 Ext_Main_Source_Unit : constant Boolean :=
1335 In_Extended_Main_Source_Unit (Comp_Unit);
1336 -- Determine if unit is in extended main source unit
1337
1338 Save_Config_Switches : Config_Switches_Type;
1339 -- Variable used to save values of config switches while we analyze the
1340 -- new unit, to be restored on exit for proper recursive behavior.
1341
1342 Save_Cunit_Restrictions : Save_Cunit_Boolean_Restrictions;
1343 -- Used to save non-partition wide restrictions before processing new
1344 -- unit. All with'ed units are analyzed with config restrictions reset
1345 -- and we need to restore these saved values at the end.
1346
1347 procedure Do_Analyze;
1348 -- Procedure to analyze the compilation unit
1349
1350 ----------------
1351 -- Do_Analyze --
1352 ----------------
1353
1354 procedure Do_Analyze is
1355 List : Elist_Id;
1356
1357 begin
1358 List := Save_Scope_Stack;
1359 Push_Scope (Standard_Standard);
1360 Scope_Suppress := Suppress_Options;
1361 Scope_Stack.Table
1362 (Scope_Stack.Last).Component_Alignment_Default := Calign_Default;
1363 Scope_Stack.Table
1364 (Scope_Stack.Last).Is_Active_Stack_Base := True;
1365 Outer_Generic_Scope := Empty;
1366
1367 -- Now analyze the top level compilation unit node
1368
1369 Analyze (Comp_Unit);
1370
1371 -- Check for scope mismatch on exit from compilation
1372
1373 pragma Assert (Current_Scope = Standard_Standard
1374 or else Comp_Unit = Cunit (Main_Unit));
1375
1376 -- Then pop entry for Standard, and pop implicit types
1377
1378 Pop_Scope;
1379 Restore_Scope_Stack (List);
1380 end Do_Analyze;
1381
1382 Already_Analyzed : constant Boolean := Analyzed (Comp_Unit);
1383
1384 -- Start of processing for Semantics
1385
1386 begin
1387 if Debug_Unit_Walk then
1388 if Already_Analyzed then
1389 Write_Str ("(done)");
1390 end if;
1391
1392 Write_Unit_Info
1393 (Get_Cunit_Unit_Number (Comp_Unit),
1394 Unit (Comp_Unit),
1395 Prefix => "--> ");
1396 Indent;
1397 end if;
1398
1399 Compiler_State := Analyzing;
1400 Current_Sem_Unit := Curunit;
1401
1402 -- Compile predefined units with GNAT_Mode set to True, to properly
1403 -- process the categorization stuff. However, do not set GNAT_Mode
1404 -- to True for the renamings units (Text_IO, IO_Exceptions, Direct_IO,
1405 -- Sequential_IO) as this would prevent pragma Extend_System from being
1406 -- taken into account, for example when Text_IO is renaming DEC.Text_IO.
1407
1408 if Is_Predefined_File_Name
1409 (Unit_File_Name (Current_Sem_Unit), Renamings_Included => False)
1410 then
1411 GNAT_Mode := True;
1412 end if;
1413
1414 -- For generic main, never do expansion
1415
1416 if Generic_Main then
1417 Expander_Mode_Save_And_Set (False);
1418
1419 -- Non generic case
1420
1421 else
1422 Expander_Mode_Save_And_Set
1423
1424 -- Turn on expansion if generating code
1425
1426 (Operating_Mode = Generate_Code
1427
1428 -- or if special debug flag -gnatdx is set
1429
1430 or else Debug_Flag_X
1431
1432 -- Or if in configuration run-time mode. We do this so we get
1433 -- error messages about missing entities in the run-time even
1434 -- if we are compiling in -gnatc (no code generation) mode.
1435 -- Similar processing applies to No_Run_Time_Mode. However,
1436 -- don't do this if debug flag -gnatd.Z is set or when we are
1437 -- compiling a separate unit (this is to handle a situation
1438 -- where this new processing causes trouble).
1439
1440 or else ((Configurable_Run_Time_Mode or No_Run_Time_Mode)
1441 and not Debug_Flag_Dot_ZZ
1442 and Nkind (Unit (Cunit (Main_Unit))) /= N_Subunit));
1443 end if;
1444
1445 Full_Analysis := True;
1446 Inside_A_Generic := False;
1447 In_Assertion_Expr := 0;
1448 In_Default_Expr := False;
1449 In_Spec_Expression := False;
1450 Set_Comes_From_Source_Default (False);
1451
1452 -- Save current config switches and reset then appropriately
1453
1454 Save_Opt_Config_Switches (Save_Config_Switches);
1455 Set_Opt_Config_Switches
1456 (Is_Internal_File_Name (Unit_File_Name (Current_Sem_Unit)),
1457 Is_Main_Unit_Or_Main_Unit_Spec);
1458
1459 -- Save current non-partition-wide restrictions
1460
1461 Save_Cunit_Restrictions := Cunit_Boolean_Restrictions_Save;
1462
1463 -- For unit in main extended unit, we reset the configuration values
1464 -- for the non-partition-wide restrictions. For other units reset them.
1465
1466 if Ext_Main_Source_Unit then
1467 Restore_Config_Cunit_Boolean_Restrictions;
1468 else
1469 Reset_Cunit_Boolean_Restrictions;
1470 end if;
1471
1472 -- Turn off style checks for unit that is not in the extended main
1473 -- source unit. This improves processing efficiency for such units
1474 -- (for which we don't want style checks anyway, and where they will
1475 -- get suppressed), and is definitely needed to stop some style checks
1476 -- from invading the run-time units (e.g. overriding checks).
1477
1478 if not Ext_Main_Source_Unit then
1479 Style_Check := False;
1480
1481 -- If this is part of the extended main source unit, set style check
1482 -- mode to match the style check mode of the main source unit itself.
1483
1484 else
1485 Style_Check := Style_Check_Main;
1486 end if;
1487
1488 -- Only do analysis of unit that has not already been analyzed
1489
1490 if not Analyzed (Comp_Unit) then
1491 Initialize_Version (Current_Sem_Unit);
1492
1493 -- Do analysis, and then append the compilation unit onto the
1494 -- Comp_Unit_List, if appropriate. This is done after analysis,
1495 -- so if this unit depends on some others, they have already been
1496 -- appended. We ignore bodies, except for the main unit itself, and
1497 -- for subprogram bodies that act as specs. We have also to guard
1498 -- against ill-formed subunits that have an improper context.
1499
1500 Do_Analyze;
1501
1502 if Present (Comp_Unit)
1503 and then Nkind (Unit (Comp_Unit)) in N_Proper_Body
1504 and then (Nkind (Unit (Comp_Unit)) /= N_Subprogram_Body
1505 or else not Acts_As_Spec (Comp_Unit))
1506 and then not In_Extended_Main_Source_Unit (Comp_Unit)
1507 then
1508 null;
1509
1510 else
1511 Append_New_Elmt (Comp_Unit, To => Comp_Unit_List);
1512
1513 if Debug_Unit_Walk then
1514 Write_Str ("Appending ");
1515 Write_Unit_Info
1516 (Get_Cunit_Unit_Number (Comp_Unit), Unit (Comp_Unit));
1517 end if;
1518 end if;
1519 end if;
1520
1521 -- Save indication of dynamic elaboration checks for ALI file
1522
1523 Set_Dynamic_Elab (Current_Sem_Unit, Dynamic_Elaboration_Checks);
1524
1525 -- Restore settings of saved switches to entry values
1526
1527 Current_Sem_Unit := S_Current_Sem_Unit;
1528 Full_Analysis := S_Full_Analysis;
1529 Global_Discard_Names := S_Global_Dis_Names;
1530 GNAT_Mode := S_GNAT_Mode;
1531 In_Assertion_Expr := S_In_Assertion_Expr;
1532 In_Default_Expr := S_In_Default_Expr;
1533 In_Spec_Expression := S_In_Spec_Expr;
1534 Inside_A_Generic := S_Inside_A_Generic;
1535 Outer_Generic_Scope := S_Outer_Gen_Scope;
1536 Style_Check := S_Style_Check;
1537
1538 Restore_Opt_Config_Switches (Save_Config_Switches);
1539
1540 -- Deal with restore of restrictions
1541
1542 Cunit_Boolean_Restrictions_Restore (Save_Cunit_Restrictions);
1543
1544 Expander_Mode_Restore;
1545
1546 if Debug_Unit_Walk then
1547 Outdent;
1548
1549 if Already_Analyzed then
1550 Write_Str ("(done)");
1551 end if;
1552
1553 Write_Unit_Info
1554 (Get_Cunit_Unit_Number (Comp_Unit),
1555 Unit (Comp_Unit),
1556 Prefix => "<-- ");
1557 end if;
1558 end Semantics;
1559
1560 --------
1561 -- ss --
1562 --------
1563
1564 function ss (Index : Int) return Scope_Stack_Entry is
1565 begin
1566 return Scope_Stack.Table (Index);
1567 end ss;
1568
1569 ---------
1570 -- sst --
1571 ---------
1572
1573 function sst return Scope_Stack_Entry is
1574 begin
1575 return ss (Scope_Stack.Last);
1576 end sst;
1577
1578 ------------------------
1579 -- Walk_Library_Items --
1580 ------------------------
1581
1582 procedure Walk_Library_Items is
1583 type Unit_Number_Set is array (Main_Unit .. Last_Unit) of Boolean;
1584 pragma Pack (Unit_Number_Set);
1585
1586 Main_CU : constant Node_Id := Cunit (Main_Unit);
1587
1588 Seen, Done : Unit_Number_Set := (others => False);
1589 -- Seen (X) is True after we have seen unit X in the walk. This is used
1590 -- to prevent processing the same unit more than once. Done (X) is True
1591 -- after we have fully processed X, and is used only for debugging
1592 -- printouts and assertions.
1593
1594 Do_Main : Boolean := False;
1595 -- Flag to delay processing the main body until after all other units.
1596 -- This is needed because the spec of the main unit may appear in the
1597 -- context of some other unit. We do not want this to force processing
1598 -- of the main body before all other units have been processed.
1599 --
1600 -- Another circularity pattern occurs when the main unit is a child unit
1601 -- and the body of an ancestor has a with-clause of the main unit or on
1602 -- one of its children. In both cases the body in question has a with-
1603 -- clause on the main unit, and must be excluded from the traversal. In
1604 -- some convoluted cases this may lead to a CodePeer error because the
1605 -- spec of a subprogram declared in an instance within the parent will
1606 -- not be seen in the main unit.
1607
1608 function Depends_On_Main (CU : Node_Id) return Boolean;
1609 -- The body of a unit that is withed by the spec of the main unit may in
1610 -- turn have a with_clause on that spec. In that case do not traverse
1611 -- the body, to prevent loops. It can also happen that the main body has
1612 -- a with_clause on a child, which of course has an implicit with on its
1613 -- parent. It's OK to traverse the child body if the main spec has been
1614 -- processed, otherwise we also have a circularity to avoid.
1615
1616 procedure Do_Action (CU : Node_Id; Item : Node_Id);
1617 -- Calls Action, with some validity checks
1618
1619 procedure Do_Unit_And_Dependents (CU : Node_Id; Item : Node_Id);
1620 -- Calls Do_Action, first on the units with'ed by this one, then on
1621 -- this unit. If it's an instance body, do the spec first. If it is
1622 -- an instance spec, do the body last.
1623
1624 procedure Do_Withed_Unit (Withed_Unit : Node_Id);
1625 -- Apply Do_Unit_And_Dependents to a unit in a context clause
1626
1627 procedure Process_Bodies_In_Context (Comp : Node_Id);
1628 -- The main unit and its spec may depend on bodies that contain generics
1629 -- that are instantiated in them. Iterate through the corresponding
1630 -- contexts before processing main (spec/body) itself, to process bodies
1631 -- that may be present, together with their context. The spec of main
1632 -- is processed wherever it appears in the list of units, while the body
1633 -- is processed as the last unit in the list.
1634
1635 ---------------------
1636 -- Depends_On_Main --
1637 ---------------------
1638
1639 function Depends_On_Main (CU : Node_Id) return Boolean is
1640 CL : Node_Id;
1641 MCU : constant Node_Id := Unit (Main_CU);
1642
1643 begin
1644 CL := First (Context_Items (CU));
1645
1646 -- Problem does not arise with main subprograms
1647
1648 if
1649 not Nkind_In (MCU, N_Package_Body, N_Package_Declaration)
1650 then
1651 return False;
1652 end if;
1653
1654 while Present (CL) loop
1655 if Nkind (CL) = N_With_Clause
1656 and then Library_Unit (CL) = Main_CU
1657 and then not Done (Get_Cunit_Unit_Number (Library_Unit (CL)))
1658 then
1659 return True;
1660 end if;
1661
1662 Next (CL);
1663 end loop;
1664
1665 return False;
1666 end Depends_On_Main;
1667
1668 ---------------
1669 -- Do_Action --
1670 ---------------
1671
1672 procedure Do_Action (CU : Node_Id; Item : Node_Id) is
1673 begin
1674 -- This calls Action at the end. All the preceding code is just
1675 -- assertions and debugging output.
1676
1677 pragma Assert (No (CU) or else Nkind (CU) = N_Compilation_Unit);
1678
1679 case Nkind (Item) is
1680 when N_Generic_Subprogram_Declaration |
1681 N_Generic_Package_Declaration |
1682 N_Package_Declaration |
1683 N_Subprogram_Declaration |
1684 N_Subprogram_Renaming_Declaration |
1685 N_Package_Renaming_Declaration |
1686 N_Generic_Function_Renaming_Declaration |
1687 N_Generic_Package_Renaming_Declaration |
1688 N_Generic_Procedure_Renaming_Declaration =>
1689
1690 -- Specs are OK
1691
1692 null;
1693
1694 when N_Package_Body =>
1695
1696 -- Package bodies are processed separately if the main unit
1697 -- depends on them.
1698
1699 null;
1700
1701 when N_Subprogram_Body =>
1702
1703 -- A subprogram body must be the main unit
1704
1705 pragma Assert (Acts_As_Spec (CU)
1706 or else CU = Cunit (Main_Unit));
1707 null;
1708
1709 when N_Function_Instantiation |
1710 N_Procedure_Instantiation |
1711 N_Package_Instantiation =>
1712
1713 -- Can only happen if some generic body (needed for gnat2scil
1714 -- traversal, but not by GNAT) is not available, ignore.
1715
1716 null;
1717
1718 -- All other cases cannot happen
1719
1720 when N_Subunit =>
1721 pragma Assert (False, "subunit");
1722 null;
1723
1724 when others =>
1725 pragma Assert (False);
1726 null;
1727 end case;
1728
1729 if Present (CU) then
1730 pragma Assert (Item /= Stand.Standard_Package_Node);
1731 pragma Assert (Item = Unit (CU));
1732
1733 declare
1734 Unit_Num : constant Unit_Number_Type :=
1735 Get_Cunit_Unit_Number (CU);
1736
1737 procedure Assert_Done (Withed_Unit : Node_Id);
1738 -- Assert Withed_Unit is already Done, unless it's a body. It
1739 -- might seem strange for a with_clause to refer to a body, but
1740 -- this happens in the case of a generic instantiation, which
1741 -- gets transformed into the instance body (and the instance
1742 -- spec is also created). With clauses pointing to the
1743 -- instantiation end up pointing to the instance body.
1744
1745 -----------------
1746 -- Assert_Done --
1747 -----------------
1748
1749 procedure Assert_Done (Withed_Unit : Node_Id) is
1750 begin
1751 if not Done (Get_Cunit_Unit_Number (Withed_Unit)) then
1752 if not Nkind_In
1753 (Unit (Withed_Unit),
1754 N_Generic_Package_Declaration,
1755 N_Package_Body,
1756 N_Package_Renaming_Declaration,
1757 N_Subprogram_Body)
1758 then
1759 Write_Unit_Name
1760 (Unit_Name (Get_Cunit_Unit_Number (Withed_Unit)));
1761 Write_Str (" not yet walked!");
1762
1763 if Get_Cunit_Unit_Number (Withed_Unit) = Unit_Num then
1764 Write_Str (" (self-ref)");
1765 end if;
1766
1767 Write_Eol;
1768
1769 pragma Assert (False);
1770 end if;
1771 end if;
1772 end Assert_Done;
1773
1774 procedure Assert_Withed_Units_Done is
1775 new Walk_Withs (Assert_Done);
1776
1777 begin
1778 if Debug_Unit_Walk then
1779 Write_Unit_Info (Unit_Num, Item, Withs => True);
1780 end if;
1781
1782 -- Main unit should come last, except in the case where we
1783 -- skipped System_Aux_Id, in which case we missed the things it
1784 -- depends on, and in the case of parent bodies if present.
1785
1786 pragma Assert
1787 (not Done (Main_Unit)
1788 or else Present (System_Aux_Id)
1789 or else Nkind (Item) = N_Package_Body);
1790
1791 -- We shouldn't do the same thing twice
1792
1793 pragma Assert (not Done (Unit_Num));
1794
1795 -- Everything we depend upon should already be done
1796
1797 pragma Debug
1798 (Assert_Withed_Units_Done (CU, Include_Limited => False));
1799 end;
1800
1801 else
1802 -- Must be Standard, which has no entry in the units table
1803
1804 pragma Assert (Item = Stand.Standard_Package_Node);
1805
1806 if Debug_Unit_Walk then
1807 Write_Line ("Standard");
1808 end if;
1809 end if;
1810
1811 Action (Item);
1812 end Do_Action;
1813
1814 --------------------
1815 -- Do_Withed_Unit --
1816 --------------------
1817
1818 procedure Do_Withed_Unit (Withed_Unit : Node_Id) is
1819 begin
1820 Do_Unit_And_Dependents (Withed_Unit, Unit (Withed_Unit));
1821
1822 -- If the unit in the with_clause is a generic instance, the clause
1823 -- now denotes the instance body. Traverse the corresponding spec
1824 -- because there may be no other dependence that will force the
1825 -- traversal of its own context.
1826
1827 if Nkind (Unit (Withed_Unit)) = N_Package_Body
1828 and then Is_Generic_Instance
1829 (Defining_Entity (Unit (Library_Unit (Withed_Unit))))
1830 then
1831 Do_Withed_Unit (Library_Unit (Withed_Unit));
1832 end if;
1833 end Do_Withed_Unit;
1834
1835 ----------------------------
1836 -- Do_Unit_And_Dependents --
1837 ----------------------------
1838
1839 procedure Do_Unit_And_Dependents (CU : Node_Id; Item : Node_Id) is
1840 Unit_Num : constant Unit_Number_Type := Get_Cunit_Unit_Number (CU);
1841 Child : Node_Id;
1842 Body_U : Unit_Number_Type;
1843 Parent_CU : Node_Id;
1844
1845 procedure Do_Withed_Units is new Walk_Withs (Do_Withed_Unit);
1846
1847 begin
1848 if not Seen (Unit_Num) then
1849
1850 -- Process the with clauses
1851
1852 Do_Withed_Units (CU, Include_Limited => False);
1853
1854 -- Process the unit if it is a spec or the main unit, if it
1855 -- has no previous spec or we have done all other units.
1856
1857 if not Nkind_In (Item, N_Package_Body, N_Subprogram_Body)
1858 or else Acts_As_Spec (CU)
1859 then
1860 if CU = Cunit (Main_Unit)
1861 and then not Do_Main
1862 then
1863 Seen (Unit_Num) := False;
1864
1865 else
1866 Seen (Unit_Num) := True;
1867
1868 if CU = Library_Unit (Main_CU) then
1869 Process_Bodies_In_Context (CU);
1870
1871 -- If main is a child unit, examine parent unit contexts
1872 -- to see if they include instantiated units. Also, if
1873 -- the parent itself is an instance, process its body
1874 -- because it may contain subprograms that are called
1875 -- in the main unit.
1876
1877 if Is_Child_Unit (Cunit_Entity (Main_Unit)) then
1878 Child := Cunit_Entity (Main_Unit);
1879 while Is_Child_Unit (Child) loop
1880 Parent_CU :=
1881 Cunit
1882 (Get_Cunit_Entity_Unit_Number (Scope (Child)));
1883 Process_Bodies_In_Context (Parent_CU);
1884
1885 if Nkind (Unit (Parent_CU)) = N_Package_Body
1886 and then
1887 Nkind (Original_Node (Unit (Parent_CU)))
1888 = N_Package_Instantiation
1889 and then
1890 not Seen (Get_Cunit_Unit_Number (Parent_CU))
1891 then
1892 Body_U := Get_Cunit_Unit_Number (Parent_CU);
1893 Seen (Body_U) := True;
1894 Do_Action (Parent_CU, Unit (Parent_CU));
1895 Done (Body_U) := True;
1896 end if;
1897
1898 Child := Scope (Child);
1899 end loop;
1900 end if;
1901 end if;
1902
1903 Do_Action (CU, Item);
1904 Done (Unit_Num) := True;
1905 end if;
1906 end if;
1907 end if;
1908 end Do_Unit_And_Dependents;
1909
1910 -------------------------------
1911 -- Process_Bodies_In_Context --
1912 -------------------------------
1913
1914 procedure Process_Bodies_In_Context (Comp : Node_Id) is
1915 Body_CU : Node_Id;
1916 Body_U : Unit_Number_Type;
1917 Clause : Node_Id;
1918 Spec : Node_Id;
1919
1920 procedure Do_Withed_Units is new Walk_Withs (Do_Withed_Unit);
1921
1922 -- Start of processing for Process_Bodies_In_Context
1923
1924 begin
1925 Clause := First (Context_Items (Comp));
1926 while Present (Clause) loop
1927 if Nkind (Clause) = N_With_Clause then
1928 Spec := Library_Unit (Clause);
1929 Body_CU := Library_Unit (Spec);
1930
1931 -- If we are processing the spec of the main unit, load bodies
1932 -- only if the with_clause indicates that it forced the loading
1933 -- of the body for a generic instantiation. Note that bodies of
1934 -- parents that are instances have been loaded already.
1935
1936 if Present (Body_CU)
1937 and then Body_CU /= Cunit (Main_Unit)
1938 and then Nkind (Unit (Body_CU)) /= N_Subprogram_Body
1939 and then (Nkind (Unit (Comp)) /= N_Package_Declaration
1940 or else Present (Withed_Body (Clause)))
1941 then
1942 Body_U := Get_Cunit_Unit_Number (Body_CU);
1943
1944 if not Seen (Body_U)
1945 and then not Depends_On_Main (Body_CU)
1946 then
1947 Seen (Body_U) := True;
1948 Do_Withed_Units (Body_CU, Include_Limited => False);
1949 Do_Action (Body_CU, Unit (Body_CU));
1950 Done (Body_U) := True;
1951 end if;
1952 end if;
1953 end if;
1954
1955 Next (Clause);
1956 end loop;
1957 end Process_Bodies_In_Context;
1958
1959 -- Local Declarations
1960
1961 Cur : Elmt_Id;
1962
1963 -- Start of processing for Walk_Library_Items
1964
1965 begin
1966 if Debug_Unit_Walk then
1967 Write_Line ("Walk_Library_Items:");
1968 Indent;
1969 end if;
1970
1971 -- Do Standard first, then walk the Comp_Unit_List
1972
1973 Do_Action (Empty, Standard_Package_Node);
1974
1975 -- First place the context of all instance bodies on the corresponding
1976 -- spec, because it may be needed to analyze the code at the place of
1977 -- the instantiation.
1978
1979 Cur := First_Elmt (Comp_Unit_List);
1980 while Present (Cur) loop
1981 declare
1982 CU : constant Node_Id := Node (Cur);
1983 N : constant Node_Id := Unit (CU);
1984
1985 begin
1986 if Nkind (N) = N_Package_Body
1987 and then Is_Generic_Instance (Defining_Entity (N))
1988 then
1989 Append_List
1990 (Context_Items (CU), Context_Items (Library_Unit (CU)));
1991 end if;
1992
1993 Next_Elmt (Cur);
1994 end;
1995 end loop;
1996
1997 -- Now traverse compilation units (specs) in order
1998
1999 Cur := First_Elmt (Comp_Unit_List);
2000 while Present (Cur) loop
2001 declare
2002 CU : constant Node_Id := Node (Cur);
2003 N : constant Node_Id := Unit (CU);
2004 Par : Entity_Id;
2005
2006 begin
2007 pragma Assert (Nkind (CU) = N_Compilation_Unit);
2008
2009 case Nkind (N) is
2010
2011 -- If it is a subprogram body, process it if it has no
2012 -- separate spec.
2013
2014 -- If it's a package body, ignore it, unless it is a body
2015 -- created for an instance that is the main unit. In the case
2016 -- of subprograms, the body is the wrapper package. In case of
2017 -- a package, the original file carries the body, and the spec
2018 -- appears as a later entry in the units list.
2019
2020 -- Otherwise bodies appear in the list only because of inlining
2021 -- or instantiations, and they are processed only if relevant.
2022 -- The flag Withed_Body on a context clause indicates that a
2023 -- unit contains an instantiation that may be needed later,
2024 -- and therefore the body that contains the generic body (and
2025 -- its context) must be traversed immediately after the
2026 -- corresponding spec (see Do_Unit_And_Dependents).
2027
2028 -- The main unit itself is processed separately after all other
2029 -- specs, and relevant bodies are examined in Process_Main.
2030
2031 when N_Subprogram_Body =>
2032 if Acts_As_Spec (N) then
2033 Do_Unit_And_Dependents (CU, N);
2034 end if;
2035
2036 when N_Package_Body =>
2037 if CU = Main_CU
2038 and then Nkind (Original_Node (Unit (Main_CU))) in
2039 N_Generic_Instantiation
2040 and then Present (Library_Unit (Main_CU))
2041 then
2042 Do_Unit_And_Dependents
2043 (Library_Unit (Main_CU),
2044 Unit (Library_Unit (Main_CU)));
2045 end if;
2046
2047 -- It's a spec, process it, and the units it depends on,
2048 -- unless it is a descendent of the main unit. This can
2049 -- happen when the body of a parent depends on some other
2050 -- descendent.
2051
2052 when others =>
2053 Par := Scope (Defining_Entity (Unit (CU)));
2054
2055 if Is_Child_Unit (Defining_Entity (Unit (CU))) then
2056 while Present (Par)
2057 and then Par /= Standard_Standard
2058 and then Par /= Cunit_Entity (Main_Unit)
2059 loop
2060 Par := Scope (Par);
2061 end loop;
2062 end if;
2063
2064 if Par /= Cunit_Entity (Main_Unit) then
2065 Do_Unit_And_Dependents (CU, N);
2066 end if;
2067 end case;
2068 end;
2069
2070 Next_Elmt (Cur);
2071 end loop;
2072
2073 -- Now process package bodies on which main depends, followed by bodies
2074 -- of parents, if present, and finally main itself.
2075
2076 if not Done (Main_Unit) then
2077 Do_Main := True;
2078
2079 Process_Main : declare
2080 Parent_CU : Node_Id;
2081 Body_CU : Node_Id;
2082 Body_U : Unit_Number_Type;
2083 Child : Entity_Id;
2084
2085 function Is_Subunit_Of_Main (U : Node_Id) return Boolean;
2086 -- If the main unit has subunits, their context may include
2087 -- bodies that are needed in the body of main. We must examine
2088 -- the context of the subunits, which are otherwise not made
2089 -- explicit in the main unit.
2090
2091 ------------------------
2092 -- Is_Subunit_Of_Main --
2093 ------------------------
2094
2095 function Is_Subunit_Of_Main (U : Node_Id) return Boolean is
2096 Lib : Node_Id;
2097 begin
2098 if No (U) then
2099 return False;
2100 else
2101 Lib := Library_Unit (U);
2102 return Nkind (Unit (U)) = N_Subunit
2103 and then
2104 (Lib = Cunit (Main_Unit)
2105 or else Is_Subunit_Of_Main (Lib));
2106 end if;
2107 end Is_Subunit_Of_Main;
2108
2109 -- Start of processing for Process_Main
2110
2111 begin
2112 Process_Bodies_In_Context (Main_CU);
2113
2114 for Unit_Num in Done'Range loop
2115 if Is_Subunit_Of_Main (Cunit (Unit_Num)) then
2116 Process_Bodies_In_Context (Cunit (Unit_Num));
2117 end if;
2118 end loop;
2119
2120 -- If the main unit is a child unit, parent bodies may be present
2121 -- because they export instances or inlined subprograms. Check for
2122 -- presence of these, which are not present in context clauses.
2123 -- Note that if the parents are instances, their bodies have been
2124 -- processed before the main spec, because they may be needed
2125 -- therein, so the following loop only affects non-instances.
2126
2127 if Is_Child_Unit (Cunit_Entity (Main_Unit)) then
2128 Child := Cunit_Entity (Main_Unit);
2129 while Is_Child_Unit (Child) loop
2130 Parent_CU :=
2131 Cunit (Get_Cunit_Entity_Unit_Number (Scope (Child)));
2132 Body_CU := Library_Unit (Parent_CU);
2133
2134 if Present (Body_CU)
2135 and then not Seen (Get_Cunit_Unit_Number (Body_CU))
2136 and then not Depends_On_Main (Body_CU)
2137 then
2138 Body_U := Get_Cunit_Unit_Number (Body_CU);
2139 Seen (Body_U) := True;
2140 Do_Action (Body_CU, Unit (Body_CU));
2141 Done (Body_U) := True;
2142 end if;
2143
2144 Child := Scope (Child);
2145 end loop;
2146 end if;
2147
2148 Do_Action (Main_CU, Unit (Main_CU));
2149 Done (Main_Unit) := True;
2150 end Process_Main;
2151 end if;
2152
2153 if Debug_Unit_Walk then
2154 if Done /= (Done'Range => True) then
2155 Write_Eol;
2156 Write_Line ("Ignored units:");
2157
2158 Indent;
2159
2160 for Unit_Num in Done'Range loop
2161 if not Done (Unit_Num) then
2162 Write_Unit_Info
2163 (Unit_Num, Unit (Cunit (Unit_Num)), Withs => True);
2164 end if;
2165 end loop;
2166
2167 Outdent;
2168 end if;
2169 end if;
2170
2171 pragma Assert (Done (Main_Unit));
2172
2173 if Debug_Unit_Walk then
2174 Outdent;
2175 Write_Line ("end Walk_Library_Items.");
2176 end if;
2177 end Walk_Library_Items;
2178
2179 ----------------
2180 -- Walk_Withs --
2181 ----------------
2182
2183 procedure Walk_Withs (CU : Node_Id; Include_Limited : Boolean) is
2184 pragma Assert (Nkind (CU) = N_Compilation_Unit);
2185 pragma Assert (Nkind (Unit (CU)) /= N_Subunit);
2186
2187 procedure Walk_Immediate is new Walk_Withs_Immediate (Action);
2188
2189 begin
2190 -- First walk the withs immediately on the library item
2191
2192 Walk_Immediate (CU, Include_Limited);
2193
2194 -- For a body, we must also check for any subunits which belong to it
2195 -- and which have context clauses of their own, since these with'ed
2196 -- units are part of its own dependencies.
2197
2198 if Nkind (Unit (CU)) in N_Unit_Body then
2199 for S in Main_Unit .. Last_Unit loop
2200
2201 -- We are only interested in subunits. For preproc. data and def.
2202 -- files, Cunit is Empty, so we need to test that first.
2203
2204 if Cunit (S) /= Empty
2205 and then Nkind (Unit (Cunit (S))) = N_Subunit
2206 then
2207 declare
2208 Pnode : Node_Id;
2209
2210 begin
2211 Pnode := Library_Unit (Cunit (S));
2212
2213 -- In -gnatc mode, the errors in the subunits will not have
2214 -- been recorded, but the analysis of the subunit may have
2215 -- failed, so just quit.
2216
2217 if No (Pnode) then
2218 exit;
2219 end if;
2220
2221 -- Find ultimate parent of the subunit
2222
2223 while Nkind (Unit (Pnode)) = N_Subunit loop
2224 Pnode := Library_Unit (Pnode);
2225 end loop;
2226
2227 -- See if it belongs to current unit, and if so, include its
2228 -- with_clauses. Do not process main unit prematurely.
2229
2230 if Pnode = CU and then CU /= Cunit (Main_Unit) then
2231 Walk_Immediate (Cunit (S), Include_Limited);
2232 end if;
2233 end;
2234 end if;
2235 end loop;
2236 end if;
2237 end Walk_Withs;
2238
2239 --------------------------
2240 -- Walk_Withs_Immediate --
2241 --------------------------
2242
2243 procedure Walk_Withs_Immediate (CU : Node_Id; Include_Limited : Boolean) is
2244 pragma Assert (Nkind (CU) = N_Compilation_Unit);
2245
2246 Context_Item : Node_Id;
2247 Lib_Unit : Node_Id;
2248 Body_CU : Node_Id;
2249
2250 begin
2251 Context_Item := First (Context_Items (CU));
2252 while Present (Context_Item) loop
2253 if Nkind (Context_Item) = N_With_Clause
2254 and then (Include_Limited
2255 or else not Limited_Present (Context_Item))
2256 then
2257 Lib_Unit := Library_Unit (Context_Item);
2258 Action (Lib_Unit);
2259
2260 -- If the context item indicates that a package body is needed
2261 -- because of an instantiation in CU, traverse the body now, even
2262 -- if CU is not related to the main unit. If the generic itself
2263 -- appears in a package body, the context item is this body, and
2264 -- it already appears in the traversal order, so we only need to
2265 -- examine the case of a context item being a package declaration.
2266
2267 if Present (Withed_Body (Context_Item))
2268 and then Nkind (Unit (Lib_Unit)) = N_Package_Declaration
2269 and then Present (Corresponding_Body (Unit (Lib_Unit)))
2270 then
2271 Body_CU :=
2272 Parent
2273 (Unit_Declaration_Node
2274 (Corresponding_Body (Unit (Lib_Unit))));
2275
2276 -- A body may have an implicit with on its own spec, in which
2277 -- case we must ignore this context item to prevent looping.
2278
2279 if Unit (CU) /= Unit (Body_CU) then
2280 Action (Body_CU);
2281 end if;
2282 end if;
2283 end if;
2284
2285 Context_Item := Next (Context_Item);
2286 end loop;
2287 end Walk_Withs_Immediate;
2288
2289 end Sem;