1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2011, 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. --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
27 -- GNAT was originally developed by the GNAT team at New York University. --
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
30 ------------------------------------------------------------------------------
33 with Sinfo; use Sinfo;
34 with Einfo; use Einfo;
35 with Namet; use Namet;
36 with Types; use Types;
37 with Snames; use Snames;
38 with System; use System;
40 with Uintp; use Uintp;
41 with Urealp; use Urealp;
42 with Unchecked_Conversion;
46 -- This package defines the format of the tree used to represent the Ada
47 -- program internally. Syntactic and semantic information is combined in
48 -- this tree. There is no separate symbol table structure.
50 -- WARNING: There is a C version of this package. Any changes to this
51 -- source file must be properly reflected in the C header file atree.h
53 -- Package Atree defines the basic structure of the tree and its nodes and
54 -- provides the basic abstract interface for manipulating the tree. Two
55 -- other packages use this interface to define the representation of Ada
56 -- programs using this tree format. The package Sinfo defines the basic
57 -- representation of the syntactic structure of the program, as output
58 -- by the parser. The package Entity_Info defines the semantic information
59 -- which is added to the tree nodes that represent declared entities (i.e.
60 -- the information which might typically be described in a separate symbol
63 -- The front end of the compiler first parses the program and generates a
64 -- tree that is simply a syntactic representation of the program in abstract
65 -- syntax tree format. Subsequent processing in the front end traverses the
66 -- tree, transforming it in various ways and adding semantic information.
68 ----------------------------------------
69 -- Definitions of Fields in Tree Node --
70 ----------------------------------------
72 -- The representation of the tree is completely hidden, using a functional
73 -- interface for accessing and modifying the contents of nodes. Logically
74 -- a node contains a number of fields, much as though the nodes were
75 -- defined as a record type. The fields in a node are as follows:
77 -- Nkind Indicates the kind of the node. This field is present
78 -- in all nodes. The type is Node_Kind, which is declared
79 -- in the package Sinfo.
81 -- Sloc Location (Source_Ptr) of the corresponding token
82 -- in the Source buffer. The individual node definitions
83 -- show which token is referenced by this pointer.
85 -- In_List A flag used to indicate if the node is a member
88 -- Rewrite_Ins A flag set if a node is marked as a rewrite inserted
89 -- node as a result of a call to Mark_Rewrite_Insertion.
91 -- Paren_Count A 2-bit count used in sub-expression nodes to indicate
92 -- the level of parentheses. The settings are 0,1,2 and
93 -- 3 for many. If the value is 3, then an auxiliary table
94 -- is used to indicate the real value. Set to zero for
95 -- non-subexpression nodes.
98 -- This flag is present in all nodes. It is set if the
99 -- node is built by the scanner or parser, and clear if
100 -- the node is built by the analyzer or expander. It
101 -- indicates that the node corresponds to a construct
102 -- that appears in the original source program.
104 -- Analyzed This flag is present in all nodes. It is set when
105 -- a node is analyzed, and is used to avoid analyzing
106 -- the same node twice. Analysis includes expansion if
107 -- expansion is active, so in this case if the flag is
108 -- set it means the node has been analyzed and expanded.
110 -- Error_Posted This flag is present in all nodes. It is set when
111 -- an error message is posted which is associated with
112 -- the flagged node. This is used to avoid posting more
113 -- than one message on the same node.
119 -- Field5 Five fields holding Union_Id values
121 -- ElistN Synonym for FieldN typed as Elist_Id (Empty = No_Elist)
122 -- ListN Synonym for FieldN typed as List_Id
123 -- NameN Synonym for FieldN typed as Name_Id
124 -- NodeN Synonym for FieldN typed as Node_Id
125 -- StrN Synonym for FieldN typed as String_Id
126 -- UintN Synonym for FieldN typed as Uint (Empty = Uint_0)
127 -- UrealN Synonym for FieldN typed as Ureal
129 -- Note: in the case of ElistN and UintN fields, it is common that we
130 -- end up with a value of Union_Id'(0) as the default value. This value
131 -- is meaningless as a Uint or Elist_Id value. We have two choices here.
132 -- We could require that all Uint and Elist fields be initialized to an
133 -- appropriate value, but that's error prone, since it would be easy to
134 -- miss an initialization. So instead we have the retrieval functions
135 -- generate an appropriate default value (Uint_0 or No_Elist). Probably
136 -- it would be cleaner to generate No_Uint in the Uint case but we got
137 -- stuck with representing an "unset" size value as zero early on, and
138 -- it will take a bit of fiddling to change that ???
140 -- Note: the actual usage of FieldN (i.e. whether it contains a Elist_Id,
141 -- List_Id, Name_Id, Node_Id, String_Id, Uint or Ureal) depends on the
142 -- value in Nkind. Generally the access to this field is always via the
143 -- functional interface, so the field names ElistN, ListN, NameN, NodeN,
144 -- StrN, UintN and UrealN are used only in the bodies of the access
145 -- functions (i.e. in the bodies of Sinfo and Einfo). These access
146 -- functions contain debugging code that checks that the use is
147 -- consistent with Nkind and Ekind values.
149 -- However, in specialized circumstances (examples are the circuit in
150 -- generic instantiation to copy trees, and in the tree dump routine),
151 -- it is useful to be able to do untyped traversals, and an internal
152 -- package in Atree allows for direct untyped accesses in such cases.
154 -- Flag4 Sixteen Boolean flags (use depends on Nkind and
155 -- Flag5 Ekind, as described for FieldN). Again the access
156 -- Flag6 is usually via subprograms in Sinfo and Einfo which
157 -- Flag7 provide high-level synonyms for these flags, and
158 -- Flag8 contain debugging code that checks that the values
159 -- Flag9 in Nkind and Ekind are appropriate for the access.
161 -- Flag11 Note that Flag1-2 are missing from this list. For
162 -- Flag12 historical reasons, these flag names are unused.
170 -- Link For a node, points to the Parent. For a list, points
171 -- to the list header. Note that in the latter case, a
172 -- client cannot modify the link field. This field is
173 -- private to the Atree package (but is also modified
174 -- by the Nlists package).
176 -- The following additional fields are present in extended nodes used
177 -- for entities (Nkind in N_Entity).
179 -- Ekind Entity type. This field indicates the type of the
180 -- entity, it is of type Entity_Kind which is defined
183 -- Flag19 235 additional flags
187 -- Convention Entity convention (Convention_Id value)
189 -- Field6 Additional Union_Id value stored in tree
191 -- Node6 Synonym for Field6 typed as Node_Id
192 -- Elist6 Synonym for Field6 typed as Elist_Id (Empty = No_Elist)
193 -- Uint6 Synonym for Field6 typed as Uint (Empty = Uint_0)
195 -- Similar definitions for Field7 to Field28 (and Node7-Node28,
196 -- Elist7-Elist28, Uint7-Uint28, Ureal7-Ureal28). Note that not all these
197 -- functions are defined, only the ones that are actually used.
199 function Last_Node_Id return Node_Id;
200 pragma Inline (Last_Node_Id);
201 -- Returns Id of last allocated node Id
203 function Nodes_Address return System.Address;
204 -- Return address of Nodes table (used in Back_End for Gigi call)
206 function Num_Nodes return Nat;
207 -- Total number of nodes allocated, where an entity counts as a single
208 -- node. This count is incremented every time a node or entity is
209 -- allocated, and decremented every time a node or entity is deleted.
210 -- This value is used by Xref and by Treepr to allocate hash tables of
211 -- suitable size for hashing Node_Id values.
213 -----------------------
214 -- Use of Empty Node --
215 -----------------------
217 -- The special Node_Id Empty is used to mark missing fields. Whenever the
218 -- syntax has an optional component, then the corresponding field will be
219 -- set to Empty if the component is missing.
221 -- Note: Empty is not used to describe an empty list. Instead in this
222 -- case the node field contains a list which is empty, and these cases
223 -- should be distinguished (essentially from a type point of view, Empty
224 -- is a Node, and is thus not a list).
226 -- Note: Empty does in fact correspond to an allocated node. Only the
227 -- Nkind field of this node may be referenced. It contains N_Empty, which
228 -- uniquely identifies the empty case. This allows the Nkind field to be
229 -- dereferenced before the check for Empty which is sometimes useful.
231 -----------------------
232 -- Use of Error Node --
233 -----------------------
235 -- The Error node is used during syntactic and semantic analysis to
236 -- indicate that the corresponding piece of syntactic structure or
237 -- semantic meaning cannot properly be represented in the tree because
238 -- of an illegality in the program.
240 -- If an Error node is encountered, then you know that a previous
241 -- illegality has been detected. The proper reaction should be to
242 -- avoid posting related cascaded error messages, and to propagate
243 -- the error node if necessary.
245 ------------------------
246 -- Current_Error_Node --
247 ------------------------
249 -- The current error node is a global location indicating the current
250 -- node that is being processed for the purposes of placing a compiler
251 -- abort message. This is not necessarily perfectly accurate, it is
252 -- just a reasonably accurate best guess. It is used to output the
253 -- source location in the abort message by Comperr, and also to
254 -- implement the d3 debugging flag. This is also used by Rtsfind
255 -- to generate error messages for high integrity mode.
257 -- There are two ways this gets set. During parsing, when new source
258 -- nodes are being constructed by calls to New_Node and New_Entity,
259 -- either one of these calls sets Current_Error_Node to the newly
260 -- created node. During semantic analysis, this mechanism is not
261 -- used, and instead Current_Error_Node is set by the subprograms in
262 -- Debug_A that mark the start and end of analysis/expansion of a
265 Current_Error_Node : Node_Id;
266 -- Node to place error messages
268 -------------------------------
269 -- Default Setting of Fields --
270 -------------------------------
272 -- Nkind is set to N_Unused_At_Start
274 -- Ekind is set to E_Void
276 -- Sloc is always set, there is no default value
278 -- Field1-5 fields are set to Empty
280 -- Field6-29 fields in extended nodes are set to Empty
282 -- Parent is set to Empty
284 -- All Boolean flag fields are set to False
286 -- Note: the value Empty is used in Field1-Field17 to indicate a null node.
287 -- The usage varies. The common uses are to indicate absence of an
288 -- optional clause or a completely unused Field1-17 field.
290 -------------------------------------
291 -- Use of Synonyms for Node Fields --
292 -------------------------------------
294 -- A subpackage Atree.Unchecked_Access provides routines for reading and
295 -- writing the fields defined above (Field1-27, Node1-27, Flag4-254 etc).
296 -- These unchecked access routines can be used for untyped traversals.
297 -- In addition they are used in the implementations of the Sinfo and
298 -- Einfo packages. These packages both provide logical synonyms for
299 -- the generic fields, together with an appropriate set of access routines.
300 -- Normally access to information within tree nodes uses these synonyms,
301 -- providing a high level typed interface to the tree information.
303 --------------------------------------------------
304 -- Node Allocation and Modification Subprograms --
305 --------------------------------------------------
307 -- Generally the parser builds the tree and then it is further decorated
308 -- (e.g. by setting the entity fields), but not fundamentally modified.
309 -- However, there are cases in which the tree must be restructured by
310 -- adding and rearranging nodes, as a result of disambiguating cases
311 -- which the parser could not parse correctly, and adding additional
312 -- semantic information (e.g. making constraint checks explicit). The
313 -- following subprograms are used for constructing the tree in the first
314 -- place, and then for subsequent modifications as required.
316 procedure Initialize;
317 -- Called at the start of compilation to initialize the allocation of
318 -- the node and list tables and make the standard entries for Empty,
319 -- Error and Error_List. Note that Initialize must not be called if
320 -- Tree_Read is used.
323 -- Called before the back end is invoked to lock the nodes table
324 -- Also called after Unlock to relock???
327 -- Unlocks nodes table, in cases where the back end needs to modify it
330 -- Initializes internal tables from current tree file using the relevant
331 -- Table.Tree_Read routines. Note that Initialize should not be called if
332 -- Tree_Read is used. Tree_Read includes all necessary initialization.
334 procedure Tree_Write;
335 -- Writes out internal tables to current tree file using the relevant
336 -- Table.Tree_Write routines.
339 (New_Node_Kind : Node_Kind;
340 New_Sloc : Source_Ptr) return Node_Id;
341 -- Allocates a completely new node with the given node type and source
342 -- location values. All other fields are set to their standard defaults:
344 -- Empty for all FieldN fields
345 -- False for all FlagN fields
347 -- The usual approach is to build a new node using this function and
348 -- then, using the value returned, use the Set_xxx functions to set
349 -- fields of the node as required. New_Node can only be used for
350 -- non-entity nodes, i.e. it never generates an extended node.
352 -- If we are currently parsing, as indicated by a previous call to
353 -- Set_Comes_From_Source_Default (True), then this call also resets
354 -- the value of Current_Error_Node.
357 (New_Node_Kind : Node_Kind;
358 New_Sloc : Source_Ptr) return Entity_Id;
359 -- Similar to New_Node, except that it is used only for entity nodes
360 -- and returns an extended node.
362 procedure Set_Comes_From_Source_Default (Default : Boolean);
363 -- Sets value of Comes_From_Source flag to be used in all subsequent
364 -- New_Node and New_Entity calls until another call to this procedure
365 -- changes the default. This value is set True during parsing and
366 -- False during semantic analysis. This is also used to determine
367 -- if New_Node and New_Entity should set Current_Error_Node.
369 function Get_Comes_From_Source_Default return Boolean;
370 pragma Inline (Get_Comes_From_Source_Default);
371 -- Gets the current value of the Comes_From_Source flag
373 procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id);
374 pragma Inline (Preserve_Comes_From_Source);
375 -- When a node is rewritten, it is sometimes appropriate to preserve the
376 -- original comes from source indication. This is true when the rewrite
377 -- essentially corresponds to a transformation corresponding exactly to
378 -- semantics in the reference manual. This procedure copies the setting
379 -- of Comes_From_Source from OldN to NewN.
381 function Has_Extension (N : Node_Id) return Boolean;
382 pragma Inline (Has_Extension);
383 -- Returns True if the given node has an extension (i.e. was created by
384 -- a call to New_Entity rather than New_Node, and Nkind is in N_Entity)
386 procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind);
387 -- This procedure replaces the given node by setting its Nkind field to
388 -- the indicated value and resetting all other fields to their default
389 -- values except for Sloc, which is unchanged, and the Parent pointer
390 -- and list links, which are also unchanged. All other information in
391 -- the original node is lost. The new node has an extension if the
392 -- original node had an extension.
394 procedure Copy_Node (Source : Node_Id; Destination : Node_Id);
395 -- Copy the entire contents of the source node to the destination node.
396 -- The contents of the source node is not affected. If the source node
397 -- has an extension, then the destination must have an extension also.
398 -- The parent pointer of the destination and its list link, if any, are
399 -- not affected by the copy. Note that parent pointers of descendents
400 -- are not adjusted, so the descendents of the destination node after
401 -- the Copy_Node is completed have dubious parent pointers. Note that
402 -- this routine does NOT copy aspect specifications, the Has_Aspects
403 -- flag in the returned node will always be False. The caller must deal
404 -- with copying aspect specifications where this is required.
406 function New_Copy (Source : Node_Id) return Node_Id;
407 -- This function allocates a completely new node, and then initializes it
408 -- by copying the contents of the source node into it. The contents of the
409 -- source node is not affected. The target node is always marked as not
410 -- being in a list (even if the source is a list member). The new node will
411 -- have an extension if the source has an extension. New_Copy (Empty)
412 -- returns Empty and New_Copy (Error) returns Error. Note that, unlike
413 -- Copy_Separate_Tree, New_Copy does not recursively copy any descendents,
414 -- so in general parent pointers are not set correctly for the descendents
415 -- of the copied node. Both normal and extended nodes (entities) may be
416 -- copied using New_Copy.
418 function Relocate_Node (Source : Node_Id) return Node_Id;
419 -- Source is a non-entity node that is to be relocated. A new node is
420 -- allocated and the contents of Source are copied to this node using
421 -- Copy_Node. The parent pointers of descendents of the node are then
422 -- adjusted to point to the relocated copy. The original node is not
423 -- modified, but the parent pointers of its descendents are no longer
424 -- valid. This routine is used in conjunction with the tree rewrite
425 -- routines (see descriptions of Replace/Rewrite).
427 -- Note that the resulting node has the same parent as the source
428 -- node, and is thus still attached to the tree. It is valid for
429 -- Source to be Empty, in which case Relocate_Node simply returns
430 -- Empty as the result.
432 function Copy_Separate_Tree (Source : Node_Id) return Node_Id;
433 -- Given a node that is the root of a subtree, Copy_Separate_Tree copies
434 -- the entire syntactic subtree, including recursively any descendants
435 -- whose parent field references a copied node (descendants not linked to
436 -- a copied node by the parent field are also copied.) The parent pointers
437 -- in the copy are properly set. Copy_Separate_Tree (Empty/Error) returns
438 -- Empty/Error. The semantic fields are not copied and the new subtree
439 -- does not share any entity with source subtree.
440 -- But the code *does* copy semantic fields, and the description above
441 -- is in any case unclear on this point ??? (RBKD)
443 procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id);
444 -- Exchange the contents of two entities. The parent pointers are switched
445 -- as well as the Defining_Identifier fields in the parents, so that the
446 -- entities point correctly to their original parents. The effect is thus
447 -- to leave the tree completely unchanged in structure, except that the
448 -- entity ID values of the two entities are interchanged. Neither of the
449 -- two entities may be list members.
451 function Extend_Node (Node : Node_Id) return Entity_Id;
452 -- This function returns a copy of its input node with an extension
453 -- added. The fields of the extension are set to Empty. Due to the way
454 -- extensions are handled (as four consecutive array elements), it may
455 -- be necessary to reallocate the node, so that the returned value is
456 -- not the same as the input value, but where possible the returned
457 -- value will be the same as the input value (i.e. the extension will
458 -- occur in place). It is the caller's responsibility to ensure that
459 -- any pointers to the original node are appropriately updated. This
460 -- function is used only by Sinfo.CN to change nodes into their
461 -- corresponding entities.
463 type Report_Proc is access procedure (Target : Node_Id; Source : Node_Id);
465 procedure Set_Reporting_Proc (P : Report_Proc);
466 -- Register a procedure that is invoked when a node is allocated, replaced
469 type Traverse_Result is (Abandon, OK, OK_Orig, Skip);
470 -- This is the type of the result returned by the Process function passed
471 -- to Traverse_Func and Traverse_Proc. See below for details.
473 subtype Traverse_Final_Result is Traverse_Result range Abandon .. OK;
474 -- This is the type of the final result returned Traverse_Func, based on
475 -- the results of Process calls. See below for details.
478 with function Process (N : Node_Id) return Traverse_Result is <>;
479 function Traverse_Func (Node : Node_Id) return Traverse_Final_Result;
480 -- This is a generic function that, given the parent node for a subtree,
481 -- traverses all syntactic nodes of this tree, calling the given function
482 -- Process on each one, in pre order (i.e. top-down). The order of
483 -- traversing subtrees is arbitrary. The traversal is controlled as follows
484 -- by the result returned by Process:
486 -- OK The traversal continues normally with the syntactic
487 -- children of the node just processed.
489 -- OK_Orig The traversal continues normally with the syntactic
490 -- children of the original node of the node just processed.
492 -- Skip The children of the node just processed are skipped and
493 -- excluded from the traversal, but otherwise processing
494 -- continues elsewhere in the tree.
496 -- Abandon The entire traversal is immediately abandoned, and the
497 -- original call to Traverse returns Abandon.
499 -- The result returned by Traverse is Abandon if processing was terminated
500 -- by a call to Process returning Abandon, otherwise it is OK (meaning that
501 -- all calls to process returned either OK, OK_Orig, or Skip).
504 with function Process (N : Node_Id) return Traverse_Result is <>;
505 procedure Traverse_Proc (Node : Node_Id);
506 pragma Inline (Traverse_Proc);
507 -- This is the same as Traverse_Func except that no result is returned,
508 -- i.e. Traverse_Func is called and the result is simply discarded.
510 ---------------------------
511 -- Node Access Functions --
512 ---------------------------
514 -- The following functions return the contents of the indicated field of
515 -- the node referenced by the argument, which is a Node_Id.
517 function Nkind (N : Node_Id) return Node_Kind;
518 pragma Inline (Nkind);
520 function Analyzed (N : Node_Id) return Boolean;
521 pragma Inline (Analyzed);
523 function Has_Aspects (N : Node_Id) return Boolean;
524 pragma Inline (Has_Aspects);
526 function Comes_From_Source (N : Node_Id) return Boolean;
527 pragma Inline (Comes_From_Source);
529 function Error_Posted (N : Node_Id) return Boolean;
530 pragma Inline (Error_Posted);
532 function Sloc (N : Node_Id) return Source_Ptr;
533 pragma Inline (Sloc);
535 function Paren_Count (N : Node_Id) return Nat;
536 pragma Inline (Paren_Count);
538 function Parent (N : Node_Id) return Node_Id;
539 pragma Inline (Parent);
540 -- Returns the parent of a node if the node is not a list member, or else
541 -- the parent of the list containing the node if the node is a list member.
543 function No (N : Node_Id) return Boolean;
545 -- Tests given Id for equality with the Empty node. This allows notations
546 -- like "if No (Variant_Part)" as opposed to "if Variant_Part = Empty".
548 function Present (N : Node_Id) return Boolean;
549 pragma Inline (Present);
550 -- Tests given Id for inequality with the Empty node. This allows notations
551 -- like "if Present (Statement)" as opposed to "if Statement /= Empty".
553 ---------------------
554 -- Node_Kind Tests --
555 ---------------------
557 -- These are like the functions in Sinfo, but the first argument is a
558 -- Node_Id, and the tested field is Nkind (N).
563 V2 : Node_Kind) return Boolean;
569 V3 : Node_Kind) return Boolean;
576 V4 : Node_Kind) return Boolean;
584 V5 : Node_Kind) return Boolean;
593 V6 : Node_Kind) return Boolean;
603 V7 : Node_Kind) return Boolean;
614 V8 : Node_Kind) return Boolean;
626 V9 : Node_Kind) return Boolean;
628 pragma Inline (Nkind_In);
629 -- Inline all above functions
631 -----------------------
632 -- Entity_Kind_Tests --
633 -----------------------
635 -- Utility functions to test whether an Entity_Kind value, either given
636 -- directly as the first argument, or the Ekind field of an Entity give
637 -- as the first argument, matches any of the given list of Entity_Kind
638 -- values. Return True if any match, False if no match.
643 V2 : Entity_Kind) return Boolean;
649 V3 : Entity_Kind) return Boolean;
656 V4 : Entity_Kind) return Boolean;
664 V5 : Entity_Kind) return Boolean;
673 V6 : Entity_Kind) return Boolean;
678 V2 : Entity_Kind) return Boolean;
684 V3 : Entity_Kind) return Boolean;
691 V4 : Entity_Kind) return Boolean;
699 V5 : Entity_Kind) return Boolean;
708 V6 : Entity_Kind) return Boolean;
710 pragma Inline (Ekind_In);
711 -- Inline all above functions
713 -----------------------------
714 -- Entity Access Functions --
715 -----------------------------
717 -- The following functions apply only to Entity_Id values, i.e.
718 -- to extended nodes.
720 function Ekind (E : Entity_Id) return Entity_Kind;
721 pragma Inline (Ekind);
723 function Convention (E : Entity_Id) return Convention_Id;
724 pragma Inline (Convention);
726 ----------------------------
727 -- Node Update Procedures --
728 ----------------------------
730 -- The following functions set a specified field in the node whose Id is
731 -- passed as the first argument. The second parameter is the new value
732 -- to be set in the specified field. Note that Set_Nkind is in the next
733 -- section, since its use is restricted.
735 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr);
736 pragma Inline (Set_Sloc);
738 procedure Set_Paren_Count (N : Node_Id; Val : Nat);
739 pragma Inline (Set_Paren_Count);
741 procedure Set_Parent (N : Node_Id; Val : Node_Id);
742 pragma Inline (Set_Parent);
744 procedure Set_Analyzed (N : Node_Id; Val : Boolean := True);
745 pragma Inline (Set_Analyzed);
747 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True);
748 pragma Inline (Set_Error_Posted);
750 procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean);
751 pragma Inline (Set_Comes_From_Source);
752 -- Note that this routine is very rarely used, since usually the
753 -- default mechanism provided sets the right value, but in some
754 -- unusual cases, the value needs to be reset (e.g. when a source
755 -- node is copied, and the copy must not have Comes_From_Source set.
757 procedure Set_Has_Aspects (N : Node_Id; Val : Boolean := True);
758 pragma Inline (Set_Has_Aspects);
760 ------------------------------
761 -- Entity Update Procedures --
762 ------------------------------
764 -- The following procedures apply only to Entity_Id values, i.e.
765 -- to extended nodes.
767 procedure Basic_Set_Convention (E : Entity_Id; Val : Convention_Id);
768 pragma Inline (Basic_Set_Convention);
769 -- Clients should use Sem_Util.Set_Convention rather than calling this
770 -- routine directly, as Set_Convention also deals with the special
771 -- processing required for access types.
773 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind);
774 pragma Inline (Set_Ekind);
776 ---------------------------
777 -- Tree Rewrite Routines --
778 ---------------------------
780 -- During the compilation process it is necessary in a number of situations
781 -- to rewrite the tree. In some cases, such rewrites do not affect the
782 -- structure of the tree, for example, when an indexed component node is
783 -- replaced by the corresponding call node (the parser cannot distinguish
784 -- between these two cases).
786 -- In other situations, the rewrite does affect the structure of the
787 -- tree. Examples are the replacement of a generic instantiation by the
788 -- instantiated spec and body, and the static evaluation of expressions.
790 -- If such structural modifications are done by the expander, there are
791 -- no difficulties, since the form of the tree after the expander has no
792 -- special significance, except as input to the backend of the compiler.
793 -- However, if these modifications are done by the semantic phase, then
794 -- it is important that they be done in a manner which allows the original
795 -- tree to be preserved. This is because tools like pretty printers need
796 -- to have this original tree structure available.
798 -- The subprograms in this section allow rewriting of the tree by either
799 -- insertion of new nodes in an existing list, or complete replacement of
800 -- a subtree. The resulting tree for most purposes looks as though it has
801 -- been really changed, and there is no trace of the original. However,
802 -- special subprograms, also defined in this section, allow the original
803 -- tree to be reconstructed if necessary.
805 -- For tree modifications done in the expander, it is permissible to
806 -- destroy the original tree, although it is also allowable to use the
807 -- tree rewrite routines where it is convenient to do so.
809 procedure Mark_Rewrite_Insertion (New_Node : Node_Id);
810 pragma Inline (Mark_Rewrite_Insertion);
811 -- This procedure marks the given node as an insertion made during a tree
812 -- rewriting operation. Only the root needs to be marked. The call does
813 -- not do the actual insertion, which must be done using one of the normal
814 -- list insertion routines. The node is treated normally in all respects
815 -- except for its response to Is_Rewrite_Insertion. The function of these
816 -- calls is to be able to get an accurate original tree. This helps the
817 -- accuracy of Sprint.Sprint_Node, and in particular, when stubs are being
818 -- generated, it is essential that the original tree be accurate.
820 function Is_Rewrite_Insertion (Node : Node_Id) return Boolean;
821 pragma Inline (Is_Rewrite_Insertion);
822 -- Tests whether the given node was marked using Mark_Rewrite_Insertion.
823 -- This is used in reconstructing the original tree (where such nodes are
824 -- to be eliminated).
826 procedure Rewrite (Old_Node, New_Node : Node_Id);
827 -- This is used when a complete subtree is to be replaced. Old_Node is the
828 -- root of the old subtree to be replaced, and New_Node is the root of the
829 -- newly constructed replacement subtree. The actual mechanism is to swap
830 -- the contents of these two nodes fixing up the parent pointers of the
831 -- replaced node (we do not attempt to preserve parent pointers for the
832 -- original node). Neither Old_Node nor New_Node can be extended nodes.
834 -- Note: New_Node may not contain references to Old_Node, for example as
835 -- descendents, since the rewrite would make such references invalid. If
836 -- New_Node does need to reference Old_Node, then these references should
837 -- be to a relocated copy of Old_Node (see Relocate_Node procedure).
839 -- Note: The Original_Node function applied to Old_Node (which has now
840 -- been replaced by the contents of New_Node), can be used to obtain the
841 -- original node, i.e. the old contents of Old_Node.
843 procedure Replace (Old_Node, New_Node : Node_Id);
844 -- This is similar to Rewrite, except that the old value of Old_Node is
845 -- not saved, and the New_Node is deleted after the replace, since it
846 -- is assumed that it can no longer be legitimately needed. The flag
847 -- Is_Rewrite_Substitution will be False for the resulting node, unless
848 -- it was already true on entry, and Original_Node will not return the
849 -- original contents of the Old_Node, but rather the New_Node value (unless
850 -- Old_Node had already been rewritten using Rewrite). Replace also
851 -- preserves the setting of Comes_From_Source.
853 -- Note, New_Node may not contain references to Old_Node, for example as
854 -- descendents, since the rewrite would make such references invalid. If
855 -- New_Node does need to reference Old_Node, then these references should
856 -- be to a relocated copy of Old_Node (see Relocate_Node procedure).
858 -- Replace is used in certain circumstances where it is desirable to
859 -- suppress any history of the rewriting operation. Notably, it is used
860 -- when the parser has mis-classified a node (e.g. a task entry call
861 -- that the parser has parsed as a procedure call).
863 function Is_Rewrite_Substitution (Node : Node_Id) return Boolean;
864 pragma Inline (Is_Rewrite_Substitution);
865 -- Return True iff Node has been rewritten (i.e. if Node is the root
866 -- of a subtree which was installed using Rewrite).
868 function Original_Node (Node : Node_Id) return Node_Id;
869 pragma Inline (Original_Node);
870 -- If Node has not been rewritten, then returns its input argument
871 -- unchanged, else returns the Node for the original subtree.
873 -- Note: Parents are not preserved in original tree nodes that are
874 -- retrieved in this way (i.e. their children may have children whose
875 -- pointers which reference some other node).
877 -- Note: there is no direct mechanism for deleting an original node (in
878 -- a manner that can be reversed later). One possible approach is to use
879 -- Rewrite to substitute a null statement for the node to be deleted.
881 -----------------------------------
882 -- Generic Field Access Routines --
883 -----------------------------------
885 -- This subpackage provides the functions for accessing and procedures for
886 -- setting fields that are normally referenced by their logical synonyms
887 -- defined in packages Sinfo and Einfo. The implementations of these
888 -- packages use the package Atree.Unchecked_Access.
890 package Unchecked_Access is
892 -- Functions to allow interpretation of Union_Id values as Uint and
895 function To_Union is new Unchecked_Conversion (Uint, Union_Id);
896 function To_Union is new Unchecked_Conversion (Ureal, Union_Id);
898 function From_Union is new Unchecked_Conversion (Union_Id, Uint);
899 function From_Union is new Unchecked_Conversion (Union_Id, Ureal);
901 -- Functions to fetch contents of indicated field. It is an error to
902 -- attempt to read the value of a field which is not present.
904 function Field1 (N : Node_Id) return Union_Id;
905 pragma Inline (Field1);
907 function Field2 (N : Node_Id) return Union_Id;
908 pragma Inline (Field2);
910 function Field3 (N : Node_Id) return Union_Id;
911 pragma Inline (Field3);
913 function Field4 (N : Node_Id) return Union_Id;
914 pragma Inline (Field4);
916 function Field5 (N : Node_Id) return Union_Id;
917 pragma Inline (Field5);
919 function Field6 (N : Node_Id) return Union_Id;
920 pragma Inline (Field6);
922 function Field7 (N : Node_Id) return Union_Id;
923 pragma Inline (Field7);
925 function Field8 (N : Node_Id) return Union_Id;
926 pragma Inline (Field8);
928 function Field9 (N : Node_Id) return Union_Id;
929 pragma Inline (Field9);
931 function Field10 (N : Node_Id) return Union_Id;
932 pragma Inline (Field10);
934 function Field11 (N : Node_Id) return Union_Id;
935 pragma Inline (Field11);
937 function Field12 (N : Node_Id) return Union_Id;
938 pragma Inline (Field12);
940 function Field13 (N : Node_Id) return Union_Id;
941 pragma Inline (Field13);
943 function Field14 (N : Node_Id) return Union_Id;
944 pragma Inline (Field14);
946 function Field15 (N : Node_Id) return Union_Id;
947 pragma Inline (Field15);
949 function Field16 (N : Node_Id) return Union_Id;
950 pragma Inline (Field16);
952 function Field17 (N : Node_Id) return Union_Id;
953 pragma Inline (Field17);
955 function Field18 (N : Node_Id) return Union_Id;
956 pragma Inline (Field18);
958 function Field19 (N : Node_Id) return Union_Id;
959 pragma Inline (Field19);
961 function Field20 (N : Node_Id) return Union_Id;
962 pragma Inline (Field20);
964 function Field21 (N : Node_Id) return Union_Id;
965 pragma Inline (Field21);
967 function Field22 (N : Node_Id) return Union_Id;
968 pragma Inline (Field22);
970 function Field23 (N : Node_Id) return Union_Id;
971 pragma Inline (Field23);
973 function Field24 (N : Node_Id) return Union_Id;
974 pragma Inline (Field24);
976 function Field25 (N : Node_Id) return Union_Id;
977 pragma Inline (Field25);
979 function Field26 (N : Node_Id) return Union_Id;
980 pragma Inline (Field26);
982 function Field27 (N : Node_Id) return Union_Id;
983 pragma Inline (Field27);
985 function Field28 (N : Node_Id) return Union_Id;
986 pragma Inline (Field28);
988 function Field29 (N : Node_Id) return Union_Id;
989 pragma Inline (Field29);
991 function Node1 (N : Node_Id) return Node_Id;
992 pragma Inline (Node1);
994 function Node2 (N : Node_Id) return Node_Id;
995 pragma Inline (Node2);
997 function Node3 (N : Node_Id) return Node_Id;
998 pragma Inline (Node3);
1000 function Node4 (N : Node_Id) return Node_Id;
1001 pragma Inline (Node4);
1003 function Node5 (N : Node_Id) return Node_Id;
1004 pragma Inline (Node5);
1006 function Node6 (N : Node_Id) return Node_Id;
1007 pragma Inline (Node6);
1009 function Node7 (N : Node_Id) return Node_Id;
1010 pragma Inline (Node7);
1012 function Node8 (N : Node_Id) return Node_Id;
1013 pragma Inline (Node8);
1015 function Node9 (N : Node_Id) return Node_Id;
1016 pragma Inline (Node9);
1018 function Node10 (N : Node_Id) return Node_Id;
1019 pragma Inline (Node10);
1021 function Node11 (N : Node_Id) return Node_Id;
1022 pragma Inline (Node11);
1024 function Node12 (N : Node_Id) return Node_Id;
1025 pragma Inline (Node12);
1027 function Node13 (N : Node_Id) return Node_Id;
1028 pragma Inline (Node13);
1030 function Node14 (N : Node_Id) return Node_Id;
1031 pragma Inline (Node14);
1033 function Node15 (N : Node_Id) return Node_Id;
1034 pragma Inline (Node15);
1036 function Node16 (N : Node_Id) return Node_Id;
1037 pragma Inline (Node16);
1039 function Node17 (N : Node_Id) return Node_Id;
1040 pragma Inline (Node17);
1042 function Node18 (N : Node_Id) return Node_Id;
1043 pragma Inline (Node18);
1045 function Node19 (N : Node_Id) return Node_Id;
1046 pragma Inline (Node19);
1048 function Node20 (N : Node_Id) return Node_Id;
1049 pragma Inline (Node20);
1051 function Node21 (N : Node_Id) return Node_Id;
1052 pragma Inline (Node21);
1054 function Node22 (N : Node_Id) return Node_Id;
1055 pragma Inline (Node22);
1057 function Node23 (N : Node_Id) return Node_Id;
1058 pragma Inline (Node23);
1060 function Node24 (N : Node_Id) return Node_Id;
1061 pragma Inline (Node24);
1063 function Node25 (N : Node_Id) return Node_Id;
1064 pragma Inline (Node25);
1066 function Node26 (N : Node_Id) return Node_Id;
1067 pragma Inline (Node26);
1069 function Node27 (N : Node_Id) return Node_Id;
1070 pragma Inline (Node27);
1072 function Node28 (N : Node_Id) return Node_Id;
1073 pragma Inline (Node28);
1075 function Node29 (N : Node_Id) return Node_Id;
1076 pragma Inline (Node29);
1078 function List1 (N : Node_Id) return List_Id;
1079 pragma Inline (List1);
1081 function List2 (N : Node_Id) return List_Id;
1082 pragma Inline (List2);
1084 function List3 (N : Node_Id) return List_Id;
1085 pragma Inline (List3);
1087 function List4 (N : Node_Id) return List_Id;
1088 pragma Inline (List4);
1090 function List5 (N : Node_Id) return List_Id;
1091 pragma Inline (List5);
1093 function List10 (N : Node_Id) return List_Id;
1094 pragma Inline (List10);
1096 function List14 (N : Node_Id) return List_Id;
1097 pragma Inline (List14);
1099 function List25 (N : Node_Id) return List_Id;
1100 pragma Inline (List25);
1102 function Elist1 (N : Node_Id) return Elist_Id;
1103 pragma Inline (Elist1);
1105 function Elist2 (N : Node_Id) return Elist_Id;
1106 pragma Inline (Elist2);
1108 function Elist3 (N : Node_Id) return Elist_Id;
1109 pragma Inline (Elist3);
1111 function Elist4 (N : Node_Id) return Elist_Id;
1112 pragma Inline (Elist4);
1114 function Elist5 (N : Node_Id) return Elist_Id;
1115 pragma Inline (Elist5);
1117 function Elist8 (N : Node_Id) return Elist_Id;
1118 pragma Inline (Elist8);
1120 function Elist10 (N : Node_Id) return Elist_Id;
1121 pragma Inline (Elist10);
1123 function Elist13 (N : Node_Id) return Elist_Id;
1124 pragma Inline (Elist13);
1126 function Elist15 (N : Node_Id) return Elist_Id;
1127 pragma Inline (Elist15);
1129 function Elist16 (N : Node_Id) return Elist_Id;
1130 pragma Inline (Elist16);
1132 function Elist18 (N : Node_Id) return Elist_Id;
1133 pragma Inline (Elist18);
1135 function Elist21 (N : Node_Id) return Elist_Id;
1136 pragma Inline (Elist21);
1138 function Elist23 (N : Node_Id) return Elist_Id;
1139 pragma Inline (Elist23);
1141 function Elist24 (N : Node_Id) return Elist_Id;
1142 pragma Inline (Elist24);
1144 function Elist25 (N : Node_Id) return Elist_Id;
1145 pragma Inline (Elist25);
1147 function Elist26 (N : Node_Id) return Elist_Id;
1148 pragma Inline (Elist26);
1150 function Name1 (N : Node_Id) return Name_Id;
1151 pragma Inline (Name1);
1153 function Name2 (N : Node_Id) return Name_Id;
1154 pragma Inline (Name2);
1156 function Str3 (N : Node_Id) return String_Id;
1157 pragma Inline (Str3);
1159 -- Note: the following Uintnn functions have a special test for the
1160 -- Field value being Empty. If an Empty value is found then Uint_0 is
1161 -- returned. This avoids the rather tricky requirement of initializing
1162 -- all Uint fields in nodes and entities.
1164 function Uint2 (N : Node_Id) return Uint;
1165 pragma Inline (Uint2);
1167 function Uint3 (N : Node_Id) return Uint;
1168 pragma Inline (Uint3);
1170 function Uint4 (N : Node_Id) return Uint;
1171 pragma Inline (Uint4);
1173 function Uint5 (N : Node_Id) return Uint;
1174 pragma Inline (Uint5);
1176 function Uint8 (N : Node_Id) return Uint;
1177 pragma Inline (Uint8);
1179 function Uint9 (N : Node_Id) return Uint;
1180 pragma Inline (Uint9);
1182 function Uint10 (N : Node_Id) return Uint;
1183 pragma Inline (Uint10);
1185 function Uint11 (N : Node_Id) return Uint;
1186 pragma Inline (Uint11);
1188 function Uint12 (N : Node_Id) return Uint;
1189 pragma Inline (Uint12);
1191 function Uint13 (N : Node_Id) return Uint;
1192 pragma Inline (Uint13);
1194 function Uint14 (N : Node_Id) return Uint;
1195 pragma Inline (Uint14);
1197 function Uint15 (N : Node_Id) return Uint;
1198 pragma Inline (Uint15);
1200 function Uint16 (N : Node_Id) return Uint;
1201 pragma Inline (Uint16);
1203 function Uint17 (N : Node_Id) return Uint;
1204 pragma Inline (Uint17);
1206 function Uint22 (N : Node_Id) return Uint;
1207 pragma Inline (Uint22);
1209 function Ureal3 (N : Node_Id) return Ureal;
1210 pragma Inline (Ureal3);
1212 function Ureal18 (N : Node_Id) return Ureal;
1213 pragma Inline (Ureal18);
1215 function Ureal21 (N : Node_Id) return Ureal;
1216 pragma Inline (Ureal21);
1218 function Flag4 (N : Node_Id) return Boolean;
1219 pragma Inline (Flag4);
1221 function Flag5 (N : Node_Id) return Boolean;
1222 pragma Inline (Flag5);
1224 function Flag6 (N : Node_Id) return Boolean;
1225 pragma Inline (Flag6);
1227 function Flag7 (N : Node_Id) return Boolean;
1228 pragma Inline (Flag7);
1230 function Flag8 (N : Node_Id) return Boolean;
1231 pragma Inline (Flag8);
1233 function Flag9 (N : Node_Id) return Boolean;
1234 pragma Inline (Flag9);
1236 function Flag10 (N : Node_Id) return Boolean;
1237 pragma Inline (Flag10);
1239 function Flag11 (N : Node_Id) return Boolean;
1240 pragma Inline (Flag11);
1242 function Flag12 (N : Node_Id) return Boolean;
1243 pragma Inline (Flag12);
1245 function Flag13 (N : Node_Id) return Boolean;
1246 pragma Inline (Flag13);
1248 function Flag14 (N : Node_Id) return Boolean;
1249 pragma Inline (Flag14);
1251 function Flag15 (N : Node_Id) return Boolean;
1252 pragma Inline (Flag15);
1254 function Flag16 (N : Node_Id) return Boolean;
1255 pragma Inline (Flag16);
1257 function Flag17 (N : Node_Id) return Boolean;
1258 pragma Inline (Flag17);
1260 function Flag18 (N : Node_Id) return Boolean;
1261 pragma Inline (Flag18);
1263 function Flag19 (N : Node_Id) return Boolean;
1264 pragma Inline (Flag19);
1266 function Flag20 (N : Node_Id) return Boolean;
1267 pragma Inline (Flag20);
1269 function Flag21 (N : Node_Id) return Boolean;
1270 pragma Inline (Flag21);
1272 function Flag22 (N : Node_Id) return Boolean;
1273 pragma Inline (Flag22);
1275 function Flag23 (N : Node_Id) return Boolean;
1276 pragma Inline (Flag23);
1278 function Flag24 (N : Node_Id) return Boolean;
1279 pragma Inline (Flag24);
1281 function Flag25 (N : Node_Id) return Boolean;
1282 pragma Inline (Flag25);
1284 function Flag26 (N : Node_Id) return Boolean;
1285 pragma Inline (Flag26);
1287 function Flag27 (N : Node_Id) return Boolean;
1288 pragma Inline (Flag27);
1290 function Flag28 (N : Node_Id) return Boolean;
1291 pragma Inline (Flag28);
1293 function Flag29 (N : Node_Id) return Boolean;
1294 pragma Inline (Flag29);
1296 function Flag30 (N : Node_Id) return Boolean;
1297 pragma Inline (Flag30);
1299 function Flag31 (N : Node_Id) return Boolean;
1300 pragma Inline (Flag31);
1302 function Flag32 (N : Node_Id) return Boolean;
1303 pragma Inline (Flag32);
1305 function Flag33 (N : Node_Id) return Boolean;
1306 pragma Inline (Flag33);
1308 function Flag34 (N : Node_Id) return Boolean;
1309 pragma Inline (Flag34);
1311 function Flag35 (N : Node_Id) return Boolean;
1312 pragma Inline (Flag35);
1314 function Flag36 (N : Node_Id) return Boolean;
1315 pragma Inline (Flag36);
1317 function Flag37 (N : Node_Id) return Boolean;
1318 pragma Inline (Flag37);
1320 function Flag38 (N : Node_Id) return Boolean;
1321 pragma Inline (Flag38);
1323 function Flag39 (N : Node_Id) return Boolean;
1324 pragma Inline (Flag39);
1326 function Flag40 (N : Node_Id) return Boolean;
1327 pragma Inline (Flag40);
1329 function Flag41 (N : Node_Id) return Boolean;
1330 pragma Inline (Flag41);
1332 function Flag42 (N : Node_Id) return Boolean;
1333 pragma Inline (Flag42);
1335 function Flag43 (N : Node_Id) return Boolean;
1336 pragma Inline (Flag43);
1338 function Flag44 (N : Node_Id) return Boolean;
1339 pragma Inline (Flag44);
1341 function Flag45 (N : Node_Id) return Boolean;
1342 pragma Inline (Flag45);
1344 function Flag46 (N : Node_Id) return Boolean;
1345 pragma Inline (Flag46);
1347 function Flag47 (N : Node_Id) return Boolean;
1348 pragma Inline (Flag47);
1350 function Flag48 (N : Node_Id) return Boolean;
1351 pragma Inline (Flag48);
1353 function Flag49 (N : Node_Id) return Boolean;
1354 pragma Inline (Flag49);
1356 function Flag50 (N : Node_Id) return Boolean;
1357 pragma Inline (Flag50);
1359 function Flag51 (N : Node_Id) return Boolean;
1360 pragma Inline (Flag51);
1362 function Flag52 (N : Node_Id) return Boolean;
1363 pragma Inline (Flag52);
1365 function Flag53 (N : Node_Id) return Boolean;
1366 pragma Inline (Flag53);
1368 function Flag54 (N : Node_Id) return Boolean;
1369 pragma Inline (Flag54);
1371 function Flag55 (N : Node_Id) return Boolean;
1372 pragma Inline (Flag55);
1374 function Flag56 (N : Node_Id) return Boolean;
1375 pragma Inline (Flag56);
1377 function Flag57 (N : Node_Id) return Boolean;
1378 pragma Inline (Flag57);
1380 function Flag58 (N : Node_Id) return Boolean;
1381 pragma Inline (Flag58);
1383 function Flag59 (N : Node_Id) return Boolean;
1384 pragma Inline (Flag59);
1386 function Flag60 (N : Node_Id) return Boolean;
1387 pragma Inline (Flag60);
1389 function Flag61 (N : Node_Id) return Boolean;
1390 pragma Inline (Flag61);
1392 function Flag62 (N : Node_Id) return Boolean;
1393 pragma Inline (Flag62);
1395 function Flag63 (N : Node_Id) return Boolean;
1396 pragma Inline (Flag63);
1398 function Flag64 (N : Node_Id) return Boolean;
1399 pragma Inline (Flag64);
1401 function Flag65 (N : Node_Id) return Boolean;
1402 pragma Inline (Flag65);
1404 function Flag66 (N : Node_Id) return Boolean;
1405 pragma Inline (Flag66);
1407 function Flag67 (N : Node_Id) return Boolean;
1408 pragma Inline (Flag67);
1410 function Flag68 (N : Node_Id) return Boolean;
1411 pragma Inline (Flag68);
1413 function Flag69 (N : Node_Id) return Boolean;
1414 pragma Inline (Flag69);
1416 function Flag70 (N : Node_Id) return Boolean;
1417 pragma Inline (Flag70);
1419 function Flag71 (N : Node_Id) return Boolean;
1420 pragma Inline (Flag71);
1422 function Flag72 (N : Node_Id) return Boolean;
1423 pragma Inline (Flag72);
1425 function Flag73 (N : Node_Id) return Boolean;
1426 pragma Inline (Flag73);
1428 function Flag74 (N : Node_Id) return Boolean;
1429 pragma Inline (Flag74);
1431 function Flag75 (N : Node_Id) return Boolean;
1432 pragma Inline (Flag75);
1434 function Flag76 (N : Node_Id) return Boolean;
1435 pragma Inline (Flag76);
1437 function Flag77 (N : Node_Id) return Boolean;
1438 pragma Inline (Flag77);
1440 function Flag78 (N : Node_Id) return Boolean;
1441 pragma Inline (Flag78);
1443 function Flag79 (N : Node_Id) return Boolean;
1444 pragma Inline (Flag79);
1446 function Flag80 (N : Node_Id) return Boolean;
1447 pragma Inline (Flag80);
1449 function Flag81 (N : Node_Id) return Boolean;
1450 pragma Inline (Flag81);
1452 function Flag82 (N : Node_Id) return Boolean;
1453 pragma Inline (Flag82);
1455 function Flag83 (N : Node_Id) return Boolean;
1456 pragma Inline (Flag83);
1458 function Flag84 (N : Node_Id) return Boolean;
1459 pragma Inline (Flag84);
1461 function Flag85 (N : Node_Id) return Boolean;
1462 pragma Inline (Flag85);
1464 function Flag86 (N : Node_Id) return Boolean;
1465 pragma Inline (Flag86);
1467 function Flag87 (N : Node_Id) return Boolean;
1468 pragma Inline (Flag87);
1470 function Flag88 (N : Node_Id) return Boolean;
1471 pragma Inline (Flag88);
1473 function Flag89 (N : Node_Id) return Boolean;
1474 pragma Inline (Flag89);
1476 function Flag90 (N : Node_Id) return Boolean;
1477 pragma Inline (Flag90);
1479 function Flag91 (N : Node_Id) return Boolean;
1480 pragma Inline (Flag91);
1482 function Flag92 (N : Node_Id) return Boolean;
1483 pragma Inline (Flag92);
1485 function Flag93 (N : Node_Id) return Boolean;
1486 pragma Inline (Flag93);
1488 function Flag94 (N : Node_Id) return Boolean;
1489 pragma Inline (Flag94);
1491 function Flag95 (N : Node_Id) return Boolean;
1492 pragma Inline (Flag95);
1494 function Flag96 (N : Node_Id) return Boolean;
1495 pragma Inline (Flag96);
1497 function Flag97 (N : Node_Id) return Boolean;
1498 pragma Inline (Flag97);
1500 function Flag98 (N : Node_Id) return Boolean;
1501 pragma Inline (Flag98);
1503 function Flag99 (N : Node_Id) return Boolean;
1504 pragma Inline (Flag99);
1506 function Flag100 (N : Node_Id) return Boolean;
1507 pragma Inline (Flag100);
1509 function Flag101 (N : Node_Id) return Boolean;
1510 pragma Inline (Flag101);
1512 function Flag102 (N : Node_Id) return Boolean;
1513 pragma Inline (Flag102);
1515 function Flag103 (N : Node_Id) return Boolean;
1516 pragma Inline (Flag103);
1518 function Flag104 (N : Node_Id) return Boolean;
1519 pragma Inline (Flag104);
1521 function Flag105 (N : Node_Id) return Boolean;
1522 pragma Inline (Flag105);
1524 function Flag106 (N : Node_Id) return Boolean;
1525 pragma Inline (Flag106);
1527 function Flag107 (N : Node_Id) return Boolean;
1528 pragma Inline (Flag107);
1530 function Flag108 (N : Node_Id) return Boolean;
1531 pragma Inline (Flag108);
1533 function Flag109 (N : Node_Id) return Boolean;
1534 pragma Inline (Flag109);
1536 function Flag110 (N : Node_Id) return Boolean;
1537 pragma Inline (Flag110);
1539 function Flag111 (N : Node_Id) return Boolean;
1540 pragma Inline (Flag111);
1542 function Flag112 (N : Node_Id) return Boolean;
1543 pragma Inline (Flag112);
1545 function Flag113 (N : Node_Id) return Boolean;
1546 pragma Inline (Flag113);
1548 function Flag114 (N : Node_Id) return Boolean;
1549 pragma Inline (Flag114);
1551 function Flag115 (N : Node_Id) return Boolean;
1552 pragma Inline (Flag115);
1554 function Flag116 (N : Node_Id) return Boolean;
1555 pragma Inline (Flag116);
1557 function Flag117 (N : Node_Id) return Boolean;
1558 pragma Inline (Flag117);
1560 function Flag118 (N : Node_Id) return Boolean;
1561 pragma Inline (Flag118);
1563 function Flag119 (N : Node_Id) return Boolean;
1564 pragma Inline (Flag119);
1566 function Flag120 (N : Node_Id) return Boolean;
1567 pragma Inline (Flag120);
1569 function Flag121 (N : Node_Id) return Boolean;
1570 pragma Inline (Flag121);
1572 function Flag122 (N : Node_Id) return Boolean;
1573 pragma Inline (Flag122);
1575 function Flag123 (N : Node_Id) return Boolean;
1576 pragma Inline (Flag123);
1578 function Flag124 (N : Node_Id) return Boolean;
1579 pragma Inline (Flag124);
1581 function Flag125 (N : Node_Id) return Boolean;
1582 pragma Inline (Flag125);
1584 function Flag126 (N : Node_Id) return Boolean;
1585 pragma Inline (Flag126);
1587 function Flag127 (N : Node_Id) return Boolean;
1588 pragma Inline (Flag127);
1590 function Flag128 (N : Node_Id) return Boolean;
1591 pragma Inline (Flag128);
1593 function Flag129 (N : Node_Id) return Boolean;
1594 pragma Inline (Flag129);
1596 function Flag130 (N : Node_Id) return Boolean;
1597 pragma Inline (Flag130);
1599 function Flag131 (N : Node_Id) return Boolean;
1600 pragma Inline (Flag131);
1602 function Flag132 (N : Node_Id) return Boolean;
1603 pragma Inline (Flag132);
1605 function Flag133 (N : Node_Id) return Boolean;
1606 pragma Inline (Flag133);
1608 function Flag134 (N : Node_Id) return Boolean;
1609 pragma Inline (Flag134);
1611 function Flag135 (N : Node_Id) return Boolean;
1612 pragma Inline (Flag135);
1614 function Flag136 (N : Node_Id) return Boolean;
1615 pragma Inline (Flag136);
1617 function Flag137 (N : Node_Id) return Boolean;
1618 pragma Inline (Flag137);
1620 function Flag138 (N : Node_Id) return Boolean;
1621 pragma Inline (Flag138);
1623 function Flag139 (N : Node_Id) return Boolean;
1624 pragma Inline (Flag139);
1626 function Flag140 (N : Node_Id) return Boolean;
1627 pragma Inline (Flag140);
1629 function Flag141 (N : Node_Id) return Boolean;
1630 pragma Inline (Flag141);
1632 function Flag142 (N : Node_Id) return Boolean;
1633 pragma Inline (Flag142);
1635 function Flag143 (N : Node_Id) return Boolean;
1636 pragma Inline (Flag143);
1638 function Flag144 (N : Node_Id) return Boolean;
1639 pragma Inline (Flag144);
1641 function Flag145 (N : Node_Id) return Boolean;
1642 pragma Inline (Flag145);
1644 function Flag146 (N : Node_Id) return Boolean;
1645 pragma Inline (Flag146);
1647 function Flag147 (N : Node_Id) return Boolean;
1648 pragma Inline (Flag147);
1650 function Flag148 (N : Node_Id) return Boolean;
1651 pragma Inline (Flag148);
1653 function Flag149 (N : Node_Id) return Boolean;
1654 pragma Inline (Flag149);
1656 function Flag150 (N : Node_Id) return Boolean;
1657 pragma Inline (Flag150);
1659 function Flag151 (N : Node_Id) return Boolean;
1660 pragma Inline (Flag151);
1662 function Flag152 (N : Node_Id) return Boolean;
1663 pragma Inline (Flag152);
1665 function Flag153 (N : Node_Id) return Boolean;
1666 pragma Inline (Flag153);
1668 function Flag154 (N : Node_Id) return Boolean;
1669 pragma Inline (Flag154);
1671 function Flag155 (N : Node_Id) return Boolean;
1672 pragma Inline (Flag155);
1674 function Flag156 (N : Node_Id) return Boolean;
1675 pragma Inline (Flag156);
1677 function Flag157 (N : Node_Id) return Boolean;
1678 pragma Inline (Flag157);
1680 function Flag158 (N : Node_Id) return Boolean;
1681 pragma Inline (Flag158);
1683 function Flag159 (N : Node_Id) return Boolean;
1684 pragma Inline (Flag159);
1686 function Flag160 (N : Node_Id) return Boolean;
1687 pragma Inline (Flag160);
1689 function Flag161 (N : Node_Id) return Boolean;
1690 pragma Inline (Flag161);
1692 function Flag162 (N : Node_Id) return Boolean;
1693 pragma Inline (Flag162);
1695 function Flag163 (N : Node_Id) return Boolean;
1696 pragma Inline (Flag163);
1698 function Flag164 (N : Node_Id) return Boolean;
1699 pragma Inline (Flag164);
1701 function Flag165 (N : Node_Id) return Boolean;
1702 pragma Inline (Flag165);
1704 function Flag166 (N : Node_Id) return Boolean;
1705 pragma Inline (Flag166);
1707 function Flag167 (N : Node_Id) return Boolean;
1708 pragma Inline (Flag167);
1710 function Flag168 (N : Node_Id) return Boolean;
1711 pragma Inline (Flag168);
1713 function Flag169 (N : Node_Id) return Boolean;
1714 pragma Inline (Flag169);
1716 function Flag170 (N : Node_Id) return Boolean;
1717 pragma Inline (Flag170);
1719 function Flag171 (N : Node_Id) return Boolean;
1720 pragma Inline (Flag171);
1722 function Flag172 (N : Node_Id) return Boolean;
1723 pragma Inline (Flag172);
1725 function Flag173 (N : Node_Id) return Boolean;
1726 pragma Inline (Flag173);
1728 function Flag174 (N : Node_Id) return Boolean;
1729 pragma Inline (Flag174);
1731 function Flag175 (N : Node_Id) return Boolean;
1732 pragma Inline (Flag175);
1734 function Flag176 (N : Node_Id) return Boolean;
1735 pragma Inline (Flag176);
1737 function Flag177 (N : Node_Id) return Boolean;
1738 pragma Inline (Flag177);
1740 function Flag178 (N : Node_Id) return Boolean;
1741 pragma Inline (Flag178);
1743 function Flag179 (N : Node_Id) return Boolean;
1744 pragma Inline (Flag179);
1746 function Flag180 (N : Node_Id) return Boolean;
1747 pragma Inline (Flag180);
1749 function Flag181 (N : Node_Id) return Boolean;
1750 pragma Inline (Flag181);
1752 function Flag182 (N : Node_Id) return Boolean;
1753 pragma Inline (Flag182);
1755 function Flag183 (N : Node_Id) return Boolean;
1756 pragma Inline (Flag183);
1758 function Flag184 (N : Node_Id) return Boolean;
1759 pragma Inline (Flag184);
1761 function Flag185 (N : Node_Id) return Boolean;
1762 pragma Inline (Flag185);
1764 function Flag186 (N : Node_Id) return Boolean;
1765 pragma Inline (Flag186);
1767 function Flag187 (N : Node_Id) return Boolean;
1768 pragma Inline (Flag187);
1770 function Flag188 (N : Node_Id) return Boolean;
1771 pragma Inline (Flag188);
1773 function Flag189 (N : Node_Id) return Boolean;
1774 pragma Inline (Flag189);
1776 function Flag190 (N : Node_Id) return Boolean;
1777 pragma Inline (Flag190);
1779 function Flag191 (N : Node_Id) return Boolean;
1780 pragma Inline (Flag191);
1782 function Flag192 (N : Node_Id) return Boolean;
1783 pragma Inline (Flag192);
1785 function Flag193 (N : Node_Id) return Boolean;
1786 pragma Inline (Flag193);
1788 function Flag194 (N : Node_Id) return Boolean;
1789 pragma Inline (Flag194);
1791 function Flag195 (N : Node_Id) return Boolean;
1792 pragma Inline (Flag195);
1794 function Flag196 (N : Node_Id) return Boolean;
1795 pragma Inline (Flag196);
1797 function Flag197 (N : Node_Id) return Boolean;
1798 pragma Inline (Flag197);
1800 function Flag198 (N : Node_Id) return Boolean;
1801 pragma Inline (Flag198);
1803 function Flag199 (N : Node_Id) return Boolean;
1804 pragma Inline (Flag199);
1806 function Flag200 (N : Node_Id) return Boolean;
1807 pragma Inline (Flag200);
1809 function Flag201 (N : Node_Id) return Boolean;
1810 pragma Inline (Flag201);
1812 function Flag202 (N : Node_Id) return Boolean;
1813 pragma Inline (Flag202);
1815 function Flag203 (N : Node_Id) return Boolean;
1816 pragma Inline (Flag203);
1818 function Flag204 (N : Node_Id) return Boolean;
1819 pragma Inline (Flag204);
1821 function Flag205 (N : Node_Id) return Boolean;
1822 pragma Inline (Flag205);
1824 function Flag206 (N : Node_Id) return Boolean;
1825 pragma Inline (Flag206);
1827 function Flag207 (N : Node_Id) return Boolean;
1828 pragma Inline (Flag207);
1830 function Flag208 (N : Node_Id) return Boolean;
1831 pragma Inline (Flag208);
1833 function Flag209 (N : Node_Id) return Boolean;
1834 pragma Inline (Flag209);
1836 function Flag210 (N : Node_Id) return Boolean;
1837 pragma Inline (Flag210);
1839 function Flag211 (N : Node_Id) return Boolean;
1840 pragma Inline (Flag211);
1842 function Flag212 (N : Node_Id) return Boolean;
1843 pragma Inline (Flag212);
1845 function Flag213 (N : Node_Id) return Boolean;
1846 pragma Inline (Flag213);
1848 function Flag214 (N : Node_Id) return Boolean;
1849 pragma Inline (Flag214);
1851 function Flag215 (N : Node_Id) return Boolean;
1852 pragma Inline (Flag215);
1854 function Flag216 (N : Node_Id) return Boolean;
1855 pragma Inline (Flag216);
1857 function Flag217 (N : Node_Id) return Boolean;
1858 pragma Inline (Flag217);
1860 function Flag218 (N : Node_Id) return Boolean;
1861 pragma Inline (Flag218);
1863 function Flag219 (N : Node_Id) return Boolean;
1864 pragma Inline (Flag219);
1866 function Flag220 (N : Node_Id) return Boolean;
1867 pragma Inline (Flag220);
1869 function Flag221 (N : Node_Id) return Boolean;
1870 pragma Inline (Flag221);
1872 function Flag222 (N : Node_Id) return Boolean;
1873 pragma Inline (Flag222);
1875 function Flag223 (N : Node_Id) return Boolean;
1876 pragma Inline (Flag223);
1878 function Flag224 (N : Node_Id) return Boolean;
1879 pragma Inline (Flag224);
1881 function Flag225 (N : Node_Id) return Boolean;
1882 pragma Inline (Flag225);
1884 function Flag226 (N : Node_Id) return Boolean;
1885 pragma Inline (Flag226);
1887 function Flag227 (N : Node_Id) return Boolean;
1888 pragma Inline (Flag227);
1890 function Flag228 (N : Node_Id) return Boolean;
1891 pragma Inline (Flag228);
1893 function Flag229 (N : Node_Id) return Boolean;
1894 pragma Inline (Flag229);
1896 function Flag230 (N : Node_Id) return Boolean;
1897 pragma Inline (Flag230);
1899 function Flag231 (N : Node_Id) return Boolean;
1900 pragma Inline (Flag231);
1902 function Flag232 (N : Node_Id) return Boolean;
1903 pragma Inline (Flag232);
1905 function Flag233 (N : Node_Id) return Boolean;
1906 pragma Inline (Flag233);
1908 function Flag234 (N : Node_Id) return Boolean;
1909 pragma Inline (Flag234);
1911 function Flag235 (N : Node_Id) return Boolean;
1912 pragma Inline (Flag235);
1914 function Flag236 (N : Node_Id) return Boolean;
1915 pragma Inline (Flag236);
1917 function Flag237 (N : Node_Id) return Boolean;
1918 pragma Inline (Flag237);
1920 function Flag238 (N : Node_Id) return Boolean;
1921 pragma Inline (Flag238);
1923 function Flag239 (N : Node_Id) return Boolean;
1924 pragma Inline (Flag239);
1926 function Flag240 (N : Node_Id) return Boolean;
1927 pragma Inline (Flag240);
1929 function Flag241 (N : Node_Id) return Boolean;
1930 pragma Inline (Flag241);
1932 function Flag242 (N : Node_Id) return Boolean;
1933 pragma Inline (Flag242);
1935 function Flag243 (N : Node_Id) return Boolean;
1936 pragma Inline (Flag243);
1938 function Flag244 (N : Node_Id) return Boolean;
1939 pragma Inline (Flag244);
1941 function Flag245 (N : Node_Id) return Boolean;
1942 pragma Inline (Flag245);
1944 function Flag246 (N : Node_Id) return Boolean;
1945 pragma Inline (Flag246);
1947 function Flag247 (N : Node_Id) return Boolean;
1948 pragma Inline (Flag247);
1950 function Flag248 (N : Node_Id) return Boolean;
1951 pragma Inline (Flag248);
1953 function Flag249 (N : Node_Id) return Boolean;
1954 pragma Inline (Flag249);
1956 function Flag250 (N : Node_Id) return Boolean;
1957 pragma Inline (Flag250);
1959 function Flag251 (N : Node_Id) return Boolean;
1960 pragma Inline (Flag251);
1962 function Flag252 (N : Node_Id) return Boolean;
1963 pragma Inline (Flag252);
1965 function Flag253 (N : Node_Id) return Boolean;
1966 pragma Inline (Flag253);
1968 function Flag254 (N : Node_Id) return Boolean;
1969 pragma Inline (Flag254);
1971 -- Procedures to set value of indicated field
1973 procedure Set_Nkind (N : Node_Id; Val : Node_Kind);
1974 pragma Inline (Set_Nkind);
1976 procedure Set_Field1 (N : Node_Id; Val : Union_Id);
1977 pragma Inline (Set_Field1);
1979 procedure Set_Field2 (N : Node_Id; Val : Union_Id);
1980 pragma Inline (Set_Field2);
1982 procedure Set_Field3 (N : Node_Id; Val : Union_Id);
1983 pragma Inline (Set_Field3);
1985 procedure Set_Field4 (N : Node_Id; Val : Union_Id);
1986 pragma Inline (Set_Field4);
1988 procedure Set_Field5 (N : Node_Id; Val : Union_Id);
1989 pragma Inline (Set_Field5);
1991 procedure Set_Field6 (N : Node_Id; Val : Union_Id);
1992 pragma Inline (Set_Field6);
1994 procedure Set_Field7 (N : Node_Id; Val : Union_Id);
1995 pragma Inline (Set_Field7);
1997 procedure Set_Field8 (N : Node_Id; Val : Union_Id);
1998 pragma Inline (Set_Field8);
2000 procedure Set_Field9 (N : Node_Id; Val : Union_Id);
2001 pragma Inline (Set_Field9);
2003 procedure Set_Field10 (N : Node_Id; Val : Union_Id);
2004 pragma Inline (Set_Field10);
2006 procedure Set_Field11 (N : Node_Id; Val : Union_Id);
2007 pragma Inline (Set_Field11);
2009 procedure Set_Field12 (N : Node_Id; Val : Union_Id);
2010 pragma Inline (Set_Field12);
2012 procedure Set_Field13 (N : Node_Id; Val : Union_Id);
2013 pragma Inline (Set_Field13);
2015 procedure Set_Field14 (N : Node_Id; Val : Union_Id);
2016 pragma Inline (Set_Field14);
2018 procedure Set_Field15 (N : Node_Id; Val : Union_Id);
2019 pragma Inline (Set_Field15);
2021 procedure Set_Field16 (N : Node_Id; Val : Union_Id);
2022 pragma Inline (Set_Field16);
2024 procedure Set_Field17 (N : Node_Id; Val : Union_Id);
2025 pragma Inline (Set_Field17);
2027 procedure Set_Field18 (N : Node_Id; Val : Union_Id);
2028 pragma Inline (Set_Field18);
2030 procedure Set_Field19 (N : Node_Id; Val : Union_Id);
2031 pragma Inline (Set_Field19);
2033 procedure Set_Field20 (N : Node_Id; Val : Union_Id);
2034 pragma Inline (Set_Field20);
2036 procedure Set_Field21 (N : Node_Id; Val : Union_Id);
2037 pragma Inline (Set_Field21);
2039 procedure Set_Field22 (N : Node_Id; Val : Union_Id);
2040 pragma Inline (Set_Field22);
2042 procedure Set_Field23 (N : Node_Id; Val : Union_Id);
2043 pragma Inline (Set_Field23);
2045 procedure Set_Field24 (N : Node_Id; Val : Union_Id);
2046 pragma Inline (Set_Field24);
2048 procedure Set_Field25 (N : Node_Id; Val : Union_Id);
2049 pragma Inline (Set_Field25);
2051 procedure Set_Field26 (N : Node_Id; Val : Union_Id);
2052 pragma Inline (Set_Field26);
2054 procedure Set_Field27 (N : Node_Id; Val : Union_Id);
2055 pragma Inline (Set_Field27);
2057 procedure Set_Field28 (N : Node_Id; Val : Union_Id);
2058 pragma Inline (Set_Field28);
2060 procedure Set_Field29 (N : Node_Id; Val : Union_Id);
2061 pragma Inline (Set_Field29);
2063 procedure Set_Node1 (N : Node_Id; Val : Node_Id);
2064 pragma Inline (Set_Node1);
2066 procedure Set_Node2 (N : Node_Id; Val : Node_Id);
2067 pragma Inline (Set_Node2);
2069 procedure Set_Node3 (N : Node_Id; Val : Node_Id);
2070 pragma Inline (Set_Node3);
2072 procedure Set_Node4 (N : Node_Id; Val : Node_Id);
2073 pragma Inline (Set_Node4);
2075 procedure Set_Node5 (N : Node_Id; Val : Node_Id);
2076 pragma Inline (Set_Node5);
2078 procedure Set_Node6 (N : Node_Id; Val : Node_Id);
2079 pragma Inline (Set_Node6);
2081 procedure Set_Node7 (N : Node_Id; Val : Node_Id);
2082 pragma Inline (Set_Node7);
2084 procedure Set_Node8 (N : Node_Id; Val : Node_Id);
2085 pragma Inline (Set_Node8);
2087 procedure Set_Node9 (N : Node_Id; Val : Node_Id);
2088 pragma Inline (Set_Node9);
2090 procedure Set_Node10 (N : Node_Id; Val : Node_Id);
2091 pragma Inline (Set_Node10);
2093 procedure Set_Node11 (N : Node_Id; Val : Node_Id);
2094 pragma Inline (Set_Node11);
2096 procedure Set_Node12 (N : Node_Id; Val : Node_Id);
2097 pragma Inline (Set_Node12);
2099 procedure Set_Node13 (N : Node_Id; Val : Node_Id);
2100 pragma Inline (Set_Node13);
2102 procedure Set_Node14 (N : Node_Id; Val : Node_Id);
2103 pragma Inline (Set_Node14);
2105 procedure Set_Node15 (N : Node_Id; Val : Node_Id);
2106 pragma Inline (Set_Node15);
2108 procedure Set_Node16 (N : Node_Id; Val : Node_Id);
2109 pragma Inline (Set_Node16);
2111 procedure Set_Node17 (N : Node_Id; Val : Node_Id);
2112 pragma Inline (Set_Node17);
2114 procedure Set_Node18 (N : Node_Id; Val : Node_Id);
2115 pragma Inline (Set_Node18);
2117 procedure Set_Node19 (N : Node_Id; Val : Node_Id);
2118 pragma Inline (Set_Node19);
2120 procedure Set_Node20 (N : Node_Id; Val : Node_Id);
2121 pragma Inline (Set_Node20);
2123 procedure Set_Node21 (N : Node_Id; Val : Node_Id);
2124 pragma Inline (Set_Node21);
2126 procedure Set_Node22 (N : Node_Id; Val : Node_Id);
2127 pragma Inline (Set_Node22);
2129 procedure Set_Node23 (N : Node_Id; Val : Node_Id);
2130 pragma Inline (Set_Node23);
2132 procedure Set_Node24 (N : Node_Id; Val : Node_Id);
2133 pragma Inline (Set_Node24);
2135 procedure Set_Node25 (N : Node_Id; Val : Node_Id);
2136 pragma Inline (Set_Node25);
2138 procedure Set_Node26 (N : Node_Id; Val : Node_Id);
2139 pragma Inline (Set_Node26);
2141 procedure Set_Node27 (N : Node_Id; Val : Node_Id);
2142 pragma Inline (Set_Node27);
2144 procedure Set_Node28 (N : Node_Id; Val : Node_Id);
2145 pragma Inline (Set_Node28);
2147 procedure Set_Node29 (N : Node_Id; Val : Node_Id);
2148 pragma Inline (Set_Node29);
2150 procedure Set_List1 (N : Node_Id; Val : List_Id);
2151 pragma Inline (Set_List1);
2153 procedure Set_List2 (N : Node_Id; Val : List_Id);
2154 pragma Inline (Set_List2);
2156 procedure Set_List3 (N : Node_Id; Val : List_Id);
2157 pragma Inline (Set_List3);
2159 procedure Set_List4 (N : Node_Id; Val : List_Id);
2160 pragma Inline (Set_List4);
2162 procedure Set_List5 (N : Node_Id; Val : List_Id);
2163 pragma Inline (Set_List5);
2165 procedure Set_List10 (N : Node_Id; Val : List_Id);
2166 pragma Inline (Set_List10);
2168 procedure Set_List14 (N : Node_Id; Val : List_Id);
2169 pragma Inline (Set_List14);
2171 procedure Set_List25 (N : Node_Id; Val : List_Id);
2172 pragma Inline (Set_List25);
2174 procedure Set_Elist1 (N : Node_Id; Val : Elist_Id);
2175 pragma Inline (Set_Elist1);
2177 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id);
2178 pragma Inline (Set_Elist2);
2180 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id);
2181 pragma Inline (Set_Elist3);
2183 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id);
2184 pragma Inline (Set_Elist4);
2186 procedure Set_Elist5 (N : Node_Id; Val : Elist_Id);
2187 pragma Inline (Set_Elist5);
2189 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id);
2190 pragma Inline (Set_Elist8);
2192 procedure Set_Elist10 (N : Node_Id; Val : Elist_Id);
2193 pragma Inline (Set_Elist10);
2195 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id);
2196 pragma Inline (Set_Elist13);
2198 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id);
2199 pragma Inline (Set_Elist15);
2201 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id);
2202 pragma Inline (Set_Elist16);
2204 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id);
2205 pragma Inline (Set_Elist18);
2207 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id);
2208 pragma Inline (Set_Elist21);
2210 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id);
2211 pragma Inline (Set_Elist23);
2213 procedure Set_Elist24 (N : Node_Id; Val : Elist_Id);
2214 pragma Inline (Set_Elist24);
2216 procedure Set_Elist25 (N : Node_Id; Val : Elist_Id);
2217 pragma Inline (Set_Elist25);
2219 procedure Set_Elist26 (N : Node_Id; Val : Elist_Id);
2220 pragma Inline (Set_Elist26);
2222 procedure Set_Name1 (N : Node_Id; Val : Name_Id);
2223 pragma Inline (Set_Name1);
2225 procedure Set_Name2 (N : Node_Id; Val : Name_Id);
2226 pragma Inline (Set_Name2);
2228 procedure Set_Str3 (N : Node_Id; Val : String_Id);
2229 pragma Inline (Set_Str3);
2231 procedure Set_Uint2 (N : Node_Id; Val : Uint);
2232 pragma Inline (Set_Uint2);
2234 procedure Set_Uint3 (N : Node_Id; Val : Uint);
2235 pragma Inline (Set_Uint3);
2237 procedure Set_Uint4 (N : Node_Id; Val : Uint);
2238 pragma Inline (Set_Uint4);
2240 procedure Set_Uint5 (N : Node_Id; Val : Uint);
2241 pragma Inline (Set_Uint5);
2243 procedure Set_Uint8 (N : Node_Id; Val : Uint);
2244 pragma Inline (Set_Uint8);
2246 procedure Set_Uint9 (N : Node_Id; Val : Uint);
2247 pragma Inline (Set_Uint9);
2249 procedure Set_Uint10 (N : Node_Id; Val : Uint);
2250 pragma Inline (Set_Uint10);
2252 procedure Set_Uint11 (N : Node_Id; Val : Uint);
2253 pragma Inline (Set_Uint11);
2255 procedure Set_Uint12 (N : Node_Id; Val : Uint);
2256 pragma Inline (Set_Uint12);
2258 procedure Set_Uint13 (N : Node_Id; Val : Uint);
2259 pragma Inline (Set_Uint13);
2261 procedure Set_Uint14 (N : Node_Id; Val : Uint);
2262 pragma Inline (Set_Uint14);
2264 procedure Set_Uint15 (N : Node_Id; Val : Uint);
2265 pragma Inline (Set_Uint15);
2267 procedure Set_Uint16 (N : Node_Id; Val : Uint);
2268 pragma Inline (Set_Uint16);
2270 procedure Set_Uint17 (N : Node_Id; Val : Uint);
2271 pragma Inline (Set_Uint17);
2273 procedure Set_Uint22 (N : Node_Id; Val : Uint);
2274 pragma Inline (Set_Uint22);
2276 procedure Set_Ureal3 (N : Node_Id; Val : Ureal);
2277 pragma Inline (Set_Ureal3);
2279 procedure Set_Ureal18 (N : Node_Id; Val : Ureal);
2280 pragma Inline (Set_Ureal18);
2282 procedure Set_Ureal21 (N : Node_Id; Val : Ureal);
2283 pragma Inline (Set_Ureal21);
2285 procedure Set_Flag4 (N : Node_Id; Val : Boolean);
2286 pragma Inline (Set_Flag4);
2288 procedure Set_Flag5 (N : Node_Id; Val : Boolean);
2289 pragma Inline (Set_Flag5);
2291 procedure Set_Flag6 (N : Node_Id; Val : Boolean);
2292 pragma Inline (Set_Flag6);
2294 procedure Set_Flag7 (N : Node_Id; Val : Boolean);
2295 pragma Inline (Set_Flag7);
2297 procedure Set_Flag8 (N : Node_Id; Val : Boolean);
2298 pragma Inline (Set_Flag8);
2300 procedure Set_Flag9 (N : Node_Id; Val : Boolean);
2301 pragma Inline (Set_Flag9);
2303 procedure Set_Flag10 (N : Node_Id; Val : Boolean);
2304 pragma Inline (Set_Flag10);
2306 procedure Set_Flag11 (N : Node_Id; Val : Boolean);
2307 pragma Inline (Set_Flag11);
2309 procedure Set_Flag12 (N : Node_Id; Val : Boolean);
2310 pragma Inline (Set_Flag12);
2312 procedure Set_Flag13 (N : Node_Id; Val : Boolean);
2313 pragma Inline (Set_Flag13);
2315 procedure Set_Flag14 (N : Node_Id; Val : Boolean);
2316 pragma Inline (Set_Flag14);
2318 procedure Set_Flag15 (N : Node_Id; Val : Boolean);
2319 pragma Inline (Set_Flag15);
2321 procedure Set_Flag16 (N : Node_Id; Val : Boolean);
2322 pragma Inline (Set_Flag16);
2324 procedure Set_Flag17 (N : Node_Id; Val : Boolean);
2325 pragma Inline (Set_Flag17);
2327 procedure Set_Flag18 (N : Node_Id; Val : Boolean);
2328 pragma Inline (Set_Flag18);
2330 procedure Set_Flag19 (N : Node_Id; Val : Boolean);
2331 pragma Inline (Set_Flag19);
2333 procedure Set_Flag20 (N : Node_Id; Val : Boolean);
2334 pragma Inline (Set_Flag20);
2336 procedure Set_Flag21 (N : Node_Id; Val : Boolean);
2337 pragma Inline (Set_Flag21);
2339 procedure Set_Flag22 (N : Node_Id; Val : Boolean);
2340 pragma Inline (Set_Flag22);
2342 procedure Set_Flag23 (N : Node_Id; Val : Boolean);
2343 pragma Inline (Set_Flag23);
2345 procedure Set_Flag24 (N : Node_Id; Val : Boolean);
2346 pragma Inline (Set_Flag24);
2348 procedure Set_Flag25 (N : Node_Id; Val : Boolean);
2349 pragma Inline (Set_Flag25);
2351 procedure Set_Flag26 (N : Node_Id; Val : Boolean);
2352 pragma Inline (Set_Flag26);
2354 procedure Set_Flag27 (N : Node_Id; Val : Boolean);
2355 pragma Inline (Set_Flag27);
2357 procedure Set_Flag28 (N : Node_Id; Val : Boolean);
2358 pragma Inline (Set_Flag28);
2360 procedure Set_Flag29 (N : Node_Id; Val : Boolean);
2361 pragma Inline (Set_Flag29);
2363 procedure Set_Flag30 (N : Node_Id; Val : Boolean);
2364 pragma Inline (Set_Flag30);
2366 procedure Set_Flag31 (N : Node_Id; Val : Boolean);
2367 pragma Inline (Set_Flag31);
2369 procedure Set_Flag32 (N : Node_Id; Val : Boolean);
2370 pragma Inline (Set_Flag32);
2372 procedure Set_Flag33 (N : Node_Id; Val : Boolean);
2373 pragma Inline (Set_Flag33);
2375 procedure Set_Flag34 (N : Node_Id; Val : Boolean);
2376 pragma Inline (Set_Flag34);
2378 procedure Set_Flag35 (N : Node_Id; Val : Boolean);
2379 pragma Inline (Set_Flag35);
2381 procedure Set_Flag36 (N : Node_Id; Val : Boolean);
2382 pragma Inline (Set_Flag36);
2384 procedure Set_Flag37 (N : Node_Id; Val : Boolean);
2385 pragma Inline (Set_Flag37);
2387 procedure Set_Flag38 (N : Node_Id; Val : Boolean);
2388 pragma Inline (Set_Flag38);
2390 procedure Set_Flag39 (N : Node_Id; Val : Boolean);
2391 pragma Inline (Set_Flag39);
2393 procedure Set_Flag40 (N : Node_Id; Val : Boolean);
2394 pragma Inline (Set_Flag40);
2396 procedure Set_Flag41 (N : Node_Id; Val : Boolean);
2397 pragma Inline (Set_Flag41);
2399 procedure Set_Flag42 (N : Node_Id; Val : Boolean);
2400 pragma Inline (Set_Flag42);
2402 procedure Set_Flag43 (N : Node_Id; Val : Boolean);
2403 pragma Inline (Set_Flag43);
2405 procedure Set_Flag44 (N : Node_Id; Val : Boolean);
2406 pragma Inline (Set_Flag44);
2408 procedure Set_Flag45 (N : Node_Id; Val : Boolean);
2409 pragma Inline (Set_Flag45);
2411 procedure Set_Flag46 (N : Node_Id; Val : Boolean);
2412 pragma Inline (Set_Flag46);
2414 procedure Set_Flag47 (N : Node_Id; Val : Boolean);
2415 pragma Inline (Set_Flag47);
2417 procedure Set_Flag48 (N : Node_Id; Val : Boolean);
2418 pragma Inline (Set_Flag48);
2420 procedure Set_Flag49 (N : Node_Id; Val : Boolean);
2421 pragma Inline (Set_Flag49);
2423 procedure Set_Flag50 (N : Node_Id; Val : Boolean);
2424 pragma Inline (Set_Flag50);
2426 procedure Set_Flag51 (N : Node_Id; Val : Boolean);
2427 pragma Inline (Set_Flag51);
2429 procedure Set_Flag52 (N : Node_Id; Val : Boolean);
2430 pragma Inline (Set_Flag52);
2432 procedure Set_Flag53 (N : Node_Id; Val : Boolean);
2433 pragma Inline (Set_Flag53);
2435 procedure Set_Flag54 (N : Node_Id; Val : Boolean);
2436 pragma Inline (Set_Flag54);
2438 procedure Set_Flag55 (N : Node_Id; Val : Boolean);
2439 pragma Inline (Set_Flag55);
2441 procedure Set_Flag56 (N : Node_Id; Val : Boolean);
2442 pragma Inline (Set_Flag56);
2444 procedure Set_Flag57 (N : Node_Id; Val : Boolean);
2445 pragma Inline (Set_Flag57);
2447 procedure Set_Flag58 (N : Node_Id; Val : Boolean);
2448 pragma Inline (Set_Flag58);
2450 procedure Set_Flag59 (N : Node_Id; Val : Boolean);
2451 pragma Inline (Set_Flag59);
2453 procedure Set_Flag60 (N : Node_Id; Val : Boolean);
2454 pragma Inline (Set_Flag60);
2456 procedure Set_Flag61 (N : Node_Id; Val : Boolean);
2457 pragma Inline (Set_Flag61);
2459 procedure Set_Flag62 (N : Node_Id; Val : Boolean);
2460 pragma Inline (Set_Flag62);
2462 procedure Set_Flag63 (N : Node_Id; Val : Boolean);
2463 pragma Inline (Set_Flag63);
2465 procedure Set_Flag64 (N : Node_Id; Val : Boolean);
2466 pragma Inline (Set_Flag64);
2468 procedure Set_Flag65 (N : Node_Id; Val : Boolean);
2469 pragma Inline (Set_Flag65);
2471 procedure Set_Flag66 (N : Node_Id; Val : Boolean);
2472 pragma Inline (Set_Flag66);
2474 procedure Set_Flag67 (N : Node_Id; Val : Boolean);
2475 pragma Inline (Set_Flag67);
2477 procedure Set_Flag68 (N : Node_Id; Val : Boolean);
2478 pragma Inline (Set_Flag68);
2480 procedure Set_Flag69 (N : Node_Id; Val : Boolean);
2481 pragma Inline (Set_Flag69);
2483 procedure Set_Flag70 (N : Node_Id; Val : Boolean);
2484 pragma Inline (Set_Flag70);
2486 procedure Set_Flag71 (N : Node_Id; Val : Boolean);
2487 pragma Inline (Set_Flag71);
2489 procedure Set_Flag72 (N : Node_Id; Val : Boolean);
2490 pragma Inline (Set_Flag72);
2492 procedure Set_Flag73 (N : Node_Id; Val : Boolean);
2493 pragma Inline (Set_Flag73);
2495 procedure Set_Flag74 (N : Node_Id; Val : Boolean);
2496 pragma Inline (Set_Flag74);
2498 procedure Set_Flag75 (N : Node_Id; Val : Boolean);
2499 pragma Inline (Set_Flag75);
2501 procedure Set_Flag76 (N : Node_Id; Val : Boolean);
2502 pragma Inline (Set_Flag76);
2504 procedure Set_Flag77 (N : Node_Id; Val : Boolean);
2505 pragma Inline (Set_Flag77);
2507 procedure Set_Flag78 (N : Node_Id; Val : Boolean);
2508 pragma Inline (Set_Flag78);
2510 procedure Set_Flag79 (N : Node_Id; Val : Boolean);
2511 pragma Inline (Set_Flag79);
2513 procedure Set_Flag80 (N : Node_Id; Val : Boolean);
2514 pragma Inline (Set_Flag80);
2516 procedure Set_Flag81 (N : Node_Id; Val : Boolean);
2517 pragma Inline (Set_Flag81);
2519 procedure Set_Flag82 (N : Node_Id; Val : Boolean);
2520 pragma Inline (Set_Flag82);
2522 procedure Set_Flag83 (N : Node_Id; Val : Boolean);
2523 pragma Inline (Set_Flag83);
2525 procedure Set_Flag84 (N : Node_Id; Val : Boolean);
2526 pragma Inline (Set_Flag84);
2528 procedure Set_Flag85 (N : Node_Id; Val : Boolean);
2529 pragma Inline (Set_Flag85);
2531 procedure Set_Flag86 (N : Node_Id; Val : Boolean);
2532 pragma Inline (Set_Flag86);
2534 procedure Set_Flag87 (N : Node_Id; Val : Boolean);
2535 pragma Inline (Set_Flag87);
2537 procedure Set_Flag88 (N : Node_Id; Val : Boolean);
2538 pragma Inline (Set_Flag88);
2540 procedure Set_Flag89 (N : Node_Id; Val : Boolean);
2541 pragma Inline (Set_Flag89);
2543 procedure Set_Flag90 (N : Node_Id; Val : Boolean);
2544 pragma Inline (Set_Flag90);
2546 procedure Set_Flag91 (N : Node_Id; Val : Boolean);
2547 pragma Inline (Set_Flag91);
2549 procedure Set_Flag92 (N : Node_Id; Val : Boolean);
2550 pragma Inline (Set_Flag92);
2552 procedure Set_Flag93 (N : Node_Id; Val : Boolean);
2553 pragma Inline (Set_Flag93);
2555 procedure Set_Flag94 (N : Node_Id; Val : Boolean);
2556 pragma Inline (Set_Flag94);
2558 procedure Set_Flag95 (N : Node_Id; Val : Boolean);
2559 pragma Inline (Set_Flag95);
2561 procedure Set_Flag96 (N : Node_Id; Val : Boolean);
2562 pragma Inline (Set_Flag96);
2564 procedure Set_Flag97 (N : Node_Id; Val : Boolean);
2565 pragma Inline (Set_Flag97);
2567 procedure Set_Flag98 (N : Node_Id; Val : Boolean);
2568 pragma Inline (Set_Flag98);
2570 procedure Set_Flag99 (N : Node_Id; Val : Boolean);
2571 pragma Inline (Set_Flag99);
2573 procedure Set_Flag100 (N : Node_Id; Val : Boolean);
2574 pragma Inline (Set_Flag100);
2576 procedure Set_Flag101 (N : Node_Id; Val : Boolean);
2577 pragma Inline (Set_Flag101);
2579 procedure Set_Flag102 (N : Node_Id; Val : Boolean);
2580 pragma Inline (Set_Flag102);
2582 procedure Set_Flag103 (N : Node_Id; Val : Boolean);
2583 pragma Inline (Set_Flag103);
2585 procedure Set_Flag104 (N : Node_Id; Val : Boolean);
2586 pragma Inline (Set_Flag104);
2588 procedure Set_Flag105 (N : Node_Id; Val : Boolean);
2589 pragma Inline (Set_Flag105);
2591 procedure Set_Flag106 (N : Node_Id; Val : Boolean);
2592 pragma Inline (Set_Flag106);
2594 procedure Set_Flag107 (N : Node_Id; Val : Boolean);
2595 pragma Inline (Set_Flag107);
2597 procedure Set_Flag108 (N : Node_Id; Val : Boolean);
2598 pragma Inline (Set_Flag108);
2600 procedure Set_Flag109 (N : Node_Id; Val : Boolean);
2601 pragma Inline (Set_Flag109);
2603 procedure Set_Flag110 (N : Node_Id; Val : Boolean);
2604 pragma Inline (Set_Flag110);
2606 procedure Set_Flag111 (N : Node_Id; Val : Boolean);
2607 pragma Inline (Set_Flag111);
2609 procedure Set_Flag112 (N : Node_Id; Val : Boolean);
2610 pragma Inline (Set_Flag112);
2612 procedure Set_Flag113 (N : Node_Id; Val : Boolean);
2613 pragma Inline (Set_Flag113);
2615 procedure Set_Flag114 (N : Node_Id; Val : Boolean);
2616 pragma Inline (Set_Flag114);
2618 procedure Set_Flag115 (N : Node_Id; Val : Boolean);
2619 pragma Inline (Set_Flag115);
2621 procedure Set_Flag116 (N : Node_Id; Val : Boolean);
2622 pragma Inline (Set_Flag116);
2624 procedure Set_Flag117 (N : Node_Id; Val : Boolean);
2625 pragma Inline (Set_Flag117);
2627 procedure Set_Flag118 (N : Node_Id; Val : Boolean);
2628 pragma Inline (Set_Flag118);
2630 procedure Set_Flag119 (N : Node_Id; Val : Boolean);
2631 pragma Inline (Set_Flag119);
2633 procedure Set_Flag120 (N : Node_Id; Val : Boolean);
2634 pragma Inline (Set_Flag120);
2636 procedure Set_Flag121 (N : Node_Id; Val : Boolean);
2637 pragma Inline (Set_Flag121);
2639 procedure Set_Flag122 (N : Node_Id; Val : Boolean);
2640 pragma Inline (Set_Flag122);
2642 procedure Set_Flag123 (N : Node_Id; Val : Boolean);
2643 pragma Inline (Set_Flag123);
2645 procedure Set_Flag124 (N : Node_Id; Val : Boolean);
2646 pragma Inline (Set_Flag124);
2648 procedure Set_Flag125 (N : Node_Id; Val : Boolean);
2649 pragma Inline (Set_Flag125);
2651 procedure Set_Flag126 (N : Node_Id; Val : Boolean);
2652 pragma Inline (Set_Flag126);
2654 procedure Set_Flag127 (N : Node_Id; Val : Boolean);
2655 pragma Inline (Set_Flag127);
2657 procedure Set_Flag128 (N : Node_Id; Val : Boolean);
2658 pragma Inline (Set_Flag128);
2660 procedure Set_Flag129 (N : Node_Id; Val : Boolean);
2661 pragma Inline (Set_Flag129);
2663 procedure Set_Flag130 (N : Node_Id; Val : Boolean);
2664 pragma Inline (Set_Flag130);
2666 procedure Set_Flag131 (N : Node_Id; Val : Boolean);
2667 pragma Inline (Set_Flag131);
2669 procedure Set_Flag132 (N : Node_Id; Val : Boolean);
2670 pragma Inline (Set_Flag132);
2672 procedure Set_Flag133 (N : Node_Id; Val : Boolean);
2673 pragma Inline (Set_Flag133);
2675 procedure Set_Flag134 (N : Node_Id; Val : Boolean);
2676 pragma Inline (Set_Flag134);
2678 procedure Set_Flag135 (N : Node_Id; Val : Boolean);
2679 pragma Inline (Set_Flag135);
2681 procedure Set_Flag136 (N : Node_Id; Val : Boolean);
2682 pragma Inline (Set_Flag136);
2684 procedure Set_Flag137 (N : Node_Id; Val : Boolean);
2685 pragma Inline (Set_Flag137);
2687 procedure Set_Flag138 (N : Node_Id; Val : Boolean);
2688 pragma Inline (Set_Flag138);
2690 procedure Set_Flag139 (N : Node_Id; Val : Boolean);
2691 pragma Inline (Set_Flag139);
2693 procedure Set_Flag140 (N : Node_Id; Val : Boolean);
2694 pragma Inline (Set_Flag140);
2696 procedure Set_Flag141 (N : Node_Id; Val : Boolean);
2697 pragma Inline (Set_Flag141);
2699 procedure Set_Flag142 (N : Node_Id; Val : Boolean);
2700 pragma Inline (Set_Flag142);
2702 procedure Set_Flag143 (N : Node_Id; Val : Boolean);
2703 pragma Inline (Set_Flag143);
2705 procedure Set_Flag144 (N : Node_Id; Val : Boolean);
2706 pragma Inline (Set_Flag144);
2708 procedure Set_Flag145 (N : Node_Id; Val : Boolean);
2709 pragma Inline (Set_Flag145);
2711 procedure Set_Flag146 (N : Node_Id; Val : Boolean);
2712 pragma Inline (Set_Flag146);
2714 procedure Set_Flag147 (N : Node_Id; Val : Boolean);
2715 pragma Inline (Set_Flag147);
2717 procedure Set_Flag148 (N : Node_Id; Val : Boolean);
2718 pragma Inline (Set_Flag148);
2720 procedure Set_Flag149 (N : Node_Id; Val : Boolean);
2721 pragma Inline (Set_Flag149);
2723 procedure Set_Flag150 (N : Node_Id; Val : Boolean);
2724 pragma Inline (Set_Flag150);
2726 procedure Set_Flag151 (N : Node_Id; Val : Boolean);
2727 pragma Inline (Set_Flag151);
2729 procedure Set_Flag152 (N : Node_Id; Val : Boolean);
2730 pragma Inline (Set_Flag152);
2732 procedure Set_Flag153 (N : Node_Id; Val : Boolean);
2733 pragma Inline (Set_Flag153);
2735 procedure Set_Flag154 (N : Node_Id; Val : Boolean);
2736 pragma Inline (Set_Flag154);
2738 procedure Set_Flag155 (N : Node_Id; Val : Boolean);
2739 pragma Inline (Set_Flag155);
2741 procedure Set_Flag156 (N : Node_Id; Val : Boolean);
2742 pragma Inline (Set_Flag156);
2744 procedure Set_Flag157 (N : Node_Id; Val : Boolean);
2745 pragma Inline (Set_Flag157);
2747 procedure Set_Flag158 (N : Node_Id; Val : Boolean);
2748 pragma Inline (Set_Flag158);
2750 procedure Set_Flag159 (N : Node_Id; Val : Boolean);
2751 pragma Inline (Set_Flag159);
2753 procedure Set_Flag160 (N : Node_Id; Val : Boolean);
2754 pragma Inline (Set_Flag160);
2756 procedure Set_Flag161 (N : Node_Id; Val : Boolean);
2757 pragma Inline (Set_Flag161);
2759 procedure Set_Flag162 (N : Node_Id; Val : Boolean);
2760 pragma Inline (Set_Flag162);
2762 procedure Set_Flag163 (N : Node_Id; Val : Boolean);
2763 pragma Inline (Set_Flag163);
2765 procedure Set_Flag164 (N : Node_Id; Val : Boolean);
2766 pragma Inline (Set_Flag164);
2768 procedure Set_Flag165 (N : Node_Id; Val : Boolean);
2769 pragma Inline (Set_Flag165);
2771 procedure Set_Flag166 (N : Node_Id; Val : Boolean);
2772 pragma Inline (Set_Flag166);
2774 procedure Set_Flag167 (N : Node_Id; Val : Boolean);
2775 pragma Inline (Set_Flag167);
2777 procedure Set_Flag168 (N : Node_Id; Val : Boolean);
2778 pragma Inline (Set_Flag168);
2780 procedure Set_Flag169 (N : Node_Id; Val : Boolean);
2781 pragma Inline (Set_Flag169);
2783 procedure Set_Flag170 (N : Node_Id; Val : Boolean);
2784 pragma Inline (Set_Flag170);
2786 procedure Set_Flag171 (N : Node_Id; Val : Boolean);
2787 pragma Inline (Set_Flag171);
2789 procedure Set_Flag172 (N : Node_Id; Val : Boolean);
2790 pragma Inline (Set_Flag172);
2792 procedure Set_Flag173 (N : Node_Id; Val : Boolean);
2793 pragma Inline (Set_Flag173);
2795 procedure Set_Flag174 (N : Node_Id; Val : Boolean);
2796 pragma Inline (Set_Flag174);
2798 procedure Set_Flag175 (N : Node_Id; Val : Boolean);
2799 pragma Inline (Set_Flag175);
2801 procedure Set_Flag176 (N : Node_Id; Val : Boolean);
2802 pragma Inline (Set_Flag176);
2804 procedure Set_Flag177 (N : Node_Id; Val : Boolean);
2805 pragma Inline (Set_Flag177);
2807 procedure Set_Flag178 (N : Node_Id; Val : Boolean);
2808 pragma Inline (Set_Flag178);
2810 procedure Set_Flag179 (N : Node_Id; Val : Boolean);
2811 pragma Inline (Set_Flag179);
2813 procedure Set_Flag180 (N : Node_Id; Val : Boolean);
2814 pragma Inline (Set_Flag180);
2816 procedure Set_Flag181 (N : Node_Id; Val : Boolean);
2817 pragma Inline (Set_Flag181);
2819 procedure Set_Flag182 (N : Node_Id; Val : Boolean);
2820 pragma Inline (Set_Flag182);
2822 procedure Set_Flag183 (N : Node_Id; Val : Boolean);
2823 pragma Inline (Set_Flag183);
2825 procedure Set_Flag184 (N : Node_Id; Val : Boolean);
2826 pragma Inline (Set_Flag184);
2828 procedure Set_Flag185 (N : Node_Id; Val : Boolean);
2829 pragma Inline (Set_Flag185);
2831 procedure Set_Flag186 (N : Node_Id; Val : Boolean);
2832 pragma Inline (Set_Flag186);
2834 procedure Set_Flag187 (N : Node_Id; Val : Boolean);
2835 pragma Inline (Set_Flag187);
2837 procedure Set_Flag188 (N : Node_Id; Val : Boolean);
2838 pragma Inline (Set_Flag188);
2840 procedure Set_Flag189 (N : Node_Id; Val : Boolean);
2841 pragma Inline (Set_Flag189);
2843 procedure Set_Flag190 (N : Node_Id; Val : Boolean);
2844 pragma Inline (Set_Flag190);
2846 procedure Set_Flag191 (N : Node_Id; Val : Boolean);
2847 pragma Inline (Set_Flag191);
2849 procedure Set_Flag192 (N : Node_Id; Val : Boolean);
2850 pragma Inline (Set_Flag192);
2852 procedure Set_Flag193 (N : Node_Id; Val : Boolean);
2853 pragma Inline (Set_Flag193);
2855 procedure Set_Flag194 (N : Node_Id; Val : Boolean);
2856 pragma Inline (Set_Flag194);
2858 procedure Set_Flag195 (N : Node_Id; Val : Boolean);
2859 pragma Inline (Set_Flag195);
2861 procedure Set_Flag196 (N : Node_Id; Val : Boolean);
2862 pragma Inline (Set_Flag196);
2864 procedure Set_Flag197 (N : Node_Id; Val : Boolean);
2865 pragma Inline (Set_Flag197);
2867 procedure Set_Flag198 (N : Node_Id; Val : Boolean);
2868 pragma Inline (Set_Flag198);
2870 procedure Set_Flag199 (N : Node_Id; Val : Boolean);
2871 pragma Inline (Set_Flag199);
2873 procedure Set_Flag200 (N : Node_Id; Val : Boolean);
2874 pragma Inline (Set_Flag200);
2876 procedure Set_Flag201 (N : Node_Id; Val : Boolean);
2877 pragma Inline (Set_Flag201);
2879 procedure Set_Flag202 (N : Node_Id; Val : Boolean);
2880 pragma Inline (Set_Flag202);
2882 procedure Set_Flag203 (N : Node_Id; Val : Boolean);
2883 pragma Inline (Set_Flag203);
2885 procedure Set_Flag204 (N : Node_Id; Val : Boolean);
2886 pragma Inline (Set_Flag204);
2888 procedure Set_Flag205 (N : Node_Id; Val : Boolean);
2889 pragma Inline (Set_Flag205);
2891 procedure Set_Flag206 (N : Node_Id; Val : Boolean);
2892 pragma Inline (Set_Flag206);
2894 procedure Set_Flag207 (N : Node_Id; Val : Boolean);
2895 pragma Inline (Set_Flag207);
2897 procedure Set_Flag208 (N : Node_Id; Val : Boolean);
2898 pragma Inline (Set_Flag208);
2900 procedure Set_Flag209 (N : Node_Id; Val : Boolean);
2901 pragma Inline (Set_Flag209);
2903 procedure Set_Flag210 (N : Node_Id; Val : Boolean);
2904 pragma Inline (Set_Flag210);
2906 procedure Set_Flag211 (N : Node_Id; Val : Boolean);
2907 pragma Inline (Set_Flag211);
2909 procedure Set_Flag212 (N : Node_Id; Val : Boolean);
2910 pragma Inline (Set_Flag212);
2912 procedure Set_Flag213 (N : Node_Id; Val : Boolean);
2913 pragma Inline (Set_Flag213);
2915 procedure Set_Flag214 (N : Node_Id; Val : Boolean);
2916 pragma Inline (Set_Flag214);
2918 procedure Set_Flag215 (N : Node_Id; Val : Boolean);
2919 pragma Inline (Set_Flag215);
2921 procedure Set_Flag216 (N : Node_Id; Val : Boolean);
2922 pragma Inline (Set_Flag216);
2924 procedure Set_Flag217 (N : Node_Id; Val : Boolean);
2925 pragma Inline (Set_Flag217);
2927 procedure Set_Flag218 (N : Node_Id; Val : Boolean);
2928 pragma Inline (Set_Flag218);
2930 procedure Set_Flag219 (N : Node_Id; Val : Boolean);
2931 pragma Inline (Set_Flag219);
2933 procedure Set_Flag220 (N : Node_Id; Val : Boolean);
2934 pragma Inline (Set_Flag220);
2936 procedure Set_Flag221 (N : Node_Id; Val : Boolean);
2937 pragma Inline (Set_Flag221);
2939 procedure Set_Flag222 (N : Node_Id; Val : Boolean);
2940 pragma Inline (Set_Flag222);
2942 procedure Set_Flag223 (N : Node_Id; Val : Boolean);
2943 pragma Inline (Set_Flag223);
2945 procedure Set_Flag224 (N : Node_Id; Val : Boolean);
2946 pragma Inline (Set_Flag224);
2948 procedure Set_Flag225 (N : Node_Id; Val : Boolean);
2949 pragma Inline (Set_Flag225);
2951 procedure Set_Flag226 (N : Node_Id; Val : Boolean);
2952 pragma Inline (Set_Flag226);
2954 procedure Set_Flag227 (N : Node_Id; Val : Boolean);
2955 pragma Inline (Set_Flag227);
2957 procedure Set_Flag228 (N : Node_Id; Val : Boolean);
2958 pragma Inline (Set_Flag228);
2960 procedure Set_Flag229 (N : Node_Id; Val : Boolean);
2961 pragma Inline (Set_Flag229);
2963 procedure Set_Flag230 (N : Node_Id; Val : Boolean);
2964 pragma Inline (Set_Flag230);
2966 procedure Set_Flag231 (N : Node_Id; Val : Boolean);
2967 pragma Inline (Set_Flag231);
2969 procedure Set_Flag232 (N : Node_Id; Val : Boolean);
2970 pragma Inline (Set_Flag232);
2972 procedure Set_Flag233 (N : Node_Id; Val : Boolean);
2973 pragma Inline (Set_Flag233);
2975 procedure Set_Flag234 (N : Node_Id; Val : Boolean);
2976 pragma Inline (Set_Flag234);
2978 procedure Set_Flag235 (N : Node_Id; Val : Boolean);
2979 pragma Inline (Set_Flag235);
2981 procedure Set_Flag236 (N : Node_Id; Val : Boolean);
2982 pragma Inline (Set_Flag236);
2984 procedure Set_Flag237 (N : Node_Id; Val : Boolean);
2985 pragma Inline (Set_Flag237);
2987 procedure Set_Flag238 (N : Node_Id; Val : Boolean);
2988 pragma Inline (Set_Flag238);
2990 procedure Set_Flag239 (N : Node_Id; Val : Boolean);
2991 pragma Inline (Set_Flag239);
2993 procedure Set_Flag240 (N : Node_Id; Val : Boolean);
2994 pragma Inline (Set_Flag240);
2996 procedure Set_Flag241 (N : Node_Id; Val : Boolean);
2997 pragma Inline (Set_Flag241);
2999 procedure Set_Flag242 (N : Node_Id; Val : Boolean);
3000 pragma Inline (Set_Flag242);
3002 procedure Set_Flag243 (N : Node_Id; Val : Boolean);
3003 pragma Inline (Set_Flag243);
3005 procedure Set_Flag244 (N : Node_Id; Val : Boolean);
3006 pragma Inline (Set_Flag244);
3008 procedure Set_Flag245 (N : Node_Id; Val : Boolean);
3009 pragma Inline (Set_Flag245);
3011 procedure Set_Flag246 (N : Node_Id; Val : Boolean);
3012 pragma Inline (Set_Flag246);
3014 procedure Set_Flag247 (N : Node_Id; Val : Boolean);
3015 pragma Inline (Set_Flag247);
3017 procedure Set_Flag248 (N : Node_Id; Val : Boolean);
3018 pragma Inline (Set_Flag248);
3020 procedure Set_Flag249 (N : Node_Id; Val : Boolean);
3021 pragma Inline (Set_Flag249);
3023 procedure Set_Flag250 (N : Node_Id; Val : Boolean);
3024 pragma Inline (Set_Flag250);
3026 procedure Set_Flag251 (N : Node_Id; Val : Boolean);
3027 pragma Inline (Set_Flag251);
3029 procedure Set_Flag252 (N : Node_Id; Val : Boolean);
3030 pragma Inline (Set_Flag252);
3032 procedure Set_Flag253 (N : Node_Id; Val : Boolean);
3033 pragma Inline (Set_Flag253);
3035 procedure Set_Flag254 (N : Node_Id; Val : Boolean);
3036 pragma Inline (Set_Flag254);
3038 -- The following versions of Set_Noden also set the parent pointer of
3039 -- the referenced node if it is not Empty.
3041 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id);
3042 pragma Inline (Set_Node1_With_Parent);
3044 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id);
3045 pragma Inline (Set_Node2_With_Parent);
3047 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id);
3048 pragma Inline (Set_Node3_With_Parent);
3050 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id);
3051 pragma Inline (Set_Node4_With_Parent);
3053 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id);
3054 pragma Inline (Set_Node5_With_Parent);
3056 -- The following versions of Set_Listn also set the parent pointer of
3057 -- the referenced node if it is not Empty.
3059 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id);
3060 pragma Inline (Set_List1_With_Parent);
3062 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id);
3063 pragma Inline (Set_List2_With_Parent);
3065 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id);
3066 pragma Inline (Set_List3_With_Parent);
3068 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id);
3069 pragma Inline (Set_List4_With_Parent);
3071 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id);
3072 pragma Inline (Set_List5_With_Parent);
3074 end Unchecked_Access;
3076 -----------------------------
3077 -- Private Part Subpackage --
3078 -----------------------------
3080 -- The following package contains the definition of the data structure
3081 -- used by the implementation of the Atree package. Logically it really
3082 -- corresponds to the private part, hence the name. The reason that it
3083 -- is defined as a sub-package is to allow special access from clients
3084 -- that need to see the internals of the data structures.
3086 package Atree_Private_Part is
3088 -------------------------
3089 -- Tree Representation --
3090 -------------------------
3092 -- The nodes of the tree are stored in a table (i.e. an array). In the
3093 -- case of extended nodes five consecutive components in the array are
3094 -- used. There are thus two formats for array components. One is used
3095 -- for non-extended nodes, and for the first component of extended
3096 -- nodes. The other is used for the extension parts (second, third,
3097 -- fourth and fifth components) of an extended node. A variant record
3098 -- structure is used to distinguish the two formats.
3100 type Node_Record (Is_Extension : Boolean := False) is record
3102 -- Logically, the only field in the common part is the above
3103 -- Is_Extension discriminant (a single bit). However, Gigi cannot
3104 -- yet handle such a structure, so we fill out the common part of
3105 -- the record with fields that are used in different ways for
3106 -- normal nodes and node extensions.
3108 Pflag1, Pflag2 : Boolean;
3109 -- The Paren_Count field is represented using two boolean flags,
3110 -- where Pflag1 is worth 1, and Pflag2 is worth 2. This is done
3111 -- because we need to be easily able to reuse this field for
3112 -- extra flags in the extended node case.
3115 -- Flag used to indicate if node is a member of a list.
3116 -- This field is considered private to the Atree package.
3118 Has_Aspects : Boolean;
3119 -- Flag used to indicate that a node has aspect specifications that
3120 -- are associated with the node. See Aspects package for details.
3122 Rewrite_Ins : Boolean;
3123 -- Flag set by Mark_Rewrite_Insertion procedure.
3124 -- This field is considered private to the Atree package.
3127 -- Flag to indicate the node has been analyzed (and expanded)
3129 Comes_From_Source : Boolean;
3130 -- Flag to indicate that node comes from the source program (i.e.
3131 -- was built by the parser or scanner, not the analyzer or expander).
3133 Error_Posted : Boolean;
3134 -- Flag to indicate that an error message has been posted on the
3135 -- node (to avoid duplicate flags on the same node)
3152 -- The eighteen flags for a normal node
3154 -- The above fields are used as follows in components 2-5 of
3155 -- an extended node entry.
3157 -- In_List used as Flag19, Flag40, Flag129, Flag216
3158 -- Has_Aspects used as Flag20, Flag41, Flag130, Flag217
3159 -- Rewrite_Ins used as Flag21, Flag42, Flag131, Flag218
3160 -- Analyzed used as Flag22, Flag43, Flag132, Flag219
3161 -- Comes_From_Source used as Flag23, Flag44, Flag133, Flag220
3162 -- Error_Posted used as Flag24, Flag45, Flag134, Flag221
3163 -- Flag4 used as Flag25, Flag46, Flag135, Flag222
3164 -- Flag5 used as Flag26, Flag47, Flag136, Flag223
3165 -- Flag6 used as Flag27, Flag48, Flag137, Flag224
3166 -- Flag7 used as Flag28, Flag49, Flag138, Flag225
3167 -- Flag8 used as Flag29, Flag50, Flag139, Flag226
3168 -- Flag9 used as Flag30, Flag51, Flag140, Flag227
3169 -- Flag10 used as Flag31, Flag52, Flag141, Flag228
3170 -- Flag11 used as Flag32, Flag53, Flag142, Flag229
3171 -- Flag12 used as Flag33, Flag54, Flag143, Flag230
3172 -- Flag13 used as Flag34, Flag55, Flag144, Flag231
3173 -- Flag14 used as Flag35, Flag56, Flag145, Flag232
3174 -- Flag15 used as Flag36, Flag57, Flag146, Flag233
3175 -- Flag16 used as Flag37, Flag58, Flag147, Flag234
3176 -- Flag17 used as Flag38, Flag59, Flag148, Flag235
3177 -- Flag18 used as Flag39, Flag60, Flag149, Flag236
3178 -- Pflag1 used as Flag61, Flag62, Flag150, Flag237
3179 -- Pflag2 used as Flag63, Flag64, Flag151, Flag238
3182 -- For a non-extended node, or the initial section of an extended
3183 -- node, this field holds the Node_Kind value. For an extended node,
3184 -- The Nkind field is used as follows:
3186 -- Second entry: holds the Ekind field of the entity
3187 -- Third entry: holds 8 additional flags (Flag65-Flag72)
3188 -- Fourth entry: holds 8 additional flags (Flag239-246)
3189 -- Fifth entry: holds 8 additional flags (Flag247-254)
3191 -- Now finally (on an 32-bit boundary!) comes the variant part
3193 case Is_Extension is
3195 -- Non-extended node, or first component of extended node
3200 -- Source location for this node
3203 -- This field is used either as the Parent pointer (if In_List
3204 -- is False), or to point to the list header (if In_List is
3205 -- True). This field is considered private and can be modified
3206 -- only by Atree or by Nlists.
3213 -- Five general use fields, which can contain Node_Id, List_Id,
3214 -- Elist_Id, String_Id, or Name_Id values depending on the
3215 -- values in Nkind and (for extended nodes), in Ekind. See
3216 -- packages Sinfo and Einfo for details of their use.
3218 -- Extension (second component) of extended node
3229 -- Seven additional general fields available only for entities
3230 -- See package Einfo for details of their use (which depends
3231 -- on the value in the Ekind field).
3233 -- In the third component, the extension format as described
3234 -- above is used to hold additional general fields and flags
3237 -- Field6-11 Holds Field13-Field18
3238 -- Field12 Holds Flag73-Flag96 and Convention
3240 -- In the fourth component, the extension format as described
3241 -- above is used to hold additional general fields and flags
3244 -- Field6-10 Holds Field19-Field23
3245 -- Field11 Holds Flag152-Flag183
3246 -- Field12 Holds Flag97-Flag128
3248 -- In the fifth component, the extension format as described
3249 -- above is used to hold additional general fields and flags
3252 -- Field6-11 Holds Field24-Field29
3253 -- Field12 Holds Flag184-Flag215
3258 pragma Pack (Node_Record);
3259 for Node_Record'Size use 8*32;
3260 for Node_Record'Alignment use 4;
3262 function E_To_N is new Unchecked_Conversion (Entity_Kind, Node_Kind);
3263 function N_To_E is new Unchecked_Conversion (Node_Kind, Entity_Kind);
3265 -- Default value used to initialize default nodes. Note that some of the
3266 -- fields get overwritten, and in particular, Nkind always gets reset.
3268 Default_Node : Node_Record := (
3269 Is_Extension => False,
3273 Has_Aspects => False,
3274 Rewrite_Ins => False,
3276 Comes_From_Source => False,
3277 -- modified by Set_Comes_From_Source_Default
3278 Error_Posted => False,
3297 Nkind => N_Unused_At_Start,
3299 Sloc => No_Location,
3300 Link => Empty_List_Or_Node,
3301 Field1 => Empty_List_Or_Node,
3302 Field2 => Empty_List_Or_Node,
3303 Field3 => Empty_List_Or_Node,
3304 Field4 => Empty_List_Or_Node,
3305 Field5 => Empty_List_Or_Node);
3307 -- Default value used to initialize node extensions (i.e. the second
3308 -- and third and fourth components of an extended node). Note we are
3309 -- cheating a bit here when it comes to Node12, which really holds
3310 -- flags an (for the third component), the convention. But it works
3311 -- because Empty, False, Convention_Ada, all happen to be all zero bits.
3313 Default_Node_Extension : constant Node_Record := (
3314 Is_Extension => True,
3318 Has_Aspects => False,
3319 Rewrite_Ins => False,
3321 Comes_From_Source => False,
3322 Error_Posted => False,
3341 Nkind => E_To_N (E_Void),
3343 Field6 => Empty_List_Or_Node,
3344 Field7 => Empty_List_Or_Node,
3345 Field8 => Empty_List_Or_Node,
3346 Field9 => Empty_List_Or_Node,
3347 Field10 => Empty_List_Or_Node,
3348 Field11 => Empty_List_Or_Node,
3349 Field12 => Empty_List_Or_Node);
3351 -- The following defines the extendable array used for the nodes table
3352 -- Nodes with extensions use five consecutive entries in the array
3354 package Nodes is new Table.Table (
3355 Table_Component_Type => Node_Record,
3356 Table_Index_Type => Node_Id'Base,
3357 Table_Low_Bound => First_Node_Id,
3358 Table_Initial => Alloc.Nodes_Initial,
3359 Table_Increment => Alloc.Nodes_Increment,
3360 Table_Name => "Nodes");
3362 end Atree_Private_Part;