1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2009, 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_Sub A flag set if the node has been rewritten using
89 -- the Rewrite procedure. The original value of the
90 -- node is retrievable with Original_Node.
92 -- Rewrite_Ins A flag set if a node is marked as a rewrite inserted
93 -- node as a result of a call to Mark_Rewrite_Insertion.
95 -- Paren_Count A 2-bit count used in sub-expression nodes to indicate
96 -- the level of parentheses. The settings are 0,1,2 and
97 -- 3 for many. If the value is 3, then an auxiliary table
98 -- is used to indicate the real value. Set to zero for
99 -- non-subexpression nodes.
102 -- This flag is present in all nodes. It is set if the
103 -- node is built by the scanner or parser, and clear if
104 -- the node is built by the analyzer or expander. It
105 -- indicates that the node corresponds to a construct
106 -- that appears in the original source program.
108 -- Analyzed This flag is present in all nodes. It is set when
109 -- a node is analyzed, and is used to avoid analyzing
110 -- the same node twice. Analysis includes expansion if
111 -- expansion is active, so in this case if the flag is
112 -- set it means the node has been analyzed and expanded.
114 -- Error_Posted This flag is present in all nodes. It is set when
115 -- an error message is posted which is associated with
116 -- the flagged node. This is used to avoid posting more
117 -- than one message on the same node.
123 -- Field5 Five fields holding Union_Id values
125 -- ElistN Synonym for FieldN typed as Elist_Id (Empty = No_Elist)
126 -- ListN Synonym for FieldN typed as List_Id
127 -- NameN Synonym for FieldN typed as Name_Id
128 -- NodeN Synonym for FieldN typed as Node_Id
129 -- StrN Synonym for FieldN typed as String_Id
130 -- UintN Synonym for FieldN typed as Uint (Empty = Uint_0)
131 -- UrealN Synonym for FieldN typed as Ureal
133 -- Note: in the case of ElistN and UintN fields, it is common that we
134 -- end up with a value of Union_Id'(0) as the default value. This value
135 -- is meaningless as a Uint or Elist_Id value. We have two choices here.
136 -- We could require that all Uint and Elist fields be initialized to an
137 -- appropriate value, but that's error prone, since it would be easy to
138 -- miss an initialization. So instead we have the retrieval functions
139 -- generate an appropriate default value (Uint_0 or No_Elist). Probably
140 -- it would be cleaner to generate No_Uint in the Uint case but we got
141 -- stuck with representing an "unset" size value as zero early on, and
142 -- it will take a bit of fiddling to change that ???
144 -- Note: the actual usage of FieldN (i.e. whether it contains a Elist_Id,
145 -- List_Id, Name_Id, Node_Id, String_Id, Uint or Ureal) depends on the
146 -- value in Nkind. Generally the access to this field is always via the
147 -- functional interface, so the field names ElistN, ListN, NameN, NodeN,
148 -- StrN, UintN and UrealN are used only in the bodies of the access
149 -- functions (i.e. in the bodies of Sinfo and Einfo). These access
150 -- functions contain debugging code that checks that the use is
151 -- consistent with Nkind and Ekind values.
153 -- However, in specialized circumstances (examples are the circuit in
154 -- generic instantiation to copy trees, and in the tree dump routine),
155 -- it is useful to be able to do untyped traversals, and an internal
156 -- package in Atree allows for direct untyped accesses in such cases.
158 -- Flag4 Fifteen Boolean flags (use depends on Nkind and
159 -- Flag5 Ekind, as described for FieldN). Again the access
160 -- Flag6 is usually via subprograms in Sinfo and Einfo which
161 -- Flag7 provide high-level synonyms for these flags, and
162 -- Flag8 contain debugging code that checks that the values
163 -- Flag9 in Nkind and Ekind are appropriate for the access.
165 -- Flag11 Note that Flag1-3 are missing from this list. The
166 -- Flag12 first three flag positions are reserved for the
167 -- Flag13 standard flags (Comes_From_Source, Error_Posted,
168 -- Flag14 and Analyzed)
174 -- Link For a node, points to the Parent. For a list, points
175 -- to the list header. Note that in the latter case, a
176 -- client cannot modify the link field. This field is
177 -- private to the Atree package (but is also modified
178 -- by the Nlists package).
180 -- The following additional fields are present in extended nodes used
181 -- for entities (Nkind in N_Entity).
183 -- Ekind Entity type. This field indicates the type of the
184 -- entity, it is of type Entity_Kind which is defined
187 -- Flag19 229 additional flags
191 -- Convention Entity convention (Convention_Id value)
193 -- Field6 Additional Union_Id value stored in tree
195 -- Node6 Synonym for Field6 typed as Node_Id
196 -- Elist6 Synonym for Field6 typed as Elist_Id (Empty = No_Elist)
197 -- Uint6 Synonym for Field6 typed as Uint (Empty = Uint_0)
199 -- Similar definitions for Field7 to Field28 (and Node7-Node28,
200 -- Elist7-Elist28, Uint7-Uint28, Ureal7-Ureal28). Note that not all
201 -- these functions are defined, only the ones that are actually used.
203 function Last_Node_Id return Node_Id;
204 pragma Inline (Last_Node_Id);
205 -- Returns Id of last allocated node Id
207 function Nodes_Address return System.Address;
208 -- Return address of Nodes table (used in Back_End for Gigi call)
210 function Num_Nodes return Nat;
211 -- Total number of nodes allocated, where an entity counts as a single
212 -- node. This count is incremented every time a node or entity is
213 -- allocated, and decremented every time a node or entity is deleted.
214 -- This value is used by Xref and by Treepr to allocate hash tables of
215 -- suitable size for hashing Node_Id values.
217 -----------------------
218 -- Use of Empty Node --
219 -----------------------
221 -- The special Node_Id Empty is used to mark missing fields. Whenever the
222 -- syntax has an optional component, then the corresponding field will be
223 -- set to Empty if the component is missing.
225 -- Note: Empty is not used to describe an empty list. Instead in this
226 -- case the node field contains a list which is empty, and these cases
227 -- should be distinguished (essentially from a type point of view, Empty
228 -- is a Node, and is thus not a list).
230 -- Note: Empty does in fact correspond to an allocated node. Only the
231 -- Nkind field of this node may be referenced. It contains N_Empty, which
232 -- uniquely identifies the empty case. This allows the Nkind field to be
233 -- dereferenced before the check for Empty which is sometimes useful.
235 -----------------------
236 -- Use of Error Node --
237 -----------------------
239 -- The Error node is used during syntactic and semantic analysis to
240 -- indicate that the corresponding piece of syntactic structure or
241 -- semantic meaning cannot properly be represented in the tree because
242 -- of an illegality in the program.
244 -- If an Error node is encountered, then you know that a previous
245 -- illegality has been detected. The proper reaction should be to
246 -- avoid posting related cascaded error messages, and to propagate
247 -- the error node if necessary.
249 ------------------------
250 -- Current_Error_Node --
251 ------------------------
253 -- The current error node is a global location indicating the current
254 -- node that is being processed for the purposes of placing a compiler
255 -- abort message. This is not necessarily perfectly accurate, it is
256 -- just a reasonably accurate best guess. It is used to output the
257 -- source location in the abort message by Comperr, and also to
258 -- implement the d3 debugging flag. This is also used by Rtsfind
259 -- to generate error messages for high integrity mode.
261 -- There are two ways this gets set. During parsing, when new source
262 -- nodes are being constructed by calls to New_Node and New_Entity,
263 -- either one of these calls sets Current_Error_Node to the newly
264 -- created node. During semantic analysis, this mechanism is not
265 -- used, and instead Current_Error_Node is set by the subprograms in
266 -- Debug_A that mark the start and end of analysis/expansion of a
269 Current_Error_Node : Node_Id;
270 -- Node to place error messages
272 -------------------------------
273 -- Default Setting of Fields --
274 -------------------------------
276 -- Nkind is set to N_Unused_At_Start
278 -- Ekind is set to E_Void
280 -- Sloc is always set, there is no default value
282 -- Field1-5 fields are set to Empty
284 -- Field6-22 fields in extended nodes are set to Empty
286 -- Parent is set to Empty
288 -- All Boolean flag fields are set to False
290 -- Note: the value Empty is used in Field1-Field17 to indicate a null node.
291 -- The usage varies. The common uses are to indicate absence of an
292 -- optional clause or a completely unused Field1-17 field.
294 -------------------------------------
295 -- Use of Synonyms for Node Fields --
296 -------------------------------------
298 -- A subpackage Atree.Unchecked_Access provides routines for reading and
299 -- writing the fields defined above (Field1-27, Node1-27, Flag1-247 etc).
300 -- These unchecked access routines can be used for untyped traversals.
301 -- In addition they are used in the implementations of the Sinfo and
302 -- Einfo packages. These packages both provide logical synonyms for
303 -- the generic fields, together with an appropriate set of access routines.
304 -- Normally access to information within tree nodes uses these synonyms,
305 -- providing a high level typed interface to the tree information.
307 --------------------------------------------------
308 -- Node Allocation and Modification Subprograms --
309 --------------------------------------------------
311 -- Generally the parser builds the tree and then it is further decorated
312 -- (e.g. by setting the entity fields), but not fundamentally modified.
313 -- However, there are cases in which the tree must be restructured by
314 -- adding and rearranging nodes, as a result of disambiguating cases
315 -- which the parser could not parse correctly, and adding additional
316 -- semantic information (e.g. making constraint checks explicit). The
317 -- following subprograms are used for constructing the tree in the first
318 -- place, and then for subsequent modifications as required.
320 procedure Initialize;
321 -- Called at the start of compilation to initialize the allocation of
322 -- the node and list tables and make the standard entries for Empty,
323 -- Error and Error_List. Note that Initialize must not be called if
324 -- Tree_Read is used.
327 -- Called before the back end is invoked to lock the nodes table
328 -- Also called after Unlock to relock???
331 -- Unlocks nodes table, in cases where the back end needs to modify it
334 -- Initializes internal tables from current tree file using the relevant
335 -- Table.Tree_Read routines. Note that Initialize should not be called if
336 -- Tree_Read is used. Tree_Read includes all necessary initialization.
338 procedure Tree_Write;
339 -- Writes out internal tables to current tree file using the relevant
340 -- Table.Tree_Write routines.
343 (New_Node_Kind : Node_Kind;
344 New_Sloc : Source_Ptr) return Node_Id;
345 -- Allocates a completely new node with the given node type and source
346 -- location values. All other fields are set to their standard defaults:
348 -- Empty for all FieldN fields
349 -- False for all FlagN fields
351 -- The usual approach is to build a new node using this function and
352 -- then, using the value returned, use the Set_xxx functions to set
353 -- fields of the node as required. New_Node can only be used for
354 -- non-entity nodes, i.e. it never generates an extended node.
356 -- If we are currently parsing, as indicated by a previous call to
357 -- Set_Comes_From_Source_Default (True), then this call also resets
358 -- the value of Current_Error_Node.
361 (New_Node_Kind : Node_Kind;
362 New_Sloc : Source_Ptr) return Entity_Id;
363 -- Similar to New_Node, except that it is used only for entity nodes
364 -- and returns an extended node.
366 procedure Set_Comes_From_Source_Default (Default : Boolean);
367 -- Sets value of Comes_From_Source flag to be used in all subsequent
368 -- New_Node and New_Entity calls until another call to this procedure
369 -- changes the default. This value is set True during parsing and
370 -- False during semantic analysis. This is also used to determine
371 -- if New_Node and New_Entity should set Current_Error_Node.
373 function Get_Comes_From_Source_Default return Boolean;
374 pragma Inline (Get_Comes_From_Source_Default);
375 -- Gets the current value of the Comes_From_Source flag
377 procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id);
378 pragma Inline (Preserve_Comes_From_Source);
379 -- When a node is rewritten, it is sometimes appropriate to preserve the
380 -- original comes from source indication. This is true when the rewrite
381 -- essentially corresponds to a transformation corresponding exactly to
382 -- semantics in the reference manual. This procedure copies the setting
383 -- of Comes_From_Source from OldN to NewN.
385 function Has_Extension (N : Node_Id) return Boolean;
386 pragma Inline (Has_Extension);
387 -- Returns True if the given node has an extension (i.e. was created by
388 -- a call to New_Entity rather than New_Node, and Nkind is in N_Entity)
390 procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind);
391 -- This procedure replaces the given node by setting its Nkind field to
392 -- the indicated value and resetting all other fields to their default
393 -- values except for Sloc, which is unchanged, and the Parent pointer
394 -- and list links, which are also unchanged. All other information in
395 -- the original node is lost. The new node has an extension if the
396 -- original node had an extension.
398 procedure Copy_Node (Source : Node_Id; Destination : Node_Id);
399 -- Copy the entire contents of the source node to the destination node.
400 -- The contents of the source node is not affected. If the source node
401 -- has an extension, then the destination must have an extension also.
402 -- The parent pointer of the destination and its list link, if any, are
403 -- not affected by the copy. Note that parent pointers of descendents
404 -- are not adjusted, so the descendents of the destination node after
405 -- the Copy_Node is completed have dubious parent pointers.
407 function New_Copy (Source : Node_Id) return Node_Id;
408 -- This function allocates a completely new node, and then initializes
409 -- it by copying the contents of the source node into it. The contents
410 -- of the source node is not affected. The target node is always marked
411 -- as not being in a list (even if the source is a list member). The
412 -- new node will have an extension if the source has an extension.
413 -- New_Copy (Empty) returns Empty and New_Copy (Error) returns Error.
414 -- Note that, unlike New_Copy_Tree, New_Copy does not recursively copy any
415 -- descendents, so in general parent pointers are not set correctly for
416 -- the descendents of the copied node. Both normal and extended nodes
417 -- (entities) may be copied using New_Copy.
419 function Relocate_Node (Source : Node_Id) return Node_Id;
420 -- Source is a non-entity node that is to be relocated. A new node is
421 -- allocated and the contents of Source are copied to this node using
422 -- Copy_Node. The parent pointers of descendents of the node are then
423 -- adjusted to point to the relocated copy. The original node is not
424 -- modified, but the parent pointers of its descendents are no longer
425 -- valid. This routine is used in conjunction with the tree rewrite
426 -- routines (see descriptions of Replace/Rewrite).
428 -- Note that the resulting node has the same parent as the source
429 -- node, and is thus still attached to the tree. It is valid for
430 -- Source to be Empty, in which case Relocate_Node simply returns
431 -- Empty as the result.
433 function New_Copy_Tree
435 Map : Elist_Id := No_Elist;
436 New_Sloc : Source_Ptr := No_Location;
437 New_Scope : Entity_Id := Empty) return Node_Id;
438 -- Given a node that is the root of a subtree, Copy_Tree copies the entire
439 -- syntactic subtree, including recursively any descendents whose parent
440 -- field references a copied node (descendents not linked to a copied node
441 -- by the parent field are not copied, instead the copied tree references
442 -- the same descendent as the original in this case, which is appropriate
443 -- for non-syntactic fields such as Etype). The parent pointers in the
444 -- copy are properly set. Copy_Tree (Empty/Error) returns Empty/Error.
445 -- The one exception to the rule of not copying semantic fields is that
446 -- any implicit types attached to the subtree are duplicated, so that
447 -- the copy contains a distinct set of implicit type entities. The Map
448 -- argument, if set to a non-empty Elist, specifies a set of mappings
449 -- to be applied to entities in the tree. The map has the form:
452 -- new entity to replace references to entity 1
454 -- new entity to replace references to entity 2
457 -- The call destroys the contents of Map in this case
459 -- The parameter New_Sloc, if set to a value other than No_Location, is
460 -- used as the Sloc value for all nodes in the new copy. If New_Sloc is
461 -- set to its default value No_Location, then the Sloc values of the
462 -- nodes in the copy are simply copied from the corresponding original.
464 -- The Comes_From_Source indication is unchanged if New_Sloc is set to
465 -- the default No_Location value, but is reset if New_Sloc is given, since
466 -- in this case the result clearly is neither a source node or an exact
467 -- copy of a source node.
469 -- The parameter New_Scope, if set to a value other than Empty, is the
470 -- value to use as the Scope for any Itypes that are copied. The most
471 -- typical value for this parameter, if given, is Current_Scope.
473 function Copy_Separate_Tree (Source : Node_Id) return Node_Id;
474 -- Given a node that is the root of a subtree, Copy_Separate_Tree copies
475 -- the entire syntactic subtree, including recursively any descendants
476 -- whose parent field references a copied node (descendants not linked to
477 -- a copied node by the parent field are also copied.) The parent pointers
478 -- in the copy are properly set. Copy_Separate_Tree (Empty/Error) returns
479 -- Empty/Error. The semantic fields are not copied and the new subtree
480 -- does not share any entity with source subtree.
481 -- But the code *does* copy semantic fields, and the description above
482 -- is in any case unclear on this point ??? (RBKD)
484 procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id);
485 -- Exchange the contents of two entities. The parent pointers are switched
486 -- as well as the Defining_Identifier fields in the parents, so that the
487 -- entities point correctly to their original parents. The effect is thus
488 -- to leave the tree completely unchanged in structure, except that the
489 -- entity ID values of the two entities are interchanged. Neither of the
490 -- two entities may be list members.
492 function Extend_Node (Node : Node_Id) return Entity_Id;
493 -- This function returns a copy of its input node with an extension
494 -- added. The fields of the extension are set to Empty. Due to the way
495 -- extensions are handled (as four consecutive array elements), it may
496 -- be necessary to reallocate the node, so that the returned value is
497 -- not the same as the input value, but where possible the returned
498 -- value will be the same as the input value (i.e. the extension will
499 -- occur in place). It is the caller's responsibility to ensure that
500 -- any pointers to the original node are appropriately updated. This
501 -- function is used only by Sinfo.CN to change nodes into their
502 -- corresponding entities.
504 type Traverse_Result is (Abandon, OK, OK_Orig, Skip);
505 -- This is the type of the result returned by the Process function passed
506 -- to Traverse_Func and Traverse_Proc. See below for details.
508 subtype Traverse_Final_Result is Traverse_Result range Abandon .. OK;
509 -- This is the type of the final result returned Traverse_Func, based on
510 -- the results of Process calls. See below for details.
513 with function Process (N : Node_Id) return Traverse_Result is <>;
514 function Traverse_Func (Node : Node_Id) return Traverse_Final_Result;
515 -- This is a generic function that, given the parent node for a subtree,
516 -- traverses all syntactic nodes of this tree, calling the given function
517 -- Process on each one, in pre order (i.e. top-down). The order of
518 -- traversing subtrees is arbitrary. The traversal is controlled as follows
519 -- by the result returned by Process:
521 -- OK The traversal continues normally with the syntactic
522 -- children of the node just processed.
524 -- OK_Orig The traversal continues normally with the syntactic
525 -- children of the original node of the node just processed.
527 -- Skip The children of the node just processed are skipped and
528 -- excluded from the traversal, but otherwise processing
529 -- continues elsewhere in the tree.
531 -- Abandon The entire traversal is immediately abandoned, and the
532 -- original call to Traverse returns Abandon.
534 -- The result returned by Traverse is Abandon if processing was terminated
535 -- by a call to Process returning Abandon, otherwise it is OK (meaning that
536 -- all calls to process returned either OK, OK_Orig, or Skip).
539 with function Process (N : Node_Id) return Traverse_Result is <>;
540 procedure Traverse_Proc (Node : Node_Id);
541 pragma Inline (Traverse_Proc);
542 -- This is the same as Traverse_Func except that no result is returned,
543 -- i.e. Traverse_Func is called and the result is simply discarded.
545 ---------------------------
546 -- Node Access Functions --
547 ---------------------------
549 -- The following functions return the contents of the indicated field of
550 -- the node referenced by the argument, which is a Node_Id.
552 function Nkind (N : Node_Id) return Node_Kind;
553 pragma Inline (Nkind);
555 function Analyzed (N : Node_Id) return Boolean;
556 pragma Inline (Analyzed);
558 function Comes_From_Source (N : Node_Id) return Boolean;
559 pragma Inline (Comes_From_Source);
561 function Error_Posted (N : Node_Id) return Boolean;
562 pragma Inline (Error_Posted);
564 function Sloc (N : Node_Id) return Source_Ptr;
565 pragma Inline (Sloc);
567 function Paren_Count (N : Node_Id) return Nat;
568 pragma Inline (Paren_Count);
570 function Parent (N : Node_Id) return Node_Id;
571 pragma Inline (Parent);
572 -- Returns the parent of a node if the node is not a list member, or
573 -- else the parent of the list containing the node if the node is a
576 function No (N : Node_Id) return Boolean;
578 -- Tests given Id for equality with the Empty node. This allows notations
579 -- like "if No (Variant_Part)" as opposed to "if Variant_Part = Empty".
581 function Present (N : Node_Id) return Boolean;
582 pragma Inline (Present);
583 -- Tests given Id for inequality with the Empty node. This allows notations
584 -- like "if Present (Statement)" as opposed to "if Statement /= Empty".
586 -- Node_Kind tests, like the functions in Sinfo, but the first argument is
587 -- a Node_Id, and the tested field is Nkind (N).
592 V2 : Node_Kind) return Boolean;
598 V3 : Node_Kind) return Boolean;
605 V4 : Node_Kind) return Boolean;
613 V5 : Node_Kind) return Boolean;
622 V6 : Node_Kind) return Boolean;
632 V7 : Node_Kind) return Boolean;
643 V8 : Node_Kind) return Boolean;
645 pragma Inline (Nkind_In);
646 -- Inline all above functions
648 -----------------------------
649 -- Entity Access Functions --
650 -----------------------------
652 -- The following functions apply only to Entity_Id values, i.e.
653 -- to extended nodes.
655 function Ekind (E : Entity_Id) return Entity_Kind;
656 pragma Inline (Ekind);
658 function Convention (E : Entity_Id) return Convention_Id;
659 pragma Inline (Convention);
661 ----------------------------
662 -- Node Update Procedures --
663 ----------------------------
665 -- The following functions set a specified field in the node whose Id is
666 -- passed as the first argument. The second parameter is the new value
667 -- to be set in the specified field. Note that Set_Nkind is in the next
668 -- section, since its use is restricted.
670 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr);
671 pragma Inline (Set_Sloc);
673 procedure Set_Paren_Count (N : Node_Id; Val : Nat);
674 pragma Inline (Set_Paren_Count);
676 procedure Set_Parent (N : Node_Id; Val : Node_Id);
677 pragma Inline (Set_Parent);
679 procedure Set_Analyzed (N : Node_Id; Val : Boolean := True);
680 pragma Inline (Set_Analyzed);
682 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True);
683 pragma Inline (Set_Error_Posted);
685 procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean);
686 pragma Inline (Set_Comes_From_Source);
687 -- Note that this routine is very rarely used, since usually the
688 -- default mechanism provided sets the right value, but in some
689 -- unusual cases, the value needs to be reset (e.g. when a source
690 -- node is copied, and the copy must not have Comes_From_Source set.
692 ------------------------------
693 -- Entity Update Procedures --
694 ------------------------------
696 -- The following procedures apply only to Entity_Id values, i.e.
697 -- to extended nodes.
699 procedure Basic_Set_Convention (E : Entity_Id; Val : Convention_Id);
700 pragma Inline (Basic_Set_Convention);
701 -- Clients should use Sem_Util.Set_Convention rather than calling this
702 -- routine directly, as Set_Convention also deals with the special
703 -- processing required for access types.
705 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind);
706 pragma Inline (Set_Ekind);
708 ---------------------------
709 -- Tree Rewrite Routines --
710 ---------------------------
712 -- During the compilation process it is necessary in a number of situations
713 -- to rewrite the tree. In some cases, such rewrites do not affect the
714 -- structure of the tree, for example, when an indexed component node is
715 -- replaced by the corresponding call node (the parser cannot distinguish
716 -- between these two cases).
718 -- In other situations, the rewrite does affect the structure of the
719 -- tree. Examples are the replacement of a generic instantiation by the
720 -- instantiated spec and body, and the static evaluation of expressions.
722 -- If such structural modifications are done by the expander, there are
723 -- no difficulties, since the form of the tree after the expander has no
724 -- special significance, except as input to the backend of the compiler.
725 -- However, if these modifications are done by the semantic phase, then
726 -- it is important that they be done in a manner which allows the original
727 -- tree to be preserved. This is because tools like pretty printers need
728 -- to have this original tree structure available.
730 -- The subprograms in this section allow rewriting of the tree by either
731 -- insertion of new nodes in an existing list, or complete replacement of
732 -- a subtree. The resulting tree for most purposes looks as though it has
733 -- been really changed, and there is no trace of the original. However,
734 -- special subprograms, also defined in this section, allow the original
735 -- tree to be reconstructed if necessary.
737 -- For tree modifications done in the expander, it is permissible to
738 -- destroy the original tree, although it is also allowable to use the
739 -- tree rewrite routines where it is convenient to do so.
741 procedure Mark_Rewrite_Insertion (New_Node : Node_Id);
742 pragma Inline (Mark_Rewrite_Insertion);
743 -- This procedure marks the given node as an insertion made during a tree
744 -- rewriting operation. Only the root needs to be marked. The call does
745 -- not do the actual insertion, which must be done using one of the normal
746 -- list insertion routines. The node is treated normally in all respects
747 -- except for its response to Is_Rewrite_Insertion. The function of these
748 -- calls is to be able to get an accurate original tree. This helps the
749 -- accuracy of Sprint.Sprint_Node, and in particular, when stubs are being
750 -- generated, it is essential that the original tree be accurate.
752 function Is_Rewrite_Insertion (Node : Node_Id) return Boolean;
753 pragma Inline (Is_Rewrite_Insertion);
754 -- Tests whether the given node was marked using Set_Rewrite_Insert. This
755 -- is used in reconstructing the original tree (where such nodes are to
756 -- be eliminated from the reconstructed tree).
758 procedure Rewrite (Old_Node, New_Node : Node_Id);
759 -- This is used when a complete subtree is to be replaced. Old_Node is the
760 -- root of the old subtree to be replaced, and New_Node is the root of the
761 -- newly constructed replacement subtree. The actual mechanism is to swap
762 -- the contents of these two nodes fixing up the parent pointers of the
763 -- replaced node (we do not attempt to preserve parent pointers for the
764 -- original node). Neither Old_Node nor New_Node can be extended nodes.
766 -- Note: New_Node may not contain references to Old_Node, for example as
767 -- descendents, since the rewrite would make such references invalid. If
768 -- New_Node does need to reference Old_Node, then these references should
769 -- be to a relocated copy of Old_Node (see Relocate_Node procedure).
771 -- Note: The Original_Node function applied to Old_Node (which has now
772 -- been replaced by the contents of New_Node), can be used to obtain the
773 -- original node, i.e. the old contents of Old_Node.
775 procedure Replace (Old_Node, New_Node : Node_Id);
776 -- This is similar to Rewrite, except that the old value of Old_Node is
777 -- not saved, and the New_Node is deleted after the replace, since it
778 -- is assumed that it can no longer be legitimately needed. The flag
779 -- Is_Rewrite_Susbtitute will be False for the resulting node, unless
780 -- it was already true on entry, and Original_Node will not return the
781 -- original contents of the Old_Node, but rather the New_Node value (unless
782 -- Old_Node had already been rewritten using Rewrite). Replace also
783 -- preserves the setting of Comes_From_Source.
785 -- Note, New_Node may not contain references to Old_Node, for example as
786 -- descendents, since the rewrite would make such references invalid. If
787 -- New_Node does need to reference Old_Node, then these references should
788 -- be to a relocated copy of Old_Node (see Relocate_Node procedure).
790 -- Replace is used in certain circumstances where it is desirable to
791 -- suppress any history of the rewriting operation. Notably, it is used
792 -- when the parser has mis-classified a node (e.g. a task entry call
793 -- that the parser has parsed as a procedure call).
795 function Is_Rewrite_Substitution (Node : Node_Id) return Boolean;
796 pragma Inline (Is_Rewrite_Substitution);
797 -- Return True iff Node has been rewritten (i.e. if Node is the root
798 -- of a subtree which was installed using Rewrite).
800 function Original_Node (Node : Node_Id) return Node_Id;
801 pragma Inline (Original_Node);
802 -- If Node has not been rewritten, then returns its input argument
803 -- unchanged, else returns the Node for the original subtree.
805 -- Note: Parents are not preserved in original tree nodes that are
806 -- retrieved in this way (i.e. their children may have children whose
807 -- pointers which reference some other node).
809 -- Note: there is no direct mechanism for deleting an original node (in
810 -- a manner that can be reversed later). One possible approach is to use
811 -- Rewrite to substitute a null statement for the node to be deleted.
813 -----------------------------------
814 -- Generic Field Access Routines --
815 -----------------------------------
817 -- This subpackage provides the functions for accessing and procedures for
818 -- setting fields that are normally referenced by their logical synonyms
819 -- defined in packages Sinfo and Einfo. The implementations of these
820 -- packages use the package Atree.Unchecked_Access.
822 package Unchecked_Access is
824 -- Functions to allow interpretation of Union_Id values as Uint
827 function To_Union is new Unchecked_Conversion (Uint, Union_Id);
828 function To_Union is new Unchecked_Conversion (Ureal, Union_Id);
830 function From_Union is new Unchecked_Conversion (Union_Id, Uint);
831 function From_Union is new Unchecked_Conversion (Union_Id, Ureal);
833 -- Functions to fetch contents of indicated field. It is an error
834 -- to attempt to read the value of a field which is not present.
836 function Field1 (N : Node_Id) return Union_Id;
837 pragma Inline (Field1);
839 function Field2 (N : Node_Id) return Union_Id;
840 pragma Inline (Field2);
842 function Field3 (N : Node_Id) return Union_Id;
843 pragma Inline (Field3);
845 function Field4 (N : Node_Id) return Union_Id;
846 pragma Inline (Field4);
848 function Field5 (N : Node_Id) return Union_Id;
849 pragma Inline (Field5);
851 function Field6 (N : Node_Id) return Union_Id;
852 pragma Inline (Field6);
854 function Field7 (N : Node_Id) return Union_Id;
855 pragma Inline (Field7);
857 function Field8 (N : Node_Id) return Union_Id;
858 pragma Inline (Field8);
860 function Field9 (N : Node_Id) return Union_Id;
861 pragma Inline (Field9);
863 function Field10 (N : Node_Id) return Union_Id;
864 pragma Inline (Field10);
866 function Field11 (N : Node_Id) return Union_Id;
867 pragma Inline (Field11);
869 function Field12 (N : Node_Id) return Union_Id;
870 pragma Inline (Field12);
872 function Field13 (N : Node_Id) return Union_Id;
873 pragma Inline (Field13);
875 function Field14 (N : Node_Id) return Union_Id;
876 pragma Inline (Field14);
878 function Field15 (N : Node_Id) return Union_Id;
879 pragma Inline (Field15);
881 function Field16 (N : Node_Id) return Union_Id;
882 pragma Inline (Field16);
884 function Field17 (N : Node_Id) return Union_Id;
885 pragma Inline (Field17);
887 function Field18 (N : Node_Id) return Union_Id;
888 pragma Inline (Field18);
890 function Field19 (N : Node_Id) return Union_Id;
891 pragma Inline (Field19);
893 function Field20 (N : Node_Id) return Union_Id;
894 pragma Inline (Field20);
896 function Field21 (N : Node_Id) return Union_Id;
897 pragma Inline (Field21);
899 function Field22 (N : Node_Id) return Union_Id;
900 pragma Inline (Field22);
902 function Field23 (N : Node_Id) return Union_Id;
903 pragma Inline (Field23);
905 function Field24 (N : Node_Id) return Union_Id;
906 pragma Inline (Field24);
908 function Field25 (N : Node_Id) return Union_Id;
909 pragma Inline (Field25);
911 function Field26 (N : Node_Id) return Union_Id;
912 pragma Inline (Field26);
914 function Field27 (N : Node_Id) return Union_Id;
915 pragma Inline (Field27);
917 function Field28 (N : Node_Id) return Union_Id;
918 pragma Inline (Field28);
920 function Node1 (N : Node_Id) return Node_Id;
921 pragma Inline (Node1);
923 function Node2 (N : Node_Id) return Node_Id;
924 pragma Inline (Node2);
926 function Node3 (N : Node_Id) return Node_Id;
927 pragma Inline (Node3);
929 function Node4 (N : Node_Id) return Node_Id;
930 pragma Inline (Node4);
932 function Node5 (N : Node_Id) return Node_Id;
933 pragma Inline (Node5);
935 function Node6 (N : Node_Id) return Node_Id;
936 pragma Inline (Node6);
938 function Node7 (N : Node_Id) return Node_Id;
939 pragma Inline (Node7);
941 function Node8 (N : Node_Id) return Node_Id;
942 pragma Inline (Node8);
944 function Node9 (N : Node_Id) return Node_Id;
945 pragma Inline (Node9);
947 function Node10 (N : Node_Id) return Node_Id;
948 pragma Inline (Node10);
950 function Node11 (N : Node_Id) return Node_Id;
951 pragma Inline (Node11);
953 function Node12 (N : Node_Id) return Node_Id;
954 pragma Inline (Node12);
956 function Node13 (N : Node_Id) return Node_Id;
957 pragma Inline (Node13);
959 function Node14 (N : Node_Id) return Node_Id;
960 pragma Inline (Node14);
962 function Node15 (N : Node_Id) return Node_Id;
963 pragma Inline (Node15);
965 function Node16 (N : Node_Id) return Node_Id;
966 pragma Inline (Node16);
968 function Node17 (N : Node_Id) return Node_Id;
969 pragma Inline (Node17);
971 function Node18 (N : Node_Id) return Node_Id;
972 pragma Inline (Node18);
974 function Node19 (N : Node_Id) return Node_Id;
975 pragma Inline (Node19);
977 function Node20 (N : Node_Id) return Node_Id;
978 pragma Inline (Node20);
980 function Node21 (N : Node_Id) return Node_Id;
981 pragma Inline (Node21);
983 function Node22 (N : Node_Id) return Node_Id;
984 pragma Inline (Node22);
986 function Node23 (N : Node_Id) return Node_Id;
987 pragma Inline (Node23);
989 function Node24 (N : Node_Id) return Node_Id;
990 pragma Inline (Node24);
992 function Node25 (N : Node_Id) return Node_Id;
993 pragma Inline (Node25);
995 function Node26 (N : Node_Id) return Node_Id;
996 pragma Inline (Node26);
998 function Node27 (N : Node_Id) return Node_Id;
999 pragma Inline (Node27);
1001 function Node28 (N : Node_Id) return Node_Id;
1002 pragma Inline (Node28);
1004 function List1 (N : Node_Id) return List_Id;
1005 pragma Inline (List1);
1007 function List2 (N : Node_Id) return List_Id;
1008 pragma Inline (List2);
1010 function List3 (N : Node_Id) return List_Id;
1011 pragma Inline (List3);
1013 function List4 (N : Node_Id) return List_Id;
1014 pragma Inline (List4);
1016 function List5 (N : Node_Id) return List_Id;
1017 pragma Inline (List5);
1019 function List10 (N : Node_Id) return List_Id;
1020 pragma Inline (List10);
1022 function List14 (N : Node_Id) return List_Id;
1023 pragma Inline (List14);
1025 function Elist1 (N : Node_Id) return Elist_Id;
1026 pragma Inline (Elist1);
1028 function Elist2 (N : Node_Id) return Elist_Id;
1029 pragma Inline (Elist2);
1031 function Elist3 (N : Node_Id) return Elist_Id;
1032 pragma Inline (Elist3);
1034 function Elist4 (N : Node_Id) return Elist_Id;
1035 pragma Inline (Elist4);
1037 function Elist8 (N : Node_Id) return Elist_Id;
1038 pragma Inline (Elist8);
1040 function Elist13 (N : Node_Id) return Elist_Id;
1041 pragma Inline (Elist13);
1043 function Elist15 (N : Node_Id) return Elist_Id;
1044 pragma Inline (Elist15);
1046 function Elist16 (N : Node_Id) return Elist_Id;
1047 pragma Inline (Elist16);
1049 function Elist18 (N : Node_Id) return Elist_Id;
1050 pragma Inline (Elist18);
1052 function Elist21 (N : Node_Id) return Elist_Id;
1053 pragma Inline (Elist21);
1055 function Elist23 (N : Node_Id) return Elist_Id;
1056 pragma Inline (Elist23);
1058 function Elist25 (N : Node_Id) return Elist_Id;
1059 pragma Inline (Elist25);
1061 function Elist26 (N : Node_Id) return Elist_Id;
1062 pragma Inline (Elist26);
1064 function Name1 (N : Node_Id) return Name_Id;
1065 pragma Inline (Name1);
1067 function Name2 (N : Node_Id) return Name_Id;
1068 pragma Inline (Name2);
1070 function Str3 (N : Node_Id) return String_Id;
1071 pragma Inline (Str3);
1073 -- Note: the following Uintnn functions have a special test for
1074 -- the Field value being Empty. If an Empty value is found then
1075 -- Uint_0 is returned. This avoids the rather tricky requirement
1076 -- of initializing all Uint fields in nodes and entities.
1078 function Uint2 (N : Node_Id) return Uint;
1079 pragma Inline (Uint2);
1081 function Uint3 (N : Node_Id) return Uint;
1082 pragma Inline (Uint3);
1084 function Uint4 (N : Node_Id) return Uint;
1085 pragma Inline (Uint4);
1087 function Uint5 (N : Node_Id) return Uint;
1088 pragma Inline (Uint5);
1090 function Uint8 (N : Node_Id) return Uint;
1091 pragma Inline (Uint8);
1093 function Uint9 (N : Node_Id) return Uint;
1094 pragma Inline (Uint9);
1096 function Uint10 (N : Node_Id) return Uint;
1097 pragma Inline (Uint10);
1099 function Uint11 (N : Node_Id) return Uint;
1100 pragma Inline (Uint11);
1102 function Uint12 (N : Node_Id) return Uint;
1103 pragma Inline (Uint12);
1105 function Uint13 (N : Node_Id) return Uint;
1106 pragma Inline (Uint13);
1108 function Uint14 (N : Node_Id) return Uint;
1109 pragma Inline (Uint14);
1111 function Uint15 (N : Node_Id) return Uint;
1112 pragma Inline (Uint15);
1114 function Uint16 (N : Node_Id) return Uint;
1115 pragma Inline (Uint16);
1117 function Uint17 (N : Node_Id) return Uint;
1118 pragma Inline (Uint17);
1120 function Uint22 (N : Node_Id) return Uint;
1121 pragma Inline (Uint22);
1123 function Ureal3 (N : Node_Id) return Ureal;
1124 pragma Inline (Ureal3);
1126 function Ureal18 (N : Node_Id) return Ureal;
1127 pragma Inline (Ureal18);
1129 function Ureal21 (N : Node_Id) return Ureal;
1130 pragma Inline (Ureal21);
1132 function Flag4 (N : Node_Id) return Boolean;
1133 pragma Inline (Flag4);
1135 function Flag5 (N : Node_Id) return Boolean;
1136 pragma Inline (Flag5);
1138 function Flag6 (N : Node_Id) return Boolean;
1139 pragma Inline (Flag6);
1141 function Flag7 (N : Node_Id) return Boolean;
1142 pragma Inline (Flag7);
1144 function Flag8 (N : Node_Id) return Boolean;
1145 pragma Inline (Flag8);
1147 function Flag9 (N : Node_Id) return Boolean;
1148 pragma Inline (Flag9);
1150 function Flag10 (N : Node_Id) return Boolean;
1151 pragma Inline (Flag10);
1153 function Flag11 (N : Node_Id) return Boolean;
1154 pragma Inline (Flag11);
1156 function Flag12 (N : Node_Id) return Boolean;
1157 pragma Inline (Flag12);
1159 function Flag13 (N : Node_Id) return Boolean;
1160 pragma Inline (Flag13);
1162 function Flag14 (N : Node_Id) return Boolean;
1163 pragma Inline (Flag14);
1165 function Flag15 (N : Node_Id) return Boolean;
1166 pragma Inline (Flag15);
1168 function Flag16 (N : Node_Id) return Boolean;
1169 pragma Inline (Flag16);
1171 function Flag17 (N : Node_Id) return Boolean;
1172 pragma Inline (Flag17);
1174 function Flag18 (N : Node_Id) return Boolean;
1175 pragma Inline (Flag18);
1177 function Flag19 (N : Node_Id) return Boolean;
1178 pragma Inline (Flag19);
1180 function Flag20 (N : Node_Id) return Boolean;
1181 pragma Inline (Flag20);
1183 function Flag21 (N : Node_Id) return Boolean;
1184 pragma Inline (Flag21);
1186 function Flag22 (N : Node_Id) return Boolean;
1187 pragma Inline (Flag22);
1189 function Flag23 (N : Node_Id) return Boolean;
1190 pragma Inline (Flag23);
1192 function Flag24 (N : Node_Id) return Boolean;
1193 pragma Inline (Flag24);
1195 function Flag25 (N : Node_Id) return Boolean;
1196 pragma Inline (Flag25);
1198 function Flag26 (N : Node_Id) return Boolean;
1199 pragma Inline (Flag26);
1201 function Flag27 (N : Node_Id) return Boolean;
1202 pragma Inline (Flag27);
1204 function Flag28 (N : Node_Id) return Boolean;
1205 pragma Inline (Flag28);
1207 function Flag29 (N : Node_Id) return Boolean;
1208 pragma Inline (Flag29);
1210 function Flag30 (N : Node_Id) return Boolean;
1211 pragma Inline (Flag30);
1213 function Flag31 (N : Node_Id) return Boolean;
1214 pragma Inline (Flag31);
1216 function Flag32 (N : Node_Id) return Boolean;
1217 pragma Inline (Flag32);
1219 function Flag33 (N : Node_Id) return Boolean;
1220 pragma Inline (Flag33);
1222 function Flag34 (N : Node_Id) return Boolean;
1223 pragma Inline (Flag34);
1225 function Flag35 (N : Node_Id) return Boolean;
1226 pragma Inline (Flag35);
1228 function Flag36 (N : Node_Id) return Boolean;
1229 pragma Inline (Flag36);
1231 function Flag37 (N : Node_Id) return Boolean;
1232 pragma Inline (Flag37);
1234 function Flag38 (N : Node_Id) return Boolean;
1235 pragma Inline (Flag38);
1237 function Flag39 (N : Node_Id) return Boolean;
1238 pragma Inline (Flag39);
1240 function Flag40 (N : Node_Id) return Boolean;
1241 pragma Inline (Flag40);
1243 function Flag41 (N : Node_Id) return Boolean;
1244 pragma Inline (Flag41);
1246 function Flag42 (N : Node_Id) return Boolean;
1247 pragma Inline (Flag42);
1249 function Flag43 (N : Node_Id) return Boolean;
1250 pragma Inline (Flag43);
1252 function Flag44 (N : Node_Id) return Boolean;
1253 pragma Inline (Flag44);
1255 function Flag45 (N : Node_Id) return Boolean;
1256 pragma Inline (Flag45);
1258 function Flag46 (N : Node_Id) return Boolean;
1259 pragma Inline (Flag46);
1261 function Flag47 (N : Node_Id) return Boolean;
1262 pragma Inline (Flag47);
1264 function Flag48 (N : Node_Id) return Boolean;
1265 pragma Inline (Flag48);
1267 function Flag49 (N : Node_Id) return Boolean;
1268 pragma Inline (Flag49);
1270 function Flag50 (N : Node_Id) return Boolean;
1271 pragma Inline (Flag50);
1273 function Flag51 (N : Node_Id) return Boolean;
1274 pragma Inline (Flag51);
1276 function Flag52 (N : Node_Id) return Boolean;
1277 pragma Inline (Flag52);
1279 function Flag53 (N : Node_Id) return Boolean;
1280 pragma Inline (Flag53);
1282 function Flag54 (N : Node_Id) return Boolean;
1283 pragma Inline (Flag54);
1285 function Flag55 (N : Node_Id) return Boolean;
1286 pragma Inline (Flag55);
1288 function Flag56 (N : Node_Id) return Boolean;
1289 pragma Inline (Flag56);
1291 function Flag57 (N : Node_Id) return Boolean;
1292 pragma Inline (Flag57);
1294 function Flag58 (N : Node_Id) return Boolean;
1295 pragma Inline (Flag58);
1297 function Flag59 (N : Node_Id) return Boolean;
1298 pragma Inline (Flag59);
1300 function Flag60 (N : Node_Id) return Boolean;
1301 pragma Inline (Flag60);
1303 function Flag61 (N : Node_Id) return Boolean;
1304 pragma Inline (Flag61);
1306 function Flag62 (N : Node_Id) return Boolean;
1307 pragma Inline (Flag62);
1309 function Flag63 (N : Node_Id) return Boolean;
1310 pragma Inline (Flag63);
1312 function Flag64 (N : Node_Id) return Boolean;
1313 pragma Inline (Flag64);
1315 function Flag65 (N : Node_Id) return Boolean;
1316 pragma Inline (Flag65);
1318 function Flag66 (N : Node_Id) return Boolean;
1319 pragma Inline (Flag66);
1321 function Flag67 (N : Node_Id) return Boolean;
1322 pragma Inline (Flag67);
1324 function Flag68 (N : Node_Id) return Boolean;
1325 pragma Inline (Flag68);
1327 function Flag69 (N : Node_Id) return Boolean;
1328 pragma Inline (Flag69);
1330 function Flag70 (N : Node_Id) return Boolean;
1331 pragma Inline (Flag70);
1333 function Flag71 (N : Node_Id) return Boolean;
1334 pragma Inline (Flag71);
1336 function Flag72 (N : Node_Id) return Boolean;
1337 pragma Inline (Flag72);
1339 function Flag73 (N : Node_Id) return Boolean;
1340 pragma Inline (Flag73);
1342 function Flag74 (N : Node_Id) return Boolean;
1343 pragma Inline (Flag74);
1345 function Flag75 (N : Node_Id) return Boolean;
1346 pragma Inline (Flag75);
1348 function Flag76 (N : Node_Id) return Boolean;
1349 pragma Inline (Flag76);
1351 function Flag77 (N : Node_Id) return Boolean;
1352 pragma Inline (Flag77);
1354 function Flag78 (N : Node_Id) return Boolean;
1355 pragma Inline (Flag78);
1357 function Flag79 (N : Node_Id) return Boolean;
1358 pragma Inline (Flag79);
1360 function Flag80 (N : Node_Id) return Boolean;
1361 pragma Inline (Flag80);
1363 function Flag81 (N : Node_Id) return Boolean;
1364 pragma Inline (Flag81);
1366 function Flag82 (N : Node_Id) return Boolean;
1367 pragma Inline (Flag82);
1369 function Flag83 (N : Node_Id) return Boolean;
1370 pragma Inline (Flag83);
1372 function Flag84 (N : Node_Id) return Boolean;
1373 pragma Inline (Flag84);
1375 function Flag85 (N : Node_Id) return Boolean;
1376 pragma Inline (Flag85);
1378 function Flag86 (N : Node_Id) return Boolean;
1379 pragma Inline (Flag86);
1381 function Flag87 (N : Node_Id) return Boolean;
1382 pragma Inline (Flag87);
1384 function Flag88 (N : Node_Id) return Boolean;
1385 pragma Inline (Flag88);
1387 function Flag89 (N : Node_Id) return Boolean;
1388 pragma Inline (Flag89);
1390 function Flag90 (N : Node_Id) return Boolean;
1391 pragma Inline (Flag90);
1393 function Flag91 (N : Node_Id) return Boolean;
1394 pragma Inline (Flag91);
1396 function Flag92 (N : Node_Id) return Boolean;
1397 pragma Inline (Flag92);
1399 function Flag93 (N : Node_Id) return Boolean;
1400 pragma Inline (Flag93);
1402 function Flag94 (N : Node_Id) return Boolean;
1403 pragma Inline (Flag94);
1405 function Flag95 (N : Node_Id) return Boolean;
1406 pragma Inline (Flag95);
1408 function Flag96 (N : Node_Id) return Boolean;
1409 pragma Inline (Flag96);
1411 function Flag97 (N : Node_Id) return Boolean;
1412 pragma Inline (Flag97);
1414 function Flag98 (N : Node_Id) return Boolean;
1415 pragma Inline (Flag98);
1417 function Flag99 (N : Node_Id) return Boolean;
1418 pragma Inline (Flag99);
1420 function Flag100 (N : Node_Id) return Boolean;
1421 pragma Inline (Flag100);
1423 function Flag101 (N : Node_Id) return Boolean;
1424 pragma Inline (Flag101);
1426 function Flag102 (N : Node_Id) return Boolean;
1427 pragma Inline (Flag102);
1429 function Flag103 (N : Node_Id) return Boolean;
1430 pragma Inline (Flag103);
1432 function Flag104 (N : Node_Id) return Boolean;
1433 pragma Inline (Flag104);
1435 function Flag105 (N : Node_Id) return Boolean;
1436 pragma Inline (Flag105);
1438 function Flag106 (N : Node_Id) return Boolean;
1439 pragma Inline (Flag106);
1441 function Flag107 (N : Node_Id) return Boolean;
1442 pragma Inline (Flag107);
1444 function Flag108 (N : Node_Id) return Boolean;
1445 pragma Inline (Flag108);
1447 function Flag109 (N : Node_Id) return Boolean;
1448 pragma Inline (Flag109);
1450 function Flag110 (N : Node_Id) return Boolean;
1451 pragma Inline (Flag110);
1453 function Flag111 (N : Node_Id) return Boolean;
1454 pragma Inline (Flag111);
1456 function Flag112 (N : Node_Id) return Boolean;
1457 pragma Inline (Flag112);
1459 function Flag113 (N : Node_Id) return Boolean;
1460 pragma Inline (Flag113);
1462 function Flag114 (N : Node_Id) return Boolean;
1463 pragma Inline (Flag114);
1465 function Flag115 (N : Node_Id) return Boolean;
1466 pragma Inline (Flag115);
1468 function Flag116 (N : Node_Id) return Boolean;
1469 pragma Inline (Flag116);
1471 function Flag117 (N : Node_Id) return Boolean;
1472 pragma Inline (Flag117);
1474 function Flag118 (N : Node_Id) return Boolean;
1475 pragma Inline (Flag118);
1477 function Flag119 (N : Node_Id) return Boolean;
1478 pragma Inline (Flag119);
1480 function Flag120 (N : Node_Id) return Boolean;
1481 pragma Inline (Flag120);
1483 function Flag121 (N : Node_Id) return Boolean;
1484 pragma Inline (Flag121);
1486 function Flag122 (N : Node_Id) return Boolean;
1487 pragma Inline (Flag122);
1489 function Flag123 (N : Node_Id) return Boolean;
1490 pragma Inline (Flag123);
1492 function Flag124 (N : Node_Id) return Boolean;
1493 pragma Inline (Flag124);
1495 function Flag125 (N : Node_Id) return Boolean;
1496 pragma Inline (Flag125);
1498 function Flag126 (N : Node_Id) return Boolean;
1499 pragma Inline (Flag126);
1501 function Flag127 (N : Node_Id) return Boolean;
1502 pragma Inline (Flag127);
1504 function Flag128 (N : Node_Id) return Boolean;
1505 pragma Inline (Flag128);
1507 function Flag129 (N : Node_Id) return Boolean;
1508 pragma Inline (Flag129);
1510 function Flag130 (N : Node_Id) return Boolean;
1511 pragma Inline (Flag130);
1513 function Flag131 (N : Node_Id) return Boolean;
1514 pragma Inline (Flag131);
1516 function Flag132 (N : Node_Id) return Boolean;
1517 pragma Inline (Flag132);
1519 function Flag133 (N : Node_Id) return Boolean;
1520 pragma Inline (Flag133);
1522 function Flag134 (N : Node_Id) return Boolean;
1523 pragma Inline (Flag134);
1525 function Flag135 (N : Node_Id) return Boolean;
1526 pragma Inline (Flag135);
1528 function Flag136 (N : Node_Id) return Boolean;
1529 pragma Inline (Flag136);
1531 function Flag137 (N : Node_Id) return Boolean;
1532 pragma Inline (Flag137);
1534 function Flag138 (N : Node_Id) return Boolean;
1535 pragma Inline (Flag138);
1537 function Flag139 (N : Node_Id) return Boolean;
1538 pragma Inline (Flag139);
1540 function Flag140 (N : Node_Id) return Boolean;
1541 pragma Inline (Flag140);
1543 function Flag141 (N : Node_Id) return Boolean;
1544 pragma Inline (Flag141);
1546 function Flag142 (N : Node_Id) return Boolean;
1547 pragma Inline (Flag142);
1549 function Flag143 (N : Node_Id) return Boolean;
1550 pragma Inline (Flag143);
1552 function Flag144 (N : Node_Id) return Boolean;
1553 pragma Inline (Flag144);
1555 function Flag145 (N : Node_Id) return Boolean;
1556 pragma Inline (Flag145);
1558 function Flag146 (N : Node_Id) return Boolean;
1559 pragma Inline (Flag146);
1561 function Flag147 (N : Node_Id) return Boolean;
1562 pragma Inline (Flag147);
1564 function Flag148 (N : Node_Id) return Boolean;
1565 pragma Inline (Flag148);
1567 function Flag149 (N : Node_Id) return Boolean;
1568 pragma Inline (Flag149);
1570 function Flag150 (N : Node_Id) return Boolean;
1571 pragma Inline (Flag150);
1573 function Flag151 (N : Node_Id) return Boolean;
1574 pragma Inline (Flag151);
1576 function Flag152 (N : Node_Id) return Boolean;
1577 pragma Inline (Flag152);
1579 function Flag153 (N : Node_Id) return Boolean;
1580 pragma Inline (Flag153);
1582 function Flag154 (N : Node_Id) return Boolean;
1583 pragma Inline (Flag154);
1585 function Flag155 (N : Node_Id) return Boolean;
1586 pragma Inline (Flag155);
1588 function Flag156 (N : Node_Id) return Boolean;
1589 pragma Inline (Flag156);
1591 function Flag157 (N : Node_Id) return Boolean;
1592 pragma Inline (Flag157);
1594 function Flag158 (N : Node_Id) return Boolean;
1595 pragma Inline (Flag158);
1597 function Flag159 (N : Node_Id) return Boolean;
1598 pragma Inline (Flag159);
1600 function Flag160 (N : Node_Id) return Boolean;
1601 pragma Inline (Flag160);
1603 function Flag161 (N : Node_Id) return Boolean;
1604 pragma Inline (Flag161);
1606 function Flag162 (N : Node_Id) return Boolean;
1607 pragma Inline (Flag162);
1609 function Flag163 (N : Node_Id) return Boolean;
1610 pragma Inline (Flag163);
1612 function Flag164 (N : Node_Id) return Boolean;
1613 pragma Inline (Flag164);
1615 function Flag165 (N : Node_Id) return Boolean;
1616 pragma Inline (Flag165);
1618 function Flag166 (N : Node_Id) return Boolean;
1619 pragma Inline (Flag166);
1621 function Flag167 (N : Node_Id) return Boolean;
1622 pragma Inline (Flag167);
1624 function Flag168 (N : Node_Id) return Boolean;
1625 pragma Inline (Flag168);
1627 function Flag169 (N : Node_Id) return Boolean;
1628 pragma Inline (Flag169);
1630 function Flag170 (N : Node_Id) return Boolean;
1631 pragma Inline (Flag170);
1633 function Flag171 (N : Node_Id) return Boolean;
1634 pragma Inline (Flag171);
1636 function Flag172 (N : Node_Id) return Boolean;
1637 pragma Inline (Flag172);
1639 function Flag173 (N : Node_Id) return Boolean;
1640 pragma Inline (Flag173);
1642 function Flag174 (N : Node_Id) return Boolean;
1643 pragma Inline (Flag174);
1645 function Flag175 (N : Node_Id) return Boolean;
1646 pragma Inline (Flag175);
1648 function Flag176 (N : Node_Id) return Boolean;
1649 pragma Inline (Flag176);
1651 function Flag177 (N : Node_Id) return Boolean;
1652 pragma Inline (Flag177);
1654 function Flag178 (N : Node_Id) return Boolean;
1655 pragma Inline (Flag178);
1657 function Flag179 (N : Node_Id) return Boolean;
1658 pragma Inline (Flag179);
1660 function Flag180 (N : Node_Id) return Boolean;
1661 pragma Inline (Flag180);
1663 function Flag181 (N : Node_Id) return Boolean;
1664 pragma Inline (Flag181);
1666 function Flag182 (N : Node_Id) return Boolean;
1667 pragma Inline (Flag182);
1669 function Flag183 (N : Node_Id) return Boolean;
1670 pragma Inline (Flag183);
1672 function Flag184 (N : Node_Id) return Boolean;
1673 pragma Inline (Flag184);
1675 function Flag185 (N : Node_Id) return Boolean;
1676 pragma Inline (Flag185);
1678 function Flag186 (N : Node_Id) return Boolean;
1679 pragma Inline (Flag186);
1681 function Flag187 (N : Node_Id) return Boolean;
1682 pragma Inline (Flag187);
1684 function Flag188 (N : Node_Id) return Boolean;
1685 pragma Inline (Flag188);
1687 function Flag189 (N : Node_Id) return Boolean;
1688 pragma Inline (Flag189);
1690 function Flag190 (N : Node_Id) return Boolean;
1691 pragma Inline (Flag190);
1693 function Flag191 (N : Node_Id) return Boolean;
1694 pragma Inline (Flag191);
1696 function Flag192 (N : Node_Id) return Boolean;
1697 pragma Inline (Flag192);
1699 function Flag193 (N : Node_Id) return Boolean;
1700 pragma Inline (Flag193);
1702 function Flag194 (N : Node_Id) return Boolean;
1703 pragma Inline (Flag194);
1705 function Flag195 (N : Node_Id) return Boolean;
1706 pragma Inline (Flag195);
1708 function Flag196 (N : Node_Id) return Boolean;
1709 pragma Inline (Flag196);
1711 function Flag197 (N : Node_Id) return Boolean;
1712 pragma Inline (Flag197);
1714 function Flag198 (N : Node_Id) return Boolean;
1715 pragma Inline (Flag198);
1717 function Flag199 (N : Node_Id) return Boolean;
1718 pragma Inline (Flag199);
1720 function Flag200 (N : Node_Id) return Boolean;
1721 pragma Inline (Flag200);
1723 function Flag201 (N : Node_Id) return Boolean;
1724 pragma Inline (Flag201);
1726 function Flag202 (N : Node_Id) return Boolean;
1727 pragma Inline (Flag202);
1729 function Flag203 (N : Node_Id) return Boolean;
1730 pragma Inline (Flag203);
1732 function Flag204 (N : Node_Id) return Boolean;
1733 pragma Inline (Flag204);
1735 function Flag205 (N : Node_Id) return Boolean;
1736 pragma Inline (Flag205);
1738 function Flag206 (N : Node_Id) return Boolean;
1739 pragma Inline (Flag206);
1741 function Flag207 (N : Node_Id) return Boolean;
1742 pragma Inline (Flag207);
1744 function Flag208 (N : Node_Id) return Boolean;
1745 pragma Inline (Flag208);
1747 function Flag209 (N : Node_Id) return Boolean;
1748 pragma Inline (Flag209);
1750 function Flag210 (N : Node_Id) return Boolean;
1751 pragma Inline (Flag210);
1753 function Flag211 (N : Node_Id) return Boolean;
1754 pragma Inline (Flag211);
1756 function Flag212 (N : Node_Id) return Boolean;
1757 pragma Inline (Flag212);
1759 function Flag213 (N : Node_Id) return Boolean;
1760 pragma Inline (Flag213);
1762 function Flag214 (N : Node_Id) return Boolean;
1763 pragma Inline (Flag214);
1765 function Flag215 (N : Node_Id) return Boolean;
1766 pragma Inline (Flag215);
1768 function Flag216 (N : Node_Id) return Boolean;
1769 pragma Inline (Flag216);
1771 function Flag217 (N : Node_Id) return Boolean;
1772 pragma Inline (Flag217);
1774 function Flag218 (N : Node_Id) return Boolean;
1775 pragma Inline (Flag218);
1777 function Flag219 (N : Node_Id) return Boolean;
1778 pragma Inline (Flag219);
1780 function Flag220 (N : Node_Id) return Boolean;
1781 pragma Inline (Flag220);
1783 function Flag221 (N : Node_Id) return Boolean;
1784 pragma Inline (Flag221);
1786 function Flag222 (N : Node_Id) return Boolean;
1787 pragma Inline (Flag222);
1789 function Flag223 (N : Node_Id) return Boolean;
1790 pragma Inline (Flag223);
1792 function Flag224 (N : Node_Id) return Boolean;
1793 pragma Inline (Flag224);
1795 function Flag225 (N : Node_Id) return Boolean;
1796 pragma Inline (Flag225);
1798 function Flag226 (N : Node_Id) return Boolean;
1799 pragma Inline (Flag226);
1801 function Flag227 (N : Node_Id) return Boolean;
1802 pragma Inline (Flag227);
1804 function Flag228 (N : Node_Id) return Boolean;
1805 pragma Inline (Flag228);
1807 function Flag229 (N : Node_Id) return Boolean;
1808 pragma Inline (Flag229);
1810 function Flag230 (N : Node_Id) return Boolean;
1811 pragma Inline (Flag230);
1813 function Flag231 (N : Node_Id) return Boolean;
1814 pragma Inline (Flag231);
1816 function Flag232 (N : Node_Id) return Boolean;
1817 pragma Inline (Flag232);
1819 function Flag233 (N : Node_Id) return Boolean;
1820 pragma Inline (Flag233);
1822 function Flag234 (N : Node_Id) return Boolean;
1823 pragma Inline (Flag234);
1825 function Flag235 (N : Node_Id) return Boolean;
1826 pragma Inline (Flag235);
1828 function Flag236 (N : Node_Id) return Boolean;
1829 pragma Inline (Flag236);
1831 function Flag237 (N : Node_Id) return Boolean;
1832 pragma Inline (Flag237);
1834 function Flag238 (N : Node_Id) return Boolean;
1835 pragma Inline (Flag238);
1837 function Flag239 (N : Node_Id) return Boolean;
1838 pragma Inline (Flag239);
1840 function Flag240 (N : Node_Id) return Boolean;
1841 pragma Inline (Flag240);
1843 function Flag241 (N : Node_Id) return Boolean;
1844 pragma Inline (Flag241);
1846 function Flag242 (N : Node_Id) return Boolean;
1847 pragma Inline (Flag242);
1849 function Flag243 (N : Node_Id) return Boolean;
1850 pragma Inline (Flag243);
1852 function Flag244 (N : Node_Id) return Boolean;
1853 pragma Inline (Flag244);
1855 function Flag245 (N : Node_Id) return Boolean;
1856 pragma Inline (Flag245);
1858 function Flag246 (N : Node_Id) return Boolean;
1859 pragma Inline (Flag246);
1861 function Flag247 (N : Node_Id) return Boolean;
1862 pragma Inline (Flag247);
1864 -- Procedures to set value of indicated field
1866 procedure Set_Nkind (N : Node_Id; Val : Node_Kind);
1867 pragma Inline (Set_Nkind);
1869 procedure Set_Field1 (N : Node_Id; Val : Union_Id);
1870 pragma Inline (Set_Field1);
1872 procedure Set_Field2 (N : Node_Id; Val : Union_Id);
1873 pragma Inline (Set_Field2);
1875 procedure Set_Field3 (N : Node_Id; Val : Union_Id);
1876 pragma Inline (Set_Field3);
1878 procedure Set_Field4 (N : Node_Id; Val : Union_Id);
1879 pragma Inline (Set_Field4);
1881 procedure Set_Field5 (N : Node_Id; Val : Union_Id);
1882 pragma Inline (Set_Field5);
1884 procedure Set_Field6 (N : Node_Id; Val : Union_Id);
1885 pragma Inline (Set_Field6);
1887 procedure Set_Field7 (N : Node_Id; Val : Union_Id);
1888 pragma Inline (Set_Field7);
1890 procedure Set_Field8 (N : Node_Id; Val : Union_Id);
1891 pragma Inline (Set_Field8);
1893 procedure Set_Field9 (N : Node_Id; Val : Union_Id);
1894 pragma Inline (Set_Field9);
1896 procedure Set_Field10 (N : Node_Id; Val : Union_Id);
1897 pragma Inline (Set_Field10);
1899 procedure Set_Field11 (N : Node_Id; Val : Union_Id);
1900 pragma Inline (Set_Field11);
1902 procedure Set_Field12 (N : Node_Id; Val : Union_Id);
1903 pragma Inline (Set_Field12);
1905 procedure Set_Field13 (N : Node_Id; Val : Union_Id);
1906 pragma Inline (Set_Field13);
1908 procedure Set_Field14 (N : Node_Id; Val : Union_Id);
1909 pragma Inline (Set_Field14);
1911 procedure Set_Field15 (N : Node_Id; Val : Union_Id);
1912 pragma Inline (Set_Field15);
1914 procedure Set_Field16 (N : Node_Id; Val : Union_Id);
1915 pragma Inline (Set_Field16);
1917 procedure Set_Field17 (N : Node_Id; Val : Union_Id);
1918 pragma Inline (Set_Field17);
1920 procedure Set_Field18 (N : Node_Id; Val : Union_Id);
1921 pragma Inline (Set_Field18);
1923 procedure Set_Field19 (N : Node_Id; Val : Union_Id);
1924 pragma Inline (Set_Field19);
1926 procedure Set_Field20 (N : Node_Id; Val : Union_Id);
1927 pragma Inline (Set_Field20);
1929 procedure Set_Field21 (N : Node_Id; Val : Union_Id);
1930 pragma Inline (Set_Field21);
1932 procedure Set_Field22 (N : Node_Id; Val : Union_Id);
1933 pragma Inline (Set_Field22);
1935 procedure Set_Field23 (N : Node_Id; Val : Union_Id);
1936 pragma Inline (Set_Field23);
1938 procedure Set_Field24 (N : Node_Id; Val : Union_Id);
1939 pragma Inline (Set_Field24);
1941 procedure Set_Field25 (N : Node_Id; Val : Union_Id);
1942 pragma Inline (Set_Field25);
1944 procedure Set_Field26 (N : Node_Id; Val : Union_Id);
1945 pragma Inline (Set_Field26);
1947 procedure Set_Field27 (N : Node_Id; Val : Union_Id);
1948 pragma Inline (Set_Field27);
1950 procedure Set_Field28 (N : Node_Id; Val : Union_Id);
1951 pragma Inline (Set_Field28);
1953 procedure Set_Node1 (N : Node_Id; Val : Node_Id);
1954 pragma Inline (Set_Node1);
1956 procedure Set_Node2 (N : Node_Id; Val : Node_Id);
1957 pragma Inline (Set_Node2);
1959 procedure Set_Node3 (N : Node_Id; Val : Node_Id);
1960 pragma Inline (Set_Node3);
1962 procedure Set_Node4 (N : Node_Id; Val : Node_Id);
1963 pragma Inline (Set_Node4);
1965 procedure Set_Node5 (N : Node_Id; Val : Node_Id);
1966 pragma Inline (Set_Node5);
1968 procedure Set_Node6 (N : Node_Id; Val : Node_Id);
1969 pragma Inline (Set_Node6);
1971 procedure Set_Node7 (N : Node_Id; Val : Node_Id);
1972 pragma Inline (Set_Node7);
1974 procedure Set_Node8 (N : Node_Id; Val : Node_Id);
1975 pragma Inline (Set_Node8);
1977 procedure Set_Node9 (N : Node_Id; Val : Node_Id);
1978 pragma Inline (Set_Node9);
1980 procedure Set_Node10 (N : Node_Id; Val : Node_Id);
1981 pragma Inline (Set_Node10);
1983 procedure Set_Node11 (N : Node_Id; Val : Node_Id);
1984 pragma Inline (Set_Node11);
1986 procedure Set_Node12 (N : Node_Id; Val : Node_Id);
1987 pragma Inline (Set_Node12);
1989 procedure Set_Node13 (N : Node_Id; Val : Node_Id);
1990 pragma Inline (Set_Node13);
1992 procedure Set_Node14 (N : Node_Id; Val : Node_Id);
1993 pragma Inline (Set_Node14);
1995 procedure Set_Node15 (N : Node_Id; Val : Node_Id);
1996 pragma Inline (Set_Node15);
1998 procedure Set_Node16 (N : Node_Id; Val : Node_Id);
1999 pragma Inline (Set_Node16);
2001 procedure Set_Node17 (N : Node_Id; Val : Node_Id);
2002 pragma Inline (Set_Node17);
2004 procedure Set_Node18 (N : Node_Id; Val : Node_Id);
2005 pragma Inline (Set_Node18);
2007 procedure Set_Node19 (N : Node_Id; Val : Node_Id);
2008 pragma Inline (Set_Node19);
2010 procedure Set_Node20 (N : Node_Id; Val : Node_Id);
2011 pragma Inline (Set_Node20);
2013 procedure Set_Node21 (N : Node_Id; Val : Node_Id);
2014 pragma Inline (Set_Node21);
2016 procedure Set_Node22 (N : Node_Id; Val : Node_Id);
2017 pragma Inline (Set_Node22);
2019 procedure Set_Node23 (N : Node_Id; Val : Node_Id);
2020 pragma Inline (Set_Node23);
2022 procedure Set_Node24 (N : Node_Id; Val : Node_Id);
2023 pragma Inline (Set_Node24);
2025 procedure Set_Node25 (N : Node_Id; Val : Node_Id);
2026 pragma Inline (Set_Node25);
2028 procedure Set_Node26 (N : Node_Id; Val : Node_Id);
2029 pragma Inline (Set_Node26);
2031 procedure Set_Node27 (N : Node_Id; Val : Node_Id);
2032 pragma Inline (Set_Node27);
2034 procedure Set_Node28 (N : Node_Id; Val : Node_Id);
2035 pragma Inline (Set_Node28);
2037 procedure Set_List1 (N : Node_Id; Val : List_Id);
2038 pragma Inline (Set_List1);
2040 procedure Set_List2 (N : Node_Id; Val : List_Id);
2041 pragma Inline (Set_List2);
2043 procedure Set_List3 (N : Node_Id; Val : List_Id);
2044 pragma Inline (Set_List3);
2046 procedure Set_List4 (N : Node_Id; Val : List_Id);
2047 pragma Inline (Set_List4);
2049 procedure Set_List5 (N : Node_Id; Val : List_Id);
2050 pragma Inline (Set_List5);
2052 procedure Set_List10 (N : Node_Id; Val : List_Id);
2053 pragma Inline (Set_List10);
2055 procedure Set_List14 (N : Node_Id; Val : List_Id);
2056 pragma Inline (Set_List14);
2058 procedure Set_Elist1 (N : Node_Id; Val : Elist_Id);
2059 pragma Inline (Set_Elist1);
2061 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id);
2062 pragma Inline (Set_Elist2);
2064 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id);
2065 pragma Inline (Set_Elist3);
2067 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id);
2068 pragma Inline (Set_Elist4);
2070 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id);
2071 pragma Inline (Set_Elist8);
2073 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id);
2074 pragma Inline (Set_Elist13);
2076 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id);
2077 pragma Inline (Set_Elist15);
2079 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id);
2080 pragma Inline (Set_Elist16);
2082 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id);
2083 pragma Inline (Set_Elist18);
2085 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id);
2086 pragma Inline (Set_Elist21);
2088 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id);
2089 pragma Inline (Set_Elist23);
2091 procedure Set_Elist25 (N : Node_Id; Val : Elist_Id);
2092 pragma Inline (Set_Elist25);
2094 procedure Set_Elist26 (N : Node_Id; Val : Elist_Id);
2095 pragma Inline (Set_Elist26);
2097 procedure Set_Name1 (N : Node_Id; Val : Name_Id);
2098 pragma Inline (Set_Name1);
2100 procedure Set_Name2 (N : Node_Id; Val : Name_Id);
2101 pragma Inline (Set_Name2);
2103 procedure Set_Str3 (N : Node_Id; Val : String_Id);
2104 pragma Inline (Set_Str3);
2106 procedure Set_Uint2 (N : Node_Id; Val : Uint);
2107 pragma Inline (Set_Uint2);
2109 procedure Set_Uint3 (N : Node_Id; Val : Uint);
2110 pragma Inline (Set_Uint3);
2112 procedure Set_Uint4 (N : Node_Id; Val : Uint);
2113 pragma Inline (Set_Uint4);
2115 procedure Set_Uint5 (N : Node_Id; Val : Uint);
2116 pragma Inline (Set_Uint5);
2118 procedure Set_Uint8 (N : Node_Id; Val : Uint);
2119 pragma Inline (Set_Uint8);
2121 procedure Set_Uint9 (N : Node_Id; Val : Uint);
2122 pragma Inline (Set_Uint9);
2124 procedure Set_Uint10 (N : Node_Id; Val : Uint);
2125 pragma Inline (Set_Uint10);
2127 procedure Set_Uint11 (N : Node_Id; Val : Uint);
2128 pragma Inline (Set_Uint11);
2130 procedure Set_Uint12 (N : Node_Id; Val : Uint);
2131 pragma Inline (Set_Uint12);
2133 procedure Set_Uint13 (N : Node_Id; Val : Uint);
2134 pragma Inline (Set_Uint13);
2136 procedure Set_Uint14 (N : Node_Id; Val : Uint);
2137 pragma Inline (Set_Uint14);
2139 procedure Set_Uint15 (N : Node_Id; Val : Uint);
2140 pragma Inline (Set_Uint15);
2142 procedure Set_Uint16 (N : Node_Id; Val : Uint);
2143 pragma Inline (Set_Uint16);
2145 procedure Set_Uint17 (N : Node_Id; Val : Uint);
2146 pragma Inline (Set_Uint17);
2148 procedure Set_Uint22 (N : Node_Id; Val : Uint);
2149 pragma Inline (Set_Uint22);
2151 procedure Set_Ureal3 (N : Node_Id; Val : Ureal);
2152 pragma Inline (Set_Ureal3);
2154 procedure Set_Ureal18 (N : Node_Id; Val : Ureal);
2155 pragma Inline (Set_Ureal18);
2157 procedure Set_Ureal21 (N : Node_Id; Val : Ureal);
2158 pragma Inline (Set_Ureal21);
2160 procedure Set_Flag4 (N : Node_Id; Val : Boolean);
2161 pragma Inline (Set_Flag4);
2163 procedure Set_Flag5 (N : Node_Id; Val : Boolean);
2164 pragma Inline (Set_Flag5);
2166 procedure Set_Flag6 (N : Node_Id; Val : Boolean);
2167 pragma Inline (Set_Flag6);
2169 procedure Set_Flag7 (N : Node_Id; Val : Boolean);
2170 pragma Inline (Set_Flag7);
2172 procedure Set_Flag8 (N : Node_Id; Val : Boolean);
2173 pragma Inline (Set_Flag8);
2175 procedure Set_Flag9 (N : Node_Id; Val : Boolean);
2176 pragma Inline (Set_Flag9);
2178 procedure Set_Flag10 (N : Node_Id; Val : Boolean);
2179 pragma Inline (Set_Flag10);
2181 procedure Set_Flag11 (N : Node_Id; Val : Boolean);
2182 pragma Inline (Set_Flag11);
2184 procedure Set_Flag12 (N : Node_Id; Val : Boolean);
2185 pragma Inline (Set_Flag12);
2187 procedure Set_Flag13 (N : Node_Id; Val : Boolean);
2188 pragma Inline (Set_Flag13);
2190 procedure Set_Flag14 (N : Node_Id; Val : Boolean);
2191 pragma Inline (Set_Flag14);
2193 procedure Set_Flag15 (N : Node_Id; Val : Boolean);
2194 pragma Inline (Set_Flag15);
2196 procedure Set_Flag16 (N : Node_Id; Val : Boolean);
2197 pragma Inline (Set_Flag16);
2199 procedure Set_Flag17 (N : Node_Id; Val : Boolean);
2200 pragma Inline (Set_Flag17);
2202 procedure Set_Flag18 (N : Node_Id; Val : Boolean);
2203 pragma Inline (Set_Flag18);
2205 procedure Set_Flag19 (N : Node_Id; Val : Boolean);
2206 pragma Inline (Set_Flag19);
2208 procedure Set_Flag20 (N : Node_Id; Val : Boolean);
2209 pragma Inline (Set_Flag20);
2211 procedure Set_Flag21 (N : Node_Id; Val : Boolean);
2212 pragma Inline (Set_Flag21);
2214 procedure Set_Flag22 (N : Node_Id; Val : Boolean);
2215 pragma Inline (Set_Flag22);
2217 procedure Set_Flag23 (N : Node_Id; Val : Boolean);
2218 pragma Inline (Set_Flag23);
2220 procedure Set_Flag24 (N : Node_Id; Val : Boolean);
2221 pragma Inline (Set_Flag24);
2223 procedure Set_Flag25 (N : Node_Id; Val : Boolean);
2224 pragma Inline (Set_Flag25);
2226 procedure Set_Flag26 (N : Node_Id; Val : Boolean);
2227 pragma Inline (Set_Flag26);
2229 procedure Set_Flag27 (N : Node_Id; Val : Boolean);
2230 pragma Inline (Set_Flag27);
2232 procedure Set_Flag28 (N : Node_Id; Val : Boolean);
2233 pragma Inline (Set_Flag28);
2235 procedure Set_Flag29 (N : Node_Id; Val : Boolean);
2236 pragma Inline (Set_Flag29);
2238 procedure Set_Flag30 (N : Node_Id; Val : Boolean);
2239 pragma Inline (Set_Flag30);
2241 procedure Set_Flag31 (N : Node_Id; Val : Boolean);
2242 pragma Inline (Set_Flag31);
2244 procedure Set_Flag32 (N : Node_Id; Val : Boolean);
2245 pragma Inline (Set_Flag32);
2247 procedure Set_Flag33 (N : Node_Id; Val : Boolean);
2248 pragma Inline (Set_Flag33);
2250 procedure Set_Flag34 (N : Node_Id; Val : Boolean);
2251 pragma Inline (Set_Flag34);
2253 procedure Set_Flag35 (N : Node_Id; Val : Boolean);
2254 pragma Inline (Set_Flag35);
2256 procedure Set_Flag36 (N : Node_Id; Val : Boolean);
2257 pragma Inline (Set_Flag36);
2259 procedure Set_Flag37 (N : Node_Id; Val : Boolean);
2260 pragma Inline (Set_Flag37);
2262 procedure Set_Flag38 (N : Node_Id; Val : Boolean);
2263 pragma Inline (Set_Flag38);
2265 procedure Set_Flag39 (N : Node_Id; Val : Boolean);
2266 pragma Inline (Set_Flag39);
2268 procedure Set_Flag40 (N : Node_Id; Val : Boolean);
2269 pragma Inline (Set_Flag40);
2271 procedure Set_Flag41 (N : Node_Id; Val : Boolean);
2272 pragma Inline (Set_Flag41);
2274 procedure Set_Flag42 (N : Node_Id; Val : Boolean);
2275 pragma Inline (Set_Flag42);
2277 procedure Set_Flag43 (N : Node_Id; Val : Boolean);
2278 pragma Inline (Set_Flag43);
2280 procedure Set_Flag44 (N : Node_Id; Val : Boolean);
2281 pragma Inline (Set_Flag44);
2283 procedure Set_Flag45 (N : Node_Id; Val : Boolean);
2284 pragma Inline (Set_Flag45);
2286 procedure Set_Flag46 (N : Node_Id; Val : Boolean);
2287 pragma Inline (Set_Flag46);
2289 procedure Set_Flag47 (N : Node_Id; Val : Boolean);
2290 pragma Inline (Set_Flag47);
2292 procedure Set_Flag48 (N : Node_Id; Val : Boolean);
2293 pragma Inline (Set_Flag48);
2295 procedure Set_Flag49 (N : Node_Id; Val : Boolean);
2296 pragma Inline (Set_Flag49);
2298 procedure Set_Flag50 (N : Node_Id; Val : Boolean);
2299 pragma Inline (Set_Flag50);
2301 procedure Set_Flag51 (N : Node_Id; Val : Boolean);
2302 pragma Inline (Set_Flag51);
2304 procedure Set_Flag52 (N : Node_Id; Val : Boolean);
2305 pragma Inline (Set_Flag52);
2307 procedure Set_Flag53 (N : Node_Id; Val : Boolean);
2308 pragma Inline (Set_Flag53);
2310 procedure Set_Flag54 (N : Node_Id; Val : Boolean);
2311 pragma Inline (Set_Flag54);
2313 procedure Set_Flag55 (N : Node_Id; Val : Boolean);
2314 pragma Inline (Set_Flag55);
2316 procedure Set_Flag56 (N : Node_Id; Val : Boolean);
2317 pragma Inline (Set_Flag56);
2319 procedure Set_Flag57 (N : Node_Id; Val : Boolean);
2320 pragma Inline (Set_Flag57);
2322 procedure Set_Flag58 (N : Node_Id; Val : Boolean);
2323 pragma Inline (Set_Flag58);
2325 procedure Set_Flag59 (N : Node_Id; Val : Boolean);
2326 pragma Inline (Set_Flag59);
2328 procedure Set_Flag60 (N : Node_Id; Val : Boolean);
2329 pragma Inline (Set_Flag60);
2331 procedure Set_Flag61 (N : Node_Id; Val : Boolean);
2332 pragma Inline (Set_Flag61);
2334 procedure Set_Flag62 (N : Node_Id; Val : Boolean);
2335 pragma Inline (Set_Flag62);
2337 procedure Set_Flag63 (N : Node_Id; Val : Boolean);
2338 pragma Inline (Set_Flag63);
2340 procedure Set_Flag64 (N : Node_Id; Val : Boolean);
2341 pragma Inline (Set_Flag64);
2343 procedure Set_Flag65 (N : Node_Id; Val : Boolean);
2344 pragma Inline (Set_Flag65);
2346 procedure Set_Flag66 (N : Node_Id; Val : Boolean);
2347 pragma Inline (Set_Flag66);
2349 procedure Set_Flag67 (N : Node_Id; Val : Boolean);
2350 pragma Inline (Set_Flag67);
2352 procedure Set_Flag68 (N : Node_Id; Val : Boolean);
2353 pragma Inline (Set_Flag68);
2355 procedure Set_Flag69 (N : Node_Id; Val : Boolean);
2356 pragma Inline (Set_Flag69);
2358 procedure Set_Flag70 (N : Node_Id; Val : Boolean);
2359 pragma Inline (Set_Flag70);
2361 procedure Set_Flag71 (N : Node_Id; Val : Boolean);
2362 pragma Inline (Set_Flag71);
2364 procedure Set_Flag72 (N : Node_Id; Val : Boolean);
2365 pragma Inline (Set_Flag72);
2367 procedure Set_Flag73 (N : Node_Id; Val : Boolean);
2368 pragma Inline (Set_Flag73);
2370 procedure Set_Flag74 (N : Node_Id; Val : Boolean);
2371 pragma Inline (Set_Flag74);
2373 procedure Set_Flag75 (N : Node_Id; Val : Boolean);
2374 pragma Inline (Set_Flag75);
2376 procedure Set_Flag76 (N : Node_Id; Val : Boolean);
2377 pragma Inline (Set_Flag76);
2379 procedure Set_Flag77 (N : Node_Id; Val : Boolean);
2380 pragma Inline (Set_Flag77);
2382 procedure Set_Flag78 (N : Node_Id; Val : Boolean);
2383 pragma Inline (Set_Flag78);
2385 procedure Set_Flag79 (N : Node_Id; Val : Boolean);
2386 pragma Inline (Set_Flag79);
2388 procedure Set_Flag80 (N : Node_Id; Val : Boolean);
2389 pragma Inline (Set_Flag80);
2391 procedure Set_Flag81 (N : Node_Id; Val : Boolean);
2392 pragma Inline (Set_Flag81);
2394 procedure Set_Flag82 (N : Node_Id; Val : Boolean);
2395 pragma Inline (Set_Flag82);
2397 procedure Set_Flag83 (N : Node_Id; Val : Boolean);
2398 pragma Inline (Set_Flag83);
2400 procedure Set_Flag84 (N : Node_Id; Val : Boolean);
2401 pragma Inline (Set_Flag84);
2403 procedure Set_Flag85 (N : Node_Id; Val : Boolean);
2404 pragma Inline (Set_Flag85);
2406 procedure Set_Flag86 (N : Node_Id; Val : Boolean);
2407 pragma Inline (Set_Flag86);
2409 procedure Set_Flag87 (N : Node_Id; Val : Boolean);
2410 pragma Inline (Set_Flag87);
2412 procedure Set_Flag88 (N : Node_Id; Val : Boolean);
2413 pragma Inline (Set_Flag88);
2415 procedure Set_Flag89 (N : Node_Id; Val : Boolean);
2416 pragma Inline (Set_Flag89);
2418 procedure Set_Flag90 (N : Node_Id; Val : Boolean);
2419 pragma Inline (Set_Flag90);
2421 procedure Set_Flag91 (N : Node_Id; Val : Boolean);
2422 pragma Inline (Set_Flag91);
2424 procedure Set_Flag92 (N : Node_Id; Val : Boolean);
2425 pragma Inline (Set_Flag92);
2427 procedure Set_Flag93 (N : Node_Id; Val : Boolean);
2428 pragma Inline (Set_Flag93);
2430 procedure Set_Flag94 (N : Node_Id; Val : Boolean);
2431 pragma Inline (Set_Flag94);
2433 procedure Set_Flag95 (N : Node_Id; Val : Boolean);
2434 pragma Inline (Set_Flag95);
2436 procedure Set_Flag96 (N : Node_Id; Val : Boolean);
2437 pragma Inline (Set_Flag96);
2439 procedure Set_Flag97 (N : Node_Id; Val : Boolean);
2440 pragma Inline (Set_Flag97);
2442 procedure Set_Flag98 (N : Node_Id; Val : Boolean);
2443 pragma Inline (Set_Flag98);
2445 procedure Set_Flag99 (N : Node_Id; Val : Boolean);
2446 pragma Inline (Set_Flag99);
2448 procedure Set_Flag100 (N : Node_Id; Val : Boolean);
2449 pragma Inline (Set_Flag100);
2451 procedure Set_Flag101 (N : Node_Id; Val : Boolean);
2452 pragma Inline (Set_Flag101);
2454 procedure Set_Flag102 (N : Node_Id; Val : Boolean);
2455 pragma Inline (Set_Flag102);
2457 procedure Set_Flag103 (N : Node_Id; Val : Boolean);
2458 pragma Inline (Set_Flag103);
2460 procedure Set_Flag104 (N : Node_Id; Val : Boolean);
2461 pragma Inline (Set_Flag104);
2463 procedure Set_Flag105 (N : Node_Id; Val : Boolean);
2464 pragma Inline (Set_Flag105);
2466 procedure Set_Flag106 (N : Node_Id; Val : Boolean);
2467 pragma Inline (Set_Flag106);
2469 procedure Set_Flag107 (N : Node_Id; Val : Boolean);
2470 pragma Inline (Set_Flag107);
2472 procedure Set_Flag108 (N : Node_Id; Val : Boolean);
2473 pragma Inline (Set_Flag108);
2475 procedure Set_Flag109 (N : Node_Id; Val : Boolean);
2476 pragma Inline (Set_Flag109);
2478 procedure Set_Flag110 (N : Node_Id; Val : Boolean);
2479 pragma Inline (Set_Flag110);
2481 procedure Set_Flag111 (N : Node_Id; Val : Boolean);
2482 pragma Inline (Set_Flag111);
2484 procedure Set_Flag112 (N : Node_Id; Val : Boolean);
2485 pragma Inline (Set_Flag112);
2487 procedure Set_Flag113 (N : Node_Id; Val : Boolean);
2488 pragma Inline (Set_Flag113);
2490 procedure Set_Flag114 (N : Node_Id; Val : Boolean);
2491 pragma Inline (Set_Flag114);
2493 procedure Set_Flag115 (N : Node_Id; Val : Boolean);
2494 pragma Inline (Set_Flag115);
2496 procedure Set_Flag116 (N : Node_Id; Val : Boolean);
2497 pragma Inline (Set_Flag116);
2499 procedure Set_Flag117 (N : Node_Id; Val : Boolean);
2500 pragma Inline (Set_Flag117);
2502 procedure Set_Flag118 (N : Node_Id; Val : Boolean);
2503 pragma Inline (Set_Flag118);
2505 procedure Set_Flag119 (N : Node_Id; Val : Boolean);
2506 pragma Inline (Set_Flag119);
2508 procedure Set_Flag120 (N : Node_Id; Val : Boolean);
2509 pragma Inline (Set_Flag120);
2511 procedure Set_Flag121 (N : Node_Id; Val : Boolean);
2512 pragma Inline (Set_Flag121);
2514 procedure Set_Flag122 (N : Node_Id; Val : Boolean);
2515 pragma Inline (Set_Flag122);
2517 procedure Set_Flag123 (N : Node_Id; Val : Boolean);
2518 pragma Inline (Set_Flag123);
2520 procedure Set_Flag124 (N : Node_Id; Val : Boolean);
2521 pragma Inline (Set_Flag124);
2523 procedure Set_Flag125 (N : Node_Id; Val : Boolean);
2524 pragma Inline (Set_Flag125);
2526 procedure Set_Flag126 (N : Node_Id; Val : Boolean);
2527 pragma Inline (Set_Flag126);
2529 procedure Set_Flag127 (N : Node_Id; Val : Boolean);
2530 pragma Inline (Set_Flag127);
2532 procedure Set_Flag128 (N : Node_Id; Val : Boolean);
2533 pragma Inline (Set_Flag128);
2535 procedure Set_Flag129 (N : Node_Id; Val : Boolean);
2536 pragma Inline (Set_Flag129);
2538 procedure Set_Flag130 (N : Node_Id; Val : Boolean);
2539 pragma Inline (Set_Flag130);
2541 procedure Set_Flag131 (N : Node_Id; Val : Boolean);
2542 pragma Inline (Set_Flag131);
2544 procedure Set_Flag132 (N : Node_Id; Val : Boolean);
2545 pragma Inline (Set_Flag132);
2547 procedure Set_Flag133 (N : Node_Id; Val : Boolean);
2548 pragma Inline (Set_Flag133);
2550 procedure Set_Flag134 (N : Node_Id; Val : Boolean);
2551 pragma Inline (Set_Flag134);
2553 procedure Set_Flag135 (N : Node_Id; Val : Boolean);
2554 pragma Inline (Set_Flag135);
2556 procedure Set_Flag136 (N : Node_Id; Val : Boolean);
2557 pragma Inline (Set_Flag136);
2559 procedure Set_Flag137 (N : Node_Id; Val : Boolean);
2560 pragma Inline (Set_Flag137);
2562 procedure Set_Flag138 (N : Node_Id; Val : Boolean);
2563 pragma Inline (Set_Flag138);
2565 procedure Set_Flag139 (N : Node_Id; Val : Boolean);
2566 pragma Inline (Set_Flag139);
2568 procedure Set_Flag140 (N : Node_Id; Val : Boolean);
2569 pragma Inline (Set_Flag140);
2571 procedure Set_Flag141 (N : Node_Id; Val : Boolean);
2572 pragma Inline (Set_Flag141);
2574 procedure Set_Flag142 (N : Node_Id; Val : Boolean);
2575 pragma Inline (Set_Flag142);
2577 procedure Set_Flag143 (N : Node_Id; Val : Boolean);
2578 pragma Inline (Set_Flag143);
2580 procedure Set_Flag144 (N : Node_Id; Val : Boolean);
2581 pragma Inline (Set_Flag144);
2583 procedure Set_Flag145 (N : Node_Id; Val : Boolean);
2584 pragma Inline (Set_Flag145);
2586 procedure Set_Flag146 (N : Node_Id; Val : Boolean);
2587 pragma Inline (Set_Flag146);
2589 procedure Set_Flag147 (N : Node_Id; Val : Boolean);
2590 pragma Inline (Set_Flag147);
2592 procedure Set_Flag148 (N : Node_Id; Val : Boolean);
2593 pragma Inline (Set_Flag148);
2595 procedure Set_Flag149 (N : Node_Id; Val : Boolean);
2596 pragma Inline (Set_Flag149);
2598 procedure Set_Flag150 (N : Node_Id; Val : Boolean);
2599 pragma Inline (Set_Flag150);
2601 procedure Set_Flag151 (N : Node_Id; Val : Boolean);
2602 pragma Inline (Set_Flag151);
2604 procedure Set_Flag152 (N : Node_Id; Val : Boolean);
2605 pragma Inline (Set_Flag152);
2607 procedure Set_Flag153 (N : Node_Id; Val : Boolean);
2608 pragma Inline (Set_Flag153);
2610 procedure Set_Flag154 (N : Node_Id; Val : Boolean);
2611 pragma Inline (Set_Flag154);
2613 procedure Set_Flag155 (N : Node_Id; Val : Boolean);
2614 pragma Inline (Set_Flag155);
2616 procedure Set_Flag156 (N : Node_Id; Val : Boolean);
2617 pragma Inline (Set_Flag156);
2619 procedure Set_Flag157 (N : Node_Id; Val : Boolean);
2620 pragma Inline (Set_Flag157);
2622 procedure Set_Flag158 (N : Node_Id; Val : Boolean);
2623 pragma Inline (Set_Flag158);
2625 procedure Set_Flag159 (N : Node_Id; Val : Boolean);
2626 pragma Inline (Set_Flag159);
2628 procedure Set_Flag160 (N : Node_Id; Val : Boolean);
2629 pragma Inline (Set_Flag160);
2631 procedure Set_Flag161 (N : Node_Id; Val : Boolean);
2632 pragma Inline (Set_Flag161);
2634 procedure Set_Flag162 (N : Node_Id; Val : Boolean);
2635 pragma Inline (Set_Flag162);
2637 procedure Set_Flag163 (N : Node_Id; Val : Boolean);
2638 pragma Inline (Set_Flag163);
2640 procedure Set_Flag164 (N : Node_Id; Val : Boolean);
2641 pragma Inline (Set_Flag164);
2643 procedure Set_Flag165 (N : Node_Id; Val : Boolean);
2644 pragma Inline (Set_Flag165);
2646 procedure Set_Flag166 (N : Node_Id; Val : Boolean);
2647 pragma Inline (Set_Flag166);
2649 procedure Set_Flag167 (N : Node_Id; Val : Boolean);
2650 pragma Inline (Set_Flag167);
2652 procedure Set_Flag168 (N : Node_Id; Val : Boolean);
2653 pragma Inline (Set_Flag168);
2655 procedure Set_Flag169 (N : Node_Id; Val : Boolean);
2656 pragma Inline (Set_Flag169);
2658 procedure Set_Flag170 (N : Node_Id; Val : Boolean);
2659 pragma Inline (Set_Flag170);
2661 procedure Set_Flag171 (N : Node_Id; Val : Boolean);
2662 pragma Inline (Set_Flag171);
2664 procedure Set_Flag172 (N : Node_Id; Val : Boolean);
2665 pragma Inline (Set_Flag172);
2667 procedure Set_Flag173 (N : Node_Id; Val : Boolean);
2668 pragma Inline (Set_Flag173);
2670 procedure Set_Flag174 (N : Node_Id; Val : Boolean);
2671 pragma Inline (Set_Flag174);
2673 procedure Set_Flag175 (N : Node_Id; Val : Boolean);
2674 pragma Inline (Set_Flag175);
2676 procedure Set_Flag176 (N : Node_Id; Val : Boolean);
2677 pragma Inline (Set_Flag176);
2679 procedure Set_Flag177 (N : Node_Id; Val : Boolean);
2680 pragma Inline (Set_Flag177);
2682 procedure Set_Flag178 (N : Node_Id; Val : Boolean);
2683 pragma Inline (Set_Flag178);
2685 procedure Set_Flag179 (N : Node_Id; Val : Boolean);
2686 pragma Inline (Set_Flag179);
2688 procedure Set_Flag180 (N : Node_Id; Val : Boolean);
2689 pragma Inline (Set_Flag180);
2691 procedure Set_Flag181 (N : Node_Id; Val : Boolean);
2692 pragma Inline (Set_Flag181);
2694 procedure Set_Flag182 (N : Node_Id; Val : Boolean);
2695 pragma Inline (Set_Flag182);
2697 procedure Set_Flag183 (N : Node_Id; Val : Boolean);
2698 pragma Inline (Set_Flag183);
2700 procedure Set_Flag184 (N : Node_Id; Val : Boolean);
2701 pragma Inline (Set_Flag184);
2703 procedure Set_Flag185 (N : Node_Id; Val : Boolean);
2704 pragma Inline (Set_Flag185);
2706 procedure Set_Flag186 (N : Node_Id; Val : Boolean);
2707 pragma Inline (Set_Flag186);
2709 procedure Set_Flag187 (N : Node_Id; Val : Boolean);
2710 pragma Inline (Set_Flag187);
2712 procedure Set_Flag188 (N : Node_Id; Val : Boolean);
2713 pragma Inline (Set_Flag188);
2715 procedure Set_Flag189 (N : Node_Id; Val : Boolean);
2716 pragma Inline (Set_Flag189);
2718 procedure Set_Flag190 (N : Node_Id; Val : Boolean);
2719 pragma Inline (Set_Flag190);
2721 procedure Set_Flag191 (N : Node_Id; Val : Boolean);
2722 pragma Inline (Set_Flag191);
2724 procedure Set_Flag192 (N : Node_Id; Val : Boolean);
2725 pragma Inline (Set_Flag192);
2727 procedure Set_Flag193 (N : Node_Id; Val : Boolean);
2728 pragma Inline (Set_Flag193);
2730 procedure Set_Flag194 (N : Node_Id; Val : Boolean);
2731 pragma Inline (Set_Flag194);
2733 procedure Set_Flag195 (N : Node_Id; Val : Boolean);
2734 pragma Inline (Set_Flag195);
2736 procedure Set_Flag196 (N : Node_Id; Val : Boolean);
2737 pragma Inline (Set_Flag196);
2739 procedure Set_Flag197 (N : Node_Id; Val : Boolean);
2740 pragma Inline (Set_Flag197);
2742 procedure Set_Flag198 (N : Node_Id; Val : Boolean);
2743 pragma Inline (Set_Flag198);
2745 procedure Set_Flag199 (N : Node_Id; Val : Boolean);
2746 pragma Inline (Set_Flag199);
2748 procedure Set_Flag200 (N : Node_Id; Val : Boolean);
2749 pragma Inline (Set_Flag200);
2751 procedure Set_Flag201 (N : Node_Id; Val : Boolean);
2752 pragma Inline (Set_Flag201);
2754 procedure Set_Flag202 (N : Node_Id; Val : Boolean);
2755 pragma Inline (Set_Flag202);
2757 procedure Set_Flag203 (N : Node_Id; Val : Boolean);
2758 pragma Inline (Set_Flag203);
2760 procedure Set_Flag204 (N : Node_Id; Val : Boolean);
2761 pragma Inline (Set_Flag204);
2763 procedure Set_Flag205 (N : Node_Id; Val : Boolean);
2764 pragma Inline (Set_Flag205);
2766 procedure Set_Flag206 (N : Node_Id; Val : Boolean);
2767 pragma Inline (Set_Flag206);
2769 procedure Set_Flag207 (N : Node_Id; Val : Boolean);
2770 pragma Inline (Set_Flag207);
2772 procedure Set_Flag208 (N : Node_Id; Val : Boolean);
2773 pragma Inline (Set_Flag208);
2775 procedure Set_Flag209 (N : Node_Id; Val : Boolean);
2776 pragma Inline (Set_Flag209);
2778 procedure Set_Flag210 (N : Node_Id; Val : Boolean);
2779 pragma Inline (Set_Flag210);
2781 procedure Set_Flag211 (N : Node_Id; Val : Boolean);
2782 pragma Inline (Set_Flag211);
2784 procedure Set_Flag212 (N : Node_Id; Val : Boolean);
2785 pragma Inline (Set_Flag212);
2787 procedure Set_Flag213 (N : Node_Id; Val : Boolean);
2788 pragma Inline (Set_Flag213);
2790 procedure Set_Flag214 (N : Node_Id; Val : Boolean);
2791 pragma Inline (Set_Flag214);
2793 procedure Set_Flag215 (N : Node_Id; Val : Boolean);
2794 pragma Inline (Set_Flag215);
2796 procedure Set_Flag216 (N : Node_Id; Val : Boolean);
2797 pragma Inline (Set_Flag216);
2799 procedure Set_Flag217 (N : Node_Id; Val : Boolean);
2800 pragma Inline (Set_Flag217);
2802 procedure Set_Flag218 (N : Node_Id; Val : Boolean);
2803 pragma Inline (Set_Flag218);
2805 procedure Set_Flag219 (N : Node_Id; Val : Boolean);
2806 pragma Inline (Set_Flag219);
2808 procedure Set_Flag220 (N : Node_Id; Val : Boolean);
2809 pragma Inline (Set_Flag220);
2811 procedure Set_Flag221 (N : Node_Id; Val : Boolean);
2812 pragma Inline (Set_Flag221);
2814 procedure Set_Flag222 (N : Node_Id; Val : Boolean);
2815 pragma Inline (Set_Flag222);
2817 procedure Set_Flag223 (N : Node_Id; Val : Boolean);
2818 pragma Inline (Set_Flag223);
2820 procedure Set_Flag224 (N : Node_Id; Val : Boolean);
2821 pragma Inline (Set_Flag224);
2823 procedure Set_Flag225 (N : Node_Id; Val : Boolean);
2824 pragma Inline (Set_Flag225);
2826 procedure Set_Flag226 (N : Node_Id; Val : Boolean);
2827 pragma Inline (Set_Flag226);
2829 procedure Set_Flag227 (N : Node_Id; Val : Boolean);
2830 pragma Inline (Set_Flag227);
2832 procedure Set_Flag228 (N : Node_Id; Val : Boolean);
2833 pragma Inline (Set_Flag228);
2835 procedure Set_Flag229 (N : Node_Id; Val : Boolean);
2836 pragma Inline (Set_Flag229);
2838 procedure Set_Flag230 (N : Node_Id; Val : Boolean);
2839 pragma Inline (Set_Flag230);
2841 procedure Set_Flag231 (N : Node_Id; Val : Boolean);
2842 pragma Inline (Set_Flag231);
2844 procedure Set_Flag232 (N : Node_Id; Val : Boolean);
2845 pragma Inline (Set_Flag232);
2847 procedure Set_Flag233 (N : Node_Id; Val : Boolean);
2848 pragma Inline (Set_Flag233);
2850 procedure Set_Flag234 (N : Node_Id; Val : Boolean);
2851 pragma Inline (Set_Flag234);
2853 procedure Set_Flag235 (N : Node_Id; Val : Boolean);
2854 pragma Inline (Set_Flag235);
2856 procedure Set_Flag236 (N : Node_Id; Val : Boolean);
2857 pragma Inline (Set_Flag236);
2859 procedure Set_Flag237 (N : Node_Id; Val : Boolean);
2860 pragma Inline (Set_Flag237);
2862 procedure Set_Flag238 (N : Node_Id; Val : Boolean);
2863 pragma Inline (Set_Flag238);
2865 procedure Set_Flag239 (N : Node_Id; Val : Boolean);
2866 pragma Inline (Set_Flag239);
2868 procedure Set_Flag240 (N : Node_Id; Val : Boolean);
2869 pragma Inline (Set_Flag240);
2871 procedure Set_Flag241 (N : Node_Id; Val : Boolean);
2872 pragma Inline (Set_Flag241);
2874 procedure Set_Flag242 (N : Node_Id; Val : Boolean);
2875 pragma Inline (Set_Flag242);
2877 procedure Set_Flag243 (N : Node_Id; Val : Boolean);
2878 pragma Inline (Set_Flag243);
2880 procedure Set_Flag244 (N : Node_Id; Val : Boolean);
2881 pragma Inline (Set_Flag244);
2883 procedure Set_Flag245 (N : Node_Id; Val : Boolean);
2884 pragma Inline (Set_Flag245);
2886 procedure Set_Flag246 (N : Node_Id; Val : Boolean);
2887 pragma Inline (Set_Flag246);
2889 procedure Set_Flag247 (N : Node_Id; Val : Boolean);
2890 pragma Inline (Set_Flag247);
2892 -- The following versions of Set_Noden also set the parent
2893 -- pointer of the referenced node if it is non_Empty
2895 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id);
2896 pragma Inline (Set_Node1_With_Parent);
2898 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id);
2899 pragma Inline (Set_Node2_With_Parent);
2901 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id);
2902 pragma Inline (Set_Node3_With_Parent);
2904 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id);
2905 pragma Inline (Set_Node4_With_Parent);
2907 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id);
2908 pragma Inline (Set_Node5_With_Parent);
2910 -- The following versions of Set_Listn also set the parent pointer of
2911 -- the referenced node if it is non_Empty. The procedures for List6
2912 -- to List12 can only be applied to nodes which have an extension.
2914 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id);
2915 pragma Inline (Set_List1_With_Parent);
2917 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id);
2918 pragma Inline (Set_List2_With_Parent);
2920 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id);
2921 pragma Inline (Set_List3_With_Parent);
2923 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id);
2924 pragma Inline (Set_List4_With_Parent);
2926 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id);
2927 pragma Inline (Set_List5_With_Parent);
2929 end Unchecked_Access;
2931 -----------------------------
2932 -- Private Part Subpackage --
2933 -----------------------------
2935 -- The following package contains the definition of the data structure
2936 -- used by the implementation of the Atree package. Logically it really
2937 -- corresponds to the private part, hence the name. The reason that it
2938 -- is defined as a sub-package is to allow special access from clients
2939 -- that need to see the internals of the data structures.
2941 package Atree_Private_Part is
2943 -------------------------
2944 -- Tree Representation --
2945 -------------------------
2947 -- The nodes of the tree are stored in a table (i.e. an array). In the
2948 -- case of extended nodes five consecutive components in the array are
2949 -- used. There are thus two formats for array components. One is used
2950 -- for non-extended nodes, and for the first component of extended
2951 -- nodes. The other is used for the extension parts (second, third,
2952 -- fourth and fifth components) of an extended node. A variant record
2953 -- structure is used to distinguish the two formats.
2955 type Node_Record (Is_Extension : Boolean := False) is record
2957 -- Logically, the only field in the common part is the above
2958 -- Is_Extension discriminant (a single bit). However, Gigi cannot
2959 -- yet handle such a structure, so we fill out the common part of
2960 -- the record with fields that are used in different ways for
2961 -- normal nodes and node extensions.
2963 Pflag1, Pflag2 : Boolean;
2964 -- The Paren_Count field is represented using two boolean flags,
2965 -- where Pflag1 is worth 1, and Pflag2 is worth 2. This is done
2966 -- because we need to be easily able to reuse this field for
2967 -- extra flags in the extended node case.
2970 -- Flag used to indicate if node is a member of a list.
2971 -- This field is considered private to the Atree package.
2974 -- Currently unused flag
2976 Rewrite_Ins : Boolean;
2977 -- Flag set by Mark_Rewrite_Insertion procedure.
2978 -- This field is considered private to the Atree package.
2981 -- Flag to indicate the node has been analyzed (and expanded)
2983 Comes_From_Source : Boolean;
2984 -- Flag to indicate that node comes from the source program (i.e.
2985 -- was built by the parser or scanner, not the analyzer or expander).
2987 Error_Posted : Boolean;
2988 -- Flag to indicate that an error message has been posted on the
2989 -- node (to avoid duplicate flags on the same node)
3006 -- The eighteen flags for a normal node
3008 -- The above fields are used as follows in components 2-4 of
3009 -- an extended node entry. These fields are not currently
3010 -- used in component 5 (where we still have lots of room!)
3012 -- In_List used as Flag19, Flag40, Flag129
3013 -- Unused_1 used as Flag20, Flag41, Flag130
3014 -- Rewrite_Ins used as Flag21, Flag42, Flag131
3015 -- Analyzed used as Flag22, Flag43, Flag132
3016 -- Comes_From_Source used as Flag23, Flag44, Flag133
3017 -- Error_Posted used as Flag24, Flag45, Flag134
3018 -- Flag4 used as Flag25, Flag46, Flag135
3019 -- Flag5 used as Flag26, Flag47, Flag136
3020 -- Flag6 used as Flag27, Flag48, Flag137
3021 -- Flag7 used as Flag28, Flag49, Flag138
3022 -- Flag8 used as Flag29, Flag50, Flag139
3023 -- Flag9 used as Flag30, Flag51, Flag140
3024 -- Flag10 used as Flag31, Flag52, Flag141
3025 -- Flag11 used as Flag32, Flag53, Flag142
3026 -- Flag12 used as Flag33, Flag54, Flag143
3027 -- Flag13 used as Flag34, Flag55, Flag144
3028 -- Flag14 used as Flag35, Flag56, Flag145
3029 -- Flag15 used as Flag36, Flag57, Flag146
3030 -- Flag16 used as Flag37, Flag58, Flag147
3031 -- Flag17 used as Flag38, Flag59, Flag148
3032 -- Flag18 used as Flag39, Flag60, Flag149
3033 -- Pflag1 used as Flag61, Flag62, Flag150
3034 -- Pflag2 used as Flag63, Flag64, Flag151
3037 -- For a non-extended node, or the initial section of an extended
3038 -- node, this field holds the Node_Kind value. For an extended node,
3039 -- The Nkind field is used as follows:
3041 -- Second entry: holds the Ekind field of the entity
3042 -- Third entry: holds 8 additional flags (Flag65-Flag72)
3043 -- Fourth entry: not currently used
3045 -- Now finally (on an 32-bit boundary!) comes the variant part
3047 case Is_Extension is
3049 -- Non-extended node, or first component of extended node
3054 -- Source location for this node
3057 -- This field is used either as the Parent pointer (if In_List
3058 -- is False), or to point to the list header (if In_List is
3059 -- True). This field is considered private and can be modified
3060 -- only by Atree or by Nlists.
3067 -- Five general use fields, which can contain Node_Id, List_Id,
3068 -- Elist_Id, String_Id, or Name_Id values depending on the
3069 -- values in Nkind and (for extended nodes), in Ekind. See
3070 -- packages Sinfo and Einfo for details of their use.
3072 -- Extension (second component) of extended node
3083 -- Seven additional general fields available only for entities
3084 -- See package Einfo for details of their use (which depends
3085 -- on the value in the Ekind field).
3087 -- In the third component, the extension format as described
3088 -- above is used to hold additional general fields and flags
3091 -- Field6-11 Holds Field13-Field18
3092 -- Field12 Holds Flag73-Flag96 and Convention
3094 -- In the fourth component, the extension format as described
3095 -- above is used to hold additional general fields and flags
3098 -- Field6-10 Holds Field19-Field23
3099 -- Field11 Holds Flag152-Flag183
3100 -- Field12 Holds Flag97-Flag128
3102 -- In the fifth component, the extension format as described
3103 -- above is used to hold additional general fields and flags
3106 -- Field6-10 Holds Field24-Field28
3107 -- Field11 Holds Flag184-Flag215
3108 -- Field12 Holds Flag216-Flag247
3113 pragma Pack (Node_Record);
3114 for Node_Record'Size use 8*32;
3115 for Node_Record'Alignment use 4;
3117 -- The following defines the extendable array used for the nodes table
3118 -- Nodes with extensions use five consecutive entries in the array
3120 package Nodes is new Table.Table (
3121 Table_Component_Type => Node_Record,
3122 Table_Index_Type => Node_Id'Base,
3123 Table_Low_Bound => First_Node_Id,
3124 Table_Initial => Alloc.Nodes_Initial,
3125 Table_Increment => Alloc.Nodes_Increment,
3126 Table_Name => "Nodes");
3128 end Atree_Private_Part;