[multiple changes]
[gcc.git] / gcc / ada / lib-xref.adb
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT COMPILER COMPONENTS --
4 -- --
5 -- L I B . X R E F --
6 -- --
7 -- B o d y --
8 -- --
9 -- Copyright (C) 1998-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 Csets; use Csets;
28 with Elists; use Elists;
29 with Errout; use Errout;
30 with Nlists; use Nlists;
31 with Opt; use Opt;
32 with Restrict; use Restrict;
33 with Rident; use Rident;
34 with Sem; use Sem;
35 with Sem_Aux; use Sem_Aux;
36 with Sem_Prag; use Sem_Prag;
37 with Sem_Util; use Sem_Util;
38 with Sem_Warn; use Sem_Warn;
39 with Sinfo; use Sinfo;
40 with Sinput; use Sinput;
41 with Snames; use Snames;
42 with Stringt; use Stringt;
43 with Stand; use Stand;
44 with Table; use Table;
45
46 with GNAT.Heap_Sort_G;
47 with GNAT.HTable;
48
49 package body Lib.Xref is
50
51 ------------------
52 -- Declarations --
53 ------------------
54
55 -- The Xref table is used to record references. The Loc field is set
56 -- to No_Location for a definition entry.
57
58 subtype Xref_Entry_Number is Int;
59
60 type Xref_Key is record
61 -- These are the components of Xref_Entry that participate in hash
62 -- lookups.
63
64 Ent : Entity_Id;
65 -- Entity referenced (E parameter to Generate_Reference)
66
67 Loc : Source_Ptr;
68 -- Location of reference (Original_Location (Sloc field of N parameter
69 -- to Generate_Reference). Set to No_Location for the case of a
70 -- defining occurrence.
71
72 Typ : Character;
73 -- Reference type (Typ param to Generate_Reference)
74
75 Eun : Unit_Number_Type;
76 -- Unit number corresponding to Ent
77
78 Lun : Unit_Number_Type;
79 -- Unit number corresponding to Loc. Value is undefined and not
80 -- referenced if Loc is set to No_Location.
81
82 -- The following components are only used for SPARK cross-references
83
84 Ref_Scope : Entity_Id;
85 -- Entity of the closest subprogram or package enclosing the reference
86
87 Ent_Scope : Entity_Id;
88 -- Entity of the closest subprogram or package enclosing the definition,
89 -- which should be located in the same file as the definition itself.
90 end record;
91
92 type Xref_Entry is record
93 Key : Xref_Key;
94
95 Ent_Scope_File : Unit_Number_Type;
96 -- File for entity Ent_Scope
97
98 Def : Source_Ptr;
99 -- Original source location for entity being referenced. Note that these
100 -- values are used only during the output process, they are not set when
101 -- the entries are originally built. This is because private entities
102 -- can be swapped when the initial call is made.
103
104 HTable_Next : Xref_Entry_Number;
105 -- For use only by Static_HTable
106 end record;
107
108 package Xrefs is new Table.Table (
109 Table_Component_Type => Xref_Entry,
110 Table_Index_Type => Xref_Entry_Number,
111 Table_Low_Bound => 1,
112 Table_Initial => Alloc.Xrefs_Initial,
113 Table_Increment => Alloc.Xrefs_Increment,
114 Table_Name => "Xrefs");
115
116 --------------
117 -- Xref_Set --
118 --------------
119
120 -- We keep a set of xref entries, in order to avoid inserting duplicate
121 -- entries into the above Xrefs table. An entry is in Xref_Set if and only
122 -- if it is in Xrefs.
123
124 Num_Buckets : constant := 2**16;
125
126 subtype Header_Num is Integer range 0 .. Num_Buckets - 1;
127 type Null_Type is null record;
128 pragma Unreferenced (Null_Type);
129
130 function Hash (F : Xref_Entry_Number) return Header_Num;
131
132 function Equal (F1, F2 : Xref_Entry_Number) return Boolean;
133
134 procedure HT_Set_Next (E : Xref_Entry_Number; Next : Xref_Entry_Number);
135
136 function HT_Next (E : Xref_Entry_Number) return Xref_Entry_Number;
137
138 function Get_Key (E : Xref_Entry_Number) return Xref_Entry_Number;
139
140 pragma Inline (Hash, Equal, HT_Set_Next, HT_Next, Get_Key);
141
142 package Xref_Set is new GNAT.HTable.Static_HTable (
143 Header_Num,
144 Element => Xref_Entry,
145 Elmt_Ptr => Xref_Entry_Number,
146 Null_Ptr => 0,
147 Set_Next => HT_Set_Next,
148 Next => HT_Next,
149 Key => Xref_Entry_Number,
150 Get_Key => Get_Key,
151 Hash => Hash,
152 Equal => Equal);
153
154 -----------------------------
155 -- SPARK Xrefs Information --
156 -----------------------------
157
158 package body SPARK_Specific is separate;
159
160 ------------------------
161 -- Local Subprograms --
162 ------------------------
163
164 procedure Add_Entry (Key : Xref_Key; Ent_Scope_File : Unit_Number_Type);
165 -- Add an entry to the tables of Xref_Entries, avoiding duplicates
166
167 procedure Generate_Prim_Op_References (Typ : Entity_Id);
168 -- For a tagged type, generate implicit references to its primitive
169 -- operations, for source navigation. This is done right before emitting
170 -- cross-reference information rather than at the freeze point of the type
171 -- in order to handle late bodies that are primitive operations.
172
173 function Lt (T1, T2 : Xref_Entry) return Boolean;
174 -- Order cross-references
175
176 ---------------
177 -- Add_Entry --
178 ---------------
179
180 procedure Add_Entry (Key : Xref_Key; Ent_Scope_File : Unit_Number_Type) is
181 begin
182 Xrefs.Increment_Last; -- tentative
183 Xrefs.Table (Xrefs.Last).Key := Key;
184
185 -- Set the entry in Xref_Set, and if newly set, keep the above
186 -- tentative increment.
187
188 if Xref_Set.Set_If_Not_Present (Xrefs.Last) then
189 Xrefs.Table (Xrefs.Last).Ent_Scope_File := Ent_Scope_File;
190 -- Leave Def and HTable_Next uninitialized
191
192 Set_Has_Xref_Entry (Key.Ent);
193
194 -- It was already in Xref_Set, so throw away the tentatively-added
195 -- entry
196
197 else
198 Xrefs.Decrement_Last;
199 end if;
200 end Add_Entry;
201
202 -----------
203 -- Equal --
204 -----------
205
206 function Equal (F1, F2 : Xref_Entry_Number) return Boolean is
207 Result : constant Boolean :=
208 Xrefs.Table (F1).Key = Xrefs.Table (F2).Key;
209 begin
210 return Result;
211 end Equal;
212
213 -------------------------
214 -- Generate_Definition --
215 -------------------------
216
217 procedure Generate_Definition (E : Entity_Id) is
218 begin
219 pragma Assert (Nkind (E) in N_Entity);
220
221 -- Note that we do not test Xref_Entity_Letters here. It is too early
222 -- to do so, since we are often called before the entity is fully
223 -- constructed, so that the Ekind is still E_Void.
224
225 if Opt.Xref_Active
226
227 -- Definition must come from source
228
229 -- We make an exception for subprogram child units that have no spec.
230 -- For these we generate a subprogram declaration for library use,
231 -- and the corresponding entity does not come from source.
232 -- Nevertheless, all references will be attached to it and we have
233 -- to treat is as coming from user code.
234
235 and then (Comes_From_Source (E) or else Is_Child_Unit (E))
236
237 -- And must have a reasonable source location that is not
238 -- within an instance (all entities in instances are ignored)
239
240 and then Sloc (E) > No_Location
241 and then Instantiation_Location (Sloc (E)) = No_Location
242
243 -- And must be a non-internal name from the main source unit
244
245 and then In_Extended_Main_Source_Unit (E)
246 and then not Is_Internal_Name (Chars (E))
247 then
248 Add_Entry
249 ((Ent => E,
250 Loc => No_Location,
251 Typ => ' ',
252 Eun => Get_Source_Unit (Original_Location (Sloc (E))),
253 Lun => No_Unit,
254 Ref_Scope => Empty,
255 Ent_Scope => Empty),
256 Ent_Scope_File => No_Unit);
257
258 if In_Inlined_Body then
259 Set_Referenced (E);
260 end if;
261 end if;
262 end Generate_Definition;
263
264 ---------------------------------
265 -- Generate_Operator_Reference --
266 ---------------------------------
267
268 procedure Generate_Operator_Reference
269 (N : Node_Id;
270 T : Entity_Id)
271 is
272 begin
273 if not In_Extended_Main_Source_Unit (N) then
274 return;
275 end if;
276
277 -- If the operator is not a Standard operator, then we generate a real
278 -- reference to the user defined operator.
279
280 if Sloc (Entity (N)) /= Standard_Location then
281 Generate_Reference (Entity (N), N);
282
283 -- A reference to an implicit inequality operator is also a reference
284 -- to the user-defined equality.
285
286 if Nkind (N) = N_Op_Ne
287 and then not Comes_From_Source (Entity (N))
288 and then Present (Corresponding_Equality (Entity (N)))
289 then
290 Generate_Reference (Corresponding_Equality (Entity (N)), N);
291 end if;
292
293 -- For the case of Standard operators, we mark the result type as
294 -- referenced. This ensures that in the case where we are using a
295 -- derived operator, we mark an entity of the unit that implicitly
296 -- defines this operator as used. Otherwise we may think that no entity
297 -- of the unit is used. The actual entity marked as referenced is the
298 -- first subtype, which is the relevant user defined entity.
299
300 -- Note: we only do this for operators that come from source. The
301 -- generated code sometimes reaches for entities that do not need to be
302 -- explicitly visible (for example, when we expand the code for
303 -- comparing two record objects, the fields of the record may not be
304 -- visible).
305
306 elsif Comes_From_Source (N) then
307 Set_Referenced (First_Subtype (T));
308 end if;
309 end Generate_Operator_Reference;
310
311 ---------------------------------
312 -- Generate_Prim_Op_References --
313 ---------------------------------
314
315 procedure Generate_Prim_Op_References (Typ : Entity_Id) is
316 Base_T : Entity_Id;
317 Prim : Elmt_Id;
318 Prim_List : Elist_Id;
319
320 begin
321 -- Handle subtypes of synchronized types
322
323 if Ekind (Typ) = E_Protected_Subtype
324 or else Ekind (Typ) = E_Task_Subtype
325 then
326 Base_T := Etype (Typ);
327 else
328 Base_T := Typ;
329 end if;
330
331 -- References to primitive operations are only relevant for tagged types
332
333 if not Is_Tagged_Type (Base_T)
334 or else Is_Class_Wide_Type (Base_T)
335 then
336 return;
337 end if;
338
339 -- Ada 2005 (AI-345): For synchronized types generate reference to the
340 -- wrapper that allow us to dispatch calls through their implemented
341 -- abstract interface types.
342
343 -- The check for Present here is to protect against previously reported
344 -- critical errors.
345
346 Prim_List := Primitive_Operations (Base_T);
347
348 if No (Prim_List) then
349 return;
350 end if;
351
352 Prim := First_Elmt (Prim_List);
353 while Present (Prim) loop
354
355 -- If the operation is derived, get the original for cross-reference
356 -- reference purposes (it is the original for which we want the xref
357 -- and for which the comes_from_source test must be performed).
358
359 Generate_Reference
360 (Typ, Ultimate_Alias (Node (Prim)), 'p', Set_Ref => False);
361 Next_Elmt (Prim);
362 end loop;
363 end Generate_Prim_Op_References;
364
365 ------------------------
366 -- Generate_Reference --
367 ------------------------
368
369 procedure Generate_Reference
370 (E : Entity_Id;
371 N : Node_Id;
372 Typ : Character := 'r';
373 Set_Ref : Boolean := True;
374 Force : Boolean := False)
375 is
376 Actual_Typ : Character := Typ;
377 Call : Node_Id;
378 Def : Source_Ptr;
379 Ent : Entity_Id;
380 Ent_Scope : Entity_Id;
381 Formal : Entity_Id;
382 Kind : Entity_Kind;
383 Nod : Node_Id;
384 Ref : Source_Ptr;
385 Ref_Scope : Entity_Id;
386
387 function Get_Through_Renamings (E : Entity_Id) return Entity_Id;
388 -- Get the enclosing entity through renamings, which may come from
389 -- source or from the translation of generic instantiations.
390
391 function Is_On_LHS (Node : Node_Id) return Boolean;
392 -- Used to check if a node is on the left hand side of an assignment.
393 -- The following cases are handled:
394 --
395 -- Variable Node is a direct descendant of left hand side of an
396 -- assignment statement.
397 --
398 -- Prefix Of an indexed or selected component that is present in
399 -- a subtree rooted by an assignment statement. There is
400 -- no restriction of nesting of components, thus cases
401 -- such as A.B (C).D are handled properly. However a prefix
402 -- of a dereference (either implicit or explicit) is never
403 -- considered as on a LHS.
404 --
405 -- Out param Same as above cases, but OUT parameter
406
407 function OK_To_Set_Referenced return Boolean;
408 -- Returns True if the Referenced flag can be set. There are a few
409 -- exceptions where we do not want to set this flag, see body for
410 -- details of these exceptional cases.
411
412 ---------------------------
413 -- Get_Through_Renamings --
414 ---------------------------
415
416 function Get_Through_Renamings (E : Entity_Id) return Entity_Id is
417 Result : Entity_Id := E;
418 begin
419 while Present (Result)
420 and then Is_Object (Result)
421 and then Present (Renamed_Object (Result))
422 loop
423 Result := Get_Enclosing_Object (Renamed_Object (Result));
424 end loop;
425 return Result;
426 end Get_Through_Renamings;
427
428 ---------------
429 -- Is_On_LHS --
430 ---------------
431
432 -- ??? There are several routines here and there that perform a similar
433 -- (but subtly different) computation, which should be factored:
434
435 -- Sem_Util.Is_LHS
436 -- Sem_Util.May_Be_Lvalue
437 -- Sem_Util.Known_To_Be_Assigned
438 -- Exp_Ch2.Expand_Entry_Parameter.In_Assignment_Context
439 -- Exp_Smem.Is_Out_Actual
440
441 function Is_On_LHS (Node : Node_Id) return Boolean is
442 N : Node_Id;
443 P : Node_Id;
444 K : Node_Kind;
445
446 begin
447 -- Only identifiers are considered, is this necessary???
448
449 if Nkind (Node) /= N_Identifier then
450 return False;
451 end if;
452
453 -- Immediate return if appeared as OUT parameter
454
455 if Kind = E_Out_Parameter then
456 return True;
457 end if;
458
459 -- Search for assignment statement subtree root
460
461 N := Node;
462 loop
463 P := Parent (N);
464 K := Nkind (P);
465
466 if K = N_Assignment_Statement then
467 return Name (P) = N;
468
469 -- Check whether the parent is a component and the current node is
470 -- its prefix, but return False if the current node has an access
471 -- type, as in that case the selected or indexed component is an
472 -- implicit dereference, and the LHS is the designated object, not
473 -- the access object.
474
475 -- ??? case of a slice assignment?
476
477 elsif (K = N_Selected_Component or else K = N_Indexed_Component)
478 and then Prefix (P) = N
479 then
480 -- Check for access type. First a kludge, In some cases this is
481 -- called too early (see comments in Sem_Ch8.Find_Direct_Name),
482 -- at a point where the tree is not fully typed yet. In that
483 -- case we may lack an Etype for N, and we can't check the
484 -- Etype. For now, we always return False in such a case,
485 -- but this is clearly not right in all cases ???
486
487 if No (Etype (N)) then
488 return False;
489
490 elsif Is_Access_Type (Etype (N)) then
491 return False;
492
493 -- Access type case dealt with, keep going
494
495 else
496 N := P;
497 end if;
498
499 -- All other cases, definitely not on left side
500
501 else
502 return False;
503 end if;
504 end loop;
505 end Is_On_LHS;
506
507 ---------------------------
508 -- OK_To_Set_Referenced --
509 ---------------------------
510
511 function OK_To_Set_Referenced return Boolean is
512 P : Node_Id;
513
514 begin
515 -- A reference from a pragma Unreferenced or pragma Unmodified or
516 -- pragma Warnings does not cause the Referenced flag to be set.
517 -- This avoids silly warnings about things being referenced and
518 -- not assigned when the only reference is from the pragma.
519
520 if Nkind (N) = N_Identifier then
521 P := Parent (N);
522
523 if Nkind (P) = N_Pragma_Argument_Association then
524 P := Parent (P);
525
526 if Nkind (P) = N_Pragma then
527 if Nam_In (Pragma_Name (P), Name_Warnings,
528 Name_Unmodified,
529 Name_Unreferenced)
530 then
531 return False;
532 end if;
533 end if;
534
535 -- A reference to a formal in a named parameter association does
536 -- not make the formal referenced. Formals that are unused in the
537 -- subprogram body are properly flagged as such, even if calls
538 -- elsewhere use named notation.
539
540 elsif Nkind (P) = N_Parameter_Association
541 and then N = Selector_Name (P)
542 then
543 return False;
544 end if;
545 end if;
546
547 return True;
548 end OK_To_Set_Referenced;
549
550 -- Start of processing for Generate_Reference
551
552 begin
553 pragma Assert (Nkind (E) in N_Entity);
554 Find_Actual (N, Formal, Call);
555
556 if Present (Formal) then
557 Kind := Ekind (Formal);
558 else
559 Kind := E_Void;
560 end if;
561
562 -- Check for obsolescent reference to package ASCII. GNAT treats this
563 -- element of annex J specially since in practice, programs make a lot
564 -- of use of this feature, so we don't include it in the set of features
565 -- diagnosed when Warn_On_Obsolescent_Features mode is set. However we
566 -- are required to note it as a violation of the RM defined restriction.
567
568 if E = Standard_ASCII then
569 Check_Restriction (No_Obsolescent_Features, N);
570 end if;
571
572 -- Check for reference to entity marked with Is_Obsolescent
573
574 -- Note that we always allow obsolescent references in the compiler
575 -- itself and the run time, since we assume that we know what we are
576 -- doing in such cases. For example the calls in Ada.Characters.Handling
577 -- to its own obsolescent subprograms are just fine.
578
579 -- In any case we only generate warnings if we are in the extended main
580 -- source unit, and the entity itself is not in the extended main source
581 -- unit, since we assume the source unit itself knows what is going on
582 -- (and for sure we do not want silly warnings, e.g. on the end line of
583 -- an obsolescent procedure body).
584
585 if Is_Obsolescent (E)
586 and then not GNAT_Mode
587 and then not In_Extended_Main_Source_Unit (E)
588 and then In_Extended_Main_Source_Unit (N)
589 then
590 Check_Restriction (No_Obsolescent_Features, N);
591
592 if Warn_On_Obsolescent_Feature then
593 Output_Obsolescent_Entity_Warnings (N, E);
594 end if;
595 end if;
596
597 -- Warn if reference to Ada 2005 entity not in Ada 2005 mode. We only
598 -- detect real explicit references (modifications and references).
599
600 if Comes_From_Source (N)
601 and then Is_Ada_2005_Only (E)
602 and then Ada_Version < Ada_2005
603 and then Warn_On_Ada_2005_Compatibility
604 and then (Typ = 'm' or else Typ = 'r' or else Typ = 's')
605 then
606 Error_Msg_NE ("& is only defined in Ada 2005?y?", N, E);
607 end if;
608
609 -- Warn if reference to Ada 2012 entity not in Ada 2012 mode. We only
610 -- detect real explicit references (modifications and references).
611
612 if Comes_From_Source (N)
613 and then Is_Ada_2012_Only (E)
614 and then Ada_Version < Ada_2012
615 and then Warn_On_Ada_2012_Compatibility
616 and then (Typ = 'm' or else Typ = 'r')
617 then
618 Error_Msg_NE ("& is only defined in Ada 2012?y?", N, E);
619 end if;
620
621 -- Do not generate references if we are within a postcondition sub-
622 -- program, because the reference does not comes from source, and the
623 -- pre-analysis of the aspect has already created an entry for the ali
624 -- file at the proper source location.
625
626 if Chars (Current_Scope) = Name_uPostconditions then
627 return;
628 end if;
629
630 -- Never collect references if not in main source unit. However, we omit
631 -- this test if Typ is 'e' or 'k', since these entries are structural,
632 -- and it is useful to have them in units that reference packages as
633 -- well as units that define packages. We also omit the test for the
634 -- case of 'p' since we want to include inherited primitive operations
635 -- from other packages.
636
637 -- We also omit this test is this is a body reference for a subprogram
638 -- instantiation. In this case the reference is to the generic body,
639 -- which clearly need not be in the main unit containing the instance.
640 -- For the same reason we accept an implicit reference generated for
641 -- a default in an instance.
642
643 if not In_Extended_Main_Source_Unit (N) then
644 if Typ = 'e'
645 or else Typ = 'I'
646 or else Typ = 'p'
647 or else Typ = 'i'
648 or else Typ = 'k'
649 or else (Typ = 'b' and then Is_Generic_Instance (E))
650
651 -- Allow the generation of references to reads, writes and calls
652 -- in SPARK mode when the related context comes from an instance.
653
654 or else
655 (GNATprove_Mode
656 and then In_Extended_Main_Code_Unit (N)
657 and then (Typ = 'm' or else Typ = 'r' or else Typ = 's'))
658 then
659 null;
660 else
661 return;
662 end if;
663 end if;
664
665 -- For reference type p, the entity must be in main source unit
666
667 if Typ = 'p' and then not In_Extended_Main_Source_Unit (E) then
668 return;
669 end if;
670
671 -- Unless the reference is forced, we ignore references where the
672 -- reference itself does not come from source.
673
674 if not Force and then not Comes_From_Source (N) then
675 return;
676 end if;
677
678 -- Deal with setting entity as referenced, unless suppressed. Note that
679 -- we still do Set_Referenced on entities that do not come from source.
680 -- This situation arises when we have a source reference to a derived
681 -- operation, where the derived operation itself does not come from
682 -- source, but we still want to mark it as referenced, since we really
683 -- are referencing an entity in the corresponding package (this avoids
684 -- wrong complaints that the package contains no referenced entities).
685
686 if Set_Ref then
687
688 -- Assignable object appearing on left side of assignment or as
689 -- an out parameter.
690
691 if Is_Assignable (E)
692 and then Is_On_LHS (N)
693 and then Ekind (E) /= E_In_Out_Parameter
694 then
695 -- For objects that are renamings, just set as simply referenced
696 -- we do not try to do assignment type tracking in this case.
697
698 if Present (Renamed_Object (E)) then
699 Set_Referenced (E);
700
701 -- Out parameter case
702
703 elsif Kind = E_Out_Parameter then
704
705 -- If warning mode for all out parameters is set, or this is
706 -- the only warning parameter, then we want to mark this for
707 -- later warning logic by setting Referenced_As_Out_Parameter
708
709 if Warn_On_Modified_As_Out_Parameter (Formal) then
710 Set_Referenced_As_Out_Parameter (E, True);
711 Set_Referenced_As_LHS (E, False);
712
713 -- For OUT parameter not covered by the above cases, we simply
714 -- regard it as a normal reference (in this case we do not
715 -- want any of the warning machinery for out parameters).
716
717 else
718 Set_Referenced (E);
719 end if;
720
721 -- For the left hand of an assignment case, we do nothing here.
722 -- The processing for Analyze_Assignment_Statement will set the
723 -- Referenced_As_LHS flag.
724
725 else
726 null;
727 end if;
728
729 -- Check for a reference in a pragma that should not count as a
730 -- making the variable referenced for warning purposes.
731
732 elsif Is_Non_Significant_Pragma_Reference (N) then
733 null;
734
735 -- A reference in an attribute definition clause does not count as a
736 -- reference except for the case of Address. The reason that 'Address
737 -- is an exception is that it creates an alias through which the
738 -- variable may be referenced.
739
740 elsif Nkind (Parent (N)) = N_Attribute_Definition_Clause
741 and then Chars (Parent (N)) /= Name_Address
742 and then N = Name (Parent (N))
743 then
744 null;
745
746 -- Constant completion does not count as a reference
747
748 elsif Typ = 'c'
749 and then Ekind (E) = E_Constant
750 then
751 null;
752
753 -- Record representation clause does not count as a reference
754
755 elsif Nkind (N) = N_Identifier
756 and then Nkind (Parent (N)) = N_Record_Representation_Clause
757 then
758 null;
759
760 -- Discriminants do not need to produce a reference to record type
761
762 elsif Typ = 'd'
763 and then Nkind (Parent (N)) = N_Discriminant_Specification
764 then
765 null;
766
767 -- All other cases
768
769 else
770 -- Special processing for IN OUT parameters, where we have an
771 -- implicit assignment to a simple variable.
772
773 if Kind = E_In_Out_Parameter
774 and then Is_Assignable (E)
775 then
776 -- For sure this counts as a normal read reference
777
778 Set_Referenced (E);
779 Set_Last_Assignment (E, Empty);
780
781 -- We count it as being referenced as an out parameter if the
782 -- option is set to warn on all out parameters, except that we
783 -- have a special exclusion for an intrinsic subprogram, which
784 -- is most likely an instantiation of Unchecked_Deallocation
785 -- which we do not want to consider as an assignment since it
786 -- generates false positives. We also exclude the case of an
787 -- IN OUT parameter if the name of the procedure is Free,
788 -- since we suspect similar semantics.
789
790 if Warn_On_All_Unread_Out_Parameters
791 and then Is_Entity_Name (Name (Call))
792 and then not Is_Intrinsic_Subprogram (Entity (Name (Call)))
793 and then Chars (Name (Call)) /= Name_Free
794 then
795 Set_Referenced_As_Out_Parameter (E, True);
796 Set_Referenced_As_LHS (E, False);
797 end if;
798
799 -- Don't count a recursive reference within a subprogram as a
800 -- reference (that allows detection of a recursive subprogram
801 -- whose only references are recursive calls as unreferenced).
802
803 elsif Is_Subprogram (E)
804 and then E = Nearest_Dynamic_Scope (Current_Scope)
805 then
806 null;
807
808 -- Any other occurrence counts as referencing the entity
809
810 elsif OK_To_Set_Referenced then
811 Set_Referenced (E);
812
813 -- If variable, this is an OK reference after an assignment
814 -- so we can clear the Last_Assignment indication.
815
816 if Is_Assignable (E) then
817 Set_Last_Assignment (E, Empty);
818 end if;
819 end if;
820 end if;
821
822 -- Check for pragma Unreferenced given and reference is within
823 -- this source unit (occasion for possible warning to be issued).
824
825 if Has_Unreferenced (E)
826 and then In_Same_Extended_Unit (E, N)
827 then
828 -- A reference as a named parameter in a call does not count
829 -- as a violation of pragma Unreferenced for this purpose...
830
831 if Nkind (N) = N_Identifier
832 and then Nkind (Parent (N)) = N_Parameter_Association
833 and then Selector_Name (Parent (N)) = N
834 then
835 null;
836
837 -- ... Neither does a reference to a variable on the left side
838 -- of an assignment.
839
840 elsif Is_On_LHS (N) then
841 null;
842
843 -- For entry formals, we want to place the warning message on the
844 -- corresponding entity in the accept statement. The current scope
845 -- is the body of the accept, so we find the formal whose name
846 -- matches that of the entry formal (there is no link between the
847 -- two entities, and the one in the accept statement is only used
848 -- for conformance checking).
849
850 elsif Ekind (Scope (E)) = E_Entry then
851 declare
852 BE : Entity_Id;
853
854 begin
855 BE := First_Entity (Current_Scope);
856 while Present (BE) loop
857 if Chars (BE) = Chars (E) then
858 Error_Msg_NE -- CODEFIX
859 ("??pragma Unreferenced given for&!", N, BE);
860 exit;
861 end if;
862
863 Next_Entity (BE);
864 end loop;
865 end;
866
867 -- Here we issue the warning, since this is a real reference
868
869 else
870 Error_Msg_NE -- CODEFIX
871 ("??pragma Unreferenced given for&!", N, E);
872 end if;
873 end if;
874
875 -- If this is a subprogram instance, mark as well the internal
876 -- subprogram in the wrapper package, which may be a visible
877 -- compilation unit.
878
879 if Is_Overloadable (E)
880 and then Is_Generic_Instance (E)
881 and then Present (Alias (E))
882 then
883 Set_Referenced (Alias (E));
884 end if;
885 end if;
886
887 -- Generate reference if all conditions are met:
888
889 if
890 -- Cross referencing must be active
891
892 Opt.Xref_Active
893
894 -- The entity must be one for which we collect references
895
896 and then Xref_Entity_Letters (Ekind (E)) /= ' '
897
898 -- Both Sloc values must be set to something sensible
899
900 and then Sloc (E) > No_Location
901 and then Sloc (N) > No_Location
902
903 -- Ignore references from within an instance. The only exceptions to
904 -- this are default subprograms, for which we generate an implicit
905 -- reference and compilations in SPARK mode.
906
907 and then
908 (Instantiation_Location (Sloc (N)) = No_Location
909 or else Typ = 'i'
910 or else GNATprove_Mode)
911
912 -- Ignore dummy references
913
914 and then Typ /= ' '
915 then
916 if Nkind_In (N, N_Identifier,
917 N_Defining_Identifier,
918 N_Defining_Operator_Symbol,
919 N_Operator_Symbol,
920 N_Defining_Character_Literal)
921 or else Nkind (N) in N_Op
922 or else (Nkind (N) = N_Character_Literal
923 and then Sloc (Entity (N)) /= Standard_Location)
924 then
925 Nod := N;
926
927 elsif Nkind_In (N, N_Expanded_Name, N_Selected_Component) then
928 Nod := Selector_Name (N);
929
930 else
931 return;
932 end if;
933
934 -- Normal case of source entity comes from source
935
936 if Comes_From_Source (E) then
937 Ent := E;
938
939 -- Entity does not come from source, but is a derived subprogram and
940 -- the derived subprogram comes from source (after one or more
941 -- derivations) in which case the reference is to parent subprogram.
942
943 elsif Is_Overloadable (E)
944 and then Present (Alias (E))
945 then
946 Ent := Alias (E);
947 while not Comes_From_Source (Ent) loop
948 if No (Alias (Ent)) then
949 return;
950 end if;
951
952 Ent := Alias (Ent);
953 end loop;
954
955 -- The internally created defining entity for a child subprogram
956 -- that has no previous spec has valid references.
957
958 elsif Is_Overloadable (E)
959 and then Is_Child_Unit (E)
960 then
961 Ent := E;
962
963 -- Ditto for the formals of such a subprogram
964
965 elsif Is_Overloadable (Scope (E))
966 and then Is_Child_Unit (Scope (E))
967 then
968 Ent := E;
969
970 -- Record components of discriminated subtypes or derived types must
971 -- be treated as references to the original component.
972
973 elsif Ekind (E) = E_Component
974 and then Comes_From_Source (Original_Record_Component (E))
975 then
976 Ent := Original_Record_Component (E);
977
978 -- If this is an expanded reference to a discriminant, recover the
979 -- original discriminant, which gets the reference.
980
981 elsif Ekind (E) = E_In_Parameter
982 and then Present (Discriminal_Link (E))
983 then
984 Ent := Discriminal_Link (E);
985 Set_Referenced (Ent);
986
987 -- Ignore reference to any other entity that is not from source
988
989 else
990 return;
991 end if;
992
993 -- In SPARK mode, consider the underlying entity renamed instead of
994 -- the renaming, which is needed to compute a valid set of effects
995 -- (reads, writes) for the enclosing subprogram.
996
997 if GNATprove_Mode then
998 Ent := Get_Through_Renamings (Ent);
999
1000 -- If no enclosing object, then it could be a reference to any
1001 -- location not tracked individually, like heap-allocated data.
1002 -- Conservatively approximate this possibility by generating a
1003 -- dereference, and return.
1004
1005 if No (Ent) then
1006 if Actual_Typ = 'w' then
1007 SPARK_Specific.Generate_Dereference (Nod, 'r');
1008 SPARK_Specific.Generate_Dereference (Nod, 'w');
1009 else
1010 SPARK_Specific.Generate_Dereference (Nod, 'r');
1011 end if;
1012
1013 return;
1014 end if;
1015 end if;
1016
1017 -- Record reference to entity
1018
1019 if Actual_Typ = 'p'
1020 and then Is_Subprogram (Nod)
1021 and then Present (Overridden_Operation (Nod))
1022 then
1023 Actual_Typ := 'P';
1024 end if;
1025
1026 -- Comment needed here for special SPARK code ???
1027
1028 if GNATprove_Mode then
1029 Ref := Sloc (Nod);
1030 Def := Sloc (Ent);
1031
1032 Ref_Scope :=
1033 SPARK_Specific.Enclosing_Subprogram_Or_Library_Package (Nod);
1034 Ent_Scope :=
1035 SPARK_Specific.Enclosing_Subprogram_Or_Library_Package (Ent);
1036
1037 -- Since we are reaching through renamings in SPARK mode, we may
1038 -- end up with standard constants. Ignore those.
1039
1040 if Sloc (Ent_Scope) <= Standard_Location
1041 or else Def <= Standard_Location
1042 then
1043 return;
1044 end if;
1045
1046 Add_Entry
1047 ((Ent => Ent,
1048 Loc => Ref,
1049 Typ => Actual_Typ,
1050 Eun => Get_Code_Unit (Def),
1051 Lun => Get_Code_Unit (Ref),
1052 Ref_Scope => Ref_Scope,
1053 Ent_Scope => Ent_Scope),
1054 Ent_Scope_File => Get_Code_Unit (Ent));
1055
1056 else
1057 Ref := Original_Location (Sloc (Nod));
1058 Def := Original_Location (Sloc (Ent));
1059
1060 -- If this is an operator symbol, skip the initial quote for
1061 -- navigation purposes. This is not done for the end label,
1062 -- where we want the actual position after the closing quote.
1063
1064 if Typ = 't' then
1065 null;
1066
1067 elsif Nkind (N) = N_Defining_Operator_Symbol
1068 or else Nkind (Nod) = N_Operator_Symbol
1069 then
1070 Ref := Ref + 1;
1071 end if;
1072
1073 Add_Entry
1074 ((Ent => Ent,
1075 Loc => Ref,
1076 Typ => Actual_Typ,
1077 Eun => Get_Source_Unit (Def),
1078 Lun => Get_Source_Unit (Ref),
1079 Ref_Scope => Empty,
1080 Ent_Scope => Empty),
1081 Ent_Scope_File => No_Unit);
1082
1083 -- Generate reference to the first private entity
1084
1085 if Typ = 'e'
1086 and then Comes_From_Source (E)
1087 and then Nkind (Ent) = N_Defining_Identifier
1088 and then (Is_Package_Or_Generic_Package (Ent)
1089 or else Is_Concurrent_Type (Ent))
1090 and then Present (First_Private_Entity (E))
1091 and then In_Extended_Main_Source_Unit (N)
1092 then
1093 -- Handle case in which the full-view and partial-view of the
1094 -- first private entity are swapped
1095
1096 declare
1097 First_Private : Entity_Id := First_Private_Entity (E);
1098
1099 begin
1100 if Is_Private_Type (First_Private)
1101 and then Present (Full_View (First_Private))
1102 then
1103 First_Private := Full_View (First_Private);
1104 end if;
1105
1106 Add_Entry
1107 ((Ent => Ent,
1108 Loc => Sloc (First_Private),
1109 Typ => 'E',
1110 Eun => Get_Source_Unit (Def),
1111 Lun => Get_Source_Unit (Ref),
1112 Ref_Scope => Empty,
1113 Ent_Scope => Empty),
1114 Ent_Scope_File => No_Unit);
1115 end;
1116 end if;
1117 end if;
1118 end if;
1119 end Generate_Reference;
1120
1121 -----------------------------------
1122 -- Generate_Reference_To_Formals --
1123 -----------------------------------
1124
1125 procedure Generate_Reference_To_Formals (E : Entity_Id) is
1126 Formal : Entity_Id;
1127
1128 begin
1129 if Is_Generic_Subprogram (E) then
1130 Formal := First_Entity (E);
1131
1132 while Present (Formal)
1133 and then not Is_Formal (Formal)
1134 loop
1135 Next_Entity (Formal);
1136 end loop;
1137
1138 elsif Ekind (E) in Access_Subprogram_Kind then
1139 Formal := First_Formal (Designated_Type (E));
1140
1141 else
1142 Formal := First_Formal (E);
1143 end if;
1144
1145 while Present (Formal) loop
1146 if Ekind (Formal) = E_In_Parameter then
1147
1148 if Nkind (Parameter_Type (Parent (Formal)))
1149 = N_Access_Definition
1150 then
1151 Generate_Reference (E, Formal, '^', False);
1152 else
1153 Generate_Reference (E, Formal, '>', False);
1154 end if;
1155
1156 elsif Ekind (Formal) = E_In_Out_Parameter then
1157 Generate_Reference (E, Formal, '=', False);
1158
1159 else
1160 Generate_Reference (E, Formal, '<', False);
1161 end if;
1162
1163 Next_Formal (Formal);
1164 end loop;
1165 end Generate_Reference_To_Formals;
1166
1167 -------------------------------------------
1168 -- Generate_Reference_To_Generic_Formals --
1169 -------------------------------------------
1170
1171 procedure Generate_Reference_To_Generic_Formals (E : Entity_Id) is
1172 Formal : Entity_Id;
1173
1174 begin
1175 Formal := First_Entity (E);
1176 while Present (Formal) loop
1177 if Comes_From_Source (Formal) then
1178 Generate_Reference (E, Formal, 'z', False);
1179 end if;
1180
1181 Next_Entity (Formal);
1182 end loop;
1183 end Generate_Reference_To_Generic_Formals;
1184
1185 -------------
1186 -- Get_Key --
1187 -------------
1188
1189 function Get_Key (E : Xref_Entry_Number) return Xref_Entry_Number is
1190 begin
1191 return E;
1192 end Get_Key;
1193
1194 ----------
1195 -- Hash --
1196 ----------
1197
1198 function Hash (F : Xref_Entry_Number) return Header_Num is
1199 -- It is unlikely to have two references to the same entity at the same
1200 -- source location, so the hash function depends only on the Ent and Loc
1201 -- fields.
1202
1203 XE : Xref_Entry renames Xrefs.Table (F);
1204 type M is mod 2**32;
1205
1206 H : constant M := M (XE.Key.Ent) + 2 ** 7 * M (abs XE.Key.Loc);
1207 -- It would be more natural to write:
1208 --
1209 -- H : constant M := M'Mod (XE.Key.Ent) + 2**7 * M'Mod (XE.Key.Loc);
1210 --
1211 -- But we can't use M'Mod, because it prevents bootstrapping with older
1212 -- compilers. Loc can be negative, so we do "abs" before converting.
1213 -- One day this can be cleaned up ???
1214
1215 begin
1216 return Header_Num (H mod Num_Buckets);
1217 end Hash;
1218
1219 -----------------
1220 -- HT_Set_Next --
1221 -----------------
1222
1223 procedure HT_Set_Next (E : Xref_Entry_Number; Next : Xref_Entry_Number) is
1224 begin
1225 Xrefs.Table (E).HTable_Next := Next;
1226 end HT_Set_Next;
1227
1228 -------------
1229 -- HT_Next --
1230 -------------
1231
1232 function HT_Next (E : Xref_Entry_Number) return Xref_Entry_Number is
1233 begin
1234 return Xrefs.Table (E).HTable_Next;
1235 end HT_Next;
1236
1237 ----------------
1238 -- Initialize --
1239 ----------------
1240
1241 procedure Initialize is
1242 begin
1243 Xrefs.Init;
1244 end Initialize;
1245
1246 --------
1247 -- Lt --
1248 --------
1249
1250 function Lt (T1, T2 : Xref_Entry) return Boolean is
1251 begin
1252 -- First test: if entity is in different unit, sort by unit
1253
1254 if T1.Key.Eun /= T2.Key.Eun then
1255 return Dependency_Num (T1.Key.Eun) < Dependency_Num (T2.Key.Eun);
1256
1257 -- Second test: within same unit, sort by entity Sloc
1258
1259 elsif T1.Def /= T2.Def then
1260 return T1.Def < T2.Def;
1261
1262 -- Third test: sort definitions ahead of references
1263
1264 elsif T1.Key.Loc = No_Location then
1265 return True;
1266
1267 elsif T2.Key.Loc = No_Location then
1268 return False;
1269
1270 -- Fourth test: for same entity, sort by reference location unit
1271
1272 elsif T1.Key.Lun /= T2.Key.Lun then
1273 return Dependency_Num (T1.Key.Lun) < Dependency_Num (T2.Key.Lun);
1274
1275 -- Fifth test: order of location within referencing unit
1276
1277 elsif T1.Key.Loc /= T2.Key.Loc then
1278 return T1.Key.Loc < T2.Key.Loc;
1279
1280 -- Finally, for two locations at the same address, we prefer
1281 -- the one that does NOT have the type 'r' so that a modification
1282 -- or extension takes preference, when there are more than one
1283 -- reference at the same location. As a result, in the case of
1284 -- entities that are in-out actuals, the read reference follows
1285 -- the modify reference.
1286
1287 else
1288 return T2.Key.Typ = 'r';
1289 end if;
1290 end Lt;
1291
1292 -----------------------
1293 -- Output_References --
1294 -----------------------
1295
1296 procedure Output_References is
1297
1298 procedure Get_Type_Reference
1299 (Ent : Entity_Id;
1300 Tref : out Entity_Id;
1301 Left : out Character;
1302 Right : out Character);
1303 -- Given an Entity_Id Ent, determines whether a type reference is
1304 -- required. If so, Tref is set to the entity for the type reference
1305 -- and Left and Right are set to the left/right brackets to be output
1306 -- for the reference. If no type reference is required, then Tref is
1307 -- set to Empty, and Left/Right are set to space.
1308
1309 procedure Output_Import_Export_Info (Ent : Entity_Id);
1310 -- Output language and external name information for an interfaced
1311 -- entity, using the format <language, external_name>.
1312
1313 ------------------------
1314 -- Get_Type_Reference --
1315 ------------------------
1316
1317 procedure Get_Type_Reference
1318 (Ent : Entity_Id;
1319 Tref : out Entity_Id;
1320 Left : out Character;
1321 Right : out Character)
1322 is
1323 Sav : Entity_Id;
1324
1325 begin
1326 -- See if we have a type reference
1327
1328 Tref := Ent;
1329 Left := '{';
1330 Right := '}';
1331
1332 loop
1333 Sav := Tref;
1334
1335 -- Processing for types
1336
1337 if Is_Type (Tref) then
1338
1339 -- Case of base type
1340
1341 if Base_Type (Tref) = Tref then
1342
1343 -- If derived, then get first subtype
1344
1345 if Tref /= Etype (Tref) then
1346 Tref := First_Subtype (Etype (Tref));
1347
1348 -- Set brackets for derived type, but don't override
1349 -- pointer case since the fact that something is a
1350 -- pointer is more important.
1351
1352 if Left /= '(' then
1353 Left := '<';
1354 Right := '>';
1355 end if;
1356
1357 -- If the completion of a private type is itself a derived
1358 -- type, we need the parent of the full view.
1359
1360 elsif Is_Private_Type (Tref)
1361 and then Present (Full_View (Tref))
1362 and then Etype (Full_View (Tref)) /= Full_View (Tref)
1363 then
1364 Tref := Etype (Full_View (Tref));
1365
1366 if Left /= '(' then
1367 Left := '<';
1368 Right := '>';
1369 end if;
1370
1371 -- If non-derived pointer, get directly designated type.
1372 -- If the type has a full view, all references are on the
1373 -- partial view that is seen first.
1374
1375 elsif Is_Access_Type (Tref) then
1376 Tref := Directly_Designated_Type (Tref);
1377 Left := '(';
1378 Right := ')';
1379
1380 elsif Is_Private_Type (Tref)
1381 and then Present (Full_View (Tref))
1382 then
1383 if Is_Access_Type (Full_View (Tref)) then
1384 Tref := Directly_Designated_Type (Full_View (Tref));
1385 Left := '(';
1386 Right := ')';
1387
1388 -- If the full view is an array type, we also retrieve
1389 -- the corresponding component type, because the ali
1390 -- entry already indicates that this is an array.
1391
1392 elsif Is_Array_Type (Full_View (Tref)) then
1393 Tref := Component_Type (Full_View (Tref));
1394 Left := '(';
1395 Right := ')';
1396 end if;
1397
1398 -- If non-derived array, get component type. Skip component
1399 -- type for case of String or Wide_String, saves worthwhile
1400 -- space.
1401
1402 elsif Is_Array_Type (Tref)
1403 and then Tref /= Standard_String
1404 and then Tref /= Standard_Wide_String
1405 then
1406 Tref := Component_Type (Tref);
1407 Left := '(';
1408 Right := ')';
1409
1410 -- For other non-derived base types, nothing
1411
1412 else
1413 exit;
1414 end if;
1415
1416 -- For a subtype, go to ancestor subtype
1417
1418 else
1419 Tref := Ancestor_Subtype (Tref);
1420
1421 -- If no ancestor subtype, go to base type
1422
1423 if No (Tref) then
1424 Tref := Base_Type (Sav);
1425 end if;
1426 end if;
1427
1428 -- For objects, functions, enum literals, just get type from
1429 -- Etype field.
1430
1431 elsif Is_Object (Tref)
1432 or else Ekind (Tref) = E_Enumeration_Literal
1433 or else Ekind (Tref) = E_Function
1434 or else Ekind (Tref) = E_Operator
1435 then
1436 Tref := Etype (Tref);
1437
1438 -- Another special case: an object of a classwide type
1439 -- initialized with a tag-indeterminate call gets a subtype
1440 -- of the classwide type during expansion. See if the original
1441 -- type in the declaration is named, and return it instead
1442 -- of going to the root type.
1443
1444 if Ekind (Tref) = E_Class_Wide_Subtype
1445 and then Nkind (Parent (Ent)) = N_Object_Declaration
1446 and then
1447 Nkind (Original_Node (Object_Definition (Parent (Ent))))
1448 = N_Identifier
1449 then
1450 Tref :=
1451 Entity
1452 (Original_Node ((Object_Definition (Parent (Ent)))));
1453 end if;
1454
1455 -- For anything else, exit
1456
1457 else
1458 exit;
1459 end if;
1460
1461 -- Exit if no type reference, or we are stuck in some loop trying
1462 -- to find the type reference, or if the type is standard void
1463 -- type (the latter is an implementation artifact that should not
1464 -- show up in the generated cross-references).
1465
1466 exit when No (Tref)
1467 or else Tref = Sav
1468 or else Tref = Standard_Void_Type;
1469
1470 -- If we have a usable type reference, return, otherwise keep
1471 -- looking for something useful (we are looking for something
1472 -- that either comes from source or standard)
1473
1474 if Sloc (Tref) = Standard_Location
1475 or else Comes_From_Source (Tref)
1476 then
1477 -- If the reference is a subtype created for a generic actual,
1478 -- go actual directly, the inner subtype is not user visible.
1479
1480 if Nkind (Parent (Tref)) = N_Subtype_Declaration
1481 and then not Comes_From_Source (Parent (Tref))
1482 and then
1483 (Is_Wrapper_Package (Scope (Tref))
1484 or else Is_Generic_Instance (Scope (Tref)))
1485 then
1486 Tref := First_Subtype (Base_Type (Tref));
1487 end if;
1488
1489 return;
1490 end if;
1491 end loop;
1492
1493 -- If we fall through the loop, no type reference
1494
1495 Tref := Empty;
1496 Left := ' ';
1497 Right := ' ';
1498 end Get_Type_Reference;
1499
1500 -------------------------------
1501 -- Output_Import_Export_Info --
1502 -------------------------------
1503
1504 procedure Output_Import_Export_Info (Ent : Entity_Id) is
1505 Language_Name : Name_Id;
1506 Conv : constant Convention_Id := Convention (Ent);
1507
1508 begin
1509 -- Generate language name from convention
1510
1511 if Conv = Convention_C then
1512 Language_Name := Name_C;
1513
1514 elsif Conv = Convention_CPP then
1515 Language_Name := Name_CPP;
1516
1517 elsif Conv = Convention_Ada then
1518 Language_Name := Name_Ada;
1519
1520 else
1521 -- For the moment we ignore all other cases ???
1522
1523 return;
1524 end if;
1525
1526 Write_Info_Char ('<');
1527 Get_Unqualified_Name_String (Language_Name);
1528
1529 for J in 1 .. Name_Len loop
1530 Write_Info_Char (Name_Buffer (J));
1531 end loop;
1532
1533 if Present (Interface_Name (Ent)) then
1534 Write_Info_Char (',');
1535 String_To_Name_Buffer (Strval (Interface_Name (Ent)));
1536
1537 for J in 1 .. Name_Len loop
1538 Write_Info_Char (Name_Buffer (J));
1539 end loop;
1540 end if;
1541
1542 Write_Info_Char ('>');
1543 end Output_Import_Export_Info;
1544
1545 -- Start of processing for Output_References
1546
1547 begin
1548 -- First we add references to the primitive operations of tagged types
1549 -- declared in the main unit.
1550
1551 Handle_Prim_Ops : declare
1552 Ent : Entity_Id;
1553
1554 begin
1555 for J in 1 .. Xrefs.Last loop
1556 Ent := Xrefs.Table (J).Key.Ent;
1557
1558 if Is_Type (Ent)
1559 and then Is_Tagged_Type (Ent)
1560 and then Is_Base_Type (Ent)
1561 and then In_Extended_Main_Source_Unit (Ent)
1562 then
1563 Generate_Prim_Op_References (Ent);
1564 end if;
1565 end loop;
1566 end Handle_Prim_Ops;
1567
1568 -- Before we go ahead and output the references we have a problem
1569 -- that needs dealing with. So far we have captured things that are
1570 -- definitely referenced by the main unit, or defined in the main
1571 -- unit. That's because we don't want to clutter up the ali file
1572 -- for this unit with definition lines for entities in other units
1573 -- that are not referenced.
1574
1575 -- But there is a glitch. We may reference an entity in another unit,
1576 -- and it may have a type reference to an entity that is not directly
1577 -- referenced in the main unit, which may mean that there is no xref
1578 -- entry for this entity yet in the list of references.
1579
1580 -- If we don't do something about this, we will end with an orphan type
1581 -- reference, i.e. it will point to an entity that does not appear
1582 -- within the generated references in the ali file. That is not good for
1583 -- tools using the xref information.
1584
1585 -- To fix this, we go through the references adding definition entries
1586 -- for any unreferenced entities that can be referenced in a type
1587 -- reference. There is a recursion problem here, and that is dealt with
1588 -- by making sure that this traversal also traverses any entries that
1589 -- get added by the traversal.
1590
1591 Handle_Orphan_Type_References : declare
1592 J : Nat;
1593 Tref : Entity_Id;
1594 Ent : Entity_Id;
1595
1596 L, R : Character;
1597 pragma Warnings (Off, L);
1598 pragma Warnings (Off, R);
1599
1600 procedure New_Entry (E : Entity_Id);
1601 -- Make an additional entry into the Xref table for a type entity
1602 -- that is related to the current entity (parent, type ancestor,
1603 -- progenitor, etc.).
1604
1605 ----------------
1606 -- New_Entry --
1607 ----------------
1608
1609 procedure New_Entry (E : Entity_Id) is
1610 begin
1611 pragma Assert (Present (E));
1612
1613 if not Has_Xref_Entry (Implementation_Base_Type (E))
1614 and then Sloc (E) > No_Location
1615 then
1616 Add_Entry
1617 ((Ent => E,
1618 Loc => No_Location,
1619 Typ => Character'First,
1620 Eun => Get_Source_Unit (Original_Location (Sloc (E))),
1621 Lun => No_Unit,
1622 Ref_Scope => Empty,
1623 Ent_Scope => Empty),
1624 Ent_Scope_File => No_Unit);
1625 end if;
1626 end New_Entry;
1627
1628 -- Start of processing for Handle_Orphan_Type_References
1629
1630 begin
1631 -- Note that this is not a for loop for a very good reason. The
1632 -- processing of items in the table can add new items to the table,
1633 -- and they must be processed as well.
1634
1635 J := 1;
1636 while J <= Xrefs.Last loop
1637 Ent := Xrefs.Table (J).Key.Ent;
1638 Get_Type_Reference (Ent, Tref, L, R);
1639
1640 if Present (Tref)
1641 and then not Has_Xref_Entry (Tref)
1642 and then Sloc (Tref) > No_Location
1643 then
1644 New_Entry (Tref);
1645
1646 if Is_Record_Type (Ent)
1647 and then Present (Interfaces (Ent))
1648 then
1649 -- Add an entry for each one of the given interfaces
1650 -- implemented by type Ent.
1651
1652 declare
1653 Elmt : Elmt_Id := First_Elmt (Interfaces (Ent));
1654 begin
1655 while Present (Elmt) loop
1656 New_Entry (Node (Elmt));
1657 Next_Elmt (Elmt);
1658 end loop;
1659 end;
1660 end if;
1661 end if;
1662
1663 -- Collect inherited primitive operations that may be declared in
1664 -- another unit and have no visible reference in the current one.
1665
1666 if Is_Type (Ent)
1667 and then Is_Tagged_Type (Ent)
1668 and then Is_Derived_Type (Ent)
1669 and then Is_Base_Type (Ent)
1670 and then In_Extended_Main_Source_Unit (Ent)
1671 then
1672 declare
1673 Op_List : constant Elist_Id := Primitive_Operations (Ent);
1674 Op : Elmt_Id;
1675 Prim : Entity_Id;
1676
1677 function Parent_Op (E : Entity_Id) return Entity_Id;
1678 -- Find original operation, which may be inherited through
1679 -- several derivations.
1680
1681 function Parent_Op (E : Entity_Id) return Entity_Id is
1682 Orig_Op : constant Entity_Id := Alias (E);
1683
1684 begin
1685 if No (Orig_Op) then
1686 return Empty;
1687
1688 elsif not Comes_From_Source (E)
1689 and then not Has_Xref_Entry (Orig_Op)
1690 and then Comes_From_Source (Orig_Op)
1691 then
1692 return Orig_Op;
1693 else
1694 return Parent_Op (Orig_Op);
1695 end if;
1696 end Parent_Op;
1697
1698 begin
1699 Op := First_Elmt (Op_List);
1700 while Present (Op) loop
1701 Prim := Parent_Op (Node (Op));
1702
1703 if Present (Prim) then
1704 Add_Entry
1705 ((Ent => Prim,
1706 Loc => No_Location,
1707 Typ => Character'First,
1708 Eun => Get_Source_Unit (Sloc (Prim)),
1709 Lun => No_Unit,
1710 Ref_Scope => Empty,
1711 Ent_Scope => Empty),
1712 Ent_Scope_File => No_Unit);
1713 end if;
1714
1715 Next_Elmt (Op);
1716 end loop;
1717 end;
1718 end if;
1719
1720 J := J + 1;
1721 end loop;
1722 end Handle_Orphan_Type_References;
1723
1724 -- Now we have all the references, including those for any embedded type
1725 -- references, so we can sort them, and output them.
1726
1727 Output_Refs : declare
1728
1729 Nrefs : constant Nat := Xrefs.Last;
1730 -- Number of references in table
1731
1732 Rnums : array (0 .. Nrefs) of Nat;
1733 -- This array contains numbers of references in the Xrefs table.
1734 -- This list is sorted in output order. The extra 0'th entry is
1735 -- convenient for the call to sort. When we sort the table, we
1736 -- move the entries in Rnums around, but we do not move the
1737 -- original table entries.
1738
1739 Curxu : Unit_Number_Type;
1740 -- Current xref unit
1741
1742 Curru : Unit_Number_Type;
1743 -- Current reference unit for one entity
1744
1745 Curent : Entity_Id;
1746 -- Current entity
1747
1748 Curnam : String (1 .. Name_Buffer'Length);
1749 Curlen : Natural;
1750 -- Simple name and length of current entity
1751
1752 Curdef : Source_Ptr;
1753 -- Original source location for current entity
1754
1755 Crloc : Source_Ptr;
1756 -- Current reference location
1757
1758 Ctyp : Character;
1759 -- Entity type character
1760
1761 Prevt : Character;
1762 -- reference kind of previous reference
1763
1764 Tref : Entity_Id;
1765 -- Type reference
1766
1767 Rref : Node_Id;
1768 -- Renaming reference
1769
1770 Trunit : Unit_Number_Type;
1771 -- Unit number for type reference
1772
1773 function Lt (Op1, Op2 : Natural) return Boolean;
1774 -- Comparison function for Sort call
1775
1776 function Name_Change (X : Entity_Id) return Boolean;
1777 -- Determines if entity X has a different simple name from Curent
1778
1779 procedure Move (From : Natural; To : Natural);
1780 -- Move procedure for Sort call
1781
1782 package Sorting is new GNAT.Heap_Sort_G (Move, Lt);
1783
1784 --------
1785 -- Lt --
1786 --------
1787
1788 function Lt (Op1, Op2 : Natural) return Boolean is
1789 T1 : Xref_Entry renames Xrefs.Table (Rnums (Nat (Op1)));
1790 T2 : Xref_Entry renames Xrefs.Table (Rnums (Nat (Op2)));
1791
1792 begin
1793 return Lt (T1, T2);
1794 end Lt;
1795
1796 ----------
1797 -- Move --
1798 ----------
1799
1800 procedure Move (From : Natural; To : Natural) is
1801 begin
1802 Rnums (Nat (To)) := Rnums (Nat (From));
1803 end Move;
1804
1805 -----------------
1806 -- Name_Change --
1807 -----------------
1808
1809 -- Why a string comparison here??? Why not compare Name_Id values???
1810
1811 function Name_Change (X : Entity_Id) return Boolean is
1812 begin
1813 Get_Unqualified_Name_String (Chars (X));
1814
1815 if Name_Len /= Curlen then
1816 return True;
1817 else
1818 return Name_Buffer (1 .. Curlen) /= Curnam (1 .. Curlen);
1819 end if;
1820 end Name_Change;
1821
1822 -- Start of processing for Output_Refs
1823
1824 begin
1825 -- Capture the definition Sloc values. We delay doing this till now,
1826 -- since at the time the reference or definition is made, private
1827 -- types may be swapped, and the Sloc value may be incorrect. We
1828 -- also set up the pointer vector for the sort.
1829
1830 -- For user-defined operators we need to skip the initial quote and
1831 -- point to the first character of the name, for navigation purposes.
1832
1833 for J in 1 .. Nrefs loop
1834 declare
1835 E : constant Entity_Id := Xrefs.Table (J).Key.Ent;
1836 Loc : constant Source_Ptr := Original_Location (Sloc (E));
1837
1838 begin
1839 Rnums (J) := J;
1840
1841 if Nkind (E) = N_Defining_Operator_Symbol then
1842 Xrefs.Table (J).Def := Loc + 1;
1843 else
1844 Xrefs.Table (J).Def := Loc;
1845 end if;
1846 end;
1847 end loop;
1848
1849 -- Sort the references
1850
1851 Sorting.Sort (Integer (Nrefs));
1852
1853 -- Initialize loop through references
1854
1855 Curxu := No_Unit;
1856 Curent := Empty;
1857 Curdef := No_Location;
1858 Curru := No_Unit;
1859 Crloc := No_Location;
1860 Prevt := 'm';
1861
1862 -- Loop to output references
1863
1864 for Refno in 1 .. Nrefs loop
1865 Output_One_Ref : declare
1866 Ent : Entity_Id;
1867
1868 XE : Xref_Entry renames Xrefs.Table (Rnums (Refno));
1869 -- The current entry to be accessed
1870
1871 Left : Character;
1872 Right : Character;
1873 -- Used for {} or <> or () for type reference
1874
1875 procedure Check_Type_Reference
1876 (Ent : Entity_Id;
1877 List_Interface : Boolean);
1878 -- Find whether there is a meaningful type reference for
1879 -- Ent, and display it accordingly. If List_Interface is
1880 -- true, then Ent is a progenitor interface of the current
1881 -- type entity being listed. In that case list it as is,
1882 -- without looking for a type reference for it.
1883
1884 procedure Output_Instantiation_Refs (Loc : Source_Ptr);
1885 -- Recursive procedure to output instantiation references for
1886 -- the given source ptr in [file|line[...]] form. No output
1887 -- if the given location is not a generic template reference.
1888
1889 procedure Output_Overridden_Op (Old_E : Entity_Id);
1890 -- For a subprogram that is overriding, display information
1891 -- about the inherited operation that it overrides.
1892
1893 --------------------------
1894 -- Check_Type_Reference --
1895 --------------------------
1896
1897 procedure Check_Type_Reference
1898 (Ent : Entity_Id;
1899 List_Interface : Boolean)
1900 is
1901 begin
1902 if List_Interface then
1903
1904 -- This is a progenitor interface of the type for which
1905 -- xref information is being generated.
1906
1907 Tref := Ent;
1908 Left := '<';
1909 Right := '>';
1910
1911 else
1912 Get_Type_Reference (Ent, Tref, Left, Right);
1913 end if;
1914
1915 if Present (Tref) then
1916
1917 -- Case of standard entity, output name
1918
1919 if Sloc (Tref) = Standard_Location then
1920 Write_Info_Char (Left);
1921 Write_Info_Name (Chars (Tref));
1922 Write_Info_Char (Right);
1923
1924 -- Case of source entity, output location
1925
1926 else
1927 Write_Info_Char (Left);
1928 Trunit := Get_Source_Unit (Sloc (Tref));
1929
1930 if Trunit /= Curxu then
1931 Write_Info_Nat (Dependency_Num (Trunit));
1932 Write_Info_Char ('|');
1933 end if;
1934
1935 Write_Info_Nat
1936 (Int (Get_Logical_Line_Number (Sloc (Tref))));
1937
1938 declare
1939 Ent : Entity_Id;
1940 Ctyp : Character;
1941
1942 begin
1943 Ent := Tref;
1944 Ctyp := Xref_Entity_Letters (Ekind (Ent));
1945
1946 if Ctyp = '+'
1947 and then Present (Full_View (Ent))
1948 then
1949 Ent := Underlying_Type (Ent);
1950
1951 if Present (Ent) then
1952 Ctyp := Xref_Entity_Letters (Ekind (Ent));
1953 end if;
1954 end if;
1955
1956 Write_Info_Char (Ctyp);
1957 end;
1958
1959 Write_Info_Nat
1960 (Int (Get_Column_Number (Sloc (Tref))));
1961
1962 -- If the type comes from an instantiation, add the
1963 -- corresponding info.
1964
1965 Output_Instantiation_Refs (Sloc (Tref));
1966 Write_Info_Char (Right);
1967 end if;
1968 end if;
1969 end Check_Type_Reference;
1970
1971 -------------------------------
1972 -- Output_Instantiation_Refs --
1973 -------------------------------
1974
1975 procedure Output_Instantiation_Refs (Loc : Source_Ptr) is
1976 Iloc : constant Source_Ptr := Instantiation_Location (Loc);
1977 Lun : Unit_Number_Type;
1978 Cu : constant Unit_Number_Type := Curru;
1979
1980 begin
1981 -- Nothing to do if this is not an instantiation
1982
1983 if Iloc = No_Location then
1984 return;
1985 end if;
1986
1987 -- Output instantiation reference
1988
1989 Write_Info_Char ('[');
1990 Lun := Get_Source_Unit (Iloc);
1991
1992 if Lun /= Curru then
1993 Curru := Lun;
1994 Write_Info_Nat (Dependency_Num (Curru));
1995 Write_Info_Char ('|');
1996 end if;
1997
1998 Write_Info_Nat (Int (Get_Logical_Line_Number (Iloc)));
1999
2000 -- Recursive call to get nested instantiations
2001
2002 Output_Instantiation_Refs (Iloc);
2003
2004 -- Output final ] after call to get proper nesting
2005
2006 Write_Info_Char (']');
2007 Curru := Cu;
2008 return;
2009 end Output_Instantiation_Refs;
2010
2011 --------------------------
2012 -- Output_Overridden_Op --
2013 --------------------------
2014
2015 procedure Output_Overridden_Op (Old_E : Entity_Id) is
2016 Op : Entity_Id;
2017
2018 begin
2019 -- The overridden operation has an implicit declaration
2020 -- at the point of derivation. What we want to display
2021 -- is the original operation, which has the actual body
2022 -- (or abstract declaration) that is being overridden.
2023 -- The overridden operation is not always set, e.g. when
2024 -- it is a predefined operator.
2025
2026 if No (Old_E) then
2027 return;
2028
2029 -- Follow alias chain if one is present
2030
2031 elsif Present (Alias (Old_E)) then
2032
2033 -- The subprogram may have been implicitly inherited
2034 -- through several levels of derivation, so find the
2035 -- ultimate (source) ancestor.
2036
2037 Op := Ultimate_Alias (Old_E);
2038
2039 -- Normal case of no alias present. We omit generated
2040 -- primitives like tagged equality, that have no source
2041 -- representation.
2042
2043 else
2044 Op := Old_E;
2045 end if;
2046
2047 if Present (Op)
2048 and then Sloc (Op) /= Standard_Location
2049 and then Comes_From_Source (Op)
2050 then
2051 declare
2052 Loc : constant Source_Ptr := Sloc (Op);
2053 Par_Unit : constant Unit_Number_Type :=
2054 Get_Source_Unit (Loc);
2055
2056 begin
2057 Write_Info_Char ('<');
2058
2059 if Par_Unit /= Curxu then
2060 Write_Info_Nat (Dependency_Num (Par_Unit));
2061 Write_Info_Char ('|');
2062 end if;
2063
2064 Write_Info_Nat (Int (Get_Logical_Line_Number (Loc)));
2065 Write_Info_Char ('p');
2066 Write_Info_Nat (Int (Get_Column_Number (Loc)));
2067 Write_Info_Char ('>');
2068 end;
2069 end if;
2070 end Output_Overridden_Op;
2071
2072 -- Start of processing for Output_One_Ref
2073
2074 begin
2075 Ent := XE.Key.Ent;
2076 Ctyp := Xref_Entity_Letters (Ekind (Ent));
2077
2078 -- Skip reference if it is the only reference to an entity,
2079 -- and it is an END line reference, and the entity is not in
2080 -- the current extended source. This prevents junk entries
2081 -- consisting only of packages with END lines, where no
2082 -- entity from the package is actually referenced.
2083
2084 if XE.Key.Typ = 'e'
2085 and then Ent /= Curent
2086 and then (Refno = Nrefs
2087 or else
2088 Ent /= Xrefs.Table (Rnums (Refno + 1)).Key.Ent)
2089 and then not In_Extended_Main_Source_Unit (Ent)
2090 then
2091 goto Continue;
2092 end if;
2093
2094 -- For private type, get full view type
2095
2096 if Ctyp = '+'
2097 and then Present (Full_View (XE.Key.Ent))
2098 then
2099 Ent := Underlying_Type (Ent);
2100
2101 if Present (Ent) then
2102 Ctyp := Xref_Entity_Letters (Ekind (Ent));
2103 end if;
2104 end if;
2105
2106 -- Special exception for Boolean
2107
2108 if Ctyp = 'E' and then Is_Boolean_Type (Ent) then
2109 Ctyp := 'B';
2110 end if;
2111
2112 -- For variable reference, get corresponding type
2113
2114 if Ctyp = '*' then
2115 Ent := Etype (XE.Key.Ent);
2116 Ctyp := Fold_Lower (Xref_Entity_Letters (Ekind (Ent)));
2117
2118 -- If variable is private type, get full view type
2119
2120 if Ctyp = '+'
2121 and then Present (Full_View (Etype (XE.Key.Ent)))
2122 then
2123 Ent := Underlying_Type (Etype (XE.Key.Ent));
2124
2125 if Present (Ent) then
2126 Ctyp := Fold_Lower (Xref_Entity_Letters (Ekind (Ent)));
2127 end if;
2128
2129 elsif Is_Generic_Type (Ent) then
2130
2131 -- If the type of the entity is a generic private type,
2132 -- there is no usable full view, so retain the indication
2133 -- that this is an object.
2134
2135 Ctyp := '*';
2136 end if;
2137
2138 -- Special handling for access parameters and objects and
2139 -- components of an anonymous access type.
2140
2141 if Ekind_In (Etype (XE.Key.Ent),
2142 E_Anonymous_Access_Type,
2143 E_Anonymous_Access_Subprogram_Type,
2144 E_Anonymous_Access_Protected_Subprogram_Type)
2145 then
2146 if Is_Formal (XE.Key.Ent)
2147 or else
2148 Ekind_In
2149 (XE.Key.Ent, E_Variable, E_Constant, E_Component)
2150 then
2151 Ctyp := 'p';
2152 end if;
2153
2154 -- Special handling for Boolean
2155
2156 elsif Ctyp = 'e' and then Is_Boolean_Type (Ent) then
2157 Ctyp := 'b';
2158 end if;
2159 end if;
2160
2161 -- Special handling for abstract types and operations
2162
2163 if Is_Overloadable (XE.Key.Ent)
2164 and then Is_Abstract_Subprogram (XE.Key.Ent)
2165 then
2166 if Ctyp = 'U' then
2167 Ctyp := 'x'; -- Abstract procedure
2168
2169 elsif Ctyp = 'V' then
2170 Ctyp := 'y'; -- Abstract function
2171 end if;
2172
2173 elsif Is_Type (XE.Key.Ent)
2174 and then Is_Abstract_Type (XE.Key.Ent)
2175 then
2176 if Is_Interface (XE.Key.Ent) then
2177 Ctyp := 'h';
2178
2179 elsif Ctyp = 'R' then
2180 Ctyp := 'H'; -- Abstract type
2181 end if;
2182 end if;
2183
2184 -- Only output reference if interesting type of entity
2185
2186 if Ctyp = ' '
2187
2188 -- Suppress references to object definitions, used for local
2189 -- references.
2190
2191 or else XE.Key.Typ = 'D'
2192 or else XE.Key.Typ = 'I'
2193
2194 -- Suppress self references, except for bodies that act as
2195 -- specs.
2196
2197 or else (XE.Key.Loc = XE.Def
2198 and then
2199 (XE.Key.Typ /= 'b'
2200 or else not Is_Subprogram (XE.Key.Ent)))
2201
2202 -- Also suppress definitions of body formals (we only
2203 -- treat these as references, and the references were
2204 -- separately recorded).
2205
2206 or else (Is_Formal (XE.Key.Ent)
2207 and then Present (Spec_Entity (XE.Key.Ent)))
2208 then
2209 null;
2210
2211 else
2212 -- Start new Xref section if new xref unit
2213
2214 if XE.Key.Eun /= Curxu then
2215 if Write_Info_Col > 1 then
2216 Write_Info_EOL;
2217 end if;
2218
2219 Curxu := XE.Key.Eun;
2220
2221 Write_Info_Initiate ('X');
2222 Write_Info_Char (' ');
2223 Write_Info_Nat (Dependency_Num (XE.Key.Eun));
2224 Write_Info_Char (' ');
2225 Write_Info_Name
2226 (Reference_Name (Source_Index (XE.Key.Eun)));
2227 end if;
2228
2229 -- Start new Entity line if new entity. Note that we
2230 -- consider two entities the same if they have the same
2231 -- name and source location. This causes entities in
2232 -- instantiations to be treated as though they referred
2233 -- to the template.
2234
2235 if No (Curent)
2236 or else
2237 (XE.Key.Ent /= Curent
2238 and then
2239 (Name_Change (XE.Key.Ent) or else XE.Def /= Curdef))
2240 then
2241 Curent := XE.Key.Ent;
2242 Curdef := XE.Def;
2243
2244 Get_Unqualified_Name_String (Chars (XE.Key.Ent));
2245 Curlen := Name_Len;
2246 Curnam (1 .. Curlen) := Name_Buffer (1 .. Curlen);
2247
2248 if Write_Info_Col > 1 then
2249 Write_Info_EOL;
2250 end if;
2251
2252 -- Write column number information
2253
2254 Write_Info_Nat (Int (Get_Logical_Line_Number (XE.Def)));
2255 Write_Info_Char (Ctyp);
2256 Write_Info_Nat (Int (Get_Column_Number (XE.Def)));
2257
2258 -- Write level information
2259
2260 Write_Level_Info : declare
2261 function Is_Visible_Generic_Entity
2262 (E : Entity_Id) return Boolean;
2263 -- Check whether E is declared in the visible part
2264 -- of a generic package. For source navigation
2265 -- purposes, treat this as a visible entity.
2266
2267 function Is_Private_Record_Component
2268 (E : Entity_Id) return Boolean;
2269 -- Check whether E is a non-inherited component of a
2270 -- private extension. Even if the enclosing record is
2271 -- public, we want to treat the component as private
2272 -- for navigation purposes.
2273
2274 ---------------------------------
2275 -- Is_Private_Record_Component --
2276 ---------------------------------
2277
2278 function Is_Private_Record_Component
2279 (E : Entity_Id) return Boolean
2280 is
2281 S : constant Entity_Id := Scope (E);
2282 begin
2283 return
2284 Ekind (E) = E_Component
2285 and then Nkind (Declaration_Node (S)) =
2286 N_Private_Extension_Declaration
2287 and then Original_Record_Component (E) = E;
2288 end Is_Private_Record_Component;
2289
2290 -------------------------------
2291 -- Is_Visible_Generic_Entity --
2292 -------------------------------
2293
2294 function Is_Visible_Generic_Entity
2295 (E : Entity_Id) return Boolean
2296 is
2297 Par : Node_Id;
2298
2299 begin
2300 -- The Present check here is an error defense
2301
2302 if Present (Scope (E))
2303 and then Ekind (Scope (E)) /= E_Generic_Package
2304 then
2305 return False;
2306 end if;
2307
2308 Par := Parent (E);
2309 while Present (Par) loop
2310 if
2311 Nkind (Par) = N_Generic_Package_Declaration
2312 then
2313 -- Entity is a generic formal
2314
2315 return False;
2316
2317 elsif
2318 Nkind (Parent (Par)) = N_Package_Specification
2319 then
2320 return
2321 Is_List_Member (Par)
2322 and then List_Containing (Par) =
2323 Visible_Declarations (Parent (Par));
2324 else
2325 Par := Parent (Par);
2326 end if;
2327 end loop;
2328
2329 return False;
2330 end Is_Visible_Generic_Entity;
2331
2332 -- Start of processing for Write_Level_Info
2333
2334 begin
2335 if Is_Hidden (Curent)
2336 or else Is_Private_Record_Component (Curent)
2337 then
2338 Write_Info_Char (' ');
2339
2340 elsif
2341 Is_Public (Curent)
2342 or else Is_Visible_Generic_Entity (Curent)
2343 then
2344 Write_Info_Char ('*');
2345
2346 else
2347 Write_Info_Char (' ');
2348 end if;
2349 end Write_Level_Info;
2350
2351 -- Output entity name. We use the occurrence from the
2352 -- actual source program at the definition point.
2353
2354 declare
2355 Ent_Name : constant String :=
2356 Exact_Source_Name (Sloc (XE.Key.Ent));
2357 begin
2358 for C in Ent_Name'Range loop
2359 Write_Info_Char (Ent_Name (C));
2360 end loop;
2361 end;
2362
2363 -- See if we have a renaming reference
2364
2365 if Is_Object (XE.Key.Ent)
2366 and then Present (Renamed_Object (XE.Key.Ent))
2367 then
2368 Rref := Renamed_Object (XE.Key.Ent);
2369
2370 elsif Is_Overloadable (XE.Key.Ent)
2371 and then Nkind (Parent (Declaration_Node (XE.Key.Ent)))
2372 = N_Subprogram_Renaming_Declaration
2373 then
2374 Rref := Name (Parent (Declaration_Node (XE.Key.Ent)));
2375
2376 elsif Ekind (XE.Key.Ent) = E_Package
2377 and then Nkind (Declaration_Node (XE.Key.Ent)) =
2378 N_Package_Renaming_Declaration
2379 then
2380 Rref := Name (Declaration_Node (XE.Key.Ent));
2381
2382 else
2383 Rref := Empty;
2384 end if;
2385
2386 if Present (Rref) then
2387 if Nkind (Rref) = N_Expanded_Name then
2388 Rref := Selector_Name (Rref);
2389 end if;
2390
2391 if Nkind (Rref) = N_Identifier
2392 or else Nkind (Rref) = N_Operator_Symbol
2393 then
2394 null;
2395
2396 -- For renamed array components, use the array name
2397 -- for the renamed entity, which reflect the fact that
2398 -- in general the whole array is aliased.
2399
2400 elsif Nkind (Rref) = N_Indexed_Component then
2401 if Nkind (Prefix (Rref)) = N_Identifier then
2402 Rref := Prefix (Rref);
2403 elsif Nkind (Prefix (Rref)) = N_Expanded_Name then
2404 Rref := Selector_Name (Prefix (Rref));
2405 else
2406 Rref := Empty;
2407 end if;
2408
2409 else
2410 Rref := Empty;
2411 end if;
2412 end if;
2413
2414 -- Write out renaming reference if we have one
2415
2416 if Present (Rref) then
2417 Write_Info_Char ('=');
2418 Write_Info_Nat
2419 (Int (Get_Logical_Line_Number (Sloc (Rref))));
2420 Write_Info_Char (':');
2421 Write_Info_Nat
2422 (Int (Get_Column_Number (Sloc (Rref))));
2423 end if;
2424
2425 -- Indicate that the entity is in the unit of the current
2426 -- xref section.
2427
2428 Curru := Curxu;
2429
2430 -- Write out information about generic parent, if entity
2431 -- is an instance.
2432
2433 if Is_Generic_Instance (XE.Key.Ent) then
2434 declare
2435 Gen_Par : constant Entity_Id :=
2436 Generic_Parent
2437 (Specification
2438 (Unit_Declaration_Node
2439 (XE.Key.Ent)));
2440 Loc : constant Source_Ptr := Sloc (Gen_Par);
2441 Gen_U : constant Unit_Number_Type :=
2442 Get_Source_Unit (Loc);
2443
2444 begin
2445 Write_Info_Char ('[');
2446
2447 if Curru /= Gen_U then
2448 Write_Info_Nat (Dependency_Num (Gen_U));
2449 Write_Info_Char ('|');
2450 end if;
2451
2452 Write_Info_Nat
2453 (Int (Get_Logical_Line_Number (Loc)));
2454 Write_Info_Char (']');
2455 end;
2456 end if;
2457
2458 -- See if we have a type reference and if so output
2459
2460 Check_Type_Reference (XE.Key.Ent, False);
2461
2462 -- Additional information for types with progenitors,
2463 -- including synchronized tagged types.
2464
2465 declare
2466 Typ : constant Entity_Id := XE.Key.Ent;
2467 Elmt : Elmt_Id;
2468
2469 begin
2470 if Is_Record_Type (Typ)
2471 and then Present (Interfaces (Typ))
2472 then
2473 Elmt := First_Elmt (Interfaces (Typ));
2474
2475 elsif Is_Concurrent_Type (Typ)
2476 and then Present (Corresponding_Record_Type (Typ))
2477 and then Present (
2478 Interfaces (Corresponding_Record_Type (Typ)))
2479 then
2480 Elmt :=
2481 First_Elmt (
2482 Interfaces (Corresponding_Record_Type (Typ)));
2483
2484 else
2485 Elmt := No_Elmt;
2486 end if;
2487
2488 while Present (Elmt) loop
2489 Check_Type_Reference (Node (Elmt), True);
2490 Next_Elmt (Elmt);
2491 end loop;
2492 end;
2493
2494 -- For array types, list index types as well. (This is
2495 -- not C, indexes have distinct types).
2496
2497 if Is_Array_Type (XE.Key.Ent) then
2498 declare
2499 Indx : Node_Id;
2500 begin
2501 Indx := First_Index (XE.Key.Ent);
2502 while Present (Indx) loop
2503 Check_Type_Reference
2504 (First_Subtype (Etype (Indx)), True);
2505 Next_Index (Indx);
2506 end loop;
2507 end;
2508 end if;
2509
2510 -- If the entity is an overriding operation, write info
2511 -- on operation that was overridden.
2512
2513 if Is_Subprogram (XE.Key.Ent)
2514 and then Present (Overridden_Operation (XE.Key.Ent))
2515 then
2516 Output_Overridden_Op
2517 (Overridden_Operation (XE.Key.Ent));
2518 end if;
2519
2520 -- End of processing for entity output
2521
2522 Crloc := No_Location;
2523 end if;
2524
2525 -- Output the reference if it is not as the same location
2526 -- as the previous one, or it is a read-reference that
2527 -- indicates that the entity is an in-out actual in a call.
2528
2529 if XE.Key.Loc /= No_Location
2530 and then
2531 (XE.Key.Loc /= Crloc
2532 or else (Prevt = 'm' and then XE.Key.Typ = 'r'))
2533 then
2534 Crloc := XE.Key.Loc;
2535 Prevt := XE.Key.Typ;
2536
2537 -- Start continuation if line full, else blank
2538
2539 if Write_Info_Col > 72 then
2540 Write_Info_EOL;
2541 Write_Info_Initiate ('.');
2542 end if;
2543
2544 Write_Info_Char (' ');
2545
2546 -- Output file number if changed
2547
2548 if XE.Key.Lun /= Curru then
2549 Curru := XE.Key.Lun;
2550 Write_Info_Nat (Dependency_Num (Curru));
2551 Write_Info_Char ('|');
2552 end if;
2553
2554 Write_Info_Nat
2555 (Int (Get_Logical_Line_Number (XE.Key.Loc)));
2556 Write_Info_Char (XE.Key.Typ);
2557
2558 if Is_Overloadable (XE.Key.Ent) then
2559 if (Is_Imported (XE.Key.Ent) and then XE.Key.Typ = 'b')
2560 or else
2561 (Is_Exported (XE.Key.Ent) and then XE.Key.Typ = 'i')
2562 then
2563 Output_Import_Export_Info (XE.Key.Ent);
2564 end if;
2565 end if;
2566
2567 Write_Info_Nat (Int (Get_Column_Number (XE.Key.Loc)));
2568
2569 Output_Instantiation_Refs (Sloc (XE.Key.Ent));
2570 end if;
2571 end if;
2572 end Output_One_Ref;
2573
2574 <<Continue>>
2575 null;
2576 end loop;
2577
2578 Write_Info_EOL;
2579 end Output_Refs;
2580 end Output_References;
2581
2582 ---------------------------------
2583 -- Process_Deferred_References --
2584 ---------------------------------
2585
2586 procedure Process_Deferred_References is
2587 begin
2588 for J in Deferred_References.First .. Deferred_References.Last loop
2589 declare
2590 D : Deferred_Reference_Entry renames Deferred_References.Table (J);
2591
2592 begin
2593 case Is_LHS (D.N) is
2594 when Yes =>
2595 Generate_Reference (D.E, D.N, 'm');
2596
2597 when No =>
2598 Generate_Reference (D.E, D.N, 'r');
2599
2600 -- Not clear if Unknown can occur at this stage, but if it
2601 -- does we will treat it as a normal reference.
2602
2603 when Unknown =>
2604 Generate_Reference (D.E, D.N, 'r');
2605 end case;
2606 end;
2607 end loop;
2608
2609 -- Clear processed entries from table
2610
2611 Deferred_References.Init;
2612 end Process_Deferred_References;
2613
2614 -- Start of elaboration for Lib.Xref
2615
2616 begin
2617 -- Reset is necessary because Elmt_Ptr does not default to Null_Ptr,
2618 -- because it's not an access type.
2619
2620 Xref_Set.Reset;
2621 end Lib.Xref;