lib-xref-alfa.adb (Generate_Dereference): Use Get_Code_Unit instead of Get_Source_Uni...
[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-2012, 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 Alfa 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 -- Alfa Information --
156 ----------------------
157
158 package body Alfa 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.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
439
440 function Is_On_LHS (Node : Node_Id) return Boolean is
441 N : Node_Id;
442 P : Node_Id;
443 K : Node_Kind;
444
445 begin
446 -- Only identifiers are considered, is this necessary???
447
448 if Nkind (Node) /= N_Identifier then
449 return False;
450 end if;
451
452 -- Immediate return if appeared as OUT parameter
453
454 if Kind = E_Out_Parameter then
455 return True;
456 end if;
457
458 -- Search for assignment statement subtree root
459
460 N := Node;
461 loop
462 P := Parent (N);
463 K := Nkind (P);
464
465 if K = N_Assignment_Statement then
466 return Name (P) = N;
467
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.
473
474 -- ??? case of a slice assignment?
475
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
481 -- false positive.
482
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))
486 and then
487 Is_Access_Type (Etype (N)))
488 then
489 N := P;
490
491 -- All other cases, definitely not on left side
492
493 else
494 return False;
495 end if;
496 end loop;
497 end Is_On_LHS;
498
499 ---------------------------
500 -- OK_To_Set_Referenced --
501 ---------------------------
502
503 function OK_To_Set_Referenced return Boolean is
504 P : Node_Id;
505
506 begin
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.
511
512 if Nkind (N) = N_Identifier then
513 P := Parent (N);
514
515 if Nkind (P) = N_Pragma_Argument_Association then
516 P := Parent (P);
517
518 if Nkind (P) = N_Pragma then
519 if Pragma_Name (P) = Name_Warnings
520 or else
521 Pragma_Name (P) = Name_Unmodified
522 or else
523 Pragma_Name (P) = Name_Unreferenced
524 then
525 return False;
526 end if;
527 end if;
528
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.
533
534 elsif Nkind (P) = N_Parameter_Association
535 and then N = Selector_Name (P)
536 then
537 return False;
538 end if;
539 end if;
540
541 return True;
542 end OK_To_Set_Referenced;
543
544 -- Start of processing for Generate_Reference
545
546 begin
547 pragma Assert (Nkind (E) in N_Entity);
548 Find_Actual (N, Formal, Call);
549
550 if Present (Formal) then
551 Kind := Ekind (Formal);
552 else
553 Kind := E_Void;
554 end if;
555
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.
561
562 if E = Standard_ASCII then
563 Check_Restriction (No_Obsolescent_Features, N);
564 end if;
565
566 -- Check for reference to entity marked with Is_Obsolescent
567
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.
572
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).
578
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)
583 then
584 Check_Restriction (No_Obsolescent_Features, N);
585
586 if Warn_On_Obsolescent_Feature then
587 Output_Obsolescent_Entity_Warnings (N, E);
588 end if;
589 end if;
590
591 -- Warn if reference to Ada 2005 entity not in Ada 2005 mode. We only
592 -- detect real explicit references (modifications and references).
593
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')
599 then
600 Error_Msg_NE ("& is only defined in Ada 2005?", N, E);
601 end if;
602
603 -- Warn if reference to Ada 2012 entity not in Ada 2012 mode. We only
604 -- detect real explicit references (modifications and references).
605
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')
611 then
612 Error_Msg_NE ("& is only defined in Ada 2012?", N, E);
613 end if;
614
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.
621
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.
627
628 if not In_Extended_Main_Source_Unit (N) then
629 if Typ = 'e'
630 or else Typ = 'I'
631 or else Typ = 'p'
632 or else Typ = 'i'
633 or else Typ = 'k'
634 or else (Typ = 'b' and then Is_Generic_Instance (E))
635
636 -- Allow the generation of references to reads, writes and calls
637 -- in Alfa mode when the related context comes from an instance.
638
639 or else
640 (Alfa_Mode
641 and then In_Extended_Main_Code_Unit (N)
642 and then (Typ = 'm'
643 or else Typ = 'r'
644 or else Typ = 's'))
645 then
646 null;
647 else
648 return;
649 end if;
650 end if;
651
652 -- For reference type p, the entity must be in main source unit
653
654 if Typ = 'p' and then not In_Extended_Main_Source_Unit (E) then
655 return;
656 end if;
657
658 -- Unless the reference is forced, we ignore references where the
659 -- reference itself does not come from source.
660
661 if not Force and then not Comes_From_Source (N) then
662 return;
663 end if;
664
665 -- Deal with setting entity as referenced, unless suppressed. Note that
666 -- we still do Set_Referenced on entities that do not come from source.
667 -- This situation arises when we have a source reference to a derived
668 -- operation, where the derived operation itself does not come from
669 -- source, but we still want to mark it as referenced, since we really
670 -- are referencing an entity in the corresponding package (this avoids
671 -- wrong complaints that the package contains no referenced entities).
672
673 if Set_Ref then
674
675 -- Assignable object appearing on left side of assignment or as
676 -- an out parameter.
677
678 if Is_Assignable (E)
679 and then Is_On_LHS (N)
680 and then Ekind (E) /= E_In_Out_Parameter
681 then
682 -- For objects that are renamings, just set as simply referenced
683 -- we do not try to do assignment type tracking in this case.
684
685 if Present (Renamed_Object (E)) then
686 Set_Referenced (E);
687
688 -- Out parameter case
689
690 elsif Kind = E_Out_Parameter then
691
692 -- If warning mode for all out parameters is set, or this is
693 -- the only warning parameter, then we want to mark this for
694 -- later warning logic by setting Referenced_As_Out_Parameter
695
696 if Warn_On_Modified_As_Out_Parameter (Formal) then
697 Set_Referenced_As_Out_Parameter (E, True);
698 Set_Referenced_As_LHS (E, False);
699
700 -- For OUT parameter not covered by the above cases, we simply
701 -- regard it as a normal reference (in this case we do not
702 -- want any of the warning machinery for out parameters).
703
704 else
705 Set_Referenced (E);
706 end if;
707
708 -- For the left hand of an assignment case, we do nothing here.
709 -- The processing for Analyze_Assignment_Statement will set the
710 -- Referenced_As_LHS flag.
711
712 else
713 null;
714 end if;
715
716 -- Check for a reference in a pragma that should not count as a
717 -- making the variable referenced for warning purposes.
718
719 elsif Is_Non_Significant_Pragma_Reference (N) then
720 null;
721
722 -- A reference in an attribute definition clause does not count as a
723 -- reference except for the case of Address. The reason that 'Address
724 -- is an exception is that it creates an alias through which the
725 -- variable may be referenced.
726
727 elsif Nkind (Parent (N)) = N_Attribute_Definition_Clause
728 and then Chars (Parent (N)) /= Name_Address
729 and then N = Name (Parent (N))
730 then
731 null;
732
733 -- Constant completion does not count as a reference
734
735 elsif Typ = 'c'
736 and then Ekind (E) = E_Constant
737 then
738 null;
739
740 -- Record representation clause does not count as a reference
741
742 elsif Nkind (N) = N_Identifier
743 and then Nkind (Parent (N)) = N_Record_Representation_Clause
744 then
745 null;
746
747 -- Discriminants do not need to produce a reference to record type
748
749 elsif Typ = 'd'
750 and then Nkind (Parent (N)) = N_Discriminant_Specification
751 then
752 null;
753
754 -- All other cases
755
756 else
757 -- Special processing for IN OUT parameters, where we have an
758 -- implicit assignment to a simple variable.
759
760 if Kind = E_In_Out_Parameter
761 and then Is_Assignable (E)
762 then
763 -- For sure this counts as a normal read reference
764
765 Set_Referenced (E);
766 Set_Last_Assignment (E, Empty);
767
768 -- We count it as being referenced as an out parameter if the
769 -- option is set to warn on all out parameters, except that we
770 -- have a special exclusion for an intrinsic subprogram, which
771 -- is most likely an instantiation of Unchecked_Deallocation
772 -- which we do not want to consider as an assignment since it
773 -- generates false positives. We also exclude the case of an
774 -- IN OUT parameter if the name of the procedure is Free,
775 -- since we suspect similar semantics.
776
777 if Warn_On_All_Unread_Out_Parameters
778 and then Is_Entity_Name (Name (Call))
779 and then not Is_Intrinsic_Subprogram (Entity (Name (Call)))
780 and then Chars (Name (Call)) /= Name_Free
781 then
782 Set_Referenced_As_Out_Parameter (E, True);
783 Set_Referenced_As_LHS (E, False);
784 end if;
785
786 -- Don't count a recursive reference within a subprogram as a
787 -- reference (that allows detection of a recursive subprogram
788 -- whose only references are recursive calls as unreferenced).
789
790 elsif Is_Subprogram (E)
791 and then E = Nearest_Dynamic_Scope (Current_Scope)
792 then
793 null;
794
795 -- Any other occurrence counts as referencing the entity
796
797 elsif OK_To_Set_Referenced then
798 Set_Referenced (E);
799
800 -- If variable, this is an OK reference after an assignment
801 -- so we can clear the Last_Assignment indication.
802
803 if Is_Assignable (E) then
804 Set_Last_Assignment (E, Empty);
805 end if;
806 end if;
807 end if;
808
809 -- Check for pragma Unreferenced given and reference is within
810 -- this source unit (occasion for possible warning to be issued).
811
812 if Has_Unreferenced (E)
813 and then In_Same_Extended_Unit (E, N)
814 then
815 -- A reference as a named parameter in a call does not count
816 -- as a violation of pragma Unreferenced for this purpose...
817
818 if Nkind (N) = N_Identifier
819 and then Nkind (Parent (N)) = N_Parameter_Association
820 and then Selector_Name (Parent (N)) = N
821 then
822 null;
823
824 -- ... Neither does a reference to a variable on the left side
825 -- of an assignment.
826
827 elsif Is_On_LHS (N) then
828 null;
829
830 -- For entry formals, we want to place the warning message on the
831 -- corresponding entity in the accept statement. The current scope
832 -- is the body of the accept, so we find the formal whose name
833 -- matches that of the entry formal (there is no link between the
834 -- two entities, and the one in the accept statement is only used
835 -- for conformance checking).
836
837 elsif Ekind (Scope (E)) = E_Entry then
838 declare
839 BE : Entity_Id;
840
841 begin
842 BE := First_Entity (Current_Scope);
843 while Present (BE) loop
844 if Chars (BE) = Chars (E) then
845 Error_Msg_NE -- CODEFIX
846 ("?pragma Unreferenced given for&!", N, BE);
847 exit;
848 end if;
849
850 Next_Entity (BE);
851 end loop;
852 end;
853
854 -- Here we issue the warning, since this is a real reference
855
856 else
857 Error_Msg_NE -- CODEFIX
858 ("?pragma Unreferenced given for&!", N, E);
859 end if;
860 end if;
861
862 -- If this is a subprogram instance, mark as well the internal
863 -- subprogram in the wrapper package, which may be a visible
864 -- compilation unit.
865
866 if Is_Overloadable (E)
867 and then Is_Generic_Instance (E)
868 and then Present (Alias (E))
869 then
870 Set_Referenced (Alias (E));
871 end if;
872 end if;
873
874 -- Generate reference if all conditions are met:
875
876 if
877 -- Cross referencing must be active
878
879 Opt.Xref_Active
880
881 -- The entity must be one for which we collect references
882
883 and then Xref_Entity_Letters (Ekind (E)) /= ' '
884
885 -- Both Sloc values must be set to something sensible
886
887 and then Sloc (E) > No_Location
888 and then Sloc (N) > No_Location
889
890 -- Ignore references from within an instance. The only exceptions to
891 -- this are default subprograms, for which we generate an implicit
892 -- reference and compilations in Alfa_Mode.
893
894 and then
895 (Instantiation_Location (Sloc (N)) = No_Location
896 or else Typ = 'i'
897 or else Alfa_Mode)
898
899 -- Ignore dummy references
900
901 and then Typ /= ' '
902 then
903 if Nkind (N) = N_Identifier
904 or else
905 Nkind (N) = N_Defining_Identifier
906 or else
907 Nkind (N) in N_Op
908 or else
909 Nkind (N) = N_Defining_Operator_Symbol
910 or else
911 Nkind (N) = N_Operator_Symbol
912 or else
913 (Nkind (N) = N_Character_Literal
914 and then Sloc (Entity (N)) /= Standard_Location)
915 or else
916 Nkind (N) = N_Defining_Character_Literal
917 then
918 Nod := N;
919
920 elsif Nkind (N) = N_Expanded_Name
921 or else
922 Nkind (N) = N_Selected_Component
923 then
924 Nod := Selector_Name (N);
925
926 else
927 return;
928 end if;
929
930 -- Normal case of source entity comes from source
931
932 if Comes_From_Source (E) then
933 Ent := E;
934
935 -- Entity does not come from source, but is a derived subprogram and
936 -- the derived subprogram comes from source (after one or more
937 -- derivations) in which case the reference is to parent subprogram.
938
939 elsif Is_Overloadable (E)
940 and then Present (Alias (E))
941 then
942 Ent := Alias (E);
943 while not Comes_From_Source (Ent) loop
944 if No (Alias (Ent)) then
945 return;
946 end if;
947
948 Ent := Alias (Ent);
949 end loop;
950
951 -- The internally created defining entity for a child subprogram
952 -- that has no previous spec has valid references.
953
954 elsif Is_Overloadable (E)
955 and then Is_Child_Unit (E)
956 then
957 Ent := E;
958
959 -- Record components of discriminated subtypes or derived types must
960 -- be treated as references to the original component.
961
962 elsif Ekind (E) = E_Component
963 and then Comes_From_Source (Original_Record_Component (E))
964 then
965 Ent := Original_Record_Component (E);
966
967 -- If this is an expanded reference to a discriminant, recover the
968 -- original discriminant, which gets the reference.
969
970 elsif Ekind (E) = E_In_Parameter
971 and then Present (Discriminal_Link (E))
972 then
973 Ent := Discriminal_Link (E);
974 Set_Referenced (Ent);
975
976 -- Ignore reference to any other entity that is not from source
977
978 else
979 return;
980 end if;
981
982 -- In Alfa mode, consider the underlying entity renamed instead of
983 -- the renaming, which is needed to compute a valid set of effects
984 -- (reads, writes) for the enclosing subprogram.
985
986 if Alfa_Mode then
987 Ent := Get_Through_Renamings (Ent);
988
989 -- If no enclosing object, then it could be a reference to any
990 -- location not tracked individually, like heap-allocated data.
991 -- Conservatively approximate this possibility by generating a
992 -- dereference, and return.
993
994 if No (Ent) then
995 if Actual_Typ = 'w' then
996 Alfa.Generate_Dereference (Nod, 'r');
997 Alfa.Generate_Dereference (Nod, 'w');
998 else
999 Alfa.Generate_Dereference (Nod, 'r');
1000 end if;
1001
1002 return;
1003 end if;
1004 end if;
1005
1006 -- Record reference to entity
1007
1008 if Actual_Typ = 'p'
1009 and then Is_Subprogram (Nod)
1010 and then Present (Overridden_Operation (Nod))
1011 then
1012 Actual_Typ := 'P';
1013 end if;
1014
1015 if Alfa_Mode then
1016 Ref := Sloc (Nod);
1017 Def := Sloc (Ent);
1018
1019 Ref_Scope := Alfa.Enclosing_Subprogram_Or_Package (Nod);
1020 Ent_Scope := Alfa.Enclosing_Subprogram_Or_Package (Ent);
1021
1022 -- Since we are reaching through renamings in Alfa mode, we may
1023 -- end up with standard constants. Ignore those.
1024
1025 if Sloc (Ent_Scope) <= Standard_Location
1026 or else Def <= Standard_Location
1027 then
1028 return;
1029 end if;
1030
1031 Add_Entry
1032 ((Ent => Ent,
1033 Loc => Ref,
1034 Typ => Actual_Typ,
1035 Eun => Get_Code_Unit (Def),
1036 Lun => Get_Code_Unit (Ref),
1037 Ref_Scope => Ref_Scope,
1038 Ent_Scope => Ent_Scope),
1039 Ent_Scope_File => Get_Code_Unit (Ent));
1040
1041 else
1042 Ref := Original_Location (Sloc (Nod));
1043 Def := Original_Location (Sloc (Ent));
1044
1045 Add_Entry
1046 ((Ent => Ent,
1047 Loc => Ref,
1048 Typ => Actual_Typ,
1049 Eun => Get_Source_Unit (Def),
1050 Lun => Get_Source_Unit (Ref),
1051 Ref_Scope => Empty,
1052 Ent_Scope => Empty),
1053 Ent_Scope_File => No_Unit);
1054 end if;
1055 end if;
1056 end Generate_Reference;
1057
1058 -----------------------------------
1059 -- Generate_Reference_To_Formals --
1060 -----------------------------------
1061
1062 procedure Generate_Reference_To_Formals (E : Entity_Id) is
1063 Formal : Entity_Id;
1064
1065 begin
1066 if Is_Generic_Subprogram (E) then
1067 Formal := First_Entity (E);
1068
1069 while Present (Formal)
1070 and then not Is_Formal (Formal)
1071 loop
1072 Next_Entity (Formal);
1073 end loop;
1074
1075 else
1076 Formal := First_Formal (E);
1077 end if;
1078
1079 while Present (Formal) loop
1080 if Ekind (Formal) = E_In_Parameter then
1081
1082 if Nkind (Parameter_Type (Parent (Formal)))
1083 = N_Access_Definition
1084 then
1085 Generate_Reference (E, Formal, '^', False);
1086 else
1087 Generate_Reference (E, Formal, '>', False);
1088 end if;
1089
1090 elsif Ekind (Formal) = E_In_Out_Parameter then
1091 Generate_Reference (E, Formal, '=', False);
1092
1093 else
1094 Generate_Reference (E, Formal, '<', False);
1095 end if;
1096
1097 Next_Formal (Formal);
1098 end loop;
1099 end Generate_Reference_To_Formals;
1100
1101 -------------------------------------------
1102 -- Generate_Reference_To_Generic_Formals --
1103 -------------------------------------------
1104
1105 procedure Generate_Reference_To_Generic_Formals (E : Entity_Id) is
1106 Formal : Entity_Id;
1107
1108 begin
1109 Formal := First_Entity (E);
1110 while Present (Formal) loop
1111 if Comes_From_Source (Formal) then
1112 Generate_Reference (E, Formal, 'z', False);
1113 end if;
1114
1115 Next_Entity (Formal);
1116 end loop;
1117 end Generate_Reference_To_Generic_Formals;
1118
1119 -------------
1120 -- Get_Key --
1121 -------------
1122
1123 function Get_Key (E : Xref_Entry_Number) return Xref_Entry_Number is
1124 begin
1125 return E;
1126 end Get_Key;
1127
1128 ----------
1129 -- Hash --
1130 ----------
1131
1132 function Hash (F : Xref_Entry_Number) return Header_Num is
1133 -- It is unlikely to have two references to the same entity at the same
1134 -- source location, so the hash function depends only on the Ent and Loc
1135 -- fields.
1136
1137 XE : Xref_Entry renames Xrefs.Table (F);
1138 type M is mod 2**32;
1139
1140 H : constant M := M (XE.Key.Ent) + 2 ** 7 * M (abs XE.Key.Loc);
1141 -- It would be more natural to write:
1142 --
1143 -- H : constant M := M'Mod (XE.Key.Ent) + 2**7 * M'Mod (XE.Key.Loc);
1144 --
1145 -- But we can't use M'Mod, because it prevents bootstrapping with older
1146 -- compilers. Loc can be negative, so we do "abs" before converting.
1147 -- One day this can be cleaned up ???
1148
1149 begin
1150 return Header_Num (H mod Num_Buckets);
1151 end Hash;
1152
1153 -----------------
1154 -- HT_Set_Next --
1155 -----------------
1156
1157 procedure HT_Set_Next (E : Xref_Entry_Number; Next : Xref_Entry_Number) is
1158 begin
1159 Xrefs.Table (E).HTable_Next := Next;
1160 end HT_Set_Next;
1161
1162 -------------
1163 -- HT_Next --
1164 -------------
1165
1166 function HT_Next (E : Xref_Entry_Number) return Xref_Entry_Number is
1167 begin
1168 return Xrefs.Table (E).HTable_Next;
1169 end HT_Next;
1170
1171 ----------------
1172 -- Initialize --
1173 ----------------
1174
1175 procedure Initialize is
1176 begin
1177 Xrefs.Init;
1178 end Initialize;
1179
1180 --------
1181 -- Lt --
1182 --------
1183
1184 function Lt (T1, T2 : Xref_Entry) return Boolean is
1185 begin
1186 -- First test: if entity is in different unit, sort by unit
1187
1188 if T1.Key.Eun /= T2.Key.Eun then
1189 return Dependency_Num (T1.Key.Eun) < Dependency_Num (T2.Key.Eun);
1190
1191 -- Second test: within same unit, sort by entity Sloc
1192
1193 elsif T1.Def /= T2.Def then
1194 return T1.Def < T2.Def;
1195
1196 -- Third test: sort definitions ahead of references
1197
1198 elsif T1.Key.Loc = No_Location then
1199 return True;
1200
1201 elsif T2.Key.Loc = No_Location then
1202 return False;
1203
1204 -- Fourth test: for same entity, sort by reference location unit
1205
1206 elsif T1.Key.Lun /= T2.Key.Lun then
1207 return Dependency_Num (T1.Key.Lun) < Dependency_Num (T2.Key.Lun);
1208
1209 -- Fifth test: order of location within referencing unit
1210
1211 elsif T1.Key.Loc /= T2.Key.Loc then
1212 return T1.Key.Loc < T2.Key.Loc;
1213
1214 -- Finally, for two locations at the same address, we prefer
1215 -- the one that does NOT have the type 'r' so that a modification
1216 -- or extension takes preference, when there are more than one
1217 -- reference at the same location. As a result, in the case of
1218 -- entities that are in-out actuals, the read reference follows
1219 -- the modify reference.
1220
1221 else
1222 return T2.Key.Typ = 'r';
1223 end if;
1224 end Lt;
1225
1226 -----------------------
1227 -- Output_References --
1228 -----------------------
1229
1230 procedure Output_References is
1231
1232 procedure Get_Type_Reference
1233 (Ent : Entity_Id;
1234 Tref : out Entity_Id;
1235 Left : out Character;
1236 Right : out Character);
1237 -- Given an Entity_Id Ent, determines whether a type reference is
1238 -- required. If so, Tref is set to the entity for the type reference
1239 -- and Left and Right are set to the left/right brackets to be output
1240 -- for the reference. If no type reference is required, then Tref is
1241 -- set to Empty, and Left/Right are set to space.
1242
1243 procedure Output_Import_Export_Info (Ent : Entity_Id);
1244 -- Output language and external name information for an interfaced
1245 -- entity, using the format <language, external_name>.
1246
1247 ------------------------
1248 -- Get_Type_Reference --
1249 ------------------------
1250
1251 procedure Get_Type_Reference
1252 (Ent : Entity_Id;
1253 Tref : out Entity_Id;
1254 Left : out Character;
1255 Right : out Character)
1256 is
1257 Sav : Entity_Id;
1258
1259 begin
1260 -- See if we have a type reference
1261
1262 Tref := Ent;
1263 Left := '{';
1264 Right := '}';
1265
1266 loop
1267 Sav := Tref;
1268
1269 -- Processing for types
1270
1271 if Is_Type (Tref) then
1272
1273 -- Case of base type
1274
1275 if Base_Type (Tref) = Tref then
1276
1277 -- If derived, then get first subtype
1278
1279 if Tref /= Etype (Tref) then
1280 Tref := First_Subtype (Etype (Tref));
1281
1282 -- Set brackets for derived type, but don't override
1283 -- pointer case since the fact that something is a
1284 -- pointer is more important.
1285
1286 if Left /= '(' then
1287 Left := '<';
1288 Right := '>';
1289 end if;
1290
1291 -- If non-derived ptr, get directly designated type.
1292 -- If the type has a full view, all references are on the
1293 -- partial view, that is seen first.
1294
1295 elsif Is_Access_Type (Tref) then
1296 Tref := Directly_Designated_Type (Tref);
1297 Left := '(';
1298 Right := ')';
1299
1300 elsif Is_Private_Type (Tref)
1301 and then Present (Full_View (Tref))
1302 then
1303 if Is_Access_Type (Full_View (Tref)) then
1304 Tref := Directly_Designated_Type (Full_View (Tref));
1305 Left := '(';
1306 Right := ')';
1307
1308 -- If the full view is an array type, we also retrieve
1309 -- the corresponding component type, because the ali
1310 -- entry already indicates that this is an array.
1311
1312 elsif Is_Array_Type (Full_View (Tref)) then
1313 Tref := Component_Type (Full_View (Tref));
1314 Left := '(';
1315 Right := ')';
1316 end if;
1317
1318 -- If non-derived array, get component type. Skip component
1319 -- type for case of String or Wide_String, saves worthwhile
1320 -- space.
1321
1322 elsif Is_Array_Type (Tref)
1323 and then Tref /= Standard_String
1324 and then Tref /= Standard_Wide_String
1325 then
1326 Tref := Component_Type (Tref);
1327 Left := '(';
1328 Right := ')';
1329
1330 -- For other non-derived base types, nothing
1331
1332 else
1333 exit;
1334 end if;
1335
1336 -- For a subtype, go to ancestor subtype
1337
1338 else
1339 Tref := Ancestor_Subtype (Tref);
1340
1341 -- If no ancestor subtype, go to base type
1342
1343 if No (Tref) then
1344 Tref := Base_Type (Sav);
1345 end if;
1346 end if;
1347
1348 -- For objects, functions, enum literals, just get type from
1349 -- Etype field.
1350
1351 elsif Is_Object (Tref)
1352 or else Ekind (Tref) = E_Enumeration_Literal
1353 or else Ekind (Tref) = E_Function
1354 or else Ekind (Tref) = E_Operator
1355 then
1356 Tref := Etype (Tref);
1357
1358 -- For anything else, exit
1359
1360 else
1361 exit;
1362 end if;
1363
1364 -- Exit if no type reference, or we are stuck in some loop trying
1365 -- to find the type reference, or if the type is standard void
1366 -- type (the latter is an implementation artifact that should not
1367 -- show up in the generated cross-references).
1368
1369 exit when No (Tref)
1370 or else Tref = Sav
1371 or else Tref = Standard_Void_Type;
1372
1373 -- If we have a usable type reference, return, otherwise keep
1374 -- looking for something useful (we are looking for something
1375 -- that either comes from source or standard)
1376
1377 if Sloc (Tref) = Standard_Location
1378 or else Comes_From_Source (Tref)
1379 then
1380 -- If the reference is a subtype created for a generic actual,
1381 -- go actual directly, the inner subtype is not user visible.
1382
1383 if Nkind (Parent (Tref)) = N_Subtype_Declaration
1384 and then not Comes_From_Source (Parent (Tref))
1385 and then
1386 (Is_Wrapper_Package (Scope (Tref))
1387 or else Is_Generic_Instance (Scope (Tref)))
1388 then
1389 Tref := First_Subtype (Base_Type (Tref));
1390 end if;
1391
1392 return;
1393 end if;
1394 end loop;
1395
1396 -- If we fall through the loop, no type reference
1397
1398 Tref := Empty;
1399 Left := ' ';
1400 Right := ' ';
1401 end Get_Type_Reference;
1402
1403 -------------------------------
1404 -- Output_Import_Export_Info --
1405 -------------------------------
1406
1407 procedure Output_Import_Export_Info (Ent : Entity_Id) is
1408 Language_Name : Name_Id;
1409 Conv : constant Convention_Id := Convention (Ent);
1410
1411 begin
1412 -- Generate language name from convention
1413
1414 if Conv = Convention_C then
1415 Language_Name := Name_C;
1416
1417 elsif Conv = Convention_CPP then
1418 Language_Name := Name_CPP;
1419
1420 elsif Conv = Convention_Ada then
1421 Language_Name := Name_Ada;
1422
1423 else
1424 -- For the moment we ignore all other cases ???
1425
1426 return;
1427 end if;
1428
1429 Write_Info_Char ('<');
1430 Get_Unqualified_Name_String (Language_Name);
1431
1432 for J in 1 .. Name_Len loop
1433 Write_Info_Char (Name_Buffer (J));
1434 end loop;
1435
1436 if Present (Interface_Name (Ent)) then
1437 Write_Info_Char (',');
1438 String_To_Name_Buffer (Strval (Interface_Name (Ent)));
1439
1440 for J in 1 .. Name_Len loop
1441 Write_Info_Char (Name_Buffer (J));
1442 end loop;
1443 end if;
1444
1445 Write_Info_Char ('>');
1446 end Output_Import_Export_Info;
1447
1448 -- Start of processing for Output_References
1449
1450 begin
1451 -- First we add references to the primitive operations of tagged types
1452 -- declared in the main unit.
1453
1454 Handle_Prim_Ops : declare
1455 Ent : Entity_Id;
1456
1457 begin
1458 for J in 1 .. Xrefs.Last loop
1459 Ent := Xrefs.Table (J).Key.Ent;
1460
1461 if Is_Type (Ent)
1462 and then Is_Tagged_Type (Ent)
1463 and then Is_Base_Type (Ent)
1464 and then In_Extended_Main_Source_Unit (Ent)
1465 then
1466 Generate_Prim_Op_References (Ent);
1467 end if;
1468 end loop;
1469 end Handle_Prim_Ops;
1470
1471 -- Before we go ahead and output the references we have a problem
1472 -- that needs dealing with. So far we have captured things that are
1473 -- definitely referenced by the main unit, or defined in the main
1474 -- unit. That's because we don't want to clutter up the ali file
1475 -- for this unit with definition lines for entities in other units
1476 -- that are not referenced.
1477
1478 -- But there is a glitch. We may reference an entity in another unit,
1479 -- and it may have a type reference to an entity that is not directly
1480 -- referenced in the main unit, which may mean that there is no xref
1481 -- entry for this entity yet in the list of references.
1482
1483 -- If we don't do something about this, we will end with an orphan type
1484 -- reference, i.e. it will point to an entity that does not appear
1485 -- within the generated references in the ali file. That is not good for
1486 -- tools using the xref information.
1487
1488 -- To fix this, we go through the references adding definition entries
1489 -- for any unreferenced entities that can be referenced in a type
1490 -- reference. There is a recursion problem here, and that is dealt with
1491 -- by making sure that this traversal also traverses any entries that
1492 -- get added by the traversal.
1493
1494 Handle_Orphan_Type_References : declare
1495 J : Nat;
1496 Tref : Entity_Id;
1497 Ent : Entity_Id;
1498
1499 L, R : Character;
1500 pragma Warnings (Off, L);
1501 pragma Warnings (Off, R);
1502
1503 procedure New_Entry (E : Entity_Id);
1504 -- Make an additional entry into the Xref table for a type entity
1505 -- that is related to the current entity (parent, type ancestor,
1506 -- progenitor, etc.).
1507
1508 ----------------
1509 -- New_Entry --
1510 ----------------
1511
1512 procedure New_Entry (E : Entity_Id) is
1513 begin
1514 pragma Assert (Present (E));
1515
1516 if not Has_Xref_Entry (Implementation_Base_Type (E))
1517 and then Sloc (E) > No_Location
1518 then
1519 Add_Entry
1520 ((Ent => E,
1521 Loc => No_Location,
1522 Typ => Character'First,
1523 Eun => Get_Source_Unit (Original_Location (Sloc (E))),
1524 Lun => No_Unit,
1525 Ref_Scope => Empty,
1526 Ent_Scope => Empty),
1527 Ent_Scope_File => No_Unit);
1528 end if;
1529 end New_Entry;
1530
1531 -- Start of processing for Handle_Orphan_Type_References
1532
1533 begin
1534 -- Note that this is not a for loop for a very good reason. The
1535 -- processing of items in the table can add new items to the table,
1536 -- and they must be processed as well.
1537
1538 J := 1;
1539 while J <= Xrefs.Last loop
1540 Ent := Xrefs.Table (J).Key.Ent;
1541 Get_Type_Reference (Ent, Tref, L, R);
1542
1543 if Present (Tref)
1544 and then not Has_Xref_Entry (Tref)
1545 and then Sloc (Tref) > No_Location
1546 then
1547 New_Entry (Tref);
1548
1549 if Is_Record_Type (Ent)
1550 and then Present (Interfaces (Ent))
1551 then
1552 -- Add an entry for each one of the given interfaces
1553 -- implemented by type Ent.
1554
1555 declare
1556 Elmt : Elmt_Id := First_Elmt (Interfaces (Ent));
1557 begin
1558 while Present (Elmt) loop
1559 New_Entry (Node (Elmt));
1560 Next_Elmt (Elmt);
1561 end loop;
1562 end;
1563 end if;
1564 end if;
1565
1566 -- Collect inherited primitive operations that may be declared in
1567 -- another unit and have no visible reference in the current one.
1568
1569 if Is_Type (Ent)
1570 and then Is_Tagged_Type (Ent)
1571 and then Is_Derived_Type (Ent)
1572 and then Is_Base_Type (Ent)
1573 and then In_Extended_Main_Source_Unit (Ent)
1574 then
1575 declare
1576 Op_List : constant Elist_Id := Primitive_Operations (Ent);
1577 Op : Elmt_Id;
1578 Prim : Entity_Id;
1579
1580 function Parent_Op (E : Entity_Id) return Entity_Id;
1581 -- Find original operation, which may be inherited through
1582 -- several derivations.
1583
1584 function Parent_Op (E : Entity_Id) return Entity_Id is
1585 Orig_Op : constant Entity_Id := Alias (E);
1586
1587 begin
1588 if No (Orig_Op) then
1589 return Empty;
1590
1591 elsif not Comes_From_Source (E)
1592 and then not Has_Xref_Entry (Orig_Op)
1593 and then Comes_From_Source (Orig_Op)
1594 then
1595 return Orig_Op;
1596 else
1597 return Parent_Op (Orig_Op);
1598 end if;
1599 end Parent_Op;
1600
1601 begin
1602 Op := First_Elmt (Op_List);
1603 while Present (Op) loop
1604 Prim := Parent_Op (Node (Op));
1605
1606 if Present (Prim) then
1607 Add_Entry
1608 ((Ent => Prim,
1609 Loc => No_Location,
1610 Typ => Character'First,
1611 Eun => Get_Source_Unit (Sloc (Prim)),
1612 Lun => No_Unit,
1613 Ref_Scope => Empty,
1614 Ent_Scope => Empty),
1615 Ent_Scope_File => No_Unit);
1616 end if;
1617
1618 Next_Elmt (Op);
1619 end loop;
1620 end;
1621 end if;
1622
1623 J := J + 1;
1624 end loop;
1625 end Handle_Orphan_Type_References;
1626
1627 -- Now we have all the references, including those for any embedded
1628 -- type references, so we can sort them, and output them.
1629
1630 Output_Refs : declare
1631
1632 Nrefs : constant Nat := Xrefs.Last;
1633 -- Number of references in table
1634
1635 Rnums : array (0 .. Nrefs) of Nat;
1636 -- This array contains numbers of references in the Xrefs table.
1637 -- This list is sorted in output order. The extra 0'th entry is
1638 -- convenient for the call to sort. When we sort the table, we
1639 -- move the entries in Rnums around, but we do not move the
1640 -- original table entries.
1641
1642 Curxu : Unit_Number_Type;
1643 -- Current xref unit
1644
1645 Curru : Unit_Number_Type;
1646 -- Current reference unit for one entity
1647
1648 Curent : Entity_Id;
1649 -- Current entity
1650
1651 Curnam : String (1 .. Name_Buffer'Length);
1652 Curlen : Natural;
1653 -- Simple name and length of current entity
1654
1655 Curdef : Source_Ptr;
1656 -- Original source location for current entity
1657
1658 Crloc : Source_Ptr;
1659 -- Current reference location
1660
1661 Ctyp : Character;
1662 -- Entity type character
1663
1664 Prevt : Character;
1665 -- reference kind of previous reference
1666
1667 Tref : Entity_Id;
1668 -- Type reference
1669
1670 Rref : Node_Id;
1671 -- Renaming reference
1672
1673 Trunit : Unit_Number_Type;
1674 -- Unit number for type reference
1675
1676 function Lt (Op1, Op2 : Natural) return Boolean;
1677 -- Comparison function for Sort call
1678
1679 function Name_Change (X : Entity_Id) return Boolean;
1680 -- Determines if entity X has a different simple name from Curent
1681
1682 procedure Move (From : Natural; To : Natural);
1683 -- Move procedure for Sort call
1684
1685 package Sorting is new GNAT.Heap_Sort_G (Move, Lt);
1686
1687 --------
1688 -- Lt --
1689 --------
1690
1691 function Lt (Op1, Op2 : Natural) return Boolean is
1692 T1 : Xref_Entry renames Xrefs.Table (Rnums (Nat (Op1)));
1693 T2 : Xref_Entry renames Xrefs.Table (Rnums (Nat (Op2)));
1694
1695 begin
1696 return Lt (T1, T2);
1697 end Lt;
1698
1699 ----------
1700 -- Move --
1701 ----------
1702
1703 procedure Move (From : Natural; To : Natural) is
1704 begin
1705 Rnums (Nat (To)) := Rnums (Nat (From));
1706 end Move;
1707
1708 -----------------
1709 -- Name_Change --
1710 -----------------
1711
1712 -- Why a string comparison here??? Why not compare Name_Id values???
1713
1714 function Name_Change (X : Entity_Id) return Boolean is
1715 begin
1716 Get_Unqualified_Name_String (Chars (X));
1717
1718 if Name_Len /= Curlen then
1719 return True;
1720 else
1721 return Name_Buffer (1 .. Curlen) /= Curnam (1 .. Curlen);
1722 end if;
1723 end Name_Change;
1724
1725 -- Start of processing for Output_Refs
1726
1727 begin
1728 -- Capture the definition Sloc values. We delay doing this till now,
1729 -- since at the time the reference or definition is made, private
1730 -- types may be swapped, and the Sloc value may be incorrect. We
1731 -- also set up the pointer vector for the sort.
1732
1733 for J in 1 .. Nrefs loop
1734 Rnums (J) := J;
1735 Xrefs.Table (J).Def :=
1736 Original_Location (Sloc (Xrefs.Table (J).Key.Ent));
1737 end loop;
1738
1739 -- Sort the references
1740
1741 Sorting.Sort (Integer (Nrefs));
1742
1743 -- Initialize loop through references
1744
1745 Curxu := No_Unit;
1746 Curent := Empty;
1747 Curdef := No_Location;
1748 Curru := No_Unit;
1749 Crloc := No_Location;
1750 Prevt := 'm';
1751
1752 -- Loop to output references
1753
1754 for Refno in 1 .. Nrefs loop
1755 Output_One_Ref : declare
1756 Ent : Entity_Id;
1757
1758 XE : Xref_Entry renames Xrefs.Table (Rnums (Refno));
1759 -- The current entry to be accessed
1760
1761 Left : Character;
1762 Right : Character;
1763 -- Used for {} or <> or () for type reference
1764
1765 procedure Check_Type_Reference
1766 (Ent : Entity_Id;
1767 List_Interface : Boolean);
1768 -- Find whether there is a meaningful type reference for
1769 -- Ent, and display it accordingly. If List_Interface is
1770 -- true, then Ent is a progenitor interface of the current
1771 -- type entity being listed. In that case list it as is,
1772 -- without looking for a type reference for it.
1773
1774 procedure Output_Instantiation_Refs (Loc : Source_Ptr);
1775 -- Recursive procedure to output instantiation references for
1776 -- the given source ptr in [file|line[...]] form. No output
1777 -- if the given location is not a generic template reference.
1778
1779 procedure Output_Overridden_Op (Old_E : Entity_Id);
1780 -- For a subprogram that is overriding, display information
1781 -- about the inherited operation that it overrides.
1782
1783 --------------------------
1784 -- Check_Type_Reference --
1785 --------------------------
1786
1787 procedure Check_Type_Reference
1788 (Ent : Entity_Id;
1789 List_Interface : Boolean)
1790 is
1791 begin
1792 if List_Interface then
1793
1794 -- This is a progenitor interface of the type for which
1795 -- xref information is being generated.
1796
1797 Tref := Ent;
1798 Left := '<';
1799 Right := '>';
1800
1801 else
1802 Get_Type_Reference (Ent, Tref, Left, Right);
1803 end if;
1804
1805 if Present (Tref) then
1806
1807 -- Case of standard entity, output name
1808
1809 if Sloc (Tref) = Standard_Location then
1810 Write_Info_Char (Left);
1811 Write_Info_Name (Chars (Tref));
1812 Write_Info_Char (Right);
1813
1814 -- Case of source entity, output location
1815
1816 else
1817 Write_Info_Char (Left);
1818 Trunit := Get_Source_Unit (Sloc (Tref));
1819
1820 if Trunit /= Curxu then
1821 Write_Info_Nat (Dependency_Num (Trunit));
1822 Write_Info_Char ('|');
1823 end if;
1824
1825 Write_Info_Nat
1826 (Int (Get_Logical_Line_Number (Sloc (Tref))));
1827
1828 declare
1829 Ent : Entity_Id;
1830 Ctyp : Character;
1831
1832 begin
1833 Ent := Tref;
1834 Ctyp := Xref_Entity_Letters (Ekind (Ent));
1835
1836 if Ctyp = '+'
1837 and then Present (Full_View (Ent))
1838 then
1839 Ent := Underlying_Type (Ent);
1840
1841 if Present (Ent) then
1842 Ctyp := Xref_Entity_Letters (Ekind (Ent));
1843 end if;
1844 end if;
1845
1846 Write_Info_Char (Ctyp);
1847 end;
1848
1849 Write_Info_Nat
1850 (Int (Get_Column_Number (Sloc (Tref))));
1851
1852 -- If the type comes from an instantiation, add the
1853 -- corresponding info.
1854
1855 Output_Instantiation_Refs (Sloc (Tref));
1856 Write_Info_Char (Right);
1857 end if;
1858 end if;
1859 end Check_Type_Reference;
1860
1861 -------------------------------
1862 -- Output_Instantiation_Refs --
1863 -------------------------------
1864
1865 procedure Output_Instantiation_Refs (Loc : Source_Ptr) is
1866 Iloc : constant Source_Ptr := Instantiation_Location (Loc);
1867 Lun : Unit_Number_Type;
1868 Cu : constant Unit_Number_Type := Curru;
1869
1870 begin
1871 -- Nothing to do if this is not an instantiation
1872
1873 if Iloc = No_Location then
1874 return;
1875 end if;
1876
1877 -- Output instantiation reference
1878
1879 Write_Info_Char ('[');
1880 Lun := Get_Source_Unit (Iloc);
1881
1882 if Lun /= Curru then
1883 Curru := Lun;
1884 Write_Info_Nat (Dependency_Num (Curru));
1885 Write_Info_Char ('|');
1886 end if;
1887
1888 Write_Info_Nat (Int (Get_Logical_Line_Number (Iloc)));
1889
1890 -- Recursive call to get nested instantiations
1891
1892 Output_Instantiation_Refs (Iloc);
1893
1894 -- Output final ] after call to get proper nesting
1895
1896 Write_Info_Char (']');
1897 Curru := Cu;
1898 return;
1899 end Output_Instantiation_Refs;
1900
1901 --------------------------
1902 -- Output_Overridden_Op --
1903 --------------------------
1904
1905 procedure Output_Overridden_Op (Old_E : Entity_Id) is
1906 Op : Entity_Id;
1907
1908 begin
1909 -- The overridden operation has an implicit declaration
1910 -- at the point of derivation. What we want to display
1911 -- is the original operation, which has the actual body
1912 -- (or abstract declaration) that is being overridden.
1913 -- The overridden operation is not always set, e.g. when
1914 -- it is a predefined operator.
1915
1916 if No (Old_E) then
1917 return;
1918
1919 -- Follow alias chain if one is present
1920
1921 elsif Present (Alias (Old_E)) then
1922
1923 -- The subprogram may have been implicitly inherited
1924 -- through several levels of derivation, so find the
1925 -- ultimate (source) ancestor.
1926
1927 Op := Ultimate_Alias (Old_E);
1928
1929 -- Normal case of no alias present. We omit generated
1930 -- primitives like tagged equality, that have no source
1931 -- representation.
1932
1933 else
1934 Op := Old_E;
1935 end if;
1936
1937 if Present (Op)
1938 and then Sloc (Op) /= Standard_Location
1939 and then Comes_From_Source (Op)
1940 then
1941 declare
1942 Loc : constant Source_Ptr := Sloc (Op);
1943 Par_Unit : constant Unit_Number_Type :=
1944 Get_Source_Unit (Loc);
1945
1946 begin
1947 Write_Info_Char ('<');
1948
1949 if Par_Unit /= Curxu then
1950 Write_Info_Nat (Dependency_Num (Par_Unit));
1951 Write_Info_Char ('|');
1952 end if;
1953
1954 Write_Info_Nat (Int (Get_Logical_Line_Number (Loc)));
1955 Write_Info_Char ('p');
1956 Write_Info_Nat (Int (Get_Column_Number (Loc)));
1957 Write_Info_Char ('>');
1958 end;
1959 end if;
1960 end Output_Overridden_Op;
1961
1962 -- Start of processing for Output_One_Ref
1963
1964 begin
1965 Ent := XE.Key.Ent;
1966 Ctyp := Xref_Entity_Letters (Ekind (Ent));
1967
1968 -- Skip reference if it is the only reference to an entity,
1969 -- and it is an END line reference, and the entity is not in
1970 -- the current extended source. This prevents junk entries
1971 -- consisting only of packages with END lines, where no
1972 -- entity from the package is actually referenced.
1973
1974 if XE.Key.Typ = 'e'
1975 and then Ent /= Curent
1976 and then (Refno = Nrefs
1977 or else
1978 Ent /= Xrefs.Table (Rnums (Refno + 1)).Key.Ent)
1979 and then not In_Extended_Main_Source_Unit (Ent)
1980 then
1981 goto Continue;
1982 end if;
1983
1984 -- For private type, get full view type
1985
1986 if Ctyp = '+'
1987 and then Present (Full_View (XE.Key.Ent))
1988 then
1989 Ent := Underlying_Type (Ent);
1990
1991 if Present (Ent) then
1992 Ctyp := Xref_Entity_Letters (Ekind (Ent));
1993 end if;
1994 end if;
1995
1996 -- Special exception for Boolean
1997
1998 if Ctyp = 'E' and then Is_Boolean_Type (Ent) then
1999 Ctyp := 'B';
2000 end if;
2001
2002 -- For variable reference, get corresponding type
2003
2004 if Ctyp = '*' then
2005 Ent := Etype (XE.Key.Ent);
2006 Ctyp := Fold_Lower (Xref_Entity_Letters (Ekind (Ent)));
2007
2008 -- If variable is private type, get full view type
2009
2010 if Ctyp = '+'
2011 and then Present (Full_View (Etype (XE.Key.Ent)))
2012 then
2013 Ent := Underlying_Type (Etype (XE.Key.Ent));
2014
2015 if Present (Ent) then
2016 Ctyp := Fold_Lower (Xref_Entity_Letters (Ekind (Ent)));
2017 end if;
2018
2019 elsif Is_Generic_Type (Ent) then
2020
2021 -- If the type of the entity is a generic private type,
2022 -- there is no usable full view, so retain the indication
2023 -- that this is an object.
2024
2025 Ctyp := '*';
2026 end if;
2027
2028 -- Special handling for access parameters and objects of
2029 -- an anonymous access type.
2030
2031 if Ekind_In (Etype (XE.Key.Ent),
2032 E_Anonymous_Access_Type,
2033 E_Anonymous_Access_Subprogram_Type,
2034 E_Anonymous_Access_Protected_Subprogram_Type)
2035 then
2036 if Is_Formal (XE.Key.Ent)
2037 or else Ekind_In (XE.Key.Ent, E_Variable, E_Constant)
2038 then
2039 Ctyp := 'p';
2040 end if;
2041
2042 -- Special handling for Boolean
2043
2044 elsif Ctyp = 'e' and then Is_Boolean_Type (Ent) then
2045 Ctyp := 'b';
2046 end if;
2047 end if;
2048
2049 -- Special handling for abstract types and operations
2050
2051 if Is_Overloadable (XE.Key.Ent)
2052 and then Is_Abstract_Subprogram (XE.Key.Ent)
2053 then
2054 if Ctyp = 'U' then
2055 Ctyp := 'x'; -- Abstract procedure
2056
2057 elsif Ctyp = 'V' then
2058 Ctyp := 'y'; -- Abstract function
2059 end if;
2060
2061 elsif Is_Type (XE.Key.Ent)
2062 and then Is_Abstract_Type (XE.Key.Ent)
2063 then
2064 if Is_Interface (XE.Key.Ent) then
2065 Ctyp := 'h';
2066
2067 elsif Ctyp = 'R' then
2068 Ctyp := 'H'; -- Abstract type
2069 end if;
2070 end if;
2071
2072 -- Only output reference if interesting type of entity
2073
2074 if Ctyp = ' '
2075
2076 -- Suppress references to object definitions, used for local
2077 -- references.
2078
2079 or else XE.Key.Typ = 'D'
2080 or else XE.Key.Typ = 'I'
2081
2082 -- Suppress self references, except for bodies that act as
2083 -- specs.
2084
2085 or else (XE.Key.Loc = XE.Def
2086 and then
2087 (XE.Key.Typ /= 'b'
2088 or else not Is_Subprogram (XE.Key.Ent)))
2089
2090 -- Also suppress definitions of body formals (we only
2091 -- treat these as references, and the references were
2092 -- separately recorded).
2093
2094 or else (Is_Formal (XE.Key.Ent)
2095 and then Present (Spec_Entity (XE.Key.Ent)))
2096 then
2097 null;
2098
2099 else
2100 -- Start new Xref section if new xref unit
2101
2102 if XE.Key.Eun /= Curxu then
2103 if Write_Info_Col > 1 then
2104 Write_Info_EOL;
2105 end if;
2106
2107 Curxu := XE.Key.Eun;
2108
2109 Write_Info_Initiate ('X');
2110 Write_Info_Char (' ');
2111 Write_Info_Nat (Dependency_Num (XE.Key.Eun));
2112 Write_Info_Char (' ');
2113 Write_Info_Name
2114 (Reference_Name (Source_Index (XE.Key.Eun)));
2115 end if;
2116
2117 -- Start new Entity line if new entity. Note that we
2118 -- consider two entities the same if they have the same
2119 -- name and source location. This causes entities in
2120 -- instantiations to be treated as though they referred
2121 -- to the template.
2122
2123 if No (Curent)
2124 or else
2125 (XE.Key.Ent /= Curent
2126 and then
2127 (Name_Change (XE.Key.Ent) or else XE.Def /= Curdef))
2128 then
2129 Curent := XE.Key.Ent;
2130 Curdef := XE.Def;
2131
2132 Get_Unqualified_Name_String (Chars (XE.Key.Ent));
2133 Curlen := Name_Len;
2134 Curnam (1 .. Curlen) := Name_Buffer (1 .. Curlen);
2135
2136 if Write_Info_Col > 1 then
2137 Write_Info_EOL;
2138 end if;
2139
2140 -- Write column number information
2141
2142 Write_Info_Nat (Int (Get_Logical_Line_Number (XE.Def)));
2143 Write_Info_Char (Ctyp);
2144 Write_Info_Nat (Int (Get_Column_Number (XE.Def)));
2145
2146 -- Write level information
2147
2148 Write_Level_Info : declare
2149 function Is_Visible_Generic_Entity
2150 (E : Entity_Id) return Boolean;
2151 -- Check whether E is declared in the visible part
2152 -- of a generic package. For source navigation
2153 -- purposes, treat this as a visible entity.
2154
2155 function Is_Private_Record_Component
2156 (E : Entity_Id) return Boolean;
2157 -- Check whether E is a non-inherited component of a
2158 -- private extension. Even if the enclosing record is
2159 -- public, we want to treat the component as private
2160 -- for navigation purposes.
2161
2162 ---------------------------------
2163 -- Is_Private_Record_Component --
2164 ---------------------------------
2165
2166 function Is_Private_Record_Component
2167 (E : Entity_Id) return Boolean
2168 is
2169 S : constant Entity_Id := Scope (E);
2170 begin
2171 return
2172 Ekind (E) = E_Component
2173 and then Nkind (Declaration_Node (S)) =
2174 N_Private_Extension_Declaration
2175 and then Original_Record_Component (E) = E;
2176 end Is_Private_Record_Component;
2177
2178 -------------------------------
2179 -- Is_Visible_Generic_Entity --
2180 -------------------------------
2181
2182 function Is_Visible_Generic_Entity
2183 (E : Entity_Id) return Boolean
2184 is
2185 Par : Node_Id;
2186
2187 begin
2188 -- The Present check here is an error defense
2189
2190 if Present (Scope (E))
2191 and then Ekind (Scope (E)) /= E_Generic_Package
2192 then
2193 return False;
2194 end if;
2195
2196 Par := Parent (E);
2197 while Present (Par) loop
2198 if
2199 Nkind (Par) = N_Generic_Package_Declaration
2200 then
2201 -- Entity is a generic formal
2202
2203 return False;
2204
2205 elsif
2206 Nkind (Parent (Par)) = N_Package_Specification
2207 then
2208 return
2209 Is_List_Member (Par)
2210 and then List_Containing (Par) =
2211 Visible_Declarations (Parent (Par));
2212 else
2213 Par := Parent (Par);
2214 end if;
2215 end loop;
2216
2217 return False;
2218 end Is_Visible_Generic_Entity;
2219
2220 -- Start of processing for Write_Level_Info
2221
2222 begin
2223 if Is_Hidden (Curent)
2224 or else Is_Private_Record_Component (Curent)
2225 then
2226 Write_Info_Char (' ');
2227
2228 elsif
2229 Is_Public (Curent)
2230 or else Is_Visible_Generic_Entity (Curent)
2231 then
2232 Write_Info_Char ('*');
2233
2234 else
2235 Write_Info_Char (' ');
2236 end if;
2237 end Write_Level_Info;
2238
2239 -- Output entity name. We use the occurrence from the
2240 -- actual source program at the definition point.
2241
2242 declare
2243 Ent_Name : constant String :=
2244 Exact_Source_Name (Sloc (XE.Key.Ent));
2245 begin
2246 for C in Ent_Name'Range loop
2247 Write_Info_Char (Ent_Name (C));
2248 end loop;
2249 end;
2250
2251 -- See if we have a renaming reference
2252
2253 if Is_Object (XE.Key.Ent)
2254 and then Present (Renamed_Object (XE.Key.Ent))
2255 then
2256 Rref := Renamed_Object (XE.Key.Ent);
2257
2258 elsif Is_Overloadable (XE.Key.Ent)
2259 and then Nkind (Parent (Declaration_Node (XE.Key.Ent)))
2260 = N_Subprogram_Renaming_Declaration
2261 then
2262 Rref := Name (Parent (Declaration_Node (XE.Key.Ent)));
2263
2264 elsif Ekind (XE.Key.Ent) = E_Package
2265 and then Nkind (Declaration_Node (XE.Key.Ent)) =
2266 N_Package_Renaming_Declaration
2267 then
2268 Rref := Name (Declaration_Node (XE.Key.Ent));
2269
2270 else
2271 Rref := Empty;
2272 end if;
2273
2274 if Present (Rref) then
2275 if Nkind (Rref) = N_Expanded_Name then
2276 Rref := Selector_Name (Rref);
2277 end if;
2278
2279 if Nkind (Rref) = N_Identifier
2280 or else Nkind (Rref) = N_Operator_Symbol
2281 then
2282 null;
2283
2284 -- For renamed array components, use the array name
2285 -- for the renamed entity, which reflect the fact that
2286 -- in general the whole array is aliased.
2287
2288 elsif Nkind (Rref) = N_Indexed_Component then
2289 if Nkind (Prefix (Rref)) = N_Identifier then
2290 Rref := Prefix (Rref);
2291 elsif Nkind (Prefix (Rref)) = N_Expanded_Name then
2292 Rref := Selector_Name (Prefix (Rref));
2293 else
2294 Rref := Empty;
2295 end if;
2296
2297 else
2298 Rref := Empty;
2299 end if;
2300 end if;
2301
2302 -- Write out renaming reference if we have one
2303
2304 if Present (Rref) then
2305 Write_Info_Char ('=');
2306 Write_Info_Nat
2307 (Int (Get_Logical_Line_Number (Sloc (Rref))));
2308 Write_Info_Char (':');
2309 Write_Info_Nat
2310 (Int (Get_Column_Number (Sloc (Rref))));
2311 end if;
2312
2313 -- Indicate that the entity is in the unit of the current
2314 -- xref section.
2315
2316 Curru := Curxu;
2317
2318 -- Write out information about generic parent, if entity
2319 -- is an instance.
2320
2321 if Is_Generic_Instance (XE.Key.Ent) then
2322 declare
2323 Gen_Par : constant Entity_Id :=
2324 Generic_Parent
2325 (Specification
2326 (Unit_Declaration_Node
2327 (XE.Key.Ent)));
2328 Loc : constant Source_Ptr := Sloc (Gen_Par);
2329 Gen_U : constant Unit_Number_Type :=
2330 Get_Source_Unit (Loc);
2331
2332 begin
2333 Write_Info_Char ('[');
2334
2335 if Curru /= Gen_U then
2336 Write_Info_Nat (Dependency_Num (Gen_U));
2337 Write_Info_Char ('|');
2338 end if;
2339
2340 Write_Info_Nat
2341 (Int (Get_Logical_Line_Number (Loc)));
2342 Write_Info_Char (']');
2343 end;
2344 end if;
2345
2346 -- See if we have a type reference and if so output
2347
2348 Check_Type_Reference (XE.Key.Ent, False);
2349
2350 -- Additional information for types with progenitors
2351
2352 if Is_Record_Type (XE.Key.Ent)
2353 and then Present (Interfaces (XE.Key.Ent))
2354 then
2355 declare
2356 Elmt : Elmt_Id :=
2357 First_Elmt (Interfaces (XE.Key.Ent));
2358 begin
2359 while Present (Elmt) loop
2360 Check_Type_Reference (Node (Elmt), True);
2361 Next_Elmt (Elmt);
2362 end loop;
2363 end;
2364
2365 -- For array types, list index types as well. (This is
2366 -- not C, indexes have distinct types).
2367
2368 elsif Is_Array_Type (XE.Key.Ent) then
2369 declare
2370 Indx : Node_Id;
2371 begin
2372 Indx := First_Index (XE.Key.Ent);
2373 while Present (Indx) loop
2374 Check_Type_Reference
2375 (First_Subtype (Etype (Indx)), True);
2376 Next_Index (Indx);
2377 end loop;
2378 end;
2379 end if;
2380
2381 -- If the entity is an overriding operation, write info
2382 -- on operation that was overridden.
2383
2384 if Is_Subprogram (XE.Key.Ent)
2385 and then Present (Overridden_Operation (XE.Key.Ent))
2386 then
2387 Output_Overridden_Op
2388 (Overridden_Operation (XE.Key.Ent));
2389 end if;
2390
2391 -- End of processing for entity output
2392
2393 Crloc := No_Location;
2394 end if;
2395
2396 -- Output the reference if it is not as the same location
2397 -- as the previous one, or it is a read-reference that
2398 -- indicates that the entity is an in-out actual in a call.
2399
2400 if XE.Key.Loc /= No_Location
2401 and then
2402 (XE.Key.Loc /= Crloc
2403 or else (Prevt = 'm' and then XE.Key.Typ = 'r'))
2404 then
2405 Crloc := XE.Key.Loc;
2406 Prevt := XE.Key.Typ;
2407
2408 -- Start continuation if line full, else blank
2409
2410 if Write_Info_Col > 72 then
2411 Write_Info_EOL;
2412 Write_Info_Initiate ('.');
2413 end if;
2414
2415 Write_Info_Char (' ');
2416
2417 -- Output file number if changed
2418
2419 if XE.Key.Lun /= Curru then
2420 Curru := XE.Key.Lun;
2421 Write_Info_Nat (Dependency_Num (Curru));
2422 Write_Info_Char ('|');
2423 end if;
2424
2425 Write_Info_Nat
2426 (Int (Get_Logical_Line_Number (XE.Key.Loc)));
2427 Write_Info_Char (XE.Key.Typ);
2428
2429 if Is_Overloadable (XE.Key.Ent)
2430 and then Is_Imported (XE.Key.Ent)
2431 and then XE.Key.Typ = 'b'
2432 then
2433 Output_Import_Export_Info (XE.Key.Ent);
2434 end if;
2435
2436 Write_Info_Nat (Int (Get_Column_Number (XE.Key.Loc)));
2437
2438 Output_Instantiation_Refs (Sloc (XE.Key.Ent));
2439 end if;
2440 end if;
2441 end Output_One_Ref;
2442
2443 <<Continue>>
2444 null;
2445 end loop;
2446
2447 Write_Info_EOL;
2448 end Output_Refs;
2449 end Output_References;
2450
2451 -- Start of elaboration for Lib.Xref
2452
2453 begin
2454 -- Reset is necessary because Elmt_Ptr does not default to Null_Ptr,
2455 -- because it's not an access type.
2456
2457 Xref_Set.Reset;
2458 end Lib.Xref;