1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 2002-2005, 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 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 with Csets
; use Csets
;
28 with Err_Vars
; use Err_Vars
;
29 with Namet
; use Namet
;
31 with Osint
; use Osint
;
32 with Output
; use Output
;
33 with Scans
; use Scans
;
34 with Snames
; use Snames
;
36 with Stringt
; use Stringt
;
39 with GNAT
.Heap_Sort_G
;
45 type Token_Name_Array
is array (Token_Type
) of Name_Id
;
46 Token_Names
: constant Token_Name_Array
:=
47 (Tok_Abort
=> Name_Abort
,
49 Tok_Abstract
=> Name_Abstract
,
50 Tok_Accept
=> Name_Accept
,
51 Tok_Aliased
=> Name_Aliased
,
53 Tok_Array
=> Name_Array
,
56 Tok_Begin
=> Name_Begin
,
57 Tok_Body
=> Name_Body
,
58 Tok_Case
=> Name_Case
,
59 Tok_Constant
=> Name_Constant
,
60 Tok_Declare
=> Name_Declare
,
61 Tok_Delay
=> Name_Delay
,
62 Tok_Delta
=> Name_Delta
,
63 Tok_Digits
=> Name_Digits
,
64 Tok_Else
=> Name_Else
,
65 Tok_Elsif
=> Name_Elsif
,
67 Tok_Entry
=> Name_Entry
,
68 Tok_Exception
=> Name_Exception
,
69 Tok_Exit
=> Name_Exit
,
71 Tok_Function
=> Name_Function
,
72 Tok_Generic
=> Name_Generic
,
73 Tok_Goto
=> Name_Goto
,
76 Tok_Limited
=> Name_Limited
,
77 Tok_Loop
=> Name_Loop
,
80 Tok_Null
=> Name_Null
,
83 Tok_Others
=> Name_Others
,
85 Tok_Package
=> Name_Package
,
86 Tok_Pragma
=> Name_Pragma
,
87 Tok_Private
=> Name_Private
,
88 Tok_Procedure
=> Name_Procedure
,
89 Tok_Protected
=> Name_Protected
,
90 Tok_Raise
=> Name_Raise
,
91 Tok_Range
=> Name_Range
,
92 Tok_Record
=> Name_Record
,
94 Tok_Renames
=> Name_Renames
,
95 Tok_Requeue
=> Name_Requeue
,
96 Tok_Return
=> Name_Return
,
97 Tok_Reverse
=> Name_Reverse
,
98 Tok_Select
=> Name_Select
,
99 Tok_Separate
=> Name_Separate
,
100 Tok_Subtype
=> Name_Subtype
,
101 Tok_Tagged
=> Name_Tagged
,
102 Tok_Task
=> Name_Task
,
103 Tok_Terminate
=> Name_Terminate
,
104 Tok_Then
=> Name_Then
,
105 Tok_Type
=> Name_Type
,
106 Tok_Until
=> Name_Until
,
108 Tok_When
=> Name_When
,
109 Tok_While
=> Name_While
,
110 Tok_With
=> Name_With
,
114 Already_Initialized
: Boolean := False;
115 -- Used to avoid repetition of the part of the initialisation that needs
116 -- to be done only once.
118 Empty_String
: String_Id
;
119 -- "", as a string_id
121 String_False
: String_Id
;
122 -- "false", as a string_id
124 Name_Defined
: Name_Id
;
125 -- defined, as a name_id
131 -- Accesses to procedure specified by procedure Initialize.
133 Error_Msg
: Error_Msg_Proc
;
139 Set_Ignore_Errors
: Set_Ignore_Errors_Proc
;
140 -- Indicate if error should be taken into account
142 Put_Char
: Put_Char_Proc
;
143 -- Output one character
145 New_EOL
: New_EOL_Proc
;
146 -- Output an end of line indication
148 -------------------------------
149 -- State of the Preprocessor --
150 -------------------------------
152 type Pp_State
is record
154 -- The location of the #if statement.
155 -- Used to flag #if with no corresponding #end if, at the end.
157 Else_Ptr
: Source_Ptr
;
158 -- The location of the #else statement.
159 -- Used to detect multiple #else.
162 -- Set to True when the code should be deleted or commented out.
164 Match_Seen
: Boolean;
165 -- Set to True when a condition in an #if or an #elsif is True.
166 -- Also set to True if Deleting at the previous level is True.
167 -- Used to decide if Deleting should be set to True in a following
172 type Pp_Depth
is new Nat
;
174 Ground
: constant Pp_Depth
:= 0;
176 package Pp_States
is new Table
.Table
177 (Table_Component_Type
=> Pp_State
,
178 Table_Index_Type
=> Pp_Depth
,
179 Table_Low_Bound
=> 1,
181 Table_Increment
=> 10,
182 Table_Name
=> "Prep.Pp_States");
183 -- A stack of the states of the preprocessor, for nested #if
185 type Operator
is (None
, Op_Or
, Op_And
);
191 function Deleting
return Boolean;
192 -- Return True if code should be deleted or commented out
194 function Expression
(Evaluate_It
: Boolean) return Boolean;
195 -- Evaluate a condition in an #if or an #elsif statement.
196 -- If Evaluate_It is False, the condition is effectively evaluated,
197 -- otherwise, only the syntax is checked.
199 procedure Go_To_End_Of_Line
;
200 -- Advance the scan pointer until we reach an end of line or the end
203 function Matching_Strings
(S1
, S2
: String_Id
) return Boolean;
204 -- Returns True if the two string parameters are equal (case insensitive)
206 ---------------------------------------
207 -- Change_Reserved_Keyword_To_Symbol --
208 ---------------------------------------
210 procedure Change_Reserved_Keyword_To_Symbol
211 (All_Keywords
: Boolean := False)
213 New_Name
: constant Name_Id
:= Token_Names
(Token
);
216 if New_Name
/= No_Name
then
218 when Tok_If | Tok_Else | Tok_Elsif | Tok_End |
219 Tok_And | Tok_Or | Tok_Then
=>
221 Token
:= Tok_Identifier
;
222 Token_Name
:= New_Name
;
226 Token
:= Tok_Identifier
;
227 Token_Name
:= New_Name
;
230 end Change_Reserved_Keyword_To_Symbol
;
232 ------------------------------------------
233 -- Check_Command_Line_Symbol_Definition --
234 ------------------------------------------
236 procedure Check_Command_Line_Symbol_Definition
237 (Definition
: String;
238 Data
: out Symbol_Data
)
240 Index
: Natural := 0;
241 Result
: Symbol_Data
;
244 -- Look for the character '='
246 for J
in Definition
'Range loop
247 if Definition
(J
) = '=' then
253 -- If no character '=', then the value is True
256 -- Put the symbol in the name buffer
258 Name_Len
:= Definition
'Length;
259 Name_Buffer
(1 .. Name_Len
) := Definition
;
260 Result
:= True_Value
;
262 elsif Index
= Definition
'First then
263 Fail
("invalid symbol definition """, Definition
, """");
266 -- Put the symbol in the name buffer
268 Name_Len
:= Index
- Definition
'First;
269 Name_Buffer
(1 .. Name_Len
) :=
270 String'(Definition (Definition'First .. Index - 1));
272 -- Check the syntax of the value
274 if Definition (Index + 1) /= '"'
275 or else Definition (Definition'Last) /= '"'
277 for J in Index + 1 .. Definition'Last loop
278 case Definition (J) is
279 when '_
' | '.' | '0' .. '9' |
280 'a
' .. 'z
' | 'A
' .. 'Z
' =>
284 Fail ("illegal value """,
285 Definition (Index + 1 .. Definition'Last),
291 -- And put the value in the result
293 Result.Is_A_String := False;
295 Store_String_Chars (Definition (Index + 1 .. Definition'Last));
296 Result.Value := End_String;
299 -- Now, check the syntax of the symbol (we don't allow accented and
302 if Name_Buffer (1) not in 'a
' .. 'z
'
303 and then Name_Buffer (1) not in 'A
' .. 'Z
'
306 Name_Buffer (1 .. Name_Len),
307 """ does not start with a letter");
310 for J in 2 .. Name_Len loop
311 case Name_Buffer (J) is
312 when 'a
' .. 'z
' | 'A
' .. 'Z
' | '0' .. '9' =>
318 Name_Buffer (1 .. Name_Len),
319 """ end with a '_
'");
321 elsif Name_Buffer (J + 1) = '_
' then
323 Name_Buffer (1 .. Name_Len),
324 """ contains consecutive '_
'");
329 Name_Buffer (1 .. Name_Len),
330 """ contains illegal character(s)");
334 Result.On_The_Command_Line := True;
336 -- Put the symbol name in the result
339 Sym : constant String :=
340 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 Pp_States.Last = Ground then
368 return Pp_States.Table (Pp_States.Last).Deleting;
376 function Expression (Evaluate_It : Boolean) return Boolean is
377 Evaluation : Boolean := Evaluate_It;
378 -- Is set to False after an "or else" when left term is True and
379 -- after an "and then" when left term is False.
381 Final_Result : Boolean := False;
383 Current_Result : Boolean := False;
386 Current_Operator : Operator := None;
389 Symbol_Name1 : Name_Id;
390 Symbol_Name2 : Name_Id;
391 Symbol_Pos1 : Source_Ptr;
392 Symbol_Pos2 : Source_Ptr;
393 Symbol_Value1 : String_Id;
394 Symbol_Value2 : String_Id;
397 -- Loop for each term
400 Change_Reserved_Keyword_To_Symbol;
402 Current_Result := False;
406 when Tok_Left_Paren =>
411 Current_Result := Expression (Evaluation);
413 if Token = Tok_Right_Paren then
417 Error_Msg ("`)` expected", Token_Ptr);
425 Current_Result := not Expression (Evaluation);
427 when Tok_Identifier =>
428 Symbol_Name1 := Token_Name;
429 Symbol_Pos1 := Token_Ptr;
432 if Token = Tok_Apostrophe then
437 if Token = Tok_Identifier
438 and then Token_Name = Name_Defined
443 Error_Msg ("identifier `Defined` expected", Token_Ptr);
447 Current_Result := Index_Of (Symbol_Name1) /= No_Symbol;
450 elsif Token = Tok_Equal then
453 Change_Reserved_Keyword_To_Symbol;
455 if Token = Tok_Identifier then
459 Symbol_Name2 := Token_Name;
460 Symbol_Pos2 := Token_Ptr;
464 Symbol1 := Index_Of (Symbol_Name1);
466 if Symbol1 = No_Symbol then
467 if Undefined_Symbols_Are_False then
468 Symbol_Value1 := String_False;
471 Error_Msg_Name_1 := Symbol_Name1;
472 Error_Msg ("unknown symbol %", Symbol_Pos1);
473 Symbol_Value1 := No_String;
478 Mapping.Table (Symbol1).Value;
481 Symbol2 := Index_Of (Symbol_Name2);
483 if Symbol2 = No_Symbol then
484 if Undefined_Symbols_Are_False then
485 Symbol_Value2 := String_False;
488 Error_Msg_Name_1 := Symbol_Name2;
489 Error_Msg ("unknown symbol %", Symbol_Pos2);
490 Symbol_Value2 := No_String;
494 Symbol_Value2 := Mapping.Table (Symbol2).Value;
497 if Symbol_Value1 /= No_String
498 and then Symbol_Value2 /= No_String
500 Current_Result := Matching_Strings
501 (Symbol_Value1, Symbol_Value2);
505 elsif Token = Tok_String_Literal then
510 Symbol1 := Index_Of (Symbol_Name1);
512 if Symbol1 = No_Symbol then
513 if Undefined_Symbols_Are_False then
514 Symbol_Value1 := String_False;
517 Error_Msg_Name_1 := Symbol_Name1;
518 Error_Msg ("unknown symbol %", Symbol_Pos1);
519 Symbol_Value1 := No_String;
523 Symbol_Value1 := Mapping.Table (Symbol1).Value;
526 if Symbol_Value1 /= No_String then
538 ("symbol or literal string expected", Token_Ptr);
542 -- symbol (True or False)
545 Symbol1 := Index_Of (Symbol_Name1);
547 if Symbol1 = No_Symbol then
548 if Undefined_Symbols_Are_False then
549 Symbol_Value1 := String_False;
552 Error_Msg_Name_1 := Symbol_Name1;
553 Error_Msg ("unknown symbol %", Symbol_Pos1);
554 Symbol_Value1 := No_String;
558 Symbol_Value1 := Mapping.Table (Symbol1).Value;
561 if Symbol_Value1 /= No_String then
562 String_To_Name_Buffer (Symbol_Value1);
564 for Index in 1 .. Name_Len loop
565 Name_Buffer (Index) :=
566 Fold_Lower (Name_Buffer (Index));
569 if Name_Buffer (1 .. Name_Len) = "true" then
570 Current_Result := True;
572 elsif Name_Buffer (1 .. Name_Len) = "false" then
573 Current_Result := False;
576 Error_Msg_Name_1 := Symbol_Name1;
578 ("value of symbol % is not True or False",
586 Error_Msg ("`(`, NOT or symbol expected", Token_Ptr);
589 -- Update the cumulative final result
591 case Current_Operator is
593 Final_Result := Current_Result;
596 Final_Result := Final_Result or Current_Result;
599 Final_Result := Final_Result and Current_Result;
602 -- Check the next operator
604 if Token = Tok_And then
605 if Current_Operator = Op_Or then
606 Error_Msg ("mixing OR and AND is not allowed", Token_Ptr);
609 Current_Operator := Op_And;
612 if Token = Tok_Then then
615 if Final_Result = False then
620 elsif Token = Tok_Or then
621 if Current_Operator = Op_And then
622 Error_Msg ("mixing AND and OR is not allowed", Token_Ptr);
625 Current_Operator := Op_Or;
628 if Token = Tok_Else then
637 -- No operator: exit the term loop
646 -----------------------
647 -- Go_To_End_Of_Line --
648 -----------------------
650 procedure Go_To_End_Of_Line is
652 -- Scan until we get an end of line or we reach the end of the buffer
654 while Token /= Tok_End_Of_Line
655 and then Token /= Tok_EOF
659 end Go_To_End_Of_Line;
665 function Index_Of (Symbol : Name_Id) return Symbol_Id is
667 if Mapping.Table /= null then
668 for J in Symbol_Id range 1 .. Symbol_Table.Last (Mapping) loop
669 if Mapping.Table (J).Symbol = Symbol then
682 procedure Preprocess is
683 Start_Of_Processing : Source_Ptr;
685 Preprocessor_Line : Boolean := False;
687 procedure Output (From, To : Source_Ptr);
688 -- Output the characters with indices From .. To in the buffer
689 -- to the output file.
691 procedure Output_Line (From, To : Source_Ptr);
692 -- Output a line or the end of a line from the buffer to the output
693 -- file, followed by an end of line terminator.
694 -- Depending on the value of Deleting and the switches, the line
695 -- may be commented out, blank or not output at all.
701 procedure Output (From, To : Source_Ptr) is
703 for J in From .. To loop
704 Put_Char (Sinput.Source (J));
712 procedure Output_Line (From, To : Source_Ptr) is
714 if Deleting or Preprocessor_Line then
715 if Blank_Deleted_Lines then
718 elsif Comment_Deleted_Lines then
737 -- Start of processing for Preprocess
740 Start_Of_Processing := Scan_Ptr;
742 -- We need to call Scan for the first time, because Initialyze_Scanner
743 -- is no longer doing it.
749 exit Input_Line_Loop when Token = Tok_EOF;
751 Preprocessor_Line := False;
753 if Token /= Tok_End_Of_Line then
757 if Token = Tok_Special and then Special_Character = '#
' then
758 Preprocessor_Line := True;
767 If_Ptr : constant Source_Ptr := Token_Ptr;
771 Cond := Expression (not Deleting);
773 -- Check for an eventual "then"
775 if Token = Tok_Then then
779 -- It is an error to have trailing characters after
780 -- the condition or "then".
782 if Token /= Tok_End_Of_Line
783 and then Token /= Tok_EOF
786 ("extraneous text on preprocessor line",
792 -- Set the initial state of this new "#if".
793 -- This must be done before incrementing the
794 -- Last of the table, otherwise function
795 -- Deleting does not report the correct value.
797 New_State : constant Pp_State :=
800 Deleting => Deleting or (not Cond),
801 Match_Seen => Deleting or Cond);
804 Pp_States.Increment_Last;
805 Pp_States.Table (Pp_States.Last) := New_State;
814 if Pp_States.Last = 0
815 or else Pp_States.Table (Pp_States.Last).Else_Ptr
818 Error_Msg ("no IF for this ELSIF", Token_Ptr);
822 not Pp_States.Table (Pp_States.Last).Match_Seen;
826 Cond := Expression (Cond);
828 -- Check for an eventual "then"
830 if Token = Tok_Then then
834 -- It is an error to have trailing characters after
835 -- the condition or "then".
837 if Token /= Tok_End_Of_Line
838 and then Token /= Tok_EOF
841 ("extraneous text on preprocessor line",
847 -- Depending on the value of the condition, set the
848 -- new values of Deleting and Match_Seen.
849 if Pp_States.Last > 0 then
850 if Pp_States.Table (Pp_States.Last).Match_Seen then
851 Pp_States.Table (Pp_States.Last).Deleting :=
855 Pp_States.Table (Pp_States.Last).Match_Seen :=
857 Pp_States.Table (Pp_States.Last).Deleting :=
866 if Pp_States.Last = 0 then
867 Error_Msg ("no IF for this ELSE", Token_Ptr);
870 Pp_States.Table (Pp_States.Last).Else_Ptr /= 0
872 Error_Msg ("duplicate ELSE line", Token_Ptr);
875 -- Set the possibly new values of Deleting and
878 if Pp_States.Last > 0 then
879 if Pp_States.Table (Pp_States.Last).Match_Seen then
880 Pp_States.Table (Pp_States.Last).Deleting :=
884 Pp_States.Table (Pp_States.Last).Match_Seen :=
886 Pp_States.Table (Pp_States.Last).Deleting :=
890 -- Set the Else_Ptr to check for illegal #elsif
893 Pp_States.Table (Pp_States.Last).Else_Ptr :=
899 -- It is an error to have characters after "#else"
900 if Token /= Tok_End_Of_Line
901 and then Token /= Tok_EOF
904 ("extraneous text on preprocessor line",
912 if Pp_States.Last = 0 then
913 Error_Msg ("no IF for this END", Token_Ptr);
918 if Token /= Tok_If then
919 Error_Msg ("IF expected", Token_Ptr);
924 if Token /= Tok_Semicolon then
925 Error_Msg ("`;` Expected", Token_Ptr);
930 -- It is an error to have character after
932 if Token /= Tok_End_Of_Line
933 and then Token /= Tok_EOF
936 ("extraneous text on preprocessor line",
942 -- In case of one of the errors above, skip the tokens
943 -- until the end of line is reached.
947 -- Decrement the depth of the #if stack.
949 if Pp_States.Last > 0 then
950 Pp_States.Decrement_Last;
954 -- Illegal preprocessor line
956 if Pp_States.Last = 0 then
957 Error_Msg ("IF expected", Token_Ptr);
960 Pp_States.Table (Pp_States.Last).Else_Ptr = 0
962 Error_Msg ("IF, ELSIF, ELSE, or `END IF` expected",
966 Error_Msg ("IF or `END IF` expected", Token_Ptr);
969 -- Skip to the end of this illegal line
974 -- Not a preprocessor line
977 -- Do not report errors for those lines, even if there are
978 -- Ada parsing errors.
980 Set_Ignore_Errors (To => True);
986 while Token /= Tok_End_Of_Line
987 and then Token /= Tok_EOF
989 if Token = Tok_Special
990 and then Special_Character = '$
'
993 Dollar_Ptr : constant Source_Ptr := Token_Ptr;
998 Change_Reserved_Keyword_To_Symbol;
1000 if Token = Tok_Identifier
1001 and then Token_Ptr = Dollar_Ptr + 1
1005 Symbol := Index_Of (Token_Name);
1007 -- If there is such a symbol, replace it by its
1010 if Symbol /= No_Symbol then
1011 Output (Start_Of_Processing, Dollar_Ptr - 1);
1012 Start_Of_Processing := Scan_Ptr;
1013 String_To_Name_Buffer
1014 (Mapping.Table (Symbol).Value);
1016 if Mapping.Table (Symbol).Is_A_String then
1018 -- Value is an Ada string
1022 for J in 1 .. Name_Len loop
1023 Put_Char (Name_Buffer (J));
1025 if Name_Buffer (J) = '"' then
1033 -- Value is a sequence of characters, not
1036 for J in 1 .. Name_Len loop
1037 Put_Char (Name_Buffer (J));
1049 Set_Ignore_Errors (To => False);
1053 pragma Assert (Token = Tok_End_Of_Line or Token = Tok_EOF);
1055 -- At this point, the token is either end of line or EOF.
1056 -- The line to possibly output stops just before the token.
1058 Output_Line (Start_Of_Processing, Token_Ptr - 1);
1060 -- If we are at the end of a line, the scan pointer is at the first
1061 -- non blank character, not necessarily the first character of the
1062 -- line; so, we have to deduct Start_Of_Processing from the token
1065 if Token = Tok_End_Of_Line then
1066 if (Sinput.Source (Token_Ptr) = ASCII.CR
1067 and then Sinput.Source (Token_Ptr + 1) = ASCII.LF)
1069 (Sinput.Source (Token_Ptr) = ASCII.CR
1070 and then Sinput.Source (Token_Ptr + 1) = ASCII.LF)
1072 Start_Of_Processing := Token_Ptr + 2;
1075 Start_Of_Processing := Token_Ptr + 1;
1079 -- Now, we scan the first token of the next line.
1080 -- If the token is EOF, the scan ponter will not move, and the token
1081 -- will still be EOF.
1083 Set_Ignore_Errors (To => True);
1085 Set_Ignore_Errors (To => False);
1086 end loop Input_Line_Loop;
1088 -- Report an error for any missing some "#end if;"
1090 for Level in reverse 1 .. Pp_States.Last loop
1091 Error_Msg ("no `END IF` for this IF", Pp_States.Table (Level).If_Ptr);
1099 procedure Initialize
1100 (Error_Msg : Error_Msg_Proc;
1102 Set_Ignore_Errors : Set_Ignore_Errors_Proc;
1103 Put_Char : Put_Char_Proc;
1104 New_EOL : New_EOL_Proc)
1107 if not Already_Initialized then
1109 Store_String_Chars ("True");
1110 True_Value.Value := End_String;
1113 Empty_String := End_String;
1116 Name_Buffer (1 .. Name_Len) := "defined";
1117 Name_Defined := Name_Find;
1120 Store_String_Chars ("False");
1121 String_False := End_String;
1123 Already_Initialized := True;
1126 Prep.Error_Msg := Error_Msg;
1128 Prep.Set_Ignore_Errors := Set_Ignore_Errors;
1129 Prep.Put_Char := Put_Char;
1130 Prep.New_EOL := New_EOL;
1137 procedure List_Symbols (Foreword : String) is
1138 Order : array (0 .. Integer (Symbol_Table.Last (Mapping)))
1140 -- After alphabetical sorting, this array stores thehe indices of
1141 -- the symbols in the order they are displayed.
1143 function Lt (Op1, Op2 : Natural) return Boolean;
1144 -- Comparison routine for sort call
1146 procedure Move (From : Natural; To : Natural);
1147 -- Move routine for sort call
1153 function Lt (Op1, Op2 : Natural) return Boolean is
1154 S1 : constant String :=
1155 Get_Name_String (Mapping.Table (Order (Op1)).Symbol);
1156 S2 : constant String :=
1157 Get_Name_String (Mapping.Table (Order (Op2)).Symbol);
1167 procedure Move (From : Natural; To : Natural) is
1169 Order (To) := Order (From);
1172 package Sort_Syms is new GNAT.Heap_Sort_G (Move, Lt);
1175 -- Maximum length of any symbol
1177 -- Start of processing for List_Symbols_Case
1180 if Symbol_Table.Last (Mapping) = 0 then
1184 if Foreword'Length > 0 then
1186 Write_Line (Foreword);
1188 for J in Foreword'Range loop
1193 -- Initialize the order
1195 for J in Order'Range loop
1196 Order (J) := Symbol_Id (J);
1199 -- Sort alphabetically
1201 Sort_Syms.Sort (Order'Last);
1205 for J in 1 .. Symbol_Table.Last (Mapping) loop
1206 Get_Name_String (Mapping.Table (J).Original);
1207 Max_L := Integer'Max (Max_L, Name_Len);
1211 Write_Str ("Symbol");
1213 for J in 1 .. Max_L - 5 loop
1217 Write_Line ("Value");
1219 Write_Str ("------");
1221 for J in 1 .. Max_L - 5 loop
1225 Write_Line ("------");
1227 for J in 1 .. Order'Last loop
1229 Data : constant Symbol_Data := Mapping.Table (Order (J));
1232 Get_Name_String (Data.Original);
1233 Write_Str (Name_Buffer (1 .. Name_Len));
1235 for K in Name_Len .. Max_L loop
1239 String_To_Name_Buffer (Data.Value);
1241 if Data.Is_A_String then
1244 for J in 1 .. Name_Len loop
1245 Write_Char (Name_Buffer (J));
1247 if Name_Buffer (J) = '"' then
1255 Write_Str (Name_Buffer (1 .. Name_Len));
1265 ----------------------
1266 -- Matching_Strings --
1267 ----------------------
1269 function Matching_Strings (S1, S2 : String_Id) return Boolean is
1271 String_To_Name_Buffer (S1);
1273 for Index in 1 .. Name_Len loop
1274 Name_Buffer (Index) := Fold_Lower (Name_Buffer (Index));
1278 String1 : constant String := Name_Buffer (1 .. Name_Len);
1281 String_To_Name_Buffer (S2);
1283 for Index in 1 .. Name_Len loop
1284 Name_Buffer (Index) := Fold_Lower (Name_Buffer (Index));
1287 return String1 = Name_Buffer (1 .. Name_Len);
1289 end Matching_Strings;
1291 --------------------
1292 -- Parse_Def_File --
1293 --------------------
1295 procedure Parse_Def_File is
1297 Symbol_Name : Name_Id;
1298 Original_Name : Name_Id;
1300 Value_Start : Source_Ptr;
1301 Value_End : Source_Ptr;
1311 exit Def_Line_Loop when Token = Tok_EOF;
1313 if Token /= Tok_End_Of_Line then
1314 Change_Reserved_Keyword_To_Symbol;
1316 if Token /= Tok_Identifier then
1317 Error_Msg ("identifier expected", Token_Ptr);
1321 Symbol_Name := Token_Name;
1324 for Ptr in Token_Ptr .. Scan_Ptr - 1 loop
1325 Name_Len := Name_Len + 1;
1326 Name_Buffer (Name_Len) := Sinput.Source (Ptr);
1329 Original_Name := Name_Find;
1332 if Token /= Tok_Colon_Equal then
1333 Error_Msg ("`:=` expected", Token_Ptr);
1339 if Token = Tok_String_Literal then
1340 Data := (Symbol => Symbol_Name,
1341 Original => Original_Name,
1342 On_The_Command_Line => False,
1343 Is_A_String => True,
1344 Value => String_Literal_Id);
1348 if Token /= Tok_End_Of_Line and then Token /= Tok_EOF then
1349 Error_Msg ("extraneous text in definition", Token_Ptr);
1353 elsif Token = Tok_End_Of_Line or Token = Tok_EOF then
1354 Data := (Symbol => Symbol_Name,
1355 Original => Original_Name,
1356 On_The_Command_Line => False,
1357 Is_A_String => False,
1358 Value => Empty_String);
1361 Value_Start := Token_Ptr;
1362 Value_End := Token_Ptr - 1;
1363 Scan_Ptr := Token_Ptr;
1367 Ch := Sinput.Source (Scan_Ptr);
1370 when '_
' | '.' | '0' .. '9' | 'a
' .. 'z
' | 'A
' .. 'Z
' =>
1371 Value_End := Scan_Ptr;
1372 Scan_Ptr := Scan_Ptr + 1;
1374 when ' ' | HT | VT | CR | LF | FF =>
1375 exit Value_Chars_Loop;
1378 Error_Msg ("illegal character", Scan_Ptr);
1381 end loop Value_Chars_Loop;
1385 if Token /= Tok_End_Of_Line and then Token /= Tok_EOF then
1386 Error_Msg ("extraneous text in definition", Token_Ptr);
1392 while Value_Start <= Value_End loop
1393 Store_String_Char (Sinput.Source (Value_Start));
1394 Value_Start := Value_Start + 1;
1397 Data := (Symbol => Symbol_Name,
1398 Original => Original_Name,
1399 On_The_Command_Line => False,
1400 Is_A_String => False,
1401 Value => End_String);
1404 -- Now that we have the value, get the symbol index
1406 Symbol := Index_Of (Symbol_Name);
1408 if Symbol /= No_Symbol then
1409 -- If we already have an entry for this symbol, replace it
1410 -- with the new value, except if the symbol was declared
1411 -- on the command line.
1413 if Mapping.Table (Symbol).On_The_Command_Line then
1418 -- As it is the first time we see this symbol, create a new
1419 -- entry in the table.
1421 if Mapping.Table = null then
1422 Symbol_Table.Init (Mapping);
1425 Symbol_Table.Increment_Last (Mapping);
1426 Symbol := Symbol_Table.Last (Mapping);
1429 Mapping.Table (Symbol) := Data;
1433 Set_Ignore_Errors (To => True);
1435 while Token /= Tok_End_Of_Line and Token /= Tok_EOF loop
1439 Set_Ignore_Errors (To => False);
1444 end loop Def_Line_Loop;