1------------------------------------------------------------------------------
2--                                                                          --
3--                         GNAT COMPILER COMPONENTS                         --
4--                                                                          --
5--                              E X P _ C H 4                               --
6--                                                                          --
7--                                 S p e c                                  --
8--                                                                          --
9--          Copyright (C) 1992-2012, Free Software Foundation, Inc.         --
10--                                                                          --
11-- GNAT is free software;  you can  redistribute it  and/or modify it under --
12-- terms of the  GNU General Public License as published  by the Free Soft- --
13-- ware  Foundation;  either version 3,  or (at your option) any later ver- --
14-- sion.  GNAT is distributed in the hope that it will be useful, but WITH- --
15-- OUT ANY WARRANTY;  without even the  implied warranty of MERCHANTABILITY --
16-- or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License --
17-- for  more details.  You should have  received  a copy of the GNU General --
18-- Public License  distributed with GNAT; see file COPYING3.  If not, go to --
19-- http://www.gnu.org/licenses for a complete copy of the license.          --
20--                                                                          --
21-- GNAT was originally developed  by the GNAT team at  New York University. --
22-- Extensive contributions were provided by Ada Core Technologies Inc.      --
23--                                                                          --
24------------------------------------------------------------------------------
25
26--  Expand routines for chapter 4 constructs
27
28with Types; use Types;
29
30package Exp_Ch4 is
31
32   procedure Expand_N_Allocator                   (N : Node_Id);
33   procedure Expand_N_And_Then                    (N : Node_Id);
34   procedure Expand_N_Case_Expression             (N : Node_Id);
35   procedure Expand_N_Explicit_Dereference        (N : Node_Id);
36   procedure Expand_N_Expression_With_Actions     (N : Node_Id);
37   procedure Expand_N_If_Expression               (N : Node_Id);
38   procedure Expand_N_In                          (N : Node_Id);
39   procedure Expand_N_Indexed_Component           (N : Node_Id);
40   procedure Expand_N_Not_In                      (N : Node_Id);
41   procedure Expand_N_Null                        (N : Node_Id);
42   procedure Expand_N_Op_Abs                      (N : Node_Id);
43   procedure Expand_N_Op_Add                      (N : Node_Id);
44   procedure Expand_N_Op_And                      (N : Node_Id);
45   procedure Expand_N_Op_Concat                   (N : Node_Id);
46   procedure Expand_N_Op_Divide                   (N : Node_Id);
47   procedure Expand_N_Op_Expon                    (N : Node_Id);
48   procedure Expand_N_Op_Eq                       (N : Node_Id);
49   procedure Expand_N_Op_Ge                       (N : Node_Id);
50   procedure Expand_N_Op_Gt                       (N : Node_Id);
51   procedure Expand_N_Op_Le                       (N : Node_Id);
52   procedure Expand_N_Op_Lt                       (N : Node_Id);
53   procedure Expand_N_Op_Minus                    (N : Node_Id);
54   procedure Expand_N_Op_Mod                      (N : Node_Id);
55   procedure Expand_N_Op_Multiply                 (N : Node_Id);
56   procedure Expand_N_Op_Ne                       (N : Node_Id);
57   procedure Expand_N_Op_Not                      (N : Node_Id);
58   procedure Expand_N_Op_Or                       (N : Node_Id);
59   procedure Expand_N_Op_Plus                     (N : Node_Id);
60   procedure Expand_N_Op_Rem                      (N : Node_Id);
61   procedure Expand_N_Op_Rotate_Left              (N : Node_Id);
62   procedure Expand_N_Op_Rotate_Right             (N : Node_Id);
63   procedure Expand_N_Op_Shift_Left               (N : Node_Id);
64   procedure Expand_N_Op_Shift_Right              (N : Node_Id);
65   procedure Expand_N_Op_Shift_Right_Arithmetic   (N : Node_Id);
66   procedure Expand_N_Op_Subtract                 (N : Node_Id);
67   procedure Expand_N_Op_Xor                      (N : Node_Id);
68   procedure Expand_N_Or_Else                     (N : Node_Id);
69   procedure Expand_N_Qualified_Expression        (N : Node_Id);
70   procedure Expand_N_Quantified_Expression       (N : Node_Id);
71   procedure Expand_N_Selected_Component          (N : Node_Id);
72   procedure Expand_N_Slice                       (N : Node_Id);
73   procedure Expand_N_Type_Conversion             (N : Node_Id);
74   procedure Expand_N_Unchecked_Expression        (N : Node_Id);
75   procedure Expand_N_Unchecked_Type_Conversion   (N : Node_Id);
76
77   function Expand_Record_Equality
78     (Nod    : Node_Id;
79      Typ    : Entity_Id;
80      Lhs    : Node_Id;
81      Rhs    : Node_Id;
82      Bodies : List_Id)
83      return Node_Id;
84   --  Expand a record equality into an expression that compares the fields
85   --  individually to yield the required Boolean result. Loc is the
86   --  location for the generated nodes. Typ is the type of the record, and
87   --  Lhs, Rhs are the record expressions to be compared, these
88   --  expressions need not to be analyzed but have to be side-effect free.
89   --  Bodies is a list on which to attach bodies of local functions that
90   --  are created in the process. This is the responsibility of the caller
91   --  to insert those bodies at the right place. Nod provides the Sloc
92   --  value for generated code.
93
94   procedure Expand_Set_Membership (N : Node_Id);
95   --  For each choice of a set membership, we create a simple equality or
96   --  membership test. The whole membership is rewritten connecting these
97   --  with OR ELSE.
98
99   function Integer_Promotion_Possible (N : Node_Id) return Boolean;
100   --  Returns true if the node is a type conversion whose operand is an
101   --  arithmetic operation on signed integers, and the base type of the
102   --  signed integer type is smaller than Standard.Integer. In such case we
103   --  have special circuitry in Expand_N_Type_Conversion to promote both of
104   --  the operands to type Integer.
105
106end Exp_Ch4;
107