In gcc/testsuite/: 2010-09-30 Nicola Pero <nicola.pero@meta-innovation.com>
[official-gcc.git] / gcc / ada / atree.ads
blob11787bc116ebd2577daa7a9af31510fc3bffb947
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT COMPILER COMPONENTS --
4 -- --
5 -- A T R E E --
6 -- --
7 -- S p e c --
8 -- --
9 -- Copyright (C) 1992-2010, Free Software Foundation, Inc. --
10 -- --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. --
17 -- --
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. --
21 -- --
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/>. --
26 -- --
27 -- GNAT was originally developed by the GNAT team at New York University. --
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
29 -- --
30 ------------------------------------------------------------------------------
32 with Alloc;
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;
39 with Table;
40 with Uintp; use Uintp;
41 with Urealp; use Urealp;
42 with Unchecked_Conversion;
44 package Atree is
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
61 -- table structure).
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
86 -- of a node list.
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.
101 -- Comes_From_Source
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.
119 -- Field1
120 -- Field2
121 -- Field3
122 -- Field4
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.
164 -- Flag10
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)
169 -- Flag15
170 -- Flag16
171 -- Flag17
172 -- Flag18
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
185 -- in package Einfo.
187 -- Flag19 229 additional flags
188 -- ...
189 -- Flag247
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
267 -- node in the tree.
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.
326 procedure Lock;
327 -- Called before the back end is invoked to lock the nodes table
328 -- Also called after Unlock to relock???
330 procedure Unlock;
331 -- Unlocks nodes table, in cases where the back end needs to modify it
333 procedure Tree_Read;
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.
342 function New_Node
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.
360 function New_Entity
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 Copy_Separate_Tree (Source : Node_Id) return Node_Id;
434 -- Given a node that is the root of a subtree, Copy_Separate_Tree copies
435 -- the entire syntactic subtree, including recursively any descendants
436 -- whose parent field references a copied node (descendants not linked to
437 -- a copied node by the parent field are also copied.) The parent pointers
438 -- in the copy are properly set. Copy_Separate_Tree (Empty/Error) returns
439 -- Empty/Error. The semantic fields are not copied and the new subtree
440 -- does not share any entity with source subtree.
441 -- But the code *does* copy semantic fields, and the description above
442 -- is in any case unclear on this point ??? (RBKD)
444 procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id);
445 -- Exchange the contents of two entities. The parent pointers are switched
446 -- as well as the Defining_Identifier fields in the parents, so that the
447 -- entities point correctly to their original parents. The effect is thus
448 -- to leave the tree completely unchanged in structure, except that the
449 -- entity ID values of the two entities are interchanged. Neither of the
450 -- two entities may be list members.
452 function Extend_Node (Node : Node_Id) return Entity_Id;
453 -- This function returns a copy of its input node with an extension
454 -- added. The fields of the extension are set to Empty. Due to the way
455 -- extensions are handled (as four consecutive array elements), it may
456 -- be necessary to reallocate the node, so that the returned value is
457 -- not the same as the input value, but where possible the returned
458 -- value will be the same as the input value (i.e. the extension will
459 -- occur in place). It is the caller's responsibility to ensure that
460 -- any pointers to the original node are appropriately updated. This
461 -- function is used only by Sinfo.CN to change nodes into their
462 -- corresponding entities.
464 type Report_Proc is access procedure (Target : Node_Id; Source : Node_Id);
466 procedure Set_Reporting_Proc (P : Report_Proc);
467 -- Register a procedure that is invoked when a node is allocated, replaced
468 -- or rewritten.
470 type Traverse_Result is (Abandon, OK, OK_Orig, Skip);
471 -- This is the type of the result returned by the Process function passed
472 -- to Traverse_Func and Traverse_Proc. See below for details.
474 subtype Traverse_Final_Result is Traverse_Result range Abandon .. OK;
475 -- This is the type of the final result returned Traverse_Func, based on
476 -- the results of Process calls. See below for details.
478 generic
479 with function Process (N : Node_Id) return Traverse_Result is <>;
480 function Traverse_Func (Node : Node_Id) return Traverse_Final_Result;
481 -- This is a generic function that, given the parent node for a subtree,
482 -- traverses all syntactic nodes of this tree, calling the given function
483 -- Process on each one, in pre order (i.e. top-down). The order of
484 -- traversing subtrees is arbitrary. The traversal is controlled as follows
485 -- by the result returned by Process:
487 -- OK The traversal continues normally with the syntactic
488 -- children of the node just processed.
490 -- OK_Orig The traversal continues normally with the syntactic
491 -- children of the original node of the node just processed.
493 -- Skip The children of the node just processed are skipped and
494 -- excluded from the traversal, but otherwise processing
495 -- continues elsewhere in the tree.
497 -- Abandon The entire traversal is immediately abandoned, and the
498 -- original call to Traverse returns Abandon.
500 -- The result returned by Traverse is Abandon if processing was terminated
501 -- by a call to Process returning Abandon, otherwise it is OK (meaning that
502 -- all calls to process returned either OK, OK_Orig, or Skip).
504 generic
505 with function Process (N : Node_Id) return Traverse_Result is <>;
506 procedure Traverse_Proc (Node : Node_Id);
507 pragma Inline (Traverse_Proc);
508 -- This is the same as Traverse_Func except that no result is returned,
509 -- i.e. Traverse_Func is called and the result is simply discarded.
511 ---------------------------
512 -- Node Access Functions --
513 ---------------------------
515 -- The following functions return the contents of the indicated field of
516 -- the node referenced by the argument, which is a Node_Id.
518 function Nkind (N : Node_Id) return Node_Kind;
519 pragma Inline (Nkind);
521 function Analyzed (N : Node_Id) return Boolean;
522 pragma Inline (Analyzed);
524 function Comes_From_Source (N : Node_Id) return Boolean;
525 pragma Inline (Comes_From_Source);
527 function Error_Posted (N : Node_Id) return Boolean;
528 pragma Inline (Error_Posted);
530 function Sloc (N : Node_Id) return Source_Ptr;
531 pragma Inline (Sloc);
533 function Paren_Count (N : Node_Id) return Nat;
534 pragma Inline (Paren_Count);
536 function Parent (N : Node_Id) return Node_Id;
537 pragma Inline (Parent);
538 -- Returns the parent of a node if the node is not a list member, or
539 -- else the parent of the list containing the node if the node is a
540 -- list member.
542 function No (N : Node_Id) return Boolean;
543 pragma Inline (No);
544 -- Tests given Id for equality with the Empty node. This allows notations
545 -- like "if No (Variant_Part)" as opposed to "if Variant_Part = Empty".
547 function Present (N : Node_Id) return Boolean;
548 pragma Inline (Present);
549 -- Tests given Id for inequality with the Empty node. This allows notations
550 -- like "if Present (Statement)" as opposed to "if Statement /= Empty".
552 ---------------------
553 -- Node_Kind Tests --
554 ---------------------
556 -- These are like the functions in Sinfo, but the first argument is a
557 -- Node_Id, and the tested field is Nkind (N).
559 function Nkind_In
560 (N : Node_Id;
561 V1 : Node_Kind;
562 V2 : Node_Kind) return Boolean;
564 function Nkind_In
565 (N : Node_Id;
566 V1 : Node_Kind;
567 V2 : Node_Kind;
568 V3 : Node_Kind) return Boolean;
570 function Nkind_In
571 (N : Node_Id;
572 V1 : Node_Kind;
573 V2 : Node_Kind;
574 V3 : Node_Kind;
575 V4 : Node_Kind) return Boolean;
577 function Nkind_In
578 (N : Node_Id;
579 V1 : Node_Kind;
580 V2 : Node_Kind;
581 V3 : Node_Kind;
582 V4 : Node_Kind;
583 V5 : Node_Kind) return Boolean;
585 function Nkind_In
586 (N : Node_Id;
587 V1 : Node_Kind;
588 V2 : Node_Kind;
589 V3 : Node_Kind;
590 V4 : Node_Kind;
591 V5 : Node_Kind;
592 V6 : Node_Kind) return Boolean;
594 function Nkind_In
595 (N : Node_Id;
596 V1 : Node_Kind;
597 V2 : Node_Kind;
598 V3 : Node_Kind;
599 V4 : Node_Kind;
600 V5 : Node_Kind;
601 V6 : Node_Kind;
602 V7 : Node_Kind) return Boolean;
604 function Nkind_In
605 (N : Node_Id;
606 V1 : Node_Kind;
607 V2 : Node_Kind;
608 V3 : Node_Kind;
609 V4 : Node_Kind;
610 V5 : Node_Kind;
611 V6 : Node_Kind;
612 V7 : Node_Kind;
613 V8 : Node_Kind) return Boolean;
615 function Nkind_In
616 (N : Node_Id;
617 V1 : Node_Kind;
618 V2 : Node_Kind;
619 V3 : Node_Kind;
620 V4 : Node_Kind;
621 V5 : Node_Kind;
622 V6 : Node_Kind;
623 V7 : Node_Kind;
624 V8 : Node_Kind;
625 V9 : Node_Kind) return Boolean;
627 pragma Inline (Nkind_In);
628 -- Inline all above functions
630 -----------------------
631 -- Entity_Kind_Tests --
632 -----------------------
634 -- Utility functions to test whether an Entity_Kind value, either given
635 -- directly as the first argument, or the Ekind field of an Entity give
636 -- as the first argument, matches any of the given list of Entity_Kind
637 -- values. Return True if any match, False if no match.
639 function Ekind_In
640 (E : Entity_Id;
641 V1 : Entity_Kind;
642 V2 : Entity_Kind) return Boolean;
644 function Ekind_In
645 (E : Entity_Id;
646 V1 : Entity_Kind;
647 V2 : Entity_Kind;
648 V3 : Entity_Kind) return Boolean;
650 function Ekind_In
651 (E : Entity_Id;
652 V1 : Entity_Kind;
653 V2 : Entity_Kind;
654 V3 : Entity_Kind;
655 V4 : Entity_Kind) return Boolean;
657 function Ekind_In
658 (E : Entity_Id;
659 V1 : Entity_Kind;
660 V2 : Entity_Kind;
661 V3 : Entity_Kind;
662 V4 : Entity_Kind;
663 V5 : Entity_Kind) return Boolean;
665 function Ekind_In
666 (E : Entity_Id;
667 V1 : Entity_Kind;
668 V2 : Entity_Kind;
669 V3 : Entity_Kind;
670 V4 : Entity_Kind;
671 V5 : Entity_Kind;
672 V6 : Entity_Kind) return Boolean;
674 function Ekind_In
675 (T : Entity_Kind;
676 V1 : Entity_Kind;
677 V2 : Entity_Kind) return Boolean;
679 function Ekind_In
680 (T : Entity_Kind;
681 V1 : Entity_Kind;
682 V2 : Entity_Kind;
683 V3 : Entity_Kind) return Boolean;
685 function Ekind_In
686 (T : Entity_Kind;
687 V1 : Entity_Kind;
688 V2 : Entity_Kind;
689 V3 : Entity_Kind;
690 V4 : Entity_Kind) return Boolean;
692 function Ekind_In
693 (T : Entity_Kind;
694 V1 : Entity_Kind;
695 V2 : Entity_Kind;
696 V3 : Entity_Kind;
697 V4 : Entity_Kind;
698 V5 : Entity_Kind) return Boolean;
700 function Ekind_In
701 (T : Entity_Kind;
702 V1 : Entity_Kind;
703 V2 : Entity_Kind;
704 V3 : Entity_Kind;
705 V4 : Entity_Kind;
706 V5 : Entity_Kind;
707 V6 : Entity_Kind) return Boolean;
709 pragma Inline (Ekind_In);
710 -- Inline all above functions
712 -----------------------------
713 -- Entity Access Functions --
714 -----------------------------
716 -- The following functions apply only to Entity_Id values, i.e.
717 -- to extended nodes.
719 function Ekind (E : Entity_Id) return Entity_Kind;
720 pragma Inline (Ekind);
722 function Convention (E : Entity_Id) return Convention_Id;
723 pragma Inline (Convention);
725 ----------------------------
726 -- Node Update Procedures --
727 ----------------------------
729 -- The following functions set a specified field in the node whose Id is
730 -- passed as the first argument. The second parameter is the new value
731 -- to be set in the specified field. Note that Set_Nkind is in the next
732 -- section, since its use is restricted.
734 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr);
735 pragma Inline (Set_Sloc);
737 procedure Set_Paren_Count (N : Node_Id; Val : Nat);
738 pragma Inline (Set_Paren_Count);
740 procedure Set_Parent (N : Node_Id; Val : Node_Id);
741 pragma Inline (Set_Parent);
743 procedure Set_Analyzed (N : Node_Id; Val : Boolean := True);
744 pragma Inline (Set_Analyzed);
746 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True);
747 pragma Inline (Set_Error_Posted);
749 procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean);
750 pragma Inline (Set_Comes_From_Source);
751 -- Note that this routine is very rarely used, since usually the
752 -- default mechanism provided sets the right value, but in some
753 -- unusual cases, the value needs to be reset (e.g. when a source
754 -- node is copied, and the copy must not have Comes_From_Source set.
756 ------------------------------
757 -- Entity Update Procedures --
758 ------------------------------
760 -- The following procedures apply only to Entity_Id values, i.e.
761 -- to extended nodes.
763 procedure Basic_Set_Convention (E : Entity_Id; Val : Convention_Id);
764 pragma Inline (Basic_Set_Convention);
765 -- Clients should use Sem_Util.Set_Convention rather than calling this
766 -- routine directly, as Set_Convention also deals with the special
767 -- processing required for access types.
769 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind);
770 pragma Inline (Set_Ekind);
772 ---------------------------
773 -- Tree Rewrite Routines --
774 ---------------------------
776 -- During the compilation process it is necessary in a number of situations
777 -- to rewrite the tree. In some cases, such rewrites do not affect the
778 -- structure of the tree, for example, when an indexed component node is
779 -- replaced by the corresponding call node (the parser cannot distinguish
780 -- between these two cases).
782 -- In other situations, the rewrite does affect the structure of the
783 -- tree. Examples are the replacement of a generic instantiation by the
784 -- instantiated spec and body, and the static evaluation of expressions.
786 -- If such structural modifications are done by the expander, there are
787 -- no difficulties, since the form of the tree after the expander has no
788 -- special significance, except as input to the backend of the compiler.
789 -- However, if these modifications are done by the semantic phase, then
790 -- it is important that they be done in a manner which allows the original
791 -- tree to be preserved. This is because tools like pretty printers need
792 -- to have this original tree structure available.
794 -- The subprograms in this section allow rewriting of the tree by either
795 -- insertion of new nodes in an existing list, or complete replacement of
796 -- a subtree. The resulting tree for most purposes looks as though it has
797 -- been really changed, and there is no trace of the original. However,
798 -- special subprograms, also defined in this section, allow the original
799 -- tree to be reconstructed if necessary.
801 -- For tree modifications done in the expander, it is permissible to
802 -- destroy the original tree, although it is also allowable to use the
803 -- tree rewrite routines where it is convenient to do so.
805 procedure Mark_Rewrite_Insertion (New_Node : Node_Id);
806 pragma Inline (Mark_Rewrite_Insertion);
807 -- This procedure marks the given node as an insertion made during a tree
808 -- rewriting operation. Only the root needs to be marked. The call does
809 -- not do the actual insertion, which must be done using one of the normal
810 -- list insertion routines. The node is treated normally in all respects
811 -- except for its response to Is_Rewrite_Insertion. The function of these
812 -- calls is to be able to get an accurate original tree. This helps the
813 -- accuracy of Sprint.Sprint_Node, and in particular, when stubs are being
814 -- generated, it is essential that the original tree be accurate.
816 function Is_Rewrite_Insertion (Node : Node_Id) return Boolean;
817 pragma Inline (Is_Rewrite_Insertion);
818 -- Tests whether the given node was marked using Set_Rewrite_Insert. This
819 -- is used in reconstructing the original tree (where such nodes are to
820 -- be eliminated from the reconstructed tree).
822 procedure Rewrite (Old_Node, New_Node : Node_Id);
823 -- This is used when a complete subtree is to be replaced. Old_Node is the
824 -- root of the old subtree to be replaced, and New_Node is the root of the
825 -- newly constructed replacement subtree. The actual mechanism is to swap
826 -- the contents of these two nodes fixing up the parent pointers of the
827 -- replaced node (we do not attempt to preserve parent pointers for the
828 -- original node). Neither Old_Node nor New_Node can be extended nodes.
830 -- Note: New_Node may not contain references to Old_Node, for example as
831 -- descendents, since the rewrite would make such references invalid. If
832 -- New_Node does need to reference Old_Node, then these references should
833 -- be to a relocated copy of Old_Node (see Relocate_Node procedure).
835 -- Note: The Original_Node function applied to Old_Node (which has now
836 -- been replaced by the contents of New_Node), can be used to obtain the
837 -- original node, i.e. the old contents of Old_Node.
839 procedure Replace (Old_Node, New_Node : Node_Id);
840 -- This is similar to Rewrite, except that the old value of Old_Node is
841 -- not saved, and the New_Node is deleted after the replace, since it
842 -- is assumed that it can no longer be legitimately needed. The flag
843 -- Is_Rewrite_Susbtitute will be False for the resulting node, unless
844 -- it was already true on entry, and Original_Node will not return the
845 -- original contents of the Old_Node, but rather the New_Node value (unless
846 -- Old_Node had already been rewritten using Rewrite). Replace also
847 -- preserves the setting of Comes_From_Source.
849 -- Note, New_Node may not contain references to Old_Node, for example as
850 -- descendents, since the rewrite would make such references invalid. If
851 -- New_Node does need to reference Old_Node, then these references should
852 -- be to a relocated copy of Old_Node (see Relocate_Node procedure).
854 -- Replace is used in certain circumstances where it is desirable to
855 -- suppress any history of the rewriting operation. Notably, it is used
856 -- when the parser has mis-classified a node (e.g. a task entry call
857 -- that the parser has parsed as a procedure call).
859 function Is_Rewrite_Substitution (Node : Node_Id) return Boolean;
860 pragma Inline (Is_Rewrite_Substitution);
861 -- Return True iff Node has been rewritten (i.e. if Node is the root
862 -- of a subtree which was installed using Rewrite).
864 function Original_Node (Node : Node_Id) return Node_Id;
865 pragma Inline (Original_Node);
866 -- If Node has not been rewritten, then returns its input argument
867 -- unchanged, else returns the Node for the original subtree.
869 -- Note: Parents are not preserved in original tree nodes that are
870 -- retrieved in this way (i.e. their children may have children whose
871 -- pointers which reference some other node).
873 -- Note: there is no direct mechanism for deleting an original node (in
874 -- a manner that can be reversed later). One possible approach is to use
875 -- Rewrite to substitute a null statement for the node to be deleted.
877 -----------------------------------
878 -- Generic Field Access Routines --
879 -----------------------------------
881 -- This subpackage provides the functions for accessing and procedures for
882 -- setting fields that are normally referenced by their logical synonyms
883 -- defined in packages Sinfo and Einfo. The implementations of these
884 -- packages use the package Atree.Unchecked_Access.
886 package Unchecked_Access is
888 -- Functions to allow interpretation of Union_Id values as Uint
889 -- and Ureal values
891 function To_Union is new Unchecked_Conversion (Uint, Union_Id);
892 function To_Union is new Unchecked_Conversion (Ureal, Union_Id);
894 function From_Union is new Unchecked_Conversion (Union_Id, Uint);
895 function From_Union is new Unchecked_Conversion (Union_Id, Ureal);
897 -- Functions to fetch contents of indicated field. It is an error
898 -- to attempt to read the value of a field which is not present.
900 function Field1 (N : Node_Id) return Union_Id;
901 pragma Inline (Field1);
903 function Field2 (N : Node_Id) return Union_Id;
904 pragma Inline (Field2);
906 function Field3 (N : Node_Id) return Union_Id;
907 pragma Inline (Field3);
909 function Field4 (N : Node_Id) return Union_Id;
910 pragma Inline (Field4);
912 function Field5 (N : Node_Id) return Union_Id;
913 pragma Inline (Field5);
915 function Field6 (N : Node_Id) return Union_Id;
916 pragma Inline (Field6);
918 function Field7 (N : Node_Id) return Union_Id;
919 pragma Inline (Field7);
921 function Field8 (N : Node_Id) return Union_Id;
922 pragma Inline (Field8);
924 function Field9 (N : Node_Id) return Union_Id;
925 pragma Inline (Field9);
927 function Field10 (N : Node_Id) return Union_Id;
928 pragma Inline (Field10);
930 function Field11 (N : Node_Id) return Union_Id;
931 pragma Inline (Field11);
933 function Field12 (N : Node_Id) return Union_Id;
934 pragma Inline (Field12);
936 function Field13 (N : Node_Id) return Union_Id;
937 pragma Inline (Field13);
939 function Field14 (N : Node_Id) return Union_Id;
940 pragma Inline (Field14);
942 function Field15 (N : Node_Id) return Union_Id;
943 pragma Inline (Field15);
945 function Field16 (N : Node_Id) return Union_Id;
946 pragma Inline (Field16);
948 function Field17 (N : Node_Id) return Union_Id;
949 pragma Inline (Field17);
951 function Field18 (N : Node_Id) return Union_Id;
952 pragma Inline (Field18);
954 function Field19 (N : Node_Id) return Union_Id;
955 pragma Inline (Field19);
957 function Field20 (N : Node_Id) return Union_Id;
958 pragma Inline (Field20);
960 function Field21 (N : Node_Id) return Union_Id;
961 pragma Inline (Field21);
963 function Field22 (N : Node_Id) return Union_Id;
964 pragma Inline (Field22);
966 function Field23 (N : Node_Id) return Union_Id;
967 pragma Inline (Field23);
969 function Field24 (N : Node_Id) return Union_Id;
970 pragma Inline (Field24);
972 function Field25 (N : Node_Id) return Union_Id;
973 pragma Inline (Field25);
975 function Field26 (N : Node_Id) return Union_Id;
976 pragma Inline (Field26);
978 function Field27 (N : Node_Id) return Union_Id;
979 pragma Inline (Field27);
981 function Field28 (N : Node_Id) return Union_Id;
982 pragma Inline (Field28);
984 function Node1 (N : Node_Id) return Node_Id;
985 pragma Inline (Node1);
987 function Node2 (N : Node_Id) return Node_Id;
988 pragma Inline (Node2);
990 function Node3 (N : Node_Id) return Node_Id;
991 pragma Inline (Node3);
993 function Node4 (N : Node_Id) return Node_Id;
994 pragma Inline (Node4);
996 function Node5 (N : Node_Id) return Node_Id;
997 pragma Inline (Node5);
999 function Node6 (N : Node_Id) return Node_Id;
1000 pragma Inline (Node6);
1002 function Node7 (N : Node_Id) return Node_Id;
1003 pragma Inline (Node7);
1005 function Node8 (N : Node_Id) return Node_Id;
1006 pragma Inline (Node8);
1008 function Node9 (N : Node_Id) return Node_Id;
1009 pragma Inline (Node9);
1011 function Node10 (N : Node_Id) return Node_Id;
1012 pragma Inline (Node10);
1014 function Node11 (N : Node_Id) return Node_Id;
1015 pragma Inline (Node11);
1017 function Node12 (N : Node_Id) return Node_Id;
1018 pragma Inline (Node12);
1020 function Node13 (N : Node_Id) return Node_Id;
1021 pragma Inline (Node13);
1023 function Node14 (N : Node_Id) return Node_Id;
1024 pragma Inline (Node14);
1026 function Node15 (N : Node_Id) return Node_Id;
1027 pragma Inline (Node15);
1029 function Node16 (N : Node_Id) return Node_Id;
1030 pragma Inline (Node16);
1032 function Node17 (N : Node_Id) return Node_Id;
1033 pragma Inline (Node17);
1035 function Node18 (N : Node_Id) return Node_Id;
1036 pragma Inline (Node18);
1038 function Node19 (N : Node_Id) return Node_Id;
1039 pragma Inline (Node19);
1041 function Node20 (N : Node_Id) return Node_Id;
1042 pragma Inline (Node20);
1044 function Node21 (N : Node_Id) return Node_Id;
1045 pragma Inline (Node21);
1047 function Node22 (N : Node_Id) return Node_Id;
1048 pragma Inline (Node22);
1050 function Node23 (N : Node_Id) return Node_Id;
1051 pragma Inline (Node23);
1053 function Node24 (N : Node_Id) return Node_Id;
1054 pragma Inline (Node24);
1056 function Node25 (N : Node_Id) return Node_Id;
1057 pragma Inline (Node25);
1059 function Node26 (N : Node_Id) return Node_Id;
1060 pragma Inline (Node26);
1062 function Node27 (N : Node_Id) return Node_Id;
1063 pragma Inline (Node27);
1065 function Node28 (N : Node_Id) return Node_Id;
1066 pragma Inline (Node28);
1068 function List1 (N : Node_Id) return List_Id;
1069 pragma Inline (List1);
1071 function List2 (N : Node_Id) return List_Id;
1072 pragma Inline (List2);
1074 function List3 (N : Node_Id) return List_Id;
1075 pragma Inline (List3);
1077 function List4 (N : Node_Id) return List_Id;
1078 pragma Inline (List4);
1080 function List5 (N : Node_Id) return List_Id;
1081 pragma Inline (List5);
1083 function List10 (N : Node_Id) return List_Id;
1084 pragma Inline (List10);
1086 function List14 (N : Node_Id) return List_Id;
1087 pragma Inline (List14);
1089 function Elist1 (N : Node_Id) return Elist_Id;
1090 pragma Inline (Elist1);
1092 function Elist2 (N : Node_Id) return Elist_Id;
1093 pragma Inline (Elist2);
1095 function Elist3 (N : Node_Id) return Elist_Id;
1096 pragma Inline (Elist3);
1098 function Elist4 (N : Node_Id) return Elist_Id;
1099 pragma Inline (Elist4);
1101 function Elist8 (N : Node_Id) return Elist_Id;
1102 pragma Inline (Elist8);
1104 function Elist13 (N : Node_Id) return Elist_Id;
1105 pragma Inline (Elist13);
1107 function Elist15 (N : Node_Id) return Elist_Id;
1108 pragma Inline (Elist15);
1110 function Elist16 (N : Node_Id) return Elist_Id;
1111 pragma Inline (Elist16);
1113 function Elist18 (N : Node_Id) return Elist_Id;
1114 pragma Inline (Elist18);
1116 function Elist21 (N : Node_Id) return Elist_Id;
1117 pragma Inline (Elist21);
1119 function Elist23 (N : Node_Id) return Elist_Id;
1120 pragma Inline (Elist23);
1122 function Elist25 (N : Node_Id) return Elist_Id;
1123 pragma Inline (Elist25);
1125 function Elist26 (N : Node_Id) return Elist_Id;
1126 pragma Inline (Elist26);
1128 function Name1 (N : Node_Id) return Name_Id;
1129 pragma Inline (Name1);
1131 function Name2 (N : Node_Id) return Name_Id;
1132 pragma Inline (Name2);
1134 function Str3 (N : Node_Id) return String_Id;
1135 pragma Inline (Str3);
1137 -- Note: the following Uintnn functions have a special test for
1138 -- the Field value being Empty. If an Empty value is found then
1139 -- Uint_0 is returned. This avoids the rather tricky requirement
1140 -- of initializing all Uint fields in nodes and entities.
1142 function Uint2 (N : Node_Id) return Uint;
1143 pragma Inline (Uint2);
1145 function Uint3 (N : Node_Id) return Uint;
1146 pragma Inline (Uint3);
1148 function Uint4 (N : Node_Id) return Uint;
1149 pragma Inline (Uint4);
1151 function Uint5 (N : Node_Id) return Uint;
1152 pragma Inline (Uint5);
1154 function Uint8 (N : Node_Id) return Uint;
1155 pragma Inline (Uint8);
1157 function Uint9 (N : Node_Id) return Uint;
1158 pragma Inline (Uint9);
1160 function Uint10 (N : Node_Id) return Uint;
1161 pragma Inline (Uint10);
1163 function Uint11 (N : Node_Id) return Uint;
1164 pragma Inline (Uint11);
1166 function Uint12 (N : Node_Id) return Uint;
1167 pragma Inline (Uint12);
1169 function Uint13 (N : Node_Id) return Uint;
1170 pragma Inline (Uint13);
1172 function Uint14 (N : Node_Id) return Uint;
1173 pragma Inline (Uint14);
1175 function Uint15 (N : Node_Id) return Uint;
1176 pragma Inline (Uint15);
1178 function Uint16 (N : Node_Id) return Uint;
1179 pragma Inline (Uint16);
1181 function Uint17 (N : Node_Id) return Uint;
1182 pragma Inline (Uint17);
1184 function Uint22 (N : Node_Id) return Uint;
1185 pragma Inline (Uint22);
1187 function Ureal3 (N : Node_Id) return Ureal;
1188 pragma Inline (Ureal3);
1190 function Ureal18 (N : Node_Id) return Ureal;
1191 pragma Inline (Ureal18);
1193 function Ureal21 (N : Node_Id) return Ureal;
1194 pragma Inline (Ureal21);
1196 function Flag4 (N : Node_Id) return Boolean;
1197 pragma Inline (Flag4);
1199 function Flag5 (N : Node_Id) return Boolean;
1200 pragma Inline (Flag5);
1202 function Flag6 (N : Node_Id) return Boolean;
1203 pragma Inline (Flag6);
1205 function Flag7 (N : Node_Id) return Boolean;
1206 pragma Inline (Flag7);
1208 function Flag8 (N : Node_Id) return Boolean;
1209 pragma Inline (Flag8);
1211 function Flag9 (N : Node_Id) return Boolean;
1212 pragma Inline (Flag9);
1214 function Flag10 (N : Node_Id) return Boolean;
1215 pragma Inline (Flag10);
1217 function Flag11 (N : Node_Id) return Boolean;
1218 pragma Inline (Flag11);
1220 function Flag12 (N : Node_Id) return Boolean;
1221 pragma Inline (Flag12);
1223 function Flag13 (N : Node_Id) return Boolean;
1224 pragma Inline (Flag13);
1226 function Flag14 (N : Node_Id) return Boolean;
1227 pragma Inline (Flag14);
1229 function Flag15 (N : Node_Id) return Boolean;
1230 pragma Inline (Flag15);
1232 function Flag16 (N : Node_Id) return Boolean;
1233 pragma Inline (Flag16);
1235 function Flag17 (N : Node_Id) return Boolean;
1236 pragma Inline (Flag17);
1238 function Flag18 (N : Node_Id) return Boolean;
1239 pragma Inline (Flag18);
1241 function Flag19 (N : Node_Id) return Boolean;
1242 pragma Inline (Flag19);
1244 function Flag20 (N : Node_Id) return Boolean;
1245 pragma Inline (Flag20);
1247 function Flag21 (N : Node_Id) return Boolean;
1248 pragma Inline (Flag21);
1250 function Flag22 (N : Node_Id) return Boolean;
1251 pragma Inline (Flag22);
1253 function Flag23 (N : Node_Id) return Boolean;
1254 pragma Inline (Flag23);
1256 function Flag24 (N : Node_Id) return Boolean;
1257 pragma Inline (Flag24);
1259 function Flag25 (N : Node_Id) return Boolean;
1260 pragma Inline (Flag25);
1262 function Flag26 (N : Node_Id) return Boolean;
1263 pragma Inline (Flag26);
1265 function Flag27 (N : Node_Id) return Boolean;
1266 pragma Inline (Flag27);
1268 function Flag28 (N : Node_Id) return Boolean;
1269 pragma Inline (Flag28);
1271 function Flag29 (N : Node_Id) return Boolean;
1272 pragma Inline (Flag29);
1274 function Flag30 (N : Node_Id) return Boolean;
1275 pragma Inline (Flag30);
1277 function Flag31 (N : Node_Id) return Boolean;
1278 pragma Inline (Flag31);
1280 function Flag32 (N : Node_Id) return Boolean;
1281 pragma Inline (Flag32);
1283 function Flag33 (N : Node_Id) return Boolean;
1284 pragma Inline (Flag33);
1286 function Flag34 (N : Node_Id) return Boolean;
1287 pragma Inline (Flag34);
1289 function Flag35 (N : Node_Id) return Boolean;
1290 pragma Inline (Flag35);
1292 function Flag36 (N : Node_Id) return Boolean;
1293 pragma Inline (Flag36);
1295 function Flag37 (N : Node_Id) return Boolean;
1296 pragma Inline (Flag37);
1298 function Flag38 (N : Node_Id) return Boolean;
1299 pragma Inline (Flag38);
1301 function Flag39 (N : Node_Id) return Boolean;
1302 pragma Inline (Flag39);
1304 function Flag40 (N : Node_Id) return Boolean;
1305 pragma Inline (Flag40);
1307 function Flag41 (N : Node_Id) return Boolean;
1308 pragma Inline (Flag41);
1310 function Flag42 (N : Node_Id) return Boolean;
1311 pragma Inline (Flag42);
1313 function Flag43 (N : Node_Id) return Boolean;
1314 pragma Inline (Flag43);
1316 function Flag44 (N : Node_Id) return Boolean;
1317 pragma Inline (Flag44);
1319 function Flag45 (N : Node_Id) return Boolean;
1320 pragma Inline (Flag45);
1322 function Flag46 (N : Node_Id) return Boolean;
1323 pragma Inline (Flag46);
1325 function Flag47 (N : Node_Id) return Boolean;
1326 pragma Inline (Flag47);
1328 function Flag48 (N : Node_Id) return Boolean;
1329 pragma Inline (Flag48);
1331 function Flag49 (N : Node_Id) return Boolean;
1332 pragma Inline (Flag49);
1334 function Flag50 (N : Node_Id) return Boolean;
1335 pragma Inline (Flag50);
1337 function Flag51 (N : Node_Id) return Boolean;
1338 pragma Inline (Flag51);
1340 function Flag52 (N : Node_Id) return Boolean;
1341 pragma Inline (Flag52);
1343 function Flag53 (N : Node_Id) return Boolean;
1344 pragma Inline (Flag53);
1346 function Flag54 (N : Node_Id) return Boolean;
1347 pragma Inline (Flag54);
1349 function Flag55 (N : Node_Id) return Boolean;
1350 pragma Inline (Flag55);
1352 function Flag56 (N : Node_Id) return Boolean;
1353 pragma Inline (Flag56);
1355 function Flag57 (N : Node_Id) return Boolean;
1356 pragma Inline (Flag57);
1358 function Flag58 (N : Node_Id) return Boolean;
1359 pragma Inline (Flag58);
1361 function Flag59 (N : Node_Id) return Boolean;
1362 pragma Inline (Flag59);
1364 function Flag60 (N : Node_Id) return Boolean;
1365 pragma Inline (Flag60);
1367 function Flag61 (N : Node_Id) return Boolean;
1368 pragma Inline (Flag61);
1370 function Flag62 (N : Node_Id) return Boolean;
1371 pragma Inline (Flag62);
1373 function Flag63 (N : Node_Id) return Boolean;
1374 pragma Inline (Flag63);
1376 function Flag64 (N : Node_Id) return Boolean;
1377 pragma Inline (Flag64);
1379 function Flag65 (N : Node_Id) return Boolean;
1380 pragma Inline (Flag65);
1382 function Flag66 (N : Node_Id) return Boolean;
1383 pragma Inline (Flag66);
1385 function Flag67 (N : Node_Id) return Boolean;
1386 pragma Inline (Flag67);
1388 function Flag68 (N : Node_Id) return Boolean;
1389 pragma Inline (Flag68);
1391 function Flag69 (N : Node_Id) return Boolean;
1392 pragma Inline (Flag69);
1394 function Flag70 (N : Node_Id) return Boolean;
1395 pragma Inline (Flag70);
1397 function Flag71 (N : Node_Id) return Boolean;
1398 pragma Inline (Flag71);
1400 function Flag72 (N : Node_Id) return Boolean;
1401 pragma Inline (Flag72);
1403 function Flag73 (N : Node_Id) return Boolean;
1404 pragma Inline (Flag73);
1406 function Flag74 (N : Node_Id) return Boolean;
1407 pragma Inline (Flag74);
1409 function Flag75 (N : Node_Id) return Boolean;
1410 pragma Inline (Flag75);
1412 function Flag76 (N : Node_Id) return Boolean;
1413 pragma Inline (Flag76);
1415 function Flag77 (N : Node_Id) return Boolean;
1416 pragma Inline (Flag77);
1418 function Flag78 (N : Node_Id) return Boolean;
1419 pragma Inline (Flag78);
1421 function Flag79 (N : Node_Id) return Boolean;
1422 pragma Inline (Flag79);
1424 function Flag80 (N : Node_Id) return Boolean;
1425 pragma Inline (Flag80);
1427 function Flag81 (N : Node_Id) return Boolean;
1428 pragma Inline (Flag81);
1430 function Flag82 (N : Node_Id) return Boolean;
1431 pragma Inline (Flag82);
1433 function Flag83 (N : Node_Id) return Boolean;
1434 pragma Inline (Flag83);
1436 function Flag84 (N : Node_Id) return Boolean;
1437 pragma Inline (Flag84);
1439 function Flag85 (N : Node_Id) return Boolean;
1440 pragma Inline (Flag85);
1442 function Flag86 (N : Node_Id) return Boolean;
1443 pragma Inline (Flag86);
1445 function Flag87 (N : Node_Id) return Boolean;
1446 pragma Inline (Flag87);
1448 function Flag88 (N : Node_Id) return Boolean;
1449 pragma Inline (Flag88);
1451 function Flag89 (N : Node_Id) return Boolean;
1452 pragma Inline (Flag89);
1454 function Flag90 (N : Node_Id) return Boolean;
1455 pragma Inline (Flag90);
1457 function Flag91 (N : Node_Id) return Boolean;
1458 pragma Inline (Flag91);
1460 function Flag92 (N : Node_Id) return Boolean;
1461 pragma Inline (Flag92);
1463 function Flag93 (N : Node_Id) return Boolean;
1464 pragma Inline (Flag93);
1466 function Flag94 (N : Node_Id) return Boolean;
1467 pragma Inline (Flag94);
1469 function Flag95 (N : Node_Id) return Boolean;
1470 pragma Inline (Flag95);
1472 function Flag96 (N : Node_Id) return Boolean;
1473 pragma Inline (Flag96);
1475 function Flag97 (N : Node_Id) return Boolean;
1476 pragma Inline (Flag97);
1478 function Flag98 (N : Node_Id) return Boolean;
1479 pragma Inline (Flag98);
1481 function Flag99 (N : Node_Id) return Boolean;
1482 pragma Inline (Flag99);
1484 function Flag100 (N : Node_Id) return Boolean;
1485 pragma Inline (Flag100);
1487 function Flag101 (N : Node_Id) return Boolean;
1488 pragma Inline (Flag101);
1490 function Flag102 (N : Node_Id) return Boolean;
1491 pragma Inline (Flag102);
1493 function Flag103 (N : Node_Id) return Boolean;
1494 pragma Inline (Flag103);
1496 function Flag104 (N : Node_Id) return Boolean;
1497 pragma Inline (Flag104);
1499 function Flag105 (N : Node_Id) return Boolean;
1500 pragma Inline (Flag105);
1502 function Flag106 (N : Node_Id) return Boolean;
1503 pragma Inline (Flag106);
1505 function Flag107 (N : Node_Id) return Boolean;
1506 pragma Inline (Flag107);
1508 function Flag108 (N : Node_Id) return Boolean;
1509 pragma Inline (Flag108);
1511 function Flag109 (N : Node_Id) return Boolean;
1512 pragma Inline (Flag109);
1514 function Flag110 (N : Node_Id) return Boolean;
1515 pragma Inline (Flag110);
1517 function Flag111 (N : Node_Id) return Boolean;
1518 pragma Inline (Flag111);
1520 function Flag112 (N : Node_Id) return Boolean;
1521 pragma Inline (Flag112);
1523 function Flag113 (N : Node_Id) return Boolean;
1524 pragma Inline (Flag113);
1526 function Flag114 (N : Node_Id) return Boolean;
1527 pragma Inline (Flag114);
1529 function Flag115 (N : Node_Id) return Boolean;
1530 pragma Inline (Flag115);
1532 function Flag116 (N : Node_Id) return Boolean;
1533 pragma Inline (Flag116);
1535 function Flag117 (N : Node_Id) return Boolean;
1536 pragma Inline (Flag117);
1538 function Flag118 (N : Node_Id) return Boolean;
1539 pragma Inline (Flag118);
1541 function Flag119 (N : Node_Id) return Boolean;
1542 pragma Inline (Flag119);
1544 function Flag120 (N : Node_Id) return Boolean;
1545 pragma Inline (Flag120);
1547 function Flag121 (N : Node_Id) return Boolean;
1548 pragma Inline (Flag121);
1550 function Flag122 (N : Node_Id) return Boolean;
1551 pragma Inline (Flag122);
1553 function Flag123 (N : Node_Id) return Boolean;
1554 pragma Inline (Flag123);
1556 function Flag124 (N : Node_Id) return Boolean;
1557 pragma Inline (Flag124);
1559 function Flag125 (N : Node_Id) return Boolean;
1560 pragma Inline (Flag125);
1562 function Flag126 (N : Node_Id) return Boolean;
1563 pragma Inline (Flag126);
1565 function Flag127 (N : Node_Id) return Boolean;
1566 pragma Inline (Flag127);
1568 function Flag128 (N : Node_Id) return Boolean;
1569 pragma Inline (Flag128);
1571 function Flag129 (N : Node_Id) return Boolean;
1572 pragma Inline (Flag129);
1574 function Flag130 (N : Node_Id) return Boolean;
1575 pragma Inline (Flag130);
1577 function Flag131 (N : Node_Id) return Boolean;
1578 pragma Inline (Flag131);
1580 function Flag132 (N : Node_Id) return Boolean;
1581 pragma Inline (Flag132);
1583 function Flag133 (N : Node_Id) return Boolean;
1584 pragma Inline (Flag133);
1586 function Flag134 (N : Node_Id) return Boolean;
1587 pragma Inline (Flag134);
1589 function Flag135 (N : Node_Id) return Boolean;
1590 pragma Inline (Flag135);
1592 function Flag136 (N : Node_Id) return Boolean;
1593 pragma Inline (Flag136);
1595 function Flag137 (N : Node_Id) return Boolean;
1596 pragma Inline (Flag137);
1598 function Flag138 (N : Node_Id) return Boolean;
1599 pragma Inline (Flag138);
1601 function Flag139 (N : Node_Id) return Boolean;
1602 pragma Inline (Flag139);
1604 function Flag140 (N : Node_Id) return Boolean;
1605 pragma Inline (Flag140);
1607 function Flag141 (N : Node_Id) return Boolean;
1608 pragma Inline (Flag141);
1610 function Flag142 (N : Node_Id) return Boolean;
1611 pragma Inline (Flag142);
1613 function Flag143 (N : Node_Id) return Boolean;
1614 pragma Inline (Flag143);
1616 function Flag144 (N : Node_Id) return Boolean;
1617 pragma Inline (Flag144);
1619 function Flag145 (N : Node_Id) return Boolean;
1620 pragma Inline (Flag145);
1622 function Flag146 (N : Node_Id) return Boolean;
1623 pragma Inline (Flag146);
1625 function Flag147 (N : Node_Id) return Boolean;
1626 pragma Inline (Flag147);
1628 function Flag148 (N : Node_Id) return Boolean;
1629 pragma Inline (Flag148);
1631 function Flag149 (N : Node_Id) return Boolean;
1632 pragma Inline (Flag149);
1634 function Flag150 (N : Node_Id) return Boolean;
1635 pragma Inline (Flag150);
1637 function Flag151 (N : Node_Id) return Boolean;
1638 pragma Inline (Flag151);
1640 function Flag152 (N : Node_Id) return Boolean;
1641 pragma Inline (Flag152);
1643 function Flag153 (N : Node_Id) return Boolean;
1644 pragma Inline (Flag153);
1646 function Flag154 (N : Node_Id) return Boolean;
1647 pragma Inline (Flag154);
1649 function Flag155 (N : Node_Id) return Boolean;
1650 pragma Inline (Flag155);
1652 function Flag156 (N : Node_Id) return Boolean;
1653 pragma Inline (Flag156);
1655 function Flag157 (N : Node_Id) return Boolean;
1656 pragma Inline (Flag157);
1658 function Flag158 (N : Node_Id) return Boolean;
1659 pragma Inline (Flag158);
1661 function Flag159 (N : Node_Id) return Boolean;
1662 pragma Inline (Flag159);
1664 function Flag160 (N : Node_Id) return Boolean;
1665 pragma Inline (Flag160);
1667 function Flag161 (N : Node_Id) return Boolean;
1668 pragma Inline (Flag161);
1670 function Flag162 (N : Node_Id) return Boolean;
1671 pragma Inline (Flag162);
1673 function Flag163 (N : Node_Id) return Boolean;
1674 pragma Inline (Flag163);
1676 function Flag164 (N : Node_Id) return Boolean;
1677 pragma Inline (Flag164);
1679 function Flag165 (N : Node_Id) return Boolean;
1680 pragma Inline (Flag165);
1682 function Flag166 (N : Node_Id) return Boolean;
1683 pragma Inline (Flag166);
1685 function Flag167 (N : Node_Id) return Boolean;
1686 pragma Inline (Flag167);
1688 function Flag168 (N : Node_Id) return Boolean;
1689 pragma Inline (Flag168);
1691 function Flag169 (N : Node_Id) return Boolean;
1692 pragma Inline (Flag169);
1694 function Flag170 (N : Node_Id) return Boolean;
1695 pragma Inline (Flag170);
1697 function Flag171 (N : Node_Id) return Boolean;
1698 pragma Inline (Flag171);
1700 function Flag172 (N : Node_Id) return Boolean;
1701 pragma Inline (Flag172);
1703 function Flag173 (N : Node_Id) return Boolean;
1704 pragma Inline (Flag173);
1706 function Flag174 (N : Node_Id) return Boolean;
1707 pragma Inline (Flag174);
1709 function Flag175 (N : Node_Id) return Boolean;
1710 pragma Inline (Flag175);
1712 function Flag176 (N : Node_Id) return Boolean;
1713 pragma Inline (Flag176);
1715 function Flag177 (N : Node_Id) return Boolean;
1716 pragma Inline (Flag177);
1718 function Flag178 (N : Node_Id) return Boolean;
1719 pragma Inline (Flag178);
1721 function Flag179 (N : Node_Id) return Boolean;
1722 pragma Inline (Flag179);
1724 function Flag180 (N : Node_Id) return Boolean;
1725 pragma Inline (Flag180);
1727 function Flag181 (N : Node_Id) return Boolean;
1728 pragma Inline (Flag181);
1730 function Flag182 (N : Node_Id) return Boolean;
1731 pragma Inline (Flag182);
1733 function Flag183 (N : Node_Id) return Boolean;
1734 pragma Inline (Flag183);
1736 function Flag184 (N : Node_Id) return Boolean;
1737 pragma Inline (Flag184);
1739 function Flag185 (N : Node_Id) return Boolean;
1740 pragma Inline (Flag185);
1742 function Flag186 (N : Node_Id) return Boolean;
1743 pragma Inline (Flag186);
1745 function Flag187 (N : Node_Id) return Boolean;
1746 pragma Inline (Flag187);
1748 function Flag188 (N : Node_Id) return Boolean;
1749 pragma Inline (Flag188);
1751 function Flag189 (N : Node_Id) return Boolean;
1752 pragma Inline (Flag189);
1754 function Flag190 (N : Node_Id) return Boolean;
1755 pragma Inline (Flag190);
1757 function Flag191 (N : Node_Id) return Boolean;
1758 pragma Inline (Flag191);
1760 function Flag192 (N : Node_Id) return Boolean;
1761 pragma Inline (Flag192);
1763 function Flag193 (N : Node_Id) return Boolean;
1764 pragma Inline (Flag193);
1766 function Flag194 (N : Node_Id) return Boolean;
1767 pragma Inline (Flag194);
1769 function Flag195 (N : Node_Id) return Boolean;
1770 pragma Inline (Flag195);
1772 function Flag196 (N : Node_Id) return Boolean;
1773 pragma Inline (Flag196);
1775 function Flag197 (N : Node_Id) return Boolean;
1776 pragma Inline (Flag197);
1778 function Flag198 (N : Node_Id) return Boolean;
1779 pragma Inline (Flag198);
1781 function Flag199 (N : Node_Id) return Boolean;
1782 pragma Inline (Flag199);
1784 function Flag200 (N : Node_Id) return Boolean;
1785 pragma Inline (Flag200);
1787 function Flag201 (N : Node_Id) return Boolean;
1788 pragma Inline (Flag201);
1790 function Flag202 (N : Node_Id) return Boolean;
1791 pragma Inline (Flag202);
1793 function Flag203 (N : Node_Id) return Boolean;
1794 pragma Inline (Flag203);
1796 function Flag204 (N : Node_Id) return Boolean;
1797 pragma Inline (Flag204);
1799 function Flag205 (N : Node_Id) return Boolean;
1800 pragma Inline (Flag205);
1802 function Flag206 (N : Node_Id) return Boolean;
1803 pragma Inline (Flag206);
1805 function Flag207 (N : Node_Id) return Boolean;
1806 pragma Inline (Flag207);
1808 function Flag208 (N : Node_Id) return Boolean;
1809 pragma Inline (Flag208);
1811 function Flag209 (N : Node_Id) return Boolean;
1812 pragma Inline (Flag209);
1814 function Flag210 (N : Node_Id) return Boolean;
1815 pragma Inline (Flag210);
1817 function Flag211 (N : Node_Id) return Boolean;
1818 pragma Inline (Flag211);
1820 function Flag212 (N : Node_Id) return Boolean;
1821 pragma Inline (Flag212);
1823 function Flag213 (N : Node_Id) return Boolean;
1824 pragma Inline (Flag213);
1826 function Flag214 (N : Node_Id) return Boolean;
1827 pragma Inline (Flag214);
1829 function Flag215 (N : Node_Id) return Boolean;
1830 pragma Inline (Flag215);
1832 function Flag216 (N : Node_Id) return Boolean;
1833 pragma Inline (Flag216);
1835 function Flag217 (N : Node_Id) return Boolean;
1836 pragma Inline (Flag217);
1838 function Flag218 (N : Node_Id) return Boolean;
1839 pragma Inline (Flag218);
1841 function Flag219 (N : Node_Id) return Boolean;
1842 pragma Inline (Flag219);
1844 function Flag220 (N : Node_Id) return Boolean;
1845 pragma Inline (Flag220);
1847 function Flag221 (N : Node_Id) return Boolean;
1848 pragma Inline (Flag221);
1850 function Flag222 (N : Node_Id) return Boolean;
1851 pragma Inline (Flag222);
1853 function Flag223 (N : Node_Id) return Boolean;
1854 pragma Inline (Flag223);
1856 function Flag224 (N : Node_Id) return Boolean;
1857 pragma Inline (Flag224);
1859 function Flag225 (N : Node_Id) return Boolean;
1860 pragma Inline (Flag225);
1862 function Flag226 (N : Node_Id) return Boolean;
1863 pragma Inline (Flag226);
1865 function Flag227 (N : Node_Id) return Boolean;
1866 pragma Inline (Flag227);
1868 function Flag228 (N : Node_Id) return Boolean;
1869 pragma Inline (Flag228);
1871 function Flag229 (N : Node_Id) return Boolean;
1872 pragma Inline (Flag229);
1874 function Flag230 (N : Node_Id) return Boolean;
1875 pragma Inline (Flag230);
1877 function Flag231 (N : Node_Id) return Boolean;
1878 pragma Inline (Flag231);
1880 function Flag232 (N : Node_Id) return Boolean;
1881 pragma Inline (Flag232);
1883 function Flag233 (N : Node_Id) return Boolean;
1884 pragma Inline (Flag233);
1886 function Flag234 (N : Node_Id) return Boolean;
1887 pragma Inline (Flag234);
1889 function Flag235 (N : Node_Id) return Boolean;
1890 pragma Inline (Flag235);
1892 function Flag236 (N : Node_Id) return Boolean;
1893 pragma Inline (Flag236);
1895 function Flag237 (N : Node_Id) return Boolean;
1896 pragma Inline (Flag237);
1898 function Flag238 (N : Node_Id) return Boolean;
1899 pragma Inline (Flag238);
1901 function Flag239 (N : Node_Id) return Boolean;
1902 pragma Inline (Flag239);
1904 function Flag240 (N : Node_Id) return Boolean;
1905 pragma Inline (Flag240);
1907 function Flag241 (N : Node_Id) return Boolean;
1908 pragma Inline (Flag241);
1910 function Flag242 (N : Node_Id) return Boolean;
1911 pragma Inline (Flag242);
1913 function Flag243 (N : Node_Id) return Boolean;
1914 pragma Inline (Flag243);
1916 function Flag244 (N : Node_Id) return Boolean;
1917 pragma Inline (Flag244);
1919 function Flag245 (N : Node_Id) return Boolean;
1920 pragma Inline (Flag245);
1922 function Flag246 (N : Node_Id) return Boolean;
1923 pragma Inline (Flag246);
1925 function Flag247 (N : Node_Id) return Boolean;
1926 pragma Inline (Flag247);
1928 -- Procedures to set value of indicated field
1930 procedure Set_Nkind (N : Node_Id; Val : Node_Kind);
1931 pragma Inline (Set_Nkind);
1933 procedure Set_Field1 (N : Node_Id; Val : Union_Id);
1934 pragma Inline (Set_Field1);
1936 procedure Set_Field2 (N : Node_Id; Val : Union_Id);
1937 pragma Inline (Set_Field2);
1939 procedure Set_Field3 (N : Node_Id; Val : Union_Id);
1940 pragma Inline (Set_Field3);
1942 procedure Set_Field4 (N : Node_Id; Val : Union_Id);
1943 pragma Inline (Set_Field4);
1945 procedure Set_Field5 (N : Node_Id; Val : Union_Id);
1946 pragma Inline (Set_Field5);
1948 procedure Set_Field6 (N : Node_Id; Val : Union_Id);
1949 pragma Inline (Set_Field6);
1951 procedure Set_Field7 (N : Node_Id; Val : Union_Id);
1952 pragma Inline (Set_Field7);
1954 procedure Set_Field8 (N : Node_Id; Val : Union_Id);
1955 pragma Inline (Set_Field8);
1957 procedure Set_Field9 (N : Node_Id; Val : Union_Id);
1958 pragma Inline (Set_Field9);
1960 procedure Set_Field10 (N : Node_Id; Val : Union_Id);
1961 pragma Inline (Set_Field10);
1963 procedure Set_Field11 (N : Node_Id; Val : Union_Id);
1964 pragma Inline (Set_Field11);
1966 procedure Set_Field12 (N : Node_Id; Val : Union_Id);
1967 pragma Inline (Set_Field12);
1969 procedure Set_Field13 (N : Node_Id; Val : Union_Id);
1970 pragma Inline (Set_Field13);
1972 procedure Set_Field14 (N : Node_Id; Val : Union_Id);
1973 pragma Inline (Set_Field14);
1975 procedure Set_Field15 (N : Node_Id; Val : Union_Id);
1976 pragma Inline (Set_Field15);
1978 procedure Set_Field16 (N : Node_Id; Val : Union_Id);
1979 pragma Inline (Set_Field16);
1981 procedure Set_Field17 (N : Node_Id; Val : Union_Id);
1982 pragma Inline (Set_Field17);
1984 procedure Set_Field18 (N : Node_Id; Val : Union_Id);
1985 pragma Inline (Set_Field18);
1987 procedure Set_Field19 (N : Node_Id; Val : Union_Id);
1988 pragma Inline (Set_Field19);
1990 procedure Set_Field20 (N : Node_Id; Val : Union_Id);
1991 pragma Inline (Set_Field20);
1993 procedure Set_Field21 (N : Node_Id; Val : Union_Id);
1994 pragma Inline (Set_Field21);
1996 procedure Set_Field22 (N : Node_Id; Val : Union_Id);
1997 pragma Inline (Set_Field22);
1999 procedure Set_Field23 (N : Node_Id; Val : Union_Id);
2000 pragma Inline (Set_Field23);
2002 procedure Set_Field24 (N : Node_Id; Val : Union_Id);
2003 pragma Inline (Set_Field24);
2005 procedure Set_Field25 (N : Node_Id; Val : Union_Id);
2006 pragma Inline (Set_Field25);
2008 procedure Set_Field26 (N : Node_Id; Val : Union_Id);
2009 pragma Inline (Set_Field26);
2011 procedure Set_Field27 (N : Node_Id; Val : Union_Id);
2012 pragma Inline (Set_Field27);
2014 procedure Set_Field28 (N : Node_Id; Val : Union_Id);
2015 pragma Inline (Set_Field28);
2017 procedure Set_Node1 (N : Node_Id; Val : Node_Id);
2018 pragma Inline (Set_Node1);
2020 procedure Set_Node2 (N : Node_Id; Val : Node_Id);
2021 pragma Inline (Set_Node2);
2023 procedure Set_Node3 (N : Node_Id; Val : Node_Id);
2024 pragma Inline (Set_Node3);
2026 procedure Set_Node4 (N : Node_Id; Val : Node_Id);
2027 pragma Inline (Set_Node4);
2029 procedure Set_Node5 (N : Node_Id; Val : Node_Id);
2030 pragma Inline (Set_Node5);
2032 procedure Set_Node6 (N : Node_Id; Val : Node_Id);
2033 pragma Inline (Set_Node6);
2035 procedure Set_Node7 (N : Node_Id; Val : Node_Id);
2036 pragma Inline (Set_Node7);
2038 procedure Set_Node8 (N : Node_Id; Val : Node_Id);
2039 pragma Inline (Set_Node8);
2041 procedure Set_Node9 (N : Node_Id; Val : Node_Id);
2042 pragma Inline (Set_Node9);
2044 procedure Set_Node10 (N : Node_Id; Val : Node_Id);
2045 pragma Inline (Set_Node10);
2047 procedure Set_Node11 (N : Node_Id; Val : Node_Id);
2048 pragma Inline (Set_Node11);
2050 procedure Set_Node12 (N : Node_Id; Val : Node_Id);
2051 pragma Inline (Set_Node12);
2053 procedure Set_Node13 (N : Node_Id; Val : Node_Id);
2054 pragma Inline (Set_Node13);
2056 procedure Set_Node14 (N : Node_Id; Val : Node_Id);
2057 pragma Inline (Set_Node14);
2059 procedure Set_Node15 (N : Node_Id; Val : Node_Id);
2060 pragma Inline (Set_Node15);
2062 procedure Set_Node16 (N : Node_Id; Val : Node_Id);
2063 pragma Inline (Set_Node16);
2065 procedure Set_Node17 (N : Node_Id; Val : Node_Id);
2066 pragma Inline (Set_Node17);
2068 procedure Set_Node18 (N : Node_Id; Val : Node_Id);
2069 pragma Inline (Set_Node18);
2071 procedure Set_Node19 (N : Node_Id; Val : Node_Id);
2072 pragma Inline (Set_Node19);
2074 procedure Set_Node20 (N : Node_Id; Val : Node_Id);
2075 pragma Inline (Set_Node20);
2077 procedure Set_Node21 (N : Node_Id; Val : Node_Id);
2078 pragma Inline (Set_Node21);
2080 procedure Set_Node22 (N : Node_Id; Val : Node_Id);
2081 pragma Inline (Set_Node22);
2083 procedure Set_Node23 (N : Node_Id; Val : Node_Id);
2084 pragma Inline (Set_Node23);
2086 procedure Set_Node24 (N : Node_Id; Val : Node_Id);
2087 pragma Inline (Set_Node24);
2089 procedure Set_Node25 (N : Node_Id; Val : Node_Id);
2090 pragma Inline (Set_Node25);
2092 procedure Set_Node26 (N : Node_Id; Val : Node_Id);
2093 pragma Inline (Set_Node26);
2095 procedure Set_Node27 (N : Node_Id; Val : Node_Id);
2096 pragma Inline (Set_Node27);
2098 procedure Set_Node28 (N : Node_Id; Val : Node_Id);
2099 pragma Inline (Set_Node28);
2101 procedure Set_List1 (N : Node_Id; Val : List_Id);
2102 pragma Inline (Set_List1);
2104 procedure Set_List2 (N : Node_Id; Val : List_Id);
2105 pragma Inline (Set_List2);
2107 procedure Set_List3 (N : Node_Id; Val : List_Id);
2108 pragma Inline (Set_List3);
2110 procedure Set_List4 (N : Node_Id; Val : List_Id);
2111 pragma Inline (Set_List4);
2113 procedure Set_List5 (N : Node_Id; Val : List_Id);
2114 pragma Inline (Set_List5);
2116 procedure Set_List10 (N : Node_Id; Val : List_Id);
2117 pragma Inline (Set_List10);
2119 procedure Set_List14 (N : Node_Id; Val : List_Id);
2120 pragma Inline (Set_List14);
2122 procedure Set_Elist1 (N : Node_Id; Val : Elist_Id);
2123 pragma Inline (Set_Elist1);
2125 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id);
2126 pragma Inline (Set_Elist2);
2128 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id);
2129 pragma Inline (Set_Elist3);
2131 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id);
2132 pragma Inline (Set_Elist4);
2134 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id);
2135 pragma Inline (Set_Elist8);
2137 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id);
2138 pragma Inline (Set_Elist13);
2140 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id);
2141 pragma Inline (Set_Elist15);
2143 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id);
2144 pragma Inline (Set_Elist16);
2146 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id);
2147 pragma Inline (Set_Elist18);
2149 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id);
2150 pragma Inline (Set_Elist21);
2152 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id);
2153 pragma Inline (Set_Elist23);
2155 procedure Set_Elist25 (N : Node_Id; Val : Elist_Id);
2156 pragma Inline (Set_Elist25);
2158 procedure Set_Elist26 (N : Node_Id; Val : Elist_Id);
2159 pragma Inline (Set_Elist26);
2161 procedure Set_Name1 (N : Node_Id; Val : Name_Id);
2162 pragma Inline (Set_Name1);
2164 procedure Set_Name2 (N : Node_Id; Val : Name_Id);
2165 pragma Inline (Set_Name2);
2167 procedure Set_Str3 (N : Node_Id; Val : String_Id);
2168 pragma Inline (Set_Str3);
2170 procedure Set_Uint2 (N : Node_Id; Val : Uint);
2171 pragma Inline (Set_Uint2);
2173 procedure Set_Uint3 (N : Node_Id; Val : Uint);
2174 pragma Inline (Set_Uint3);
2176 procedure Set_Uint4 (N : Node_Id; Val : Uint);
2177 pragma Inline (Set_Uint4);
2179 procedure Set_Uint5 (N : Node_Id; Val : Uint);
2180 pragma Inline (Set_Uint5);
2182 procedure Set_Uint8 (N : Node_Id; Val : Uint);
2183 pragma Inline (Set_Uint8);
2185 procedure Set_Uint9 (N : Node_Id; Val : Uint);
2186 pragma Inline (Set_Uint9);
2188 procedure Set_Uint10 (N : Node_Id; Val : Uint);
2189 pragma Inline (Set_Uint10);
2191 procedure Set_Uint11 (N : Node_Id; Val : Uint);
2192 pragma Inline (Set_Uint11);
2194 procedure Set_Uint12 (N : Node_Id; Val : Uint);
2195 pragma Inline (Set_Uint12);
2197 procedure Set_Uint13 (N : Node_Id; Val : Uint);
2198 pragma Inline (Set_Uint13);
2200 procedure Set_Uint14 (N : Node_Id; Val : Uint);
2201 pragma Inline (Set_Uint14);
2203 procedure Set_Uint15 (N : Node_Id; Val : Uint);
2204 pragma Inline (Set_Uint15);
2206 procedure Set_Uint16 (N : Node_Id; Val : Uint);
2207 pragma Inline (Set_Uint16);
2209 procedure Set_Uint17 (N : Node_Id; Val : Uint);
2210 pragma Inline (Set_Uint17);
2212 procedure Set_Uint22 (N : Node_Id; Val : Uint);
2213 pragma Inline (Set_Uint22);
2215 procedure Set_Ureal3 (N : Node_Id; Val : Ureal);
2216 pragma Inline (Set_Ureal3);
2218 procedure Set_Ureal18 (N : Node_Id; Val : Ureal);
2219 pragma Inline (Set_Ureal18);
2221 procedure Set_Ureal21 (N : Node_Id; Val : Ureal);
2222 pragma Inline (Set_Ureal21);
2224 procedure Set_Flag4 (N : Node_Id; Val : Boolean);
2225 pragma Inline (Set_Flag4);
2227 procedure Set_Flag5 (N : Node_Id; Val : Boolean);
2228 pragma Inline (Set_Flag5);
2230 procedure Set_Flag6 (N : Node_Id; Val : Boolean);
2231 pragma Inline (Set_Flag6);
2233 procedure Set_Flag7 (N : Node_Id; Val : Boolean);
2234 pragma Inline (Set_Flag7);
2236 procedure Set_Flag8 (N : Node_Id; Val : Boolean);
2237 pragma Inline (Set_Flag8);
2239 procedure Set_Flag9 (N : Node_Id; Val : Boolean);
2240 pragma Inline (Set_Flag9);
2242 procedure Set_Flag10 (N : Node_Id; Val : Boolean);
2243 pragma Inline (Set_Flag10);
2245 procedure Set_Flag11 (N : Node_Id; Val : Boolean);
2246 pragma Inline (Set_Flag11);
2248 procedure Set_Flag12 (N : Node_Id; Val : Boolean);
2249 pragma Inline (Set_Flag12);
2251 procedure Set_Flag13 (N : Node_Id; Val : Boolean);
2252 pragma Inline (Set_Flag13);
2254 procedure Set_Flag14 (N : Node_Id; Val : Boolean);
2255 pragma Inline (Set_Flag14);
2257 procedure Set_Flag15 (N : Node_Id; Val : Boolean);
2258 pragma Inline (Set_Flag15);
2260 procedure Set_Flag16 (N : Node_Id; Val : Boolean);
2261 pragma Inline (Set_Flag16);
2263 procedure Set_Flag17 (N : Node_Id; Val : Boolean);
2264 pragma Inline (Set_Flag17);
2266 procedure Set_Flag18 (N : Node_Id; Val : Boolean);
2267 pragma Inline (Set_Flag18);
2269 procedure Set_Flag19 (N : Node_Id; Val : Boolean);
2270 pragma Inline (Set_Flag19);
2272 procedure Set_Flag20 (N : Node_Id; Val : Boolean);
2273 pragma Inline (Set_Flag20);
2275 procedure Set_Flag21 (N : Node_Id; Val : Boolean);
2276 pragma Inline (Set_Flag21);
2278 procedure Set_Flag22 (N : Node_Id; Val : Boolean);
2279 pragma Inline (Set_Flag22);
2281 procedure Set_Flag23 (N : Node_Id; Val : Boolean);
2282 pragma Inline (Set_Flag23);
2284 procedure Set_Flag24 (N : Node_Id; Val : Boolean);
2285 pragma Inline (Set_Flag24);
2287 procedure Set_Flag25 (N : Node_Id; Val : Boolean);
2288 pragma Inline (Set_Flag25);
2290 procedure Set_Flag26 (N : Node_Id; Val : Boolean);
2291 pragma Inline (Set_Flag26);
2293 procedure Set_Flag27 (N : Node_Id; Val : Boolean);
2294 pragma Inline (Set_Flag27);
2296 procedure Set_Flag28 (N : Node_Id; Val : Boolean);
2297 pragma Inline (Set_Flag28);
2299 procedure Set_Flag29 (N : Node_Id; Val : Boolean);
2300 pragma Inline (Set_Flag29);
2302 procedure Set_Flag30 (N : Node_Id; Val : Boolean);
2303 pragma Inline (Set_Flag30);
2305 procedure Set_Flag31 (N : Node_Id; Val : Boolean);
2306 pragma Inline (Set_Flag31);
2308 procedure Set_Flag32 (N : Node_Id; Val : Boolean);
2309 pragma Inline (Set_Flag32);
2311 procedure Set_Flag33 (N : Node_Id; Val : Boolean);
2312 pragma Inline (Set_Flag33);
2314 procedure Set_Flag34 (N : Node_Id; Val : Boolean);
2315 pragma Inline (Set_Flag34);
2317 procedure Set_Flag35 (N : Node_Id; Val : Boolean);
2318 pragma Inline (Set_Flag35);
2320 procedure Set_Flag36 (N : Node_Id; Val : Boolean);
2321 pragma Inline (Set_Flag36);
2323 procedure Set_Flag37 (N : Node_Id; Val : Boolean);
2324 pragma Inline (Set_Flag37);
2326 procedure Set_Flag38 (N : Node_Id; Val : Boolean);
2327 pragma Inline (Set_Flag38);
2329 procedure Set_Flag39 (N : Node_Id; Val : Boolean);
2330 pragma Inline (Set_Flag39);
2332 procedure Set_Flag40 (N : Node_Id; Val : Boolean);
2333 pragma Inline (Set_Flag40);
2335 procedure Set_Flag41 (N : Node_Id; Val : Boolean);
2336 pragma Inline (Set_Flag41);
2338 procedure Set_Flag42 (N : Node_Id; Val : Boolean);
2339 pragma Inline (Set_Flag42);
2341 procedure Set_Flag43 (N : Node_Id; Val : Boolean);
2342 pragma Inline (Set_Flag43);
2344 procedure Set_Flag44 (N : Node_Id; Val : Boolean);
2345 pragma Inline (Set_Flag44);
2347 procedure Set_Flag45 (N : Node_Id; Val : Boolean);
2348 pragma Inline (Set_Flag45);
2350 procedure Set_Flag46 (N : Node_Id; Val : Boolean);
2351 pragma Inline (Set_Flag46);
2353 procedure Set_Flag47 (N : Node_Id; Val : Boolean);
2354 pragma Inline (Set_Flag47);
2356 procedure Set_Flag48 (N : Node_Id; Val : Boolean);
2357 pragma Inline (Set_Flag48);
2359 procedure Set_Flag49 (N : Node_Id; Val : Boolean);
2360 pragma Inline (Set_Flag49);
2362 procedure Set_Flag50 (N : Node_Id; Val : Boolean);
2363 pragma Inline (Set_Flag50);
2365 procedure Set_Flag51 (N : Node_Id; Val : Boolean);
2366 pragma Inline (Set_Flag51);
2368 procedure Set_Flag52 (N : Node_Id; Val : Boolean);
2369 pragma Inline (Set_Flag52);
2371 procedure Set_Flag53 (N : Node_Id; Val : Boolean);
2372 pragma Inline (Set_Flag53);
2374 procedure Set_Flag54 (N : Node_Id; Val : Boolean);
2375 pragma Inline (Set_Flag54);
2377 procedure Set_Flag55 (N : Node_Id; Val : Boolean);
2378 pragma Inline (Set_Flag55);
2380 procedure Set_Flag56 (N : Node_Id; Val : Boolean);
2381 pragma Inline (Set_Flag56);
2383 procedure Set_Flag57 (N : Node_Id; Val : Boolean);
2384 pragma Inline (Set_Flag57);
2386 procedure Set_Flag58 (N : Node_Id; Val : Boolean);
2387 pragma Inline (Set_Flag58);
2389 procedure Set_Flag59 (N : Node_Id; Val : Boolean);
2390 pragma Inline (Set_Flag59);
2392 procedure Set_Flag60 (N : Node_Id; Val : Boolean);
2393 pragma Inline (Set_Flag60);
2395 procedure Set_Flag61 (N : Node_Id; Val : Boolean);
2396 pragma Inline (Set_Flag61);
2398 procedure Set_Flag62 (N : Node_Id; Val : Boolean);
2399 pragma Inline (Set_Flag62);
2401 procedure Set_Flag63 (N : Node_Id; Val : Boolean);
2402 pragma Inline (Set_Flag63);
2404 procedure Set_Flag64 (N : Node_Id; Val : Boolean);
2405 pragma Inline (Set_Flag64);
2407 procedure Set_Flag65 (N : Node_Id; Val : Boolean);
2408 pragma Inline (Set_Flag65);
2410 procedure Set_Flag66 (N : Node_Id; Val : Boolean);
2411 pragma Inline (Set_Flag66);
2413 procedure Set_Flag67 (N : Node_Id; Val : Boolean);
2414 pragma Inline (Set_Flag67);
2416 procedure Set_Flag68 (N : Node_Id; Val : Boolean);
2417 pragma Inline (Set_Flag68);
2419 procedure Set_Flag69 (N : Node_Id; Val : Boolean);
2420 pragma Inline (Set_Flag69);
2422 procedure Set_Flag70 (N : Node_Id; Val : Boolean);
2423 pragma Inline (Set_Flag70);
2425 procedure Set_Flag71 (N : Node_Id; Val : Boolean);
2426 pragma Inline (Set_Flag71);
2428 procedure Set_Flag72 (N : Node_Id; Val : Boolean);
2429 pragma Inline (Set_Flag72);
2431 procedure Set_Flag73 (N : Node_Id; Val : Boolean);
2432 pragma Inline (Set_Flag73);
2434 procedure Set_Flag74 (N : Node_Id; Val : Boolean);
2435 pragma Inline (Set_Flag74);
2437 procedure Set_Flag75 (N : Node_Id; Val : Boolean);
2438 pragma Inline (Set_Flag75);
2440 procedure Set_Flag76 (N : Node_Id; Val : Boolean);
2441 pragma Inline (Set_Flag76);
2443 procedure Set_Flag77 (N : Node_Id; Val : Boolean);
2444 pragma Inline (Set_Flag77);
2446 procedure Set_Flag78 (N : Node_Id; Val : Boolean);
2447 pragma Inline (Set_Flag78);
2449 procedure Set_Flag79 (N : Node_Id; Val : Boolean);
2450 pragma Inline (Set_Flag79);
2452 procedure Set_Flag80 (N : Node_Id; Val : Boolean);
2453 pragma Inline (Set_Flag80);
2455 procedure Set_Flag81 (N : Node_Id; Val : Boolean);
2456 pragma Inline (Set_Flag81);
2458 procedure Set_Flag82 (N : Node_Id; Val : Boolean);
2459 pragma Inline (Set_Flag82);
2461 procedure Set_Flag83 (N : Node_Id; Val : Boolean);
2462 pragma Inline (Set_Flag83);
2464 procedure Set_Flag84 (N : Node_Id; Val : Boolean);
2465 pragma Inline (Set_Flag84);
2467 procedure Set_Flag85 (N : Node_Id; Val : Boolean);
2468 pragma Inline (Set_Flag85);
2470 procedure Set_Flag86 (N : Node_Id; Val : Boolean);
2471 pragma Inline (Set_Flag86);
2473 procedure Set_Flag87 (N : Node_Id; Val : Boolean);
2474 pragma Inline (Set_Flag87);
2476 procedure Set_Flag88 (N : Node_Id; Val : Boolean);
2477 pragma Inline (Set_Flag88);
2479 procedure Set_Flag89 (N : Node_Id; Val : Boolean);
2480 pragma Inline (Set_Flag89);
2482 procedure Set_Flag90 (N : Node_Id; Val : Boolean);
2483 pragma Inline (Set_Flag90);
2485 procedure Set_Flag91 (N : Node_Id; Val : Boolean);
2486 pragma Inline (Set_Flag91);
2488 procedure Set_Flag92 (N : Node_Id; Val : Boolean);
2489 pragma Inline (Set_Flag92);
2491 procedure Set_Flag93 (N : Node_Id; Val : Boolean);
2492 pragma Inline (Set_Flag93);
2494 procedure Set_Flag94 (N : Node_Id; Val : Boolean);
2495 pragma Inline (Set_Flag94);
2497 procedure Set_Flag95 (N : Node_Id; Val : Boolean);
2498 pragma Inline (Set_Flag95);
2500 procedure Set_Flag96 (N : Node_Id; Val : Boolean);
2501 pragma Inline (Set_Flag96);
2503 procedure Set_Flag97 (N : Node_Id; Val : Boolean);
2504 pragma Inline (Set_Flag97);
2506 procedure Set_Flag98 (N : Node_Id; Val : Boolean);
2507 pragma Inline (Set_Flag98);
2509 procedure Set_Flag99 (N : Node_Id; Val : Boolean);
2510 pragma Inline (Set_Flag99);
2512 procedure Set_Flag100 (N : Node_Id; Val : Boolean);
2513 pragma Inline (Set_Flag100);
2515 procedure Set_Flag101 (N : Node_Id; Val : Boolean);
2516 pragma Inline (Set_Flag101);
2518 procedure Set_Flag102 (N : Node_Id; Val : Boolean);
2519 pragma Inline (Set_Flag102);
2521 procedure Set_Flag103 (N : Node_Id; Val : Boolean);
2522 pragma Inline (Set_Flag103);
2524 procedure Set_Flag104 (N : Node_Id; Val : Boolean);
2525 pragma Inline (Set_Flag104);
2527 procedure Set_Flag105 (N : Node_Id; Val : Boolean);
2528 pragma Inline (Set_Flag105);
2530 procedure Set_Flag106 (N : Node_Id; Val : Boolean);
2531 pragma Inline (Set_Flag106);
2533 procedure Set_Flag107 (N : Node_Id; Val : Boolean);
2534 pragma Inline (Set_Flag107);
2536 procedure Set_Flag108 (N : Node_Id; Val : Boolean);
2537 pragma Inline (Set_Flag108);
2539 procedure Set_Flag109 (N : Node_Id; Val : Boolean);
2540 pragma Inline (Set_Flag109);
2542 procedure Set_Flag110 (N : Node_Id; Val : Boolean);
2543 pragma Inline (Set_Flag110);
2545 procedure Set_Flag111 (N : Node_Id; Val : Boolean);
2546 pragma Inline (Set_Flag111);
2548 procedure Set_Flag112 (N : Node_Id; Val : Boolean);
2549 pragma Inline (Set_Flag112);
2551 procedure Set_Flag113 (N : Node_Id; Val : Boolean);
2552 pragma Inline (Set_Flag113);
2554 procedure Set_Flag114 (N : Node_Id; Val : Boolean);
2555 pragma Inline (Set_Flag114);
2557 procedure Set_Flag115 (N : Node_Id; Val : Boolean);
2558 pragma Inline (Set_Flag115);
2560 procedure Set_Flag116 (N : Node_Id; Val : Boolean);
2561 pragma Inline (Set_Flag116);
2563 procedure Set_Flag117 (N : Node_Id; Val : Boolean);
2564 pragma Inline (Set_Flag117);
2566 procedure Set_Flag118 (N : Node_Id; Val : Boolean);
2567 pragma Inline (Set_Flag118);
2569 procedure Set_Flag119 (N : Node_Id; Val : Boolean);
2570 pragma Inline (Set_Flag119);
2572 procedure Set_Flag120 (N : Node_Id; Val : Boolean);
2573 pragma Inline (Set_Flag120);
2575 procedure Set_Flag121 (N : Node_Id; Val : Boolean);
2576 pragma Inline (Set_Flag121);
2578 procedure Set_Flag122 (N : Node_Id; Val : Boolean);
2579 pragma Inline (Set_Flag122);
2581 procedure Set_Flag123 (N : Node_Id; Val : Boolean);
2582 pragma Inline (Set_Flag123);
2584 procedure Set_Flag124 (N : Node_Id; Val : Boolean);
2585 pragma Inline (Set_Flag124);
2587 procedure Set_Flag125 (N : Node_Id; Val : Boolean);
2588 pragma Inline (Set_Flag125);
2590 procedure Set_Flag126 (N : Node_Id; Val : Boolean);
2591 pragma Inline (Set_Flag126);
2593 procedure Set_Flag127 (N : Node_Id; Val : Boolean);
2594 pragma Inline (Set_Flag127);
2596 procedure Set_Flag128 (N : Node_Id; Val : Boolean);
2597 pragma Inline (Set_Flag128);
2599 procedure Set_Flag129 (N : Node_Id; Val : Boolean);
2600 pragma Inline (Set_Flag129);
2602 procedure Set_Flag130 (N : Node_Id; Val : Boolean);
2603 pragma Inline (Set_Flag130);
2605 procedure Set_Flag131 (N : Node_Id; Val : Boolean);
2606 pragma Inline (Set_Flag131);
2608 procedure Set_Flag132 (N : Node_Id; Val : Boolean);
2609 pragma Inline (Set_Flag132);
2611 procedure Set_Flag133 (N : Node_Id; Val : Boolean);
2612 pragma Inline (Set_Flag133);
2614 procedure Set_Flag134 (N : Node_Id; Val : Boolean);
2615 pragma Inline (Set_Flag134);
2617 procedure Set_Flag135 (N : Node_Id; Val : Boolean);
2618 pragma Inline (Set_Flag135);
2620 procedure Set_Flag136 (N : Node_Id; Val : Boolean);
2621 pragma Inline (Set_Flag136);
2623 procedure Set_Flag137 (N : Node_Id; Val : Boolean);
2624 pragma Inline (Set_Flag137);
2626 procedure Set_Flag138 (N : Node_Id; Val : Boolean);
2627 pragma Inline (Set_Flag138);
2629 procedure Set_Flag139 (N : Node_Id; Val : Boolean);
2630 pragma Inline (Set_Flag139);
2632 procedure Set_Flag140 (N : Node_Id; Val : Boolean);
2633 pragma Inline (Set_Flag140);
2635 procedure Set_Flag141 (N : Node_Id; Val : Boolean);
2636 pragma Inline (Set_Flag141);
2638 procedure Set_Flag142 (N : Node_Id; Val : Boolean);
2639 pragma Inline (Set_Flag142);
2641 procedure Set_Flag143 (N : Node_Id; Val : Boolean);
2642 pragma Inline (Set_Flag143);
2644 procedure Set_Flag144 (N : Node_Id; Val : Boolean);
2645 pragma Inline (Set_Flag144);
2647 procedure Set_Flag145 (N : Node_Id; Val : Boolean);
2648 pragma Inline (Set_Flag145);
2650 procedure Set_Flag146 (N : Node_Id; Val : Boolean);
2651 pragma Inline (Set_Flag146);
2653 procedure Set_Flag147 (N : Node_Id; Val : Boolean);
2654 pragma Inline (Set_Flag147);
2656 procedure Set_Flag148 (N : Node_Id; Val : Boolean);
2657 pragma Inline (Set_Flag148);
2659 procedure Set_Flag149 (N : Node_Id; Val : Boolean);
2660 pragma Inline (Set_Flag149);
2662 procedure Set_Flag150 (N : Node_Id; Val : Boolean);
2663 pragma Inline (Set_Flag150);
2665 procedure Set_Flag151 (N : Node_Id; Val : Boolean);
2666 pragma Inline (Set_Flag151);
2668 procedure Set_Flag152 (N : Node_Id; Val : Boolean);
2669 pragma Inline (Set_Flag152);
2671 procedure Set_Flag153 (N : Node_Id; Val : Boolean);
2672 pragma Inline (Set_Flag153);
2674 procedure Set_Flag154 (N : Node_Id; Val : Boolean);
2675 pragma Inline (Set_Flag154);
2677 procedure Set_Flag155 (N : Node_Id; Val : Boolean);
2678 pragma Inline (Set_Flag155);
2680 procedure Set_Flag156 (N : Node_Id; Val : Boolean);
2681 pragma Inline (Set_Flag156);
2683 procedure Set_Flag157 (N : Node_Id; Val : Boolean);
2684 pragma Inline (Set_Flag157);
2686 procedure Set_Flag158 (N : Node_Id; Val : Boolean);
2687 pragma Inline (Set_Flag158);
2689 procedure Set_Flag159 (N : Node_Id; Val : Boolean);
2690 pragma Inline (Set_Flag159);
2692 procedure Set_Flag160 (N : Node_Id; Val : Boolean);
2693 pragma Inline (Set_Flag160);
2695 procedure Set_Flag161 (N : Node_Id; Val : Boolean);
2696 pragma Inline (Set_Flag161);
2698 procedure Set_Flag162 (N : Node_Id; Val : Boolean);
2699 pragma Inline (Set_Flag162);
2701 procedure Set_Flag163 (N : Node_Id; Val : Boolean);
2702 pragma Inline (Set_Flag163);
2704 procedure Set_Flag164 (N : Node_Id; Val : Boolean);
2705 pragma Inline (Set_Flag164);
2707 procedure Set_Flag165 (N : Node_Id; Val : Boolean);
2708 pragma Inline (Set_Flag165);
2710 procedure Set_Flag166 (N : Node_Id; Val : Boolean);
2711 pragma Inline (Set_Flag166);
2713 procedure Set_Flag167 (N : Node_Id; Val : Boolean);
2714 pragma Inline (Set_Flag167);
2716 procedure Set_Flag168 (N : Node_Id; Val : Boolean);
2717 pragma Inline (Set_Flag168);
2719 procedure Set_Flag169 (N : Node_Id; Val : Boolean);
2720 pragma Inline (Set_Flag169);
2722 procedure Set_Flag170 (N : Node_Id; Val : Boolean);
2723 pragma Inline (Set_Flag170);
2725 procedure Set_Flag171 (N : Node_Id; Val : Boolean);
2726 pragma Inline (Set_Flag171);
2728 procedure Set_Flag172 (N : Node_Id; Val : Boolean);
2729 pragma Inline (Set_Flag172);
2731 procedure Set_Flag173 (N : Node_Id; Val : Boolean);
2732 pragma Inline (Set_Flag173);
2734 procedure Set_Flag174 (N : Node_Id; Val : Boolean);
2735 pragma Inline (Set_Flag174);
2737 procedure Set_Flag175 (N : Node_Id; Val : Boolean);
2738 pragma Inline (Set_Flag175);
2740 procedure Set_Flag176 (N : Node_Id; Val : Boolean);
2741 pragma Inline (Set_Flag176);
2743 procedure Set_Flag177 (N : Node_Id; Val : Boolean);
2744 pragma Inline (Set_Flag177);
2746 procedure Set_Flag178 (N : Node_Id; Val : Boolean);
2747 pragma Inline (Set_Flag178);
2749 procedure Set_Flag179 (N : Node_Id; Val : Boolean);
2750 pragma Inline (Set_Flag179);
2752 procedure Set_Flag180 (N : Node_Id; Val : Boolean);
2753 pragma Inline (Set_Flag180);
2755 procedure Set_Flag181 (N : Node_Id; Val : Boolean);
2756 pragma Inline (Set_Flag181);
2758 procedure Set_Flag182 (N : Node_Id; Val : Boolean);
2759 pragma Inline (Set_Flag182);
2761 procedure Set_Flag183 (N : Node_Id; Val : Boolean);
2762 pragma Inline (Set_Flag183);
2764 procedure Set_Flag184 (N : Node_Id; Val : Boolean);
2765 pragma Inline (Set_Flag184);
2767 procedure Set_Flag185 (N : Node_Id; Val : Boolean);
2768 pragma Inline (Set_Flag185);
2770 procedure Set_Flag186 (N : Node_Id; Val : Boolean);
2771 pragma Inline (Set_Flag186);
2773 procedure Set_Flag187 (N : Node_Id; Val : Boolean);
2774 pragma Inline (Set_Flag187);
2776 procedure Set_Flag188 (N : Node_Id; Val : Boolean);
2777 pragma Inline (Set_Flag188);
2779 procedure Set_Flag189 (N : Node_Id; Val : Boolean);
2780 pragma Inline (Set_Flag189);
2782 procedure Set_Flag190 (N : Node_Id; Val : Boolean);
2783 pragma Inline (Set_Flag190);
2785 procedure Set_Flag191 (N : Node_Id; Val : Boolean);
2786 pragma Inline (Set_Flag191);
2788 procedure Set_Flag192 (N : Node_Id; Val : Boolean);
2789 pragma Inline (Set_Flag192);
2791 procedure Set_Flag193 (N : Node_Id; Val : Boolean);
2792 pragma Inline (Set_Flag193);
2794 procedure Set_Flag194 (N : Node_Id; Val : Boolean);
2795 pragma Inline (Set_Flag194);
2797 procedure Set_Flag195 (N : Node_Id; Val : Boolean);
2798 pragma Inline (Set_Flag195);
2800 procedure Set_Flag196 (N : Node_Id; Val : Boolean);
2801 pragma Inline (Set_Flag196);
2803 procedure Set_Flag197 (N : Node_Id; Val : Boolean);
2804 pragma Inline (Set_Flag197);
2806 procedure Set_Flag198 (N : Node_Id; Val : Boolean);
2807 pragma Inline (Set_Flag198);
2809 procedure Set_Flag199 (N : Node_Id; Val : Boolean);
2810 pragma Inline (Set_Flag199);
2812 procedure Set_Flag200 (N : Node_Id; Val : Boolean);
2813 pragma Inline (Set_Flag200);
2815 procedure Set_Flag201 (N : Node_Id; Val : Boolean);
2816 pragma Inline (Set_Flag201);
2818 procedure Set_Flag202 (N : Node_Id; Val : Boolean);
2819 pragma Inline (Set_Flag202);
2821 procedure Set_Flag203 (N : Node_Id; Val : Boolean);
2822 pragma Inline (Set_Flag203);
2824 procedure Set_Flag204 (N : Node_Id; Val : Boolean);
2825 pragma Inline (Set_Flag204);
2827 procedure Set_Flag205 (N : Node_Id; Val : Boolean);
2828 pragma Inline (Set_Flag205);
2830 procedure Set_Flag206 (N : Node_Id; Val : Boolean);
2831 pragma Inline (Set_Flag206);
2833 procedure Set_Flag207 (N : Node_Id; Val : Boolean);
2834 pragma Inline (Set_Flag207);
2836 procedure Set_Flag208 (N : Node_Id; Val : Boolean);
2837 pragma Inline (Set_Flag208);
2839 procedure Set_Flag209 (N : Node_Id; Val : Boolean);
2840 pragma Inline (Set_Flag209);
2842 procedure Set_Flag210 (N : Node_Id; Val : Boolean);
2843 pragma Inline (Set_Flag210);
2845 procedure Set_Flag211 (N : Node_Id; Val : Boolean);
2846 pragma Inline (Set_Flag211);
2848 procedure Set_Flag212 (N : Node_Id; Val : Boolean);
2849 pragma Inline (Set_Flag212);
2851 procedure Set_Flag213 (N : Node_Id; Val : Boolean);
2852 pragma Inline (Set_Flag213);
2854 procedure Set_Flag214 (N : Node_Id; Val : Boolean);
2855 pragma Inline (Set_Flag214);
2857 procedure Set_Flag215 (N : Node_Id; Val : Boolean);
2858 pragma Inline (Set_Flag215);
2860 procedure Set_Flag216 (N : Node_Id; Val : Boolean);
2861 pragma Inline (Set_Flag216);
2863 procedure Set_Flag217 (N : Node_Id; Val : Boolean);
2864 pragma Inline (Set_Flag217);
2866 procedure Set_Flag218 (N : Node_Id; Val : Boolean);
2867 pragma Inline (Set_Flag218);
2869 procedure Set_Flag219 (N : Node_Id; Val : Boolean);
2870 pragma Inline (Set_Flag219);
2872 procedure Set_Flag220 (N : Node_Id; Val : Boolean);
2873 pragma Inline (Set_Flag220);
2875 procedure Set_Flag221 (N : Node_Id; Val : Boolean);
2876 pragma Inline (Set_Flag221);
2878 procedure Set_Flag222 (N : Node_Id; Val : Boolean);
2879 pragma Inline (Set_Flag222);
2881 procedure Set_Flag223 (N : Node_Id; Val : Boolean);
2882 pragma Inline (Set_Flag223);
2884 procedure Set_Flag224 (N : Node_Id; Val : Boolean);
2885 pragma Inline (Set_Flag224);
2887 procedure Set_Flag225 (N : Node_Id; Val : Boolean);
2888 pragma Inline (Set_Flag225);
2890 procedure Set_Flag226 (N : Node_Id; Val : Boolean);
2891 pragma Inline (Set_Flag226);
2893 procedure Set_Flag227 (N : Node_Id; Val : Boolean);
2894 pragma Inline (Set_Flag227);
2896 procedure Set_Flag228 (N : Node_Id; Val : Boolean);
2897 pragma Inline (Set_Flag228);
2899 procedure Set_Flag229 (N : Node_Id; Val : Boolean);
2900 pragma Inline (Set_Flag229);
2902 procedure Set_Flag230 (N : Node_Id; Val : Boolean);
2903 pragma Inline (Set_Flag230);
2905 procedure Set_Flag231 (N : Node_Id; Val : Boolean);
2906 pragma Inline (Set_Flag231);
2908 procedure Set_Flag232 (N : Node_Id; Val : Boolean);
2909 pragma Inline (Set_Flag232);
2911 procedure Set_Flag233 (N : Node_Id; Val : Boolean);
2912 pragma Inline (Set_Flag233);
2914 procedure Set_Flag234 (N : Node_Id; Val : Boolean);
2915 pragma Inline (Set_Flag234);
2917 procedure Set_Flag235 (N : Node_Id; Val : Boolean);
2918 pragma Inline (Set_Flag235);
2920 procedure Set_Flag236 (N : Node_Id; Val : Boolean);
2921 pragma Inline (Set_Flag236);
2923 procedure Set_Flag237 (N : Node_Id; Val : Boolean);
2924 pragma Inline (Set_Flag237);
2926 procedure Set_Flag238 (N : Node_Id; Val : Boolean);
2927 pragma Inline (Set_Flag238);
2929 procedure Set_Flag239 (N : Node_Id; Val : Boolean);
2930 pragma Inline (Set_Flag239);
2932 procedure Set_Flag240 (N : Node_Id; Val : Boolean);
2933 pragma Inline (Set_Flag240);
2935 procedure Set_Flag241 (N : Node_Id; Val : Boolean);
2936 pragma Inline (Set_Flag241);
2938 procedure Set_Flag242 (N : Node_Id; Val : Boolean);
2939 pragma Inline (Set_Flag242);
2941 procedure Set_Flag243 (N : Node_Id; Val : Boolean);
2942 pragma Inline (Set_Flag243);
2944 procedure Set_Flag244 (N : Node_Id; Val : Boolean);
2945 pragma Inline (Set_Flag244);
2947 procedure Set_Flag245 (N : Node_Id; Val : Boolean);
2948 pragma Inline (Set_Flag245);
2950 procedure Set_Flag246 (N : Node_Id; Val : Boolean);
2951 pragma Inline (Set_Flag246);
2953 procedure Set_Flag247 (N : Node_Id; Val : Boolean);
2954 pragma Inline (Set_Flag247);
2956 -- The following versions of Set_Noden also set the parent
2957 -- pointer of the referenced node if it is non_Empty
2959 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id);
2960 pragma Inline (Set_Node1_With_Parent);
2962 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id);
2963 pragma Inline (Set_Node2_With_Parent);
2965 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id);
2966 pragma Inline (Set_Node3_With_Parent);
2968 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id);
2969 pragma Inline (Set_Node4_With_Parent);
2971 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id);
2972 pragma Inline (Set_Node5_With_Parent);
2974 -- The following versions of Set_Listn also set the parent pointer of
2975 -- the referenced node if it is non_Empty. The procedures for List6
2976 -- to List12 can only be applied to nodes which have an extension.
2978 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id);
2979 pragma Inline (Set_List1_With_Parent);
2981 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id);
2982 pragma Inline (Set_List2_With_Parent);
2984 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id);
2985 pragma Inline (Set_List3_With_Parent);
2987 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id);
2988 pragma Inline (Set_List4_With_Parent);
2990 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id);
2991 pragma Inline (Set_List5_With_Parent);
2993 end Unchecked_Access;
2995 -----------------------------
2996 -- Private Part Subpackage --
2997 -----------------------------
2999 -- The following package contains the definition of the data structure
3000 -- used by the implementation of the Atree package. Logically it really
3001 -- corresponds to the private part, hence the name. The reason that it
3002 -- is defined as a sub-package is to allow special access from clients
3003 -- that need to see the internals of the data structures.
3005 package Atree_Private_Part is
3007 -------------------------
3008 -- Tree Representation --
3009 -------------------------
3011 -- The nodes of the tree are stored in a table (i.e. an array). In the
3012 -- case of extended nodes five consecutive components in the array are
3013 -- used. There are thus two formats for array components. One is used
3014 -- for non-extended nodes, and for the first component of extended
3015 -- nodes. The other is used for the extension parts (second, third,
3016 -- fourth and fifth components) of an extended node. A variant record
3017 -- structure is used to distinguish the two formats.
3019 type Node_Record (Is_Extension : Boolean := False) is record
3021 -- Logically, the only field in the common part is the above
3022 -- Is_Extension discriminant (a single bit). However, Gigi cannot
3023 -- yet handle such a structure, so we fill out the common part of
3024 -- the record with fields that are used in different ways for
3025 -- normal nodes and node extensions.
3027 Pflag1, Pflag2 : Boolean;
3028 -- The Paren_Count field is represented using two boolean flags,
3029 -- where Pflag1 is worth 1, and Pflag2 is worth 2. This is done
3030 -- because we need to be easily able to reuse this field for
3031 -- extra flags in the extended node case.
3033 In_List : Boolean;
3034 -- Flag used to indicate if node is a member of a list.
3035 -- This field is considered private to the Atree package.
3037 Unused_1 : Boolean;
3038 -- Currently unused flag
3040 Rewrite_Ins : Boolean;
3041 -- Flag set by Mark_Rewrite_Insertion procedure.
3042 -- This field is considered private to the Atree package.
3044 Analyzed : Boolean;
3045 -- Flag to indicate the node has been analyzed (and expanded)
3047 Comes_From_Source : Boolean;
3048 -- Flag to indicate that node comes from the source program (i.e.
3049 -- was built by the parser or scanner, not the analyzer or expander).
3051 Error_Posted : Boolean;
3052 -- Flag to indicate that an error message has been posted on the
3053 -- node (to avoid duplicate flags on the same node)
3055 Flag4 : Boolean;
3056 Flag5 : Boolean;
3057 Flag6 : Boolean;
3058 Flag7 : Boolean;
3059 Flag8 : Boolean;
3060 Flag9 : Boolean;
3061 Flag10 : Boolean;
3062 Flag11 : Boolean;
3063 Flag12 : Boolean;
3064 Flag13 : Boolean;
3065 Flag14 : Boolean;
3066 Flag15 : Boolean;
3067 Flag16 : Boolean;
3068 Flag17 : Boolean;
3069 Flag18 : Boolean;
3070 -- The eighteen flags for a normal node
3072 -- The above fields are used as follows in components 2-4 of
3073 -- an extended node entry. These fields are not currently
3074 -- used in component 5 (where we still have lots of room!)
3076 -- In_List used as Flag19, Flag40, Flag129
3077 -- Unused_1 used as Flag20, Flag41, Flag130
3078 -- Rewrite_Ins used as Flag21, Flag42, Flag131
3079 -- Analyzed used as Flag22, Flag43, Flag132
3080 -- Comes_From_Source used as Flag23, Flag44, Flag133
3081 -- Error_Posted used as Flag24, Flag45, Flag134
3082 -- Flag4 used as Flag25, Flag46, Flag135
3083 -- Flag5 used as Flag26, Flag47, Flag136
3084 -- Flag6 used as Flag27, Flag48, Flag137
3085 -- Flag7 used as Flag28, Flag49, Flag138
3086 -- Flag8 used as Flag29, Flag50, Flag139
3087 -- Flag9 used as Flag30, Flag51, Flag140
3088 -- Flag10 used as Flag31, Flag52, Flag141
3089 -- Flag11 used as Flag32, Flag53, Flag142
3090 -- Flag12 used as Flag33, Flag54, Flag143
3091 -- Flag13 used as Flag34, Flag55, Flag144
3092 -- Flag14 used as Flag35, Flag56, Flag145
3093 -- Flag15 used as Flag36, Flag57, Flag146
3094 -- Flag16 used as Flag37, Flag58, Flag147
3095 -- Flag17 used as Flag38, Flag59, Flag148
3096 -- Flag18 used as Flag39, Flag60, Flag149
3097 -- Pflag1 used as Flag61, Flag62, Flag150
3098 -- Pflag2 used as Flag63, Flag64, Flag151
3100 Nkind : Node_Kind;
3101 -- For a non-extended node, or the initial section of an extended
3102 -- node, this field holds the Node_Kind value. For an extended node,
3103 -- The Nkind field is used as follows:
3105 -- Second entry: holds the Ekind field of the entity
3106 -- Third entry: holds 8 additional flags (Flag65-Flag72)
3107 -- Fourth entry: not currently used
3109 -- Now finally (on an 32-bit boundary!) comes the variant part
3111 case Is_Extension is
3113 -- Non-extended node, or first component of extended node
3115 when False =>
3117 Sloc : Source_Ptr;
3118 -- Source location for this node
3120 Link : Union_Id;
3121 -- This field is used either as the Parent pointer (if In_List
3122 -- is False), or to point to the list header (if In_List is
3123 -- True). This field is considered private and can be modified
3124 -- only by Atree or by Nlists.
3126 Field1 : Union_Id;
3127 Field2 : Union_Id;
3128 Field3 : Union_Id;
3129 Field4 : Union_Id;
3130 Field5 : Union_Id;
3131 -- Five general use fields, which can contain Node_Id, List_Id,
3132 -- Elist_Id, String_Id, or Name_Id values depending on the
3133 -- values in Nkind and (for extended nodes), in Ekind. See
3134 -- packages Sinfo and Einfo for details of their use.
3136 -- Extension (second component) of extended node
3138 when True =>
3140 Field6 : Union_Id;
3141 Field7 : Union_Id;
3142 Field8 : Union_Id;
3143 Field9 : Union_Id;
3144 Field10 : Union_Id;
3145 Field11 : Union_Id;
3146 Field12 : Union_Id;
3147 -- Seven additional general fields available only for entities
3148 -- See package Einfo for details of their use (which depends
3149 -- on the value in the Ekind field).
3151 -- In the third component, the extension format as described
3152 -- above is used to hold additional general fields and flags
3153 -- as follows:
3155 -- Field6-11 Holds Field13-Field18
3156 -- Field12 Holds Flag73-Flag96 and Convention
3158 -- In the fourth component, the extension format as described
3159 -- above is used to hold additional general fields and flags
3160 -- as follows:
3162 -- Field6-10 Holds Field19-Field23
3163 -- Field11 Holds Flag152-Flag183
3164 -- Field12 Holds Flag97-Flag128
3166 -- In the fifth component, the extension format as described
3167 -- above is used to hold additional general fields and flags
3168 -- as follows:
3170 -- Field6-10 Holds Field24-Field28
3171 -- Field11 Holds Flag184-Flag215
3172 -- Field12 Holds Flag216-Flag247
3174 end case;
3175 end record;
3177 pragma Pack (Node_Record);
3178 for Node_Record'Size use 8*32;
3179 for Node_Record'Alignment use 4;
3181 function E_To_N is new Unchecked_Conversion (Entity_Kind, Node_Kind);
3182 function N_To_E is new Unchecked_Conversion (Node_Kind, Entity_Kind);
3184 -- Default value used to initialize default nodes. Note that some of the
3185 -- fields get overwritten, and in particular, Nkind always gets reset.
3187 Default_Node : Node_Record := (
3188 Is_Extension => False,
3189 Pflag1 => False,
3190 Pflag2 => False,
3191 In_List => False,
3192 Unused_1 => False,
3193 Rewrite_Ins => False,
3194 Analyzed => False,
3195 Comes_From_Source => False,
3196 -- modified by Set_Comes_From_Source_Default
3197 Error_Posted => False,
3198 Flag4 => False,
3200 Flag5 => False,
3201 Flag6 => False,
3202 Flag7 => False,
3203 Flag8 => False,
3204 Flag9 => False,
3205 Flag10 => False,
3206 Flag11 => False,
3207 Flag12 => False,
3209 Flag13 => False,
3210 Flag14 => False,
3211 Flag15 => False,
3212 Flag16 => False,
3213 Flag17 => False,
3214 Flag18 => False,
3216 Nkind => N_Unused_At_Start,
3218 Sloc => No_Location,
3219 Link => Empty_List_Or_Node,
3220 Field1 => Empty_List_Or_Node,
3221 Field2 => Empty_List_Or_Node,
3222 Field3 => Empty_List_Or_Node,
3223 Field4 => Empty_List_Or_Node,
3224 Field5 => Empty_List_Or_Node);
3226 -- Default value used to initialize node extensions (i.e. the second
3227 -- and third and fourth components of an extended node). Note we are
3228 -- cheating a bit here when it comes to Node12, which really holds
3229 -- flags an (for the third component), the convention. But it works
3230 -- because Empty, False, Convention_Ada, all happen to be all zero bits.
3232 Default_Node_Extension : constant Node_Record := (
3233 Is_Extension => True,
3234 Pflag1 => False,
3235 Pflag2 => False,
3236 In_List => False,
3237 Unused_1 => False,
3238 Rewrite_Ins => False,
3239 Analyzed => False,
3240 Comes_From_Source => False,
3241 Error_Posted => False,
3242 Flag4 => False,
3244 Flag5 => False,
3245 Flag6 => False,
3246 Flag7 => False,
3247 Flag8 => False,
3248 Flag9 => False,
3249 Flag10 => False,
3250 Flag11 => False,
3251 Flag12 => False,
3253 Flag13 => False,
3254 Flag14 => False,
3255 Flag15 => False,
3256 Flag16 => False,
3257 Flag17 => False,
3258 Flag18 => False,
3260 Nkind => E_To_N (E_Void),
3262 Field6 => Empty_List_Or_Node,
3263 Field7 => Empty_List_Or_Node,
3264 Field8 => Empty_List_Or_Node,
3265 Field9 => Empty_List_Or_Node,
3266 Field10 => Empty_List_Or_Node,
3267 Field11 => Empty_List_Or_Node,
3268 Field12 => Empty_List_Or_Node);
3270 -- The following defines the extendable array used for the nodes table
3271 -- Nodes with extensions use five consecutive entries in the array
3273 package Nodes is new Table.Table (
3274 Table_Component_Type => Node_Record,
3275 Table_Index_Type => Node_Id'Base,
3276 Table_Low_Bound => First_Node_Id,
3277 Table_Initial => Alloc.Nodes_Initial,
3278 Table_Increment => Alloc.Nodes_Increment,
3279 Table_Name => "Nodes");
3281 end Atree_Private_Part;
3283 end Atree;