1------------------------------------------------------------------------------
2--                                                                          --
3--                         GNAT COMPILER COMPONENTS                         --
4--                                                                          --
5--                              S E M _ C H 2                               --
6--                                                                          --
7--                                 B o d y                                  --
8--                                                                          --
9--          Copyright (C) 1992-2021, 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
26with Atree;          use Atree;
27with Einfo;          use Einfo;
28with Einfo.Utils;    use Einfo.Utils;
29with Namet;          use Namet;
30with Opt;            use Opt;
31with Restrict;       use Restrict;
32with Rident;         use Rident;
33with Sem_Ch8;        use Sem_Ch8;
34with Sem_Dim;        use Sem_Dim;
35with Sinfo;          use Sinfo;
36with Sinfo.Nodes;    use Sinfo.Nodes;
37with Stand;          use Stand;
38with Uintp;          use Uintp;
39
40package body Sem_Ch2 is
41
42   -------------------------------
43   -- Analyze_Character_Literal --
44   -------------------------------
45
46   procedure Analyze_Character_Literal (N : Node_Id) is
47   begin
48      --  The type is eventually inherited from the context. If expansion
49      --  has already established the proper type, do not modify it.
50
51      if No (Etype (N)) then
52         Set_Etype (N, Any_Character);
53      end if;
54
55      Set_Is_Static_Expression (N);
56
57      if Comes_From_Source (N)
58        and then not In_Character_Range (UI_To_CC (Char_Literal_Value (N)))
59      then
60         Check_Restriction (No_Wide_Characters, N);
61      end if;
62   end Analyze_Character_Literal;
63
64   ------------------------
65   -- Analyze_Identifier --
66   ------------------------
67
68   procedure Analyze_Identifier (N : Node_Id) is
69   begin
70      --  Ignore call if prior errors, and identifier has no name, since
71      --  this is the result of some kind of previous error generating a
72      --  junk identifier.
73
74      if not Is_Valid_Name (Chars (N)) and then Total_Errors_Detected /= 0 then
75         return;
76      else
77         Find_Direct_Name (N);
78      end if;
79
80      Analyze_Dimension (N);
81   end Analyze_Identifier;
82
83   -----------------------------
84   -- Analyze_Integer_Literal --
85   -----------------------------
86
87   procedure Analyze_Integer_Literal (N : Node_Id) is
88   begin
89      --  As a lexical element, an integer literal has type Universal_Integer,
90      --  i.e., is compatible with any integer type. This is semantically
91      --  consistent and simplifies type checking and subsequent constant
92      --  folding when needed. An exception is caused by 64-bit modular types,
93      --  whose upper bound is not representable in a nonstatic context that
94      --  will use 64-bit integers at run time. For such cases, we need to
95      --  preserve the information that the analyzed literal has that modular
96      --  type. For simplicity, we preserve the information for all integer
97      --  literals that result from a modular operation. This happens after
98      --  prior analysis (or construction) of the literal, and after type
99      --  checking and resolution.
100
101      if No (Etype (N)) or else not Is_Modular_Integer_Type (Etype (N)) then
102         Set_Etype (N, Universal_Integer);
103      end if;
104
105      Set_Is_Static_Expression (N);
106   end Analyze_Integer_Literal;
107
108   --------------------------
109   -- Analyze_Real_Literal --
110   --------------------------
111
112   procedure Analyze_Real_Literal (N : Node_Id) is
113   begin
114      Set_Etype (N, Universal_Real);
115      Set_Is_Static_Expression (N);
116   end Analyze_Real_Literal;
117
118   ----------------------------
119   -- Analyze_String_Literal --
120   ----------------------------
121
122   procedure Analyze_String_Literal (N : Node_Id) is
123   begin
124      --  The type is eventually inherited from the context. If expansion
125      --  has already established the proper type, do not modify it.
126
127      if No (Etype (N)) then
128         Set_Etype (N, Any_String);
129      end if;
130
131      --  String literals are static in Ada 95. Note that if the subtype
132      --  turns out to be non-static, then the Is_Static_Expression flag
133      --  will be reset in Eval_String_Literal.
134
135      if Ada_Version >= Ada_95 then
136         Set_Is_Static_Expression (N);
137      end if;
138
139      if Comes_From_Source (N) and then Has_Wide_Character (N) then
140         Check_Restriction (No_Wide_Characters, N);
141      end if;
142   end Analyze_String_Literal;
143
144end Sem_Ch2;
145