1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1998-2012, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
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;
32 with Restrict; use Restrict;
33 with Rident; use Rident;
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;
46 with GNAT.Heap_Sort_G;
49 package body Lib.Xref is
55 -- The Xref table is used to record references. The Loc field is set
56 -- to No_Location for a definition entry.
58 subtype Xref_Entry_Number is Int;
60 type Xref_Key is record
61 -- These are the components of Xref_Entry that participate in hash
65 -- Entity referenced (E parameter to Generate_Reference)
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.
73 -- Reference type (Typ param to Generate_Reference)
75 Eun : Unit_Number_Type;
76 -- Unit number corresponding to Ent
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.
82 -- The following components are only used for Alfa cross-references
84 Ref_Scope : Entity_Id;
85 -- Entity of the closest subprogram or package enclosing the reference
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.
92 type Xref_Entry is record
95 Ent_Scope_File : Unit_Number_Type;
96 -- File for entity Ent_Scope
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.
104 HTable_Next : Xref_Entry_Number;
105 -- For use only by Static_HTable
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");
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.
124 Num_Buckets : constant := 2**16;
126 subtype Header_Num is Integer range 0 .. Num_Buckets - 1;
127 type Null_Type is null record;
128 pragma Unreferenced (Null_Type);
130 function Hash (F : Xref_Entry_Number) return Header_Num;
132 function Equal (F1, F2 : Xref_Entry_Number) return Boolean;
134 procedure HT_Set_Next (E : Xref_Entry_Number; Next : Xref_Entry_Number);
136 function HT_Next (E : Xref_Entry_Number) return Xref_Entry_Number;
138 function Get_Key (E : Xref_Entry_Number) return Xref_Entry_Number;
140 pragma Inline (Hash, Equal, HT_Set_Next, HT_Next, Get_Key);
142 package Xref_Set is new GNAT.HTable.Static_HTable (
144 Element => Xref_Entry,
145 Elmt_Ptr => Xref_Entry_Number,
147 Set_Next => HT_Set_Next,
149 Key => Xref_Entry_Number,
154 ----------------------
155 -- Alfa Information --
156 ----------------------
158 package body Alfa is separate;
160 ------------------------
161 -- Local Subprograms --
162 ------------------------
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
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.
173 function Lt (T1, T2 : Xref_Entry) return Boolean;
174 -- Order cross-references
180 procedure Add_Entry (Key : Xref_Key; Ent_Scope_File : Unit_Number_Type) is
182 Xrefs.Increment_Last; -- tentative
183 Xrefs.Table (Xrefs.Last).Key := Key;
185 -- Set the entry in Xref_Set, and if newly set, keep the above
186 -- tentative increment.
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
192 Set_Has_Xref_Entry (Key.Ent);
194 -- It was already in Xref_Set, so throw away the tentatively-added
198 Xrefs.Decrement_Last;
206 function Equal (F1, F2 : Xref_Entry_Number) return Boolean is
207 Result : constant Boolean :=
208 Xrefs.Table (F1).Key = Xrefs.Table (F2).Key;
213 -------------------------
214 -- Generate_Definition --
215 -------------------------
217 procedure Generate_Definition (E : Entity_Id) is
219 pragma Assert (Nkind (E) in N_Entity);
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.
227 -- Definition must come from source
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.
235 and then (Comes_From_Source (E) or else Is_Child_Unit (E))
237 -- And must have a reasonable source location that is not
238 -- within an instance (all entities in instances are ignored)
240 and then Sloc (E) > No_Location
241 and then Instantiation_Location (Sloc (E)) = No_Location
243 -- And must be a non-internal name from the main source unit
245 and then In_Extended_Main_Source_Unit (E)
246 and then not Is_Internal_Name (Chars (E))
252 Eun => Get_Source_Unit (Original_Location (Sloc (E))),
256 Ent_Scope_File => No_Unit);
258 if In_Inlined_Body then
262 end Generate_Definition;
264 ---------------------------------
265 -- Generate_Operator_Reference --
266 ---------------------------------
268 procedure Generate_Operator_Reference
273 if not In_Extended_Main_Source_Unit (N) then
277 -- If the operator is not a Standard operator, then we generate a real
278 -- reference to the user defined operator.
280 if Sloc (Entity (N)) /= Standard_Location then
281 Generate_Reference (Entity (N), N);
283 -- A reference to an implicit inequality operator is also a reference
284 -- to the user-defined equality.
286 if Nkind (N) = N_Op_Ne
287 and then not Comes_From_Source (Entity (N))
288 and then Present (Corresponding_Equality (Entity (N)))
290 Generate_Reference (Corresponding_Equality (Entity (N)), N);
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.
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
306 elsif Comes_From_Source (N) then
307 Set_Referenced (First_Subtype (T));
309 end Generate_Operator_Reference;
311 ---------------------------------
312 -- Generate_Prim_Op_References --
313 ---------------------------------
315 procedure Generate_Prim_Op_References (Typ : Entity_Id) is
318 Prim_List : Elist_Id;
321 -- Handle subtypes of synchronized types
323 if Ekind (Typ) = E_Protected_Subtype
324 or else Ekind (Typ) = E_Task_Subtype
326 Base_T := Etype (Typ);
331 -- References to primitive operations are only relevant for tagged types
333 if not Is_Tagged_Type (Base_T)
334 or else Is_Class_Wide_Type (Base_T)
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.
343 -- The check for Present here is to protect against previously reported
346 Prim_List := Primitive_Operations (Base_T);
348 if No (Prim_List) then
352 Prim := First_Elmt (Prim_List);
353 while Present (Prim) loop
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).
360 (Typ, Ultimate_Alias (Node (Prim)), 'p', Set_Ref => False);
363 end Generate_Prim_Op_References;
365 ------------------------
366 -- Generate_Reference --
367 ------------------------
369 procedure Generate_Reference
372 Typ : Character := 'r';
373 Set_Ref : Boolean := True;
374 Force : Boolean := False)
376 Actual_Typ : Character := Typ;
380 Ent_Scope : Entity_Id;
385 Ref_Scope : Entity_Id;
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.
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:
395 -- Variable Node is a direct descendant of left hand side of an
396 -- assignment statement.
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.
405 -- Out param Same as above cases, but OUT parameter
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.
412 ---------------------------
413 -- Get_Through_Renamings --
414 ---------------------------
416 function Get_Through_Renamings (E : Entity_Id) return Entity_Id is
417 Result : Entity_Id := E;
419 while Present (Result)
420 and then Is_Object (Result)
421 and then Present (Renamed_Object (Result))
423 Result := Get_Enclosing_Object (Renamed_Object (Result));
426 end Get_Through_Renamings;
432 -- ??? There are several routines here and there that perform a similar
433 -- (but subtly different) computation, which should be factored:
435 -- Sem_Util.May_Be_Lvalue
436 -- Sem_Util.Known_To_Be_Assigned
437 -- Exp_Ch2.Expand_Entry_Parameter.In_Assignment_Context
438 -- Exp_Smem.Is_Out_Actual
440 function Is_On_LHS (Node : Node_Id) return Boolean is
446 -- Only identifiers are considered, is this necessary???
448 if Nkind (Node) /= N_Identifier then
452 -- Immediate return if appeared as OUT parameter
454 if Kind = E_Out_Parameter then
458 -- Search for assignment statement subtree root
465 if K = N_Assignment_Statement then
468 -- Check whether the parent is a component and the current node is
469 -- its prefix, but return False if the current node has an access
470 -- type, as in that case the selected or indexed component is an
471 -- implicit dereference, and the LHS is the designated object, not
472 -- the access object.
474 -- ??? case of a slice assignment?
476 -- ??? Note that in some cases this is called too early
477 -- (see comments in Sem_Ch8.Find_Direct_Name), at a point where
478 -- the tree is not fully typed yet. In that case we may lack
479 -- an Etype for N, and we must disable the check for an implicit
480 -- dereference. If the dereference is on an LHS, this causes a
483 elsif (K = N_Selected_Component or else K = N_Indexed_Component)
484 and then Prefix (P) = N
485 and then not (Present (Etype (N))
487 Is_Access_Type (Etype (N)))
491 -- All other cases, definitely not on left side
499 ---------------------------
500 -- OK_To_Set_Referenced --
501 ---------------------------
503 function OK_To_Set_Referenced return Boolean is
507 -- A reference from a pragma Unreferenced or pragma Unmodified or
508 -- pragma Warnings does not cause the Referenced flag to be set.
509 -- This avoids silly warnings about things being referenced and
510 -- not assigned when the only reference is from the pragma.
512 if Nkind (N) = N_Identifier then
515 if Nkind (P) = N_Pragma_Argument_Association then
518 if Nkind (P) = N_Pragma then
519 if Pragma_Name (P) = Name_Warnings
521 Pragma_Name (P) = Name_Unmodified
523 Pragma_Name (P) = Name_Unreferenced
529 -- A reference to a formal in a named parameter association does
530 -- not make the formal referenced. Formals that are unused in the
531 -- subprogram body are properly flagged as such, even if calls
532 -- elsewhere use named notation.
534 elsif Nkind (P) = N_Parameter_Association
535 and then N = Selector_Name (P)
542 end OK_To_Set_Referenced;
544 -- Start of processing for Generate_Reference
547 pragma Assert (Nkind (E) in N_Entity);
548 Find_Actual (N, Formal, Call);
550 if Present (Formal) then
551 Kind := Ekind (Formal);
556 -- Check for obsolescent reference to package ASCII. GNAT treats this
557 -- element of annex J specially since in practice, programs make a lot
558 -- of use of this feature, so we don't include it in the set of features
559 -- diagnosed when Warn_On_Obsolescent_Features mode is set. However we
560 -- are required to note it as a violation of the RM defined restriction.
562 if E = Standard_ASCII then
563 Check_Restriction (No_Obsolescent_Features, N);
566 -- Check for reference to entity marked with Is_Obsolescent
568 -- Note that we always allow obsolescent references in the compiler
569 -- itself and the run time, since we assume that we know what we are
570 -- doing in such cases. For example the calls in Ada.Characters.Handling
571 -- to its own obsolescent subprograms are just fine.
573 -- In any case we only generate warnings if we are in the extended main
574 -- source unit, and the entity itself is not in the extended main source
575 -- unit, since we assume the source unit itself knows what is going on
576 -- (and for sure we do not want silly warnings, e.g. on the end line of
577 -- an obsolescent procedure body).
579 if Is_Obsolescent (E)
580 and then not GNAT_Mode
581 and then not In_Extended_Main_Source_Unit (E)
582 and then In_Extended_Main_Source_Unit (N)
584 Check_Restriction (No_Obsolescent_Features, N);
586 if Warn_On_Obsolescent_Feature then
587 Output_Obsolescent_Entity_Warnings (N, E);
591 -- Warn if reference to Ada 2005 entity not in Ada 2005 mode. We only
592 -- detect real explicit references (modifications and references).
594 if Comes_From_Source (N)
595 and then Is_Ada_2005_Only (E)
596 and then Ada_Version < Ada_2005
597 and then Warn_On_Ada_2005_Compatibility
598 and then (Typ = 'm' or else Typ = 'r' or else Typ = 's')
600 Error_Msg_NE ("& is only defined in Ada 2005?", N, E);
603 -- Warn if reference to Ada 2012 entity not in Ada 2012 mode. We only
604 -- detect real explicit references (modifications and references).
606 if Comes_From_Source (N)
607 and then Is_Ada_2012_Only (E)
608 and then Ada_Version < Ada_2012
609 and then Warn_On_Ada_2012_Compatibility
610 and then (Typ = 'm' or else Typ = 'r')
612 Error_Msg_NE ("& is only defined in Ada 2012?", N, E);
615 -- Never collect references if not in main source unit. However, we omit
616 -- this test if Typ is 'e' or 'k', since these entries are structural,
617 -- and it is useful to have them in units that reference packages as
618 -- well as units that define packages. We also omit the test for the
619 -- case of 'p' since we want to include inherited primitive operations
620 -- from other packages.
622 -- We also omit this test is this is a body reference for a subprogram
623 -- instantiation. In this case the reference is to the generic body,
624 -- which clearly need not be in the main unit containing the instance.
625 -- For the same reason we accept an implicit reference generated for
626 -- a default in an instance.
628 if not In_Extended_Main_Source_Unit (N) then
634 or else (Typ = 'b' and then Is_Generic_Instance (E))
636 -- Allow the generation of references to reads, writes and calls
637 -- in Alfa mode when the related context comes from an instance.
641 and then In_Extended_Main_Code_Unit (N)
642 and then (Typ = 'm' or else Typ = 'r' or else Typ = 's'))
650 -- For reference type p, the entity must be in main source unit
652 if Typ = 'p' and then not In_Extended_Main_Source_Unit (E) then
656 -- Unless the reference is forced, we ignore references where the
657 -- reference itself does not come from source.
659 if not Force and then not Comes_From_Source (N) then
663 -- Deal with setting entity as referenced, unless suppressed. Note that
664 -- we still do Set_Referenced on entities that do not come from source.
665 -- This situation arises when we have a source reference to a derived
666 -- operation, where the derived operation itself does not come from
667 -- source, but we still want to mark it as referenced, since we really
668 -- are referencing an entity in the corresponding package (this avoids
669 -- wrong complaints that the package contains no referenced entities).
673 -- Assignable object appearing on left side of assignment or as
677 and then Is_On_LHS (N)
678 and then Ekind (E) /= E_In_Out_Parameter
680 -- For objects that are renamings, just set as simply referenced
681 -- we do not try to do assignment type tracking in this case.
683 if Present (Renamed_Object (E)) then
686 -- Out parameter case
688 elsif Kind = E_Out_Parameter then
690 -- If warning mode for all out parameters is set, or this is
691 -- the only warning parameter, then we want to mark this for
692 -- later warning logic by setting Referenced_As_Out_Parameter
694 if Warn_On_Modified_As_Out_Parameter (Formal) then
695 Set_Referenced_As_Out_Parameter (E, True);
696 Set_Referenced_As_LHS (E, False);
698 -- For OUT parameter not covered by the above cases, we simply
699 -- regard it as a normal reference (in this case we do not
700 -- want any of the warning machinery for out parameters).
706 -- For the left hand of an assignment case, we do nothing here.
707 -- The processing for Analyze_Assignment_Statement will set the
708 -- Referenced_As_LHS flag.
714 -- Check for a reference in a pragma that should not count as a
715 -- making the variable referenced for warning purposes.
717 elsif Is_Non_Significant_Pragma_Reference (N) then
720 -- A reference in an attribute definition clause does not count as a
721 -- reference except for the case of Address. The reason that 'Address
722 -- is an exception is that it creates an alias through which the
723 -- variable may be referenced.
725 elsif Nkind (Parent (N)) = N_Attribute_Definition_Clause
726 and then Chars (Parent (N)) /= Name_Address
727 and then N = Name (Parent (N))
731 -- Constant completion does not count as a reference
734 and then Ekind (E) = E_Constant
738 -- Record representation clause does not count as a reference
740 elsif Nkind (N) = N_Identifier
741 and then Nkind (Parent (N)) = N_Record_Representation_Clause
745 -- Discriminants do not need to produce a reference to record type
748 and then Nkind (Parent (N)) = N_Discriminant_Specification
755 -- Special processing for IN OUT parameters, where we have an
756 -- implicit assignment to a simple variable.
758 if Kind = E_In_Out_Parameter
759 and then Is_Assignable (E)
761 -- For sure this counts as a normal read reference
764 Set_Last_Assignment (E, Empty);
766 -- We count it as being referenced as an out parameter if the
767 -- option is set to warn on all out parameters, except that we
768 -- have a special exclusion for an intrinsic subprogram, which
769 -- is most likely an instantiation of Unchecked_Deallocation
770 -- which we do not want to consider as an assignment since it
771 -- generates false positives. We also exclude the case of an
772 -- IN OUT parameter if the name of the procedure is Free,
773 -- since we suspect similar semantics.
775 if Warn_On_All_Unread_Out_Parameters
776 and then Is_Entity_Name (Name (Call))
777 and then not Is_Intrinsic_Subprogram (Entity (Name (Call)))
778 and then Chars (Name (Call)) /= Name_Free
780 Set_Referenced_As_Out_Parameter (E, True);
781 Set_Referenced_As_LHS (E, False);
784 -- Don't count a recursive reference within a subprogram as a
785 -- reference (that allows detection of a recursive subprogram
786 -- whose only references are recursive calls as unreferenced).
788 elsif Is_Subprogram (E)
789 and then E = Nearest_Dynamic_Scope (Current_Scope)
793 -- Any other occurrence counts as referencing the entity
795 elsif OK_To_Set_Referenced then
798 -- If variable, this is an OK reference after an assignment
799 -- so we can clear the Last_Assignment indication.
801 if Is_Assignable (E) then
802 Set_Last_Assignment (E, Empty);
807 -- Check for pragma Unreferenced given and reference is within
808 -- this source unit (occasion for possible warning to be issued).
810 if Has_Unreferenced (E)
811 and then In_Same_Extended_Unit (E, N)
813 -- A reference as a named parameter in a call does not count
814 -- as a violation of pragma Unreferenced for this purpose...
816 if Nkind (N) = N_Identifier
817 and then Nkind (Parent (N)) = N_Parameter_Association
818 and then Selector_Name (Parent (N)) = N
822 -- ... Neither does a reference to a variable on the left side
825 elsif Is_On_LHS (N) then
828 -- For entry formals, we want to place the warning message on the
829 -- corresponding entity in the accept statement. The current scope
830 -- is the body of the accept, so we find the formal whose name
831 -- matches that of the entry formal (there is no link between the
832 -- two entities, and the one in the accept statement is only used
833 -- for conformance checking).
835 elsif Ekind (Scope (E)) = E_Entry then
840 BE := First_Entity (Current_Scope);
841 while Present (BE) loop
842 if Chars (BE) = Chars (E) then
843 Error_Msg_NE -- CODEFIX
844 ("?pragma Unreferenced given for&!", N, BE);
852 -- Here we issue the warning, since this is a real reference
855 Error_Msg_NE -- CODEFIX
856 ("?pragma Unreferenced given for&!", N, E);
860 -- If this is a subprogram instance, mark as well the internal
861 -- subprogram in the wrapper package, which may be a visible
864 if Is_Overloadable (E)
865 and then Is_Generic_Instance (E)
866 and then Present (Alias (E))
868 Set_Referenced (Alias (E));
872 -- Generate reference if all conditions are met:
875 -- Cross referencing must be active
879 -- The entity must be one for which we collect references
881 and then Xref_Entity_Letters (Ekind (E)) /= ' '
883 -- Both Sloc values must be set to something sensible
885 and then Sloc (E) > No_Location
886 and then Sloc (N) > No_Location
888 -- Ignore references from within an instance. The only exceptions to
889 -- this are default subprograms, for which we generate an implicit
890 -- reference and compilations in Alfa_Mode.
893 (Instantiation_Location (Sloc (N)) = No_Location
897 -- Ignore dummy references
901 if Nkind_In (N, N_Identifier,
902 N_Defining_Identifier,
903 N_Defining_Operator_Symbol,
905 N_Defining_Character_Literal)
906 or else Nkind (N) in N_Op
907 or else (Nkind (N) = N_Character_Literal
908 and then Sloc (Entity (N)) /= Standard_Location)
912 elsif Nkind_In (N, N_Expanded_Name, N_Selected_Component) then
913 Nod := Selector_Name (N);
919 -- Normal case of source entity comes from source
921 if Comes_From_Source (E) then
924 -- Entity does not come from source, but is a derived subprogram and
925 -- the derived subprogram comes from source (after one or more
926 -- derivations) in which case the reference is to parent subprogram.
928 elsif Is_Overloadable (E)
929 and then Present (Alias (E))
932 while not Comes_From_Source (Ent) loop
933 if No (Alias (Ent)) then
940 -- The internally created defining entity for a child subprogram
941 -- that has no previous spec has valid references.
943 elsif Is_Overloadable (E)
944 and then Is_Child_Unit (E)
948 -- Record components of discriminated subtypes or derived types must
949 -- be treated as references to the original component.
951 elsif Ekind (E) = E_Component
952 and then Comes_From_Source (Original_Record_Component (E))
954 Ent := Original_Record_Component (E);
956 -- If this is an expanded reference to a discriminant, recover the
957 -- original discriminant, which gets the reference.
959 elsif Ekind (E) = E_In_Parameter
960 and then Present (Discriminal_Link (E))
962 Ent := Discriminal_Link (E);
963 Set_Referenced (Ent);
965 -- Ignore reference to any other entity that is not from source
971 -- In Alfa mode, consider the underlying entity renamed instead of
972 -- the renaming, which is needed to compute a valid set of effects
973 -- (reads, writes) for the enclosing subprogram.
976 Ent := Get_Through_Renamings (Ent);
978 -- If no enclosing object, then it could be a reference to any
979 -- location not tracked individually, like heap-allocated data.
980 -- Conservatively approximate this possibility by generating a
981 -- dereference, and return.
984 if Actual_Typ = 'w' then
985 Alfa.Generate_Dereference (Nod, 'r');
986 Alfa.Generate_Dereference (Nod, 'w');
988 Alfa.Generate_Dereference (Nod, 'r');
995 -- Record reference to entity
998 and then Is_Subprogram (Nod)
999 and then Present (Overridden_Operation (Nod))
1008 Ref_Scope := Alfa.Enclosing_Subprogram_Or_Package (Nod);
1009 Ent_Scope := Alfa.Enclosing_Subprogram_Or_Package (Ent);
1011 -- Since we are reaching through renamings in Alfa mode, we may
1012 -- end up with standard constants. Ignore those.
1014 if Sloc (Ent_Scope) <= Standard_Location
1015 or else Def <= Standard_Location
1024 Eun => Get_Code_Unit (Def),
1025 Lun => Get_Code_Unit (Ref),
1026 Ref_Scope => Ref_Scope,
1027 Ent_Scope => Ent_Scope),
1028 Ent_Scope_File => Get_Code_Unit (Ent));
1031 Ref := Original_Location (Sloc (Nod));
1032 Def := Original_Location (Sloc (Ent));
1034 -- If this is an operator symbol, skip the initial quote for
1035 -- navigation purposes. This is not done for the end label,
1036 -- where we want the actual position after the closing quote.
1041 elsif Nkind (N) = N_Defining_Operator_Symbol
1042 or else Nkind (Nod) = N_Operator_Symbol
1051 Eun => Get_Source_Unit (Def),
1052 Lun => Get_Source_Unit (Ref),
1054 Ent_Scope => Empty),
1055 Ent_Scope_File => No_Unit);
1058 end Generate_Reference;
1060 -----------------------------------
1061 -- Generate_Reference_To_Formals --
1062 -----------------------------------
1064 procedure Generate_Reference_To_Formals (E : Entity_Id) is
1068 if Is_Generic_Subprogram (E) then
1069 Formal := First_Entity (E);
1071 while Present (Formal)
1072 and then not Is_Formal (Formal)
1074 Next_Entity (Formal);
1078 Formal := First_Formal (E);
1081 while Present (Formal) loop
1082 if Ekind (Formal) = E_In_Parameter then
1084 if Nkind (Parameter_Type (Parent (Formal)))
1085 = N_Access_Definition
1087 Generate_Reference (E, Formal, '^', False);
1089 Generate_Reference (E, Formal, '>', False);
1092 elsif Ekind (Formal) = E_In_Out_Parameter then
1093 Generate_Reference (E, Formal, '=', False);
1096 Generate_Reference (E, Formal, '<', False);
1099 Next_Formal (Formal);
1101 end Generate_Reference_To_Formals;
1103 -------------------------------------------
1104 -- Generate_Reference_To_Generic_Formals --
1105 -------------------------------------------
1107 procedure Generate_Reference_To_Generic_Formals (E : Entity_Id) is
1111 Formal := First_Entity (E);
1112 while Present (Formal) loop
1113 if Comes_From_Source (Formal) then
1114 Generate_Reference (E, Formal, 'z', False);
1117 Next_Entity (Formal);
1119 end Generate_Reference_To_Generic_Formals;
1125 function Get_Key (E : Xref_Entry_Number) return Xref_Entry_Number is
1134 function Hash (F : Xref_Entry_Number) return Header_Num is
1135 -- It is unlikely to have two references to the same entity at the same
1136 -- source location, so the hash function depends only on the Ent and Loc
1139 XE : Xref_Entry renames Xrefs.Table (F);
1140 type M is mod 2**32;
1142 H : constant M := M (XE.Key.Ent) + 2 ** 7 * M (abs XE.Key.Loc);
1143 -- It would be more natural to write:
1145 -- H : constant M := M'Mod (XE.Key.Ent) + 2**7 * M'Mod (XE.Key.Loc);
1147 -- But we can't use M'Mod, because it prevents bootstrapping with older
1148 -- compilers. Loc can be negative, so we do "abs" before converting.
1149 -- One day this can be cleaned up ???
1152 return Header_Num (H mod Num_Buckets);
1159 procedure HT_Set_Next (E : Xref_Entry_Number; Next : Xref_Entry_Number) is
1161 Xrefs.Table (E).HTable_Next := Next;
1168 function HT_Next (E : Xref_Entry_Number) return Xref_Entry_Number is
1170 return Xrefs.Table (E).HTable_Next;
1177 procedure Initialize is
1186 function Lt (T1, T2 : Xref_Entry) return Boolean is
1188 -- First test: if entity is in different unit, sort by unit
1190 if T1.Key.Eun /= T2.Key.Eun then
1191 return Dependency_Num (T1.Key.Eun) < Dependency_Num (T2.Key.Eun);
1193 -- Second test: within same unit, sort by entity Sloc
1195 elsif T1.Def /= T2.Def then
1196 return T1.Def < T2.Def;
1198 -- Third test: sort definitions ahead of references
1200 elsif T1.Key.Loc = No_Location then
1203 elsif T2.Key.Loc = No_Location then
1206 -- Fourth test: for same entity, sort by reference location unit
1208 elsif T1.Key.Lun /= T2.Key.Lun then
1209 return Dependency_Num (T1.Key.Lun) < Dependency_Num (T2.Key.Lun);
1211 -- Fifth test: order of location within referencing unit
1213 elsif T1.Key.Loc /= T2.Key.Loc then
1214 return T1.Key.Loc < T2.Key.Loc;
1216 -- Finally, for two locations at the same address, we prefer
1217 -- the one that does NOT have the type 'r' so that a modification
1218 -- or extension takes preference, when there are more than one
1219 -- reference at the same location. As a result, in the case of
1220 -- entities that are in-out actuals, the read reference follows
1221 -- the modify reference.
1224 return T2.Key.Typ = 'r';
1228 -----------------------
1229 -- Output_References --
1230 -----------------------
1232 procedure Output_References is
1234 procedure Get_Type_Reference
1236 Tref : out Entity_Id;
1237 Left : out Character;
1238 Right : out Character);
1239 -- Given an Entity_Id Ent, determines whether a type reference is
1240 -- required. If so, Tref is set to the entity for the type reference
1241 -- and Left and Right are set to the left/right brackets to be output
1242 -- for the reference. If no type reference is required, then Tref is
1243 -- set to Empty, and Left/Right are set to space.
1245 procedure Output_Import_Export_Info (Ent : Entity_Id);
1246 -- Output language and external name information for an interfaced
1247 -- entity, using the format <language, external_name>.
1249 ------------------------
1250 -- Get_Type_Reference --
1251 ------------------------
1253 procedure Get_Type_Reference
1255 Tref : out Entity_Id;
1256 Left : out Character;
1257 Right : out Character)
1262 -- See if we have a type reference
1271 -- Processing for types
1273 if Is_Type (Tref) then
1275 -- Case of base type
1277 if Base_Type (Tref) = Tref then
1279 -- If derived, then get first subtype
1281 if Tref /= Etype (Tref) then
1282 Tref := First_Subtype (Etype (Tref));
1284 -- Set brackets for derived type, but don't override
1285 -- pointer case since the fact that something is a
1286 -- pointer is more important.
1293 -- If non-derived ptr, get directly designated type.
1294 -- If the type has a full view, all references are on the
1295 -- partial view, that is seen first.
1297 elsif Is_Access_Type (Tref) then
1298 Tref := Directly_Designated_Type (Tref);
1302 elsif Is_Private_Type (Tref)
1303 and then Present (Full_View (Tref))
1305 if Is_Access_Type (Full_View (Tref)) then
1306 Tref := Directly_Designated_Type (Full_View (Tref));
1310 -- If the full view is an array type, we also retrieve
1311 -- the corresponding component type, because the ali
1312 -- entry already indicates that this is an array.
1314 elsif Is_Array_Type (Full_View (Tref)) then
1315 Tref := Component_Type (Full_View (Tref));
1320 -- If non-derived array, get component type. Skip component
1321 -- type for case of String or Wide_String, saves worthwhile
1324 elsif Is_Array_Type (Tref)
1325 and then Tref /= Standard_String
1326 and then Tref /= Standard_Wide_String
1328 Tref := Component_Type (Tref);
1332 -- For other non-derived base types, nothing
1338 -- For a subtype, go to ancestor subtype
1341 Tref := Ancestor_Subtype (Tref);
1343 -- If no ancestor subtype, go to base type
1346 Tref := Base_Type (Sav);
1350 -- For objects, functions, enum literals, just get type from
1353 elsif Is_Object (Tref)
1354 or else Ekind (Tref) = E_Enumeration_Literal
1355 or else Ekind (Tref) = E_Function
1356 or else Ekind (Tref) = E_Operator
1358 Tref := Etype (Tref);
1360 -- For anything else, exit
1366 -- Exit if no type reference, or we are stuck in some loop trying
1367 -- to find the type reference, or if the type is standard void
1368 -- type (the latter is an implementation artifact that should not
1369 -- show up in the generated cross-references).
1373 or else Tref = Standard_Void_Type;
1375 -- If we have a usable type reference, return, otherwise keep
1376 -- looking for something useful (we are looking for something
1377 -- that either comes from source or standard)
1379 if Sloc (Tref) = Standard_Location
1380 or else Comes_From_Source (Tref)
1382 -- If the reference is a subtype created for a generic actual,
1383 -- go actual directly, the inner subtype is not user visible.
1385 if Nkind (Parent (Tref)) = N_Subtype_Declaration
1386 and then not Comes_From_Source (Parent (Tref))
1388 (Is_Wrapper_Package (Scope (Tref))
1389 or else Is_Generic_Instance (Scope (Tref)))
1391 Tref := First_Subtype (Base_Type (Tref));
1398 -- If we fall through the loop, no type reference
1403 end Get_Type_Reference;
1405 -------------------------------
1406 -- Output_Import_Export_Info --
1407 -------------------------------
1409 procedure Output_Import_Export_Info (Ent : Entity_Id) is
1410 Language_Name : Name_Id;
1411 Conv : constant Convention_Id := Convention (Ent);
1414 -- Generate language name from convention
1416 if Conv = Convention_C then
1417 Language_Name := Name_C;
1419 elsif Conv = Convention_CPP then
1420 Language_Name := Name_CPP;
1422 elsif Conv = Convention_Ada then
1423 Language_Name := Name_Ada;
1426 -- For the moment we ignore all other cases ???
1431 Write_Info_Char ('<');
1432 Get_Unqualified_Name_String (Language_Name);
1434 for J in 1 .. Name_Len loop
1435 Write_Info_Char (Name_Buffer (J));
1438 if Present (Interface_Name (Ent)) then
1439 Write_Info_Char (',');
1440 String_To_Name_Buffer (Strval (Interface_Name (Ent)));
1442 for J in 1 .. Name_Len loop
1443 Write_Info_Char (Name_Buffer (J));
1447 Write_Info_Char ('>');
1448 end Output_Import_Export_Info;
1450 -- Start of processing for Output_References
1453 -- First we add references to the primitive operations of tagged types
1454 -- declared in the main unit.
1456 Handle_Prim_Ops : declare
1460 for J in 1 .. Xrefs.Last loop
1461 Ent := Xrefs.Table (J).Key.Ent;
1464 and then Is_Tagged_Type (Ent)
1465 and then Is_Base_Type (Ent)
1466 and then In_Extended_Main_Source_Unit (Ent)
1468 Generate_Prim_Op_References (Ent);
1471 end Handle_Prim_Ops;
1473 -- Before we go ahead and output the references we have a problem
1474 -- that needs dealing with. So far we have captured things that are
1475 -- definitely referenced by the main unit, or defined in the main
1476 -- unit. That's because we don't want to clutter up the ali file
1477 -- for this unit with definition lines for entities in other units
1478 -- that are not referenced.
1480 -- But there is a glitch. We may reference an entity in another unit,
1481 -- and it may have a type reference to an entity that is not directly
1482 -- referenced in the main unit, which may mean that there is no xref
1483 -- entry for this entity yet in the list of references.
1485 -- If we don't do something about this, we will end with an orphan type
1486 -- reference, i.e. it will point to an entity that does not appear
1487 -- within the generated references in the ali file. That is not good for
1488 -- tools using the xref information.
1490 -- To fix this, we go through the references adding definition entries
1491 -- for any unreferenced entities that can be referenced in a type
1492 -- reference. There is a recursion problem here, and that is dealt with
1493 -- by making sure that this traversal also traverses any entries that
1494 -- get added by the traversal.
1496 Handle_Orphan_Type_References : declare
1502 pragma Warnings (Off, L);
1503 pragma Warnings (Off, R);
1505 procedure New_Entry (E : Entity_Id);
1506 -- Make an additional entry into the Xref table for a type entity
1507 -- that is related to the current entity (parent, type ancestor,
1508 -- progenitor, etc.).
1514 procedure New_Entry (E : Entity_Id) is
1516 pragma Assert (Present (E));
1518 if not Has_Xref_Entry (Implementation_Base_Type (E))
1519 and then Sloc (E) > No_Location
1524 Typ => Character'First,
1525 Eun => Get_Source_Unit (Original_Location (Sloc (E))),
1528 Ent_Scope => Empty),
1529 Ent_Scope_File => No_Unit);
1533 -- Start of processing for Handle_Orphan_Type_References
1536 -- Note that this is not a for loop for a very good reason. The
1537 -- processing of items in the table can add new items to the table,
1538 -- and they must be processed as well.
1541 while J <= Xrefs.Last loop
1542 Ent := Xrefs.Table (J).Key.Ent;
1543 Get_Type_Reference (Ent, Tref, L, R);
1546 and then not Has_Xref_Entry (Tref)
1547 and then Sloc (Tref) > No_Location
1551 if Is_Record_Type (Ent)
1552 and then Present (Interfaces (Ent))
1554 -- Add an entry for each one of the given interfaces
1555 -- implemented by type Ent.
1558 Elmt : Elmt_Id := First_Elmt (Interfaces (Ent));
1560 while Present (Elmt) loop
1561 New_Entry (Node (Elmt));
1568 -- Collect inherited primitive operations that may be declared in
1569 -- another unit and have no visible reference in the current one.
1572 and then Is_Tagged_Type (Ent)
1573 and then Is_Derived_Type (Ent)
1574 and then Is_Base_Type (Ent)
1575 and then In_Extended_Main_Source_Unit (Ent)
1578 Op_List : constant Elist_Id := Primitive_Operations (Ent);
1582 function Parent_Op (E : Entity_Id) return Entity_Id;
1583 -- Find original operation, which may be inherited through
1584 -- several derivations.
1586 function Parent_Op (E : Entity_Id) return Entity_Id is
1587 Orig_Op : constant Entity_Id := Alias (E);
1590 if No (Orig_Op) then
1593 elsif not Comes_From_Source (E)
1594 and then not Has_Xref_Entry (Orig_Op)
1595 and then Comes_From_Source (Orig_Op)
1599 return Parent_Op (Orig_Op);
1604 Op := First_Elmt (Op_List);
1605 while Present (Op) loop
1606 Prim := Parent_Op (Node (Op));
1608 if Present (Prim) then
1612 Typ => Character'First,
1613 Eun => Get_Source_Unit (Sloc (Prim)),
1616 Ent_Scope => Empty),
1617 Ent_Scope_File => No_Unit);
1627 end Handle_Orphan_Type_References;
1629 -- Now we have all the references, including those for any embedded
1630 -- type references, so we can sort them, and output them.
1632 Output_Refs : declare
1634 Nrefs : constant Nat := Xrefs.Last;
1635 -- Number of references in table
1637 Rnums : array (0 .. Nrefs) of Nat;
1638 -- This array contains numbers of references in the Xrefs table.
1639 -- This list is sorted in output order. The extra 0'th entry is
1640 -- convenient for the call to sort. When we sort the table, we
1641 -- move the entries in Rnums around, but we do not move the
1642 -- original table entries.
1644 Curxu : Unit_Number_Type;
1645 -- Current xref unit
1647 Curru : Unit_Number_Type;
1648 -- Current reference unit for one entity
1653 Curnam : String (1 .. Name_Buffer'Length);
1655 -- Simple name and length of current entity
1657 Curdef : Source_Ptr;
1658 -- Original source location for current entity
1661 -- Current reference location
1664 -- Entity type character
1667 -- reference kind of previous reference
1673 -- Renaming reference
1675 Trunit : Unit_Number_Type;
1676 -- Unit number for type reference
1678 function Lt (Op1, Op2 : Natural) return Boolean;
1679 -- Comparison function for Sort call
1681 function Name_Change (X : Entity_Id) return Boolean;
1682 -- Determines if entity X has a different simple name from Curent
1684 procedure Move (From : Natural; To : Natural);
1685 -- Move procedure for Sort call
1687 package Sorting is new GNAT.Heap_Sort_G (Move, Lt);
1693 function Lt (Op1, Op2 : Natural) return Boolean is
1694 T1 : Xref_Entry renames Xrefs.Table (Rnums (Nat (Op1)));
1695 T2 : Xref_Entry renames Xrefs.Table (Rnums (Nat (Op2)));
1705 procedure Move (From : Natural; To : Natural) is
1707 Rnums (Nat (To)) := Rnums (Nat (From));
1714 -- Why a string comparison here??? Why not compare Name_Id values???
1716 function Name_Change (X : Entity_Id) return Boolean is
1718 Get_Unqualified_Name_String (Chars (X));
1720 if Name_Len /= Curlen then
1723 return Name_Buffer (1 .. Curlen) /= Curnam (1 .. Curlen);
1727 -- Start of processing for Output_Refs
1730 -- Capture the definition Sloc values. We delay doing this till now,
1731 -- since at the time the reference or definition is made, private
1732 -- types may be swapped, and the Sloc value may be incorrect. We
1733 -- also set up the pointer vector for the sort.
1735 -- For user-defined operators we need to skip the initial quote and
1736 -- point to the first character of the name, for navigation purposes.
1738 for J in 1 .. Nrefs loop
1740 E : constant Entity_Id := Xrefs.Table (J).Key.Ent;
1741 Loc : constant Source_Ptr := Original_Location (Sloc (E));
1746 if Nkind (E) = N_Defining_Operator_Symbol then
1747 Xrefs.Table (J).Def := Loc + 1;
1749 Xrefs.Table (J).Def := Loc;
1754 -- Sort the references
1756 Sorting.Sort (Integer (Nrefs));
1758 -- Initialize loop through references
1762 Curdef := No_Location;
1764 Crloc := No_Location;
1767 -- Loop to output references
1769 for Refno in 1 .. Nrefs loop
1770 Output_One_Ref : declare
1773 XE : Xref_Entry renames Xrefs.Table (Rnums (Refno));
1774 -- The current entry to be accessed
1778 -- Used for {} or <> or () for type reference
1780 procedure Check_Type_Reference
1782 List_Interface : Boolean);
1783 -- Find whether there is a meaningful type reference for
1784 -- Ent, and display it accordingly. If List_Interface is
1785 -- true, then Ent is a progenitor interface of the current
1786 -- type entity being listed. In that case list it as is,
1787 -- without looking for a type reference for it.
1789 procedure Output_Instantiation_Refs (Loc : Source_Ptr);
1790 -- Recursive procedure to output instantiation references for
1791 -- the given source ptr in [file|line[...]] form. No output
1792 -- if the given location is not a generic template reference.
1794 procedure Output_Overridden_Op (Old_E : Entity_Id);
1795 -- For a subprogram that is overriding, display information
1796 -- about the inherited operation that it overrides.
1798 --------------------------
1799 -- Check_Type_Reference --
1800 --------------------------
1802 procedure Check_Type_Reference
1804 List_Interface : Boolean)
1807 if List_Interface then
1809 -- This is a progenitor interface of the type for which
1810 -- xref information is being generated.
1817 Get_Type_Reference (Ent, Tref, Left, Right);
1820 if Present (Tref) then
1822 -- Case of standard entity, output name
1824 if Sloc (Tref) = Standard_Location then
1825 Write_Info_Char (Left);
1826 Write_Info_Name (Chars (Tref));
1827 Write_Info_Char (Right);
1829 -- Case of source entity, output location
1832 Write_Info_Char (Left);
1833 Trunit := Get_Source_Unit (Sloc (Tref));
1835 if Trunit /= Curxu then
1836 Write_Info_Nat (Dependency_Num (Trunit));
1837 Write_Info_Char ('|');
1841 (Int (Get_Logical_Line_Number (Sloc (Tref))));
1849 Ctyp := Xref_Entity_Letters (Ekind (Ent));
1852 and then Present (Full_View (Ent))
1854 Ent := Underlying_Type (Ent);
1856 if Present (Ent) then
1857 Ctyp := Xref_Entity_Letters (Ekind (Ent));
1861 Write_Info_Char (Ctyp);
1865 (Int (Get_Column_Number (Sloc (Tref))));
1867 -- If the type comes from an instantiation, add the
1868 -- corresponding info.
1870 Output_Instantiation_Refs (Sloc (Tref));
1871 Write_Info_Char (Right);
1874 end Check_Type_Reference;
1876 -------------------------------
1877 -- Output_Instantiation_Refs --
1878 -------------------------------
1880 procedure Output_Instantiation_Refs (Loc : Source_Ptr) is
1881 Iloc : constant Source_Ptr := Instantiation_Location (Loc);
1882 Lun : Unit_Number_Type;
1883 Cu : constant Unit_Number_Type := Curru;
1886 -- Nothing to do if this is not an instantiation
1888 if Iloc = No_Location then
1892 -- Output instantiation reference
1894 Write_Info_Char ('[');
1895 Lun := Get_Source_Unit (Iloc);
1897 if Lun /= Curru then
1899 Write_Info_Nat (Dependency_Num (Curru));
1900 Write_Info_Char ('|');
1903 Write_Info_Nat (Int (Get_Logical_Line_Number (Iloc)));
1905 -- Recursive call to get nested instantiations
1907 Output_Instantiation_Refs (Iloc);
1909 -- Output final ] after call to get proper nesting
1911 Write_Info_Char (']');
1914 end Output_Instantiation_Refs;
1916 --------------------------
1917 -- Output_Overridden_Op --
1918 --------------------------
1920 procedure Output_Overridden_Op (Old_E : Entity_Id) is
1924 -- The overridden operation has an implicit declaration
1925 -- at the point of derivation. What we want to display
1926 -- is the original operation, which has the actual body
1927 -- (or abstract declaration) that is being overridden.
1928 -- The overridden operation is not always set, e.g. when
1929 -- it is a predefined operator.
1934 -- Follow alias chain if one is present
1936 elsif Present (Alias (Old_E)) then
1938 -- The subprogram may have been implicitly inherited
1939 -- through several levels of derivation, so find the
1940 -- ultimate (source) ancestor.
1942 Op := Ultimate_Alias (Old_E);
1944 -- Normal case of no alias present. We omit generated
1945 -- primitives like tagged equality, that have no source
1953 and then Sloc (Op) /= Standard_Location
1954 and then Comes_From_Source (Op)
1957 Loc : constant Source_Ptr := Sloc (Op);
1958 Par_Unit : constant Unit_Number_Type :=
1959 Get_Source_Unit (Loc);
1962 Write_Info_Char ('<');
1964 if Par_Unit /= Curxu then
1965 Write_Info_Nat (Dependency_Num (Par_Unit));
1966 Write_Info_Char ('|');
1969 Write_Info_Nat (Int (Get_Logical_Line_Number (Loc)));
1970 Write_Info_Char ('p');
1971 Write_Info_Nat (Int (Get_Column_Number (Loc)));
1972 Write_Info_Char ('>');
1975 end Output_Overridden_Op;
1977 -- Start of processing for Output_One_Ref
1981 Ctyp := Xref_Entity_Letters (Ekind (Ent));
1983 -- Skip reference if it is the only reference to an entity,
1984 -- and it is an END line reference, and the entity is not in
1985 -- the current extended source. This prevents junk entries
1986 -- consisting only of packages with END lines, where no
1987 -- entity from the package is actually referenced.
1990 and then Ent /= Curent
1991 and then (Refno = Nrefs
1993 Ent /= Xrefs.Table (Rnums (Refno + 1)).Key.Ent)
1994 and then not In_Extended_Main_Source_Unit (Ent)
1999 -- For private type, get full view type
2002 and then Present (Full_View (XE.Key.Ent))
2004 Ent := Underlying_Type (Ent);
2006 if Present (Ent) then
2007 Ctyp := Xref_Entity_Letters (Ekind (Ent));
2011 -- Special exception for Boolean
2013 if Ctyp = 'E' and then Is_Boolean_Type (Ent) then
2017 -- For variable reference, get corresponding type
2020 Ent := Etype (XE.Key.Ent);
2021 Ctyp := Fold_Lower (Xref_Entity_Letters (Ekind (Ent)));
2023 -- If variable is private type, get full view type
2026 and then Present (Full_View (Etype (XE.Key.Ent)))
2028 Ent := Underlying_Type (Etype (XE.Key.Ent));
2030 if Present (Ent) then
2031 Ctyp := Fold_Lower (Xref_Entity_Letters (Ekind (Ent)));
2034 elsif Is_Generic_Type (Ent) then
2036 -- If the type of the entity is a generic private type,
2037 -- there is no usable full view, so retain the indication
2038 -- that this is an object.
2043 -- Special handling for access parameters and objects of
2044 -- an anonymous access type.
2046 if Ekind_In (Etype (XE.Key.Ent),
2047 E_Anonymous_Access_Type,
2048 E_Anonymous_Access_Subprogram_Type,
2049 E_Anonymous_Access_Protected_Subprogram_Type)
2051 if Is_Formal (XE.Key.Ent)
2052 or else Ekind_In (XE.Key.Ent, E_Variable, E_Constant)
2057 -- Special handling for Boolean
2059 elsif Ctyp = 'e' and then Is_Boolean_Type (Ent) then
2064 -- Special handling for abstract types and operations
2066 if Is_Overloadable (XE.Key.Ent)
2067 and then Is_Abstract_Subprogram (XE.Key.Ent)
2070 Ctyp := 'x'; -- Abstract procedure
2072 elsif Ctyp = 'V' then
2073 Ctyp := 'y'; -- Abstract function
2076 elsif Is_Type (XE.Key.Ent)
2077 and then Is_Abstract_Type (XE.Key.Ent)
2079 if Is_Interface (XE.Key.Ent) then
2082 elsif Ctyp = 'R' then
2083 Ctyp := 'H'; -- Abstract type
2087 -- Only output reference if interesting type of entity
2091 -- Suppress references to object definitions, used for local
2094 or else XE.Key.Typ = 'D'
2095 or else XE.Key.Typ = 'I'
2097 -- Suppress self references, except for bodies that act as
2100 or else (XE.Key.Loc = XE.Def
2103 or else not Is_Subprogram (XE.Key.Ent)))
2105 -- Also suppress definitions of body formals (we only
2106 -- treat these as references, and the references were
2107 -- separately recorded).
2109 or else (Is_Formal (XE.Key.Ent)
2110 and then Present (Spec_Entity (XE.Key.Ent)))
2115 -- Start new Xref section if new xref unit
2117 if XE.Key.Eun /= Curxu then
2118 if Write_Info_Col > 1 then
2122 Curxu := XE.Key.Eun;
2124 Write_Info_Initiate ('X');
2125 Write_Info_Char (' ');
2126 Write_Info_Nat (Dependency_Num (XE.Key.Eun));
2127 Write_Info_Char (' ');
2129 (Reference_Name (Source_Index (XE.Key.Eun)));
2132 -- Start new Entity line if new entity. Note that we
2133 -- consider two entities the same if they have the same
2134 -- name and source location. This causes entities in
2135 -- instantiations to be treated as though they referred
2140 (XE.Key.Ent /= Curent
2142 (Name_Change (XE.Key.Ent) or else XE.Def /= Curdef))
2144 Curent := XE.Key.Ent;
2147 Get_Unqualified_Name_String (Chars (XE.Key.Ent));
2149 Curnam (1 .. Curlen) := Name_Buffer (1 .. Curlen);
2151 if Write_Info_Col > 1 then
2155 -- Write column number information
2157 Write_Info_Nat (Int (Get_Logical_Line_Number (XE.Def)));
2158 Write_Info_Char (Ctyp);
2159 Write_Info_Nat (Int (Get_Column_Number (XE.Def)));
2161 -- Write level information
2163 Write_Level_Info : declare
2164 function Is_Visible_Generic_Entity
2165 (E : Entity_Id) return Boolean;
2166 -- Check whether E is declared in the visible part
2167 -- of a generic package. For source navigation
2168 -- purposes, treat this as a visible entity.
2170 function Is_Private_Record_Component
2171 (E : Entity_Id) return Boolean;
2172 -- Check whether E is a non-inherited component of a
2173 -- private extension. Even if the enclosing record is
2174 -- public, we want to treat the component as private
2175 -- for navigation purposes.
2177 ---------------------------------
2178 -- Is_Private_Record_Component --
2179 ---------------------------------
2181 function Is_Private_Record_Component
2182 (E : Entity_Id) return Boolean
2184 S : constant Entity_Id := Scope (E);
2187 Ekind (E) = E_Component
2188 and then Nkind (Declaration_Node (S)) =
2189 N_Private_Extension_Declaration
2190 and then Original_Record_Component (E) = E;
2191 end Is_Private_Record_Component;
2193 -------------------------------
2194 -- Is_Visible_Generic_Entity --
2195 -------------------------------
2197 function Is_Visible_Generic_Entity
2198 (E : Entity_Id) return Boolean
2203 -- The Present check here is an error defense
2205 if Present (Scope (E))
2206 and then Ekind (Scope (E)) /= E_Generic_Package
2212 while Present (Par) loop
2214 Nkind (Par) = N_Generic_Package_Declaration
2216 -- Entity is a generic formal
2221 Nkind (Parent (Par)) = N_Package_Specification
2224 Is_List_Member (Par)
2225 and then List_Containing (Par) =
2226 Visible_Declarations (Parent (Par));
2228 Par := Parent (Par);
2233 end Is_Visible_Generic_Entity;
2235 -- Start of processing for Write_Level_Info
2238 if Is_Hidden (Curent)
2239 or else Is_Private_Record_Component (Curent)
2241 Write_Info_Char (' ');
2245 or else Is_Visible_Generic_Entity (Curent)
2247 Write_Info_Char ('*');
2250 Write_Info_Char (' ');
2252 end Write_Level_Info;
2254 -- Output entity name. We use the occurrence from the
2255 -- actual source program at the definition point.
2258 Ent_Name : constant String :=
2259 Exact_Source_Name (Sloc (XE.Key.Ent));
2261 for C in Ent_Name'Range loop
2262 Write_Info_Char (Ent_Name (C));
2266 -- See if we have a renaming reference
2268 if Is_Object (XE.Key.Ent)
2269 and then Present (Renamed_Object (XE.Key.Ent))
2271 Rref := Renamed_Object (XE.Key.Ent);
2273 elsif Is_Overloadable (XE.Key.Ent)
2274 and then Nkind (Parent (Declaration_Node (XE.Key.Ent)))
2275 = N_Subprogram_Renaming_Declaration
2277 Rref := Name (Parent (Declaration_Node (XE.Key.Ent)));
2279 elsif Ekind (XE.Key.Ent) = E_Package
2280 and then Nkind (Declaration_Node (XE.Key.Ent)) =
2281 N_Package_Renaming_Declaration
2283 Rref := Name (Declaration_Node (XE.Key.Ent));
2289 if Present (Rref) then
2290 if Nkind (Rref) = N_Expanded_Name then
2291 Rref := Selector_Name (Rref);
2294 if Nkind (Rref) = N_Identifier
2295 or else Nkind (Rref) = N_Operator_Symbol
2299 -- For renamed array components, use the array name
2300 -- for the renamed entity, which reflect the fact that
2301 -- in general the whole array is aliased.
2303 elsif Nkind (Rref) = N_Indexed_Component then
2304 if Nkind (Prefix (Rref)) = N_Identifier then
2305 Rref := Prefix (Rref);
2306 elsif Nkind (Prefix (Rref)) = N_Expanded_Name then
2307 Rref := Selector_Name (Prefix (Rref));
2317 -- Write out renaming reference if we have one
2319 if Present (Rref) then
2320 Write_Info_Char ('=');
2322 (Int (Get_Logical_Line_Number (Sloc (Rref))));
2323 Write_Info_Char (':');
2325 (Int (Get_Column_Number (Sloc (Rref))));
2328 -- Indicate that the entity is in the unit of the current
2333 -- Write out information about generic parent, if entity
2336 if Is_Generic_Instance (XE.Key.Ent) then
2338 Gen_Par : constant Entity_Id :=
2341 (Unit_Declaration_Node
2343 Loc : constant Source_Ptr := Sloc (Gen_Par);
2344 Gen_U : constant Unit_Number_Type :=
2345 Get_Source_Unit (Loc);
2348 Write_Info_Char ('[');
2350 if Curru /= Gen_U then
2351 Write_Info_Nat (Dependency_Num (Gen_U));
2352 Write_Info_Char ('|');
2356 (Int (Get_Logical_Line_Number (Loc)));
2357 Write_Info_Char (']');
2361 -- See if we have a type reference and if so output
2363 Check_Type_Reference (XE.Key.Ent, False);
2365 -- Additional information for types with progenitors
2367 if Is_Record_Type (XE.Key.Ent)
2368 and then Present (Interfaces (XE.Key.Ent))
2372 First_Elmt (Interfaces (XE.Key.Ent));
2374 while Present (Elmt) loop
2375 Check_Type_Reference (Node (Elmt), True);
2380 -- For array types, list index types as well. (This is
2381 -- not C, indexes have distinct types).
2383 elsif Is_Array_Type (XE.Key.Ent) then
2387 Indx := First_Index (XE.Key.Ent);
2388 while Present (Indx) loop
2389 Check_Type_Reference
2390 (First_Subtype (Etype (Indx)), True);
2396 -- If the entity is an overriding operation, write info
2397 -- on operation that was overridden.
2399 if Is_Subprogram (XE.Key.Ent)
2400 and then Present (Overridden_Operation (XE.Key.Ent))
2402 Output_Overridden_Op
2403 (Overridden_Operation (XE.Key.Ent));
2406 -- End of processing for entity output
2408 Crloc := No_Location;
2411 -- Output the reference if it is not as the same location
2412 -- as the previous one, or it is a read-reference that
2413 -- indicates that the entity is an in-out actual in a call.
2415 if XE.Key.Loc /= No_Location
2417 (XE.Key.Loc /= Crloc
2418 or else (Prevt = 'm' and then XE.Key.Typ = 'r'))
2420 Crloc := XE.Key.Loc;
2421 Prevt := XE.Key.Typ;
2423 -- Start continuation if line full, else blank
2425 if Write_Info_Col > 72 then
2427 Write_Info_Initiate ('.');
2430 Write_Info_Char (' ');
2432 -- Output file number if changed
2434 if XE.Key.Lun /= Curru then
2435 Curru := XE.Key.Lun;
2436 Write_Info_Nat (Dependency_Num (Curru));
2437 Write_Info_Char ('|');
2441 (Int (Get_Logical_Line_Number (XE.Key.Loc)));
2442 Write_Info_Char (XE.Key.Typ);
2444 if Is_Overloadable (XE.Key.Ent) then
2445 if (Is_Imported (XE.Key.Ent) and then XE.Key.Typ = 'b')
2447 (Is_Exported (XE.Key.Ent) and then XE.Key.Typ = 'i')
2449 Output_Import_Export_Info (XE.Key.Ent);
2453 Write_Info_Nat (Int (Get_Column_Number (XE.Key.Loc)));
2455 Output_Instantiation_Refs (Sloc (XE.Key.Ent));
2466 end Output_References;
2468 -- Start of elaboration for Lib.Xref
2471 -- Reset is necessary because Elmt_Ptr does not default to Null_Ptr,
2472 -- because it's not an access type.