1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1999-2007, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 2, 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 COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
22 -- As a special exception, if other files instantiate generics from this --
23 -- unit, or you link this unit with other files to produce an executable, --
24 -- this unit does not by itself cause the resulting executable to be --
25 -- covered by the GNU General Public License. This exception does not --
26 -- however invalidate any other reasons why the executable file might be --
27 -- covered by the GNU Public License. --
29 -- GNAT was originally developed by the GNAT team at New York University. --
30 -- Extensive contributions were provided by Ada Core Technologies Inc. --
32 ------------------------------------------------------------------------------
34 with Alloc; use Alloc;
35 with Atree; use Atree;
36 with Casing; use Casing;
37 with Debug; use Debug;
38 with Einfo; use Einfo;
40 with Namet; use Namet;
42 with Output; use Output;
43 with Sinfo; use Sinfo;
44 with Sinput; use Sinput;
45 with Snames; use Snames;
46 with Stand; use Stand;
47 with Table; use Table;
48 with Uname; use Uname;
49 with Urealp; use Urealp;
51 with Ada.Unchecked_Conversion;
53 package body Repinfo is
56 -- Value for Storage_Unit, we do not want to get this from TTypes, since
57 -- this introduces problematic dependencies in ASIS, and in any case this
58 -- value is assumed to be 8 for the implementation of the DDA.
60 -- This is wrong for AAMP???
62 ---------------------------------------
63 -- Representation of gcc Expressions --
64 ---------------------------------------
66 -- This table is used only if Frontend_Layout_On_Target is False, so gigi
67 -- lays out dynamic size/offset fields using encoded gcc expressions.
69 -- A table internal to this unit is used to hold the values of back
70 -- annotated expressions. This table is written out by -gnatt and read
71 -- back in for ASIS processing.
73 -- Node values are stored as Uint values using the negative of the node
74 -- index in this table. Constants appear as non-negative Uint values.
76 type Exp_Node is record
78 Op1 : Node_Ref_Or_Val;
79 Op2 : Node_Ref_Or_Val;
80 Op3 : Node_Ref_Or_Val;
83 -- The following representation clause ensures that the above record
84 -- has no holes. We do this so that when instances of this record are
85 -- written by Tree_Gen, we do not write uninitialized values to the file.
87 for Exp_Node use record
88 Expr at 0 range 0 .. 31;
89 Op1 at 4 range 0 .. 31;
90 Op2 at 8 range 0 .. 31;
91 Op3 at 12 range 0 .. 31;
94 for Exp_Node'Size use 16 * 8;
95 -- This ensures that we did not leave out any fields
97 package Rep_Table is new Table.Table (
98 Table_Component_Type => Exp_Node,
99 Table_Index_Type => Nat,
100 Table_Low_Bound => 1,
101 Table_Initial => Alloc.Rep_Table_Initial,
102 Table_Increment => Alloc.Rep_Table_Increment,
103 Table_Name => "BE_Rep_Table");
105 --------------------------------------------------------------
106 -- Representation of Front-End Dynamic Size/Offset Entities --
107 --------------------------------------------------------------
109 package Dynamic_SO_Entity_Table is new Table.Table (
110 Table_Component_Type => Entity_Id,
111 Table_Index_Type => Nat,
112 Table_Low_Bound => 1,
113 Table_Initial => Alloc.Rep_Table_Initial,
114 Table_Increment => Alloc.Rep_Table_Increment,
115 Table_Name => "FE_Rep_Table");
117 Unit_Casing : Casing_Type;
118 -- Identifier casing for current unit
120 Need_Blank_Line : Boolean;
121 -- Set True if a blank line is needed before outputting any information for
122 -- the current entity. Set True when a new entity is processed, and false
123 -- when the blank line is output.
125 -----------------------
126 -- Local Subprograms --
127 -----------------------
129 function Back_End_Layout return Boolean;
130 -- Test for layout mode, True = back end, False = front end. This function
131 -- is used rather than checking the configuration parameter because we do
132 -- not want Repinfo to depend on Targparm (for ASIS)
134 procedure Blank_Line;
135 -- Called before outputting anything for an entity. Ensures that
136 -- a blank line precedes the output for a particular entity.
138 procedure List_Entities (Ent : Entity_Id);
139 -- This procedure lists the entities associated with the entity E, starting
140 -- with the First_Entity and using the Next_Entity link. If a nested
141 -- package is found, entities within the package are recursively processed.
143 procedure List_Name (Ent : Entity_Id);
144 -- List name of entity Ent in appropriate case. The name is listed with
145 -- full qualification up to but not including the compilation unit name.
147 procedure List_Array_Info (Ent : Entity_Id);
148 -- List representation info for array type Ent
150 procedure List_Mechanisms (Ent : Entity_Id);
151 -- List mechanism information for parameters of Ent, which is subprogram,
152 -- subprogram type, or an entry or entry family.
154 procedure List_Object_Info (Ent : Entity_Id);
155 -- List representation info for object Ent
157 procedure List_Record_Info (Ent : Entity_Id);
158 -- List representation info for record type Ent
160 procedure List_Type_Info (Ent : Entity_Id);
161 -- List type info for type Ent
163 function Rep_Not_Constant (Val : Node_Ref_Or_Val) return Boolean;
164 -- Returns True if Val represents a variable value, and False if it
165 -- represents a value that is fixed at compile time.
167 procedure Spaces (N : Natural);
168 -- Output given number of spaces
170 procedure Write_Info_Line (S : String);
171 -- Routine to write a line to Repinfo output file. This routine is passed
172 -- as a special output procedure to Output.Set_Special_Output. Note that
173 -- Write_Info_Line is called with an EOL character at the end of each line,
174 -- as per the Output spec, but the internal call to the appropriate routine
175 -- in Osint requires that the end of line sequence be stripped off.
177 procedure Write_Mechanism (M : Mechanism_Type);
178 -- Writes symbolic string for mechanism represented by M
180 procedure Write_Val (Val : Node_Ref_Or_Val; Paren : Boolean := False);
181 -- Given a representation value, write it out. No_Uint values or values
182 -- dependent on discriminants are written as two question marks. If the
183 -- flag Paren is set, then the output is surrounded in parentheses if it is
184 -- other than a simple value.
186 ---------------------
187 -- Back_End_Layout --
188 ---------------------
190 function Back_End_Layout return Boolean is
192 -- We have back end layout if the back end has made any entries in the
193 -- table of GCC expressions, otherwise we have front end layout.
195 return Rep_Table.Last > 0;
202 procedure Blank_Line is
204 if Need_Blank_Line then
206 Need_Blank_Line := False;
210 ------------------------
211 -- Create_Discrim_Ref --
212 ------------------------
214 function Create_Discrim_Ref (Discr : Entity_Id) return Node_Ref is
215 N : constant Uint := Discriminant_Number (Discr);
218 Rep_Table.Increment_Last;
220 Rep_Table.Table (T).Expr := Discrim_Val;
221 Rep_Table.Table (T).Op1 := N;
222 Rep_Table.Table (T).Op2 := No_Uint;
223 Rep_Table.Table (T).Op3 := No_Uint;
224 return UI_From_Int (-T);
225 end Create_Discrim_Ref;
227 ---------------------------
228 -- Create_Dynamic_SO_Ref --
229 ---------------------------
231 function Create_Dynamic_SO_Ref (E : Entity_Id) return Dynamic_SO_Ref is
234 Dynamic_SO_Entity_Table.Increment_Last;
235 T := Dynamic_SO_Entity_Table.Last;
236 Dynamic_SO_Entity_Table.Table (T) := E;
237 return UI_From_Int (-T);
238 end Create_Dynamic_SO_Ref;
246 Op1 : Node_Ref_Or_Val;
247 Op2 : Node_Ref_Or_Val := No_Uint;
248 Op3 : Node_Ref_Or_Val := No_Uint) return Node_Ref
252 Rep_Table.Increment_Last;
254 Rep_Table.Table (T).Expr := Expr;
255 Rep_Table.Table (T).Op1 := Op1;
256 Rep_Table.Table (T).Op2 := Op2;
257 Rep_Table.Table (T).Op3 := Op3;
258 return UI_From_Int (-T);
261 ---------------------------
262 -- Get_Dynamic_SO_Entity --
263 ---------------------------
265 function Get_Dynamic_SO_Entity (U : Dynamic_SO_Ref) return Entity_Id is
267 return Dynamic_SO_Entity_Table.Table (-UI_To_Int (U));
268 end Get_Dynamic_SO_Entity;
270 -----------------------
271 -- Is_Dynamic_SO_Ref --
272 -----------------------
274 function Is_Dynamic_SO_Ref (U : SO_Ref) return Boolean is
277 end Is_Dynamic_SO_Ref;
279 ----------------------
280 -- Is_Static_SO_Ref --
281 ----------------------
283 function Is_Static_SO_Ref (U : SO_Ref) return Boolean is
286 end Is_Static_SO_Ref;
292 procedure lgx (U : Node_Ref_Or_Val) is
294 List_GCC_Expression (U);
298 ----------------------
299 -- List_Array_Info --
300 ----------------------
302 procedure List_Array_Info (Ent : Entity_Id) is
304 List_Type_Info (Ent);
307 Write_Str ("'Component_Size use ");
308 Write_Val (Component_Size (Ent));
316 procedure List_Entities (Ent : Entity_Id) is
320 function Find_Declaration (E : Entity_Id) return Node_Id;
321 -- Utility to retrieve declaration node for entity in the
322 -- case of package bodies and subprograms.
324 ----------------------
325 -- Find_Declaration --
326 ----------------------
328 function Find_Declaration (E : Entity_Id) return Node_Id is
334 and then Nkind (Decl) /= N_Package_Body
335 and then Nkind (Decl) /= N_Subprogram_Declaration
336 and then Nkind (Decl) /= N_Subprogram_Body
338 Decl := Parent (Decl);
342 end Find_Declaration;
344 -- Start of processing for List_Entities
347 -- List entity if we have one, and it is not a renaming declaration.
348 -- For renamings, we don't get proper information, and really it makes
349 -- sense to restrict the output to the renamed entity.
352 and then Nkind (Declaration_Node (Ent)) not in N_Renaming_Declaration
354 -- If entity is a subprogram and we are listing mechanisms,
355 -- then we need to list mechanisms for this entity.
357 if List_Representation_Info_Mechanisms
358 and then (Is_Subprogram (Ent)
359 or else Ekind (Ent) = E_Entry
360 or else Ekind (Ent) = E_Entry_Family)
362 Need_Blank_Line := True;
363 List_Mechanisms (Ent);
366 E := First_Entity (Ent);
367 while Present (E) loop
368 Need_Blank_Line := True;
370 -- We list entities that come from source (excluding private or
371 -- incomplete types or deferred constants, where we will list the
372 -- info for the full view). If debug flag A is set, then all
373 -- entities are listed
375 if (Comes_From_Source (E)
376 and then not Is_Incomplete_Or_Private_Type (E)
377 and then not (Ekind (E) = E_Constant
378 and then Present (Full_View (E))))
379 or else Debug_Flag_AA
385 Ekind (E) = E_Entry_Family
387 Ekind (E) = E_Subprogram_Type
389 if List_Representation_Info_Mechanisms then
393 elsif Is_Record_Type (E) then
394 if List_Representation_Info >= 1 then
395 List_Record_Info (E);
398 elsif Is_Array_Type (E) then
399 if List_Representation_Info >= 1 then
403 elsif Is_Type (E) then
404 if List_Representation_Info >= 2 then
408 elsif Ekind (E) = E_Variable
410 Ekind (E) = E_Constant
412 Ekind (E) = E_Loop_Parameter
416 if List_Representation_Info >= 2 then
417 List_Object_Info (E);
422 -- Recurse into nested package, but not if they are package
423 -- renamings (in particular renamings of the enclosing package,
424 -- as for some Java bindings and for generic instances).
426 if Ekind (E) = E_Package then
427 if No (Renamed_Object (E)) then
431 -- Recurse into bodies
433 elsif Ekind (E) = E_Protected_Type
435 Ekind (E) = E_Task_Type
437 Ekind (E) = E_Subprogram_Body
439 Ekind (E) = E_Package_Body
441 Ekind (E) = E_Task_Body
443 Ekind (E) = E_Protected_Body
447 -- Recurse into blocks
449 elsif Ekind (E) = E_Block then
454 E := Next_Entity (E);
457 -- For a package body, the entities of the visible subprograms are
458 -- declared in the corresponding spec. Iterate over its entities in
459 -- order to handle properly the subprogram bodies. Skip bodies in
460 -- subunits, which are listed independently.
462 if Ekind (Ent) = E_Package_Body
463 and then Present (Corresponding_Spec (Find_Declaration (Ent)))
465 E := First_Entity (Corresponding_Spec (Find_Declaration (Ent)));
467 while Present (E) loop
470 Nkind (Find_Declaration (E)) = N_Subprogram_Declaration
472 Body_E := Corresponding_Body (Find_Declaration (E));
476 Nkind (Parent (Find_Declaration (Body_E))) /= N_Subunit
478 List_Entities (Body_E);
488 -------------------------
489 -- List_GCC_Expression --
490 -------------------------
492 procedure List_GCC_Expression (U : Node_Ref_Or_Val) is
494 procedure Print_Expr (Val : Node_Ref_Or_Val);
495 -- Internal recursive procedure to print expression
501 procedure Print_Expr (Val : Node_Ref_Or_Val) is
504 UI_Write (Val, Decimal);
508 Node : Exp_Node renames Rep_Table.Table (-UI_To_Int (Val));
510 procedure Binop (S : String);
511 -- Output text for binary operator with S being operator name
517 procedure Binop (S : String) is
520 Print_Expr (Node.Op1);
522 Print_Expr (Node.Op2);
526 -- Start of processing for Print_Expr
532 Print_Expr (Node.Op1);
533 Write_Str (" then ");
534 Print_Expr (Node.Op2);
535 Write_Str (" else ");
536 Print_Expr (Node.Op3);
548 when Trunc_Div_Expr =>
551 when Ceil_Div_Expr =>
554 when Floor_Div_Expr =>
557 when Trunc_Mod_Expr =>
560 when Floor_Mod_Expr =>
563 when Ceil_Mod_Expr =>
566 when Exact_Div_Expr =>
571 Print_Expr (Node.Op1);
581 Print_Expr (Node.Op1);
583 when Truth_Andif_Expr =>
586 when Truth_Orif_Expr =>
589 when Truth_And_Expr =>
592 when Truth_Or_Expr =>
595 when Truth_Xor_Expr =>
598 when Truth_Not_Expr =>
600 Print_Expr (Node.Op1);
632 -- Start of processing for List_GCC_Expression
640 end List_GCC_Expression;
642 ---------------------
643 -- List_Mechanisms --
644 ---------------------
646 procedure List_Mechanisms (Ent : Entity_Id) is
655 Write_Str ("function ");
658 Write_Str ("operator ");
661 Write_Str ("procedure ");
663 when E_Subprogram_Type =>
666 when E_Entry | E_Entry_Family =>
667 Write_Str ("entry ");
673 Get_Unqualified_Decoded_Name_String (Chars (Ent));
674 Write_Str (Name_Buffer (1 .. Name_Len));
675 Write_Str (" declared at ");
676 Write_Location (Sloc (Ent));
679 Write_Str (" convention : ");
681 case Convention (Ent) is
682 when Convention_Ada => Write_Line ("Ada");
683 when Convention_Intrinsic => Write_Line ("InLineinsic");
684 when Convention_Entry => Write_Line ("Entry");
685 when Convention_Protected => Write_Line ("Protected");
686 when Convention_Assembler => Write_Line ("Assembler");
687 when Convention_C => Write_Line ("C");
688 when Convention_CIL => Write_Line ("CIL");
689 when Convention_COBOL => Write_Line ("COBOL");
690 when Convention_CPP => Write_Line ("C++");
691 when Convention_Fortran => Write_Line ("Fortran");
692 when Convention_Java => Write_Line ("Java");
693 when Convention_Stdcall => Write_Line ("Stdcall");
694 when Convention_Stubbed => Write_Line ("Stubbed");
697 -- Find max length of formal name
700 Form := First_Formal (Ent);
701 while Present (Form) loop
702 Get_Unqualified_Decoded_Name_String (Chars (Form));
704 if Name_Len > Plen then
711 -- Output formals and mechanisms
713 Form := First_Formal (Ent);
714 while Present (Form) loop
715 Get_Unqualified_Decoded_Name_String (Chars (Form));
717 while Name_Len <= Plen loop
718 Name_Len := Name_Len + 1;
719 Name_Buffer (Name_Len) := ' ';
723 Write_Str (Name_Buffer (1 .. Plen + 1));
724 Write_Str (": passed by ");
726 Write_Mechanism (Mechanism (Form));
731 if Etype (Ent) /= Standard_Void_Type then
732 Write_Str (" returns by ");
733 Write_Mechanism (Mechanism (Ent));
742 procedure List_Name (Ent : Entity_Id) is
744 if not Is_Compilation_Unit (Scope (Ent)) then
745 List_Name (Scope (Ent));
749 Get_Unqualified_Decoded_Name_String (Chars (Ent));
750 Set_Casing (Unit_Casing);
751 Write_Str (Name_Buffer (1 .. Name_Len));
754 ---------------------
755 -- List_Object_Info --
756 ---------------------
758 procedure List_Object_Info (Ent : Entity_Id) is
764 Write_Str ("'Size use ");
765 Write_Val (Esize (Ent));
770 Write_Str ("'Alignment use ");
771 Write_Val (Alignment (Ent));
773 end List_Object_Info;
775 ----------------------
776 -- List_Record_Info --
777 ----------------------
779 procedure List_Record_Info (Ent : Entity_Id) is
784 Max_Name_Length : Natural;
785 Max_Suni_Length : Natural;
789 List_Type_Info (Ent);
793 Write_Line (" use record");
795 -- First loop finds out max line length and max starting position
796 -- length, for the purpose of lining things up nicely.
798 Max_Name_Length := 0;
799 Max_Suni_Length := 0;
801 Comp := First_Component_Or_Discriminant (Ent);
802 while Present (Comp) loop
803 Get_Decoded_Name_String (Chars (Comp));
804 Max_Name_Length := Natural'Max (Max_Name_Length, Name_Len);
806 Cfbit := Component_Bit_Offset (Comp);
808 if Rep_Not_Constant (Cfbit) then
809 UI_Image_Length := 2;
812 -- Complete annotation in case not done
814 Set_Normalized_Position (Comp, Cfbit / SSU);
815 Set_Normalized_First_Bit (Comp, Cfbit mod SSU);
817 Sunit := Cfbit / SSU;
821 -- If the record is not packed, then we know that all fields whose
822 -- position is not specified have a starting normalized bit position
825 if Unknown_Normalized_First_Bit (Comp)
826 and then not Is_Packed (Ent)
828 Set_Normalized_First_Bit (Comp, Uint_0);
832 Natural'Max (Max_Suni_Length, UI_Image_Length);
834 Next_Component_Or_Discriminant (Comp);
837 -- Second loop does actual output based on those values
839 Comp := First_Component_Or_Discriminant (Ent);
840 while Present (Comp) loop
842 Esiz : constant Uint := Esize (Comp);
843 Bofs : constant Uint := Component_Bit_Offset (Comp);
844 Npos : constant Uint := Normalized_Position (Comp);
845 Fbit : constant Uint := Normalized_First_Bit (Comp);
850 Get_Decoded_Name_String (Chars (Comp));
851 Set_Casing (Unit_Casing);
852 Write_Str (Name_Buffer (1 .. Name_Len));
854 for J in 1 .. Max_Name_Length - Name_Len loop
860 if Known_Static_Normalized_Position (Comp) then
862 Spaces (Max_Suni_Length - UI_Image_Length);
863 Write_Str (UI_Image_Buffer (1 .. UI_Image_Length));
865 elsif Known_Component_Bit_Offset (Comp)
866 and then List_Representation_Info = 3
868 Spaces (Max_Suni_Length - 2);
869 Write_Str ("bit offset");
870 Write_Val (Bofs, Paren => True);
871 Write_Str (" size in bits = ");
872 Write_Val (Esiz, Paren => True);
876 elsif Known_Normalized_Position (Comp)
877 and then List_Representation_Info = 3
879 Spaces (Max_Suni_Length - 2);
883 -- For the packed case, we don't know the bit positions if we
884 -- don't know the starting position!
886 if Is_Packed (Ent) then
887 Write_Line ("?? range ? .. ??;");
890 -- Otherwise we can continue
897 Write_Str (" range ");
901 -- Allowing Uint_0 here is a kludge, really this should be a
902 -- fine Esize value but currently it means unknown, except that
903 -- we know after gigi has back annotated that a size of zero is
904 -- real, since otherwise gigi back annotates using No_Uint as
905 -- the value to indicate unknown).
907 if (Esize (Comp) = Uint_0 or else Known_Static_Esize (Comp))
908 and then Known_Static_Normalized_First_Bit (Comp)
910 Lbit := Fbit + Esiz - 1;
918 -- The test for Esize (Comp) not being Uint_0 here is a kludge.
919 -- Officially a value of zero for Esize means unknown, but here
920 -- we use the fact that we know that gigi annotates Esize with
921 -- No_Uint, not Uint_0. Really everyone should use No_Uint???
923 elsif List_Representation_Info < 3
924 or else (Esize (Comp) /= Uint_0 and then Unknown_Esize (Comp))
928 -- List_Representation >= 3 and Known_Esize (Comp)
931 Write_Val (Esiz, Paren => True);
933 -- If in front end layout mode, then dynamic size is stored
934 -- in storage units, so renormalize for output
936 if not Back_End_Layout then
941 -- Add appropriate first bit offset
951 Write_Int (UI_To_Int (Fbit) - 1);
959 Next_Component_Or_Discriminant (Comp);
962 Write_Line ("end record;");
963 end List_Record_Info;
969 procedure List_Rep_Info is
973 if List_Representation_Info /= 0
974 or else List_Representation_Info_Mechanisms
976 for U in Main_Unit .. Last_Unit loop
977 if In_Extended_Main_Source_Unit (Cunit_Entity (U)) then
979 -- Normal case, list to standard output
981 if not List_Representation_Info_To_File then
982 Unit_Casing := Identifier_Casing (Source_Index (U));
984 Write_Str ("Representation information for unit ");
985 Write_Unit_Name (Unit_Name (U));
989 for J in 1 .. Col - 1 loop
994 List_Entities (Cunit_Entity (U));
996 -- List representation information to file
999 Create_Repinfo_File_Access.all
1000 (Get_Name_String (File_Name (Source_Index (U))));
1001 Set_Special_Output (Write_Info_Line'Access);
1002 List_Entities (Cunit_Entity (U));
1003 Set_Special_Output (null);
1004 Close_Repinfo_File_Access.all;
1011 --------------------
1012 -- List_Type_Info --
1013 --------------------
1015 procedure List_Type_Info (Ent : Entity_Id) is
1019 -- Do not list size info for unconstrained arrays, not meaningful
1021 if Is_Array_Type (Ent) and then not Is_Constrained (Ent) then
1025 -- If Esize and RM_Size are the same and known, list as Size. This
1026 -- is a common case, which we may as well list in simple form.
1028 if Esize (Ent) = RM_Size (Ent) then
1031 Write_Str ("'Size use ");
1032 Write_Val (Esize (Ent));
1035 -- For now, temporary case, to be removed when gigi properly back
1036 -- annotates RM_Size, if RM_Size is not set, then list Esize as Size.
1037 -- This avoids odd Object_Size output till we fix things???
1039 elsif Unknown_RM_Size (Ent) then
1042 Write_Str ("'Size use ");
1043 Write_Val (Esize (Ent));
1046 -- Otherwise list size values separately if they are set
1051 Write_Str ("'Object_Size use ");
1052 Write_Val (Esize (Ent));
1055 -- Note on following check: The RM_Size of a discrete type can
1056 -- legitimately be set to zero, so a special check is needed.
1060 Write_Str ("'Value_Size use ");
1061 Write_Val (RM_Size (Ent));
1068 Write_Str ("'Alignment use ");
1069 Write_Val (Alignment (Ent));
1073 ----------------------
1074 -- Rep_Not_Constant --
1075 ----------------------
1077 function Rep_Not_Constant (Val : Node_Ref_Or_Val) return Boolean is
1079 if Val = No_Uint or else Val < 0 then
1084 end Rep_Not_Constant;
1091 (Val : Node_Ref_Or_Val;
1092 D : Discrim_List) return Uint
1094 function B (Val : Boolean) return Uint;
1095 -- Returns Uint_0 for False, Uint_1 for True
1097 function T (Val : Node_Ref_Or_Val) return Boolean;
1098 -- Returns True for 0, False for any non-zero (i.e. True)
1100 function V (Val : Node_Ref_Or_Val) return Uint;
1101 -- Internal recursive routine to evaluate tree
1103 function W (Val : Uint) return Word;
1104 -- Convert Val to Word, assuming Val is always in the Int range. This is
1105 -- a helper function for the evaluation of bitwise expressions like
1106 -- Bit_And_Expr, for which there is no direct support in uintp. Uint
1107 -- values out of the Int range are expected to be seen in such
1108 -- expressions only with overflowing byte sizes around, introducing
1109 -- inherent unreliabilties in computations anyway.
1115 function B (Val : Boolean) return Uint is
1128 function T (Val : Node_Ref_Or_Val) return Boolean is
1141 function V (Val : Node_Ref_Or_Val) return Uint is
1150 Node : Exp_Node renames Rep_Table.Table (-UI_To_Int (Val));
1155 if T (Node.Op1) then
1156 return V (Node.Op2);
1158 return V (Node.Op3);
1162 return V (Node.Op1) + V (Node.Op2);
1165 return V (Node.Op1) - V (Node.Op2);
1168 return V (Node.Op1) * V (Node.Op2);
1170 when Trunc_Div_Expr =>
1171 return V (Node.Op1) / V (Node.Op2);
1173 when Ceil_Div_Expr =>
1176 (V (Node.Op1) / UR_From_Uint (V (Node.Op2)));
1178 when Floor_Div_Expr =>
1181 (V (Node.Op1) / UR_From_Uint (V (Node.Op2)));
1183 when Trunc_Mod_Expr =>
1184 return V (Node.Op1) rem V (Node.Op2);
1186 when Floor_Mod_Expr =>
1187 return V (Node.Op1) mod V (Node.Op2);
1189 when Ceil_Mod_Expr =>
1192 Q := UR_Ceiling (L / UR_From_Uint (R));
1195 when Exact_Div_Expr =>
1196 return V (Node.Op1) / V (Node.Op2);
1199 return -V (Node.Op1);
1202 return UI_Min (V (Node.Op1), V (Node.Op2));
1205 return UI_Max (V (Node.Op1), V (Node.Op2));
1208 return UI_Abs (V (Node.Op1));
1210 when Truth_Andif_Expr =>
1211 return B (T (Node.Op1) and then T (Node.Op2));
1213 when Truth_Orif_Expr =>
1214 return B (T (Node.Op1) or else T (Node.Op2));
1216 when Truth_And_Expr =>
1217 return B (T (Node.Op1) and T (Node.Op2));
1219 when Truth_Or_Expr =>
1220 return B (T (Node.Op1) or T (Node.Op2));
1222 when Truth_Xor_Expr =>
1223 return B (T (Node.Op1) xor T (Node.Op2));
1225 when Truth_Not_Expr =>
1226 return B (not T (Node.Op1));
1228 when Bit_And_Expr =>
1231 return UI_From_Int (Int (W (L) and W (R)));
1234 return B (V (Node.Op1) < V (Node.Op2));
1237 return B (V (Node.Op1) <= V (Node.Op2));
1240 return B (V (Node.Op1) > V (Node.Op2));
1243 return B (V (Node.Op1) >= V (Node.Op2));
1246 return B (V (Node.Op1) = V (Node.Op2));
1249 return B (V (Node.Op1) /= V (Node.Op2));
1253 Sub : constant Int := UI_To_Int (Node.Op1);
1256 pragma Assert (Sub in D'Range);
1269 -- We use an unchecked conversion to map Int values to their Word
1270 -- bitwise equivalent, which we could not achieve with a normal type
1271 -- conversion for negative Ints. We want bitwise equivalents because W
1272 -- is used as a helper for bit operators like Bit_And_Expr, and can be
1273 -- called for negative Ints in the context of aligning expressions like
1274 -- X+Align & -Align.
1276 function W (Val : Uint) return Word is
1277 function To_Word is new Ada.Unchecked_Conversion (Int, Word);
1279 return To_Word (UI_To_Int (Val));
1282 -- Start of processing for Rep_Value
1285 if Val = No_Uint then
1297 procedure Spaces (N : Natural) is
1299 for J in 1 .. N loop
1308 procedure Tree_Read is
1310 Rep_Table.Tree_Read;
1317 procedure Tree_Write is
1319 Rep_Table.Tree_Write;
1322 ---------------------
1323 -- Write_Info_Line --
1324 ---------------------
1326 procedure Write_Info_Line (S : String) is
1328 Write_Repinfo_Line_Access.all (S (S'First .. S'Last - 1));
1329 end Write_Info_Line;
1331 ---------------------
1332 -- Write_Mechanism --
1333 ---------------------
1335 procedure Write_Mechanism (M : Mechanism_Type) is
1339 Write_Str ("default");
1345 Write_Str ("reference");
1348 Write_Str ("descriptor");
1351 Write_Str ("descriptor (UBS)");
1354 Write_Str ("descriptor (UBSB)");
1357 Write_Str ("descriptor (UBA)");
1360 Write_Str ("descriptor (S)");
1363 Write_Str ("descriptor (SB)");
1366 Write_Str ("descriptor (A)");
1369 Write_Str ("descriptor (NCA)");
1372 raise Program_Error;
1374 end Write_Mechanism;
1380 procedure Write_Val (Val : Node_Ref_Or_Val; Paren : Boolean := False) is
1382 if Rep_Not_Constant (Val) then
1383 if List_Representation_Info < 3 or else Val = No_Uint then
1387 if Back_End_Layout then
1392 List_GCC_Expression (Val);
1395 List_GCC_Expression (Val);
1403 Write_Name_Decoded (Chars (Get_Dynamic_SO_Entity (Val)));
1406 Write_Name_Decoded (Chars (Get_Dynamic_SO_Entity (Val)));