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
217 (Expr => Discrim_Val,
218 Op1 => Discriminant_Number (Discr));
219 end Create_Discrim_Ref;
221 ---------------------------
222 -- Create_Dynamic_SO_Ref --
223 ---------------------------
225 function Create_Dynamic_SO_Ref (E : Entity_Id) return Dynamic_SO_Ref is
227 Dynamic_SO_Entity_Table.Append (E);
228 return UI_From_Int (-Dynamic_SO_Entity_Table.Last);
229 end Create_Dynamic_SO_Ref;
237 Op1 : Node_Ref_Or_Val;
238 Op2 : Node_Ref_Or_Val := No_Uint;
239 Op3 : Node_Ref_Or_Val := No_Uint) return Node_Ref
247 return UI_From_Int (-Rep_Table.Last);
250 ---------------------------
251 -- Get_Dynamic_SO_Entity --
252 ---------------------------
254 function Get_Dynamic_SO_Entity (U : Dynamic_SO_Ref) return Entity_Id is
256 return Dynamic_SO_Entity_Table.Table (-UI_To_Int (U));
257 end Get_Dynamic_SO_Entity;
259 -----------------------
260 -- Is_Dynamic_SO_Ref --
261 -----------------------
263 function Is_Dynamic_SO_Ref (U : SO_Ref) return Boolean is
266 end Is_Dynamic_SO_Ref;
268 ----------------------
269 -- Is_Static_SO_Ref --
270 ----------------------
272 function Is_Static_SO_Ref (U : SO_Ref) return Boolean is
275 end Is_Static_SO_Ref;
281 procedure lgx (U : Node_Ref_Or_Val) is
283 List_GCC_Expression (U);
287 ----------------------
288 -- List_Array_Info --
289 ----------------------
291 procedure List_Array_Info (Ent : Entity_Id) is
293 List_Type_Info (Ent);
296 Write_Str ("'Component_Size use ");
297 Write_Val (Component_Size (Ent));
305 procedure List_Entities (Ent : Entity_Id) is
309 function Find_Declaration (E : Entity_Id) return Node_Id;
310 -- Utility to retrieve declaration node for entity in the
311 -- case of package bodies and subprograms.
313 ----------------------
314 -- Find_Declaration --
315 ----------------------
317 function Find_Declaration (E : Entity_Id) return Node_Id is
323 and then Nkind (Decl) /= N_Package_Body
324 and then Nkind (Decl) /= N_Subprogram_Declaration
325 and then Nkind (Decl) /= N_Subprogram_Body
327 Decl := Parent (Decl);
331 end Find_Declaration;
333 -- Start of processing for List_Entities
336 -- List entity if we have one, and it is not a renaming declaration.
337 -- For renamings, we don't get proper information, and really it makes
338 -- sense to restrict the output to the renamed entity.
341 and then Nkind (Declaration_Node (Ent)) not in N_Renaming_Declaration
343 -- If entity is a subprogram and we are listing mechanisms,
344 -- then we need to list mechanisms for this entity.
346 if List_Representation_Info_Mechanisms
347 and then (Is_Subprogram (Ent)
348 or else Ekind (Ent) = E_Entry
349 or else Ekind (Ent) = E_Entry_Family)
351 Need_Blank_Line := True;
352 List_Mechanisms (Ent);
355 E := First_Entity (Ent);
356 while Present (E) loop
357 Need_Blank_Line := True;
359 -- We list entities that come from source (excluding private or
360 -- incomplete types or deferred constants, where we will list the
361 -- info for the full view). If debug flag A is set, then all
362 -- entities are listed
364 if (Comes_From_Source (E)
365 and then not Is_Incomplete_Or_Private_Type (E)
366 and then not (Ekind (E) = E_Constant
367 and then Present (Full_View (E))))
368 or else Debug_Flag_AA
374 Ekind (E) = E_Entry_Family
376 Ekind (E) = E_Subprogram_Type
378 if List_Representation_Info_Mechanisms then
382 elsif Is_Record_Type (E) then
383 if List_Representation_Info >= 1 then
384 List_Record_Info (E);
387 elsif Is_Array_Type (E) then
388 if List_Representation_Info >= 1 then
392 elsif Is_Type (E) then
393 if List_Representation_Info >= 2 then
397 elsif Ekind (E) = E_Variable
399 Ekind (E) = E_Constant
401 Ekind (E) = E_Loop_Parameter
405 if List_Representation_Info >= 2 then
406 List_Object_Info (E);
411 -- Recurse into nested package, but not if they are package
412 -- renamings (in particular renamings of the enclosing package,
413 -- as for some Java bindings and for generic instances).
415 if Ekind (E) = E_Package then
416 if No (Renamed_Object (E)) then
420 -- Recurse into bodies
422 elsif Ekind (E) = E_Protected_Type
424 Ekind (E) = E_Task_Type
426 Ekind (E) = E_Subprogram_Body
428 Ekind (E) = E_Package_Body
430 Ekind (E) = E_Task_Body
432 Ekind (E) = E_Protected_Body
436 -- Recurse into blocks
438 elsif Ekind (E) = E_Block then
443 E := Next_Entity (E);
446 -- For a package body, the entities of the visible subprograms are
447 -- declared in the corresponding spec. Iterate over its entities in
448 -- order to handle properly the subprogram bodies. Skip bodies in
449 -- subunits, which are listed independently.
451 if Ekind (Ent) = E_Package_Body
452 and then Present (Corresponding_Spec (Find_Declaration (Ent)))
454 E := First_Entity (Corresponding_Spec (Find_Declaration (Ent)));
456 while Present (E) loop
459 Nkind (Find_Declaration (E)) = N_Subprogram_Declaration
461 Body_E := Corresponding_Body (Find_Declaration (E));
465 Nkind (Parent (Find_Declaration (Body_E))) /= N_Subunit
467 List_Entities (Body_E);
477 -------------------------
478 -- List_GCC_Expression --
479 -------------------------
481 procedure List_GCC_Expression (U : Node_Ref_Or_Val) is
483 procedure Print_Expr (Val : Node_Ref_Or_Val);
484 -- Internal recursive procedure to print expression
490 procedure Print_Expr (Val : Node_Ref_Or_Val) is
493 UI_Write (Val, Decimal);
497 Node : Exp_Node renames Rep_Table.Table (-UI_To_Int (Val));
499 procedure Binop (S : String);
500 -- Output text for binary operator with S being operator name
506 procedure Binop (S : String) is
509 Print_Expr (Node.Op1);
511 Print_Expr (Node.Op2);
515 -- Start of processing for Print_Expr
521 Print_Expr (Node.Op1);
522 Write_Str (" then ");
523 Print_Expr (Node.Op2);
524 Write_Str (" else ");
525 Print_Expr (Node.Op3);
537 when Trunc_Div_Expr =>
540 when Ceil_Div_Expr =>
543 when Floor_Div_Expr =>
546 when Trunc_Mod_Expr =>
549 when Floor_Mod_Expr =>
552 when Ceil_Mod_Expr =>
555 when Exact_Div_Expr =>
560 Print_Expr (Node.Op1);
570 Print_Expr (Node.Op1);
572 when Truth_Andif_Expr =>
575 when Truth_Orif_Expr =>
578 when Truth_And_Expr =>
581 when Truth_Or_Expr =>
584 when Truth_Xor_Expr =>
587 when Truth_Not_Expr =>
589 Print_Expr (Node.Op1);
621 -- Start of processing for List_GCC_Expression
629 end List_GCC_Expression;
631 ---------------------
632 -- List_Mechanisms --
633 ---------------------
635 procedure List_Mechanisms (Ent : Entity_Id) is
644 Write_Str ("function ");
647 Write_Str ("operator ");
650 Write_Str ("procedure ");
652 when E_Subprogram_Type =>
655 when E_Entry | E_Entry_Family =>
656 Write_Str ("entry ");
662 Get_Unqualified_Decoded_Name_String (Chars (Ent));
663 Write_Str (Name_Buffer (1 .. Name_Len));
664 Write_Str (" declared at ");
665 Write_Location (Sloc (Ent));
668 Write_Str (" convention : ");
670 case Convention (Ent) is
671 when Convention_Ada => Write_Line ("Ada");
672 when Convention_Intrinsic => Write_Line ("InLineinsic");
673 when Convention_Entry => Write_Line ("Entry");
674 when Convention_Protected => Write_Line ("Protected");
675 when Convention_Assembler => Write_Line ("Assembler");
676 when Convention_C => Write_Line ("C");
677 when Convention_CIL => Write_Line ("CIL");
678 when Convention_COBOL => Write_Line ("COBOL");
679 when Convention_CPP => Write_Line ("C++");
680 when Convention_Fortran => Write_Line ("Fortran");
681 when Convention_Java => Write_Line ("Java");
682 when Convention_Stdcall => Write_Line ("Stdcall");
683 when Convention_Stubbed => Write_Line ("Stubbed");
686 -- Find max length of formal name
689 Form := First_Formal (Ent);
690 while Present (Form) loop
691 Get_Unqualified_Decoded_Name_String (Chars (Form));
693 if Name_Len > Plen then
700 -- Output formals and mechanisms
702 Form := First_Formal (Ent);
703 while Present (Form) loop
704 Get_Unqualified_Decoded_Name_String (Chars (Form));
706 while Name_Len <= Plen loop
707 Name_Len := Name_Len + 1;
708 Name_Buffer (Name_Len) := ' ';
712 Write_Str (Name_Buffer (1 .. Plen + 1));
713 Write_Str (": passed by ");
715 Write_Mechanism (Mechanism (Form));
720 if Etype (Ent) /= Standard_Void_Type then
721 Write_Str (" returns by ");
722 Write_Mechanism (Mechanism (Ent));
731 procedure List_Name (Ent : Entity_Id) is
733 if not Is_Compilation_Unit (Scope (Ent)) then
734 List_Name (Scope (Ent));
738 Get_Unqualified_Decoded_Name_String (Chars (Ent));
739 Set_Casing (Unit_Casing);
740 Write_Str (Name_Buffer (1 .. Name_Len));
743 ---------------------
744 -- List_Object_Info --
745 ---------------------
747 procedure List_Object_Info (Ent : Entity_Id) is
753 Write_Str ("'Size use ");
754 Write_Val (Esize (Ent));
759 Write_Str ("'Alignment use ");
760 Write_Val (Alignment (Ent));
762 end List_Object_Info;
764 ----------------------
765 -- List_Record_Info --
766 ----------------------
768 procedure List_Record_Info (Ent : Entity_Id) is
773 Max_Name_Length : Natural;
774 Max_Suni_Length : Natural;
778 List_Type_Info (Ent);
782 Write_Line (" use record");
784 -- First loop finds out max line length and max starting position
785 -- length, for the purpose of lining things up nicely.
787 Max_Name_Length := 0;
788 Max_Suni_Length := 0;
790 Comp := First_Component_Or_Discriminant (Ent);
791 while Present (Comp) loop
792 Get_Decoded_Name_String (Chars (Comp));
793 Max_Name_Length := Natural'Max (Max_Name_Length, Name_Len);
795 Cfbit := Component_Bit_Offset (Comp);
797 if Rep_Not_Constant (Cfbit) then
798 UI_Image_Length := 2;
801 -- Complete annotation in case not done
803 Set_Normalized_Position (Comp, Cfbit / SSU);
804 Set_Normalized_First_Bit (Comp, Cfbit mod SSU);
806 Sunit := Cfbit / SSU;
810 -- If the record is not packed, then we know that all fields whose
811 -- position is not specified have a starting normalized bit position
814 if Unknown_Normalized_First_Bit (Comp)
815 and then not Is_Packed (Ent)
817 Set_Normalized_First_Bit (Comp, Uint_0);
821 Natural'Max (Max_Suni_Length, UI_Image_Length);
823 Next_Component_Or_Discriminant (Comp);
826 -- Second loop does actual output based on those values
828 Comp := First_Component_Or_Discriminant (Ent);
829 while Present (Comp) loop
831 Esiz : constant Uint := Esize (Comp);
832 Bofs : constant Uint := Component_Bit_Offset (Comp);
833 Npos : constant Uint := Normalized_Position (Comp);
834 Fbit : constant Uint := Normalized_First_Bit (Comp);
839 Get_Decoded_Name_String (Chars (Comp));
840 Set_Casing (Unit_Casing);
841 Write_Str (Name_Buffer (1 .. Name_Len));
843 for J in 1 .. Max_Name_Length - Name_Len loop
849 if Known_Static_Normalized_Position (Comp) then
851 Spaces (Max_Suni_Length - UI_Image_Length);
852 Write_Str (UI_Image_Buffer (1 .. UI_Image_Length));
854 elsif Known_Component_Bit_Offset (Comp)
855 and then List_Representation_Info = 3
857 Spaces (Max_Suni_Length - 2);
858 Write_Str ("bit offset");
859 Write_Val (Bofs, Paren => True);
860 Write_Str (" size in bits = ");
861 Write_Val (Esiz, Paren => True);
865 elsif Known_Normalized_Position (Comp)
866 and then List_Representation_Info = 3
868 Spaces (Max_Suni_Length - 2);
872 -- For the packed case, we don't know the bit positions if we
873 -- don't know the starting position!
875 if Is_Packed (Ent) then
876 Write_Line ("?? range ? .. ??;");
879 -- Otherwise we can continue
886 Write_Str (" range ");
890 -- Allowing Uint_0 here is a kludge, really this should be a
891 -- fine Esize value but currently it means unknown, except that
892 -- we know after gigi has back annotated that a size of zero is
893 -- real, since otherwise gigi back annotates using No_Uint as
894 -- the value to indicate unknown).
896 if (Esize (Comp) = Uint_0 or else Known_Static_Esize (Comp))
897 and then Known_Static_Normalized_First_Bit (Comp)
899 Lbit := Fbit + Esiz - 1;
907 -- The test for Esize (Comp) not being Uint_0 here is a kludge.
908 -- Officially a value of zero for Esize means unknown, but here
909 -- we use the fact that we know that gigi annotates Esize with
910 -- No_Uint, not Uint_0. Really everyone should use No_Uint???
912 elsif List_Representation_Info < 3
913 or else (Esize (Comp) /= Uint_0 and then Unknown_Esize (Comp))
917 -- List_Representation >= 3 and Known_Esize (Comp)
920 Write_Val (Esiz, Paren => True);
922 -- If in front end layout mode, then dynamic size is stored
923 -- in storage units, so renormalize for output
925 if not Back_End_Layout then
930 -- Add appropriate first bit offset
940 Write_Int (UI_To_Int (Fbit) - 1);
948 Next_Component_Or_Discriminant (Comp);
951 Write_Line ("end record;");
952 end List_Record_Info;
958 procedure List_Rep_Info is
962 if List_Representation_Info /= 0
963 or else List_Representation_Info_Mechanisms
965 for U in Main_Unit .. Last_Unit loop
966 if In_Extended_Main_Source_Unit (Cunit_Entity (U)) then
968 -- Normal case, list to standard output
970 if not List_Representation_Info_To_File then
971 Unit_Casing := Identifier_Casing (Source_Index (U));
973 Write_Str ("Representation information for unit ");
974 Write_Unit_Name (Unit_Name (U));
978 for J in 1 .. Col - 1 loop
983 List_Entities (Cunit_Entity (U));
985 -- List representation information to file
988 Create_Repinfo_File_Access.all
989 (Get_Name_String (File_Name (Source_Index (U))));
990 Set_Special_Output (Write_Info_Line'Access);
991 List_Entities (Cunit_Entity (U));
992 Set_Special_Output (null);
993 Close_Repinfo_File_Access.all;
1000 --------------------
1001 -- List_Type_Info --
1002 --------------------
1004 procedure List_Type_Info (Ent : Entity_Id) is
1008 -- Do not list size info for unconstrained arrays, not meaningful
1010 if Is_Array_Type (Ent) and then not Is_Constrained (Ent) then
1014 -- If Esize and RM_Size are the same and known, list as Size. This
1015 -- is a common case, which we may as well list in simple form.
1017 if Esize (Ent) = RM_Size (Ent) then
1020 Write_Str ("'Size use ");
1021 Write_Val (Esize (Ent));
1024 -- For now, temporary case, to be removed when gigi properly back
1025 -- annotates RM_Size, if RM_Size is not set, then list Esize as Size.
1026 -- This avoids odd Object_Size output till we fix things???
1028 elsif Unknown_RM_Size (Ent) then
1031 Write_Str ("'Size use ");
1032 Write_Val (Esize (Ent));
1035 -- Otherwise list size values separately if they are set
1040 Write_Str ("'Object_Size use ");
1041 Write_Val (Esize (Ent));
1044 -- Note on following check: The RM_Size of a discrete type can
1045 -- legitimately be set to zero, so a special check is needed.
1049 Write_Str ("'Value_Size use ");
1050 Write_Val (RM_Size (Ent));
1057 Write_Str ("'Alignment use ");
1058 Write_Val (Alignment (Ent));
1062 ----------------------
1063 -- Rep_Not_Constant --
1064 ----------------------
1066 function Rep_Not_Constant (Val : Node_Ref_Or_Val) return Boolean is
1068 if Val = No_Uint or else Val < 0 then
1073 end Rep_Not_Constant;
1080 (Val : Node_Ref_Or_Val;
1081 D : Discrim_List) return Uint
1083 function B (Val : Boolean) return Uint;
1084 -- Returns Uint_0 for False, Uint_1 for True
1086 function T (Val : Node_Ref_Or_Val) return Boolean;
1087 -- Returns True for 0, False for any non-zero (i.e. True)
1089 function V (Val : Node_Ref_Or_Val) return Uint;
1090 -- Internal recursive routine to evaluate tree
1092 function W (Val : Uint) return Word;
1093 -- Convert Val to Word, assuming Val is always in the Int range. This is
1094 -- a helper function for the evaluation of bitwise expressions like
1095 -- Bit_And_Expr, for which there is no direct support in uintp. Uint
1096 -- values out of the Int range are expected to be seen in such
1097 -- expressions only with overflowing byte sizes around, introducing
1098 -- inherent unreliabilties in computations anyway.
1104 function B (Val : Boolean) return Uint is
1117 function T (Val : Node_Ref_Or_Val) return Boolean is
1130 function V (Val : Node_Ref_Or_Val) return Uint is
1139 Node : Exp_Node renames Rep_Table.Table (-UI_To_Int (Val));
1144 if T (Node.Op1) then
1145 return V (Node.Op2);
1147 return V (Node.Op3);
1151 return V (Node.Op1) + V (Node.Op2);
1154 return V (Node.Op1) - V (Node.Op2);
1157 return V (Node.Op1) * V (Node.Op2);
1159 when Trunc_Div_Expr =>
1160 return V (Node.Op1) / V (Node.Op2);
1162 when Ceil_Div_Expr =>
1165 (V (Node.Op1) / UR_From_Uint (V (Node.Op2)));
1167 when Floor_Div_Expr =>
1170 (V (Node.Op1) / UR_From_Uint (V (Node.Op2)));
1172 when Trunc_Mod_Expr =>
1173 return V (Node.Op1) rem V (Node.Op2);
1175 when Floor_Mod_Expr =>
1176 return V (Node.Op1) mod V (Node.Op2);
1178 when Ceil_Mod_Expr =>
1181 Q := UR_Ceiling (L / UR_From_Uint (R));
1184 when Exact_Div_Expr =>
1185 return V (Node.Op1) / V (Node.Op2);
1188 return -V (Node.Op1);
1191 return UI_Min (V (Node.Op1), V (Node.Op2));
1194 return UI_Max (V (Node.Op1), V (Node.Op2));
1197 return UI_Abs (V (Node.Op1));
1199 when Truth_Andif_Expr =>
1200 return B (T (Node.Op1) and then T (Node.Op2));
1202 when Truth_Orif_Expr =>
1203 return B (T (Node.Op1) or else T (Node.Op2));
1205 when Truth_And_Expr =>
1206 return B (T (Node.Op1) and T (Node.Op2));
1208 when Truth_Or_Expr =>
1209 return B (T (Node.Op1) or T (Node.Op2));
1211 when Truth_Xor_Expr =>
1212 return B (T (Node.Op1) xor T (Node.Op2));
1214 when Truth_Not_Expr =>
1215 return B (not T (Node.Op1));
1217 when Bit_And_Expr =>
1220 return UI_From_Int (Int (W (L) and W (R)));
1223 return B (V (Node.Op1) < V (Node.Op2));
1226 return B (V (Node.Op1) <= V (Node.Op2));
1229 return B (V (Node.Op1) > V (Node.Op2));
1232 return B (V (Node.Op1) >= V (Node.Op2));
1235 return B (V (Node.Op1) = V (Node.Op2));
1238 return B (V (Node.Op1) /= V (Node.Op2));
1242 Sub : constant Int := UI_To_Int (Node.Op1);
1245 pragma Assert (Sub in D'Range);
1258 -- We use an unchecked conversion to map Int values to their Word
1259 -- bitwise equivalent, which we could not achieve with a normal type
1260 -- conversion for negative Ints. We want bitwise equivalents because W
1261 -- is used as a helper for bit operators like Bit_And_Expr, and can be
1262 -- called for negative Ints in the context of aligning expressions like
1263 -- X+Align & -Align.
1265 function W (Val : Uint) return Word is
1266 function To_Word is new Ada.Unchecked_Conversion (Int, Word);
1268 return To_Word (UI_To_Int (Val));
1271 -- Start of processing for Rep_Value
1274 if Val = No_Uint then
1286 procedure Spaces (N : Natural) is
1288 for J in 1 .. N loop
1297 procedure Tree_Read is
1299 Rep_Table.Tree_Read;
1306 procedure Tree_Write is
1308 Rep_Table.Tree_Write;
1311 ---------------------
1312 -- Write_Info_Line --
1313 ---------------------
1315 procedure Write_Info_Line (S : String) is
1317 Write_Repinfo_Line_Access.all (S (S'First .. S'Last - 1));
1318 end Write_Info_Line;
1320 ---------------------
1321 -- Write_Mechanism --
1322 ---------------------
1324 procedure Write_Mechanism (M : Mechanism_Type) is
1328 Write_Str ("default");
1334 Write_Str ("reference");
1337 Write_Str ("descriptor");
1340 Write_Str ("descriptor (UBS)");
1343 Write_Str ("descriptor (UBSB)");
1346 Write_Str ("descriptor (UBA)");
1349 Write_Str ("descriptor (S)");
1352 Write_Str ("descriptor (SB)");
1355 Write_Str ("descriptor (A)");
1358 Write_Str ("descriptor (NCA)");
1361 raise Program_Error;
1363 end Write_Mechanism;
1369 procedure Write_Val (Val : Node_Ref_Or_Val; Paren : Boolean := False) is
1371 if Rep_Not_Constant (Val) then
1372 if List_Representation_Info < 3 or else Val = No_Uint then
1376 if Back_End_Layout then
1381 List_GCC_Expression (Val);
1384 List_GCC_Expression (Val);
1392 Write_Name_Decoded (Chars (Get_Dynamic_SO_Entity (Val)));
1395 Write_Name_Decoded (Chars (Get_Dynamic_SO_Entity (Val)));