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