1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2018, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
27 -- GNAT was originally developed by the GNAT team at New York University. --
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
30 ------------------------------------------------------------------------------
33 with Sinfo
; use Sinfo
;
34 with Einfo
; use Einfo
;
35 with Namet
; use Namet
;
36 with Types
; use Types
;
37 with Snames
; use Snames
;
38 with System
; use System
;
40 with Uintp
; use Uintp
;
41 with Urealp
; use Urealp
;
42 with Unchecked_Conversion
;
46 -- This package defines the format of the tree used to represent the Ada
47 -- program internally. Syntactic and semantic information is combined in
48 -- this tree. There is no separate symbol table structure.
50 -- WARNING: There is a C version of this package. Any changes to this source
51 -- 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 other
55 -- packages use this interface to define the representation of Ada programs
56 -- using this tree format. The package Sinfo defines the basic representation
57 -- of the syntactic structure of the program, as output by the parser. The
58 -- package Einfo defines the semantic information which is added to the tree
59 -- nodes that represent declared entities (i.e. the information which might
60 -- typically be described in a separate symbol table structure).
62 -- The front end of the compiler first parses the program and generates a
63 -- tree that is simply a syntactic representation of the program in abstract
64 -- syntax tree format. Subsequent processing in the front end traverses the
65 -- tree, transforming it in various ways and adding semantic information.
67 ----------------------
68 -- Size of Entities --
69 ----------------------
71 -- Currently entities are composed of 7 sequentially allocated 32-byte
72 -- nodes, considered as a single record. The following definition gives
73 -- the number of extension nodes.
75 Num_Extension_Nodes
: Node_Id
:= 6;
76 -- This value is increased by one if debug flag -gnatd.N is set. This is
77 -- for testing performance impact of adding a new extension node. We make
78 -- this of type Node_Id for easy reference in loops using this value.
79 -- Print_Statistics can be used to display statistics on entities & nodes.
80 -- Measurements conducted for the 5->6 bump showed an increase from 1.81 to
81 -- 2.01 for the nodes/entities ratio and a 2% increase in compilation time
82 -- on average for the GCC-based compiler at -O0 on a 32-bit x86 host.
84 ----------------------------------------
85 -- Definitions of Fields in Tree Node --
86 ----------------------------------------
88 -- The representation of the tree is completely hidden, using a functional
89 -- interface for accessing and modifying the contents of nodes. Logically
90 -- a node contains a number of fields, much as though the nodes were
91 -- defined as a record type. The fields in a node are as follows:
93 -- Nkind Indicates the kind of the node. This field is present
94 -- in all nodes. The type is Node_Kind, which is declared
95 -- in the package Sinfo.
97 -- Sloc Location (Source_Ptr) of the corresponding token
98 -- in the Source buffer. The individual node definitions
99 -- show which token is referenced by this pointer.
101 -- In_List A flag used to indicate if the node is a member
104 -- Rewrite_Ins A flag set if a node is marked as a rewrite inserted
105 -- node as a result of a call to Mark_Rewrite_Insertion.
107 -- Paren_Count A 2-bit count used in sub-expression nodes to indicate
108 -- the level of parentheses. The settings are 0,1,2 and
109 -- 3 for many. If the value is 3, then an auxiliary table
110 -- is used to indicate the real value. Set to zero for
111 -- non-subexpression nodes.
113 -- Note: the required parentheses surrounding conditional
114 -- and quantified expressions count as a level of parens
115 -- for this purpose, so e.g. in X := (if A then B else C);
116 -- Paren_Count for the right side will be 1.
119 -- This flag is present in all nodes. It is set if the
120 -- node is built by the scanner or parser, and clear if
121 -- the node is built by the analyzer or expander. It
122 -- indicates that the node corresponds to a construct
123 -- that appears in the original source program.
125 -- Analyzed This flag is present in all nodes. It is set when
126 -- a node is analyzed, and is used to avoid analyzing
127 -- the same node twice. Analysis includes expansion if
128 -- expansion is active, so in this case if the flag is
129 -- set it means the node has been analyzed and expanded.
131 -- Error_Posted This flag is present in all nodes. It is set when
132 -- an error message is posted which is associated with
133 -- the flagged node. This is used to avoid posting more
134 -- than one message on the same node.
140 -- Field5 Five fields holding Union_Id values
142 -- ElistN Synonym for FieldN typed as Elist_Id (Empty = No_Elist)
143 -- ListN Synonym for FieldN typed as List_Id
144 -- NameN Synonym for FieldN typed as Name_Id
145 -- NodeN Synonym for FieldN typed as Node_Id
146 -- StrN Synonym for FieldN typed as String_Id
147 -- UintN Synonym for FieldN typed as Uint (Empty = Uint_0)
148 -- UrealN Synonym for FieldN typed as Ureal
150 -- Note: in the case of ElistN and UintN fields, it is common that we
151 -- end up with a value of Union_Id'(0) as the default value. This value
152 -- is meaningless as a Uint or Elist_Id value. We have two choices here.
153 -- We could require that all Uint and Elist fields be initialized to an
154 -- appropriate value, but that's error prone, since it would be easy to
155 -- miss an initialization. So instead we have the retrieval functions
156 -- generate an appropriate default value (Uint_0 or No_Elist). Probably
157 -- it would be cleaner to generate No_Uint in the Uint case but we got
158 -- stuck with representing an "unset" size value as zero early on, and
159 -- it will take a bit of fiddling to change that ???
161 -- Note: the actual usage of FieldN (i.e. whether it contains a Elist_Id,
162 -- List_Id, Name_Id, Node_Id, String_Id, Uint or Ureal) depends on the
163 -- value in Nkind. Generally the access to this field is always via the
164 -- functional interface, so the field names ElistN, ListN, NameN, NodeN,
165 -- StrN, UintN and UrealN are used only in the bodies of the access
166 -- functions (i.e. in the bodies of Sinfo and Einfo). These access
167 -- functions contain debugging code that checks that the use is
168 -- consistent with Nkind and Ekind values.
170 -- However, in specialized circumstances (examples are the circuit in
171 -- generic instantiation to copy trees, and in the tree dump routine),
172 -- it is useful to be able to do untyped traversals, and an internal
173 -- package in Atree allows for direct untyped accesses in such cases.
175 -- Flag0 Nineteen Boolean flags (use depends on Nkind and
176 -- Flag1 Ekind, as described for FieldN). Again the access
177 -- Flag2 is usually via subprograms in Sinfo and Einfo which
178 -- Flag3 provide high-level synonyms for these flags, and
179 -- Flag4 contain debugging code that checks that the values
180 -- Flag5 in Nkind and Ekind are appropriate for the access.
186 -- Flag11 Note that Flag0-3 are stored separately in the Flags
187 -- Flag12 table, but that's a detail of the implementation which
188 -- Flag13 is entirely hidden by the functional interface.
195 -- Link For a node, points to the Parent. For a list, points
196 -- to the list header. Note that in the latter case, a
197 -- client cannot modify the link field. This field is
198 -- private to the Atree package (but is also modified
199 -- by the Nlists package).
201 -- The following additional fields are present in extended nodes used
202 -- for entities (Nkind in N_Entity).
204 -- Ekind Entity type. This field indicates the type of the
205 -- entity, it is of type Entity_Kind which is defined
208 -- Flag19 299 additional flags
212 -- Convention Entity convention (Convention_Id value)
214 -- Field6 Additional Union_Id value stored in tree
216 -- Node6 Synonym for Field6 typed as Node_Id
217 -- Elist6 Synonym for Field6 typed as Elist_Id (Empty = No_Elist)
218 -- Uint6 Synonym for Field6 typed as Uint (Empty = Uint_0)
220 -- Similar definitions for Field7 to Field41 (and also Node7-Node41,
221 -- Elist7-Elist41, Uint7-Uint41, Ureal7-Ureal41). Note that not all
222 -- these functions are defined, only the ones that are actually used.
224 function Last_Node_Id
return Node_Id
;
225 pragma Inline
(Last_Node_Id
);
226 -- Returns Id of last allocated node Id
228 function Nodes_Address
return System
.Address
;
229 -- Return address of Nodes table (used in Back_End for Gigi call)
231 function Flags_Address
return System
.Address
;
232 -- Return address of Flags table (used in Back_End for Gigi call)
234 function Num_Nodes
return Nat
;
235 -- Total number of nodes allocated, where an entity counts as a single
236 -- node. This count is incremented every time a node or entity is
237 -- allocated, and decremented every time a node or entity is deleted.
238 -- This value is used by Xref and by Treepr to allocate hash tables of
239 -- suitable size for hashing Node_Id values.
241 -----------------------
242 -- Use of Empty Node --
243 -----------------------
245 -- The special Node_Id Empty is used to mark missing fields. Whenever the
246 -- syntax has an optional component, then the corresponding field will be
247 -- set to Empty if the component is missing.
249 -- Note: Empty is not used to describe an empty list. Instead in this
250 -- case the node field contains a list which is empty, and these cases
251 -- should be distinguished (essentially from a type point of view, Empty
252 -- is a Node, and is thus not a list).
254 -- Note: Empty does in fact correspond to an allocated node. Only the
255 -- Nkind field of this node may be referenced. It contains N_Empty, which
256 -- uniquely identifies the empty case. This allows the Nkind field to be
257 -- dereferenced before the check for Empty which is sometimes useful.
259 -----------------------
260 -- Use of Error Node --
261 -----------------------
263 -- The Error node is used during syntactic and semantic analysis to
264 -- indicate that the corresponding piece of syntactic structure or
265 -- semantic meaning cannot properly be represented in the tree because
266 -- of an illegality in the program.
268 -- If an Error node is encountered, then you know that a previous
269 -- illegality has been detected. The proper reaction should be to
270 -- avoid posting related cascaded error messages, and to propagate
271 -- the error node if necessary.
273 ------------------------
274 -- Current_Error_Node --
275 ------------------------
277 -- The current error node is a global location indicating the current
278 -- node that is being processed for the purposes of placing a compiler
279 -- abort message. This is not necessarily perfectly accurate, it is
280 -- just a reasonably accurate best guess. It is used to output the
281 -- source location in the abort message by Comperr, and also to
282 -- implement the d3 debugging flag. This is also used by Rtsfind
283 -- to generate error messages for high integrity mode.
285 -- There are two ways this gets set. During parsing, when new source
286 -- nodes are being constructed by calls to New_Node and New_Entity,
287 -- either one of these calls sets Current_Error_Node to the newly
288 -- created node. During semantic analysis, this mechanism is not
289 -- used, and instead Current_Error_Node is set by the subprograms in
290 -- Debug_A that mark the start and end of analysis/expansion of a
293 Current_Error_Node
: Node_Id
;
294 -- Node to place error messages
300 -- The following variables denote the count of errors of various kinds
301 -- detected in the tree. Note that these might be more logically located in
302 -- Err_Vars, but we put it here to deal with licensing issues (we need this
303 -- to have the GPL exception licensing, since Check_Error_Detected can be
304 -- called from units with this licensing).
306 Serious_Errors_Detected
: Nat
:= 0;
307 -- This is a count of errors that are serious enough to stop expansion,
308 -- and hence to prevent generation of an object file even if the
309 -- switch -gnatQ is set. Initialized to zero at the start of compilation.
310 -- Initialized for -gnatVa use, see comment above.
312 Total_Errors_Detected
: Nat
:= 0;
313 -- Number of errors detected so far. Includes count of serious errors and
314 -- non-serious errors, so this value is always greater than or equal to the
315 -- Serious_Errors_Detected value. Initialized to zero at the start of
316 -- compilation. Initialized for -gnatVa use, see comment above.
318 Warnings_Detected
: Nat
:= 0;
319 -- Number of warnings detected. Initialized to zero at the start of
320 -- compilation. Initialized for -gnatVa use, see comment above. This
321 -- count includes the count of style and info messages.
323 Warning_Info_Messages
: Nat
:= 0;
324 -- Number of info messages generated as warnings. Info messages are never
325 -- treated as errors (whether from use of the pragma, or the compiler
328 Report_Info_Messages
: Nat
:= 0;
329 -- Number of info messages generated as reports. Info messages are never
330 -- treated as errors (whether from use of the pragma, or the compiler
331 -- switch -gnatwe). Used under Spark_Mode to report proved checks.
333 Check_Messages
: Nat
:= 0;
334 -- Number of check messages generated. Check messages are neither warnings
337 Warnings_Treated_As_Errors
: Nat
:= 0;
338 -- Number of warnings changed into errors as a result of matching a pattern
339 -- given in a Warning_As_Error configuration pragma.
341 Configurable_Run_Time_Violations
: Nat
:= 0;
342 -- Count of configurable run time violations so far. This is used to
343 -- suppress certain cascaded error messages when we know that we may not
344 -- have fully expanded some items, due to high integrity violations (e.g.
345 -- the use of constructs not permitted by the library in use, or improper
346 -- constructs in No_Run_Time mode).
348 procedure Check_Error_Detected
;
349 -- When an anomaly is found in the tree, many semantic routines silently
350 -- bail out, assuming that the anomaly was caused by a previously detected
351 -- serious error (or configurable run time violation). This routine should
352 -- be called in these cases, and will raise an exception if no such error
353 -- has been detected. This ensure that the anomaly is never allowed to go
356 -------------------------------
357 -- Default Setting of Fields --
358 -------------------------------
360 -- Nkind is set to N_Unused_At_Start
362 -- Ekind is set to E_Void
364 -- Sloc is always set, there is no default value
366 -- Field1-5 fields are set to Empty
368 -- Field6-41 fields in extended nodes are set to Empty
370 -- Parent is set to Empty
372 -- All Boolean flag fields are set to False
374 -- Note: the value Empty is used in Field1-Field41 to indicate a null node.
375 -- The usage varies. The common uses are to indicate absence of an optional
376 -- clause or a completely unused Field1-35 field.
378 -------------------------------------
379 -- Use of Synonyms for Node Fields --
380 -------------------------------------
382 -- A subpackage Atree.Unchecked_Access provides routines for reading and
383 -- writing the fields defined above (Field1-35, Node1-35, Flag0-317 etc).
384 -- These unchecked access routines can be used for untyped traversals.
385 -- In addition they are used in the implementations of the Sinfo and
386 -- Einfo packages. These packages both provide logical synonyms for
387 -- the generic fields, together with an appropriate set of access routines.
388 -- Normally access to information within tree nodes uses these synonyms,
389 -- providing a high level typed interface to the tree information.
391 --------------------------------------------------
392 -- Node Allocation and Modification Subprograms --
393 --------------------------------------------------
395 -- Generally the parser builds the tree and then it is further decorated
396 -- (e.g. by setting the entity fields), but not fundamentally modified.
397 -- However, there are cases in which the tree must be restructured by
398 -- adding and rearranging nodes, as a result of disambiguating cases
399 -- which the parser could not parse correctly, and adding additional
400 -- semantic information (e.g. making constraint checks explicit). The
401 -- following subprograms are used for constructing the tree in the first
402 -- place, and then for subsequent modifications as required.
404 procedure Initialize
;
405 -- Called at the start of compilation to initialize the allocation of
406 -- the node and list tables and make the standard entries for Empty,
407 -- Error and Error_List. Note that Initialize must not be called if
408 -- Tree_Read is used.
411 -- Called before the back end is invoked to lock the nodes table
412 -- Also called after Unlock to relock???
414 procedure Lock_Nodes
;
415 -- Called to lock node modifications when assertions are enabled; without
416 -- assertions calling this subprogram has no effect. The initial state of
417 -- the lock is unlocked.
420 -- Unlocks nodes table, in cases where the back end needs to modify it
422 procedure Unlock_Nodes
;
423 -- Called to unlock entity modifications when assertions are enabled; if
424 -- assertions are not enabled calling this subprogram has no effect.
427 -- Initializes internal tables from current tree file using the relevant
428 -- Table.Tree_Read routines. Note that Initialize should not be called if
429 -- Tree_Read is used. Tree_Read includes all necessary initialization.
431 procedure Tree_Write
;
432 -- Writes out internal tables to current tree file using the relevant
433 -- Table.Tree_Write routines.
436 (New_Node_Kind
: Node_Kind
;
437 New_Sloc
: Source_Ptr
) return Node_Id
;
438 -- Allocates a completely new node with the given node type and source
439 -- location values. All other fields are set to their standard defaults:
441 -- Empty for all FieldN fields
442 -- False for all FlagN fields
444 -- The usual approach is to build a new node using this function and
445 -- then, using the value returned, use the Set_xxx functions to set
446 -- fields of the node as required. New_Node can only be used for
447 -- non-entity nodes, i.e. it never generates an extended node.
449 -- If we are currently parsing, as indicated by a previous call to
450 -- Set_Comes_From_Source_Default (True), then this call also resets
451 -- the value of Current_Error_Node.
454 (New_Node_Kind
: Node_Kind
;
455 New_Sloc
: Source_Ptr
) return Entity_Id
;
456 -- Similar to New_Node, except that it is used only for entity nodes
457 -- and returns an extended node.
459 procedure Set_Comes_From_Source_Default
(Default
: Boolean);
460 -- Sets value of Comes_From_Source flag to be used in all subsequent
461 -- New_Node and New_Entity calls until another call to this procedure
462 -- changes the default. This value is set True during parsing and
463 -- False during semantic analysis. This is also used to determine
464 -- if New_Node and New_Entity should set Current_Error_Node.
466 function Get_Comes_From_Source_Default
return Boolean;
467 pragma Inline
(Get_Comes_From_Source_Default
);
468 -- Gets the current value of the Comes_From_Source flag
470 procedure Preserve_Comes_From_Source
(NewN
, OldN
: Node_Id
);
471 pragma Inline
(Preserve_Comes_From_Source
);
472 -- When a node is rewritten, it is sometimes appropriate to preserve the
473 -- original comes from source indication. This is true when the rewrite
474 -- essentially corresponds to a transformation corresponding exactly to
475 -- semantics in the reference manual. This procedure copies the setting
476 -- of Comes_From_Source from OldN to NewN.
478 function Has_Extension
(N
: Node_Id
) return Boolean;
479 pragma Inline
(Has_Extension
);
480 -- Returns True if the given node has an extension (i.e. was created by
481 -- a call to New_Entity rather than New_Node, and Nkind is in N_Entity)
483 procedure Change_Node
(N
: Node_Id
; New_Node_Kind
: Node_Kind
);
484 -- This procedure replaces the given node by setting its Nkind field to
485 -- the indicated value and resetting all other fields to their default
486 -- values except for Sloc, which is unchanged, and the Parent pointer
487 -- and list links, which are also unchanged. All other information in
488 -- the original node is lost. The new node has an extension if the
489 -- original node had an extension.
491 procedure Copy_Node
(Source
: Node_Id
; Destination
: Node_Id
);
492 -- Copy the entire contents of the source node to the destination node.
493 -- The contents of the source node is not affected. If the source node
494 -- has an extension, then the destination must have an extension also.
495 -- The parent pointer of the destination and its list link, if any, are
496 -- not affected by the copy. Note that parent pointers of descendants
497 -- are not adjusted, so the descendants of the destination node after
498 -- the Copy_Node is completed have dubious parent pointers. Note that
499 -- this routine does NOT copy aspect specifications, the Has_Aspects
500 -- flag in the returned node will always be False. The caller must deal
501 -- with copying aspect specifications where this is required.
503 function New_Copy
(Source
: Node_Id
) return Node_Id
;
504 -- This function allocates a completely new node, and then initializes
505 -- it by copying the contents of the source node into it. The contents of
506 -- the source node is not affected. The target node is always marked as
507 -- not being in a list (even if the source is a list member), and not
508 -- overloaded. The new node will have an extension if the source has
509 -- an extension. New_Copy (Empty) returns Empty, and New_Copy (Error)
510 -- returns Error. Note that, unlike Copy_Separate_Tree, New_Copy does not
511 -- recursively copy any descendants, so in general parent pointers are not
512 -- set correctly for the descendants of the copied node. Both normal and
513 -- extended nodes (entities) may be copied using New_Copy.
515 function Relocate_Node
(Source
: Node_Id
) return Node_Id
;
516 -- Source is a non-entity node that is to be relocated. A new node is
517 -- allocated, and the contents of Source are copied to this node, using
518 -- New_Copy. The parent pointers of descendants of the node are then
519 -- adjusted to point to the relocated copy. The original node is not
520 -- modified, but the parent pointers of its descendants are no longer
521 -- valid. The new copy is always marked as not overloaded. This routine is
522 -- used in conjunction with the tree rewrite routines (see descriptions of
525 -- Note that the resulting node has the same parent as the source node, and
526 -- is thus still attached to the tree. It is valid for Source to be Empty,
527 -- in which case Relocate_Node simply returns Empty as the result.
529 function Copy_Separate_Tree
(Source
: Node_Id
) return Node_Id
;
530 -- Given a node that is the root of a subtree, Copy_Separate_Tree copies
531 -- the entire syntactic subtree, including recursively any descendants
532 -- whose parent field references a copied node (descendants not linked to
533 -- a copied node by the parent field are also copied.) The parent pointers
534 -- in the copy are properly set. Copy_Separate_Tree (Empty/Error) returns
535 -- Empty/Error. The new subtree does not share entities with the source,
536 -- but has new entities with the same name.
538 -- Most of the time this routine is called on an unanalyzed tree, and no
539 -- semantic information is copied. However, to ensure that no entities
540 -- are shared between the two when the source is already analyzed, and
541 -- that the result looks like an unanalyzed tree from the parser, Entity
542 -- fields and Etype fields are set to Empty, and Analyzed flags set False.
544 -- In addition, Expanded_Name nodes are converted back into the original
545 -- parser form (where they are Selected_Components), so that reanalysis
546 -- does the right thing.
548 function Copy_Separate_List
(Source
: List_Id
) return List_Id
;
549 -- Applies Copy_Separate_Tree to each element of the Source list, returning
550 -- a new list of the results of these copy operations.
552 procedure Exchange_Entities
(E1
: Entity_Id
; E2
: Entity_Id
);
553 -- Exchange the contents of two entities. The parent pointers are switched
554 -- as well as the Defining_Identifier fields in the parents, so that the
555 -- entities point correctly to their original parents. The effect is thus
556 -- to leave the tree completely unchanged in structure, except that the
557 -- entity ID values of the two entities are interchanged. Neither of the
558 -- two entities may be list members. Note that entities appear on two
559 -- semantic chains: Homonym and Next_Entity: the corresponding links must
560 -- be adjusted by the caller, according to context.
562 function Extend_Node
(Node
: Node_Id
) return Entity_Id
;
563 -- This function returns a copy of its input node with an extension added.
564 -- The fields of the extension are set to Empty. Due to the way extensions
565 -- are handled (as four consecutive array elements), it may be necessary
566 -- to reallocate the node, so that the returned value is not the same as
567 -- the input value, but where possible the returned value will be the same
568 -- as the input value (i.e. the extension will occur in place). It is the
569 -- caller's responsibility to ensure that any pointers to the original node
570 -- are appropriately updated. This function is used only by Sinfo.CN to
571 -- change nodes into their corresponding entities.
573 type Report_Proc
is access procedure (Target
: Node_Id
; Source
: Node_Id
);
575 procedure Set_Reporting_Proc
(Proc
: Report_Proc
);
576 -- Register a procedure that is invoked when a node is allocated, replaced
579 type Rewrite_Proc
is access procedure (Target
: Node_Id
; Source
: Node_Id
);
581 procedure Set_Rewriting_Proc
(Proc
: Rewrite_Proc
);
582 -- Register a procedure that is invoked when a node is rewritten
584 type Traverse_Result
is (Abandon
, OK
, OK_Orig
, Skip
);
585 -- This is the type of the result returned by the Process function passed
586 -- to Traverse_Func and Traverse_Proc. See below for details.
588 subtype Traverse_Final_Result
is Traverse_Result
range Abandon
.. OK
;
589 -- This is the type of the final result returned Traverse_Func, based on
590 -- the results of Process calls. See below for details.
593 with function Process
(N
: Node_Id
) return Traverse_Result
is <>;
594 function Traverse_Func
(Node
: Node_Id
) return Traverse_Final_Result
;
595 -- This is a generic function that, given the parent node for a subtree,
596 -- traverses all syntactic nodes of this tree, calling the given function
597 -- Process on each one, in pre order (i.e. top-down). The order of
598 -- traversing subtrees is arbitrary. The traversal is controlled as follows
599 -- by the result returned by Process:
601 -- OK The traversal continues normally with the syntactic
602 -- children of the node just processed.
604 -- OK_Orig The traversal continues normally with the syntactic
605 -- children of the original node of the node just processed.
607 -- Skip The children of the node just processed are skipped and
608 -- excluded from the traversal, but otherwise processing
609 -- continues elsewhere in the tree.
611 -- Abandon The entire traversal is immediately abandoned, and the
612 -- original call to Traverse returns Abandon.
614 -- The result returned by Traverse is Abandon if processing was terminated
615 -- by a call to Process returning Abandon, otherwise it is OK (meaning that
616 -- all calls to process returned either OK, OK_Orig, or Skip).
619 with function Process
(N
: Node_Id
) return Traverse_Result
is <>;
620 procedure Traverse_Proc
(Node
: Node_Id
);
621 pragma Inline
(Traverse_Proc
);
622 -- This is the same as Traverse_Func except that no result is returned,
623 -- i.e. Traverse_Func is called and the result is simply discarded.
625 ---------------------------
626 -- Node Access Functions --
627 ---------------------------
629 -- The following functions return the contents of the indicated field of
630 -- the node referenced by the argument, which is a Node_Id.
632 function Analyzed
(N
: Node_Id
) return Boolean;
633 pragma Inline
(Analyzed
);
635 function Check_Actuals
(N
: Node_Id
) return Boolean;
636 pragma Inline
(Check_Actuals
);
638 function Comes_From_Source
(N
: Node_Id
) return Boolean;
639 pragma Inline
(Comes_From_Source
);
641 function Error_Posted
(N
: Node_Id
) return Boolean;
642 pragma Inline
(Error_Posted
);
644 function Has_Aspects
(N
: Node_Id
) return Boolean;
645 pragma Inline
(Has_Aspects
);
647 function Is_Ignored_Ghost_Node
(N
: Node_Id
) return Boolean;
648 pragma Inline
(Is_Ignored_Ghost_Node
);
650 function Nkind
(N
: Node_Id
) return Node_Kind
;
651 pragma Inline
(Nkind
);
653 function No
(N
: Node_Id
) return Boolean;
655 -- Tests given Id for equality with the Empty node. This allows notations
656 -- like "if No (Variant_Part)" as opposed to "if Variant_Part = Empty".
658 function Parent
(N
: Node_Id
) return Node_Id
;
659 pragma Inline
(Parent
);
660 -- Returns the parent of a node if the node is not a list member, or else
661 -- the parent of the list containing the node if the node is a list member.
663 function Paren_Count
(N
: Node_Id
) return Nat
;
664 pragma Inline
(Paren_Count
);
666 function Present
(N
: Node_Id
) return Boolean;
667 pragma Inline
(Present
);
668 -- Tests given Id for inequality with the Empty node. This allows notations
669 -- like "if Present (Statement)" as opposed to "if Statement /= Empty".
671 function Sloc
(N
: Node_Id
) return Source_Ptr
;
672 pragma Inline
(Sloc
);
674 ---------------------
675 -- Node_Kind Tests --
676 ---------------------
678 -- These are like the functions in Sinfo, but the first argument is a
679 -- Node_Id, and the tested field is Nkind (N).
684 V2
: Node_Kind
) return Boolean;
690 V3
: Node_Kind
) return Boolean;
697 V4
: Node_Kind
) return Boolean;
705 V5
: Node_Kind
) return Boolean;
714 V6
: Node_Kind
) return Boolean;
724 V7
: Node_Kind
) return Boolean;
735 V8
: Node_Kind
) return Boolean;
747 V9
: Node_Kind
) return Boolean;
760 V10
: Node_Kind
) return Boolean;
774 V11
: Node_Kind
) return Boolean;
776 pragma Inline
(Nkind_In
);
777 -- Inline all above functions
779 -----------------------
780 -- Entity_Kind_Tests --
781 -----------------------
783 -- Utility functions to test whether an Entity_Kind value, either given
784 -- directly as the first argument, or the Ekind field of an Entity given
785 -- as the first argument, matches any of the given list of Entity_Kind
786 -- values. Return True if any match, False if no match.
791 V2
: Entity_Kind
) return Boolean;
797 V3
: Entity_Kind
) return Boolean;
804 V4
: Entity_Kind
) return Boolean;
812 V5
: Entity_Kind
) return Boolean;
821 V6
: Entity_Kind
) return Boolean;
831 V7
: Entity_Kind
) return Boolean;
842 V8
: Entity_Kind
) return Boolean;
854 V9
: Entity_Kind
) return Boolean;
867 V10
: Entity_Kind
) return Boolean;
881 V11
: Entity_Kind
) return Boolean;
886 V2
: Entity_Kind
) return Boolean;
892 V3
: Entity_Kind
) return Boolean;
899 V4
: Entity_Kind
) return Boolean;
907 V5
: Entity_Kind
) return Boolean;
916 V6
: Entity_Kind
) return Boolean;
926 V7
: Entity_Kind
) return Boolean;
937 V8
: Entity_Kind
) return Boolean;
949 V9
: Entity_Kind
) return Boolean;
962 V10
: Entity_Kind
) return Boolean;
976 V11
: Entity_Kind
) return Boolean;
978 pragma Inline
(Ekind_In
);
979 -- Inline all above functions
981 -----------------------------
982 -- Entity Access Functions --
983 -----------------------------
985 -- The following functions apply only to Entity_Id values, i.e.
986 -- to extended nodes.
988 function Ekind
(E
: Entity_Id
) return Entity_Kind
;
989 pragma Inline
(Ekind
);
991 function Convention
(E
: Entity_Id
) return Convention_Id
;
992 pragma Inline
(Convention
);
994 ----------------------------
995 -- Node Update Procedures --
996 ----------------------------
998 -- The following functions set a specified field in the node whose Id is
999 -- passed as the first argument. The second parameter is the new value
1000 -- to be set in the specified field. Note that Set_Nkind is in the next
1001 -- section, since its use is restricted.
1003 procedure Set_Analyzed
(N
: Node_Id
; Val
: Boolean := True);
1004 pragma Inline
(Set_Analyzed
);
1006 procedure Set_Check_Actuals
(N
: Node_Id
; Val
: Boolean := True);
1007 pragma Inline
(Set_Check_Actuals
);
1009 procedure Set_Comes_From_Source
(N
: Node_Id
; Val
: Boolean);
1010 pragma Inline
(Set_Comes_From_Source
);
1011 -- Note that this routine is very rarely used, since usually the default
1012 -- mechanism provided sets the right value, but in some unusual cases, the
1013 -- value needs to be reset (e.g. when a source node is copied, and the copy
1014 -- must not have Comes_From_Source set).
1016 procedure Set_Error_Posted
(N
: Node_Id
; Val
: Boolean := True);
1017 pragma Inline
(Set_Error_Posted
);
1019 procedure Set_Has_Aspects
(N
: Node_Id
; Val
: Boolean := True);
1020 pragma Inline
(Set_Has_Aspects
);
1022 procedure Set_Is_Ignored_Ghost_Node
(N
: Node_Id
; Val
: Boolean := True);
1023 pragma Inline
(Set_Is_Ignored_Ghost_Node
);
1025 procedure Set_Original_Node
(N
: Node_Id
; Val
: Node_Id
);
1026 pragma Inline
(Set_Original_Node
);
1027 -- Note that this routine is used only in very peculiar cases. In normal
1028 -- cases, the Original_Node link is set by calls to Rewrite. We currently
1029 -- use it in ASIS mode to manually set the link from pragma expressions to
1030 -- their aspect original source expressions, so that the original source
1031 -- expressions accessed by ASIS are also semantically analyzed.
1033 procedure Set_Parent
(N
: Node_Id
; Val
: Node_Id
);
1034 pragma Inline
(Set_Parent
);
1036 procedure Set_Paren_Count
(N
: Node_Id
; Val
: Nat
);
1037 pragma Inline
(Set_Paren_Count
);
1039 procedure Set_Sloc
(N
: Node_Id
; Val
: Source_Ptr
);
1040 pragma Inline
(Set_Sloc
);
1042 ------------------------------
1043 -- Entity Update Procedures --
1044 ------------------------------
1046 -- The following procedures apply only to Entity_Id values, i.e.
1047 -- to extended nodes.
1049 procedure Basic_Set_Convention
(E
: Entity_Id
; Val
: Convention_Id
);
1050 pragma Inline
(Basic_Set_Convention
);
1051 -- Clients should use Sem_Util.Set_Convention rather than calling this
1052 -- routine directly, as Set_Convention also deals with the special
1053 -- processing required for access types.
1055 procedure Set_Ekind
(E
: Entity_Id
; Val
: Entity_Kind
);
1056 pragma Inline
(Set_Ekind
);
1058 ---------------------------
1059 -- Tree Rewrite Routines --
1060 ---------------------------
1062 -- During the compilation process it is necessary in a number of situations
1063 -- to rewrite the tree. In some cases, such rewrites do not affect the
1064 -- structure of the tree, for example, when an indexed component node is
1065 -- replaced by the corresponding call node (the parser cannot distinguish
1066 -- between these two cases).
1068 -- In other situations, the rewrite does affect the structure of the
1069 -- tree. Examples are the replacement of a generic instantiation by the
1070 -- instantiated spec and body, and the static evaluation of expressions.
1072 -- If such structural modifications are done by the expander, there are
1073 -- no difficulties, since the form of the tree after the expander has no
1074 -- special significance, except as input to the backend of the compiler.
1075 -- However, if these modifications are done by the semantic phase, then
1076 -- it is important that they be done in a manner which allows the original
1077 -- tree to be preserved. This is because tools like pretty printers need
1078 -- to have this original tree structure available.
1080 -- The subprograms in this section allow rewriting of the tree by either
1081 -- insertion of new nodes in an existing list, or complete replacement of
1082 -- a subtree. The resulting tree for most purposes looks as though it has
1083 -- been really changed, and there is no trace of the original. However,
1084 -- special subprograms, also defined in this section, allow the original
1085 -- tree to be reconstructed if necessary.
1087 -- For tree modifications done in the expander, it is permissible to
1088 -- destroy the original tree, although it is also allowable to use the
1089 -- tree rewrite routines where it is convenient to do so.
1091 procedure Mark_Rewrite_Insertion
(New_Node
: Node_Id
);
1092 pragma Inline
(Mark_Rewrite_Insertion
);
1093 -- This procedure marks the given node as an insertion made during a tree
1094 -- rewriting operation. Only the root needs to be marked. The call does
1095 -- not do the actual insertion, which must be done using one of the normal
1096 -- list insertion routines. The node is treated normally in all respects
1097 -- except for its response to Is_Rewrite_Insertion. The function of these
1098 -- calls is to be able to get an accurate original tree. This helps the
1099 -- accuracy of Sprint.Sprint_Node, and in particular, when stubs are being
1100 -- generated, it is essential that the original tree be accurate.
1102 function Is_Rewrite_Insertion
(Node
: Node_Id
) return Boolean;
1103 pragma Inline
(Is_Rewrite_Insertion
);
1104 -- Tests whether the given node was marked using Mark_Rewrite_Insertion.
1105 -- This is used in reconstructing the original tree (where such nodes are
1106 -- to be eliminated).
1108 procedure Rewrite
(Old_Node
, New_Node
: Node_Id
);
1109 -- This is used when a complete subtree is to be replaced. Old_Node is the
1110 -- root of the old subtree to be replaced, and New_Node is the root of the
1111 -- newly constructed replacement subtree. The actual mechanism is to swap
1112 -- the contents of these two nodes fixing up the parent pointers of the
1113 -- replaced node (we do not attempt to preserve parent pointers for the
1114 -- original node). Neither Old_Node nor New_Node can be extended nodes.
1116 -- Note: New_Node may not contain references to Old_Node, for example as
1117 -- descendants, since the rewrite would make such references invalid. If
1118 -- New_Node does need to reference Old_Node, then these references should
1119 -- be to a relocated copy of Old_Node (see Relocate_Node procedure).
1121 -- Note: The Original_Node function applied to Old_Node (which has now
1122 -- been replaced by the contents of New_Node), can be used to obtain the
1123 -- original node, i.e. the old contents of Old_Node.
1125 procedure Replace
(Old_Node
, New_Node
: Node_Id
);
1126 -- This is similar to Rewrite, except that the old value of Old_Node is
1127 -- not saved, and the New_Node is deleted after the replace, since it
1128 -- is assumed that it can no longer be legitimately needed. The flag
1129 -- Is_Rewrite_Substitution will be False for the resulting node, unless
1130 -- it was already true on entry, and Original_Node will not return the
1131 -- original contents of the Old_Node, but rather the New_Node value (unless
1132 -- Old_Node had already been rewritten using Rewrite). Replace also
1133 -- preserves the setting of Comes_From_Source.
1135 -- Note, New_Node may not contain references to Old_Node, for example as
1136 -- descendants, since the rewrite would make such references invalid. If
1137 -- New_Node does need to reference Old_Node, then these references should
1138 -- be to a relocated copy of Old_Node (see Relocate_Node procedure).
1140 -- Replace is used in certain circumstances where it is desirable to
1141 -- suppress any history of the rewriting operation. Notably, it is used
1142 -- when the parser has mis-classified a node (e.g. a task entry call
1143 -- that the parser has parsed as a procedure call).
1145 function Is_Rewrite_Substitution
(Node
: Node_Id
) return Boolean;
1146 pragma Inline
(Is_Rewrite_Substitution
);
1147 -- Return True iff Node has been rewritten (i.e. if Node is the root
1148 -- of a subtree which was installed using Rewrite).
1150 function Original_Node
(Node
: Node_Id
) return Node_Id
;
1151 pragma Inline
(Original_Node
);
1152 -- If Node has not been rewritten, then returns its input argument
1153 -- unchanged, else returns the Node for the original subtree. Note that
1154 -- this is used extensively by ASIS on the trees constructed in ASIS mode
1155 -- to reconstruct the original semantic tree. See section in sinfo.ads
1156 -- for requirements on original nodes returned by this function.
1158 -- Note: Parents are not preserved in original tree nodes that are
1159 -- retrieved in this way (i.e. their children may have children whose
1160 -- pointers which reference some other node). This needs more details???
1162 -- Note: there is no direct mechanism for deleting an original node (in
1163 -- a manner that can be reversed later). One possible approach is to use
1164 -- Rewrite to substitute a null statement for the node to be deleted.
1166 -----------------------------------
1167 -- Generic Field Access Routines --
1168 -----------------------------------
1170 -- This subpackage provides the functions for accessing and procedures for
1171 -- setting fields that are normally referenced by wrapper subprograms (e.g.
1172 -- logical synonyms defined in packages Sinfo and Einfo, or specialized
1173 -- routines such as Rewrite (for Original_Node), or the node creation
1174 -- routines (for Set_Nkind). The implementations of these wrapper
1175 -- subprograms use the package Atree.Unchecked_Access as do various
1176 -- special case accesses where no wrapper applies. Documentation is always
1177 -- required for such a special case access explaining why it is needed.
1179 package Unchecked_Access
is
1181 -- Functions to allow interpretation of Union_Id values as Uint and
1184 function To_Union
is new Unchecked_Conversion
(Uint
, Union_Id
);
1185 function To_Union
is new Unchecked_Conversion
(Ureal
, Union_Id
);
1187 function From_Union
is new Unchecked_Conversion
(Union_Id
, Uint
);
1188 function From_Union
is new Unchecked_Conversion
(Union_Id
, Ureal
);
1190 -- Functions to fetch contents of indicated field. It is an error to
1191 -- attempt to read the value of a field which is not present.
1193 function Field1
(N
: Node_Id
) return Union_Id
;
1194 pragma Inline
(Field1
);
1196 function Field2
(N
: Node_Id
) return Union_Id
;
1197 pragma Inline
(Field2
);
1199 function Field3
(N
: Node_Id
) return Union_Id
;
1200 pragma Inline
(Field3
);
1202 function Field4
(N
: Node_Id
) return Union_Id
;
1203 pragma Inline
(Field4
);
1205 function Field5
(N
: Node_Id
) return Union_Id
;
1206 pragma Inline
(Field5
);
1208 function Field6
(N
: Node_Id
) return Union_Id
;
1209 pragma Inline
(Field6
);
1211 function Field7
(N
: Node_Id
) return Union_Id
;
1212 pragma Inline
(Field7
);
1214 function Field8
(N
: Node_Id
) return Union_Id
;
1215 pragma Inline
(Field8
);
1217 function Field9
(N
: Node_Id
) return Union_Id
;
1218 pragma Inline
(Field9
);
1220 function Field10
(N
: Node_Id
) return Union_Id
;
1221 pragma Inline
(Field10
);
1223 function Field11
(N
: Node_Id
) return Union_Id
;
1224 pragma Inline
(Field11
);
1226 function Field12
(N
: Node_Id
) return Union_Id
;
1227 pragma Inline
(Field12
);
1229 function Field13
(N
: Node_Id
) return Union_Id
;
1230 pragma Inline
(Field13
);
1232 function Field14
(N
: Node_Id
) return Union_Id
;
1233 pragma Inline
(Field14
);
1235 function Field15
(N
: Node_Id
) return Union_Id
;
1236 pragma Inline
(Field15
);
1238 function Field16
(N
: Node_Id
) return Union_Id
;
1239 pragma Inline
(Field16
);
1241 function Field17
(N
: Node_Id
) return Union_Id
;
1242 pragma Inline
(Field17
);
1244 function Field18
(N
: Node_Id
) return Union_Id
;
1245 pragma Inline
(Field18
);
1247 function Field19
(N
: Node_Id
) return Union_Id
;
1248 pragma Inline
(Field19
);
1250 function Field20
(N
: Node_Id
) return Union_Id
;
1251 pragma Inline
(Field20
);
1253 function Field21
(N
: Node_Id
) return Union_Id
;
1254 pragma Inline
(Field21
);
1256 function Field22
(N
: Node_Id
) return Union_Id
;
1257 pragma Inline
(Field22
);
1259 function Field23
(N
: Node_Id
) return Union_Id
;
1260 pragma Inline
(Field23
);
1262 function Field24
(N
: Node_Id
) return Union_Id
;
1263 pragma Inline
(Field24
);
1265 function Field25
(N
: Node_Id
) return Union_Id
;
1266 pragma Inline
(Field25
);
1268 function Field26
(N
: Node_Id
) return Union_Id
;
1269 pragma Inline
(Field26
);
1271 function Field27
(N
: Node_Id
) return Union_Id
;
1272 pragma Inline
(Field27
);
1274 function Field28
(N
: Node_Id
) return Union_Id
;
1275 pragma Inline
(Field28
);
1277 function Field29
(N
: Node_Id
) return Union_Id
;
1278 pragma Inline
(Field29
);
1280 function Field30
(N
: Node_Id
) return Union_Id
;
1281 pragma Inline
(Field30
);
1283 function Field31
(N
: Node_Id
) return Union_Id
;
1284 pragma Inline
(Field31
);
1286 function Field32
(N
: Node_Id
) return Union_Id
;
1287 pragma Inline
(Field32
);
1289 function Field33
(N
: Node_Id
) return Union_Id
;
1290 pragma Inline
(Field33
);
1292 function Field34
(N
: Node_Id
) return Union_Id
;
1293 pragma Inline
(Field34
);
1295 function Field35
(N
: Node_Id
) return Union_Id
;
1296 pragma Inline
(Field35
);
1298 function Field36
(N
: Node_Id
) return Union_Id
;
1299 pragma Inline
(Field36
);
1301 function Field37
(N
: Node_Id
) return Union_Id
;
1302 pragma Inline
(Field37
);
1304 function Field38
(N
: Node_Id
) return Union_Id
;
1305 pragma Inline
(Field38
);
1307 function Field39
(N
: Node_Id
) return Union_Id
;
1308 pragma Inline
(Field39
);
1310 function Field40
(N
: Node_Id
) return Union_Id
;
1311 pragma Inline
(Field40
);
1313 function Field41
(N
: Node_Id
) return Union_Id
;
1314 pragma Inline
(Field41
);
1316 function Node1
(N
: Node_Id
) return Node_Id
;
1317 pragma Inline
(Node1
);
1319 function Node2
(N
: Node_Id
) return Node_Id
;
1320 pragma Inline
(Node2
);
1322 function Node3
(N
: Node_Id
) return Node_Id
;
1323 pragma Inline
(Node3
);
1325 function Node4
(N
: Node_Id
) return Node_Id
;
1326 pragma Inline
(Node4
);
1328 function Node5
(N
: Node_Id
) return Node_Id
;
1329 pragma Inline
(Node5
);
1331 function Node6
(N
: Node_Id
) return Node_Id
;
1332 pragma Inline
(Node6
);
1334 function Node7
(N
: Node_Id
) return Node_Id
;
1335 pragma Inline
(Node7
);
1337 function Node8
(N
: Node_Id
) return Node_Id
;
1338 pragma Inline
(Node8
);
1340 function Node9
(N
: Node_Id
) return Node_Id
;
1341 pragma Inline
(Node9
);
1343 function Node10
(N
: Node_Id
) return Node_Id
;
1344 pragma Inline
(Node10
);
1346 function Node11
(N
: Node_Id
) return Node_Id
;
1347 pragma Inline
(Node11
);
1349 function Node12
(N
: Node_Id
) return Node_Id
;
1350 pragma Inline
(Node12
);
1352 function Node13
(N
: Node_Id
) return Node_Id
;
1353 pragma Inline
(Node13
);
1355 function Node14
(N
: Node_Id
) return Node_Id
;
1356 pragma Inline
(Node14
);
1358 function Node15
(N
: Node_Id
) return Node_Id
;
1359 pragma Inline
(Node15
);
1361 function Node16
(N
: Node_Id
) return Node_Id
;
1362 pragma Inline
(Node16
);
1364 function Node17
(N
: Node_Id
) return Node_Id
;
1365 pragma Inline
(Node17
);
1367 function Node18
(N
: Node_Id
) return Node_Id
;
1368 pragma Inline
(Node18
);
1370 function Node19
(N
: Node_Id
) return Node_Id
;
1371 pragma Inline
(Node19
);
1373 function Node20
(N
: Node_Id
) return Node_Id
;
1374 pragma Inline
(Node20
);
1376 function Node21
(N
: Node_Id
) return Node_Id
;
1377 pragma Inline
(Node21
);
1379 function Node22
(N
: Node_Id
) return Node_Id
;
1380 pragma Inline
(Node22
);
1382 function Node23
(N
: Node_Id
) return Node_Id
;
1383 pragma Inline
(Node23
);
1385 function Node24
(N
: Node_Id
) return Node_Id
;
1386 pragma Inline
(Node24
);
1388 function Node25
(N
: Node_Id
) return Node_Id
;
1389 pragma Inline
(Node25
);
1391 function Node26
(N
: Node_Id
) return Node_Id
;
1392 pragma Inline
(Node26
);
1394 function Node27
(N
: Node_Id
) return Node_Id
;
1395 pragma Inline
(Node27
);
1397 function Node28
(N
: Node_Id
) return Node_Id
;
1398 pragma Inline
(Node28
);
1400 function Node29
(N
: Node_Id
) return Node_Id
;
1401 pragma Inline
(Node29
);
1403 function Node30
(N
: Node_Id
) return Node_Id
;
1404 pragma Inline
(Node30
);
1406 function Node31
(N
: Node_Id
) return Node_Id
;
1407 pragma Inline
(Node31
);
1409 function Node32
(N
: Node_Id
) return Node_Id
;
1410 pragma Inline
(Node32
);
1412 function Node33
(N
: Node_Id
) return Node_Id
;
1413 pragma Inline
(Node33
);
1415 function Node34
(N
: Node_Id
) return Node_Id
;
1416 pragma Inline
(Node34
);
1418 function Node35
(N
: Node_Id
) return Node_Id
;
1419 pragma Inline
(Node35
);
1421 function Node36
(N
: Node_Id
) return Node_Id
;
1422 pragma Inline
(Node36
);
1424 function Node37
(N
: Node_Id
) return Node_Id
;
1425 pragma Inline
(Node37
);
1427 function Node38
(N
: Node_Id
) return Node_Id
;
1428 pragma Inline
(Node38
);
1430 function Node39
(N
: Node_Id
) return Node_Id
;
1431 pragma Inline
(Node39
);
1433 function Node40
(N
: Node_Id
) return Node_Id
;
1434 pragma Inline
(Node40
);
1436 function Node41
(N
: Node_Id
) return Node_Id
;
1437 pragma Inline
(Node41
);
1439 function List1
(N
: Node_Id
) return List_Id
;
1440 pragma Inline
(List1
);
1442 function List2
(N
: Node_Id
) return List_Id
;
1443 pragma Inline
(List2
);
1445 function List3
(N
: Node_Id
) return List_Id
;
1446 pragma Inline
(List3
);
1448 function List4
(N
: Node_Id
) return List_Id
;
1449 pragma Inline
(List4
);
1451 function List5
(N
: Node_Id
) return List_Id
;
1452 pragma Inline
(List5
);
1454 function List10
(N
: Node_Id
) return List_Id
;
1455 pragma Inline
(List10
);
1457 function List14
(N
: Node_Id
) return List_Id
;
1458 pragma Inline
(List14
);
1460 function List25
(N
: Node_Id
) return List_Id
;
1461 pragma Inline
(List25
);
1463 function List38
(N
: Node_Id
) return List_Id
;
1464 pragma Inline
(List38
);
1466 function List39
(N
: Node_Id
) return List_Id
;
1467 pragma Inline
(List39
);
1469 function Elist1
(N
: Node_Id
) return Elist_Id
;
1470 pragma Inline
(Elist1
);
1472 function Elist2
(N
: Node_Id
) return Elist_Id
;
1473 pragma Inline
(Elist2
);
1475 function Elist3
(N
: Node_Id
) return Elist_Id
;
1476 pragma Inline
(Elist3
);
1478 function Elist4
(N
: Node_Id
) return Elist_Id
;
1479 pragma Inline
(Elist4
);
1481 function Elist5
(N
: Node_Id
) return Elist_Id
;
1482 pragma Inline
(Elist5
);
1484 function Elist8
(N
: Node_Id
) return Elist_Id
;
1485 pragma Inline
(Elist8
);
1487 function Elist9
(N
: Node_Id
) return Elist_Id
;
1488 pragma Inline
(Elist9
);
1490 function Elist10
(N
: Node_Id
) return Elist_Id
;
1491 pragma Inline
(Elist10
);
1493 function Elist11
(N
: Node_Id
) return Elist_Id
;
1494 pragma Inline
(Elist11
);
1496 function Elist13
(N
: Node_Id
) return Elist_Id
;
1497 pragma Inline
(Elist13
);
1499 function Elist15
(N
: Node_Id
) return Elist_Id
;
1500 pragma Inline
(Elist15
);
1502 function Elist16
(N
: Node_Id
) return Elist_Id
;
1503 pragma Inline
(Elist16
);
1505 function Elist18
(N
: Node_Id
) return Elist_Id
;
1506 pragma Inline
(Elist18
);
1508 function Elist21
(N
: Node_Id
) return Elist_Id
;
1509 pragma Inline
(Elist21
);
1511 function Elist23
(N
: Node_Id
) return Elist_Id
;
1512 pragma Inline
(Elist23
);
1514 function Elist24
(N
: Node_Id
) return Elist_Id
;
1515 pragma Inline
(Elist24
);
1517 function Elist25
(N
: Node_Id
) return Elist_Id
;
1518 pragma Inline
(Elist25
);
1520 function Elist26
(N
: Node_Id
) return Elist_Id
;
1521 pragma Inline
(Elist26
);
1523 function Elist29
(N
: Node_Id
) return Elist_Id
;
1524 pragma Inline
(Elist29
);
1526 function Elist30
(N
: Node_Id
) return Elist_Id
;
1527 pragma Inline
(Elist30
);
1529 function Elist36
(N
: Node_Id
) return Elist_Id
;
1530 pragma Inline
(Elist36
);
1532 function Name1
(N
: Node_Id
) return Name_Id
;
1533 pragma Inline
(Name1
);
1535 function Name2
(N
: Node_Id
) return Name_Id
;
1536 pragma Inline
(Name2
);
1538 function Str3
(N
: Node_Id
) return String_Id
;
1539 pragma Inline
(Str3
);
1541 -- Note: the following Uintnn functions have a special test for the
1542 -- Field value being Empty. If an Empty value is found then Uint_0 is
1543 -- returned. This avoids the rather tricky requirement of initializing
1544 -- all Uint fields in nodes and entities.
1546 function Uint2
(N
: Node_Id
) return Uint
;
1547 pragma Inline
(Uint2
);
1549 function Uint3
(N
: Node_Id
) return Uint
;
1550 pragma Inline
(Uint3
);
1552 function Uint4
(N
: Node_Id
) return Uint
;
1553 pragma Inline
(Uint4
);
1555 function Uint5
(N
: Node_Id
) return Uint
;
1556 pragma Inline
(Uint5
);
1558 function Uint8
(N
: Node_Id
) return Uint
;
1559 pragma Inline
(Uint8
);
1561 function Uint9
(N
: Node_Id
) return Uint
;
1562 pragma Inline
(Uint9
);
1564 function Uint10
(N
: Node_Id
) return Uint
;
1565 pragma Inline
(Uint10
);
1567 function Uint11
(N
: Node_Id
) return Uint
;
1568 pragma Inline
(Uint11
);
1570 function Uint12
(N
: Node_Id
) return Uint
;
1571 pragma Inline
(Uint12
);
1573 function Uint13
(N
: Node_Id
) return Uint
;
1574 pragma Inline
(Uint13
);
1576 function Uint14
(N
: Node_Id
) return Uint
;
1577 pragma Inline
(Uint14
);
1579 function Uint15
(N
: Node_Id
) return Uint
;
1580 pragma Inline
(Uint15
);
1582 function Uint16
(N
: Node_Id
) return Uint
;
1583 pragma Inline
(Uint16
);
1585 function Uint17
(N
: Node_Id
) return Uint
;
1586 pragma Inline
(Uint17
);
1588 function Uint22
(N
: Node_Id
) return Uint
;
1589 pragma Inline
(Uint22
);
1591 function Uint24
(N
: Node_Id
) return Uint
;
1592 pragma Inline
(Uint24
);
1594 function Ureal3
(N
: Node_Id
) return Ureal
;
1595 pragma Inline
(Ureal3
);
1597 function Ureal18
(N
: Node_Id
) return Ureal
;
1598 pragma Inline
(Ureal18
);
1600 function Ureal21
(N
: Node_Id
) return Ureal
;
1601 pragma Inline
(Ureal21
);
1603 function Flag0
(N
: Node_Id
) return Boolean;
1604 pragma Inline
(Flag0
);
1606 function Flag1
(N
: Node_Id
) return Boolean;
1607 pragma Inline
(Flag1
);
1609 function Flag2
(N
: Node_Id
) return Boolean;
1610 pragma Inline
(Flag2
);
1612 function Flag3
(N
: Node_Id
) return Boolean;
1613 pragma Inline
(Flag3
);
1615 function Flag4
(N
: Node_Id
) return Boolean;
1616 pragma Inline
(Flag4
);
1618 function Flag5
(N
: Node_Id
) return Boolean;
1619 pragma Inline
(Flag5
);
1621 function Flag6
(N
: Node_Id
) return Boolean;
1622 pragma Inline
(Flag6
);
1624 function Flag7
(N
: Node_Id
) return Boolean;
1625 pragma Inline
(Flag7
);
1627 function Flag8
(N
: Node_Id
) return Boolean;
1628 pragma Inline
(Flag8
);
1630 function Flag9
(N
: Node_Id
) return Boolean;
1631 pragma Inline
(Flag9
);
1633 function Flag10
(N
: Node_Id
) return Boolean;
1634 pragma Inline
(Flag10
);
1636 function Flag11
(N
: Node_Id
) return Boolean;
1637 pragma Inline
(Flag11
);
1639 function Flag12
(N
: Node_Id
) return Boolean;
1640 pragma Inline
(Flag12
);
1642 function Flag13
(N
: Node_Id
) return Boolean;
1643 pragma Inline
(Flag13
);
1645 function Flag14
(N
: Node_Id
) return Boolean;
1646 pragma Inline
(Flag14
);
1648 function Flag15
(N
: Node_Id
) return Boolean;
1649 pragma Inline
(Flag15
);
1651 function Flag16
(N
: Node_Id
) return Boolean;
1652 pragma Inline
(Flag16
);
1654 function Flag17
(N
: Node_Id
) return Boolean;
1655 pragma Inline
(Flag17
);
1657 function Flag18
(N
: Node_Id
) return Boolean;
1658 pragma Inline
(Flag18
);
1660 function Flag19
(N
: Node_Id
) return Boolean;
1661 pragma Inline
(Flag19
);
1663 function Flag20
(N
: Node_Id
) return Boolean;
1664 pragma Inline
(Flag20
);
1666 function Flag21
(N
: Node_Id
) return Boolean;
1667 pragma Inline
(Flag21
);
1669 function Flag22
(N
: Node_Id
) return Boolean;
1670 pragma Inline
(Flag22
);
1672 function Flag23
(N
: Node_Id
) return Boolean;
1673 pragma Inline
(Flag23
);
1675 function Flag24
(N
: Node_Id
) return Boolean;
1676 pragma Inline
(Flag24
);
1678 function Flag25
(N
: Node_Id
) return Boolean;
1679 pragma Inline
(Flag25
);
1681 function Flag26
(N
: Node_Id
) return Boolean;
1682 pragma Inline
(Flag26
);
1684 function Flag27
(N
: Node_Id
) return Boolean;
1685 pragma Inline
(Flag27
);
1687 function Flag28
(N
: Node_Id
) return Boolean;
1688 pragma Inline
(Flag28
);
1690 function Flag29
(N
: Node_Id
) return Boolean;
1691 pragma Inline
(Flag29
);
1693 function Flag30
(N
: Node_Id
) return Boolean;
1694 pragma Inline
(Flag30
);
1696 function Flag31
(N
: Node_Id
) return Boolean;
1697 pragma Inline
(Flag31
);
1699 function Flag32
(N
: Node_Id
) return Boolean;
1700 pragma Inline
(Flag32
);
1702 function Flag33
(N
: Node_Id
) return Boolean;
1703 pragma Inline
(Flag33
);
1705 function Flag34
(N
: Node_Id
) return Boolean;
1706 pragma Inline
(Flag34
);
1708 function Flag35
(N
: Node_Id
) return Boolean;
1709 pragma Inline
(Flag35
);
1711 function Flag36
(N
: Node_Id
) return Boolean;
1712 pragma Inline
(Flag36
);
1714 function Flag37
(N
: Node_Id
) return Boolean;
1715 pragma Inline
(Flag37
);
1717 function Flag38
(N
: Node_Id
) return Boolean;
1718 pragma Inline
(Flag38
);
1720 function Flag39
(N
: Node_Id
) return Boolean;
1721 pragma Inline
(Flag39
);
1723 function Flag40
(N
: Node_Id
) return Boolean;
1724 pragma Inline
(Flag40
);
1726 function Flag41
(N
: Node_Id
) return Boolean;
1727 pragma Inline
(Flag41
);
1729 function Flag42
(N
: Node_Id
) return Boolean;
1730 pragma Inline
(Flag42
);
1732 function Flag43
(N
: Node_Id
) return Boolean;
1733 pragma Inline
(Flag43
);
1735 function Flag44
(N
: Node_Id
) return Boolean;
1736 pragma Inline
(Flag44
);
1738 function Flag45
(N
: Node_Id
) return Boolean;
1739 pragma Inline
(Flag45
);
1741 function Flag46
(N
: Node_Id
) return Boolean;
1742 pragma Inline
(Flag46
);
1744 function Flag47
(N
: Node_Id
) return Boolean;
1745 pragma Inline
(Flag47
);
1747 function Flag48
(N
: Node_Id
) return Boolean;
1748 pragma Inline
(Flag48
);
1750 function Flag49
(N
: Node_Id
) return Boolean;
1751 pragma Inline
(Flag49
);
1753 function Flag50
(N
: Node_Id
) return Boolean;
1754 pragma Inline
(Flag50
);
1756 function Flag51
(N
: Node_Id
) return Boolean;
1757 pragma Inline
(Flag51
);
1759 function Flag52
(N
: Node_Id
) return Boolean;
1760 pragma Inline
(Flag52
);
1762 function Flag53
(N
: Node_Id
) return Boolean;
1763 pragma Inline
(Flag53
);
1765 function Flag54
(N
: Node_Id
) return Boolean;
1766 pragma Inline
(Flag54
);
1768 function Flag55
(N
: Node_Id
) return Boolean;
1769 pragma Inline
(Flag55
);
1771 function Flag56
(N
: Node_Id
) return Boolean;
1772 pragma Inline
(Flag56
);
1774 function Flag57
(N
: Node_Id
) return Boolean;
1775 pragma Inline
(Flag57
);
1777 function Flag58
(N
: Node_Id
) return Boolean;
1778 pragma Inline
(Flag58
);
1780 function Flag59
(N
: Node_Id
) return Boolean;
1781 pragma Inline
(Flag59
);
1783 function Flag60
(N
: Node_Id
) return Boolean;
1784 pragma Inline
(Flag60
);
1786 function Flag61
(N
: Node_Id
) return Boolean;
1787 pragma Inline
(Flag61
);
1789 function Flag62
(N
: Node_Id
) return Boolean;
1790 pragma Inline
(Flag62
);
1792 function Flag63
(N
: Node_Id
) return Boolean;
1793 pragma Inline
(Flag63
);
1795 function Flag64
(N
: Node_Id
) return Boolean;
1796 pragma Inline
(Flag64
);
1798 function Flag65
(N
: Node_Id
) return Boolean;
1799 pragma Inline
(Flag65
);
1801 function Flag66
(N
: Node_Id
) return Boolean;
1802 pragma Inline
(Flag66
);
1804 function Flag67
(N
: Node_Id
) return Boolean;
1805 pragma Inline
(Flag67
);
1807 function Flag68
(N
: Node_Id
) return Boolean;
1808 pragma Inline
(Flag68
);
1810 function Flag69
(N
: Node_Id
) return Boolean;
1811 pragma Inline
(Flag69
);
1813 function Flag70
(N
: Node_Id
) return Boolean;
1814 pragma Inline
(Flag70
);
1816 function Flag71
(N
: Node_Id
) return Boolean;
1817 pragma Inline
(Flag71
);
1819 function Flag72
(N
: Node_Id
) return Boolean;
1820 pragma Inline
(Flag72
);
1822 function Flag73
(N
: Node_Id
) return Boolean;
1823 pragma Inline
(Flag73
);
1825 function Flag74
(N
: Node_Id
) return Boolean;
1826 pragma Inline
(Flag74
);
1828 function Flag75
(N
: Node_Id
) return Boolean;
1829 pragma Inline
(Flag75
);
1831 function Flag76
(N
: Node_Id
) return Boolean;
1832 pragma Inline
(Flag76
);
1834 function Flag77
(N
: Node_Id
) return Boolean;
1835 pragma Inline
(Flag77
);
1837 function Flag78
(N
: Node_Id
) return Boolean;
1838 pragma Inline
(Flag78
);
1840 function Flag79
(N
: Node_Id
) return Boolean;
1841 pragma Inline
(Flag79
);
1843 function Flag80
(N
: Node_Id
) return Boolean;
1844 pragma Inline
(Flag80
);
1846 function Flag81
(N
: Node_Id
) return Boolean;
1847 pragma Inline
(Flag81
);
1849 function Flag82
(N
: Node_Id
) return Boolean;
1850 pragma Inline
(Flag82
);
1852 function Flag83
(N
: Node_Id
) return Boolean;
1853 pragma Inline
(Flag83
);
1855 function Flag84
(N
: Node_Id
) return Boolean;
1856 pragma Inline
(Flag84
);
1858 function Flag85
(N
: Node_Id
) return Boolean;
1859 pragma Inline
(Flag85
);
1861 function Flag86
(N
: Node_Id
) return Boolean;
1862 pragma Inline
(Flag86
);
1864 function Flag87
(N
: Node_Id
) return Boolean;
1865 pragma Inline
(Flag87
);
1867 function Flag88
(N
: Node_Id
) return Boolean;
1868 pragma Inline
(Flag88
);
1870 function Flag89
(N
: Node_Id
) return Boolean;
1871 pragma Inline
(Flag89
);
1873 function Flag90
(N
: Node_Id
) return Boolean;
1874 pragma Inline
(Flag90
);
1876 function Flag91
(N
: Node_Id
) return Boolean;
1877 pragma Inline
(Flag91
);
1879 function Flag92
(N
: Node_Id
) return Boolean;
1880 pragma Inline
(Flag92
);
1882 function Flag93
(N
: Node_Id
) return Boolean;
1883 pragma Inline
(Flag93
);
1885 function Flag94
(N
: Node_Id
) return Boolean;
1886 pragma Inline
(Flag94
);
1888 function Flag95
(N
: Node_Id
) return Boolean;
1889 pragma Inline
(Flag95
);
1891 function Flag96
(N
: Node_Id
) return Boolean;
1892 pragma Inline
(Flag96
);
1894 function Flag97
(N
: Node_Id
) return Boolean;
1895 pragma Inline
(Flag97
);
1897 function Flag98
(N
: Node_Id
) return Boolean;
1898 pragma Inline
(Flag98
);
1900 function Flag99
(N
: Node_Id
) return Boolean;
1901 pragma Inline
(Flag99
);
1903 function Flag100
(N
: Node_Id
) return Boolean;
1904 pragma Inline
(Flag100
);
1906 function Flag101
(N
: Node_Id
) return Boolean;
1907 pragma Inline
(Flag101
);
1909 function Flag102
(N
: Node_Id
) return Boolean;
1910 pragma Inline
(Flag102
);
1912 function Flag103
(N
: Node_Id
) return Boolean;
1913 pragma Inline
(Flag103
);
1915 function Flag104
(N
: Node_Id
) return Boolean;
1916 pragma Inline
(Flag104
);
1918 function Flag105
(N
: Node_Id
) return Boolean;
1919 pragma Inline
(Flag105
);
1921 function Flag106
(N
: Node_Id
) return Boolean;
1922 pragma Inline
(Flag106
);
1924 function Flag107
(N
: Node_Id
) return Boolean;
1925 pragma Inline
(Flag107
);
1927 function Flag108
(N
: Node_Id
) return Boolean;
1928 pragma Inline
(Flag108
);
1930 function Flag109
(N
: Node_Id
) return Boolean;
1931 pragma Inline
(Flag109
);
1933 function Flag110
(N
: Node_Id
) return Boolean;
1934 pragma Inline
(Flag110
);
1936 function Flag111
(N
: Node_Id
) return Boolean;
1937 pragma Inline
(Flag111
);
1939 function Flag112
(N
: Node_Id
) return Boolean;
1940 pragma Inline
(Flag112
);
1942 function Flag113
(N
: Node_Id
) return Boolean;
1943 pragma Inline
(Flag113
);
1945 function Flag114
(N
: Node_Id
) return Boolean;
1946 pragma Inline
(Flag114
);
1948 function Flag115
(N
: Node_Id
) return Boolean;
1949 pragma Inline
(Flag115
);
1951 function Flag116
(N
: Node_Id
) return Boolean;
1952 pragma Inline
(Flag116
);
1954 function Flag117
(N
: Node_Id
) return Boolean;
1955 pragma Inline
(Flag117
);
1957 function Flag118
(N
: Node_Id
) return Boolean;
1958 pragma Inline
(Flag118
);
1960 function Flag119
(N
: Node_Id
) return Boolean;
1961 pragma Inline
(Flag119
);
1963 function Flag120
(N
: Node_Id
) return Boolean;
1964 pragma Inline
(Flag120
);
1966 function Flag121
(N
: Node_Id
) return Boolean;
1967 pragma Inline
(Flag121
);
1969 function Flag122
(N
: Node_Id
) return Boolean;
1970 pragma Inline
(Flag122
);
1972 function Flag123
(N
: Node_Id
) return Boolean;
1973 pragma Inline
(Flag123
);
1975 function Flag124
(N
: Node_Id
) return Boolean;
1976 pragma Inline
(Flag124
);
1978 function Flag125
(N
: Node_Id
) return Boolean;
1979 pragma Inline
(Flag125
);
1981 function Flag126
(N
: Node_Id
) return Boolean;
1982 pragma Inline
(Flag126
);
1984 function Flag127
(N
: Node_Id
) return Boolean;
1985 pragma Inline
(Flag127
);
1987 function Flag128
(N
: Node_Id
) return Boolean;
1988 pragma Inline
(Flag128
);
1990 function Flag129
(N
: Node_Id
) return Boolean;
1991 pragma Inline
(Flag129
);
1993 function Flag130
(N
: Node_Id
) return Boolean;
1994 pragma Inline
(Flag130
);
1996 function Flag131
(N
: Node_Id
) return Boolean;
1997 pragma Inline
(Flag131
);
1999 function Flag132
(N
: Node_Id
) return Boolean;
2000 pragma Inline
(Flag132
);
2002 function Flag133
(N
: Node_Id
) return Boolean;
2003 pragma Inline
(Flag133
);
2005 function Flag134
(N
: Node_Id
) return Boolean;
2006 pragma Inline
(Flag134
);
2008 function Flag135
(N
: Node_Id
) return Boolean;
2009 pragma Inline
(Flag135
);
2011 function Flag136
(N
: Node_Id
) return Boolean;
2012 pragma Inline
(Flag136
);
2014 function Flag137
(N
: Node_Id
) return Boolean;
2015 pragma Inline
(Flag137
);
2017 function Flag138
(N
: Node_Id
) return Boolean;
2018 pragma Inline
(Flag138
);
2020 function Flag139
(N
: Node_Id
) return Boolean;
2021 pragma Inline
(Flag139
);
2023 function Flag140
(N
: Node_Id
) return Boolean;
2024 pragma Inline
(Flag140
);
2026 function Flag141
(N
: Node_Id
) return Boolean;
2027 pragma Inline
(Flag141
);
2029 function Flag142
(N
: Node_Id
) return Boolean;
2030 pragma Inline
(Flag142
);
2032 function Flag143
(N
: Node_Id
) return Boolean;
2033 pragma Inline
(Flag143
);
2035 function Flag144
(N
: Node_Id
) return Boolean;
2036 pragma Inline
(Flag144
);
2038 function Flag145
(N
: Node_Id
) return Boolean;
2039 pragma Inline
(Flag145
);
2041 function Flag146
(N
: Node_Id
) return Boolean;
2042 pragma Inline
(Flag146
);
2044 function Flag147
(N
: Node_Id
) return Boolean;
2045 pragma Inline
(Flag147
);
2047 function Flag148
(N
: Node_Id
) return Boolean;
2048 pragma Inline
(Flag148
);
2050 function Flag149
(N
: Node_Id
) return Boolean;
2051 pragma Inline
(Flag149
);
2053 function Flag150
(N
: Node_Id
) return Boolean;
2054 pragma Inline
(Flag150
);
2056 function Flag151
(N
: Node_Id
) return Boolean;
2057 pragma Inline
(Flag151
);
2059 function Flag152
(N
: Node_Id
) return Boolean;
2060 pragma Inline
(Flag152
);
2062 function Flag153
(N
: Node_Id
) return Boolean;
2063 pragma Inline
(Flag153
);
2065 function Flag154
(N
: Node_Id
) return Boolean;
2066 pragma Inline
(Flag154
);
2068 function Flag155
(N
: Node_Id
) return Boolean;
2069 pragma Inline
(Flag155
);
2071 function Flag156
(N
: Node_Id
) return Boolean;
2072 pragma Inline
(Flag156
);
2074 function Flag157
(N
: Node_Id
) return Boolean;
2075 pragma Inline
(Flag157
);
2077 function Flag158
(N
: Node_Id
) return Boolean;
2078 pragma Inline
(Flag158
);
2080 function Flag159
(N
: Node_Id
) return Boolean;
2081 pragma Inline
(Flag159
);
2083 function Flag160
(N
: Node_Id
) return Boolean;
2084 pragma Inline
(Flag160
);
2086 function Flag161
(N
: Node_Id
) return Boolean;
2087 pragma Inline
(Flag161
);
2089 function Flag162
(N
: Node_Id
) return Boolean;
2090 pragma Inline
(Flag162
);
2092 function Flag163
(N
: Node_Id
) return Boolean;
2093 pragma Inline
(Flag163
);
2095 function Flag164
(N
: Node_Id
) return Boolean;
2096 pragma Inline
(Flag164
);
2098 function Flag165
(N
: Node_Id
) return Boolean;
2099 pragma Inline
(Flag165
);
2101 function Flag166
(N
: Node_Id
) return Boolean;
2102 pragma Inline
(Flag166
);
2104 function Flag167
(N
: Node_Id
) return Boolean;
2105 pragma Inline
(Flag167
);
2107 function Flag168
(N
: Node_Id
) return Boolean;
2108 pragma Inline
(Flag168
);
2110 function Flag169
(N
: Node_Id
) return Boolean;
2111 pragma Inline
(Flag169
);
2113 function Flag170
(N
: Node_Id
) return Boolean;
2114 pragma Inline
(Flag170
);
2116 function Flag171
(N
: Node_Id
) return Boolean;
2117 pragma Inline
(Flag171
);
2119 function Flag172
(N
: Node_Id
) return Boolean;
2120 pragma Inline
(Flag172
);
2122 function Flag173
(N
: Node_Id
) return Boolean;
2123 pragma Inline
(Flag173
);
2125 function Flag174
(N
: Node_Id
) return Boolean;
2126 pragma Inline
(Flag174
);
2128 function Flag175
(N
: Node_Id
) return Boolean;
2129 pragma Inline
(Flag175
);
2131 function Flag176
(N
: Node_Id
) return Boolean;
2132 pragma Inline
(Flag176
);
2134 function Flag177
(N
: Node_Id
) return Boolean;
2135 pragma Inline
(Flag177
);
2137 function Flag178
(N
: Node_Id
) return Boolean;
2138 pragma Inline
(Flag178
);
2140 function Flag179
(N
: Node_Id
) return Boolean;
2141 pragma Inline
(Flag179
);
2143 function Flag180
(N
: Node_Id
) return Boolean;
2144 pragma Inline
(Flag180
);
2146 function Flag181
(N
: Node_Id
) return Boolean;
2147 pragma Inline
(Flag181
);
2149 function Flag182
(N
: Node_Id
) return Boolean;
2150 pragma Inline
(Flag182
);
2152 function Flag183
(N
: Node_Id
) return Boolean;
2153 pragma Inline
(Flag183
);
2155 function Flag184
(N
: Node_Id
) return Boolean;
2156 pragma Inline
(Flag184
);
2158 function Flag185
(N
: Node_Id
) return Boolean;
2159 pragma Inline
(Flag185
);
2161 function Flag186
(N
: Node_Id
) return Boolean;
2162 pragma Inline
(Flag186
);
2164 function Flag187
(N
: Node_Id
) return Boolean;
2165 pragma Inline
(Flag187
);
2167 function Flag188
(N
: Node_Id
) return Boolean;
2168 pragma Inline
(Flag188
);
2170 function Flag189
(N
: Node_Id
) return Boolean;
2171 pragma Inline
(Flag189
);
2173 function Flag190
(N
: Node_Id
) return Boolean;
2174 pragma Inline
(Flag190
);
2176 function Flag191
(N
: Node_Id
) return Boolean;
2177 pragma Inline
(Flag191
);
2179 function Flag192
(N
: Node_Id
) return Boolean;
2180 pragma Inline
(Flag192
);
2182 function Flag193
(N
: Node_Id
) return Boolean;
2183 pragma Inline
(Flag193
);
2185 function Flag194
(N
: Node_Id
) return Boolean;
2186 pragma Inline
(Flag194
);
2188 function Flag195
(N
: Node_Id
) return Boolean;
2189 pragma Inline
(Flag195
);
2191 function Flag196
(N
: Node_Id
) return Boolean;
2192 pragma Inline
(Flag196
);
2194 function Flag197
(N
: Node_Id
) return Boolean;
2195 pragma Inline
(Flag197
);
2197 function Flag198
(N
: Node_Id
) return Boolean;
2198 pragma Inline
(Flag198
);
2200 function Flag199
(N
: Node_Id
) return Boolean;
2201 pragma Inline
(Flag199
);
2203 function Flag200
(N
: Node_Id
) return Boolean;
2204 pragma Inline
(Flag200
);
2206 function Flag201
(N
: Node_Id
) return Boolean;
2207 pragma Inline
(Flag201
);
2209 function Flag202
(N
: Node_Id
) return Boolean;
2210 pragma Inline
(Flag202
);
2212 function Flag203
(N
: Node_Id
) return Boolean;
2213 pragma Inline
(Flag203
);
2215 function Flag204
(N
: Node_Id
) return Boolean;
2216 pragma Inline
(Flag204
);
2218 function Flag205
(N
: Node_Id
) return Boolean;
2219 pragma Inline
(Flag205
);
2221 function Flag206
(N
: Node_Id
) return Boolean;
2222 pragma Inline
(Flag206
);
2224 function Flag207
(N
: Node_Id
) return Boolean;
2225 pragma Inline
(Flag207
);
2227 function Flag208
(N
: Node_Id
) return Boolean;
2228 pragma Inline
(Flag208
);
2230 function Flag209
(N
: Node_Id
) return Boolean;
2231 pragma Inline
(Flag209
);
2233 function Flag210
(N
: Node_Id
) return Boolean;
2234 pragma Inline
(Flag210
);
2236 function Flag211
(N
: Node_Id
) return Boolean;
2237 pragma Inline
(Flag211
);
2239 function Flag212
(N
: Node_Id
) return Boolean;
2240 pragma Inline
(Flag212
);
2242 function Flag213
(N
: Node_Id
) return Boolean;
2243 pragma Inline
(Flag213
);
2245 function Flag214
(N
: Node_Id
) return Boolean;
2246 pragma Inline
(Flag214
);
2248 function Flag215
(N
: Node_Id
) return Boolean;
2249 pragma Inline
(Flag215
);
2251 function Flag216
(N
: Node_Id
) return Boolean;
2252 pragma Inline
(Flag216
);
2254 function Flag217
(N
: Node_Id
) return Boolean;
2255 pragma Inline
(Flag217
);
2257 function Flag218
(N
: Node_Id
) return Boolean;
2258 pragma Inline
(Flag218
);
2260 function Flag219
(N
: Node_Id
) return Boolean;
2261 pragma Inline
(Flag219
);
2263 function Flag220
(N
: Node_Id
) return Boolean;
2264 pragma Inline
(Flag220
);
2266 function Flag221
(N
: Node_Id
) return Boolean;
2267 pragma Inline
(Flag221
);
2269 function Flag222
(N
: Node_Id
) return Boolean;
2270 pragma Inline
(Flag222
);
2272 function Flag223
(N
: Node_Id
) return Boolean;
2273 pragma Inline
(Flag223
);
2275 function Flag224
(N
: Node_Id
) return Boolean;
2276 pragma Inline
(Flag224
);
2278 function Flag225
(N
: Node_Id
) return Boolean;
2279 pragma Inline
(Flag225
);
2281 function Flag226
(N
: Node_Id
) return Boolean;
2282 pragma Inline
(Flag226
);
2284 function Flag227
(N
: Node_Id
) return Boolean;
2285 pragma Inline
(Flag227
);
2287 function Flag228
(N
: Node_Id
) return Boolean;
2288 pragma Inline
(Flag228
);
2290 function Flag229
(N
: Node_Id
) return Boolean;
2291 pragma Inline
(Flag229
);
2293 function Flag230
(N
: Node_Id
) return Boolean;
2294 pragma Inline
(Flag230
);
2296 function Flag231
(N
: Node_Id
) return Boolean;
2297 pragma Inline
(Flag231
);
2299 function Flag232
(N
: Node_Id
) return Boolean;
2300 pragma Inline
(Flag232
);
2302 function Flag233
(N
: Node_Id
) return Boolean;
2303 pragma Inline
(Flag233
);
2305 function Flag234
(N
: Node_Id
) return Boolean;
2306 pragma Inline
(Flag234
);
2308 function Flag235
(N
: Node_Id
) return Boolean;
2309 pragma Inline
(Flag235
);
2311 function Flag236
(N
: Node_Id
) return Boolean;
2312 pragma Inline
(Flag236
);
2314 function Flag237
(N
: Node_Id
) return Boolean;
2315 pragma Inline
(Flag237
);
2317 function Flag238
(N
: Node_Id
) return Boolean;
2318 pragma Inline
(Flag238
);
2320 function Flag239
(N
: Node_Id
) return Boolean;
2321 pragma Inline
(Flag239
);
2323 function Flag240
(N
: Node_Id
) return Boolean;
2324 pragma Inline
(Flag240
);
2326 function Flag241
(N
: Node_Id
) return Boolean;
2327 pragma Inline
(Flag241
);
2329 function Flag242
(N
: Node_Id
) return Boolean;
2330 pragma Inline
(Flag242
);
2332 function Flag243
(N
: Node_Id
) return Boolean;
2333 pragma Inline
(Flag243
);
2335 function Flag244
(N
: Node_Id
) return Boolean;
2336 pragma Inline
(Flag244
);
2338 function Flag245
(N
: Node_Id
) return Boolean;
2339 pragma Inline
(Flag245
);
2341 function Flag246
(N
: Node_Id
) return Boolean;
2342 pragma Inline
(Flag246
);
2344 function Flag247
(N
: Node_Id
) return Boolean;
2345 pragma Inline
(Flag247
);
2347 function Flag248
(N
: Node_Id
) return Boolean;
2348 pragma Inline
(Flag248
);
2350 function Flag249
(N
: Node_Id
) return Boolean;
2351 pragma Inline
(Flag249
);
2353 function Flag250
(N
: Node_Id
) return Boolean;
2354 pragma Inline
(Flag250
);
2356 function Flag251
(N
: Node_Id
) return Boolean;
2357 pragma Inline
(Flag251
);
2359 function Flag252
(N
: Node_Id
) return Boolean;
2360 pragma Inline
(Flag252
);
2362 function Flag253
(N
: Node_Id
) return Boolean;
2363 pragma Inline
(Flag253
);
2365 function Flag254
(N
: Node_Id
) return Boolean;
2366 pragma Inline
(Flag254
);
2368 function Flag255
(N
: Node_Id
) return Boolean;
2369 pragma Inline
(Flag255
);
2371 function Flag256
(N
: Node_Id
) return Boolean;
2372 pragma Inline
(Flag256
);
2374 function Flag257
(N
: Node_Id
) return Boolean;
2375 pragma Inline
(Flag257
);
2377 function Flag258
(N
: Node_Id
) return Boolean;
2378 pragma Inline
(Flag258
);
2380 function Flag259
(N
: Node_Id
) return Boolean;
2381 pragma Inline
(Flag259
);
2383 function Flag260
(N
: Node_Id
) return Boolean;
2384 pragma Inline
(Flag260
);
2386 function Flag261
(N
: Node_Id
) return Boolean;
2387 pragma Inline
(Flag261
);
2389 function Flag262
(N
: Node_Id
) return Boolean;
2390 pragma Inline
(Flag262
);
2392 function Flag263
(N
: Node_Id
) return Boolean;
2393 pragma Inline
(Flag263
);
2395 function Flag264
(N
: Node_Id
) return Boolean;
2396 pragma Inline
(Flag264
);
2398 function Flag265
(N
: Node_Id
) return Boolean;
2399 pragma Inline
(Flag265
);
2401 function Flag266
(N
: Node_Id
) return Boolean;
2402 pragma Inline
(Flag266
);
2404 function Flag267
(N
: Node_Id
) return Boolean;
2405 pragma Inline
(Flag267
);
2407 function Flag268
(N
: Node_Id
) return Boolean;
2408 pragma Inline
(Flag268
);
2410 function Flag269
(N
: Node_Id
) return Boolean;
2411 pragma Inline
(Flag269
);
2413 function Flag270
(N
: Node_Id
) return Boolean;
2414 pragma Inline
(Flag270
);
2416 function Flag271
(N
: Node_Id
) return Boolean;
2417 pragma Inline
(Flag271
);
2419 function Flag272
(N
: Node_Id
) return Boolean;
2420 pragma Inline
(Flag272
);
2422 function Flag273
(N
: Node_Id
) return Boolean;
2423 pragma Inline
(Flag273
);
2425 function Flag274
(N
: Node_Id
) return Boolean;
2426 pragma Inline
(Flag274
);
2428 function Flag275
(N
: Node_Id
) return Boolean;
2429 pragma Inline
(Flag275
);
2431 function Flag276
(N
: Node_Id
) return Boolean;
2432 pragma Inline
(Flag276
);
2434 function Flag277
(N
: Node_Id
) return Boolean;
2435 pragma Inline
(Flag277
);
2437 function Flag278
(N
: Node_Id
) return Boolean;
2438 pragma Inline
(Flag278
);
2440 function Flag279
(N
: Node_Id
) return Boolean;
2441 pragma Inline
(Flag279
);
2443 function Flag280
(N
: Node_Id
) return Boolean;
2444 pragma Inline
(Flag280
);
2446 function Flag281
(N
: Node_Id
) return Boolean;
2447 pragma Inline
(Flag281
);
2449 function Flag282
(N
: Node_Id
) return Boolean;
2450 pragma Inline
(Flag282
);
2452 function Flag283
(N
: Node_Id
) return Boolean;
2453 pragma Inline
(Flag283
);
2455 function Flag284
(N
: Node_Id
) return Boolean;
2456 pragma Inline
(Flag284
);
2458 function Flag285
(N
: Node_Id
) return Boolean;
2459 pragma Inline
(Flag285
);
2461 function Flag286
(N
: Node_Id
) return Boolean;
2462 pragma Inline
(Flag286
);
2464 function Flag287
(N
: Node_Id
) return Boolean;
2465 pragma Inline
(Flag287
);
2467 function Flag288
(N
: Node_Id
) return Boolean;
2468 pragma Inline
(Flag288
);
2470 function Flag289
(N
: Node_Id
) return Boolean;
2471 pragma Inline
(Flag289
);
2473 function Flag290
(N
: Node_Id
) return Boolean;
2474 pragma Inline
(Flag290
);
2476 function Flag291
(N
: Node_Id
) return Boolean;
2477 pragma Inline
(Flag291
);
2479 function Flag292
(N
: Node_Id
) return Boolean;
2480 pragma Inline
(Flag292
);
2482 function Flag293
(N
: Node_Id
) return Boolean;
2483 pragma Inline
(Flag293
);
2485 function Flag294
(N
: Node_Id
) return Boolean;
2486 pragma Inline
(Flag294
);
2488 function Flag295
(N
: Node_Id
) return Boolean;
2489 pragma Inline
(Flag295
);
2491 function Flag296
(N
: Node_Id
) return Boolean;
2492 pragma Inline
(Flag296
);
2494 function Flag297
(N
: Node_Id
) return Boolean;
2495 pragma Inline
(Flag297
);
2497 function Flag298
(N
: Node_Id
) return Boolean;
2498 pragma Inline
(Flag298
);
2500 function Flag299
(N
: Node_Id
) return Boolean;
2501 pragma Inline
(Flag299
);
2503 function Flag300
(N
: Node_Id
) return Boolean;
2504 pragma Inline
(Flag300
);
2506 function Flag301
(N
: Node_Id
) return Boolean;
2507 pragma Inline
(Flag301
);
2509 function Flag302
(N
: Node_Id
) return Boolean;
2510 pragma Inline
(Flag302
);
2512 function Flag303
(N
: Node_Id
) return Boolean;
2513 pragma Inline
(Flag303
);
2515 function Flag304
(N
: Node_Id
) return Boolean;
2516 pragma Inline
(Flag304
);
2518 function Flag305
(N
: Node_Id
) return Boolean;
2519 pragma Inline
(Flag305
);
2521 function Flag306
(N
: Node_Id
) return Boolean;
2522 pragma Inline
(Flag306
);
2524 function Flag307
(N
: Node_Id
) return Boolean;
2525 pragma Inline
(Flag307
);
2527 function Flag308
(N
: Node_Id
) return Boolean;
2528 pragma Inline
(Flag308
);
2530 function Flag309
(N
: Node_Id
) return Boolean;
2531 pragma Inline
(Flag309
);
2533 function Flag310
(N
: Node_Id
) return Boolean;
2534 pragma Inline
(Flag310
);
2536 function Flag311
(N
: Node_Id
) return Boolean;
2537 pragma Inline
(Flag311
);
2539 function Flag312
(N
: Node_Id
) return Boolean;
2540 pragma Inline
(Flag312
);
2542 function Flag313
(N
: Node_Id
) return Boolean;
2543 pragma Inline
(Flag313
);
2545 function Flag314
(N
: Node_Id
) return Boolean;
2546 pragma Inline
(Flag314
);
2548 function Flag315
(N
: Node_Id
) return Boolean;
2549 pragma Inline
(Flag315
);
2551 function Flag316
(N
: Node_Id
) return Boolean;
2552 pragma Inline
(Flag316
);
2554 function Flag317
(N
: Node_Id
) return Boolean;
2555 pragma Inline
(Flag317
);
2557 -- Procedures to set value of indicated field
2559 procedure Set_Nkind
(N
: Node_Id
; Val
: Node_Kind
);
2560 pragma Inline
(Set_Nkind
);
2562 procedure Set_Field1
(N
: Node_Id
; Val
: Union_Id
);
2563 pragma Inline
(Set_Field1
);
2565 procedure Set_Field2
(N
: Node_Id
; Val
: Union_Id
);
2566 pragma Inline
(Set_Field2
);
2568 procedure Set_Field3
(N
: Node_Id
; Val
: Union_Id
);
2569 pragma Inline
(Set_Field3
);
2571 procedure Set_Field4
(N
: Node_Id
; Val
: Union_Id
);
2572 pragma Inline
(Set_Field4
);
2574 procedure Set_Field5
(N
: Node_Id
; Val
: Union_Id
);
2575 pragma Inline
(Set_Field5
);
2577 procedure Set_Field6
(N
: Node_Id
; Val
: Union_Id
);
2578 pragma Inline
(Set_Field6
);
2580 procedure Set_Field7
(N
: Node_Id
; Val
: Union_Id
);
2581 pragma Inline
(Set_Field7
);
2583 procedure Set_Field8
(N
: Node_Id
; Val
: Union_Id
);
2584 pragma Inline
(Set_Field8
);
2586 procedure Set_Field9
(N
: Node_Id
; Val
: Union_Id
);
2587 pragma Inline
(Set_Field9
);
2589 procedure Set_Field10
(N
: Node_Id
; Val
: Union_Id
);
2590 pragma Inline
(Set_Field10
);
2592 procedure Set_Field11
(N
: Node_Id
; Val
: Union_Id
);
2593 pragma Inline
(Set_Field11
);
2595 procedure Set_Field12
(N
: Node_Id
; Val
: Union_Id
);
2596 pragma Inline
(Set_Field12
);
2598 procedure Set_Field13
(N
: Node_Id
; Val
: Union_Id
);
2599 pragma Inline
(Set_Field13
);
2601 procedure Set_Field14
(N
: Node_Id
; Val
: Union_Id
);
2602 pragma Inline
(Set_Field14
);
2604 procedure Set_Field15
(N
: Node_Id
; Val
: Union_Id
);
2605 pragma Inline
(Set_Field15
);
2607 procedure Set_Field16
(N
: Node_Id
; Val
: Union_Id
);
2608 pragma Inline
(Set_Field16
);
2610 procedure Set_Field17
(N
: Node_Id
; Val
: Union_Id
);
2611 pragma Inline
(Set_Field17
);
2613 procedure Set_Field18
(N
: Node_Id
; Val
: Union_Id
);
2614 pragma Inline
(Set_Field18
);
2616 procedure Set_Field19
(N
: Node_Id
; Val
: Union_Id
);
2617 pragma Inline
(Set_Field19
);
2619 procedure Set_Field20
(N
: Node_Id
; Val
: Union_Id
);
2620 pragma Inline
(Set_Field20
);
2622 procedure Set_Field21
(N
: Node_Id
; Val
: Union_Id
);
2623 pragma Inline
(Set_Field21
);
2625 procedure Set_Field22
(N
: Node_Id
; Val
: Union_Id
);
2626 pragma Inline
(Set_Field22
);
2628 procedure Set_Field23
(N
: Node_Id
; Val
: Union_Id
);
2629 pragma Inline
(Set_Field23
);
2631 procedure Set_Field24
(N
: Node_Id
; Val
: Union_Id
);
2632 pragma Inline
(Set_Field24
);
2634 procedure Set_Field25
(N
: Node_Id
; Val
: Union_Id
);
2635 pragma Inline
(Set_Field25
);
2637 procedure Set_Field26
(N
: Node_Id
; Val
: Union_Id
);
2638 pragma Inline
(Set_Field26
);
2640 procedure Set_Field27
(N
: Node_Id
; Val
: Union_Id
);
2641 pragma Inline
(Set_Field27
);
2643 procedure Set_Field28
(N
: Node_Id
; Val
: Union_Id
);
2644 pragma Inline
(Set_Field28
);
2646 procedure Set_Field29
(N
: Node_Id
; Val
: Union_Id
);
2647 pragma Inline
(Set_Field29
);
2649 procedure Set_Field30
(N
: Node_Id
; Val
: Union_Id
);
2650 pragma Inline
(Set_Field30
);
2652 procedure Set_Field31
(N
: Node_Id
; Val
: Union_Id
);
2653 pragma Inline
(Set_Field31
);
2655 procedure Set_Field32
(N
: Node_Id
; Val
: Union_Id
);
2656 pragma Inline
(Set_Field32
);
2658 procedure Set_Field33
(N
: Node_Id
; Val
: Union_Id
);
2659 pragma Inline
(Set_Field33
);
2661 procedure Set_Field34
(N
: Node_Id
; Val
: Union_Id
);
2662 pragma Inline
(Set_Field34
);
2664 procedure Set_Field35
(N
: Node_Id
; Val
: Union_Id
);
2665 pragma Inline
(Set_Field35
);
2667 procedure Set_Field36
(N
: Node_Id
; Val
: Union_Id
);
2668 pragma Inline
(Set_Field36
);
2670 procedure Set_Field37
(N
: Node_Id
; Val
: Union_Id
);
2671 pragma Inline
(Set_Field37
);
2673 procedure Set_Field38
(N
: Node_Id
; Val
: Union_Id
);
2674 pragma Inline
(Set_Field38
);
2676 procedure Set_Field39
(N
: Node_Id
; Val
: Union_Id
);
2677 pragma Inline
(Set_Field39
);
2679 procedure Set_Field40
(N
: Node_Id
; Val
: Union_Id
);
2680 pragma Inline
(Set_Field40
);
2682 procedure Set_Field41
(N
: Node_Id
; Val
: Union_Id
);
2683 pragma Inline
(Set_Field41
);
2685 procedure Set_Node1
(N
: Node_Id
; Val
: Node_Id
);
2686 pragma Inline
(Set_Node1
);
2688 procedure Set_Node2
(N
: Node_Id
; Val
: Node_Id
);
2689 pragma Inline
(Set_Node2
);
2691 procedure Set_Node3
(N
: Node_Id
; Val
: Node_Id
);
2692 pragma Inline
(Set_Node3
);
2694 procedure Set_Node4
(N
: Node_Id
; Val
: Node_Id
);
2695 pragma Inline
(Set_Node4
);
2697 procedure Set_Node5
(N
: Node_Id
; Val
: Node_Id
);
2698 pragma Inline
(Set_Node5
);
2700 procedure Set_Node6
(N
: Node_Id
; Val
: Node_Id
);
2701 pragma Inline
(Set_Node6
);
2703 procedure Set_Node7
(N
: Node_Id
; Val
: Node_Id
);
2704 pragma Inline
(Set_Node7
);
2706 procedure Set_Node8
(N
: Node_Id
; Val
: Node_Id
);
2707 pragma Inline
(Set_Node8
);
2709 procedure Set_Node9
(N
: Node_Id
; Val
: Node_Id
);
2710 pragma Inline
(Set_Node9
);
2712 procedure Set_Node10
(N
: Node_Id
; Val
: Node_Id
);
2713 pragma Inline
(Set_Node10
);
2715 procedure Set_Node11
(N
: Node_Id
; Val
: Node_Id
);
2716 pragma Inline
(Set_Node11
);
2718 procedure Set_Node12
(N
: Node_Id
; Val
: Node_Id
);
2719 pragma Inline
(Set_Node12
);
2721 procedure Set_Node13
(N
: Node_Id
; Val
: Node_Id
);
2722 pragma Inline
(Set_Node13
);
2724 procedure Set_Node14
(N
: Node_Id
; Val
: Node_Id
);
2725 pragma Inline
(Set_Node14
);
2727 procedure Set_Node15
(N
: Node_Id
; Val
: Node_Id
);
2728 pragma Inline
(Set_Node15
);
2730 procedure Set_Node16
(N
: Node_Id
; Val
: Node_Id
);
2731 pragma Inline
(Set_Node16
);
2733 procedure Set_Node17
(N
: Node_Id
; Val
: Node_Id
);
2734 pragma Inline
(Set_Node17
);
2736 procedure Set_Node18
(N
: Node_Id
; Val
: Node_Id
);
2737 pragma Inline
(Set_Node18
);
2739 procedure Set_Node19
(N
: Node_Id
; Val
: Node_Id
);
2740 pragma Inline
(Set_Node19
);
2742 procedure Set_Node20
(N
: Node_Id
; Val
: Node_Id
);
2743 pragma Inline
(Set_Node20
);
2745 procedure Set_Node21
(N
: Node_Id
; Val
: Node_Id
);
2746 pragma Inline
(Set_Node21
);
2748 procedure Set_Node22
(N
: Node_Id
; Val
: Node_Id
);
2749 pragma Inline
(Set_Node22
);
2751 procedure Set_Node23
(N
: Node_Id
; Val
: Node_Id
);
2752 pragma Inline
(Set_Node23
);
2754 procedure Set_Node24
(N
: Node_Id
; Val
: Node_Id
);
2755 pragma Inline
(Set_Node24
);
2757 procedure Set_Node25
(N
: Node_Id
; Val
: Node_Id
);
2758 pragma Inline
(Set_Node25
);
2760 procedure Set_Node26
(N
: Node_Id
; Val
: Node_Id
);
2761 pragma Inline
(Set_Node26
);
2763 procedure Set_Node27
(N
: Node_Id
; Val
: Node_Id
);
2764 pragma Inline
(Set_Node27
);
2766 procedure Set_Node28
(N
: Node_Id
; Val
: Node_Id
);
2767 pragma Inline
(Set_Node28
);
2769 procedure Set_Node29
(N
: Node_Id
; Val
: Node_Id
);
2770 pragma Inline
(Set_Node29
);
2772 procedure Set_Node30
(N
: Node_Id
; Val
: Node_Id
);
2773 pragma Inline
(Set_Node30
);
2775 procedure Set_Node31
(N
: Node_Id
; Val
: Node_Id
);
2776 pragma Inline
(Set_Node31
);
2778 procedure Set_Node32
(N
: Node_Id
; Val
: Node_Id
);
2779 pragma Inline
(Set_Node32
);
2781 procedure Set_Node33
(N
: Node_Id
; Val
: Node_Id
);
2782 pragma Inline
(Set_Node33
);
2784 procedure Set_Node34
(N
: Node_Id
; Val
: Node_Id
);
2785 pragma Inline
(Set_Node34
);
2787 procedure Set_Node35
(N
: Node_Id
; Val
: Node_Id
);
2788 pragma Inline
(Set_Node35
);
2790 procedure Set_Node36
(N
: Node_Id
; Val
: Node_Id
);
2791 pragma Inline
(Set_Node36
);
2793 procedure Set_Node37
(N
: Node_Id
; Val
: Node_Id
);
2794 pragma Inline
(Set_Node37
);
2796 procedure Set_Node38
(N
: Node_Id
; Val
: Node_Id
);
2797 pragma Inline
(Set_Node38
);
2799 procedure Set_Node39
(N
: Node_Id
; Val
: Node_Id
);
2800 pragma Inline
(Set_Node39
);
2802 procedure Set_Node40
(N
: Node_Id
; Val
: Node_Id
);
2803 pragma Inline
(Set_Node40
);
2805 procedure Set_Node41
(N
: Node_Id
; Val
: Node_Id
);
2806 pragma Inline
(Set_Node41
);
2808 procedure Set_List1
(N
: Node_Id
; Val
: List_Id
);
2809 pragma Inline
(Set_List1
);
2811 procedure Set_List2
(N
: Node_Id
; Val
: List_Id
);
2812 pragma Inline
(Set_List2
);
2814 procedure Set_List3
(N
: Node_Id
; Val
: List_Id
);
2815 pragma Inline
(Set_List3
);
2817 procedure Set_List4
(N
: Node_Id
; Val
: List_Id
);
2818 pragma Inline
(Set_List4
);
2820 procedure Set_List5
(N
: Node_Id
; Val
: List_Id
);
2821 pragma Inline
(Set_List5
);
2823 procedure Set_List10
(N
: Node_Id
; Val
: List_Id
);
2824 pragma Inline
(Set_List10
);
2826 procedure Set_List14
(N
: Node_Id
; Val
: List_Id
);
2827 pragma Inline
(Set_List14
);
2829 procedure Set_List25
(N
: Node_Id
; Val
: List_Id
);
2830 pragma Inline
(Set_List25
);
2832 procedure Set_List38
(N
: Node_Id
; Val
: List_Id
);
2833 pragma Inline
(Set_List38
);
2835 procedure Set_List39
(N
: Node_Id
; Val
: List_Id
);
2836 pragma Inline
(Set_List39
);
2838 procedure Set_Elist1
(N
: Node_Id
; Val
: Elist_Id
);
2839 pragma Inline
(Set_Elist1
);
2841 procedure Set_Elist2
(N
: Node_Id
; Val
: Elist_Id
);
2842 pragma Inline
(Set_Elist2
);
2844 procedure Set_Elist3
(N
: Node_Id
; Val
: Elist_Id
);
2845 pragma Inline
(Set_Elist3
);
2847 procedure Set_Elist4
(N
: Node_Id
; Val
: Elist_Id
);
2848 pragma Inline
(Set_Elist4
);
2850 procedure Set_Elist5
(N
: Node_Id
; Val
: Elist_Id
);
2851 pragma Inline
(Set_Elist5
);
2853 procedure Set_Elist8
(N
: Node_Id
; Val
: Elist_Id
);
2854 pragma Inline
(Set_Elist8
);
2856 procedure Set_Elist9
(N
: Node_Id
; Val
: Elist_Id
);
2857 pragma Inline
(Set_Elist9
);
2859 procedure Set_Elist10
(N
: Node_Id
; Val
: Elist_Id
);
2860 pragma Inline
(Set_Elist10
);
2862 procedure Set_Elist11
(N
: Node_Id
; Val
: Elist_Id
);
2863 pragma Inline
(Set_Elist11
);
2865 procedure Set_Elist13
(N
: Node_Id
; Val
: Elist_Id
);
2866 pragma Inline
(Set_Elist13
);
2868 procedure Set_Elist15
(N
: Node_Id
; Val
: Elist_Id
);
2869 pragma Inline
(Set_Elist15
);
2871 procedure Set_Elist16
(N
: Node_Id
; Val
: Elist_Id
);
2872 pragma Inline
(Set_Elist16
);
2874 procedure Set_Elist18
(N
: Node_Id
; Val
: Elist_Id
);
2875 pragma Inline
(Set_Elist18
);
2877 procedure Set_Elist21
(N
: Node_Id
; Val
: Elist_Id
);
2878 pragma Inline
(Set_Elist21
);
2880 procedure Set_Elist23
(N
: Node_Id
; Val
: Elist_Id
);
2881 pragma Inline
(Set_Elist23
);
2883 procedure Set_Elist24
(N
: Node_Id
; Val
: Elist_Id
);
2884 pragma Inline
(Set_Elist24
);
2886 procedure Set_Elist25
(N
: Node_Id
; Val
: Elist_Id
);
2887 pragma Inline
(Set_Elist25
);
2889 procedure Set_Elist26
(N
: Node_Id
; Val
: Elist_Id
);
2890 pragma Inline
(Set_Elist26
);
2892 procedure Set_Elist29
(N
: Node_Id
; Val
: Elist_Id
);
2893 pragma Inline
(Set_Elist29
);
2895 procedure Set_Elist30
(N
: Node_Id
; Val
: Elist_Id
);
2896 pragma Inline
(Set_Elist30
);
2898 procedure Set_Elist36
(N
: Node_Id
; Val
: Elist_Id
);
2899 pragma Inline
(Set_Elist36
);
2901 procedure Set_Name1
(N
: Node_Id
; Val
: Name_Id
);
2902 pragma Inline
(Set_Name1
);
2904 procedure Set_Name2
(N
: Node_Id
; Val
: Name_Id
);
2905 pragma Inline
(Set_Name2
);
2907 procedure Set_Str3
(N
: Node_Id
; Val
: String_Id
);
2908 pragma Inline
(Set_Str3
);
2910 procedure Set_Uint2
(N
: Node_Id
; Val
: Uint
);
2911 pragma Inline
(Set_Uint2
);
2913 procedure Set_Uint3
(N
: Node_Id
; Val
: Uint
);
2914 pragma Inline
(Set_Uint3
);
2916 procedure Set_Uint4
(N
: Node_Id
; Val
: Uint
);
2917 pragma Inline
(Set_Uint4
);
2919 procedure Set_Uint5
(N
: Node_Id
; Val
: Uint
);
2920 pragma Inline
(Set_Uint5
);
2922 procedure Set_Uint8
(N
: Node_Id
; Val
: Uint
);
2923 pragma Inline
(Set_Uint8
);
2925 procedure Set_Uint9
(N
: Node_Id
; Val
: Uint
);
2926 pragma Inline
(Set_Uint9
);
2928 procedure Set_Uint10
(N
: Node_Id
; Val
: Uint
);
2929 pragma Inline
(Set_Uint10
);
2931 procedure Set_Uint11
(N
: Node_Id
; Val
: Uint
);
2932 pragma Inline
(Set_Uint11
);
2934 procedure Set_Uint12
(N
: Node_Id
; Val
: Uint
);
2935 pragma Inline
(Set_Uint12
);
2937 procedure Set_Uint13
(N
: Node_Id
; Val
: Uint
);
2938 pragma Inline
(Set_Uint13
);
2940 procedure Set_Uint14
(N
: Node_Id
; Val
: Uint
);
2941 pragma Inline
(Set_Uint14
);
2943 procedure Set_Uint15
(N
: Node_Id
; Val
: Uint
);
2944 pragma Inline
(Set_Uint15
);
2946 procedure Set_Uint16
(N
: Node_Id
; Val
: Uint
);
2947 pragma Inline
(Set_Uint16
);
2949 procedure Set_Uint17
(N
: Node_Id
; Val
: Uint
);
2950 pragma Inline
(Set_Uint17
);
2952 procedure Set_Uint22
(N
: Node_Id
; Val
: Uint
);
2953 pragma Inline
(Set_Uint22
);
2955 procedure Set_Uint24
(N
: Node_Id
; Val
: Uint
);
2956 pragma Inline
(Set_Uint24
);
2958 procedure Set_Ureal3
(N
: Node_Id
; Val
: Ureal
);
2959 pragma Inline
(Set_Ureal3
);
2961 procedure Set_Ureal18
(N
: Node_Id
; Val
: Ureal
);
2962 pragma Inline
(Set_Ureal18
);
2964 procedure Set_Ureal21
(N
: Node_Id
; Val
: Ureal
);
2965 pragma Inline
(Set_Ureal21
);
2967 procedure Set_Flag0
(N
: Node_Id
; Val
: Boolean);
2968 pragma Inline
(Set_Flag0
);
2970 procedure Set_Flag1
(N
: Node_Id
; Val
: Boolean);
2971 pragma Inline
(Set_Flag1
);
2973 procedure Set_Flag2
(N
: Node_Id
; Val
: Boolean);
2974 pragma Inline
(Set_Flag2
);
2976 procedure Set_Flag3
(N
: Node_Id
; Val
: Boolean);
2977 pragma Inline
(Set_Flag3
);
2979 procedure Set_Flag4
(N
: Node_Id
; Val
: Boolean);
2980 pragma Inline
(Set_Flag4
);
2982 procedure Set_Flag5
(N
: Node_Id
; Val
: Boolean);
2983 pragma Inline
(Set_Flag5
);
2985 procedure Set_Flag6
(N
: Node_Id
; Val
: Boolean);
2986 pragma Inline
(Set_Flag6
);
2988 procedure Set_Flag7
(N
: Node_Id
; Val
: Boolean);
2989 pragma Inline
(Set_Flag7
);
2991 procedure Set_Flag8
(N
: Node_Id
; Val
: Boolean);
2992 pragma Inline
(Set_Flag8
);
2994 procedure Set_Flag9
(N
: Node_Id
; Val
: Boolean);
2995 pragma Inline
(Set_Flag9
);
2997 procedure Set_Flag10
(N
: Node_Id
; Val
: Boolean);
2998 pragma Inline
(Set_Flag10
);
3000 procedure Set_Flag11
(N
: Node_Id
; Val
: Boolean);
3001 pragma Inline
(Set_Flag11
);
3003 procedure Set_Flag12
(N
: Node_Id
; Val
: Boolean);
3004 pragma Inline
(Set_Flag12
);
3006 procedure Set_Flag13
(N
: Node_Id
; Val
: Boolean);
3007 pragma Inline
(Set_Flag13
);
3009 procedure Set_Flag14
(N
: Node_Id
; Val
: Boolean);
3010 pragma Inline
(Set_Flag14
);
3012 procedure Set_Flag15
(N
: Node_Id
; Val
: Boolean);
3013 pragma Inline
(Set_Flag15
);
3015 procedure Set_Flag16
(N
: Node_Id
; Val
: Boolean);
3016 pragma Inline
(Set_Flag16
);
3018 procedure Set_Flag17
(N
: Node_Id
; Val
: Boolean);
3019 pragma Inline
(Set_Flag17
);
3021 procedure Set_Flag18
(N
: Node_Id
; Val
: Boolean);
3022 pragma Inline
(Set_Flag18
);
3024 procedure Set_Flag19
(N
: Node_Id
; Val
: Boolean);
3025 pragma Inline
(Set_Flag19
);
3027 procedure Set_Flag20
(N
: Node_Id
; Val
: Boolean);
3028 pragma Inline
(Set_Flag20
);
3030 procedure Set_Flag21
(N
: Node_Id
; Val
: Boolean);
3031 pragma Inline
(Set_Flag21
);
3033 procedure Set_Flag22
(N
: Node_Id
; Val
: Boolean);
3034 pragma Inline
(Set_Flag22
);
3036 procedure Set_Flag23
(N
: Node_Id
; Val
: Boolean);
3037 pragma Inline
(Set_Flag23
);
3039 procedure Set_Flag24
(N
: Node_Id
; Val
: Boolean);
3040 pragma Inline
(Set_Flag24
);
3042 procedure Set_Flag25
(N
: Node_Id
; Val
: Boolean);
3043 pragma Inline
(Set_Flag25
);
3045 procedure Set_Flag26
(N
: Node_Id
; Val
: Boolean);
3046 pragma Inline
(Set_Flag26
);
3048 procedure Set_Flag27
(N
: Node_Id
; Val
: Boolean);
3049 pragma Inline
(Set_Flag27
);
3051 procedure Set_Flag28
(N
: Node_Id
; Val
: Boolean);
3052 pragma Inline
(Set_Flag28
);
3054 procedure Set_Flag29
(N
: Node_Id
; Val
: Boolean);
3055 pragma Inline
(Set_Flag29
);
3057 procedure Set_Flag30
(N
: Node_Id
; Val
: Boolean);
3058 pragma Inline
(Set_Flag30
);
3060 procedure Set_Flag31
(N
: Node_Id
; Val
: Boolean);
3061 pragma Inline
(Set_Flag31
);
3063 procedure Set_Flag32
(N
: Node_Id
; Val
: Boolean);
3064 pragma Inline
(Set_Flag32
);
3066 procedure Set_Flag33
(N
: Node_Id
; Val
: Boolean);
3067 pragma Inline
(Set_Flag33
);
3069 procedure Set_Flag34
(N
: Node_Id
; Val
: Boolean);
3070 pragma Inline
(Set_Flag34
);
3072 procedure Set_Flag35
(N
: Node_Id
; Val
: Boolean);
3073 pragma Inline
(Set_Flag35
);
3075 procedure Set_Flag36
(N
: Node_Id
; Val
: Boolean);
3076 pragma Inline
(Set_Flag36
);
3078 procedure Set_Flag37
(N
: Node_Id
; Val
: Boolean);
3079 pragma Inline
(Set_Flag37
);
3081 procedure Set_Flag38
(N
: Node_Id
; Val
: Boolean);
3082 pragma Inline
(Set_Flag38
);
3084 procedure Set_Flag39
(N
: Node_Id
; Val
: Boolean);
3085 pragma Inline
(Set_Flag39
);
3087 procedure Set_Flag40
(N
: Node_Id
; Val
: Boolean);
3088 pragma Inline
(Set_Flag40
);
3090 procedure Set_Flag41
(N
: Node_Id
; Val
: Boolean);
3091 pragma Inline
(Set_Flag41
);
3093 procedure Set_Flag42
(N
: Node_Id
; Val
: Boolean);
3094 pragma Inline
(Set_Flag42
);
3096 procedure Set_Flag43
(N
: Node_Id
; Val
: Boolean);
3097 pragma Inline
(Set_Flag43
);
3099 procedure Set_Flag44
(N
: Node_Id
; Val
: Boolean);
3100 pragma Inline
(Set_Flag44
);
3102 procedure Set_Flag45
(N
: Node_Id
; Val
: Boolean);
3103 pragma Inline
(Set_Flag45
);
3105 procedure Set_Flag46
(N
: Node_Id
; Val
: Boolean);
3106 pragma Inline
(Set_Flag46
);
3108 procedure Set_Flag47
(N
: Node_Id
; Val
: Boolean);
3109 pragma Inline
(Set_Flag47
);
3111 procedure Set_Flag48
(N
: Node_Id
; Val
: Boolean);
3112 pragma Inline
(Set_Flag48
);
3114 procedure Set_Flag49
(N
: Node_Id
; Val
: Boolean);
3115 pragma Inline
(Set_Flag49
);
3117 procedure Set_Flag50
(N
: Node_Id
; Val
: Boolean);
3118 pragma Inline
(Set_Flag50
);
3120 procedure Set_Flag51
(N
: Node_Id
; Val
: Boolean);
3121 pragma Inline
(Set_Flag51
);
3123 procedure Set_Flag52
(N
: Node_Id
; Val
: Boolean);
3124 pragma Inline
(Set_Flag52
);
3126 procedure Set_Flag53
(N
: Node_Id
; Val
: Boolean);
3127 pragma Inline
(Set_Flag53
);
3129 procedure Set_Flag54
(N
: Node_Id
; Val
: Boolean);
3130 pragma Inline
(Set_Flag54
);
3132 procedure Set_Flag55
(N
: Node_Id
; Val
: Boolean);
3133 pragma Inline
(Set_Flag55
);
3135 procedure Set_Flag56
(N
: Node_Id
; Val
: Boolean);
3136 pragma Inline
(Set_Flag56
);
3138 procedure Set_Flag57
(N
: Node_Id
; Val
: Boolean);
3139 pragma Inline
(Set_Flag57
);
3141 procedure Set_Flag58
(N
: Node_Id
; Val
: Boolean);
3142 pragma Inline
(Set_Flag58
);
3144 procedure Set_Flag59
(N
: Node_Id
; Val
: Boolean);
3145 pragma Inline
(Set_Flag59
);
3147 procedure Set_Flag60
(N
: Node_Id
; Val
: Boolean);
3148 pragma Inline
(Set_Flag60
);
3150 procedure Set_Flag61
(N
: Node_Id
; Val
: Boolean);
3151 pragma Inline
(Set_Flag61
);
3153 procedure Set_Flag62
(N
: Node_Id
; Val
: Boolean);
3154 pragma Inline
(Set_Flag62
);
3156 procedure Set_Flag63
(N
: Node_Id
; Val
: Boolean);
3157 pragma Inline
(Set_Flag63
);
3159 procedure Set_Flag64
(N
: Node_Id
; Val
: Boolean);
3160 pragma Inline
(Set_Flag64
);
3162 procedure Set_Flag65
(N
: Node_Id
; Val
: Boolean);
3163 pragma Inline
(Set_Flag65
);
3165 procedure Set_Flag66
(N
: Node_Id
; Val
: Boolean);
3166 pragma Inline
(Set_Flag66
);
3168 procedure Set_Flag67
(N
: Node_Id
; Val
: Boolean);
3169 pragma Inline
(Set_Flag67
);
3171 procedure Set_Flag68
(N
: Node_Id
; Val
: Boolean);
3172 pragma Inline
(Set_Flag68
);
3174 procedure Set_Flag69
(N
: Node_Id
; Val
: Boolean);
3175 pragma Inline
(Set_Flag69
);
3177 procedure Set_Flag70
(N
: Node_Id
; Val
: Boolean);
3178 pragma Inline
(Set_Flag70
);
3180 procedure Set_Flag71
(N
: Node_Id
; Val
: Boolean);
3181 pragma Inline
(Set_Flag71
);
3183 procedure Set_Flag72
(N
: Node_Id
; Val
: Boolean);
3184 pragma Inline
(Set_Flag72
);
3186 procedure Set_Flag73
(N
: Node_Id
; Val
: Boolean);
3187 pragma Inline
(Set_Flag73
);
3189 procedure Set_Flag74
(N
: Node_Id
; Val
: Boolean);
3190 pragma Inline
(Set_Flag74
);
3192 procedure Set_Flag75
(N
: Node_Id
; Val
: Boolean);
3193 pragma Inline
(Set_Flag75
);
3195 procedure Set_Flag76
(N
: Node_Id
; Val
: Boolean);
3196 pragma Inline
(Set_Flag76
);
3198 procedure Set_Flag77
(N
: Node_Id
; Val
: Boolean);
3199 pragma Inline
(Set_Flag77
);
3201 procedure Set_Flag78
(N
: Node_Id
; Val
: Boolean);
3202 pragma Inline
(Set_Flag78
);
3204 procedure Set_Flag79
(N
: Node_Id
; Val
: Boolean);
3205 pragma Inline
(Set_Flag79
);
3207 procedure Set_Flag80
(N
: Node_Id
; Val
: Boolean);
3208 pragma Inline
(Set_Flag80
);
3210 procedure Set_Flag81
(N
: Node_Id
; Val
: Boolean);
3211 pragma Inline
(Set_Flag81
);
3213 procedure Set_Flag82
(N
: Node_Id
; Val
: Boolean);
3214 pragma Inline
(Set_Flag82
);
3216 procedure Set_Flag83
(N
: Node_Id
; Val
: Boolean);
3217 pragma Inline
(Set_Flag83
);
3219 procedure Set_Flag84
(N
: Node_Id
; Val
: Boolean);
3220 pragma Inline
(Set_Flag84
);
3222 procedure Set_Flag85
(N
: Node_Id
; Val
: Boolean);
3223 pragma Inline
(Set_Flag85
);
3225 procedure Set_Flag86
(N
: Node_Id
; Val
: Boolean);
3226 pragma Inline
(Set_Flag86
);
3228 procedure Set_Flag87
(N
: Node_Id
; Val
: Boolean);
3229 pragma Inline
(Set_Flag87
);
3231 procedure Set_Flag88
(N
: Node_Id
; Val
: Boolean);
3232 pragma Inline
(Set_Flag88
);
3234 procedure Set_Flag89
(N
: Node_Id
; Val
: Boolean);
3235 pragma Inline
(Set_Flag89
);
3237 procedure Set_Flag90
(N
: Node_Id
; Val
: Boolean);
3238 pragma Inline
(Set_Flag90
);
3240 procedure Set_Flag91
(N
: Node_Id
; Val
: Boolean);
3241 pragma Inline
(Set_Flag91
);
3243 procedure Set_Flag92
(N
: Node_Id
; Val
: Boolean);
3244 pragma Inline
(Set_Flag92
);
3246 procedure Set_Flag93
(N
: Node_Id
; Val
: Boolean);
3247 pragma Inline
(Set_Flag93
);
3249 procedure Set_Flag94
(N
: Node_Id
; Val
: Boolean);
3250 pragma Inline
(Set_Flag94
);
3252 procedure Set_Flag95
(N
: Node_Id
; Val
: Boolean);
3253 pragma Inline
(Set_Flag95
);
3255 procedure Set_Flag96
(N
: Node_Id
; Val
: Boolean);
3256 pragma Inline
(Set_Flag96
);
3258 procedure Set_Flag97
(N
: Node_Id
; Val
: Boolean);
3259 pragma Inline
(Set_Flag97
);
3261 procedure Set_Flag98
(N
: Node_Id
; Val
: Boolean);
3262 pragma Inline
(Set_Flag98
);
3264 procedure Set_Flag99
(N
: Node_Id
; Val
: Boolean);
3265 pragma Inline
(Set_Flag99
);
3267 procedure Set_Flag100
(N
: Node_Id
; Val
: Boolean);
3268 pragma Inline
(Set_Flag100
);
3270 procedure Set_Flag101
(N
: Node_Id
; Val
: Boolean);
3271 pragma Inline
(Set_Flag101
);
3273 procedure Set_Flag102
(N
: Node_Id
; Val
: Boolean);
3274 pragma Inline
(Set_Flag102
);
3276 procedure Set_Flag103
(N
: Node_Id
; Val
: Boolean);
3277 pragma Inline
(Set_Flag103
);
3279 procedure Set_Flag104
(N
: Node_Id
; Val
: Boolean);
3280 pragma Inline
(Set_Flag104
);
3282 procedure Set_Flag105
(N
: Node_Id
; Val
: Boolean);
3283 pragma Inline
(Set_Flag105
);
3285 procedure Set_Flag106
(N
: Node_Id
; Val
: Boolean);
3286 pragma Inline
(Set_Flag106
);
3288 procedure Set_Flag107
(N
: Node_Id
; Val
: Boolean);
3289 pragma Inline
(Set_Flag107
);
3291 procedure Set_Flag108
(N
: Node_Id
; Val
: Boolean);
3292 pragma Inline
(Set_Flag108
);
3294 procedure Set_Flag109
(N
: Node_Id
; Val
: Boolean);
3295 pragma Inline
(Set_Flag109
);
3297 procedure Set_Flag110
(N
: Node_Id
; Val
: Boolean);
3298 pragma Inline
(Set_Flag110
);
3300 procedure Set_Flag111
(N
: Node_Id
; Val
: Boolean);
3301 pragma Inline
(Set_Flag111
);
3303 procedure Set_Flag112
(N
: Node_Id
; Val
: Boolean);
3304 pragma Inline
(Set_Flag112
);
3306 procedure Set_Flag113
(N
: Node_Id
; Val
: Boolean);
3307 pragma Inline
(Set_Flag113
);
3309 procedure Set_Flag114
(N
: Node_Id
; Val
: Boolean);
3310 pragma Inline
(Set_Flag114
);
3312 procedure Set_Flag115
(N
: Node_Id
; Val
: Boolean);
3313 pragma Inline
(Set_Flag115
);
3315 procedure Set_Flag116
(N
: Node_Id
; Val
: Boolean);
3316 pragma Inline
(Set_Flag116
);
3318 procedure Set_Flag117
(N
: Node_Id
; Val
: Boolean);
3319 pragma Inline
(Set_Flag117
);
3321 procedure Set_Flag118
(N
: Node_Id
; Val
: Boolean);
3322 pragma Inline
(Set_Flag118
);
3324 procedure Set_Flag119
(N
: Node_Id
; Val
: Boolean);
3325 pragma Inline
(Set_Flag119
);
3327 procedure Set_Flag120
(N
: Node_Id
; Val
: Boolean);
3328 pragma Inline
(Set_Flag120
);
3330 procedure Set_Flag121
(N
: Node_Id
; Val
: Boolean);
3331 pragma Inline
(Set_Flag121
);
3333 procedure Set_Flag122
(N
: Node_Id
; Val
: Boolean);
3334 pragma Inline
(Set_Flag122
);
3336 procedure Set_Flag123
(N
: Node_Id
; Val
: Boolean);
3337 pragma Inline
(Set_Flag123
);
3339 procedure Set_Flag124
(N
: Node_Id
; Val
: Boolean);
3340 pragma Inline
(Set_Flag124
);
3342 procedure Set_Flag125
(N
: Node_Id
; Val
: Boolean);
3343 pragma Inline
(Set_Flag125
);
3345 procedure Set_Flag126
(N
: Node_Id
; Val
: Boolean);
3346 pragma Inline
(Set_Flag126
);
3348 procedure Set_Flag127
(N
: Node_Id
; Val
: Boolean);
3349 pragma Inline
(Set_Flag127
);
3351 procedure Set_Flag128
(N
: Node_Id
; Val
: Boolean);
3352 pragma Inline
(Set_Flag128
);
3354 procedure Set_Flag129
(N
: Node_Id
; Val
: Boolean);
3355 pragma Inline
(Set_Flag129
);
3357 procedure Set_Flag130
(N
: Node_Id
; Val
: Boolean);
3358 pragma Inline
(Set_Flag130
);
3360 procedure Set_Flag131
(N
: Node_Id
; Val
: Boolean);
3361 pragma Inline
(Set_Flag131
);
3363 procedure Set_Flag132
(N
: Node_Id
; Val
: Boolean);
3364 pragma Inline
(Set_Flag132
);
3366 procedure Set_Flag133
(N
: Node_Id
; Val
: Boolean);
3367 pragma Inline
(Set_Flag133
);
3369 procedure Set_Flag134
(N
: Node_Id
; Val
: Boolean);
3370 pragma Inline
(Set_Flag134
);
3372 procedure Set_Flag135
(N
: Node_Id
; Val
: Boolean);
3373 pragma Inline
(Set_Flag135
);
3375 procedure Set_Flag136
(N
: Node_Id
; Val
: Boolean);
3376 pragma Inline
(Set_Flag136
);
3378 procedure Set_Flag137
(N
: Node_Id
; Val
: Boolean);
3379 pragma Inline
(Set_Flag137
);
3381 procedure Set_Flag138
(N
: Node_Id
; Val
: Boolean);
3382 pragma Inline
(Set_Flag138
);
3384 procedure Set_Flag139
(N
: Node_Id
; Val
: Boolean);
3385 pragma Inline
(Set_Flag139
);
3387 procedure Set_Flag140
(N
: Node_Id
; Val
: Boolean);
3388 pragma Inline
(Set_Flag140
);
3390 procedure Set_Flag141
(N
: Node_Id
; Val
: Boolean);
3391 pragma Inline
(Set_Flag141
);
3393 procedure Set_Flag142
(N
: Node_Id
; Val
: Boolean);
3394 pragma Inline
(Set_Flag142
);
3396 procedure Set_Flag143
(N
: Node_Id
; Val
: Boolean);
3397 pragma Inline
(Set_Flag143
);
3399 procedure Set_Flag144
(N
: Node_Id
; Val
: Boolean);
3400 pragma Inline
(Set_Flag144
);
3402 procedure Set_Flag145
(N
: Node_Id
; Val
: Boolean);
3403 pragma Inline
(Set_Flag145
);
3405 procedure Set_Flag146
(N
: Node_Id
; Val
: Boolean);
3406 pragma Inline
(Set_Flag146
);
3408 procedure Set_Flag147
(N
: Node_Id
; Val
: Boolean);
3409 pragma Inline
(Set_Flag147
);
3411 procedure Set_Flag148
(N
: Node_Id
; Val
: Boolean);
3412 pragma Inline
(Set_Flag148
);
3414 procedure Set_Flag149
(N
: Node_Id
; Val
: Boolean);
3415 pragma Inline
(Set_Flag149
);
3417 procedure Set_Flag150
(N
: Node_Id
; Val
: Boolean);
3418 pragma Inline
(Set_Flag150
);
3420 procedure Set_Flag151
(N
: Node_Id
; Val
: Boolean);
3421 pragma Inline
(Set_Flag151
);
3423 procedure Set_Flag152
(N
: Node_Id
; Val
: Boolean);
3424 pragma Inline
(Set_Flag152
);
3426 procedure Set_Flag153
(N
: Node_Id
; Val
: Boolean);
3427 pragma Inline
(Set_Flag153
);
3429 procedure Set_Flag154
(N
: Node_Id
; Val
: Boolean);
3430 pragma Inline
(Set_Flag154
);
3432 procedure Set_Flag155
(N
: Node_Id
; Val
: Boolean);
3433 pragma Inline
(Set_Flag155
);
3435 procedure Set_Flag156
(N
: Node_Id
; Val
: Boolean);
3436 pragma Inline
(Set_Flag156
);
3438 procedure Set_Flag157
(N
: Node_Id
; Val
: Boolean);
3439 pragma Inline
(Set_Flag157
);
3441 procedure Set_Flag158
(N
: Node_Id
; Val
: Boolean);
3442 pragma Inline
(Set_Flag158
);
3444 procedure Set_Flag159
(N
: Node_Id
; Val
: Boolean);
3445 pragma Inline
(Set_Flag159
);
3447 procedure Set_Flag160
(N
: Node_Id
; Val
: Boolean);
3448 pragma Inline
(Set_Flag160
);
3450 procedure Set_Flag161
(N
: Node_Id
; Val
: Boolean);
3451 pragma Inline
(Set_Flag161
);
3453 procedure Set_Flag162
(N
: Node_Id
; Val
: Boolean);
3454 pragma Inline
(Set_Flag162
);
3456 procedure Set_Flag163
(N
: Node_Id
; Val
: Boolean);
3457 pragma Inline
(Set_Flag163
);
3459 procedure Set_Flag164
(N
: Node_Id
; Val
: Boolean);
3460 pragma Inline
(Set_Flag164
);
3462 procedure Set_Flag165
(N
: Node_Id
; Val
: Boolean);
3463 pragma Inline
(Set_Flag165
);
3465 procedure Set_Flag166
(N
: Node_Id
; Val
: Boolean);
3466 pragma Inline
(Set_Flag166
);
3468 procedure Set_Flag167
(N
: Node_Id
; Val
: Boolean);
3469 pragma Inline
(Set_Flag167
);
3471 procedure Set_Flag168
(N
: Node_Id
; Val
: Boolean);
3472 pragma Inline
(Set_Flag168
);
3474 procedure Set_Flag169
(N
: Node_Id
; Val
: Boolean);
3475 pragma Inline
(Set_Flag169
);
3477 procedure Set_Flag170
(N
: Node_Id
; Val
: Boolean);
3478 pragma Inline
(Set_Flag170
);
3480 procedure Set_Flag171
(N
: Node_Id
; Val
: Boolean);
3481 pragma Inline
(Set_Flag171
);
3483 procedure Set_Flag172
(N
: Node_Id
; Val
: Boolean);
3484 pragma Inline
(Set_Flag172
);
3486 procedure Set_Flag173
(N
: Node_Id
; Val
: Boolean);
3487 pragma Inline
(Set_Flag173
);
3489 procedure Set_Flag174
(N
: Node_Id
; Val
: Boolean);
3490 pragma Inline
(Set_Flag174
);
3492 procedure Set_Flag175
(N
: Node_Id
; Val
: Boolean);
3493 pragma Inline
(Set_Flag175
);
3495 procedure Set_Flag176
(N
: Node_Id
; Val
: Boolean);
3496 pragma Inline
(Set_Flag176
);
3498 procedure Set_Flag177
(N
: Node_Id
; Val
: Boolean);
3499 pragma Inline
(Set_Flag177
);
3501 procedure Set_Flag178
(N
: Node_Id
; Val
: Boolean);
3502 pragma Inline
(Set_Flag178
);
3504 procedure Set_Flag179
(N
: Node_Id
; Val
: Boolean);
3505 pragma Inline
(Set_Flag179
);
3507 procedure Set_Flag180
(N
: Node_Id
; Val
: Boolean);
3508 pragma Inline
(Set_Flag180
);
3510 procedure Set_Flag181
(N
: Node_Id
; Val
: Boolean);
3511 pragma Inline
(Set_Flag181
);
3513 procedure Set_Flag182
(N
: Node_Id
; Val
: Boolean);
3514 pragma Inline
(Set_Flag182
);
3516 procedure Set_Flag183
(N
: Node_Id
; Val
: Boolean);
3517 pragma Inline
(Set_Flag183
);
3519 procedure Set_Flag184
(N
: Node_Id
; Val
: Boolean);
3520 pragma Inline
(Set_Flag184
);
3522 procedure Set_Flag185
(N
: Node_Id
; Val
: Boolean);
3523 pragma Inline
(Set_Flag185
);
3525 procedure Set_Flag186
(N
: Node_Id
; Val
: Boolean);
3526 pragma Inline
(Set_Flag186
);
3528 procedure Set_Flag187
(N
: Node_Id
; Val
: Boolean);
3529 pragma Inline
(Set_Flag187
);
3531 procedure Set_Flag188
(N
: Node_Id
; Val
: Boolean);
3532 pragma Inline
(Set_Flag188
);
3534 procedure Set_Flag189
(N
: Node_Id
; Val
: Boolean);
3535 pragma Inline
(Set_Flag189
);
3537 procedure Set_Flag190
(N
: Node_Id
; Val
: Boolean);
3538 pragma Inline
(Set_Flag190
);
3540 procedure Set_Flag191
(N
: Node_Id
; Val
: Boolean);
3541 pragma Inline
(Set_Flag191
);
3543 procedure Set_Flag192
(N
: Node_Id
; Val
: Boolean);
3544 pragma Inline
(Set_Flag192
);
3546 procedure Set_Flag193
(N
: Node_Id
; Val
: Boolean);
3547 pragma Inline
(Set_Flag193
);
3549 procedure Set_Flag194
(N
: Node_Id
; Val
: Boolean);
3550 pragma Inline
(Set_Flag194
);
3552 procedure Set_Flag195
(N
: Node_Id
; Val
: Boolean);
3553 pragma Inline
(Set_Flag195
);
3555 procedure Set_Flag196
(N
: Node_Id
; Val
: Boolean);
3556 pragma Inline
(Set_Flag196
);
3558 procedure Set_Flag197
(N
: Node_Id
; Val
: Boolean);
3559 pragma Inline
(Set_Flag197
);
3561 procedure Set_Flag198
(N
: Node_Id
; Val
: Boolean);
3562 pragma Inline
(Set_Flag198
);
3564 procedure Set_Flag199
(N
: Node_Id
; Val
: Boolean);
3565 pragma Inline
(Set_Flag199
);
3567 procedure Set_Flag200
(N
: Node_Id
; Val
: Boolean);
3568 pragma Inline
(Set_Flag200
);
3570 procedure Set_Flag201
(N
: Node_Id
; Val
: Boolean);
3571 pragma Inline
(Set_Flag201
);
3573 procedure Set_Flag202
(N
: Node_Id
; Val
: Boolean);
3574 pragma Inline
(Set_Flag202
);
3576 procedure Set_Flag203
(N
: Node_Id
; Val
: Boolean);
3577 pragma Inline
(Set_Flag203
);
3579 procedure Set_Flag204
(N
: Node_Id
; Val
: Boolean);
3580 pragma Inline
(Set_Flag204
);
3582 procedure Set_Flag205
(N
: Node_Id
; Val
: Boolean);
3583 pragma Inline
(Set_Flag205
);
3585 procedure Set_Flag206
(N
: Node_Id
; Val
: Boolean);
3586 pragma Inline
(Set_Flag206
);
3588 procedure Set_Flag207
(N
: Node_Id
; Val
: Boolean);
3589 pragma Inline
(Set_Flag207
);
3591 procedure Set_Flag208
(N
: Node_Id
; Val
: Boolean);
3592 pragma Inline
(Set_Flag208
);
3594 procedure Set_Flag209
(N
: Node_Id
; Val
: Boolean);
3595 pragma Inline
(Set_Flag209
);
3597 procedure Set_Flag210
(N
: Node_Id
; Val
: Boolean);
3598 pragma Inline
(Set_Flag210
);
3600 procedure Set_Flag211
(N
: Node_Id
; Val
: Boolean);
3601 pragma Inline
(Set_Flag211
);
3603 procedure Set_Flag212
(N
: Node_Id
; Val
: Boolean);
3604 pragma Inline
(Set_Flag212
);
3606 procedure Set_Flag213
(N
: Node_Id
; Val
: Boolean);
3607 pragma Inline
(Set_Flag213
);
3609 procedure Set_Flag214
(N
: Node_Id
; Val
: Boolean);
3610 pragma Inline
(Set_Flag214
);
3612 procedure Set_Flag215
(N
: Node_Id
; Val
: Boolean);
3613 pragma Inline
(Set_Flag215
);
3615 procedure Set_Flag216
(N
: Node_Id
; Val
: Boolean);
3616 pragma Inline
(Set_Flag216
);
3618 procedure Set_Flag217
(N
: Node_Id
; Val
: Boolean);
3619 pragma Inline
(Set_Flag217
);
3621 procedure Set_Flag218
(N
: Node_Id
; Val
: Boolean);
3622 pragma Inline
(Set_Flag218
);
3624 procedure Set_Flag219
(N
: Node_Id
; Val
: Boolean);
3625 pragma Inline
(Set_Flag219
);
3627 procedure Set_Flag220
(N
: Node_Id
; Val
: Boolean);
3628 pragma Inline
(Set_Flag220
);
3630 procedure Set_Flag221
(N
: Node_Id
; Val
: Boolean);
3631 pragma Inline
(Set_Flag221
);
3633 procedure Set_Flag222
(N
: Node_Id
; Val
: Boolean);
3634 pragma Inline
(Set_Flag222
);
3636 procedure Set_Flag223
(N
: Node_Id
; Val
: Boolean);
3637 pragma Inline
(Set_Flag223
);
3639 procedure Set_Flag224
(N
: Node_Id
; Val
: Boolean);
3640 pragma Inline
(Set_Flag224
);
3642 procedure Set_Flag225
(N
: Node_Id
; Val
: Boolean);
3643 pragma Inline
(Set_Flag225
);
3645 procedure Set_Flag226
(N
: Node_Id
; Val
: Boolean);
3646 pragma Inline
(Set_Flag226
);
3648 procedure Set_Flag227
(N
: Node_Id
; Val
: Boolean);
3649 pragma Inline
(Set_Flag227
);
3651 procedure Set_Flag228
(N
: Node_Id
; Val
: Boolean);
3652 pragma Inline
(Set_Flag228
);
3654 procedure Set_Flag229
(N
: Node_Id
; Val
: Boolean);
3655 pragma Inline
(Set_Flag229
);
3657 procedure Set_Flag230
(N
: Node_Id
; Val
: Boolean);
3658 pragma Inline
(Set_Flag230
);
3660 procedure Set_Flag231
(N
: Node_Id
; Val
: Boolean);
3661 pragma Inline
(Set_Flag231
);
3663 procedure Set_Flag232
(N
: Node_Id
; Val
: Boolean);
3664 pragma Inline
(Set_Flag232
);
3666 procedure Set_Flag233
(N
: Node_Id
; Val
: Boolean);
3667 pragma Inline
(Set_Flag233
);
3669 procedure Set_Flag234
(N
: Node_Id
; Val
: Boolean);
3670 pragma Inline
(Set_Flag234
);
3672 procedure Set_Flag235
(N
: Node_Id
; Val
: Boolean);
3673 pragma Inline
(Set_Flag235
);
3675 procedure Set_Flag236
(N
: Node_Id
; Val
: Boolean);
3676 pragma Inline
(Set_Flag236
);
3678 procedure Set_Flag237
(N
: Node_Id
; Val
: Boolean);
3679 pragma Inline
(Set_Flag237
);
3681 procedure Set_Flag238
(N
: Node_Id
; Val
: Boolean);
3682 pragma Inline
(Set_Flag238
);
3684 procedure Set_Flag239
(N
: Node_Id
; Val
: Boolean);
3685 pragma Inline
(Set_Flag239
);
3687 procedure Set_Flag240
(N
: Node_Id
; Val
: Boolean);
3688 pragma Inline
(Set_Flag240
);
3690 procedure Set_Flag241
(N
: Node_Id
; Val
: Boolean);
3691 pragma Inline
(Set_Flag241
);
3693 procedure Set_Flag242
(N
: Node_Id
; Val
: Boolean);
3694 pragma Inline
(Set_Flag242
);
3696 procedure Set_Flag243
(N
: Node_Id
; Val
: Boolean);
3697 pragma Inline
(Set_Flag243
);
3699 procedure Set_Flag244
(N
: Node_Id
; Val
: Boolean);
3700 pragma Inline
(Set_Flag244
);
3702 procedure Set_Flag245
(N
: Node_Id
; Val
: Boolean);
3703 pragma Inline
(Set_Flag245
);
3705 procedure Set_Flag246
(N
: Node_Id
; Val
: Boolean);
3706 pragma Inline
(Set_Flag246
);
3708 procedure Set_Flag247
(N
: Node_Id
; Val
: Boolean);
3709 pragma Inline
(Set_Flag247
);
3711 procedure Set_Flag248
(N
: Node_Id
; Val
: Boolean);
3712 pragma Inline
(Set_Flag248
);
3714 procedure Set_Flag249
(N
: Node_Id
; Val
: Boolean);
3715 pragma Inline
(Set_Flag249
);
3717 procedure Set_Flag250
(N
: Node_Id
; Val
: Boolean);
3718 pragma Inline
(Set_Flag250
);
3720 procedure Set_Flag251
(N
: Node_Id
; Val
: Boolean);
3721 pragma Inline
(Set_Flag251
);
3723 procedure Set_Flag252
(N
: Node_Id
; Val
: Boolean);
3724 pragma Inline
(Set_Flag252
);
3726 procedure Set_Flag253
(N
: Node_Id
; Val
: Boolean);
3727 pragma Inline
(Set_Flag253
);
3729 procedure Set_Flag254
(N
: Node_Id
; Val
: Boolean);
3730 pragma Inline
(Set_Flag254
);
3732 procedure Set_Flag255
(N
: Node_Id
; Val
: Boolean);
3733 pragma Inline
(Set_Flag255
);
3735 procedure Set_Flag256
(N
: Node_Id
; Val
: Boolean);
3736 pragma Inline
(Set_Flag256
);
3738 procedure Set_Flag257
(N
: Node_Id
; Val
: Boolean);
3739 pragma Inline
(Set_Flag257
);
3741 procedure Set_Flag258
(N
: Node_Id
; Val
: Boolean);
3742 pragma Inline
(Set_Flag258
);
3744 procedure Set_Flag259
(N
: Node_Id
; Val
: Boolean);
3745 pragma Inline
(Set_Flag259
);
3747 procedure Set_Flag260
(N
: Node_Id
; Val
: Boolean);
3748 pragma Inline
(Set_Flag260
);
3750 procedure Set_Flag261
(N
: Node_Id
; Val
: Boolean);
3751 pragma Inline
(Set_Flag261
);
3753 procedure Set_Flag262
(N
: Node_Id
; Val
: Boolean);
3754 pragma Inline
(Set_Flag262
);
3756 procedure Set_Flag263
(N
: Node_Id
; Val
: Boolean);
3757 pragma Inline
(Set_Flag263
);
3759 procedure Set_Flag264
(N
: Node_Id
; Val
: Boolean);
3760 pragma Inline
(Set_Flag264
);
3762 procedure Set_Flag265
(N
: Node_Id
; Val
: Boolean);
3763 pragma Inline
(Set_Flag265
);
3765 procedure Set_Flag266
(N
: Node_Id
; Val
: Boolean);
3766 pragma Inline
(Set_Flag266
);
3768 procedure Set_Flag267
(N
: Node_Id
; Val
: Boolean);
3769 pragma Inline
(Set_Flag267
);
3771 procedure Set_Flag268
(N
: Node_Id
; Val
: Boolean);
3772 pragma Inline
(Set_Flag268
);
3774 procedure Set_Flag269
(N
: Node_Id
; Val
: Boolean);
3775 pragma Inline
(Set_Flag269
);
3777 procedure Set_Flag270
(N
: Node_Id
; Val
: Boolean);
3778 pragma Inline
(Set_Flag270
);
3780 procedure Set_Flag271
(N
: Node_Id
; Val
: Boolean);
3781 pragma Inline
(Set_Flag271
);
3783 procedure Set_Flag272
(N
: Node_Id
; Val
: Boolean);
3784 pragma Inline
(Set_Flag272
);
3786 procedure Set_Flag273
(N
: Node_Id
; Val
: Boolean);
3787 pragma Inline
(Set_Flag273
);
3789 procedure Set_Flag274
(N
: Node_Id
; Val
: Boolean);
3790 pragma Inline
(Set_Flag274
);
3792 procedure Set_Flag275
(N
: Node_Id
; Val
: Boolean);
3793 pragma Inline
(Set_Flag275
);
3795 procedure Set_Flag276
(N
: Node_Id
; Val
: Boolean);
3796 pragma Inline
(Set_Flag276
);
3798 procedure Set_Flag277
(N
: Node_Id
; Val
: Boolean);
3799 pragma Inline
(Set_Flag277
);
3801 procedure Set_Flag278
(N
: Node_Id
; Val
: Boolean);
3802 pragma Inline
(Set_Flag278
);
3804 procedure Set_Flag279
(N
: Node_Id
; Val
: Boolean);
3805 pragma Inline
(Set_Flag279
);
3807 procedure Set_Flag280
(N
: Node_Id
; Val
: Boolean);
3808 pragma Inline
(Set_Flag280
);
3810 procedure Set_Flag281
(N
: Node_Id
; Val
: Boolean);
3811 pragma Inline
(Set_Flag281
);
3813 procedure Set_Flag282
(N
: Node_Id
; Val
: Boolean);
3814 pragma Inline
(Set_Flag282
);
3816 procedure Set_Flag283
(N
: Node_Id
; Val
: Boolean);
3817 pragma Inline
(Set_Flag283
);
3819 procedure Set_Flag284
(N
: Node_Id
; Val
: Boolean);
3820 pragma Inline
(Set_Flag284
);
3822 procedure Set_Flag285
(N
: Node_Id
; Val
: Boolean);
3823 pragma Inline
(Set_Flag285
);
3825 procedure Set_Flag286
(N
: Node_Id
; Val
: Boolean);
3826 pragma Inline
(Set_Flag286
);
3828 procedure Set_Flag287
(N
: Node_Id
; Val
: Boolean);
3829 pragma Inline
(Set_Flag287
);
3831 procedure Set_Flag288
(N
: Node_Id
; Val
: Boolean);
3832 pragma Inline
(Set_Flag288
);
3834 procedure Set_Flag289
(N
: Node_Id
; Val
: Boolean);
3835 pragma Inline
(Set_Flag289
);
3837 procedure Set_Flag290
(N
: Node_Id
; Val
: Boolean);
3838 pragma Inline
(Set_Flag290
);
3840 procedure Set_Flag291
(N
: Node_Id
; Val
: Boolean);
3841 pragma Inline
(Set_Flag291
);
3843 procedure Set_Flag292
(N
: Node_Id
; Val
: Boolean);
3844 pragma Inline
(Set_Flag292
);
3846 procedure Set_Flag293
(N
: Node_Id
; Val
: Boolean);
3847 pragma Inline
(Set_Flag293
);
3849 procedure Set_Flag294
(N
: Node_Id
; Val
: Boolean);
3850 pragma Inline
(Set_Flag294
);
3852 procedure Set_Flag295
(N
: Node_Id
; Val
: Boolean);
3853 pragma Inline
(Set_Flag295
);
3855 procedure Set_Flag296
(N
: Node_Id
; Val
: Boolean);
3856 pragma Inline
(Set_Flag296
);
3858 procedure Set_Flag297
(N
: Node_Id
; Val
: Boolean);
3859 pragma Inline
(Set_Flag297
);
3861 procedure Set_Flag298
(N
: Node_Id
; Val
: Boolean);
3862 pragma Inline
(Set_Flag298
);
3864 procedure Set_Flag299
(N
: Node_Id
; Val
: Boolean);
3865 pragma Inline
(Set_Flag299
);
3867 procedure Set_Flag300
(N
: Node_Id
; Val
: Boolean);
3868 pragma Inline
(Set_Flag300
);
3870 procedure Set_Flag301
(N
: Node_Id
; Val
: Boolean);
3871 pragma Inline
(Set_Flag301
);
3873 procedure Set_Flag302
(N
: Node_Id
; Val
: Boolean);
3874 pragma Inline
(Set_Flag302
);
3876 procedure Set_Flag303
(N
: Node_Id
; Val
: Boolean);
3877 pragma Inline
(Set_Flag303
);
3879 procedure Set_Flag304
(N
: Node_Id
; Val
: Boolean);
3880 pragma Inline
(Set_Flag304
);
3882 procedure Set_Flag305
(N
: Node_Id
; Val
: Boolean);
3883 pragma Inline
(Set_Flag305
);
3885 procedure Set_Flag306
(N
: Node_Id
; Val
: Boolean);
3886 pragma Inline
(Set_Flag306
);
3888 procedure Set_Flag307
(N
: Node_Id
; Val
: Boolean);
3889 pragma Inline
(Set_Flag307
);
3891 procedure Set_Flag308
(N
: Node_Id
; Val
: Boolean);
3892 pragma Inline
(Set_Flag308
);
3894 procedure Set_Flag309
(N
: Node_Id
; Val
: Boolean);
3895 pragma Inline
(Set_Flag309
);
3897 procedure Set_Flag310
(N
: Node_Id
; Val
: Boolean);
3898 pragma Inline
(Set_Flag310
);
3900 procedure Set_Flag311
(N
: Node_Id
; Val
: Boolean);
3901 pragma Inline
(Set_Flag311
);
3903 procedure Set_Flag312
(N
: Node_Id
; Val
: Boolean);
3904 pragma Inline
(Set_Flag312
);
3906 procedure Set_Flag313
(N
: Node_Id
; Val
: Boolean);
3907 pragma Inline
(Set_Flag313
);
3909 procedure Set_Flag314
(N
: Node_Id
; Val
: Boolean);
3910 pragma Inline
(Set_Flag314
);
3912 procedure Set_Flag315
(N
: Node_Id
; Val
: Boolean);
3913 pragma Inline
(Set_Flag315
);
3915 procedure Set_Flag316
(N
: Node_Id
; Val
: Boolean);
3916 pragma Inline
(Set_Flag316
);
3918 procedure Set_Flag317
(N
: Node_Id
; Val
: Boolean);
3919 pragma Inline
(Set_Flag317
);
3921 -- The following versions of Set_Noden also set the parent pointer of
3922 -- the referenced node if it is not Empty.
3924 procedure Set_Node1_With_Parent
(N
: Node_Id
; Val
: Node_Id
);
3925 pragma Inline
(Set_Node1_With_Parent
);
3927 procedure Set_Node2_With_Parent
(N
: Node_Id
; Val
: Node_Id
);
3928 pragma Inline
(Set_Node2_With_Parent
);
3930 procedure Set_Node3_With_Parent
(N
: Node_Id
; Val
: Node_Id
);
3931 pragma Inline
(Set_Node3_With_Parent
);
3933 procedure Set_Node4_With_Parent
(N
: Node_Id
; Val
: Node_Id
);
3934 pragma Inline
(Set_Node4_With_Parent
);
3936 procedure Set_Node5_With_Parent
(N
: Node_Id
; Val
: Node_Id
);
3937 pragma Inline
(Set_Node5_With_Parent
);
3939 -- The following versions of Set_Listn also set the parent pointer of
3940 -- the referenced node if it is not Empty.
3942 procedure Set_List1_With_Parent
(N
: Node_Id
; Val
: List_Id
);
3943 pragma Inline
(Set_List1_With_Parent
);
3945 procedure Set_List2_With_Parent
(N
: Node_Id
; Val
: List_Id
);
3946 pragma Inline
(Set_List2_With_Parent
);
3948 procedure Set_List3_With_Parent
(N
: Node_Id
; Val
: List_Id
);
3949 pragma Inline
(Set_List3_With_Parent
);
3951 procedure Set_List4_With_Parent
(N
: Node_Id
; Val
: List_Id
);
3952 pragma Inline
(Set_List4_With_Parent
);
3954 procedure Set_List5_With_Parent
(N
: Node_Id
; Val
: List_Id
);
3955 pragma Inline
(Set_List5_With_Parent
);
3957 end Unchecked_Access
;
3959 -----------------------------
3960 -- Private Part Subpackage --
3961 -----------------------------
3963 -- The following package contains the definition of the data structure
3964 -- used by the implementation of the Atree package. Logically it really
3965 -- corresponds to the private part, hence the name. The reason that it
3966 -- is defined as a sub-package is to allow special access from clients
3967 -- that need to see the internals of the data structures.
3969 package Atree_Private_Part
is
3971 -------------------------
3972 -- Tree Representation --
3973 -------------------------
3975 -- The nodes of the tree are stored in a table (i.e. an array). In the
3976 -- case of extended nodes six consecutive components in the array are
3977 -- used. There are thus two formats for array components. One is used
3978 -- for nonextended nodes, and for the first component of extended
3979 -- nodes. The other is used for the extension parts (second, third,
3980 -- fourth, fifth, and sixth components) of an extended node. A variant
3981 -- record structure is used to distinguish the two formats.
3983 type Node_Record
(Is_Extension
: Boolean := False) is record
3985 -- Logically, the only field in the common part is the above
3986 -- Is_Extension discriminant (a single bit). However, Gigi cannot
3987 -- yet handle such a structure, so we fill out the common part of
3988 -- the record with fields that are used in different ways for
3989 -- normal nodes and node extensions.
3991 Pflag1
, Pflag2
: Boolean;
3992 -- The Paren_Count field is represented using two boolean flags,
3993 -- where Pflag1 is worth 1, and Pflag2 is worth 2. This is done
3994 -- because we need to be easily able to reuse this field for
3995 -- extra flags in the extended node case.
3998 -- Flag used to indicate if node is a member of a list.
3999 -- This field is considered private to the Atree package.
4001 Has_Aspects
: Boolean;
4002 -- Flag used to indicate that a node has aspect specifications that
4003 -- are associated with the node. See Aspects package for details.
4005 Rewrite_Ins
: Boolean;
4006 -- Flag set by Mark_Rewrite_Insertion procedure.
4007 -- This field is considered private to the Atree package.
4010 -- Flag to indicate the node has been analyzed (and expanded)
4012 Comes_From_Source
: Boolean;
4013 -- Flag to indicate that node comes from the source program (i.e.
4014 -- was built by the parser or scanner, not the analyzer or expander).
4016 Error_Posted
: Boolean;
4017 -- Flag to indicate that an error message has been posted on the
4018 -- node (to avoid duplicate flags on the same node)
4035 -- Flags 4-18 for a normal node. Note that Flags 0-3 are stored
4036 -- separately in the Flags array.
4038 -- The above fields are used as follows in components 2-6 of an
4039 -- extended node entry. Currently they are not used in component 7,
4040 -- since for now we have all the flags we need, but of course they
4041 -- can be used for additional flags when needed in component 7.
4043 -- In_List used as Flag19,Flag40,Flag129,Flag216,Flag287
4044 -- Has_Aspects used as Flag20,Flag41,Flag130,Flag217,Flag288
4045 -- Rewrite_Ins used as Flag21,Flag42,Flag131,Flag218,Flag289
4046 -- Analyzed used as Flag22,Flag43,Flag132,Flag219,Flag290
4047 -- Comes_From_Source used as Flag23,Flag44,Flag133,Flag220,Flag291
4048 -- Error_Posted used as Flag24,Flag45,Flag134,Flag221,Flag292
4049 -- Flag4 used as Flag25,Flag46,Flag135,Flag222,Flag293
4050 -- Flag5 used as Flag26,Flag47,Flag136,Flag223,Flag294
4051 -- Flag6 used as Flag27,Flag48,Flag137,Flag224,Flag295
4052 -- Flag7 used as Flag28,Flag49,Flag138,Flag225,Flag296
4053 -- Flag8 used as Flag29,Flag50,Flag139,Flag226,Flag297
4054 -- Flag9 used as Flag30,Flag51,Flag140,Flag227,Flag298
4055 -- Flag10 used as Flag31,Flag52,Flag141,Flag228,Flag299
4056 -- Flag11 used as Flag32,Flag53,Flag142,Flag229,Flag300
4057 -- Flag12 used as Flag33,Flag54,Flag143,Flag230,Flag301
4058 -- Flag13 used as Flag34,Flag55,Flag144,Flag231,Flag302
4059 -- Flag14 used as Flag35,Flag56,Flag145,Flag232,Flag303
4060 -- Flag15 used as Flag36,Flag57,Flag146,Flag233,Flag304
4061 -- Flag16 used as Flag37,Flag58,Flag147,Flag234,Flag305
4062 -- Flag17 used as Flag38,Flag59,Flag148,Flag235,Flag306
4063 -- Flag18 used as Flag39,Flag60,Flag149,Flag236,Flag307
4064 -- Pflag1 used as Flag61,Flag62,Flag150,Flag237,Flag308
4065 -- Pflag2 used as Flag63,Flag64,Flag151,Flag238,Flag309
4068 -- For a nonextended node, or the initial section of an extended
4069 -- node, this field holds the Node_Kind value. For an extended node,
4070 -- The Nkind field is used as follows:
4072 -- Second entry: holds the Ekind field of the entity
4073 -- Third entry: holds 8 additional flags (Flag65-Flag72)
4074 -- Fourth entry: holds 8 additional flags (Flag239-246)
4075 -- Fifth entry: holds 8 additional flags (Flag247-254)
4076 -- Sixth entry: holds 8 additional flags (Flag310-317)
4077 -- Seventh entry: currently unused
4079 -- Now finally (on a 32-bit boundary) comes the variant part
4081 case Is_Extension
is
4083 -- Nonextended node, or first component of extended node
4088 -- Source location for this node
4091 -- This field is used either as the Parent pointer (if In_List
4092 -- is False), or to point to the list header (if In_List is
4093 -- True). This field is considered private and can be modified
4094 -- only by Atree or by Nlists.
4101 -- Five general use fields, which can contain Node_Id, List_Id,
4102 -- Elist_Id, String_Id, or Name_Id values depending on the
4103 -- values in Nkind and (for extended nodes), in Ekind. See
4104 -- packages Sinfo and Einfo for details of their use.
4106 -- Extension (second component) of extended node
4117 -- Seven additional general fields available only for entities.
4118 -- See package Einfo for details of their use (which depends
4119 -- on the value in the Ekind field).
4121 -- In the third component, the extension format as described
4122 -- above is used to hold additional general fields and flags
4125 -- Field6-11 Holds Field13-Field18
4126 -- Field12 Holds Flag73-Flag96 and Convention
4128 -- In the fourth component, the extension format as described
4129 -- above is used to hold additional general fields and flags
4132 -- Field6-10 Holds Field19-Field23
4133 -- Field11 Holds Flag152-Flag183
4134 -- Field12 Holds Flag97-Flag128
4136 -- In the fifth component, the extension format as described
4137 -- above is used to hold additional general fields and flags
4140 -- Field6-11 Holds Field24-Field29
4141 -- Field12 Holds Flag184-Flag215
4143 -- In the sixth component, the extension format as described
4144 -- above is used to hold additional general fields and flags
4147 -- Field6-11 Holds Field30-Field35
4148 -- Field12 Holds Flag255-Flag286
4150 -- In the seventh component, the extension format as described
4151 -- above is used to hold additional general fields as follows.
4152 -- Flags are also available potentially, but not used now, as
4153 -- we are not short of entity flags.
4155 -- Field6-11 Holds Field36-Field41
4160 pragma Pack
(Node_Record
);
4161 for Node_Record
'Size use 8 * 32;
4162 for Node_Record
'Alignment use 4;
4164 function E_To_N
is new Unchecked_Conversion
(Entity_Kind
, Node_Kind
);
4165 function N_To_E
is new Unchecked_Conversion
(Node_Kind
, Entity_Kind
);
4167 -- Default value used to initialize default nodes. Note that some of the
4168 -- fields get overwritten, and in particular, Nkind always gets reset.
4170 Default_Node
: Node_Record
:= (
4171 Is_Extension
=> False,
4175 Has_Aspects
=> False,
4176 Rewrite_Ins
=> False,
4178 Comes_From_Source
=> False,
4179 -- modified by Set_Comes_From_Source_Default
4180 Error_Posted
=> False,
4199 Nkind
=> N_Unused_At_Start
,
4201 Sloc
=> No_Location
,
4202 Link
=> Empty_List_Or_Node
,
4203 Field1
=> Empty_List_Or_Node
,
4204 Field2
=> Empty_List_Or_Node
,
4205 Field3
=> Empty_List_Or_Node
,
4206 Field4
=> Empty_List_Or_Node
,
4207 Field5
=> Empty_List_Or_Node
);
4209 -- Default value used to initialize node extensions (i.e. the second
4210 -- through seventh components of an extended node). Note we are cheating
4211 -- a bit here when it comes to Node12, which often holds flags and (for
4212 -- the third component), the convention. But it works because Empty,
4213 -- False, Convention_Ada, all happen to be all zero bits.
4215 Default_Node_Extension
: constant Node_Record
:= (
4216 Is_Extension
=> True,
4220 Has_Aspects
=> False,
4221 Rewrite_Ins
=> False,
4223 Comes_From_Source
=> False,
4224 Error_Posted
=> False,
4243 Nkind
=> E_To_N
(E_Void
),
4245 Field6
=> Empty_List_Or_Node
,
4246 Field7
=> Empty_List_Or_Node
,
4247 Field8
=> Empty_List_Or_Node
,
4248 Field9
=> Empty_List_Or_Node
,
4249 Field10
=> Empty_List_Or_Node
,
4250 Field11
=> Empty_List_Or_Node
,
4251 Field12
=> Empty_List_Or_Node
);
4253 -- The following defines the extendable array used for the nodes table
4254 -- Nodes with extensions use six consecutive entries in the array
4256 package Nodes
is new Table
.Table
(
4257 Table_Component_Type
=> Node_Record
,
4258 Table_Index_Type
=> Node_Id
'Base,
4259 Table_Low_Bound
=> First_Node_Id
,
4260 Table_Initial
=> Alloc
.Nodes_Initial
,
4261 Table_Increment
=> Alloc
.Nodes_Increment
,
4262 Release_Threshold
=> Alloc
.Nodes_Release_Threshold
,
4263 Table_Name
=> "Nodes");
4265 -- The following is a parallel table to Nodes, which provides 8 more
4266 -- bits of space that logically belong to the corresponding node. This
4267 -- is currently used to implement Flags 0,1,2,3 for normal nodes, or
4268 -- the first component of an extended node (four bits unused). Entries
4269 -- for extending components are completely unused.
4271 type Flags_Byte
is record
4273 -- Note: we don't use Flag0 at the moment. To put Flag0 into use
4274 -- requires some awkward work in Treeprs (treeprs.adt), so for the
4275 -- moment we don't use it.
4280 -- These flags are used in the usual manner in Sinfo and Einfo
4282 -- The flags listed below use explicit names because following the
4283 -- FlagXXX convention would mean reshuffling of over 300+ flags.
4285 Check_Actuals
: Boolean;
4286 -- Flag set to indicate that the marked node is subject to the check
4287 -- for writable actuals.
4289 Is_Ignored_Ghost_Node
: Boolean;
4290 -- Flag denoting whether the node is subject to pragma Ghost with
4297 for Flags_Byte
'Size use 8;
4298 pragma Pack
(Flags_Byte
);
4300 Default_Flags
: constant Flags_Byte
:= (others => False);
4301 -- Default value used to initialize new entries
4303 package Flags
is new Table
.Table
(
4304 Table_Component_Type
=> Flags_Byte
,
4305 Table_Index_Type
=> Node_Id
'Base,
4306 Table_Low_Bound
=> First_Node_Id
,
4307 Table_Initial
=> Alloc
.Nodes_Initial
,
4308 Table_Increment
=> Alloc
.Nodes_Increment
,
4309 Release_Threshold
=> Alloc
.Nodes_Release_Threshold
,
4310 Table_Name
=> "Flags");
4312 end Atree_Private_Part
;