1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 2002-2013, 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 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. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Csets; use Csets;
27 with Err_Vars; use Err_Vars;
29 with Osint; use Osint;
30 with Output; use Output;
31 with Scans; use Scans;
32 with Snames; use Snames;
34 with Stringt; use Stringt;
36 with Uintp; use Uintp;
38 with GNAT.Heap_Sort_G;
44 type Token_Name_Array is array (Token_Type) of Name_Id;
45 Token_Names : constant Token_Name_Array :=
46 (Tok_Abort => Name_Abort,
48 Tok_Abstract => Name_Abstract,
49 Tok_Accept => Name_Accept,
50 Tok_Aliased => Name_Aliased,
52 Tok_Array => Name_Array,
55 Tok_Begin => Name_Begin,
56 Tok_Body => Name_Body,
57 Tok_Case => Name_Case,
58 Tok_Constant => Name_Constant,
59 Tok_Declare => Name_Declare,
60 Tok_Delay => Name_Delay,
61 Tok_Delta => Name_Delta,
62 Tok_Digits => Name_Digits,
63 Tok_Else => Name_Else,
64 Tok_Elsif => Name_Elsif,
66 Tok_Entry => Name_Entry,
67 Tok_Exception => Name_Exception,
68 Tok_Exit => Name_Exit,
70 Tok_Function => Name_Function,
71 Tok_Generic => Name_Generic,
72 Tok_Goto => Name_Goto,
75 Tok_Limited => Name_Limited,
76 Tok_Loop => Name_Loop,
79 Tok_Null => Name_Null,
82 Tok_Others => Name_Others,
84 Tok_Package => Name_Package,
85 Tok_Pragma => Name_Pragma,
86 Tok_Private => Name_Private,
87 Tok_Procedure => Name_Procedure,
88 Tok_Protected => Name_Protected,
89 Tok_Raise => Name_Raise,
90 Tok_Range => Name_Range,
91 Tok_Record => Name_Record,
93 Tok_Renames => Name_Renames,
94 Tok_Requeue => Name_Requeue,
95 Tok_Return => Name_Return,
96 Tok_Reverse => Name_Reverse,
97 Tok_Select => Name_Select,
98 Tok_Separate => Name_Separate,
99 Tok_Subtype => Name_Subtype,
100 Tok_Tagged => Name_Tagged,
101 Tok_Task => Name_Task,
102 Tok_Terminate => Name_Terminate,
103 Tok_Then => Name_Then,
104 Tok_Type => Name_Type,
105 Tok_Until => Name_Until,
107 Tok_When => Name_When,
108 Tok_While => Name_While,
109 Tok_With => Name_With,
113 Already_Initialized : Boolean := False;
114 -- Used to avoid repetition of the part of the initialisation that needs
115 -- to be done only once.
117 Empty_String : String_Id;
118 -- "", as a string_id
120 String_False : String_Id;
121 -- "false", as a string_id
127 -- Accesses to procedure specified by procedure Initialize
129 Error_Msg : Error_Msg_Proc;
135 Set_Ignore_Errors : Set_Ignore_Errors_Proc;
136 -- Indicate if error should be taken into account
138 Put_Char : Put_Char_Proc;
139 -- Output one character
141 New_EOL : New_EOL_Proc;
142 -- Output an end of line indication
144 -------------------------------
145 -- State of the Preprocessor --
146 -------------------------------
148 type Pp_State is record
150 -- The location of the #if statement (used to flag #if with no
151 -- corresponding #end if, at the end).
153 Else_Ptr : Source_Ptr;
154 -- The location of the #else statement (used to detect multiple #else's)
157 -- Set to True when the code should be deleted or commented out
159 Match_Seen : Boolean;
160 -- Set to True when a condition in an #if or an #elsif is True. Also set
161 -- to True if Deleting at the previous level is True. Used to decide if
162 -- Deleting should be set to True in a following #elsif or #else.
166 type Pp_Depth is new Nat;
168 Ground : constant Pp_Depth := 0;
170 package Pp_States is new Table.Table
171 (Table_Component_Type => Pp_State,
172 Table_Index_Type => Pp_Depth,
173 Table_Low_Bound => 1,
175 Table_Increment => 100,
176 Table_Name => "Prep.Pp_States");
177 -- A stack of the states of the preprocessor, for nested #if
179 type Operator is (None, Op_Or, Op_And);
185 function Deleting return Boolean;
186 -- Return True if code should be deleted or commented out
189 (Evaluate_It : Boolean;
190 Complemented : Boolean := False) return Boolean;
191 -- Evaluate a condition in an #if or an #elsif statement. If Evaluate_It
192 -- is False, the condition is effectively evaluated, otherwise, only the
193 -- syntax is checked.
195 procedure Go_To_End_Of_Line;
196 -- Advance the scan pointer until we reach an end of line or the end of the
199 function Matching_Strings (S1, S2 : String_Id) return Boolean;
200 -- Returns True if the two string parameters are equal (case insensitive)
202 ---------------------------------------
203 -- Change_Reserved_Keyword_To_Symbol --
204 ---------------------------------------
206 procedure Change_Reserved_Keyword_To_Symbol
207 (All_Keywords : Boolean := False)
209 New_Name : constant Name_Id := Token_Names (Token);
212 if New_Name /= No_Name then
214 when Tok_If | Tok_Else | Tok_Elsif | Tok_End |
215 Tok_And | Tok_Or | Tok_Then =>
217 Token := Tok_Identifier;
218 Token_Name := New_Name;
222 Token := Tok_Identifier;
223 Token_Name := New_Name;
226 end Change_Reserved_Keyword_To_Symbol;
228 ------------------------------------------
229 -- Check_Command_Line_Symbol_Definition --
230 ------------------------------------------
232 procedure Check_Command_Line_Symbol_Definition
233 (Definition : String;
234 Data : out Symbol_Data)
236 Index : Natural := 0;
237 Result : Symbol_Data;
240 -- Look for the character '='
242 for J in Definition'Range loop
243 if Definition (J) = '=' then
249 -- If no character '=', then the value is True
253 -- Put the symbol in the name buffer
255 Name_Len := Definition'Length;
256 Name_Buffer (1 .. Name_Len) := Definition;
257 Result := True_Value;
259 elsif Index = Definition'First then
260 Fail ("invalid symbol definition """ & Definition & """");
263 -- Put the symbol in the name buffer
265 Name_Len := Index - Definition'First;
266 Name_Buffer (1 .. Name_Len) :=
267 String'(Definition (Definition'First .. Index - 1));
269 -- Check the syntax of the value
271 if Definition (Index + 1) /= '"'
272 or else Definition (Definition'Last) /= '"'
274 for J in Index + 1 .. Definition'Last loop
275 case Definition (J) is
276 when '_' | '.' | '0' .. '9' | 'a' .. 'z' | 'A' .. 'Z' =>
280 Fail ("illegal value """
281 & Definition (Index + 1 .. Definition'Last)
287 -- Even if the value is a string, we still set Is_A_String to False,
288 -- to avoid adding additional quotes in the preprocessed sources when
289 -- replacing $<symbol>.
291 Result.Is_A_String := False;
293 -- Put the value in the result
296 Store_String_Chars (Definition (Index + 1 .. Definition'Last));
297 Result.Value := End_String;
300 -- Now, check the syntax of the symbol (we don't allow accented or
303 if Name_Buffer (1) not in 'a' .. 'z'
304 and then Name_Buffer (1) not in 'A' .. 'Z'
307 & Name_Buffer (1 .. Name_Len)
308 & """ does not start with a letter");
311 for J in 2 .. Name_Len loop
312 case Name_Buffer (J) is
313 when 'a' .. 'z' | 'A' .. 'Z' | '0' .. '9' =>
319 & Name_Buffer (1 .. Name_Len)
320 & """ end with a '_'");
322 elsif Name_Buffer (J + 1) = '_' then
324 & Name_Buffer (1 .. Name_Len)
325 & """ contains consecutive '_'");
330 & Name_Buffer (1 .. Name_Len)
331 & """ contains illegal character(s)");
335 Result.On_The_Command_Line := True;
337 -- Put the symbol name in the result
340 Sym : constant String := Name_Buffer (1 .. Name_Len);
343 for Index in 1 .. Name_Len loop
344 Name_Buffer (Index) := Fold_Lower (Name_Buffer (Index));
347 Result.Symbol := Name_Find;
348 Name_Len := Sym'Length;
349 Name_Buffer (1 .. Name_Len) := Sym;
350 Result.Original := Name_Find;
354 end Check_Command_Line_Symbol_Definition;
360 function Deleting return Boolean is
362 -- Always return False when not inside an #if statement
364 if Opt.No_Deletion or else Pp_States.Last = Ground then
367 return Pp_States.Table (Pp_States.Last).Deleting;
376 (Evaluate_It : Boolean;
377 Complemented : Boolean := False) return Boolean
379 Evaluation : Boolean := Evaluate_It;
380 -- Is set to False after an "or else" when left term is True and after
381 -- an "and then" when left term is False.
383 Final_Result : Boolean := False;
385 Current_Result : Boolean := False;
388 Current_Operator : Operator := None;
391 Symbol_Name1 : Name_Id;
392 Symbol_Name2 : Name_Id;
393 Symbol_Pos1 : Source_Ptr;
394 Symbol_Pos2 : Source_Ptr;
395 Symbol_Value1 : String_Id;
396 Symbol_Value2 : String_Id;
401 -- Loop for each term
404 Change_Reserved_Keyword_To_Symbol;
406 Current_Result := False;
408 -- Scan current term, starting with Token
412 -- Handle parenthesized expression
414 when Tok_Left_Paren =>
416 Current_Result := Expression (Evaluation);
418 if Token = Tok_Right_Paren then
423 ("`)` expected", Token_Ptr);
426 -- Handle not expression
431 not Expression (Evaluation, Complemented => True);
433 -- Handle sequence starting with identifier
435 when Tok_Identifier =>
436 Symbol_Name1 := Token_Name;
437 Symbol_Pos1 := Token_Ptr;
440 if Token = Tok_Apostrophe then
446 if Token = Tok_Identifier
447 and then Token_Name = Name_Defined
452 Error_Msg ("identifier `Defined` expected", Token_Ptr);
456 Current_Result := Index_Of (Symbol_Name1) /= No_Symbol;
459 -- Handle relational operator
462 Token = Tok_Equal or else
463 Token = Tok_Less or else
464 Token = Tok_Less_Equal or else
465 Token = Tok_Greater or else
466 Token = Tok_Greater_Equal
470 Change_Reserved_Keyword_To_Symbol;
472 if Token = Tok_Integer_Literal then
481 Value : constant Int := UI_To_Int (Int_Literal_Value);
485 -- Value of symbol as Int
489 Symbol1 := Index_Of (Symbol_Name1);
491 if Symbol1 = No_Symbol then
492 Error_Msg_Name_1 := Symbol_Name1;
493 Error_Msg ("unknown symbol %", Symbol_Pos1);
494 Symbol_Value1 := No_String;
497 Data := Mapping.Table (Symbol1);
499 if Data.Is_A_String then
500 Error_Msg_Name_1 := Symbol_Name1;
502 ("symbol % value is not integer",
507 String_To_Name_Buffer (Data.Value);
509 Int'Value (Name_Buffer (1 .. Name_Len));
514 Symbol_Value = Value;
518 Symbol_Value < Value;
520 when Tok_Less_Equal =>
522 Symbol_Value <= Value;
526 Symbol_Value > Value;
528 when Tok_Greater_Equal =>
530 Symbol_Value >= Value;
537 when Constraint_Error =>
538 Error_Msg_Name_1 := Symbol_Name1;
540 ("symbol % value is not an integer",
550 -- Error if relational operator other than = if not numbers
552 elsif Relop /= Tok_Equal then
553 Error_Msg ("number expected", Token_Ptr);
555 -- Equality comparison of two strings
557 elsif Token = Tok_Identifier then
561 Symbol_Name2 := Token_Name;
562 Symbol_Pos2 := Token_Ptr;
566 Symbol1 := Index_Of (Symbol_Name1);
568 if Symbol1 = No_Symbol then
569 if Undefined_Symbols_Are_False then
570 Symbol_Value1 := String_False;
573 Error_Msg_Name_1 := Symbol_Name1;
574 Error_Msg ("unknown symbol %", Symbol_Pos1);
575 Symbol_Value1 := No_String;
580 Mapping.Table (Symbol1).Value;
583 Symbol2 := Index_Of (Symbol_Name2);
585 if Symbol2 = No_Symbol then
586 if Undefined_Symbols_Are_False then
587 Symbol_Value2 := String_False;
590 Error_Msg_Name_1 := Symbol_Name2;
591 Error_Msg ("unknown symbol %", Symbol_Pos2);
592 Symbol_Value2 := No_String;
596 Symbol_Value2 := Mapping.Table (Symbol2).Value;
599 if Symbol_Value1 /= No_String
601 Symbol_Value2 /= No_String
604 Matching_Strings (Symbol_Value1, Symbol_Value2);
608 elsif Token = Tok_String_Literal then
613 Symbol1 := Index_Of (Symbol_Name1);
615 if Symbol1 = No_Symbol then
616 if Undefined_Symbols_Are_False then
617 Symbol_Value1 := String_False;
620 Error_Msg_Name_1 := Symbol_Name1;
621 Error_Msg ("unknown symbol %", Symbol_Pos1);
622 Symbol_Value1 := No_String;
626 Symbol_Value1 := Mapping.Table (Symbol1).Value;
629 if Symbol_Value1 /= No_String then
641 ("literal integer, symbol or literal string expected",
645 -- Handle True or False
649 Symbol1 := Index_Of (Symbol_Name1);
651 if Symbol1 = No_Symbol then
652 if Undefined_Symbols_Are_False then
653 Symbol_Value1 := String_False;
656 Error_Msg_Name_1 := Symbol_Name1;
657 Error_Msg ("unknown symbol %", Symbol_Pos1);
658 Symbol_Value1 := No_String;
662 Symbol_Value1 := Mapping.Table (Symbol1).Value;
665 if Symbol_Value1 /= No_String then
666 String_To_Name_Buffer (Symbol_Value1);
668 for Index in 1 .. Name_Len loop
669 Name_Buffer (Index) :=
670 Fold_Lower (Name_Buffer (Index));
673 if Name_Buffer (1 .. Name_Len) = "true" then
674 Current_Result := True;
676 elsif Name_Buffer (1 .. Name_Len) = "false" then
677 Current_Result := False;
680 Error_Msg_Name_1 := Symbol_Name1;
682 ("value of symbol % is not True or False",
689 -- Unrecognized sequence
692 Error_Msg ("`(`, NOT or symbol expected", Token_Ptr);
695 -- Update the cumulative final result
697 case Current_Operator is
699 Final_Result := Current_Result;
702 Final_Result := Final_Result or Current_Result;
705 Final_Result := Final_Result and Current_Result;
710 if Token = Tok_And then
713 ("mixing NOT and AND is not allowed, parentheses are required",
716 elsif Current_Operator = Op_Or then
717 Error_Msg ("mixing OR and AND is not allowed", Token_Ptr);
720 Current_Operator := Op_And;
723 if Token = Tok_Then then
726 if Final_Result = False then
733 elsif Token = Tok_Or then
736 ("mixing NOT and OR is not allowed, parentheses are required",
739 elsif Current_Operator = Op_And then
740 Error_Msg ("mixing AND and OR is not allowed", Token_Ptr);
743 Current_Operator := Op_Or;
746 if Token = Tok_Else then
754 -- No AND/OR operator, so exit from the loop through terms
764 -----------------------
765 -- Go_To_End_Of_Line --
766 -----------------------
768 procedure Go_To_End_Of_Line is
770 -- Scan until we get an end of line or we reach the end of the buffer
772 while Token /= Tok_End_Of_Line
773 and then Token /= Tok_EOF
777 end Go_To_End_Of_Line;
783 function Index_Of (Symbol : Name_Id) return Symbol_Id is
785 if Mapping.Table /= null then
786 for J in Symbol_Id range 1 .. Symbol_Table.Last (Mapping) loop
787 if Mapping.Table (J).Symbol = Symbol then
800 procedure Initialize is
802 if not Already_Initialized then
804 Store_String_Chars ("True");
805 True_Value.Value := End_String;
808 Empty_String := End_String;
811 Store_String_Chars ("False");
812 String_False := End_String;
814 Already_Initialized := True;
822 procedure List_Symbols (Foreword : String) is
823 Order : array (0 .. Integer (Symbol_Table.Last (Mapping)))
825 -- After alphabetical sorting, this array stores the indexes of the
826 -- symbols in the order they are displayed.
828 function Lt (Op1, Op2 : Natural) return Boolean;
829 -- Comparison routine for sort call
831 procedure Move (From : Natural; To : Natural);
832 -- Move routine for sort call
838 function Lt (Op1, Op2 : Natural) return Boolean is
839 S1 : constant String :=
840 Get_Name_String (Mapping.Table (Order (Op1)).Symbol);
841 S2 : constant String :=
842 Get_Name_String (Mapping.Table (Order (Op2)).Symbol);
851 procedure Move (From : Natural; To : Natural) is
853 Order (To) := Order (From);
856 package Sort_Syms is new GNAT.Heap_Sort_G (Move, Lt);
859 -- Maximum length of any symbol
861 -- Start of processing for List_Symbols_Case
864 if Symbol_Table.Last (Mapping) = 0 then
868 if Foreword'Length > 0 then
870 Write_Line (Foreword);
872 for J in Foreword'Range loop
877 -- Initialize the order
879 for J in Order'Range loop
880 Order (J) := Symbol_Id (J);
883 -- Sort alphabetically
885 Sort_Syms.Sort (Order'Last);
889 for J in 1 .. Symbol_Table.Last (Mapping) loop
890 Get_Name_String (Mapping.Table (J).Original);
891 Max_L := Integer'Max (Max_L, Name_Len);
895 Write_Str ("Symbol");
897 for J in 1 .. Max_L - 5 loop
901 Write_Line ("Value");
903 Write_Str ("------");
905 for J in 1 .. Max_L - 5 loop
909 Write_Line ("------");
911 for J in 1 .. Order'Last loop
913 Data : constant Symbol_Data := Mapping.Table (Order (J));
916 Get_Name_String (Data.Original);
917 Write_Str (Name_Buffer (1 .. Name_Len));
919 for K in Name_Len .. Max_L loop
923 String_To_Name_Buffer (Data.Value);
925 if Data.Is_A_String then
928 for J in 1 .. Name_Len loop
929 Write_Char (Name_Buffer (J));
931 if Name_Buffer (J) = '"' then
939 Write_Str (Name_Buffer (1 .. Name_Len));
949 ----------------------
950 -- Matching_Strings --
951 ----------------------
953 function Matching_Strings (S1, S2 : String_Id) return Boolean is
955 String_To_Name_Buffer (S1);
957 for Index in 1 .. Name_Len loop
958 Name_Buffer (Index) := Fold_Lower (Name_Buffer (Index));
962 String1 : constant String := Name_Buffer (1 .. Name_Len);
965 String_To_Name_Buffer (S2);
967 for Index in 1 .. Name_Len loop
968 Name_Buffer (Index) := Fold_Lower (Name_Buffer (Index));
971 return String1 = Name_Buffer (1 .. Name_Len);
973 end Matching_Strings;
979 -- This procedure REALLY needs some more comments ???
981 procedure Parse_Def_File is
983 Symbol_Name : Name_Id;
984 Original_Name : Name_Id;
986 Value_Start : Source_Ptr;
987 Value_End : Source_Ptr;
997 exit Def_Line_Loop when Token = Tok_EOF;
999 if Token /= Tok_End_Of_Line then
1000 Change_Reserved_Keyword_To_Symbol;
1002 if Token /= Tok_Identifier then
1003 Error_Msg ("identifier expected", Token_Ptr);
1007 Symbol_Name := Token_Name;
1010 for Ptr in Token_Ptr .. Scan_Ptr - 1 loop
1011 Name_Len := Name_Len + 1;
1012 Name_Buffer (Name_Len) := Sinput.Source (Ptr);
1015 Original_Name := Name_Find;
1018 if Token /= Tok_Colon_Equal then
1019 Error_Msg -- CODEFIX
1020 ("`:=` expected", Token_Ptr);
1026 if Token = Tok_Integer_Literal then
1028 Ptr : Source_Ptr := Token_Ptr;
1032 while Ptr < Scan_Ptr loop
1033 Store_String_Char (Sinput.Source (Ptr));
1037 Data := (Symbol => Symbol_Name,
1038 Original => Original_Name,
1039 On_The_Command_Line => False,
1040 Is_A_String => False,
1041 Value => End_String);
1046 if Token /= Tok_End_Of_Line and then Token /= Tok_EOF then
1047 Error_Msg ("extraneous text in definition", Token_Ptr);
1051 elsif Token = Tok_String_Literal then
1052 Data := (Symbol => Symbol_Name,
1053 Original => Original_Name,
1054 On_The_Command_Line => False,
1055 Is_A_String => True,
1056 Value => String_Literal_Id);
1060 if Token /= Tok_End_Of_Line and then Token /= Tok_EOF then
1061 Error_Msg ("extraneous text in definition", Token_Ptr);
1065 elsif Token = Tok_End_Of_Line or else Token = Tok_EOF then
1066 Data := (Symbol => Symbol_Name,
1067 Original => Original_Name,
1068 On_The_Command_Line => False,
1069 Is_A_String => False,
1070 Value => Empty_String);
1073 Value_Start := Token_Ptr;
1074 Value_End := Token_Ptr - 1;
1075 Scan_Ptr := Token_Ptr;
1079 Ch := Sinput.Source (Scan_Ptr);
1082 when '_' | '.' | '0' .. '9' | 'a' .. 'z' | 'A' .. 'Z' =>
1083 Value_End := Scan_Ptr;
1084 Scan_Ptr := Scan_Ptr + 1;
1086 when ' ' | HT | VT | CR | LF | FF =>
1087 exit Value_Chars_Loop;
1090 Error_Msg ("illegal character", Scan_Ptr);
1093 end loop Value_Chars_Loop;
1097 if Token /= Tok_End_Of_Line and then Token /= Tok_EOF then
1098 Error_Msg ("extraneous text in definition", Token_Ptr);
1104 while Value_Start <= Value_End loop
1105 Store_String_Char (Sinput.Source (Value_Start));
1106 Value_Start := Value_Start + 1;
1109 Data := (Symbol => Symbol_Name,
1110 Original => Original_Name,
1111 On_The_Command_Line => False,
1112 Is_A_String => False,
1113 Value => End_String);
1116 -- Now that we have the value, get the symbol index
1118 Symbol := Index_Of (Symbol_Name);
1120 if Symbol /= No_Symbol then
1122 -- If we already have an entry for this symbol, replace it
1123 -- with the new value, except if the symbol was declared on
1124 -- the command line.
1126 if Mapping.Table (Symbol).On_The_Command_Line then
1131 -- As it is the first time we see this symbol, create a new
1132 -- entry in the table.
1134 if Mapping.Table = null then
1135 Symbol_Table.Init (Mapping);
1138 Symbol_Table.Increment_Last (Mapping);
1139 Symbol := Symbol_Table.Last (Mapping);
1142 Mapping.Table (Symbol) := Data;
1146 Set_Ignore_Errors (To => True);
1148 while Token /= Tok_End_Of_Line and then Token /= Tok_EOF loop
1152 Set_Ignore_Errors (To => False);
1157 end loop Def_Line_Loop;
1164 procedure Preprocess (Source_Modified : out Boolean) is
1165 Start_Of_Processing : Source_Ptr;
1167 Preprocessor_Line : Boolean := False;
1168 No_Error_Found : Boolean := True;
1169 Modified : Boolean := False;
1171 procedure Output (From, To : Source_Ptr);
1172 -- Output the characters with indexes From .. To in the buffer to the
1175 procedure Output_Line (From, To : Source_Ptr);
1176 -- Output a line or the end of a line from the buffer to the output
1177 -- file, followed by an end of line terminator. Depending on the value
1178 -- of Deleting and the switches, the line may be commented out, blank or
1179 -- not output at all.
1185 procedure Output (From, To : Source_Ptr) is
1187 for J in From .. To loop
1188 Put_Char (Sinput.Source (J));
1196 procedure Output_Line (From, To : Source_Ptr) is
1198 if Deleting or else Preprocessor_Line then
1199 if Blank_Deleted_Lines then
1202 elsif Comment_Deleted_Lines then
1221 -- Start of processing for Preprocess
1224 Start_Of_Processing := Scan_Ptr;
1226 -- First a call to Scan, because Initialize_Scanner is not doing it
1230 Input_Line_Loop : loop
1231 exit Input_Line_Loop when Token = Tok_EOF;
1233 Preprocessor_Line := False;
1235 if Token /= Tok_End_Of_Line then
1237 -- Preprocessor line
1239 if Token = Tok_Special and then Special_Character = '#' then
1241 Preprocessor_Line := True;
1250 If_Ptr : constant Source_Ptr := Token_Ptr;
1254 Cond := Expression (not Deleting);
1256 -- Check for an eventual "then"
1258 if Token = Tok_Then then
1262 -- It is an error to have trailing characters after
1263 -- the condition or "then".
1265 if Token /= Tok_End_Of_Line
1266 and then Token /= Tok_EOF
1269 ("extraneous text on preprocessor line",
1271 No_Error_Found := False;
1276 -- Set the initial state of this new "#if". This
1277 -- must be done before incrementing the Last of
1278 -- the table, otherwise function Deleting does
1279 -- not report the correct value.
1281 New_State : constant Pp_State :=
1284 Deleting => Deleting
1286 Match_Seen => Deleting or else Cond);
1289 Pp_States.Increment_Last;
1290 Pp_States.Table (Pp_States.Last) := New_State;
1299 if Pp_States.Last = 0
1300 or else Pp_States.Table (Pp_States.Last).Else_Ptr /= 0
1302 Error_Msg ("no IF for this ELSIF", Token_Ptr);
1303 No_Error_Found := False;
1307 not Pp_States.Table (Pp_States.Last).Match_Seen;
1311 Cond := Expression (Cond);
1313 -- Check for an eventual "then"
1315 if Token = Tok_Then then
1319 -- It is an error to have trailing characters after the
1320 -- condition or "then".
1322 if Token /= Tok_End_Of_Line
1323 and then Token /= Tok_EOF
1326 ("extraneous text on preprocessor line",
1328 No_Error_Found := False;
1333 -- Depending on the value of the condition, set the new
1334 -- values of Deleting and Match_Seen.
1336 if Pp_States.Last > 0 then
1337 if Pp_States.Table (Pp_States.Last).Match_Seen then
1338 Pp_States.Table (Pp_States.Last).Deleting := True;
1341 Pp_States.Table (Pp_States.Last).Match_Seen :=
1343 Pp_States.Table (Pp_States.Last).Deleting :=
1352 if Pp_States.Last = 0 then
1353 Error_Msg ("no IF for this ELSE", Token_Ptr);
1354 No_Error_Found := False;
1357 Pp_States.Table (Pp_States.Last).Else_Ptr /= 0
1359 Error_Msg -- CODEFIX
1360 ("duplicate ELSE line", Token_Ptr);
1361 No_Error_Found := False;
1364 -- Set the possibly new values of Deleting and Match_Seen
1366 if Pp_States.Last > 0 then
1367 if Pp_States.Table (Pp_States.Last).Match_Seen then
1368 Pp_States.Table (Pp_States.Last).Deleting :=
1372 Pp_States.Table (Pp_States.Last).Match_Seen :=
1374 Pp_States.Table (Pp_States.Last).Deleting :=
1378 -- Set the Else_Ptr to check for illegal #elsif later
1380 Pp_States.Table (Pp_States.Last).Else_Ptr :=
1386 -- Error of character present after "#else"
1388 if Token /= Tok_End_Of_Line
1389 and then Token /= Tok_EOF
1392 ("extraneous text on preprocessor line",
1394 No_Error_Found := False;
1401 if Pp_States.Last = 0 then
1402 Error_Msg ("no IF for this END", Token_Ptr);
1403 No_Error_Found := False;
1408 if Token /= Tok_If then
1409 Error_Msg -- CODEFIX
1410 ("IF expected", Token_Ptr);
1411 No_Error_Found := False;
1416 if Token /= Tok_Semicolon then
1417 Error_Msg -- CODEFIX
1418 ("`;` Expected", Token_Ptr);
1419 No_Error_Found := False;
1424 -- Error of character present after "#end if;"
1426 if Token /= Tok_End_Of_Line
1427 and then Token /= Tok_EOF
1430 ("extraneous text on preprocessor line",
1432 No_Error_Found := False;
1437 -- In case of one of the errors above, skip the tokens
1438 -- until the end of line is reached.
1442 -- Decrement the depth of the #if stack
1444 if Pp_States.Last > 0 then
1445 Pp_States.Decrement_Last;
1448 -- Illegal preprocessor line
1451 No_Error_Found := False;
1453 if Pp_States.Last = 0 then
1454 Error_Msg -- CODEFIX
1455 ("IF expected", Token_Ptr);
1458 Pp_States.Table (Pp_States.Last).Else_Ptr = 0
1461 ("IF, ELSIF, ELSE, or `END IF` expected",
1465 Error_Msg ("IF or `END IF` expected", Token_Ptr);
1468 -- Skip to the end of this illegal line
1473 -- Not a preprocessor line
1476 -- Do not report errors for those lines, even if there are
1477 -- Ada parsing errors.
1479 Set_Ignore_Errors (To => True);
1485 while Token /= Tok_End_Of_Line
1486 and then Token /= Tok_EOF
1488 if Token = Tok_Special
1489 and then Special_Character = '$'
1494 Dollar_Ptr : constant Source_Ptr := Token_Ptr;
1499 Change_Reserved_Keyword_To_Symbol;
1501 if Token = Tok_Identifier
1502 and then Token_Ptr = Dollar_Ptr + 1
1506 Symbol := Index_Of (Token_Name);
1508 -- If symbol exists, replace by its value
1510 if Symbol /= No_Symbol then
1511 Output (Start_Of_Processing, Dollar_Ptr - 1);
1512 Start_Of_Processing := Scan_Ptr;
1513 String_To_Name_Buffer
1514 (Mapping.Table (Symbol).Value);
1516 if Mapping.Table (Symbol).Is_A_String then
1518 -- Value is an Ada string
1522 for J in 1 .. Name_Len loop
1523 Put_Char (Name_Buffer (J));
1525 if Name_Buffer (J) = '"' then
1533 -- Value is a sequence of characters, not
1536 for J in 1 .. Name_Len loop
1537 Put_Char (Name_Buffer (J));
1549 Set_Ignore_Errors (To => False);
1553 pragma Assert (Token = Tok_End_Of_Line or else Token = Tok_EOF);
1555 -- At this point, the token is either end of line or EOF. The line to
1556 -- possibly output stops just before the token.
1558 Output_Line (Start_Of_Processing, Token_Ptr - 1);
1560 -- If we are at the end of a line, the scan pointer is at the first
1561 -- non-blank character (may not be the first character of the line),
1562 -- so we have to deduct Start_Of_Processing from the token pointer.
1564 if Token = Tok_End_Of_Line then
1565 if (Sinput.Source (Token_Ptr) = ASCII.CR
1566 and then Sinput.Source (Token_Ptr + 1) = ASCII.LF)
1568 (Sinput.Source (Token_Ptr) = ASCII.CR
1569 and then Sinput.Source (Token_Ptr + 1) = ASCII.LF)
1571 Start_Of_Processing := Token_Ptr + 2;
1573 Start_Of_Processing := Token_Ptr + 1;
1577 -- Now, scan the first token of the next line. If the token is EOF,
1578 -- the scan pointer will not move, and the token will still be EOF.
1580 Set_Ignore_Errors (To => True);
1582 Set_Ignore_Errors (To => False);
1583 end loop Input_Line_Loop;
1585 -- Report an error for any missing some "#end if;"
1587 for Level in reverse 1 .. Pp_States.Last loop
1588 Error_Msg ("no `END IF` for this IF", Pp_States.Table (Level).If_Ptr);
1589 No_Error_Found := False;
1592 Source_Modified := No_Error_Found and Modified;
1599 procedure Setup_Hooks
1600 (Error_Msg : Error_Msg_Proc;
1602 Set_Ignore_Errors : Set_Ignore_Errors_Proc;
1603 Put_Char : Put_Char_Proc;
1604 New_EOL : New_EOL_Proc)
1607 pragma Assert (Already_Initialized);
1609 Prep.Error_Msg := Error_Msg;
1611 Prep.Set_Ignore_Errors := Set_Ignore_Errors;
1612 Prep.Put_Char := Put_Char;
1613 Prep.New_EOL := New_EOL;