1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2013, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
27 -- GNAT was originally developed by the GNAT team at New York University. --
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
30 ------------------------------------------------------------------------------
33 with Sinfo
; use Sinfo
;
34 with Einfo
; use Einfo
;
35 with Namet
; use Namet
;
36 with Types
; use Types
;
37 with Snames
; use Snames
;
38 with System
; use System
;
40 with Uintp
; use Uintp
;
41 with Urealp
; use Urealp
;
42 with Unchecked_Conversion
;
46 -- This package defines the format of the tree used to represent the Ada
47 -- program internally. Syntactic and semantic information is combined in
48 -- this tree. There is no separate symbol table structure.
50 -- WARNING: There is a C version of this package. Any changes to this
51 -- source file must be properly reflected in the C header file atree.h
53 -- Package Atree defines the basic structure of the tree and its nodes and
54 -- provides the basic abstract interface for manipulating the tree. Two
55 -- other packages use this interface to define the representation of Ada
56 -- programs using this tree format. The package Sinfo defines the basic
57 -- representation of the syntactic structure of the program, as output
58 -- by the parser. The package Entity_Info defines the semantic information
59 -- which is added to the tree nodes that represent declared entities (i.e.
60 -- the information which might typically be described in a separate symbol
63 -- The front end of the compiler first parses the program and generates a
64 -- tree that is simply a syntactic representation of the program in abstract
65 -- syntax tree format. Subsequent processing in the front end traverses the
66 -- tree, transforming it in various ways and adding semantic information.
68 ----------------------
69 -- Size of Entities --
70 ----------------------
72 -- Currently entities are composed of 6 sequentially allocated 32-byte
73 -- nodes, considered as a single record. The following definition gives
74 -- the number of extension nodes.
76 Num_Extension_Nodes
: Node_Id
:= 5;
77 -- This value is increased by one if debug flag -gnatd.N is set. This is
78 -- for testing performance impact of adding a new extension node. We make
79 -- this of type Node_Id for easy reference in loops using this value.
81 ----------------------------------------
82 -- Definitions of Fields in Tree Node --
83 ----------------------------------------
85 -- The representation of the tree is completely hidden, using a functional
86 -- interface for accessing and modifying the contents of nodes. Logically
87 -- a node contains a number of fields, much as though the nodes were
88 -- defined as a record type. The fields in a node are as follows:
90 -- Nkind Indicates the kind of the node. This field is present
91 -- in all nodes. The type is Node_Kind, which is declared
92 -- in the package Sinfo.
94 -- Sloc Location (Source_Ptr) of the corresponding token
95 -- in the Source buffer. The individual node definitions
96 -- show which token is referenced by this pointer.
98 -- In_List A flag used to indicate if the node is a member
101 -- Rewrite_Ins A flag set if a node is marked as a rewrite inserted
102 -- node as a result of a call to Mark_Rewrite_Insertion.
104 -- Paren_Count A 2-bit count used in sub-expression nodes to indicate
105 -- the level of parentheses. The settings are 0,1,2 and
106 -- 3 for many. If the value is 3, then an auxiliary table
107 -- is used to indicate the real value. Set to zero for
108 -- non-subexpression nodes.
110 -- Note: the required parentheses surrounding conditional
111 -- and quantified expressions count as a level of parens
112 -- for this purpose, so e.g. in X := (if A then B else C);
113 -- Paren_Count for the right side will be 1.
116 -- This flag is present in all nodes. It is set if the
117 -- node is built by the scanner or parser, and clear if
118 -- the node is built by the analyzer or expander. It
119 -- indicates that the node corresponds to a construct
120 -- that appears in the original source program.
122 -- Analyzed This flag is present in all nodes. It is set when
123 -- a node is analyzed, and is used to avoid analyzing
124 -- the same node twice. Analysis includes expansion if
125 -- expansion is active, so in this case if the flag is
126 -- set it means the node has been analyzed and expanded.
128 -- Error_Posted This flag is present in all nodes. It is set when
129 -- an error message is posted which is associated with
130 -- the flagged node. This is used to avoid posting more
131 -- than one message on the same node.
137 -- Field5 Five fields holding Union_Id values
139 -- ElistN Synonym for FieldN typed as Elist_Id (Empty = No_Elist)
140 -- ListN Synonym for FieldN typed as List_Id
141 -- NameN Synonym for FieldN typed as Name_Id
142 -- NodeN Synonym for FieldN typed as Node_Id
143 -- StrN Synonym for FieldN typed as String_Id
144 -- UintN Synonym for FieldN typed as Uint (Empty = Uint_0)
145 -- UrealN Synonym for FieldN typed as Ureal
147 -- Note: in the case of ElistN and UintN fields, it is common that we
148 -- end up with a value of Union_Id'(0) as the default value. This value
149 -- is meaningless as a Uint or Elist_Id value. We have two choices here.
150 -- We could require that all Uint and Elist fields be initialized to an
151 -- appropriate value, but that's error prone, since it would be easy to
152 -- miss an initialization. So instead we have the retrieval functions
153 -- generate an appropriate default value (Uint_0 or No_Elist). Probably
154 -- it would be cleaner to generate No_Uint in the Uint case but we got
155 -- stuck with representing an "unset" size value as zero early on, and
156 -- it will take a bit of fiddling to change that ???
158 -- Note: the actual usage of FieldN (i.e. whether it contains a Elist_Id,
159 -- List_Id, Name_Id, Node_Id, String_Id, Uint or Ureal) depends on the
160 -- value in Nkind. Generally the access to this field is always via the
161 -- functional interface, so the field names ElistN, ListN, NameN, NodeN,
162 -- StrN, UintN and UrealN are used only in the bodies of the access
163 -- functions (i.e. in the bodies of Sinfo and Einfo). These access
164 -- functions contain debugging code that checks that the use is
165 -- consistent with Nkind and Ekind values.
167 -- However, in specialized circumstances (examples are the circuit in
168 -- generic instantiation to copy trees, and in the tree dump routine),
169 -- it is useful to be able to do untyped traversals, and an internal
170 -- package in Atree allows for direct untyped accesses in such cases.
172 -- Flag0 Nineteen Boolean flags (use depends on Nkind and
173 -- Flag1 Ekind, as described for FieldN). Again the access
174 -- Flag2 is usually via subprograms in Sinfo and Einfo which
175 -- Flag3 provide high-level synonyms for these flags, and
176 -- Flag4 contain debugging code that checks that the values
177 -- Flag5 in Nkind and Ekind are appropriate for the access.
183 -- Flag11 Note that Flag0-3 are stored separately in the Flags
184 -- Flag12 table, but that's a detail of the implementation which
185 -- Flag13 is entirely hidden by the funcitonal interface.
192 -- Link For a node, points to the Parent. For a list, points
193 -- to the list header. Note that in the latter case, a
194 -- client cannot modify the link field. This field is
195 -- private to the Atree package (but is also modified
196 -- by the Nlists package).
198 -- The following additional fields are present in extended nodes used
199 -- for entities (Nkind in N_Entity).
201 -- Ekind Entity type. This field indicates the type of the
202 -- entity, it is of type Entity_Kind which is defined
205 -- Flag19 299 additional flags
209 -- Convention Entity convention (Convention_Id value)
211 -- Field6 Additional Union_Id value stored in tree
213 -- Node6 Synonym for Field6 typed as Node_Id
214 -- Elist6 Synonym for Field6 typed as Elist_Id (Empty = No_Elist)
215 -- Uint6 Synonym for Field6 typed as Uint (Empty = Uint_0)
217 -- Similar definitions for Field7 to Field35 (and also Node7-Node35,
218 -- Elist7-Elist35, Uint7-Uint35, Ureal7-Ureal35). Note that not all
219 -- these functions are defined, only the ones that are actually used.
221 function Last_Node_Id
return Node_Id
;
222 pragma Inline
(Last_Node_Id
);
223 -- Returns Id of last allocated node Id
225 function Nodes_Address
return System
.Address
;
226 -- Return address of Nodes table (used in Back_End for Gigi call)
228 function Flags_Address
return System
.Address
;
229 -- Return address of Flags table (used in Back_End for Gigi call)
231 function Num_Nodes
return Nat
;
232 -- Total number of nodes allocated, where an entity counts as a single
233 -- node. This count is incremented every time a node or entity is
234 -- allocated, and decremented every time a node or entity is deleted.
235 -- This value is used by Xref and by Treepr to allocate hash tables of
236 -- suitable size for hashing Node_Id values.
238 -----------------------
239 -- Use of Empty Node --
240 -----------------------
242 -- The special Node_Id Empty is used to mark missing fields. Whenever the
243 -- syntax has an optional component, then the corresponding field will be
244 -- set to Empty if the component is missing.
246 -- Note: Empty is not used to describe an empty list. Instead in this
247 -- case the node field contains a list which is empty, and these cases
248 -- should be distinguished (essentially from a type point of view, Empty
249 -- is a Node, and is thus not a list).
251 -- Note: Empty does in fact correspond to an allocated node. Only the
252 -- Nkind field of this node may be referenced. It contains N_Empty, which
253 -- uniquely identifies the empty case. This allows the Nkind field to be
254 -- dereferenced before the check for Empty which is sometimes useful.
256 -----------------------
257 -- Use of Error Node --
258 -----------------------
260 -- The Error node is used during syntactic and semantic analysis to
261 -- indicate that the corresponding piece of syntactic structure or
262 -- semantic meaning cannot properly be represented in the tree because
263 -- of an illegality in the program.
265 -- If an Error node is encountered, then you know that a previous
266 -- illegality has been detected. The proper reaction should be to
267 -- avoid posting related cascaded error messages, and to propagate
268 -- the error node if necessary.
270 ------------------------
271 -- Current_Error_Node --
272 ------------------------
274 -- The current error node is a global location indicating the current
275 -- node that is being processed for the purposes of placing a compiler
276 -- abort message. This is not necessarily perfectly accurate, it is
277 -- just a reasonably accurate best guess. It is used to output the
278 -- source location in the abort message by Comperr, and also to
279 -- implement the d3 debugging flag. This is also used by Rtsfind
280 -- to generate error messages for high integrity mode.
282 -- There are two ways this gets set. During parsing, when new source
283 -- nodes are being constructed by calls to New_Node and New_Entity,
284 -- either one of these calls sets Current_Error_Node to the newly
285 -- created node. During semantic analysis, this mechanism is not
286 -- used, and instead Current_Error_Node is set by the subprograms in
287 -- Debug_A that mark the start and end of analysis/expansion of a
290 Current_Error_Node
: Node_Id
;
291 -- Node to place error messages
297 -- The following variables denote the count of errors of various kinds
298 -- detected in the tree. Note that these might be more logically located
299 -- in Err_Vars, but we put it to deal with licensing issues (we need this
300 -- to have the GPL exception licensing, since Check_Error_Detected can
301 -- be called from units with this licensing).
303 Serious_Errors_Detected
: Nat
:= 0;
304 -- This is a count of errors that are serious enough to stop expansion,
305 -- and hence to prevent generation of an object file even if the
306 -- switch -gnatQ is set. Initialized to zero at the start of compilation.
307 -- Initialized for -gnatVa use, see comment above.
309 Total_Errors_Detected
: Nat
:= 0;
310 -- Number of errors detected so far. Includes count of serious errors and
311 -- non-serious errors, so this value is always greater than or equal to the
312 -- Serious_Errors_Detected value. Initialized to zero at the start of
313 -- compilation. Initialized for -gnatVa use, see comment above.
315 Warnings_Detected
: Nat
:= 0;
316 -- Number of warnings detected. Initialized to zero at the start of
317 -- compilation. Initialized for -gnatVa use, see comment above.
319 Configurable_Run_Time_Violations
: Nat
:= 0;
320 -- Count of configurable run time violations so far. This is used to
321 -- suppress certain cascaded error messages when we know that we may not
322 -- have fully expanded some items, due to high integrity violations (e.g.
323 -- the use of constructs not permitted by the library in use, or improper
324 -- constructs in No_Run_Time mode).
326 procedure Check_Error_Detected
;
327 -- When an anomaly is found in the tree, many semantic routines silently
328 -- bail out, assuming that the anomaly was caused by a previously detected
329 -- serious error (or configurable run time violation). This routine should
330 -- be called in these cases, and will raise an exception if no such error
331 -- has been detected. This ensure that the anomaly is never allowed to go
334 -------------------------------
335 -- Default Setting of Fields --
336 -------------------------------
338 -- Nkind is set to N_Unused_At_Start
340 -- Ekind is set to E_Void
342 -- Sloc is always set, there is no default value
344 -- Field1-5 fields are set to Empty
346 -- Field6-35 fields in extended nodes are set to Empty
348 -- Parent is set to Empty
350 -- All Boolean flag fields are set to False
352 -- Note: the value Empty is used in Field1-Field35 to indicate a null node.
353 -- The usage varies. The common uses are to indicate absence of an optional
354 -- clause or a completely unused Field1-35 field.
356 -------------------------------------
357 -- Use of Synonyms for Node Fields --
358 -------------------------------------
360 -- A subpackage Atree.Unchecked_Access provides routines for reading and
361 -- writing the fields defined above (Field1-35, Node1-35, Flag0-317 etc).
362 -- These unchecked access routines can be used for untyped traversals.
363 -- In addition they are used in the implementations of the Sinfo and
364 -- Einfo packages. These packages both provide logical synonyms for
365 -- the generic fields, together with an appropriate set of access routines.
366 -- Normally access to information within tree nodes uses these synonyms,
367 -- providing a high level typed interface to the tree information.
369 --------------------------------------------------
370 -- Node Allocation and Modification Subprograms --
371 --------------------------------------------------
373 -- Generally the parser builds the tree and then it is further decorated
374 -- (e.g. by setting the entity fields), but not fundamentally modified.
375 -- However, there are cases in which the tree must be restructured by
376 -- adding and rearranging nodes, as a result of disambiguating cases
377 -- which the parser could not parse correctly, and adding additional
378 -- semantic information (e.g. making constraint checks explicit). The
379 -- following subprograms are used for constructing the tree in the first
380 -- place, and then for subsequent modifications as required.
382 procedure Initialize
;
383 -- Called at the start of compilation to initialize the allocation of
384 -- the node and list tables and make the standard entries for Empty,
385 -- Error and Error_List. Note that Initialize must not be called if
386 -- Tree_Read is used.
389 -- Called before the back end is invoked to lock the nodes table
390 -- Also called after Unlock to relock???
393 -- Unlocks nodes table, in cases where the back end needs to modify it
396 -- Initializes internal tables from current tree file using the relevant
397 -- Table.Tree_Read routines. Note that Initialize should not be called if
398 -- Tree_Read is used. Tree_Read includes all necessary initialization.
400 procedure Tree_Write
;
401 -- Writes out internal tables to current tree file using the relevant
402 -- Table.Tree_Write routines.
405 (New_Node_Kind
: Node_Kind
;
406 New_Sloc
: Source_Ptr
) return Node_Id
;
407 -- Allocates a completely new node with the given node type and source
408 -- location values. All other fields are set to their standard defaults:
410 -- Empty for all FieldN fields
411 -- False for all FlagN fields
413 -- The usual approach is to build a new node using this function and
414 -- then, using the value returned, use the Set_xxx functions to set
415 -- fields of the node as required. New_Node can only be used for
416 -- non-entity nodes, i.e. it never generates an extended node.
418 -- If we are currently parsing, as indicated by a previous call to
419 -- Set_Comes_From_Source_Default (True), then this call also resets
420 -- the value of Current_Error_Node.
423 (New_Node_Kind
: Node_Kind
;
424 New_Sloc
: Source_Ptr
) return Entity_Id
;
425 -- Similar to New_Node, except that it is used only for entity nodes
426 -- and returns an extended node.
428 procedure Set_Comes_From_Source_Default
(Default
: Boolean);
429 -- Sets value of Comes_From_Source flag to be used in all subsequent
430 -- New_Node and New_Entity calls until another call to this procedure
431 -- changes the default. This value is set True during parsing and
432 -- False during semantic analysis. This is also used to determine
433 -- if New_Node and New_Entity should set Current_Error_Node.
435 function Get_Comes_From_Source_Default
return Boolean;
436 pragma Inline
(Get_Comes_From_Source_Default
);
437 -- Gets the current value of the Comes_From_Source flag
439 procedure Preserve_Comes_From_Source
(NewN
, OldN
: Node_Id
);
440 pragma Inline
(Preserve_Comes_From_Source
);
441 -- When a node is rewritten, it is sometimes appropriate to preserve the
442 -- original comes from source indication. This is true when the rewrite
443 -- essentially corresponds to a transformation corresponding exactly to
444 -- semantics in the reference manual. This procedure copies the setting
445 -- of Comes_From_Source from OldN to NewN.
447 function Has_Extension
(N
: Node_Id
) return Boolean;
448 pragma Inline
(Has_Extension
);
449 -- Returns True if the given node has an extension (i.e. was created by
450 -- a call to New_Entity rather than New_Node, and Nkind is in N_Entity)
452 procedure Change_Node
(N
: Node_Id
; New_Node_Kind
: Node_Kind
);
453 -- This procedure replaces the given node by setting its Nkind field to
454 -- the indicated value and resetting all other fields to their default
455 -- values except for Sloc, which is unchanged, and the Parent pointer
456 -- and list links, which are also unchanged. All other information in
457 -- the original node is lost. The new node has an extension if the
458 -- original node had an extension.
460 procedure Copy_Node
(Source
: Node_Id
; Destination
: Node_Id
);
461 -- Copy the entire contents of the source node to the destination node.
462 -- The contents of the source node is not affected. If the source node
463 -- has an extension, then the destination must have an extension also.
464 -- The parent pointer of the destination and its list link, if any, are
465 -- not affected by the copy. Note that parent pointers of descendents
466 -- are not adjusted, so the descendents of the destination node after
467 -- the Copy_Node is completed have dubious parent pointers. Note that
468 -- this routine does NOT copy aspect specifications, the Has_Aspects
469 -- flag in the returned node will always be False. The caller must deal
470 -- with copying aspect specifications where this is required.
472 function New_Copy
(Source
: Node_Id
) return Node_Id
;
473 -- This function allocates a completely new node, and then initializes
474 -- it by copying the contents of the source node into it. The contents of
475 -- the source node is not affected. The target node is always marked as
476 -- not being in a list (even if the source is a list member), and not
477 -- overloaded. The new node will have an extension if the source has
478 -- an extension. New_Copy (Empty) returns Empty, and New_Copy (Error)
479 -- returns Error. Note that, unlike Copy_Separate_Tree, New_Copy does not
480 -- recursively copy any descendents, so in general parent pointers are not
481 -- set correctly for the descendents of the copied node. Both normal and
482 -- extended nodes (entities) may be copied using New_Copy.
484 function Relocate_Node
(Source
: Node_Id
) return Node_Id
;
485 -- Source is a non-entity node that is to be relocated. A new node is
486 -- allocated, and the contents of Source are copied to this node, using
487 -- New_Copy. The parent pointers of descendents of the node are then
488 -- adjusted to point to the relocated copy. The original node is not
489 -- modified, but the parent pointers of its descendents are no longer
490 -- valid. The new copy is always marked as not overloaded. This routine is
491 -- used in conjunction with the tree rewrite routines (see descriptions of
494 -- Note that the resulting node has the same parent as the source node, and
495 -- is thus still attached to the tree. It is valid for Source to be Empty,
496 -- in which case Relocate_Node simply returns Empty as the result.
498 function Copy_Separate_Tree
(Source
: Node_Id
) return Node_Id
;
499 -- Given a node that is the root of a subtree, Copy_Separate_Tree copies
500 -- the entire syntactic subtree, including recursively any descendants
501 -- whose parent field references a copied node (descendants not linked to
502 -- a copied node by the parent field are also copied.) The parent pointers
503 -- in the copy are properly set. Copy_Separate_Tree (Empty/Error) returns
504 -- Empty/Error. The new subtree does not share entities with the source,
505 -- but has new entities with the same name. Most of the time this routine
506 -- is called on an unanalyzed tree, and no semantic information is copied.
507 -- However, to ensure that no entities are shared between the two when the
508 -- source is already analyzed, entity fields in the copy are zeroed out.
510 function Copy_Separate_List
(Source
: List_Id
) return List_Id
;
511 -- Applies Copy_Separate_Tree to each element of the Source list, returning
512 -- a new list of the results of these copy operations.
514 procedure Exchange_Entities
(E1
: Entity_Id
; E2
: Entity_Id
);
515 -- Exchange the contents of two entities. The parent pointers are switched
516 -- as well as the Defining_Identifier fields in the parents, so that the
517 -- entities point correctly to their original parents. The effect is thus
518 -- to leave the tree completely unchanged in structure, except that the
519 -- entity ID values of the two entities are interchanged. Neither of the
520 -- two entities may be list members. Note that entities appear on two
521 -- semantic chains: Homonym and Next_Entity: the corresponding links must
522 -- be adjusted by the caller, according to context.
524 function Extend_Node
(Node
: Node_Id
) return Entity_Id
;
525 -- This function returns a copy of its input node with an extension added.
526 -- The fields of the extension are set to Empty. Due to the way extensions
527 -- are handled (as four consecutive array elements), it may be necessary
528 -- to reallocate the node, so that the returned value is not the same as
529 -- the input value, but where possible the returned value will be the same
530 -- as the input value (i.e. the extension will occur in place). It is the
531 -- caller's responsibility to ensure that any pointers to the original node
532 -- are appropriately updated. This function is used only by Sinfo.CN to
533 -- change nodes into their corresponding entities.
535 type Report_Proc
is access procedure (Target
: Node_Id
; Source
: Node_Id
);
537 procedure Set_Reporting_Proc
(P
: Report_Proc
);
538 -- Register a procedure that is invoked when a node is allocated, replaced
541 type Traverse_Result
is (Abandon
, OK
, OK_Orig
, Skip
);
542 -- This is the type of the result returned by the Process function passed
543 -- to Traverse_Func and Traverse_Proc. See below for details.
545 subtype Traverse_Final_Result
is Traverse_Result
range Abandon
.. OK
;
546 -- This is the type of the final result returned Traverse_Func, based on
547 -- the results of Process calls. See below for details.
550 with function Process
(N
: Node_Id
) return Traverse_Result
is <>;
551 function Traverse_Func
(Node
: Node_Id
) return Traverse_Final_Result
;
552 -- This is a generic function that, given the parent node for a subtree,
553 -- traverses all syntactic nodes of this tree, calling the given function
554 -- Process on each one, in pre order (i.e. top-down). The order of
555 -- traversing subtrees is arbitrary. The traversal is controlled as follows
556 -- by the result returned by Process:
558 -- OK The traversal continues normally with the syntactic
559 -- children of the node just processed.
561 -- OK_Orig The traversal continues normally with the syntactic
562 -- children of the original node of the node just processed.
564 -- Skip The children of the node just processed are skipped and
565 -- excluded from the traversal, but otherwise processing
566 -- continues elsewhere in the tree.
568 -- Abandon The entire traversal is immediately abandoned, and the
569 -- original call to Traverse returns Abandon.
571 -- The result returned by Traverse is Abandon if processing was terminated
572 -- by a call to Process returning Abandon, otherwise it is OK (meaning that
573 -- all calls to process returned either OK, OK_Orig, or Skip).
576 with function Process
(N
: Node_Id
) return Traverse_Result
is <>;
577 procedure Traverse_Proc
(Node
: Node_Id
);
578 pragma Inline
(Traverse_Proc
);
579 -- This is the same as Traverse_Func except that no result is returned,
580 -- i.e. Traverse_Func is called and the result is simply discarded.
582 ---------------------------
583 -- Node Access Functions --
584 ---------------------------
586 -- The following functions return the contents of the indicated field of
587 -- the node referenced by the argument, which is a Node_Id.
589 function Nkind
(N
: Node_Id
) return Node_Kind
;
590 pragma Inline
(Nkind
);
592 function Analyzed
(N
: Node_Id
) return Boolean;
593 pragma Inline
(Analyzed
);
595 function Has_Aspects
(N
: Node_Id
) return Boolean;
596 pragma Inline
(Has_Aspects
);
598 function Comes_From_Source
(N
: Node_Id
) return Boolean;
599 pragma Inline
(Comes_From_Source
);
601 function Error_Posted
(N
: Node_Id
) return Boolean;
602 pragma Inline
(Error_Posted
);
604 function Sloc
(N
: Node_Id
) return Source_Ptr
;
605 pragma Inline
(Sloc
);
607 function Paren_Count
(N
: Node_Id
) return Nat
;
608 pragma Inline
(Paren_Count
);
610 function Parent
(N
: Node_Id
) return Node_Id
;
611 pragma Inline
(Parent
);
612 -- Returns the parent of a node if the node is not a list member, or else
613 -- the parent of the list containing the node if the node is a list member.
615 function No
(N
: Node_Id
) return Boolean;
617 -- Tests given Id for equality with the Empty node. This allows notations
618 -- like "if No (Variant_Part)" as opposed to "if Variant_Part = Empty".
620 function Present
(N
: Node_Id
) return Boolean;
621 pragma Inline
(Present
);
622 -- Tests given Id for inequality with the Empty node. This allows notations
623 -- like "if Present (Statement)" as opposed to "if Statement /= Empty".
625 ---------------------
626 -- Node_Kind Tests --
627 ---------------------
629 -- These are like the functions in Sinfo, but the first argument is a
630 -- Node_Id, and the tested field is Nkind (N).
635 V2
: Node_Kind
) return Boolean;
641 V3
: Node_Kind
) return Boolean;
648 V4
: Node_Kind
) return Boolean;
656 V5
: Node_Kind
) return Boolean;
665 V6
: Node_Kind
) return Boolean;
675 V7
: Node_Kind
) return Boolean;
686 V8
: Node_Kind
) return Boolean;
698 V9
: Node_Kind
) return Boolean;
700 pragma Inline
(Nkind_In
);
701 -- Inline all above functions
703 -----------------------
704 -- Entity_Kind_Tests --
705 -----------------------
707 -- Utility functions to test whether an Entity_Kind value, either given
708 -- directly as the first argument, or the Ekind field of an Entity give
709 -- as the first argument, matches any of the given list of Entity_Kind
710 -- values. Return True if any match, False if no match.
715 V2
: Entity_Kind
) return Boolean;
721 V3
: Entity_Kind
) return Boolean;
728 V4
: Entity_Kind
) return Boolean;
736 V5
: Entity_Kind
) return Boolean;
745 V6
: Entity_Kind
) return Boolean;
755 V7
: Entity_Kind
) return Boolean;
766 V8
: Entity_Kind
) return Boolean;
771 V2
: Entity_Kind
) return Boolean;
777 V3
: Entity_Kind
) return Boolean;
784 V4
: Entity_Kind
) return Boolean;
792 V5
: Entity_Kind
) return Boolean;
801 V6
: Entity_Kind
) return Boolean;
811 V7
: Entity_Kind
) return Boolean;
822 V8
: Entity_Kind
) return Boolean;
824 pragma Inline
(Ekind_In
);
825 -- Inline all above functions
827 -----------------------------
828 -- Entity Access Functions --
829 -----------------------------
831 -- The following functions apply only to Entity_Id values, i.e.
832 -- to extended nodes.
834 function Ekind
(E
: Entity_Id
) return Entity_Kind
;
835 pragma Inline
(Ekind
);
837 function Convention
(E
: Entity_Id
) return Convention_Id
;
838 pragma Inline
(Convention
);
840 ----------------------------
841 -- Node Update Procedures --
842 ----------------------------
844 -- The following functions set a specified field in the node whose Id is
845 -- passed as the first argument. The second parameter is the new value
846 -- to be set in the specified field. Note that Set_Nkind is in the next
847 -- section, since its use is restricted.
849 procedure Set_Sloc
(N
: Node_Id
; Val
: Source_Ptr
);
850 pragma Inline
(Set_Sloc
);
852 procedure Set_Paren_Count
(N
: Node_Id
; Val
: Nat
);
853 pragma Inline
(Set_Paren_Count
);
855 procedure Set_Parent
(N
: Node_Id
; Val
: Node_Id
);
856 pragma Inline
(Set_Parent
);
858 procedure Set_Analyzed
(N
: Node_Id
; Val
: Boolean := True);
859 pragma Inline
(Set_Analyzed
);
861 procedure Set_Error_Posted
(N
: Node_Id
; Val
: Boolean := True);
862 pragma Inline
(Set_Error_Posted
);
864 procedure Set_Comes_From_Source
(N
: Node_Id
; Val
: Boolean);
865 pragma Inline
(Set_Comes_From_Source
);
866 -- Note that this routine is very rarely used, since usually the
867 -- default mechanism provided sets the right value, but in some
868 -- unusual cases, the value needs to be reset (e.g. when a source
869 -- node is copied, and the copy must not have Comes_From_Source set).
871 procedure Set_Has_Aspects
(N
: Node_Id
; Val
: Boolean := True);
872 pragma Inline
(Set_Has_Aspects
);
874 procedure Set_Original_Node
(N
: Node_Id
; Val
: Node_Id
);
875 pragma Inline
(Set_Original_Node
);
876 -- Note that this routine is used only in very peculiar cases. In normal
877 -- cases, the Original_Node link is set by calls to Rewrite. We currently
878 -- use it in ASIS mode to manually set the link from pragma expressions
879 -- to their aspect original source expressions, so that the original source
880 -- expressions accessed by ASIS are also semantically analyzed.
882 ------------------------------
883 -- Entity Update Procedures --
884 ------------------------------
886 -- The following procedures apply only to Entity_Id values, i.e.
887 -- to extended nodes.
889 procedure Basic_Set_Convention
(E
: Entity_Id
; Val
: Convention_Id
);
890 pragma Inline
(Basic_Set_Convention
);
891 -- Clients should use Sem_Util.Set_Convention rather than calling this
892 -- routine directly, as Set_Convention also deals with the special
893 -- processing required for access types.
895 procedure Set_Ekind
(E
: Entity_Id
; Val
: Entity_Kind
);
896 pragma Inline
(Set_Ekind
);
898 ---------------------------
899 -- Tree Rewrite Routines --
900 ---------------------------
902 -- During the compilation process it is necessary in a number of situations
903 -- to rewrite the tree. In some cases, such rewrites do not affect the
904 -- structure of the tree, for example, when an indexed component node is
905 -- replaced by the corresponding call node (the parser cannot distinguish
906 -- between these two cases).
908 -- In other situations, the rewrite does affect the structure of the
909 -- tree. Examples are the replacement of a generic instantiation by the
910 -- instantiated spec and body, and the static evaluation of expressions.
912 -- If such structural modifications are done by the expander, there are
913 -- no difficulties, since the form of the tree after the expander has no
914 -- special significance, except as input to the backend of the compiler.
915 -- However, if these modifications are done by the semantic phase, then
916 -- it is important that they be done in a manner which allows the original
917 -- tree to be preserved. This is because tools like pretty printers need
918 -- to have this original tree structure available.
920 -- The subprograms in this section allow rewriting of the tree by either
921 -- insertion of new nodes in an existing list, or complete replacement of
922 -- a subtree. The resulting tree for most purposes looks as though it has
923 -- been really changed, and there is no trace of the original. However,
924 -- special subprograms, also defined in this section, allow the original
925 -- tree to be reconstructed if necessary.
927 -- For tree modifications done in the expander, it is permissible to
928 -- destroy the original tree, although it is also allowable to use the
929 -- tree rewrite routines where it is convenient to do so.
931 procedure Mark_Rewrite_Insertion
(New_Node
: Node_Id
);
932 pragma Inline
(Mark_Rewrite_Insertion
);
933 -- This procedure marks the given node as an insertion made during a tree
934 -- rewriting operation. Only the root needs to be marked. The call does
935 -- not do the actual insertion, which must be done using one of the normal
936 -- list insertion routines. The node is treated normally in all respects
937 -- except for its response to Is_Rewrite_Insertion. The function of these
938 -- calls is to be able to get an accurate original tree. This helps the
939 -- accuracy of Sprint.Sprint_Node, and in particular, when stubs are being
940 -- generated, it is essential that the original tree be accurate.
942 function Is_Rewrite_Insertion
(Node
: Node_Id
) return Boolean;
943 pragma Inline
(Is_Rewrite_Insertion
);
944 -- Tests whether the given node was marked using Mark_Rewrite_Insertion.
945 -- This is used in reconstructing the original tree (where such nodes are
946 -- to be eliminated).
948 procedure Rewrite
(Old_Node
, New_Node
: Node_Id
);
949 -- This is used when a complete subtree is to be replaced. Old_Node is the
950 -- root of the old subtree to be replaced, and New_Node is the root of the
951 -- newly constructed replacement subtree. The actual mechanism is to swap
952 -- the contents of these two nodes fixing up the parent pointers of the
953 -- replaced node (we do not attempt to preserve parent pointers for the
954 -- original node). Neither Old_Node nor New_Node can be extended nodes.
956 -- Note: New_Node may not contain references to Old_Node, for example as
957 -- descendents, since the rewrite would make such references invalid. If
958 -- New_Node does need to reference Old_Node, then these references should
959 -- be to a relocated copy of Old_Node (see Relocate_Node procedure).
961 -- Note: The Original_Node function applied to Old_Node (which has now
962 -- been replaced by the contents of New_Node), can be used to obtain the
963 -- original node, i.e. the old contents of Old_Node.
965 procedure Replace
(Old_Node
, New_Node
: Node_Id
);
966 -- This is similar to Rewrite, except that the old value of Old_Node is
967 -- not saved, and the New_Node is deleted after the replace, since it
968 -- is assumed that it can no longer be legitimately needed. The flag
969 -- Is_Rewrite_Substitution will be False for the resulting node, unless
970 -- it was already true on entry, and Original_Node will not return the
971 -- original contents of the Old_Node, but rather the New_Node value (unless
972 -- Old_Node had already been rewritten using Rewrite). Replace also
973 -- preserves the setting of Comes_From_Source.
975 -- Note, New_Node may not contain references to Old_Node, for example as
976 -- descendents, since the rewrite would make such references invalid. If
977 -- New_Node does need to reference Old_Node, then these references should
978 -- be to a relocated copy of Old_Node (see Relocate_Node procedure).
980 -- Replace is used in certain circumstances where it is desirable to
981 -- suppress any history of the rewriting operation. Notably, it is used
982 -- when the parser has mis-classified a node (e.g. a task entry call
983 -- that the parser has parsed as a procedure call).
985 function Is_Rewrite_Substitution
(Node
: Node_Id
) return Boolean;
986 pragma Inline
(Is_Rewrite_Substitution
);
987 -- Return True iff Node has been rewritten (i.e. if Node is the root
988 -- of a subtree which was installed using Rewrite).
990 function Original_Node
(Node
: Node_Id
) return Node_Id
;
991 pragma Inline
(Original_Node
);
992 -- If Node has not been rewritten, then returns its input argument
993 -- unchanged, else returns the Node for the original subtree. Note that
994 -- this is used extensively by ASIS on the trees constructed in ASIS mode
995 -- to reconstruct the original semantic tree. See section in sinfo.ads
996 -- for requirements on original nodes returned by this function.
998 -- Note: Parents are not preserved in original tree nodes that are
999 -- retrieved in this way (i.e. their children may have children whose
1000 -- pointers which reference some other node). This needs more details???
1002 -- Note: there is no direct mechanism for deleting an original node (in
1003 -- a manner that can be reversed later). One possible approach is to use
1004 -- Rewrite to substitute a null statement for the node to be deleted.
1006 -----------------------------------
1007 -- Generic Field Access Routines --
1008 -----------------------------------
1010 -- This subpackage provides the functions for accessing and procedures for
1011 -- setting fields that are normally referenced by wrapper subprograms (e.g.
1012 -- logical synonyms defined in packages Sinfo and Einfo, or specialized
1013 -- routines such as Rewrite (for Original_Node), or the node creation
1014 -- routines (for Set_Nkind). The implementations of these wrapper
1015 -- subprograms use the package Atree.Unchecked_Access as do various
1016 -- special case accesses where no wrapper applies. Documentation is always
1017 -- required for such a special case access explaining why it is needed.
1019 package Unchecked_Access
is
1021 -- Functions to allow interpretation of Union_Id values as Uint and
1024 function To_Union
is new Unchecked_Conversion
(Uint
, Union_Id
);
1025 function To_Union
is new Unchecked_Conversion
(Ureal
, Union_Id
);
1027 function From_Union
is new Unchecked_Conversion
(Union_Id
, Uint
);
1028 function From_Union
is new Unchecked_Conversion
(Union_Id
, Ureal
);
1030 -- Functions to fetch contents of indicated field. It is an error to
1031 -- attempt to read the value of a field which is not present.
1033 function Field1
(N
: Node_Id
) return Union_Id
;
1034 pragma Inline
(Field1
);
1036 function Field2
(N
: Node_Id
) return Union_Id
;
1037 pragma Inline
(Field2
);
1039 function Field3
(N
: Node_Id
) return Union_Id
;
1040 pragma Inline
(Field3
);
1042 function Field4
(N
: Node_Id
) return Union_Id
;
1043 pragma Inline
(Field4
);
1045 function Field5
(N
: Node_Id
) return Union_Id
;
1046 pragma Inline
(Field5
);
1048 function Field6
(N
: Node_Id
) return Union_Id
;
1049 pragma Inline
(Field6
);
1051 function Field7
(N
: Node_Id
) return Union_Id
;
1052 pragma Inline
(Field7
);
1054 function Field8
(N
: Node_Id
) return Union_Id
;
1055 pragma Inline
(Field8
);
1057 function Field9
(N
: Node_Id
) return Union_Id
;
1058 pragma Inline
(Field9
);
1060 function Field10
(N
: Node_Id
) return Union_Id
;
1061 pragma Inline
(Field10
);
1063 function Field11
(N
: Node_Id
) return Union_Id
;
1064 pragma Inline
(Field11
);
1066 function Field12
(N
: Node_Id
) return Union_Id
;
1067 pragma Inline
(Field12
);
1069 function Field13
(N
: Node_Id
) return Union_Id
;
1070 pragma Inline
(Field13
);
1072 function Field14
(N
: Node_Id
) return Union_Id
;
1073 pragma Inline
(Field14
);
1075 function Field15
(N
: Node_Id
) return Union_Id
;
1076 pragma Inline
(Field15
);
1078 function Field16
(N
: Node_Id
) return Union_Id
;
1079 pragma Inline
(Field16
);
1081 function Field17
(N
: Node_Id
) return Union_Id
;
1082 pragma Inline
(Field17
);
1084 function Field18
(N
: Node_Id
) return Union_Id
;
1085 pragma Inline
(Field18
);
1087 function Field19
(N
: Node_Id
) return Union_Id
;
1088 pragma Inline
(Field19
);
1090 function Field20
(N
: Node_Id
) return Union_Id
;
1091 pragma Inline
(Field20
);
1093 function Field21
(N
: Node_Id
) return Union_Id
;
1094 pragma Inline
(Field21
);
1096 function Field22
(N
: Node_Id
) return Union_Id
;
1097 pragma Inline
(Field22
);
1099 function Field23
(N
: Node_Id
) return Union_Id
;
1100 pragma Inline
(Field23
);
1102 function Field24
(N
: Node_Id
) return Union_Id
;
1103 pragma Inline
(Field24
);
1105 function Field25
(N
: Node_Id
) return Union_Id
;
1106 pragma Inline
(Field25
);
1108 function Field26
(N
: Node_Id
) return Union_Id
;
1109 pragma Inline
(Field26
);
1111 function Field27
(N
: Node_Id
) return Union_Id
;
1112 pragma Inline
(Field27
);
1114 function Field28
(N
: Node_Id
) return Union_Id
;
1115 pragma Inline
(Field28
);
1117 function Field29
(N
: Node_Id
) return Union_Id
;
1118 pragma Inline
(Field29
);
1120 function Field30
(N
: Node_Id
) return Union_Id
;
1121 pragma Inline
(Field30
);
1123 function Field31
(N
: Node_Id
) return Union_Id
;
1124 pragma Inline
(Field31
);
1126 function Field32
(N
: Node_Id
) return Union_Id
;
1127 pragma Inline
(Field32
);
1129 function Field33
(N
: Node_Id
) return Union_Id
;
1130 pragma Inline
(Field33
);
1132 function Field34
(N
: Node_Id
) return Union_Id
;
1133 pragma Inline
(Field34
);
1135 function Field35
(N
: Node_Id
) return Union_Id
;
1136 pragma Inline
(Field35
);
1138 function Node1
(N
: Node_Id
) return Node_Id
;
1139 pragma Inline
(Node1
);
1141 function Node2
(N
: Node_Id
) return Node_Id
;
1142 pragma Inline
(Node2
);
1144 function Node3
(N
: Node_Id
) return Node_Id
;
1145 pragma Inline
(Node3
);
1147 function Node4
(N
: Node_Id
) return Node_Id
;
1148 pragma Inline
(Node4
);
1150 function Node5
(N
: Node_Id
) return Node_Id
;
1151 pragma Inline
(Node5
);
1153 function Node6
(N
: Node_Id
) return Node_Id
;
1154 pragma Inline
(Node6
);
1156 function Node7
(N
: Node_Id
) return Node_Id
;
1157 pragma Inline
(Node7
);
1159 function Node8
(N
: Node_Id
) return Node_Id
;
1160 pragma Inline
(Node8
);
1162 function Node9
(N
: Node_Id
) return Node_Id
;
1163 pragma Inline
(Node9
);
1165 function Node10
(N
: Node_Id
) return Node_Id
;
1166 pragma Inline
(Node10
);
1168 function Node11
(N
: Node_Id
) return Node_Id
;
1169 pragma Inline
(Node11
);
1171 function Node12
(N
: Node_Id
) return Node_Id
;
1172 pragma Inline
(Node12
);
1174 function Node13
(N
: Node_Id
) return Node_Id
;
1175 pragma Inline
(Node13
);
1177 function Node14
(N
: Node_Id
) return Node_Id
;
1178 pragma Inline
(Node14
);
1180 function Node15
(N
: Node_Id
) return Node_Id
;
1181 pragma Inline
(Node15
);
1183 function Node16
(N
: Node_Id
) return Node_Id
;
1184 pragma Inline
(Node16
);
1186 function Node17
(N
: Node_Id
) return Node_Id
;
1187 pragma Inline
(Node17
);
1189 function Node18
(N
: Node_Id
) return Node_Id
;
1190 pragma Inline
(Node18
);
1192 function Node19
(N
: Node_Id
) return Node_Id
;
1193 pragma Inline
(Node19
);
1195 function Node20
(N
: Node_Id
) return Node_Id
;
1196 pragma Inline
(Node20
);
1198 function Node21
(N
: Node_Id
) return Node_Id
;
1199 pragma Inline
(Node21
);
1201 function Node22
(N
: Node_Id
) return Node_Id
;
1202 pragma Inline
(Node22
);
1204 function Node23
(N
: Node_Id
) return Node_Id
;
1205 pragma Inline
(Node23
);
1207 function Node24
(N
: Node_Id
) return Node_Id
;
1208 pragma Inline
(Node24
);
1210 function Node25
(N
: Node_Id
) return Node_Id
;
1211 pragma Inline
(Node25
);
1213 function Node26
(N
: Node_Id
) return Node_Id
;
1214 pragma Inline
(Node26
);
1216 function Node27
(N
: Node_Id
) return Node_Id
;
1217 pragma Inline
(Node27
);
1219 function Node28
(N
: Node_Id
) return Node_Id
;
1220 pragma Inline
(Node28
);
1222 function Node29
(N
: Node_Id
) return Node_Id
;
1223 pragma Inline
(Node29
);
1225 function Node30
(N
: Node_Id
) return Node_Id
;
1226 pragma Inline
(Node30
);
1228 function Node31
(N
: Node_Id
) return Node_Id
;
1229 pragma Inline
(Node31
);
1231 function Node32
(N
: Node_Id
) return Node_Id
;
1232 pragma Inline
(Node32
);
1234 function Node33
(N
: Node_Id
) return Node_Id
;
1235 pragma Inline
(Node33
);
1237 function Node34
(N
: Node_Id
) return Node_Id
;
1238 pragma Inline
(Node34
);
1240 function List1
(N
: Node_Id
) return List_Id
;
1241 pragma Inline
(List1
);
1243 function List2
(N
: Node_Id
) return List_Id
;
1244 pragma Inline
(List2
);
1246 function List3
(N
: Node_Id
) return List_Id
;
1247 pragma Inline
(List3
);
1249 function List4
(N
: Node_Id
) return List_Id
;
1250 pragma Inline
(List4
);
1252 function List5
(N
: Node_Id
) return List_Id
;
1253 pragma Inline
(List5
);
1255 function List10
(N
: Node_Id
) return List_Id
;
1256 pragma Inline
(List10
);
1258 function List14
(N
: Node_Id
) return List_Id
;
1259 pragma Inline
(List14
);
1261 function List25
(N
: Node_Id
) return List_Id
;
1262 pragma Inline
(List25
);
1264 function Elist1
(N
: Node_Id
) return Elist_Id
;
1265 pragma Inline
(Elist1
);
1267 function Elist2
(N
: Node_Id
) return Elist_Id
;
1268 pragma Inline
(Elist2
);
1270 function Elist3
(N
: Node_Id
) return Elist_Id
;
1271 pragma Inline
(Elist3
);
1273 function Elist4
(N
: Node_Id
) return Elist_Id
;
1274 pragma Inline
(Elist4
);
1276 function Elist5
(N
: Node_Id
) return Elist_Id
;
1277 pragma Inline
(Elist5
);
1279 function Elist8
(N
: Node_Id
) return Elist_Id
;
1280 pragma Inline
(Elist8
);
1282 function Elist9
(N
: Node_Id
) return Elist_Id
;
1283 pragma Inline
(Elist9
);
1285 function Elist10
(N
: Node_Id
) return Elist_Id
;
1286 pragma Inline
(Elist10
);
1288 function Elist13
(N
: Node_Id
) return Elist_Id
;
1289 pragma Inline
(Elist13
);
1291 function Elist15
(N
: Node_Id
) return Elist_Id
;
1292 pragma Inline
(Elist15
);
1294 function Elist16
(N
: Node_Id
) return Elist_Id
;
1295 pragma Inline
(Elist16
);
1297 function Elist18
(N
: Node_Id
) return Elist_Id
;
1298 pragma Inline
(Elist18
);
1300 function Elist21
(N
: Node_Id
) return Elist_Id
;
1301 pragma Inline
(Elist21
);
1303 function Elist23
(N
: Node_Id
) return Elist_Id
;
1304 pragma Inline
(Elist23
);
1306 function Elist24
(N
: Node_Id
) return Elist_Id
;
1307 pragma Inline
(Elist24
);
1309 function Elist25
(N
: Node_Id
) return Elist_Id
;
1310 pragma Inline
(Elist25
);
1312 function Elist26
(N
: Node_Id
) return Elist_Id
;
1313 pragma Inline
(Elist26
);
1315 function Name1
(N
: Node_Id
) return Name_Id
;
1316 pragma Inline
(Name1
);
1318 function Name2
(N
: Node_Id
) return Name_Id
;
1319 pragma Inline
(Name2
);
1321 function Str3
(N
: Node_Id
) return String_Id
;
1322 pragma Inline
(Str3
);
1324 -- Note: the following Uintnn functions have a special test for the
1325 -- Field value being Empty. If an Empty value is found then Uint_0 is
1326 -- returned. This avoids the rather tricky requirement of initializing
1327 -- all Uint fields in nodes and entities.
1329 function Uint2
(N
: Node_Id
) return Uint
;
1330 pragma Inline
(Uint2
);
1332 function Uint3
(N
: Node_Id
) return Uint
;
1333 pragma Inline
(Uint3
);
1335 function Uint4
(N
: Node_Id
) return Uint
;
1336 pragma Inline
(Uint4
);
1338 function Uint5
(N
: Node_Id
) return Uint
;
1339 pragma Inline
(Uint5
);
1341 function Uint8
(N
: Node_Id
) return Uint
;
1342 pragma Inline
(Uint8
);
1344 function Uint9
(N
: Node_Id
) return Uint
;
1345 pragma Inline
(Uint9
);
1347 function Uint10
(N
: Node_Id
) return Uint
;
1348 pragma Inline
(Uint10
);
1350 function Uint11
(N
: Node_Id
) return Uint
;
1351 pragma Inline
(Uint11
);
1353 function Uint12
(N
: Node_Id
) return Uint
;
1354 pragma Inline
(Uint12
);
1356 function Uint13
(N
: Node_Id
) return Uint
;
1357 pragma Inline
(Uint13
);
1359 function Uint14
(N
: Node_Id
) return Uint
;
1360 pragma Inline
(Uint14
);
1362 function Uint15
(N
: Node_Id
) return Uint
;
1363 pragma Inline
(Uint15
);
1365 function Uint16
(N
: Node_Id
) return Uint
;
1366 pragma Inline
(Uint16
);
1368 function Uint17
(N
: Node_Id
) return Uint
;
1369 pragma Inline
(Uint17
);
1371 function Uint22
(N
: Node_Id
) return Uint
;
1372 pragma Inline
(Uint22
);
1374 function Ureal3
(N
: Node_Id
) return Ureal
;
1375 pragma Inline
(Ureal3
);
1377 function Ureal18
(N
: Node_Id
) return Ureal
;
1378 pragma Inline
(Ureal18
);
1380 function Ureal21
(N
: Node_Id
) return Ureal
;
1381 pragma Inline
(Ureal21
);
1383 function Flag0
(N
: Node_Id
) return Boolean;
1384 pragma Inline
(Flag0
);
1386 function Flag1
(N
: Node_Id
) return Boolean;
1387 pragma Inline
(Flag1
);
1389 function Flag2
(N
: Node_Id
) return Boolean;
1390 pragma Inline
(Flag2
);
1392 function Flag3
(N
: Node_Id
) return Boolean;
1393 pragma Inline
(Flag3
);
1395 function Flag4
(N
: Node_Id
) return Boolean;
1396 pragma Inline
(Flag4
);
1398 function Flag5
(N
: Node_Id
) return Boolean;
1399 pragma Inline
(Flag5
);
1401 function Flag6
(N
: Node_Id
) return Boolean;
1402 pragma Inline
(Flag6
);
1404 function Flag7
(N
: Node_Id
) return Boolean;
1405 pragma Inline
(Flag7
);
1407 function Flag8
(N
: Node_Id
) return Boolean;
1408 pragma Inline
(Flag8
);
1410 function Flag9
(N
: Node_Id
) return Boolean;
1411 pragma Inline
(Flag9
);
1413 function Flag10
(N
: Node_Id
) return Boolean;
1414 pragma Inline
(Flag10
);
1416 function Flag11
(N
: Node_Id
) return Boolean;
1417 pragma Inline
(Flag11
);
1419 function Flag12
(N
: Node_Id
) return Boolean;
1420 pragma Inline
(Flag12
);
1422 function Flag13
(N
: Node_Id
) return Boolean;
1423 pragma Inline
(Flag13
);
1425 function Flag14
(N
: Node_Id
) return Boolean;
1426 pragma Inline
(Flag14
);
1428 function Flag15
(N
: Node_Id
) return Boolean;
1429 pragma Inline
(Flag15
);
1431 function Flag16
(N
: Node_Id
) return Boolean;
1432 pragma Inline
(Flag16
);
1434 function Flag17
(N
: Node_Id
) return Boolean;
1435 pragma Inline
(Flag17
);
1437 function Flag18
(N
: Node_Id
) return Boolean;
1438 pragma Inline
(Flag18
);
1440 function Flag19
(N
: Node_Id
) return Boolean;
1441 pragma Inline
(Flag19
);
1443 function Flag20
(N
: Node_Id
) return Boolean;
1444 pragma Inline
(Flag20
);
1446 function Flag21
(N
: Node_Id
) return Boolean;
1447 pragma Inline
(Flag21
);
1449 function Flag22
(N
: Node_Id
) return Boolean;
1450 pragma Inline
(Flag22
);
1452 function Flag23
(N
: Node_Id
) return Boolean;
1453 pragma Inline
(Flag23
);
1455 function Flag24
(N
: Node_Id
) return Boolean;
1456 pragma Inline
(Flag24
);
1458 function Flag25
(N
: Node_Id
) return Boolean;
1459 pragma Inline
(Flag25
);
1461 function Flag26
(N
: Node_Id
) return Boolean;
1462 pragma Inline
(Flag26
);
1464 function Flag27
(N
: Node_Id
) return Boolean;
1465 pragma Inline
(Flag27
);
1467 function Flag28
(N
: Node_Id
) return Boolean;
1468 pragma Inline
(Flag28
);
1470 function Flag29
(N
: Node_Id
) return Boolean;
1471 pragma Inline
(Flag29
);
1473 function Flag30
(N
: Node_Id
) return Boolean;
1474 pragma Inline
(Flag30
);
1476 function Flag31
(N
: Node_Id
) return Boolean;
1477 pragma Inline
(Flag31
);
1479 function Flag32
(N
: Node_Id
) return Boolean;
1480 pragma Inline
(Flag32
);
1482 function Flag33
(N
: Node_Id
) return Boolean;
1483 pragma Inline
(Flag33
);
1485 function Flag34
(N
: Node_Id
) return Boolean;
1486 pragma Inline
(Flag34
);
1488 function Flag35
(N
: Node_Id
) return Boolean;
1489 pragma Inline
(Flag35
);
1491 function Flag36
(N
: Node_Id
) return Boolean;
1492 pragma Inline
(Flag36
);
1494 function Flag37
(N
: Node_Id
) return Boolean;
1495 pragma Inline
(Flag37
);
1497 function Flag38
(N
: Node_Id
) return Boolean;
1498 pragma Inline
(Flag38
);
1500 function Flag39
(N
: Node_Id
) return Boolean;
1501 pragma Inline
(Flag39
);
1503 function Flag40
(N
: Node_Id
) return Boolean;
1504 pragma Inline
(Flag40
);
1506 function Flag41
(N
: Node_Id
) return Boolean;
1507 pragma Inline
(Flag41
);
1509 function Flag42
(N
: Node_Id
) return Boolean;
1510 pragma Inline
(Flag42
);
1512 function Flag43
(N
: Node_Id
) return Boolean;
1513 pragma Inline
(Flag43
);
1515 function Flag44
(N
: Node_Id
) return Boolean;
1516 pragma Inline
(Flag44
);
1518 function Flag45
(N
: Node_Id
) return Boolean;
1519 pragma Inline
(Flag45
);
1521 function Flag46
(N
: Node_Id
) return Boolean;
1522 pragma Inline
(Flag46
);
1524 function Flag47
(N
: Node_Id
) return Boolean;
1525 pragma Inline
(Flag47
);
1527 function Flag48
(N
: Node_Id
) return Boolean;
1528 pragma Inline
(Flag48
);
1530 function Flag49
(N
: Node_Id
) return Boolean;
1531 pragma Inline
(Flag49
);
1533 function Flag50
(N
: Node_Id
) return Boolean;
1534 pragma Inline
(Flag50
);
1536 function Flag51
(N
: Node_Id
) return Boolean;
1537 pragma Inline
(Flag51
);
1539 function Flag52
(N
: Node_Id
) return Boolean;
1540 pragma Inline
(Flag52
);
1542 function Flag53
(N
: Node_Id
) return Boolean;
1543 pragma Inline
(Flag53
);
1545 function Flag54
(N
: Node_Id
) return Boolean;
1546 pragma Inline
(Flag54
);
1548 function Flag55
(N
: Node_Id
) return Boolean;
1549 pragma Inline
(Flag55
);
1551 function Flag56
(N
: Node_Id
) return Boolean;
1552 pragma Inline
(Flag56
);
1554 function Flag57
(N
: Node_Id
) return Boolean;
1555 pragma Inline
(Flag57
);
1557 function Flag58
(N
: Node_Id
) return Boolean;
1558 pragma Inline
(Flag58
);
1560 function Flag59
(N
: Node_Id
) return Boolean;
1561 pragma Inline
(Flag59
);
1563 function Flag60
(N
: Node_Id
) return Boolean;
1564 pragma Inline
(Flag60
);
1566 function Flag61
(N
: Node_Id
) return Boolean;
1567 pragma Inline
(Flag61
);
1569 function Flag62
(N
: Node_Id
) return Boolean;
1570 pragma Inline
(Flag62
);
1572 function Flag63
(N
: Node_Id
) return Boolean;
1573 pragma Inline
(Flag63
);
1575 function Flag64
(N
: Node_Id
) return Boolean;
1576 pragma Inline
(Flag64
);
1578 function Flag65
(N
: Node_Id
) return Boolean;
1579 pragma Inline
(Flag65
);
1581 function Flag66
(N
: Node_Id
) return Boolean;
1582 pragma Inline
(Flag66
);
1584 function Flag67
(N
: Node_Id
) return Boolean;
1585 pragma Inline
(Flag67
);
1587 function Flag68
(N
: Node_Id
) return Boolean;
1588 pragma Inline
(Flag68
);
1590 function Flag69
(N
: Node_Id
) return Boolean;
1591 pragma Inline
(Flag69
);
1593 function Flag70
(N
: Node_Id
) return Boolean;
1594 pragma Inline
(Flag70
);
1596 function Flag71
(N
: Node_Id
) return Boolean;
1597 pragma Inline
(Flag71
);
1599 function Flag72
(N
: Node_Id
) return Boolean;
1600 pragma Inline
(Flag72
);
1602 function Flag73
(N
: Node_Id
) return Boolean;
1603 pragma Inline
(Flag73
);
1605 function Flag74
(N
: Node_Id
) return Boolean;
1606 pragma Inline
(Flag74
);
1608 function Flag75
(N
: Node_Id
) return Boolean;
1609 pragma Inline
(Flag75
);
1611 function Flag76
(N
: Node_Id
) return Boolean;
1612 pragma Inline
(Flag76
);
1614 function Flag77
(N
: Node_Id
) return Boolean;
1615 pragma Inline
(Flag77
);
1617 function Flag78
(N
: Node_Id
) return Boolean;
1618 pragma Inline
(Flag78
);
1620 function Flag79
(N
: Node_Id
) return Boolean;
1621 pragma Inline
(Flag79
);
1623 function Flag80
(N
: Node_Id
) return Boolean;
1624 pragma Inline
(Flag80
);
1626 function Flag81
(N
: Node_Id
) return Boolean;
1627 pragma Inline
(Flag81
);
1629 function Flag82
(N
: Node_Id
) return Boolean;
1630 pragma Inline
(Flag82
);
1632 function Flag83
(N
: Node_Id
) return Boolean;
1633 pragma Inline
(Flag83
);
1635 function Flag84
(N
: Node_Id
) return Boolean;
1636 pragma Inline
(Flag84
);
1638 function Flag85
(N
: Node_Id
) return Boolean;
1639 pragma Inline
(Flag85
);
1641 function Flag86
(N
: Node_Id
) return Boolean;
1642 pragma Inline
(Flag86
);
1644 function Flag87
(N
: Node_Id
) return Boolean;
1645 pragma Inline
(Flag87
);
1647 function Flag88
(N
: Node_Id
) return Boolean;
1648 pragma Inline
(Flag88
);
1650 function Flag89
(N
: Node_Id
) return Boolean;
1651 pragma Inline
(Flag89
);
1653 function Flag90
(N
: Node_Id
) return Boolean;
1654 pragma Inline
(Flag90
);
1656 function Flag91
(N
: Node_Id
) return Boolean;
1657 pragma Inline
(Flag91
);
1659 function Flag92
(N
: Node_Id
) return Boolean;
1660 pragma Inline
(Flag92
);
1662 function Flag93
(N
: Node_Id
) return Boolean;
1663 pragma Inline
(Flag93
);
1665 function Flag94
(N
: Node_Id
) return Boolean;
1666 pragma Inline
(Flag94
);
1668 function Flag95
(N
: Node_Id
) return Boolean;
1669 pragma Inline
(Flag95
);
1671 function Flag96
(N
: Node_Id
) return Boolean;
1672 pragma Inline
(Flag96
);
1674 function Flag97
(N
: Node_Id
) return Boolean;
1675 pragma Inline
(Flag97
);
1677 function Flag98
(N
: Node_Id
) return Boolean;
1678 pragma Inline
(Flag98
);
1680 function Flag99
(N
: Node_Id
) return Boolean;
1681 pragma Inline
(Flag99
);
1683 function Flag100
(N
: Node_Id
) return Boolean;
1684 pragma Inline
(Flag100
);
1686 function Flag101
(N
: Node_Id
) return Boolean;
1687 pragma Inline
(Flag101
);
1689 function Flag102
(N
: Node_Id
) return Boolean;
1690 pragma Inline
(Flag102
);
1692 function Flag103
(N
: Node_Id
) return Boolean;
1693 pragma Inline
(Flag103
);
1695 function Flag104
(N
: Node_Id
) return Boolean;
1696 pragma Inline
(Flag104
);
1698 function Flag105
(N
: Node_Id
) return Boolean;
1699 pragma Inline
(Flag105
);
1701 function Flag106
(N
: Node_Id
) return Boolean;
1702 pragma Inline
(Flag106
);
1704 function Flag107
(N
: Node_Id
) return Boolean;
1705 pragma Inline
(Flag107
);
1707 function Flag108
(N
: Node_Id
) return Boolean;
1708 pragma Inline
(Flag108
);
1710 function Flag109
(N
: Node_Id
) return Boolean;
1711 pragma Inline
(Flag109
);
1713 function Flag110
(N
: Node_Id
) return Boolean;
1714 pragma Inline
(Flag110
);
1716 function Flag111
(N
: Node_Id
) return Boolean;
1717 pragma Inline
(Flag111
);
1719 function Flag112
(N
: Node_Id
) return Boolean;
1720 pragma Inline
(Flag112
);
1722 function Flag113
(N
: Node_Id
) return Boolean;
1723 pragma Inline
(Flag113
);
1725 function Flag114
(N
: Node_Id
) return Boolean;
1726 pragma Inline
(Flag114
);
1728 function Flag115
(N
: Node_Id
) return Boolean;
1729 pragma Inline
(Flag115
);
1731 function Flag116
(N
: Node_Id
) return Boolean;
1732 pragma Inline
(Flag116
);
1734 function Flag117
(N
: Node_Id
) return Boolean;
1735 pragma Inline
(Flag117
);
1737 function Flag118
(N
: Node_Id
) return Boolean;
1738 pragma Inline
(Flag118
);
1740 function Flag119
(N
: Node_Id
) return Boolean;
1741 pragma Inline
(Flag119
);
1743 function Flag120
(N
: Node_Id
) return Boolean;
1744 pragma Inline
(Flag120
);
1746 function Flag121
(N
: Node_Id
) return Boolean;
1747 pragma Inline
(Flag121
);
1749 function Flag122
(N
: Node_Id
) return Boolean;
1750 pragma Inline
(Flag122
);
1752 function Flag123
(N
: Node_Id
) return Boolean;
1753 pragma Inline
(Flag123
);
1755 function Flag124
(N
: Node_Id
) return Boolean;
1756 pragma Inline
(Flag124
);
1758 function Flag125
(N
: Node_Id
) return Boolean;
1759 pragma Inline
(Flag125
);
1761 function Flag126
(N
: Node_Id
) return Boolean;
1762 pragma Inline
(Flag126
);
1764 function Flag127
(N
: Node_Id
) return Boolean;
1765 pragma Inline
(Flag127
);
1767 function Flag128
(N
: Node_Id
) return Boolean;
1768 pragma Inline
(Flag128
);
1770 function Flag129
(N
: Node_Id
) return Boolean;
1771 pragma Inline
(Flag129
);
1773 function Flag130
(N
: Node_Id
) return Boolean;
1774 pragma Inline
(Flag130
);
1776 function Flag131
(N
: Node_Id
) return Boolean;
1777 pragma Inline
(Flag131
);
1779 function Flag132
(N
: Node_Id
) return Boolean;
1780 pragma Inline
(Flag132
);
1782 function Flag133
(N
: Node_Id
) return Boolean;
1783 pragma Inline
(Flag133
);
1785 function Flag134
(N
: Node_Id
) return Boolean;
1786 pragma Inline
(Flag134
);
1788 function Flag135
(N
: Node_Id
) return Boolean;
1789 pragma Inline
(Flag135
);
1791 function Flag136
(N
: Node_Id
) return Boolean;
1792 pragma Inline
(Flag136
);
1794 function Flag137
(N
: Node_Id
) return Boolean;
1795 pragma Inline
(Flag137
);
1797 function Flag138
(N
: Node_Id
) return Boolean;
1798 pragma Inline
(Flag138
);
1800 function Flag139
(N
: Node_Id
) return Boolean;
1801 pragma Inline
(Flag139
);
1803 function Flag140
(N
: Node_Id
) return Boolean;
1804 pragma Inline
(Flag140
);
1806 function Flag141
(N
: Node_Id
) return Boolean;
1807 pragma Inline
(Flag141
);
1809 function Flag142
(N
: Node_Id
) return Boolean;
1810 pragma Inline
(Flag142
);
1812 function Flag143
(N
: Node_Id
) return Boolean;
1813 pragma Inline
(Flag143
);
1815 function Flag144
(N
: Node_Id
) return Boolean;
1816 pragma Inline
(Flag144
);
1818 function Flag145
(N
: Node_Id
) return Boolean;
1819 pragma Inline
(Flag145
);
1821 function Flag146
(N
: Node_Id
) return Boolean;
1822 pragma Inline
(Flag146
);
1824 function Flag147
(N
: Node_Id
) return Boolean;
1825 pragma Inline
(Flag147
);
1827 function Flag148
(N
: Node_Id
) return Boolean;
1828 pragma Inline
(Flag148
);
1830 function Flag149
(N
: Node_Id
) return Boolean;
1831 pragma Inline
(Flag149
);
1833 function Flag150
(N
: Node_Id
) return Boolean;
1834 pragma Inline
(Flag150
);
1836 function Flag151
(N
: Node_Id
) return Boolean;
1837 pragma Inline
(Flag151
);
1839 function Flag152
(N
: Node_Id
) return Boolean;
1840 pragma Inline
(Flag152
);
1842 function Flag153
(N
: Node_Id
) return Boolean;
1843 pragma Inline
(Flag153
);
1845 function Flag154
(N
: Node_Id
) return Boolean;
1846 pragma Inline
(Flag154
);
1848 function Flag155
(N
: Node_Id
) return Boolean;
1849 pragma Inline
(Flag155
);
1851 function Flag156
(N
: Node_Id
) return Boolean;
1852 pragma Inline
(Flag156
);
1854 function Flag157
(N
: Node_Id
) return Boolean;
1855 pragma Inline
(Flag157
);
1857 function Flag158
(N
: Node_Id
) return Boolean;
1858 pragma Inline
(Flag158
);
1860 function Flag159
(N
: Node_Id
) return Boolean;
1861 pragma Inline
(Flag159
);
1863 function Flag160
(N
: Node_Id
) return Boolean;
1864 pragma Inline
(Flag160
);
1866 function Flag161
(N
: Node_Id
) return Boolean;
1867 pragma Inline
(Flag161
);
1869 function Flag162
(N
: Node_Id
) return Boolean;
1870 pragma Inline
(Flag162
);
1872 function Flag163
(N
: Node_Id
) return Boolean;
1873 pragma Inline
(Flag163
);
1875 function Flag164
(N
: Node_Id
) return Boolean;
1876 pragma Inline
(Flag164
);
1878 function Flag165
(N
: Node_Id
) return Boolean;
1879 pragma Inline
(Flag165
);
1881 function Flag166
(N
: Node_Id
) return Boolean;
1882 pragma Inline
(Flag166
);
1884 function Flag167
(N
: Node_Id
) return Boolean;
1885 pragma Inline
(Flag167
);
1887 function Flag168
(N
: Node_Id
) return Boolean;
1888 pragma Inline
(Flag168
);
1890 function Flag169
(N
: Node_Id
) return Boolean;
1891 pragma Inline
(Flag169
);
1893 function Flag170
(N
: Node_Id
) return Boolean;
1894 pragma Inline
(Flag170
);
1896 function Flag171
(N
: Node_Id
) return Boolean;
1897 pragma Inline
(Flag171
);
1899 function Flag172
(N
: Node_Id
) return Boolean;
1900 pragma Inline
(Flag172
);
1902 function Flag173
(N
: Node_Id
) return Boolean;
1903 pragma Inline
(Flag173
);
1905 function Flag174
(N
: Node_Id
) return Boolean;
1906 pragma Inline
(Flag174
);
1908 function Flag175
(N
: Node_Id
) return Boolean;
1909 pragma Inline
(Flag175
);
1911 function Flag176
(N
: Node_Id
) return Boolean;
1912 pragma Inline
(Flag176
);
1914 function Flag177
(N
: Node_Id
) return Boolean;
1915 pragma Inline
(Flag177
);
1917 function Flag178
(N
: Node_Id
) return Boolean;
1918 pragma Inline
(Flag178
);
1920 function Flag179
(N
: Node_Id
) return Boolean;
1921 pragma Inline
(Flag179
);
1923 function Flag180
(N
: Node_Id
) return Boolean;
1924 pragma Inline
(Flag180
);
1926 function Flag181
(N
: Node_Id
) return Boolean;
1927 pragma Inline
(Flag181
);
1929 function Flag182
(N
: Node_Id
) return Boolean;
1930 pragma Inline
(Flag182
);
1932 function Flag183
(N
: Node_Id
) return Boolean;
1933 pragma Inline
(Flag183
);
1935 function Flag184
(N
: Node_Id
) return Boolean;
1936 pragma Inline
(Flag184
);
1938 function Flag185
(N
: Node_Id
) return Boolean;
1939 pragma Inline
(Flag185
);
1941 function Flag186
(N
: Node_Id
) return Boolean;
1942 pragma Inline
(Flag186
);
1944 function Flag187
(N
: Node_Id
) return Boolean;
1945 pragma Inline
(Flag187
);
1947 function Flag188
(N
: Node_Id
) return Boolean;
1948 pragma Inline
(Flag188
);
1950 function Flag189
(N
: Node_Id
) return Boolean;
1951 pragma Inline
(Flag189
);
1953 function Flag190
(N
: Node_Id
) return Boolean;
1954 pragma Inline
(Flag190
);
1956 function Flag191
(N
: Node_Id
) return Boolean;
1957 pragma Inline
(Flag191
);
1959 function Flag192
(N
: Node_Id
) return Boolean;
1960 pragma Inline
(Flag192
);
1962 function Flag193
(N
: Node_Id
) return Boolean;
1963 pragma Inline
(Flag193
);
1965 function Flag194
(N
: Node_Id
) return Boolean;
1966 pragma Inline
(Flag194
);
1968 function Flag195
(N
: Node_Id
) return Boolean;
1969 pragma Inline
(Flag195
);
1971 function Flag196
(N
: Node_Id
) return Boolean;
1972 pragma Inline
(Flag196
);
1974 function Flag197
(N
: Node_Id
) return Boolean;
1975 pragma Inline
(Flag197
);
1977 function Flag198
(N
: Node_Id
) return Boolean;
1978 pragma Inline
(Flag198
);
1980 function Flag199
(N
: Node_Id
) return Boolean;
1981 pragma Inline
(Flag199
);
1983 function Flag200
(N
: Node_Id
) return Boolean;
1984 pragma Inline
(Flag200
);
1986 function Flag201
(N
: Node_Id
) return Boolean;
1987 pragma Inline
(Flag201
);
1989 function Flag202
(N
: Node_Id
) return Boolean;
1990 pragma Inline
(Flag202
);
1992 function Flag203
(N
: Node_Id
) return Boolean;
1993 pragma Inline
(Flag203
);
1995 function Flag204
(N
: Node_Id
) return Boolean;
1996 pragma Inline
(Flag204
);
1998 function Flag205
(N
: Node_Id
) return Boolean;
1999 pragma Inline
(Flag205
);
2001 function Flag206
(N
: Node_Id
) return Boolean;
2002 pragma Inline
(Flag206
);
2004 function Flag207
(N
: Node_Id
) return Boolean;
2005 pragma Inline
(Flag207
);
2007 function Flag208
(N
: Node_Id
) return Boolean;
2008 pragma Inline
(Flag208
);
2010 function Flag209
(N
: Node_Id
) return Boolean;
2011 pragma Inline
(Flag209
);
2013 function Flag210
(N
: Node_Id
) return Boolean;
2014 pragma Inline
(Flag210
);
2016 function Flag211
(N
: Node_Id
) return Boolean;
2017 pragma Inline
(Flag211
);
2019 function Flag212
(N
: Node_Id
) return Boolean;
2020 pragma Inline
(Flag212
);
2022 function Flag213
(N
: Node_Id
) return Boolean;
2023 pragma Inline
(Flag213
);
2025 function Flag214
(N
: Node_Id
) return Boolean;
2026 pragma Inline
(Flag214
);
2028 function Flag215
(N
: Node_Id
) return Boolean;
2029 pragma Inline
(Flag215
);
2031 function Flag216
(N
: Node_Id
) return Boolean;
2032 pragma Inline
(Flag216
);
2034 function Flag217
(N
: Node_Id
) return Boolean;
2035 pragma Inline
(Flag217
);
2037 function Flag218
(N
: Node_Id
) return Boolean;
2038 pragma Inline
(Flag218
);
2040 function Flag219
(N
: Node_Id
) return Boolean;
2041 pragma Inline
(Flag219
);
2043 function Flag220
(N
: Node_Id
) return Boolean;
2044 pragma Inline
(Flag220
);
2046 function Flag221
(N
: Node_Id
) return Boolean;
2047 pragma Inline
(Flag221
);
2049 function Flag222
(N
: Node_Id
) return Boolean;
2050 pragma Inline
(Flag222
);
2052 function Flag223
(N
: Node_Id
) return Boolean;
2053 pragma Inline
(Flag223
);
2055 function Flag224
(N
: Node_Id
) return Boolean;
2056 pragma Inline
(Flag224
);
2058 function Flag225
(N
: Node_Id
) return Boolean;
2059 pragma Inline
(Flag225
);
2061 function Flag226
(N
: Node_Id
) return Boolean;
2062 pragma Inline
(Flag226
);
2064 function Flag227
(N
: Node_Id
) return Boolean;
2065 pragma Inline
(Flag227
);
2067 function Flag228
(N
: Node_Id
) return Boolean;
2068 pragma Inline
(Flag228
);
2070 function Flag229
(N
: Node_Id
) return Boolean;
2071 pragma Inline
(Flag229
);
2073 function Flag230
(N
: Node_Id
) return Boolean;
2074 pragma Inline
(Flag230
);
2076 function Flag231
(N
: Node_Id
) return Boolean;
2077 pragma Inline
(Flag231
);
2079 function Flag232
(N
: Node_Id
) return Boolean;
2080 pragma Inline
(Flag232
);
2082 function Flag233
(N
: Node_Id
) return Boolean;
2083 pragma Inline
(Flag233
);
2085 function Flag234
(N
: Node_Id
) return Boolean;
2086 pragma Inline
(Flag234
);
2088 function Flag235
(N
: Node_Id
) return Boolean;
2089 pragma Inline
(Flag235
);
2091 function Flag236
(N
: Node_Id
) return Boolean;
2092 pragma Inline
(Flag236
);
2094 function Flag237
(N
: Node_Id
) return Boolean;
2095 pragma Inline
(Flag237
);
2097 function Flag238
(N
: Node_Id
) return Boolean;
2098 pragma Inline
(Flag238
);
2100 function Flag239
(N
: Node_Id
) return Boolean;
2101 pragma Inline
(Flag239
);
2103 function Flag240
(N
: Node_Id
) return Boolean;
2104 pragma Inline
(Flag240
);
2106 function Flag241
(N
: Node_Id
) return Boolean;
2107 pragma Inline
(Flag241
);
2109 function Flag242
(N
: Node_Id
) return Boolean;
2110 pragma Inline
(Flag242
);
2112 function Flag243
(N
: Node_Id
) return Boolean;
2113 pragma Inline
(Flag243
);
2115 function Flag244
(N
: Node_Id
) return Boolean;
2116 pragma Inline
(Flag244
);
2118 function Flag245
(N
: Node_Id
) return Boolean;
2119 pragma Inline
(Flag245
);
2121 function Flag246
(N
: Node_Id
) return Boolean;
2122 pragma Inline
(Flag246
);
2124 function Flag247
(N
: Node_Id
) return Boolean;
2125 pragma Inline
(Flag247
);
2127 function Flag248
(N
: Node_Id
) return Boolean;
2128 pragma Inline
(Flag248
);
2130 function Flag249
(N
: Node_Id
) return Boolean;
2131 pragma Inline
(Flag249
);
2133 function Flag250
(N
: Node_Id
) return Boolean;
2134 pragma Inline
(Flag250
);
2136 function Flag251
(N
: Node_Id
) return Boolean;
2137 pragma Inline
(Flag251
);
2139 function Flag252
(N
: Node_Id
) return Boolean;
2140 pragma Inline
(Flag252
);
2142 function Flag253
(N
: Node_Id
) return Boolean;
2143 pragma Inline
(Flag253
);
2145 function Flag254
(N
: Node_Id
) return Boolean;
2146 pragma Inline
(Flag254
);
2148 function Flag255
(N
: Node_Id
) return Boolean;
2149 pragma Inline
(Flag255
);
2151 function Flag256
(N
: Node_Id
) return Boolean;
2152 pragma Inline
(Flag256
);
2154 function Flag257
(N
: Node_Id
) return Boolean;
2155 pragma Inline
(Flag257
);
2157 function Flag258
(N
: Node_Id
) return Boolean;
2158 pragma Inline
(Flag258
);
2160 function Flag259
(N
: Node_Id
) return Boolean;
2161 pragma Inline
(Flag259
);
2163 function Flag260
(N
: Node_Id
) return Boolean;
2164 pragma Inline
(Flag260
);
2166 function Flag261
(N
: Node_Id
) return Boolean;
2167 pragma Inline
(Flag261
);
2169 function Flag262
(N
: Node_Id
) return Boolean;
2170 pragma Inline
(Flag262
);
2172 function Flag263
(N
: Node_Id
) return Boolean;
2173 pragma Inline
(Flag263
);
2175 function Flag264
(N
: Node_Id
) return Boolean;
2176 pragma Inline
(Flag264
);
2178 function Flag265
(N
: Node_Id
) return Boolean;
2179 pragma Inline
(Flag265
);
2181 function Flag266
(N
: Node_Id
) return Boolean;
2182 pragma Inline
(Flag266
);
2184 function Flag267
(N
: Node_Id
) return Boolean;
2185 pragma Inline
(Flag267
);
2187 function Flag268
(N
: Node_Id
) return Boolean;
2188 pragma Inline
(Flag268
);
2190 function Flag269
(N
: Node_Id
) return Boolean;
2191 pragma Inline
(Flag269
);
2193 function Flag270
(N
: Node_Id
) return Boolean;
2194 pragma Inline
(Flag270
);
2196 function Flag271
(N
: Node_Id
) return Boolean;
2197 pragma Inline
(Flag271
);
2199 function Flag272
(N
: Node_Id
) return Boolean;
2200 pragma Inline
(Flag272
);
2202 function Flag273
(N
: Node_Id
) return Boolean;
2203 pragma Inline
(Flag273
);
2205 function Flag274
(N
: Node_Id
) return Boolean;
2206 pragma Inline
(Flag274
);
2208 function Flag275
(N
: Node_Id
) return Boolean;
2209 pragma Inline
(Flag275
);
2211 function Flag276
(N
: Node_Id
) return Boolean;
2212 pragma Inline
(Flag276
);
2214 function Flag277
(N
: Node_Id
) return Boolean;
2215 pragma Inline
(Flag277
);
2217 function Flag278
(N
: Node_Id
) return Boolean;
2218 pragma Inline
(Flag278
);
2220 function Flag279
(N
: Node_Id
) return Boolean;
2221 pragma Inline
(Flag279
);
2223 function Flag280
(N
: Node_Id
) return Boolean;
2224 pragma Inline
(Flag280
);
2226 function Flag281
(N
: Node_Id
) return Boolean;
2227 pragma Inline
(Flag281
);
2229 function Flag282
(N
: Node_Id
) return Boolean;
2230 pragma Inline
(Flag282
);
2232 function Flag283
(N
: Node_Id
) return Boolean;
2233 pragma Inline
(Flag283
);
2235 function Flag284
(N
: Node_Id
) return Boolean;
2236 pragma Inline
(Flag284
);
2238 function Flag285
(N
: Node_Id
) return Boolean;
2239 pragma Inline
(Flag285
);
2241 function Flag286
(N
: Node_Id
) return Boolean;
2242 pragma Inline
(Flag286
);
2244 function Flag287
(N
: Node_Id
) return Boolean;
2245 pragma Inline
(Flag287
);
2247 function Flag288
(N
: Node_Id
) return Boolean;
2248 pragma Inline
(Flag288
);
2250 function Flag289
(N
: Node_Id
) return Boolean;
2251 pragma Inline
(Flag289
);
2253 function Flag290
(N
: Node_Id
) return Boolean;
2254 pragma Inline
(Flag290
);
2256 function Flag291
(N
: Node_Id
) return Boolean;
2257 pragma Inline
(Flag291
);
2259 function Flag292
(N
: Node_Id
) return Boolean;
2260 pragma Inline
(Flag292
);
2262 function Flag293
(N
: Node_Id
) return Boolean;
2263 pragma Inline
(Flag293
);
2265 function Flag294
(N
: Node_Id
) return Boolean;
2266 pragma Inline
(Flag294
);
2268 function Flag295
(N
: Node_Id
) return Boolean;
2269 pragma Inline
(Flag295
);
2271 function Flag296
(N
: Node_Id
) return Boolean;
2272 pragma Inline
(Flag296
);
2274 function Flag297
(N
: Node_Id
) return Boolean;
2275 pragma Inline
(Flag297
);
2277 function Flag298
(N
: Node_Id
) return Boolean;
2278 pragma Inline
(Flag298
);
2280 function Flag299
(N
: Node_Id
) return Boolean;
2281 pragma Inline
(Flag299
);
2283 function Flag300
(N
: Node_Id
) return Boolean;
2284 pragma Inline
(Flag300
);
2286 function Flag301
(N
: Node_Id
) return Boolean;
2287 pragma Inline
(Flag301
);
2289 function Flag302
(N
: Node_Id
) return Boolean;
2290 pragma Inline
(Flag302
);
2292 function Flag303
(N
: Node_Id
) return Boolean;
2293 pragma Inline
(Flag303
);
2295 function Flag304
(N
: Node_Id
) return Boolean;
2296 pragma Inline
(Flag304
);
2298 function Flag305
(N
: Node_Id
) return Boolean;
2299 pragma Inline
(Flag305
);
2301 function Flag306
(N
: Node_Id
) return Boolean;
2302 pragma Inline
(Flag306
);
2304 function Flag307
(N
: Node_Id
) return Boolean;
2305 pragma Inline
(Flag307
);
2307 function Flag308
(N
: Node_Id
) return Boolean;
2308 pragma Inline
(Flag308
);
2310 function Flag309
(N
: Node_Id
) return Boolean;
2311 pragma Inline
(Flag309
);
2313 function Flag310
(N
: Node_Id
) return Boolean;
2314 pragma Inline
(Flag310
);
2316 function Flag311
(N
: Node_Id
) return Boolean;
2317 pragma Inline
(Flag311
);
2319 function Flag312
(N
: Node_Id
) return Boolean;
2320 pragma Inline
(Flag312
);
2322 function Flag313
(N
: Node_Id
) return Boolean;
2323 pragma Inline
(Flag313
);
2325 function Flag314
(N
: Node_Id
) return Boolean;
2326 pragma Inline
(Flag314
);
2328 function Flag315
(N
: Node_Id
) return Boolean;
2329 pragma Inline
(Flag315
);
2331 function Flag316
(N
: Node_Id
) return Boolean;
2332 pragma Inline
(Flag316
);
2334 function Flag317
(N
: Node_Id
) return Boolean;
2335 pragma Inline
(Flag317
);
2337 -- Procedures to set value of indicated field
2339 procedure Set_Nkind
(N
: Node_Id
; Val
: Node_Kind
);
2340 pragma Inline
(Set_Nkind
);
2342 procedure Set_Field1
(N
: Node_Id
; Val
: Union_Id
);
2343 pragma Inline
(Set_Field1
);
2345 procedure Set_Field2
(N
: Node_Id
; Val
: Union_Id
);
2346 pragma Inline
(Set_Field2
);
2348 procedure Set_Field3
(N
: Node_Id
; Val
: Union_Id
);
2349 pragma Inline
(Set_Field3
);
2351 procedure Set_Field4
(N
: Node_Id
; Val
: Union_Id
);
2352 pragma Inline
(Set_Field4
);
2354 procedure Set_Field5
(N
: Node_Id
; Val
: Union_Id
);
2355 pragma Inline
(Set_Field5
);
2357 procedure Set_Field6
(N
: Node_Id
; Val
: Union_Id
);
2358 pragma Inline
(Set_Field6
);
2360 procedure Set_Field7
(N
: Node_Id
; Val
: Union_Id
);
2361 pragma Inline
(Set_Field7
);
2363 procedure Set_Field8
(N
: Node_Id
; Val
: Union_Id
);
2364 pragma Inline
(Set_Field8
);
2366 procedure Set_Field9
(N
: Node_Id
; Val
: Union_Id
);
2367 pragma Inline
(Set_Field9
);
2369 procedure Set_Field10
(N
: Node_Id
; Val
: Union_Id
);
2370 pragma Inline
(Set_Field10
);
2372 procedure Set_Field11
(N
: Node_Id
; Val
: Union_Id
);
2373 pragma Inline
(Set_Field11
);
2375 procedure Set_Field12
(N
: Node_Id
; Val
: Union_Id
);
2376 pragma Inline
(Set_Field12
);
2378 procedure Set_Field13
(N
: Node_Id
; Val
: Union_Id
);
2379 pragma Inline
(Set_Field13
);
2381 procedure Set_Field14
(N
: Node_Id
; Val
: Union_Id
);
2382 pragma Inline
(Set_Field14
);
2384 procedure Set_Field15
(N
: Node_Id
; Val
: Union_Id
);
2385 pragma Inline
(Set_Field15
);
2387 procedure Set_Field16
(N
: Node_Id
; Val
: Union_Id
);
2388 pragma Inline
(Set_Field16
);
2390 procedure Set_Field17
(N
: Node_Id
; Val
: Union_Id
);
2391 pragma Inline
(Set_Field17
);
2393 procedure Set_Field18
(N
: Node_Id
; Val
: Union_Id
);
2394 pragma Inline
(Set_Field18
);
2396 procedure Set_Field19
(N
: Node_Id
; Val
: Union_Id
);
2397 pragma Inline
(Set_Field19
);
2399 procedure Set_Field20
(N
: Node_Id
; Val
: Union_Id
);
2400 pragma Inline
(Set_Field20
);
2402 procedure Set_Field21
(N
: Node_Id
; Val
: Union_Id
);
2403 pragma Inline
(Set_Field21
);
2405 procedure Set_Field22
(N
: Node_Id
; Val
: Union_Id
);
2406 pragma Inline
(Set_Field22
);
2408 procedure Set_Field23
(N
: Node_Id
; Val
: Union_Id
);
2409 pragma Inline
(Set_Field23
);
2411 procedure Set_Field24
(N
: Node_Id
; Val
: Union_Id
);
2412 pragma Inline
(Set_Field24
);
2414 procedure Set_Field25
(N
: Node_Id
; Val
: Union_Id
);
2415 pragma Inline
(Set_Field25
);
2417 procedure Set_Field26
(N
: Node_Id
; Val
: Union_Id
);
2418 pragma Inline
(Set_Field26
);
2420 procedure Set_Field27
(N
: Node_Id
; Val
: Union_Id
);
2421 pragma Inline
(Set_Field27
);
2423 procedure Set_Field28
(N
: Node_Id
; Val
: Union_Id
);
2424 pragma Inline
(Set_Field28
);
2426 procedure Set_Field29
(N
: Node_Id
; Val
: Union_Id
);
2427 pragma Inline
(Set_Field29
);
2429 procedure Set_Field30
(N
: Node_Id
; Val
: Union_Id
);
2430 pragma Inline
(Set_Field30
);
2432 procedure Set_Field31
(N
: Node_Id
; Val
: Union_Id
);
2433 pragma Inline
(Set_Field31
);
2435 procedure Set_Field32
(N
: Node_Id
; Val
: Union_Id
);
2436 pragma Inline
(Set_Field32
);
2438 procedure Set_Field33
(N
: Node_Id
; Val
: Union_Id
);
2439 pragma Inline
(Set_Field33
);
2441 procedure Set_Field34
(N
: Node_Id
; Val
: Union_Id
);
2442 pragma Inline
(Set_Field34
);
2444 procedure Set_Field35
(N
: Node_Id
; Val
: Union_Id
);
2445 pragma Inline
(Set_Field35
);
2447 procedure Set_Node1
(N
: Node_Id
; Val
: Node_Id
);
2448 pragma Inline
(Set_Node1
);
2450 procedure Set_Node2
(N
: Node_Id
; Val
: Node_Id
);
2451 pragma Inline
(Set_Node2
);
2453 procedure Set_Node3
(N
: Node_Id
; Val
: Node_Id
);
2454 pragma Inline
(Set_Node3
);
2456 procedure Set_Node4
(N
: Node_Id
; Val
: Node_Id
);
2457 pragma Inline
(Set_Node4
);
2459 procedure Set_Node5
(N
: Node_Id
; Val
: Node_Id
);
2460 pragma Inline
(Set_Node5
);
2462 procedure Set_Node6
(N
: Node_Id
; Val
: Node_Id
);
2463 pragma Inline
(Set_Node6
);
2465 procedure Set_Node7
(N
: Node_Id
; Val
: Node_Id
);
2466 pragma Inline
(Set_Node7
);
2468 procedure Set_Node8
(N
: Node_Id
; Val
: Node_Id
);
2469 pragma Inline
(Set_Node8
);
2471 procedure Set_Node9
(N
: Node_Id
; Val
: Node_Id
);
2472 pragma Inline
(Set_Node9
);
2474 procedure Set_Node10
(N
: Node_Id
; Val
: Node_Id
);
2475 pragma Inline
(Set_Node10
);
2477 procedure Set_Node11
(N
: Node_Id
; Val
: Node_Id
);
2478 pragma Inline
(Set_Node11
);
2480 procedure Set_Node12
(N
: Node_Id
; Val
: Node_Id
);
2481 pragma Inline
(Set_Node12
);
2483 procedure Set_Node13
(N
: Node_Id
; Val
: Node_Id
);
2484 pragma Inline
(Set_Node13
);
2486 procedure Set_Node14
(N
: Node_Id
; Val
: Node_Id
);
2487 pragma Inline
(Set_Node14
);
2489 procedure Set_Node15
(N
: Node_Id
; Val
: Node_Id
);
2490 pragma Inline
(Set_Node15
);
2492 procedure Set_Node16
(N
: Node_Id
; Val
: Node_Id
);
2493 pragma Inline
(Set_Node16
);
2495 procedure Set_Node17
(N
: Node_Id
; Val
: Node_Id
);
2496 pragma Inline
(Set_Node17
);
2498 procedure Set_Node18
(N
: Node_Id
; Val
: Node_Id
);
2499 pragma Inline
(Set_Node18
);
2501 procedure Set_Node19
(N
: Node_Id
; Val
: Node_Id
);
2502 pragma Inline
(Set_Node19
);
2504 procedure Set_Node20
(N
: Node_Id
; Val
: Node_Id
);
2505 pragma Inline
(Set_Node20
);
2507 procedure Set_Node21
(N
: Node_Id
; Val
: Node_Id
);
2508 pragma Inline
(Set_Node21
);
2510 procedure Set_Node22
(N
: Node_Id
; Val
: Node_Id
);
2511 pragma Inline
(Set_Node22
);
2513 procedure Set_Node23
(N
: Node_Id
; Val
: Node_Id
);
2514 pragma Inline
(Set_Node23
);
2516 procedure Set_Node24
(N
: Node_Id
; Val
: Node_Id
);
2517 pragma Inline
(Set_Node24
);
2519 procedure Set_Node25
(N
: Node_Id
; Val
: Node_Id
);
2520 pragma Inline
(Set_Node25
);
2522 procedure Set_Node26
(N
: Node_Id
; Val
: Node_Id
);
2523 pragma Inline
(Set_Node26
);
2525 procedure Set_Node27
(N
: Node_Id
; Val
: Node_Id
);
2526 pragma Inline
(Set_Node27
);
2528 procedure Set_Node28
(N
: Node_Id
; Val
: Node_Id
);
2529 pragma Inline
(Set_Node28
);
2531 procedure Set_Node29
(N
: Node_Id
; Val
: Node_Id
);
2532 pragma Inline
(Set_Node29
);
2534 procedure Set_Node30
(N
: Node_Id
; Val
: Node_Id
);
2535 pragma Inline
(Set_Node30
);
2537 procedure Set_Node31
(N
: Node_Id
; Val
: Node_Id
);
2538 pragma Inline
(Set_Node31
);
2540 procedure Set_Node32
(N
: Node_Id
; Val
: Node_Id
);
2541 pragma Inline
(Set_Node32
);
2543 procedure Set_Node33
(N
: Node_Id
; Val
: Node_Id
);
2544 pragma Inline
(Set_Node33
);
2546 procedure Set_Node34
(N
: Node_Id
; Val
: Node_Id
);
2547 pragma Inline
(Set_Node34
);
2549 procedure Set_List1
(N
: Node_Id
; Val
: List_Id
);
2550 pragma Inline
(Set_List1
);
2552 procedure Set_List2
(N
: Node_Id
; Val
: List_Id
);
2553 pragma Inline
(Set_List2
);
2555 procedure Set_List3
(N
: Node_Id
; Val
: List_Id
);
2556 pragma Inline
(Set_List3
);
2558 procedure Set_List4
(N
: Node_Id
; Val
: List_Id
);
2559 pragma Inline
(Set_List4
);
2561 procedure Set_List5
(N
: Node_Id
; Val
: List_Id
);
2562 pragma Inline
(Set_List5
);
2564 procedure Set_List10
(N
: Node_Id
; Val
: List_Id
);
2565 pragma Inline
(Set_List10
);
2567 procedure Set_List14
(N
: Node_Id
; Val
: List_Id
);
2568 pragma Inline
(Set_List14
);
2570 procedure Set_List25
(N
: Node_Id
; Val
: List_Id
);
2571 pragma Inline
(Set_List25
);
2573 procedure Set_Elist1
(N
: Node_Id
; Val
: Elist_Id
);
2574 pragma Inline
(Set_Elist1
);
2576 procedure Set_Elist2
(N
: Node_Id
; Val
: Elist_Id
);
2577 pragma Inline
(Set_Elist2
);
2579 procedure Set_Elist3
(N
: Node_Id
; Val
: Elist_Id
);
2580 pragma Inline
(Set_Elist3
);
2582 procedure Set_Elist4
(N
: Node_Id
; Val
: Elist_Id
);
2583 pragma Inline
(Set_Elist4
);
2585 procedure Set_Elist5
(N
: Node_Id
; Val
: Elist_Id
);
2586 pragma Inline
(Set_Elist5
);
2588 procedure Set_Elist8
(N
: Node_Id
; Val
: Elist_Id
);
2589 pragma Inline
(Set_Elist8
);
2591 procedure Set_Elist9
(N
: Node_Id
; Val
: Elist_Id
);
2592 pragma Inline
(Set_Elist9
);
2594 procedure Set_Elist10
(N
: Node_Id
; Val
: Elist_Id
);
2595 pragma Inline
(Set_Elist10
);
2597 procedure Set_Elist13
(N
: Node_Id
; Val
: Elist_Id
);
2598 pragma Inline
(Set_Elist13
);
2600 procedure Set_Elist15
(N
: Node_Id
; Val
: Elist_Id
);
2601 pragma Inline
(Set_Elist15
);
2603 procedure Set_Elist16
(N
: Node_Id
; Val
: Elist_Id
);
2604 pragma Inline
(Set_Elist16
);
2606 procedure Set_Elist18
(N
: Node_Id
; Val
: Elist_Id
);
2607 pragma Inline
(Set_Elist18
);
2609 procedure Set_Elist21
(N
: Node_Id
; Val
: Elist_Id
);
2610 pragma Inline
(Set_Elist21
);
2612 procedure Set_Elist23
(N
: Node_Id
; Val
: Elist_Id
);
2613 pragma Inline
(Set_Elist23
);
2615 procedure Set_Elist24
(N
: Node_Id
; Val
: Elist_Id
);
2616 pragma Inline
(Set_Elist24
);
2618 procedure Set_Elist25
(N
: Node_Id
; Val
: Elist_Id
);
2619 pragma Inline
(Set_Elist25
);
2621 procedure Set_Elist26
(N
: Node_Id
; Val
: Elist_Id
);
2622 pragma Inline
(Set_Elist26
);
2624 procedure Set_Name1
(N
: Node_Id
; Val
: Name_Id
);
2625 pragma Inline
(Set_Name1
);
2627 procedure Set_Name2
(N
: Node_Id
; Val
: Name_Id
);
2628 pragma Inline
(Set_Name2
);
2630 procedure Set_Str3
(N
: Node_Id
; Val
: String_Id
);
2631 pragma Inline
(Set_Str3
);
2633 procedure Set_Uint2
(N
: Node_Id
; Val
: Uint
);
2634 pragma Inline
(Set_Uint2
);
2636 procedure Set_Uint3
(N
: Node_Id
; Val
: Uint
);
2637 pragma Inline
(Set_Uint3
);
2639 procedure Set_Uint4
(N
: Node_Id
; Val
: Uint
);
2640 pragma Inline
(Set_Uint4
);
2642 procedure Set_Uint5
(N
: Node_Id
; Val
: Uint
);
2643 pragma Inline
(Set_Uint5
);
2645 procedure Set_Uint8
(N
: Node_Id
; Val
: Uint
);
2646 pragma Inline
(Set_Uint8
);
2648 procedure Set_Uint9
(N
: Node_Id
; Val
: Uint
);
2649 pragma Inline
(Set_Uint9
);
2651 procedure Set_Uint10
(N
: Node_Id
; Val
: Uint
);
2652 pragma Inline
(Set_Uint10
);
2654 procedure Set_Uint11
(N
: Node_Id
; Val
: Uint
);
2655 pragma Inline
(Set_Uint11
);
2657 procedure Set_Uint12
(N
: Node_Id
; Val
: Uint
);
2658 pragma Inline
(Set_Uint12
);
2660 procedure Set_Uint13
(N
: Node_Id
; Val
: Uint
);
2661 pragma Inline
(Set_Uint13
);
2663 procedure Set_Uint14
(N
: Node_Id
; Val
: Uint
);
2664 pragma Inline
(Set_Uint14
);
2666 procedure Set_Uint15
(N
: Node_Id
; Val
: Uint
);
2667 pragma Inline
(Set_Uint15
);
2669 procedure Set_Uint16
(N
: Node_Id
; Val
: Uint
);
2670 pragma Inline
(Set_Uint16
);
2672 procedure Set_Uint17
(N
: Node_Id
; Val
: Uint
);
2673 pragma Inline
(Set_Uint17
);
2675 procedure Set_Uint22
(N
: Node_Id
; Val
: Uint
);
2676 pragma Inline
(Set_Uint22
);
2678 procedure Set_Ureal3
(N
: Node_Id
; Val
: Ureal
);
2679 pragma Inline
(Set_Ureal3
);
2681 procedure Set_Ureal18
(N
: Node_Id
; Val
: Ureal
);
2682 pragma Inline
(Set_Ureal18
);
2684 procedure Set_Ureal21
(N
: Node_Id
; Val
: Ureal
);
2685 pragma Inline
(Set_Ureal21
);
2687 procedure Set_Flag0
(N
: Node_Id
; Val
: Boolean);
2688 pragma Inline
(Set_Flag0
);
2690 procedure Set_Flag1
(N
: Node_Id
; Val
: Boolean);
2691 pragma Inline
(Set_Flag1
);
2693 procedure Set_Flag2
(N
: Node_Id
; Val
: Boolean);
2694 pragma Inline
(Set_Flag2
);
2696 procedure Set_Flag3
(N
: Node_Id
; Val
: Boolean);
2697 pragma Inline
(Set_Flag3
);
2699 procedure Set_Flag4
(N
: Node_Id
; Val
: Boolean);
2700 pragma Inline
(Set_Flag4
);
2702 procedure Set_Flag5
(N
: Node_Id
; Val
: Boolean);
2703 pragma Inline
(Set_Flag5
);
2705 procedure Set_Flag6
(N
: Node_Id
; Val
: Boolean);
2706 pragma Inline
(Set_Flag6
);
2708 procedure Set_Flag7
(N
: Node_Id
; Val
: Boolean);
2709 pragma Inline
(Set_Flag7
);
2711 procedure Set_Flag8
(N
: Node_Id
; Val
: Boolean);
2712 pragma Inline
(Set_Flag8
);
2714 procedure Set_Flag9
(N
: Node_Id
; Val
: Boolean);
2715 pragma Inline
(Set_Flag9
);
2717 procedure Set_Flag10
(N
: Node_Id
; Val
: Boolean);
2718 pragma Inline
(Set_Flag10
);
2720 procedure Set_Flag11
(N
: Node_Id
; Val
: Boolean);
2721 pragma Inline
(Set_Flag11
);
2723 procedure Set_Flag12
(N
: Node_Id
; Val
: Boolean);
2724 pragma Inline
(Set_Flag12
);
2726 procedure Set_Flag13
(N
: Node_Id
; Val
: Boolean);
2727 pragma Inline
(Set_Flag13
);
2729 procedure Set_Flag14
(N
: Node_Id
; Val
: Boolean);
2730 pragma Inline
(Set_Flag14
);
2732 procedure Set_Flag15
(N
: Node_Id
; Val
: Boolean);
2733 pragma Inline
(Set_Flag15
);
2735 procedure Set_Flag16
(N
: Node_Id
; Val
: Boolean);
2736 pragma Inline
(Set_Flag16
);
2738 procedure Set_Flag17
(N
: Node_Id
; Val
: Boolean);
2739 pragma Inline
(Set_Flag17
);
2741 procedure Set_Flag18
(N
: Node_Id
; Val
: Boolean);
2742 pragma Inline
(Set_Flag18
);
2744 procedure Set_Flag19
(N
: Node_Id
; Val
: Boolean);
2745 pragma Inline
(Set_Flag19
);
2747 procedure Set_Flag20
(N
: Node_Id
; Val
: Boolean);
2748 pragma Inline
(Set_Flag20
);
2750 procedure Set_Flag21
(N
: Node_Id
; Val
: Boolean);
2751 pragma Inline
(Set_Flag21
);
2753 procedure Set_Flag22
(N
: Node_Id
; Val
: Boolean);
2754 pragma Inline
(Set_Flag22
);
2756 procedure Set_Flag23
(N
: Node_Id
; Val
: Boolean);
2757 pragma Inline
(Set_Flag23
);
2759 procedure Set_Flag24
(N
: Node_Id
; Val
: Boolean);
2760 pragma Inline
(Set_Flag24
);
2762 procedure Set_Flag25
(N
: Node_Id
; Val
: Boolean);
2763 pragma Inline
(Set_Flag25
);
2765 procedure Set_Flag26
(N
: Node_Id
; Val
: Boolean);
2766 pragma Inline
(Set_Flag26
);
2768 procedure Set_Flag27
(N
: Node_Id
; Val
: Boolean);
2769 pragma Inline
(Set_Flag27
);
2771 procedure Set_Flag28
(N
: Node_Id
; Val
: Boolean);
2772 pragma Inline
(Set_Flag28
);
2774 procedure Set_Flag29
(N
: Node_Id
; Val
: Boolean);
2775 pragma Inline
(Set_Flag29
);
2777 procedure Set_Flag30
(N
: Node_Id
; Val
: Boolean);
2778 pragma Inline
(Set_Flag30
);
2780 procedure Set_Flag31
(N
: Node_Id
; Val
: Boolean);
2781 pragma Inline
(Set_Flag31
);
2783 procedure Set_Flag32
(N
: Node_Id
; Val
: Boolean);
2784 pragma Inline
(Set_Flag32
);
2786 procedure Set_Flag33
(N
: Node_Id
; Val
: Boolean);
2787 pragma Inline
(Set_Flag33
);
2789 procedure Set_Flag34
(N
: Node_Id
; Val
: Boolean);
2790 pragma Inline
(Set_Flag34
);
2792 procedure Set_Flag35
(N
: Node_Id
; Val
: Boolean);
2793 pragma Inline
(Set_Flag35
);
2795 procedure Set_Flag36
(N
: Node_Id
; Val
: Boolean);
2796 pragma Inline
(Set_Flag36
);
2798 procedure Set_Flag37
(N
: Node_Id
; Val
: Boolean);
2799 pragma Inline
(Set_Flag37
);
2801 procedure Set_Flag38
(N
: Node_Id
; Val
: Boolean);
2802 pragma Inline
(Set_Flag38
);
2804 procedure Set_Flag39
(N
: Node_Id
; Val
: Boolean);
2805 pragma Inline
(Set_Flag39
);
2807 procedure Set_Flag40
(N
: Node_Id
; Val
: Boolean);
2808 pragma Inline
(Set_Flag40
);
2810 procedure Set_Flag41
(N
: Node_Id
; Val
: Boolean);
2811 pragma Inline
(Set_Flag41
);
2813 procedure Set_Flag42
(N
: Node_Id
; Val
: Boolean);
2814 pragma Inline
(Set_Flag42
);
2816 procedure Set_Flag43
(N
: Node_Id
; Val
: Boolean);
2817 pragma Inline
(Set_Flag43
);
2819 procedure Set_Flag44
(N
: Node_Id
; Val
: Boolean);
2820 pragma Inline
(Set_Flag44
);
2822 procedure Set_Flag45
(N
: Node_Id
; Val
: Boolean);
2823 pragma Inline
(Set_Flag45
);
2825 procedure Set_Flag46
(N
: Node_Id
; Val
: Boolean);
2826 pragma Inline
(Set_Flag46
);
2828 procedure Set_Flag47
(N
: Node_Id
; Val
: Boolean);
2829 pragma Inline
(Set_Flag47
);
2831 procedure Set_Flag48
(N
: Node_Id
; Val
: Boolean);
2832 pragma Inline
(Set_Flag48
);
2834 procedure Set_Flag49
(N
: Node_Id
; Val
: Boolean);
2835 pragma Inline
(Set_Flag49
);
2837 procedure Set_Flag50
(N
: Node_Id
; Val
: Boolean);
2838 pragma Inline
(Set_Flag50
);
2840 procedure Set_Flag51
(N
: Node_Id
; Val
: Boolean);
2841 pragma Inline
(Set_Flag51
);
2843 procedure Set_Flag52
(N
: Node_Id
; Val
: Boolean);
2844 pragma Inline
(Set_Flag52
);
2846 procedure Set_Flag53
(N
: Node_Id
; Val
: Boolean);
2847 pragma Inline
(Set_Flag53
);
2849 procedure Set_Flag54
(N
: Node_Id
; Val
: Boolean);
2850 pragma Inline
(Set_Flag54
);
2852 procedure Set_Flag55
(N
: Node_Id
; Val
: Boolean);
2853 pragma Inline
(Set_Flag55
);
2855 procedure Set_Flag56
(N
: Node_Id
; Val
: Boolean);
2856 pragma Inline
(Set_Flag56
);
2858 procedure Set_Flag57
(N
: Node_Id
; Val
: Boolean);
2859 pragma Inline
(Set_Flag57
);
2861 procedure Set_Flag58
(N
: Node_Id
; Val
: Boolean);
2862 pragma Inline
(Set_Flag58
);
2864 procedure Set_Flag59
(N
: Node_Id
; Val
: Boolean);
2865 pragma Inline
(Set_Flag59
);
2867 procedure Set_Flag60
(N
: Node_Id
; Val
: Boolean);
2868 pragma Inline
(Set_Flag60
);
2870 procedure Set_Flag61
(N
: Node_Id
; Val
: Boolean);
2871 pragma Inline
(Set_Flag61
);
2873 procedure Set_Flag62
(N
: Node_Id
; Val
: Boolean);
2874 pragma Inline
(Set_Flag62
);
2876 procedure Set_Flag63
(N
: Node_Id
; Val
: Boolean);
2877 pragma Inline
(Set_Flag63
);
2879 procedure Set_Flag64
(N
: Node_Id
; Val
: Boolean);
2880 pragma Inline
(Set_Flag64
);
2882 procedure Set_Flag65
(N
: Node_Id
; Val
: Boolean);
2883 pragma Inline
(Set_Flag65
);
2885 procedure Set_Flag66
(N
: Node_Id
; Val
: Boolean);
2886 pragma Inline
(Set_Flag66
);
2888 procedure Set_Flag67
(N
: Node_Id
; Val
: Boolean);
2889 pragma Inline
(Set_Flag67
);
2891 procedure Set_Flag68
(N
: Node_Id
; Val
: Boolean);
2892 pragma Inline
(Set_Flag68
);
2894 procedure Set_Flag69
(N
: Node_Id
; Val
: Boolean);
2895 pragma Inline
(Set_Flag69
);
2897 procedure Set_Flag70
(N
: Node_Id
; Val
: Boolean);
2898 pragma Inline
(Set_Flag70
);
2900 procedure Set_Flag71
(N
: Node_Id
; Val
: Boolean);
2901 pragma Inline
(Set_Flag71
);
2903 procedure Set_Flag72
(N
: Node_Id
; Val
: Boolean);
2904 pragma Inline
(Set_Flag72
);
2906 procedure Set_Flag73
(N
: Node_Id
; Val
: Boolean);
2907 pragma Inline
(Set_Flag73
);
2909 procedure Set_Flag74
(N
: Node_Id
; Val
: Boolean);
2910 pragma Inline
(Set_Flag74
);
2912 procedure Set_Flag75
(N
: Node_Id
; Val
: Boolean);
2913 pragma Inline
(Set_Flag75
);
2915 procedure Set_Flag76
(N
: Node_Id
; Val
: Boolean);
2916 pragma Inline
(Set_Flag76
);
2918 procedure Set_Flag77
(N
: Node_Id
; Val
: Boolean);
2919 pragma Inline
(Set_Flag77
);
2921 procedure Set_Flag78
(N
: Node_Id
; Val
: Boolean);
2922 pragma Inline
(Set_Flag78
);
2924 procedure Set_Flag79
(N
: Node_Id
; Val
: Boolean);
2925 pragma Inline
(Set_Flag79
);
2927 procedure Set_Flag80
(N
: Node_Id
; Val
: Boolean);
2928 pragma Inline
(Set_Flag80
);
2930 procedure Set_Flag81
(N
: Node_Id
; Val
: Boolean);
2931 pragma Inline
(Set_Flag81
);
2933 procedure Set_Flag82
(N
: Node_Id
; Val
: Boolean);
2934 pragma Inline
(Set_Flag82
);
2936 procedure Set_Flag83
(N
: Node_Id
; Val
: Boolean);
2937 pragma Inline
(Set_Flag83
);
2939 procedure Set_Flag84
(N
: Node_Id
; Val
: Boolean);
2940 pragma Inline
(Set_Flag84
);
2942 procedure Set_Flag85
(N
: Node_Id
; Val
: Boolean);
2943 pragma Inline
(Set_Flag85
);
2945 procedure Set_Flag86
(N
: Node_Id
; Val
: Boolean);
2946 pragma Inline
(Set_Flag86
);
2948 procedure Set_Flag87
(N
: Node_Id
; Val
: Boolean);
2949 pragma Inline
(Set_Flag87
);
2951 procedure Set_Flag88
(N
: Node_Id
; Val
: Boolean);
2952 pragma Inline
(Set_Flag88
);
2954 procedure Set_Flag89
(N
: Node_Id
; Val
: Boolean);
2955 pragma Inline
(Set_Flag89
);
2957 procedure Set_Flag90
(N
: Node_Id
; Val
: Boolean);
2958 pragma Inline
(Set_Flag90
);
2960 procedure Set_Flag91
(N
: Node_Id
; Val
: Boolean);
2961 pragma Inline
(Set_Flag91
);
2963 procedure Set_Flag92
(N
: Node_Id
; Val
: Boolean);
2964 pragma Inline
(Set_Flag92
);
2966 procedure Set_Flag93
(N
: Node_Id
; Val
: Boolean);
2967 pragma Inline
(Set_Flag93
);
2969 procedure Set_Flag94
(N
: Node_Id
; Val
: Boolean);
2970 pragma Inline
(Set_Flag94
);
2972 procedure Set_Flag95
(N
: Node_Id
; Val
: Boolean);
2973 pragma Inline
(Set_Flag95
);
2975 procedure Set_Flag96
(N
: Node_Id
; Val
: Boolean);
2976 pragma Inline
(Set_Flag96
);
2978 procedure Set_Flag97
(N
: Node_Id
; Val
: Boolean);
2979 pragma Inline
(Set_Flag97
);
2981 procedure Set_Flag98
(N
: Node_Id
; Val
: Boolean);
2982 pragma Inline
(Set_Flag98
);
2984 procedure Set_Flag99
(N
: Node_Id
; Val
: Boolean);
2985 pragma Inline
(Set_Flag99
);
2987 procedure Set_Flag100
(N
: Node_Id
; Val
: Boolean);
2988 pragma Inline
(Set_Flag100
);
2990 procedure Set_Flag101
(N
: Node_Id
; Val
: Boolean);
2991 pragma Inline
(Set_Flag101
);
2993 procedure Set_Flag102
(N
: Node_Id
; Val
: Boolean);
2994 pragma Inline
(Set_Flag102
);
2996 procedure Set_Flag103
(N
: Node_Id
; Val
: Boolean);
2997 pragma Inline
(Set_Flag103
);
2999 procedure Set_Flag104
(N
: Node_Id
; Val
: Boolean);
3000 pragma Inline
(Set_Flag104
);
3002 procedure Set_Flag105
(N
: Node_Id
; Val
: Boolean);
3003 pragma Inline
(Set_Flag105
);
3005 procedure Set_Flag106
(N
: Node_Id
; Val
: Boolean);
3006 pragma Inline
(Set_Flag106
);
3008 procedure Set_Flag107
(N
: Node_Id
; Val
: Boolean);
3009 pragma Inline
(Set_Flag107
);
3011 procedure Set_Flag108
(N
: Node_Id
; Val
: Boolean);
3012 pragma Inline
(Set_Flag108
);
3014 procedure Set_Flag109
(N
: Node_Id
; Val
: Boolean);
3015 pragma Inline
(Set_Flag109
);
3017 procedure Set_Flag110
(N
: Node_Id
; Val
: Boolean);
3018 pragma Inline
(Set_Flag110
);
3020 procedure Set_Flag111
(N
: Node_Id
; Val
: Boolean);
3021 pragma Inline
(Set_Flag111
);
3023 procedure Set_Flag112
(N
: Node_Id
; Val
: Boolean);
3024 pragma Inline
(Set_Flag112
);
3026 procedure Set_Flag113
(N
: Node_Id
; Val
: Boolean);
3027 pragma Inline
(Set_Flag113
);
3029 procedure Set_Flag114
(N
: Node_Id
; Val
: Boolean);
3030 pragma Inline
(Set_Flag114
);
3032 procedure Set_Flag115
(N
: Node_Id
; Val
: Boolean);
3033 pragma Inline
(Set_Flag115
);
3035 procedure Set_Flag116
(N
: Node_Id
; Val
: Boolean);
3036 pragma Inline
(Set_Flag116
);
3038 procedure Set_Flag117
(N
: Node_Id
; Val
: Boolean);
3039 pragma Inline
(Set_Flag117
);
3041 procedure Set_Flag118
(N
: Node_Id
; Val
: Boolean);
3042 pragma Inline
(Set_Flag118
);
3044 procedure Set_Flag119
(N
: Node_Id
; Val
: Boolean);
3045 pragma Inline
(Set_Flag119
);
3047 procedure Set_Flag120
(N
: Node_Id
; Val
: Boolean);
3048 pragma Inline
(Set_Flag120
);
3050 procedure Set_Flag121
(N
: Node_Id
; Val
: Boolean);
3051 pragma Inline
(Set_Flag121
);
3053 procedure Set_Flag122
(N
: Node_Id
; Val
: Boolean);
3054 pragma Inline
(Set_Flag122
);
3056 procedure Set_Flag123
(N
: Node_Id
; Val
: Boolean);
3057 pragma Inline
(Set_Flag123
);
3059 procedure Set_Flag124
(N
: Node_Id
; Val
: Boolean);
3060 pragma Inline
(Set_Flag124
);
3062 procedure Set_Flag125
(N
: Node_Id
; Val
: Boolean);
3063 pragma Inline
(Set_Flag125
);
3065 procedure Set_Flag126
(N
: Node_Id
; Val
: Boolean);
3066 pragma Inline
(Set_Flag126
);
3068 procedure Set_Flag127
(N
: Node_Id
; Val
: Boolean);
3069 pragma Inline
(Set_Flag127
);
3071 procedure Set_Flag128
(N
: Node_Id
; Val
: Boolean);
3072 pragma Inline
(Set_Flag128
);
3074 procedure Set_Flag129
(N
: Node_Id
; Val
: Boolean);
3075 pragma Inline
(Set_Flag129
);
3077 procedure Set_Flag130
(N
: Node_Id
; Val
: Boolean);
3078 pragma Inline
(Set_Flag130
);
3080 procedure Set_Flag131
(N
: Node_Id
; Val
: Boolean);
3081 pragma Inline
(Set_Flag131
);
3083 procedure Set_Flag132
(N
: Node_Id
; Val
: Boolean);
3084 pragma Inline
(Set_Flag132
);
3086 procedure Set_Flag133
(N
: Node_Id
; Val
: Boolean);
3087 pragma Inline
(Set_Flag133
);
3089 procedure Set_Flag134
(N
: Node_Id
; Val
: Boolean);
3090 pragma Inline
(Set_Flag134
);
3092 procedure Set_Flag135
(N
: Node_Id
; Val
: Boolean);
3093 pragma Inline
(Set_Flag135
);
3095 procedure Set_Flag136
(N
: Node_Id
; Val
: Boolean);
3096 pragma Inline
(Set_Flag136
);
3098 procedure Set_Flag137
(N
: Node_Id
; Val
: Boolean);
3099 pragma Inline
(Set_Flag137
);
3101 procedure Set_Flag138
(N
: Node_Id
; Val
: Boolean);
3102 pragma Inline
(Set_Flag138
);
3104 procedure Set_Flag139
(N
: Node_Id
; Val
: Boolean);
3105 pragma Inline
(Set_Flag139
);
3107 procedure Set_Flag140
(N
: Node_Id
; Val
: Boolean);
3108 pragma Inline
(Set_Flag140
);
3110 procedure Set_Flag141
(N
: Node_Id
; Val
: Boolean);
3111 pragma Inline
(Set_Flag141
);
3113 procedure Set_Flag142
(N
: Node_Id
; Val
: Boolean);
3114 pragma Inline
(Set_Flag142
);
3116 procedure Set_Flag143
(N
: Node_Id
; Val
: Boolean);
3117 pragma Inline
(Set_Flag143
);
3119 procedure Set_Flag144
(N
: Node_Id
; Val
: Boolean);
3120 pragma Inline
(Set_Flag144
);
3122 procedure Set_Flag145
(N
: Node_Id
; Val
: Boolean);
3123 pragma Inline
(Set_Flag145
);
3125 procedure Set_Flag146
(N
: Node_Id
; Val
: Boolean);
3126 pragma Inline
(Set_Flag146
);
3128 procedure Set_Flag147
(N
: Node_Id
; Val
: Boolean);
3129 pragma Inline
(Set_Flag147
);
3131 procedure Set_Flag148
(N
: Node_Id
; Val
: Boolean);
3132 pragma Inline
(Set_Flag148
);
3134 procedure Set_Flag149
(N
: Node_Id
; Val
: Boolean);
3135 pragma Inline
(Set_Flag149
);
3137 procedure Set_Flag150
(N
: Node_Id
; Val
: Boolean);
3138 pragma Inline
(Set_Flag150
);
3140 procedure Set_Flag151
(N
: Node_Id
; Val
: Boolean);
3141 pragma Inline
(Set_Flag151
);
3143 procedure Set_Flag152
(N
: Node_Id
; Val
: Boolean);
3144 pragma Inline
(Set_Flag152
);
3146 procedure Set_Flag153
(N
: Node_Id
; Val
: Boolean);
3147 pragma Inline
(Set_Flag153
);
3149 procedure Set_Flag154
(N
: Node_Id
; Val
: Boolean);
3150 pragma Inline
(Set_Flag154
);
3152 procedure Set_Flag155
(N
: Node_Id
; Val
: Boolean);
3153 pragma Inline
(Set_Flag155
);
3155 procedure Set_Flag156
(N
: Node_Id
; Val
: Boolean);
3156 pragma Inline
(Set_Flag156
);
3158 procedure Set_Flag157
(N
: Node_Id
; Val
: Boolean);
3159 pragma Inline
(Set_Flag157
);
3161 procedure Set_Flag158
(N
: Node_Id
; Val
: Boolean);
3162 pragma Inline
(Set_Flag158
);
3164 procedure Set_Flag159
(N
: Node_Id
; Val
: Boolean);
3165 pragma Inline
(Set_Flag159
);
3167 procedure Set_Flag160
(N
: Node_Id
; Val
: Boolean);
3168 pragma Inline
(Set_Flag160
);
3170 procedure Set_Flag161
(N
: Node_Id
; Val
: Boolean);
3171 pragma Inline
(Set_Flag161
);
3173 procedure Set_Flag162
(N
: Node_Id
; Val
: Boolean);
3174 pragma Inline
(Set_Flag162
);
3176 procedure Set_Flag163
(N
: Node_Id
; Val
: Boolean);
3177 pragma Inline
(Set_Flag163
);
3179 procedure Set_Flag164
(N
: Node_Id
; Val
: Boolean);
3180 pragma Inline
(Set_Flag164
);
3182 procedure Set_Flag165
(N
: Node_Id
; Val
: Boolean);
3183 pragma Inline
(Set_Flag165
);
3185 procedure Set_Flag166
(N
: Node_Id
; Val
: Boolean);
3186 pragma Inline
(Set_Flag166
);
3188 procedure Set_Flag167
(N
: Node_Id
; Val
: Boolean);
3189 pragma Inline
(Set_Flag167
);
3191 procedure Set_Flag168
(N
: Node_Id
; Val
: Boolean);
3192 pragma Inline
(Set_Flag168
);
3194 procedure Set_Flag169
(N
: Node_Id
; Val
: Boolean);
3195 pragma Inline
(Set_Flag169
);
3197 procedure Set_Flag170
(N
: Node_Id
; Val
: Boolean);
3198 pragma Inline
(Set_Flag170
);
3200 procedure Set_Flag171
(N
: Node_Id
; Val
: Boolean);
3201 pragma Inline
(Set_Flag171
);
3203 procedure Set_Flag172
(N
: Node_Id
; Val
: Boolean);
3204 pragma Inline
(Set_Flag172
);
3206 procedure Set_Flag173
(N
: Node_Id
; Val
: Boolean);
3207 pragma Inline
(Set_Flag173
);
3209 procedure Set_Flag174
(N
: Node_Id
; Val
: Boolean);
3210 pragma Inline
(Set_Flag174
);
3212 procedure Set_Flag175
(N
: Node_Id
; Val
: Boolean);
3213 pragma Inline
(Set_Flag175
);
3215 procedure Set_Flag176
(N
: Node_Id
; Val
: Boolean);
3216 pragma Inline
(Set_Flag176
);
3218 procedure Set_Flag177
(N
: Node_Id
; Val
: Boolean);
3219 pragma Inline
(Set_Flag177
);
3221 procedure Set_Flag178
(N
: Node_Id
; Val
: Boolean);
3222 pragma Inline
(Set_Flag178
);
3224 procedure Set_Flag179
(N
: Node_Id
; Val
: Boolean);
3225 pragma Inline
(Set_Flag179
);
3227 procedure Set_Flag180
(N
: Node_Id
; Val
: Boolean);
3228 pragma Inline
(Set_Flag180
);
3230 procedure Set_Flag181
(N
: Node_Id
; Val
: Boolean);
3231 pragma Inline
(Set_Flag181
);
3233 procedure Set_Flag182
(N
: Node_Id
; Val
: Boolean);
3234 pragma Inline
(Set_Flag182
);
3236 procedure Set_Flag183
(N
: Node_Id
; Val
: Boolean);
3237 pragma Inline
(Set_Flag183
);
3239 procedure Set_Flag184
(N
: Node_Id
; Val
: Boolean);
3240 pragma Inline
(Set_Flag184
);
3242 procedure Set_Flag185
(N
: Node_Id
; Val
: Boolean);
3243 pragma Inline
(Set_Flag185
);
3245 procedure Set_Flag186
(N
: Node_Id
; Val
: Boolean);
3246 pragma Inline
(Set_Flag186
);
3248 procedure Set_Flag187
(N
: Node_Id
; Val
: Boolean);
3249 pragma Inline
(Set_Flag187
);
3251 procedure Set_Flag188
(N
: Node_Id
; Val
: Boolean);
3252 pragma Inline
(Set_Flag188
);
3254 procedure Set_Flag189
(N
: Node_Id
; Val
: Boolean);
3255 pragma Inline
(Set_Flag189
);
3257 procedure Set_Flag190
(N
: Node_Id
; Val
: Boolean);
3258 pragma Inline
(Set_Flag190
);
3260 procedure Set_Flag191
(N
: Node_Id
; Val
: Boolean);
3261 pragma Inline
(Set_Flag191
);
3263 procedure Set_Flag192
(N
: Node_Id
; Val
: Boolean);
3264 pragma Inline
(Set_Flag192
);
3266 procedure Set_Flag193
(N
: Node_Id
; Val
: Boolean);
3267 pragma Inline
(Set_Flag193
);
3269 procedure Set_Flag194
(N
: Node_Id
; Val
: Boolean);
3270 pragma Inline
(Set_Flag194
);
3272 procedure Set_Flag195
(N
: Node_Id
; Val
: Boolean);
3273 pragma Inline
(Set_Flag195
);
3275 procedure Set_Flag196
(N
: Node_Id
; Val
: Boolean);
3276 pragma Inline
(Set_Flag196
);
3278 procedure Set_Flag197
(N
: Node_Id
; Val
: Boolean);
3279 pragma Inline
(Set_Flag197
);
3281 procedure Set_Flag198
(N
: Node_Id
; Val
: Boolean);
3282 pragma Inline
(Set_Flag198
);
3284 procedure Set_Flag199
(N
: Node_Id
; Val
: Boolean);
3285 pragma Inline
(Set_Flag199
);
3287 procedure Set_Flag200
(N
: Node_Id
; Val
: Boolean);
3288 pragma Inline
(Set_Flag200
);
3290 procedure Set_Flag201
(N
: Node_Id
; Val
: Boolean);
3291 pragma Inline
(Set_Flag201
);
3293 procedure Set_Flag202
(N
: Node_Id
; Val
: Boolean);
3294 pragma Inline
(Set_Flag202
);
3296 procedure Set_Flag203
(N
: Node_Id
; Val
: Boolean);
3297 pragma Inline
(Set_Flag203
);
3299 procedure Set_Flag204
(N
: Node_Id
; Val
: Boolean);
3300 pragma Inline
(Set_Flag204
);
3302 procedure Set_Flag205
(N
: Node_Id
; Val
: Boolean);
3303 pragma Inline
(Set_Flag205
);
3305 procedure Set_Flag206
(N
: Node_Id
; Val
: Boolean);
3306 pragma Inline
(Set_Flag206
);
3308 procedure Set_Flag207
(N
: Node_Id
; Val
: Boolean);
3309 pragma Inline
(Set_Flag207
);
3311 procedure Set_Flag208
(N
: Node_Id
; Val
: Boolean);
3312 pragma Inline
(Set_Flag208
);
3314 procedure Set_Flag209
(N
: Node_Id
; Val
: Boolean);
3315 pragma Inline
(Set_Flag209
);
3317 procedure Set_Flag210
(N
: Node_Id
; Val
: Boolean);
3318 pragma Inline
(Set_Flag210
);
3320 procedure Set_Flag211
(N
: Node_Id
; Val
: Boolean);
3321 pragma Inline
(Set_Flag211
);
3323 procedure Set_Flag212
(N
: Node_Id
; Val
: Boolean);
3324 pragma Inline
(Set_Flag212
);
3326 procedure Set_Flag213
(N
: Node_Id
; Val
: Boolean);
3327 pragma Inline
(Set_Flag213
);
3329 procedure Set_Flag214
(N
: Node_Id
; Val
: Boolean);
3330 pragma Inline
(Set_Flag214
);
3332 procedure Set_Flag215
(N
: Node_Id
; Val
: Boolean);
3333 pragma Inline
(Set_Flag215
);
3335 procedure Set_Flag216
(N
: Node_Id
; Val
: Boolean);
3336 pragma Inline
(Set_Flag216
);
3338 procedure Set_Flag217
(N
: Node_Id
; Val
: Boolean);
3339 pragma Inline
(Set_Flag217
);
3341 procedure Set_Flag218
(N
: Node_Id
; Val
: Boolean);
3342 pragma Inline
(Set_Flag218
);
3344 procedure Set_Flag219
(N
: Node_Id
; Val
: Boolean);
3345 pragma Inline
(Set_Flag219
);
3347 procedure Set_Flag220
(N
: Node_Id
; Val
: Boolean);
3348 pragma Inline
(Set_Flag220
);
3350 procedure Set_Flag221
(N
: Node_Id
; Val
: Boolean);
3351 pragma Inline
(Set_Flag221
);
3353 procedure Set_Flag222
(N
: Node_Id
; Val
: Boolean);
3354 pragma Inline
(Set_Flag222
);
3356 procedure Set_Flag223
(N
: Node_Id
; Val
: Boolean);
3357 pragma Inline
(Set_Flag223
);
3359 procedure Set_Flag224
(N
: Node_Id
; Val
: Boolean);
3360 pragma Inline
(Set_Flag224
);
3362 procedure Set_Flag225
(N
: Node_Id
; Val
: Boolean);
3363 pragma Inline
(Set_Flag225
);
3365 procedure Set_Flag226
(N
: Node_Id
; Val
: Boolean);
3366 pragma Inline
(Set_Flag226
);
3368 procedure Set_Flag227
(N
: Node_Id
; Val
: Boolean);
3369 pragma Inline
(Set_Flag227
);
3371 procedure Set_Flag228
(N
: Node_Id
; Val
: Boolean);
3372 pragma Inline
(Set_Flag228
);
3374 procedure Set_Flag229
(N
: Node_Id
; Val
: Boolean);
3375 pragma Inline
(Set_Flag229
);
3377 procedure Set_Flag230
(N
: Node_Id
; Val
: Boolean);
3378 pragma Inline
(Set_Flag230
);
3380 procedure Set_Flag231
(N
: Node_Id
; Val
: Boolean);
3381 pragma Inline
(Set_Flag231
);
3383 procedure Set_Flag232
(N
: Node_Id
; Val
: Boolean);
3384 pragma Inline
(Set_Flag232
);
3386 procedure Set_Flag233
(N
: Node_Id
; Val
: Boolean);
3387 pragma Inline
(Set_Flag233
);
3389 procedure Set_Flag234
(N
: Node_Id
; Val
: Boolean);
3390 pragma Inline
(Set_Flag234
);
3392 procedure Set_Flag235
(N
: Node_Id
; Val
: Boolean);
3393 pragma Inline
(Set_Flag235
);
3395 procedure Set_Flag236
(N
: Node_Id
; Val
: Boolean);
3396 pragma Inline
(Set_Flag236
);
3398 procedure Set_Flag237
(N
: Node_Id
; Val
: Boolean);
3399 pragma Inline
(Set_Flag237
);
3401 procedure Set_Flag238
(N
: Node_Id
; Val
: Boolean);
3402 pragma Inline
(Set_Flag238
);
3404 procedure Set_Flag239
(N
: Node_Id
; Val
: Boolean);
3405 pragma Inline
(Set_Flag239
);
3407 procedure Set_Flag240
(N
: Node_Id
; Val
: Boolean);
3408 pragma Inline
(Set_Flag240
);
3410 procedure Set_Flag241
(N
: Node_Id
; Val
: Boolean);
3411 pragma Inline
(Set_Flag241
);
3413 procedure Set_Flag242
(N
: Node_Id
; Val
: Boolean);
3414 pragma Inline
(Set_Flag242
);
3416 procedure Set_Flag243
(N
: Node_Id
; Val
: Boolean);
3417 pragma Inline
(Set_Flag243
);
3419 procedure Set_Flag244
(N
: Node_Id
; Val
: Boolean);
3420 pragma Inline
(Set_Flag244
);
3422 procedure Set_Flag245
(N
: Node_Id
; Val
: Boolean);
3423 pragma Inline
(Set_Flag245
);
3425 procedure Set_Flag246
(N
: Node_Id
; Val
: Boolean);
3426 pragma Inline
(Set_Flag246
);
3428 procedure Set_Flag247
(N
: Node_Id
; Val
: Boolean);
3429 pragma Inline
(Set_Flag247
);
3431 procedure Set_Flag248
(N
: Node_Id
; Val
: Boolean);
3432 pragma Inline
(Set_Flag248
);
3434 procedure Set_Flag249
(N
: Node_Id
; Val
: Boolean);
3435 pragma Inline
(Set_Flag249
);
3437 procedure Set_Flag250
(N
: Node_Id
; Val
: Boolean);
3438 pragma Inline
(Set_Flag250
);
3440 procedure Set_Flag251
(N
: Node_Id
; Val
: Boolean);
3441 pragma Inline
(Set_Flag251
);
3443 procedure Set_Flag252
(N
: Node_Id
; Val
: Boolean);
3444 pragma Inline
(Set_Flag252
);
3446 procedure Set_Flag253
(N
: Node_Id
; Val
: Boolean);
3447 pragma Inline
(Set_Flag253
);
3449 procedure Set_Flag254
(N
: Node_Id
; Val
: Boolean);
3450 pragma Inline
(Set_Flag254
);
3452 procedure Set_Flag255
(N
: Node_Id
; Val
: Boolean);
3453 pragma Inline
(Set_Flag255
);
3455 procedure Set_Flag256
(N
: Node_Id
; Val
: Boolean);
3456 pragma Inline
(Set_Flag256
);
3458 procedure Set_Flag257
(N
: Node_Id
; Val
: Boolean);
3459 pragma Inline
(Set_Flag257
);
3461 procedure Set_Flag258
(N
: Node_Id
; Val
: Boolean);
3462 pragma Inline
(Set_Flag258
);
3464 procedure Set_Flag259
(N
: Node_Id
; Val
: Boolean);
3465 pragma Inline
(Set_Flag259
);
3467 procedure Set_Flag260
(N
: Node_Id
; Val
: Boolean);
3468 pragma Inline
(Set_Flag260
);
3470 procedure Set_Flag261
(N
: Node_Id
; Val
: Boolean);
3471 pragma Inline
(Set_Flag261
);
3473 procedure Set_Flag262
(N
: Node_Id
; Val
: Boolean);
3474 pragma Inline
(Set_Flag262
);
3476 procedure Set_Flag263
(N
: Node_Id
; Val
: Boolean);
3477 pragma Inline
(Set_Flag263
);
3479 procedure Set_Flag264
(N
: Node_Id
; Val
: Boolean);
3480 pragma Inline
(Set_Flag264
);
3482 procedure Set_Flag265
(N
: Node_Id
; Val
: Boolean);
3483 pragma Inline
(Set_Flag265
);
3485 procedure Set_Flag266
(N
: Node_Id
; Val
: Boolean);
3486 pragma Inline
(Set_Flag266
);
3488 procedure Set_Flag267
(N
: Node_Id
; Val
: Boolean);
3489 pragma Inline
(Set_Flag267
);
3491 procedure Set_Flag268
(N
: Node_Id
; Val
: Boolean);
3492 pragma Inline
(Set_Flag268
);
3494 procedure Set_Flag269
(N
: Node_Id
; Val
: Boolean);
3495 pragma Inline
(Set_Flag269
);
3497 procedure Set_Flag270
(N
: Node_Id
; Val
: Boolean);
3498 pragma Inline
(Set_Flag270
);
3500 procedure Set_Flag271
(N
: Node_Id
; Val
: Boolean);
3501 pragma Inline
(Set_Flag271
);
3503 procedure Set_Flag272
(N
: Node_Id
; Val
: Boolean);
3504 pragma Inline
(Set_Flag272
);
3506 procedure Set_Flag273
(N
: Node_Id
; Val
: Boolean);
3507 pragma Inline
(Set_Flag273
);
3509 procedure Set_Flag274
(N
: Node_Id
; Val
: Boolean);
3510 pragma Inline
(Set_Flag274
);
3512 procedure Set_Flag275
(N
: Node_Id
; Val
: Boolean);
3513 pragma Inline
(Set_Flag275
);
3515 procedure Set_Flag276
(N
: Node_Id
; Val
: Boolean);
3516 pragma Inline
(Set_Flag276
);
3518 procedure Set_Flag277
(N
: Node_Id
; Val
: Boolean);
3519 pragma Inline
(Set_Flag277
);
3521 procedure Set_Flag278
(N
: Node_Id
; Val
: Boolean);
3522 pragma Inline
(Set_Flag278
);
3524 procedure Set_Flag279
(N
: Node_Id
; Val
: Boolean);
3525 pragma Inline
(Set_Flag279
);
3527 procedure Set_Flag280
(N
: Node_Id
; Val
: Boolean);
3528 pragma Inline
(Set_Flag280
);
3530 procedure Set_Flag281
(N
: Node_Id
; Val
: Boolean);
3531 pragma Inline
(Set_Flag281
);
3533 procedure Set_Flag282
(N
: Node_Id
; Val
: Boolean);
3534 pragma Inline
(Set_Flag282
);
3536 procedure Set_Flag283
(N
: Node_Id
; Val
: Boolean);
3537 pragma Inline
(Set_Flag283
);
3539 procedure Set_Flag284
(N
: Node_Id
; Val
: Boolean);
3540 pragma Inline
(Set_Flag284
);
3542 procedure Set_Flag285
(N
: Node_Id
; Val
: Boolean);
3543 pragma Inline
(Set_Flag285
);
3545 procedure Set_Flag286
(N
: Node_Id
; Val
: Boolean);
3546 pragma Inline
(Set_Flag286
);
3548 procedure Set_Flag287
(N
: Node_Id
; Val
: Boolean);
3549 pragma Inline
(Set_Flag287
);
3551 procedure Set_Flag288
(N
: Node_Id
; Val
: Boolean);
3552 pragma Inline
(Set_Flag288
);
3554 procedure Set_Flag289
(N
: Node_Id
; Val
: Boolean);
3555 pragma Inline
(Set_Flag289
);
3557 procedure Set_Flag290
(N
: Node_Id
; Val
: Boolean);
3558 pragma Inline
(Set_Flag290
);
3560 procedure Set_Flag291
(N
: Node_Id
; Val
: Boolean);
3561 pragma Inline
(Set_Flag291
);
3563 procedure Set_Flag292
(N
: Node_Id
; Val
: Boolean);
3564 pragma Inline
(Set_Flag292
);
3566 procedure Set_Flag293
(N
: Node_Id
; Val
: Boolean);
3567 pragma Inline
(Set_Flag293
);
3569 procedure Set_Flag294
(N
: Node_Id
; Val
: Boolean);
3570 pragma Inline
(Set_Flag294
);
3572 procedure Set_Flag295
(N
: Node_Id
; Val
: Boolean);
3573 pragma Inline
(Set_Flag295
);
3575 procedure Set_Flag296
(N
: Node_Id
; Val
: Boolean);
3576 pragma Inline
(Set_Flag296
);
3578 procedure Set_Flag297
(N
: Node_Id
; Val
: Boolean);
3579 pragma Inline
(Set_Flag297
);
3581 procedure Set_Flag298
(N
: Node_Id
; Val
: Boolean);
3582 pragma Inline
(Set_Flag298
);
3584 procedure Set_Flag299
(N
: Node_Id
; Val
: Boolean);
3585 pragma Inline
(Set_Flag299
);
3587 procedure Set_Flag300
(N
: Node_Id
; Val
: Boolean);
3588 pragma Inline
(Set_Flag300
);
3590 procedure Set_Flag301
(N
: Node_Id
; Val
: Boolean);
3591 pragma Inline
(Set_Flag301
);
3593 procedure Set_Flag302
(N
: Node_Id
; Val
: Boolean);
3594 pragma Inline
(Set_Flag302
);
3596 procedure Set_Flag303
(N
: Node_Id
; Val
: Boolean);
3597 pragma Inline
(Set_Flag303
);
3599 procedure Set_Flag304
(N
: Node_Id
; Val
: Boolean);
3600 pragma Inline
(Set_Flag304
);
3602 procedure Set_Flag305
(N
: Node_Id
; Val
: Boolean);
3603 pragma Inline
(Set_Flag305
);
3605 procedure Set_Flag306
(N
: Node_Id
; Val
: Boolean);
3606 pragma Inline
(Set_Flag306
);
3608 procedure Set_Flag307
(N
: Node_Id
; Val
: Boolean);
3609 pragma Inline
(Set_Flag307
);
3611 procedure Set_Flag308
(N
: Node_Id
; Val
: Boolean);
3612 pragma Inline
(Set_Flag308
);
3614 procedure Set_Flag309
(N
: Node_Id
; Val
: Boolean);
3615 pragma Inline
(Set_Flag309
);
3617 procedure Set_Flag310
(N
: Node_Id
; Val
: Boolean);
3618 pragma Inline
(Set_Flag310
);
3620 procedure Set_Flag311
(N
: Node_Id
; Val
: Boolean);
3621 pragma Inline
(Set_Flag311
);
3623 procedure Set_Flag312
(N
: Node_Id
; Val
: Boolean);
3624 pragma Inline
(Set_Flag312
);
3626 procedure Set_Flag313
(N
: Node_Id
; Val
: Boolean);
3627 pragma Inline
(Set_Flag313
);
3629 procedure Set_Flag314
(N
: Node_Id
; Val
: Boolean);
3630 pragma Inline
(Set_Flag314
);
3632 procedure Set_Flag315
(N
: Node_Id
; Val
: Boolean);
3633 pragma Inline
(Set_Flag315
);
3635 procedure Set_Flag316
(N
: Node_Id
; Val
: Boolean);
3636 pragma Inline
(Set_Flag316
);
3638 procedure Set_Flag317
(N
: Node_Id
; Val
: Boolean);
3639 pragma Inline
(Set_Flag317
);
3641 -- The following versions of Set_Noden also set the parent pointer of
3642 -- the referenced node if it is not Empty.
3644 procedure Set_Node1_With_Parent
(N
: Node_Id
; Val
: Node_Id
);
3645 pragma Inline
(Set_Node1_With_Parent
);
3647 procedure Set_Node2_With_Parent
(N
: Node_Id
; Val
: Node_Id
);
3648 pragma Inline
(Set_Node2_With_Parent
);
3650 procedure Set_Node3_With_Parent
(N
: Node_Id
; Val
: Node_Id
);
3651 pragma Inline
(Set_Node3_With_Parent
);
3653 procedure Set_Node4_With_Parent
(N
: Node_Id
; Val
: Node_Id
);
3654 pragma Inline
(Set_Node4_With_Parent
);
3656 procedure Set_Node5_With_Parent
(N
: Node_Id
; Val
: Node_Id
);
3657 pragma Inline
(Set_Node5_With_Parent
);
3659 -- The following versions of Set_Listn also set the parent pointer of
3660 -- the referenced node if it is not Empty.
3662 procedure Set_List1_With_Parent
(N
: Node_Id
; Val
: List_Id
);
3663 pragma Inline
(Set_List1_With_Parent
);
3665 procedure Set_List2_With_Parent
(N
: Node_Id
; Val
: List_Id
);
3666 pragma Inline
(Set_List2_With_Parent
);
3668 procedure Set_List3_With_Parent
(N
: Node_Id
; Val
: List_Id
);
3669 pragma Inline
(Set_List3_With_Parent
);
3671 procedure Set_List4_With_Parent
(N
: Node_Id
; Val
: List_Id
);
3672 pragma Inline
(Set_List4_With_Parent
);
3674 procedure Set_List5_With_Parent
(N
: Node_Id
; Val
: List_Id
);
3675 pragma Inline
(Set_List5_With_Parent
);
3677 end Unchecked_Access
;
3679 -----------------------------
3680 -- Private Part Subpackage --
3681 -----------------------------
3683 -- The following package contains the definition of the data structure
3684 -- used by the implementation of the Atree package. Logically it really
3685 -- corresponds to the private part, hence the name. The reason that it
3686 -- is defined as a sub-package is to allow special access from clients
3687 -- that need to see the internals of the data structures.
3689 package Atree_Private_Part
is
3691 -------------------------
3692 -- Tree Representation --
3693 -------------------------
3695 -- The nodes of the tree are stored in a table (i.e. an array). In the
3696 -- case of extended nodes six consecutive components in the array are
3697 -- used. There are thus two formats for array components. One is used
3698 -- for non-extended nodes, and for the first component of extended
3699 -- nodes. The other is used for the extension parts (second, third,
3700 -- fourth, fifth, and sixth components) of an extended node. A variant
3701 -- record structure is used to distinguish the two formats.
3703 type Node_Record
(Is_Extension
: Boolean := False) is record
3705 -- Logically, the only field in the common part is the above
3706 -- Is_Extension discriminant (a single bit). However, Gigi cannot
3707 -- yet handle such a structure, so we fill out the common part of
3708 -- the record with fields that are used in different ways for
3709 -- normal nodes and node extensions.
3711 Pflag1
, Pflag2
: Boolean;
3712 -- The Paren_Count field is represented using two boolean flags,
3713 -- where Pflag1 is worth 1, and Pflag2 is worth 2. This is done
3714 -- because we need to be easily able to reuse this field for
3715 -- extra flags in the extended node case.
3718 -- Flag used to indicate if node is a member of a list.
3719 -- This field is considered private to the Atree package.
3721 Has_Aspects
: Boolean;
3722 -- Flag used to indicate that a node has aspect specifications that
3723 -- are associated with the node. See Aspects package for details.
3725 Rewrite_Ins
: Boolean;
3726 -- Flag set by Mark_Rewrite_Insertion procedure.
3727 -- This field is considered private to the Atree package.
3730 -- Flag to indicate the node has been analyzed (and expanded)
3732 Comes_From_Source
: Boolean;
3733 -- Flag to indicate that node comes from the source program (i.e.
3734 -- was built by the parser or scanner, not the analyzer or expander).
3736 Error_Posted
: Boolean;
3737 -- Flag to indicate that an error message has been posted on the
3738 -- node (to avoid duplicate flags on the same node)
3755 -- Flags 4-18 for a normal node. Note that Flags 0-3 are stored
3756 -- separately in the Flags array.
3758 -- The above fields are used as follows in components 2-6 of
3759 -- an extended node entry.
3761 -- In_List used as Flag19,Flag40,Flag129,Flag216,Flag287
3762 -- Has_Aspects used as Flag20,Flag41,Flag130,Flag217,Flag288
3763 -- Rewrite_Ins used as Flag21,Flag42,Flag131,Flag218,Flag289
3764 -- Analyzed used as Flag22,Flag43,Flag132,Flag219,Flag290
3765 -- Comes_From_Source used as Flag23,Flag44,Flag133,Flag220,Flag291
3766 -- Error_Posted used as Flag24,Flag45,Flag134,Flag221,Flag292
3767 -- Flag4 used as Flag25,Flag46,Flag135,Flag222,Flag293
3768 -- Flag5 used as Flag26,Flag47,Flag136,Flag223,Flag294
3769 -- Flag6 used as Flag27,Flag48,Flag137,Flag224,Flag295
3770 -- Flag7 used as Flag28,Flag49,Flag138,Flag225,Flag296
3771 -- Flag8 used as Flag29,Flag50,Flag139,Flag226,Flag297
3772 -- Flag9 used as Flag30,Flag51,Flag140,Flag227,Flag298
3773 -- Flag10 used as Flag31,Flag52,Flag141,Flag228,Flag299
3774 -- Flag11 used as Flag32,Flag53,Flag142,Flag229,Flag300
3775 -- Flag12 used as Flag33,Flag54,Flag143,Flag230,Flag301
3776 -- Flag13 used as Flag34,Flag55,Flag144,Flag231,Flag302
3777 -- Flag14 used as Flag35,Flag56,Flag145,Flag232,Flag303
3778 -- Flag15 used as Flag36,Flag57,Flag146,Flag233,Flag304
3779 -- Flag16 used as Flag37,Flag58,Flag147,Flag234,Flag305
3780 -- Flag17 used as Flag38,Flag59,Flag148,Flag235,Flag306
3781 -- Flag18 used as Flag39,Flag60,Flag149,Flag236,Flag307
3782 -- Pflag1 used as Flag61,Flag62,Flag150,Flag237,Flag308
3783 -- Pflag2 used as Flag63,Flag64,Flag151,Flag238,Flag309
3786 -- For a non-extended node, or the initial section of an extended
3787 -- node, this field holds the Node_Kind value. For an extended node,
3788 -- The Nkind field is used as follows:
3790 -- Second entry: holds the Ekind field of the entity
3791 -- Third entry: holds 8 additional flags (Flag65-Flag72)
3792 -- Fourth entry: holds 8 additional flags (Flag239-246)
3793 -- Fifth entry: holds 8 additional flags (Flag247-254)
3794 -- Sixth entry: holds 8 additional flags (Flag310-317)
3796 -- Now finally (on an 32-bit boundary) comes the variant part
3798 case Is_Extension
is
3800 -- Non-extended node, or first component of extended node
3805 -- Source location for this node
3808 -- This field is used either as the Parent pointer (if In_List
3809 -- is False), or to point to the list header (if In_List is
3810 -- True). This field is considered private and can be modified
3811 -- only by Atree or by Nlists.
3818 -- Five general use fields, which can contain Node_Id, List_Id,
3819 -- Elist_Id, String_Id, or Name_Id values depending on the
3820 -- values in Nkind and (for extended nodes), in Ekind. See
3821 -- packages Sinfo and Einfo for details of their use.
3823 -- Extension (second component) of extended node
3834 -- Seven additional general fields available only for entities
3835 -- See package Einfo for details of their use (which depends
3836 -- on the value in the Ekind field).
3838 -- In the third component, the extension format as described
3839 -- above is used to hold additional general fields and flags
3842 -- Field6-11 Holds Field13-Field18
3843 -- Field12 Holds Flag73-Flag96 and Convention
3845 -- In the fourth component, the extension format as described
3846 -- above is used to hold additional general fields and flags
3849 -- Field6-10 Holds Field19-Field23
3850 -- Field11 Holds Flag152-Flag183
3851 -- Field12 Holds Flag97-Flag128
3853 -- In the fifth component, the extension format as described
3854 -- above is used to hold additional general fields and flags
3857 -- Field6-11 Holds Field24-Field29
3858 -- Field12 Holds Flag184-Flag215
3860 -- In the sixth component, the extension format as described
3861 -- above is used to hold additional general fields and flags
3864 -- Field6-11 Holds Field30-Field35
3865 -- Field12 Holds Flag255-Flag286
3870 pragma Pack
(Node_Record
);
3871 for Node_Record
'Size use 8*32;
3872 for Node_Record
'Alignment use 4;
3874 function E_To_N
is new Unchecked_Conversion
(Entity_Kind
, Node_Kind
);
3875 function N_To_E
is new Unchecked_Conversion
(Node_Kind
, Entity_Kind
);
3877 -- Default value used to initialize default nodes. Note that some of the
3878 -- fields get overwritten, and in particular, Nkind always gets reset.
3880 Default_Node
: Node_Record
:= (
3881 Is_Extension
=> False,
3885 Has_Aspects
=> False,
3886 Rewrite_Ins
=> False,
3888 Comes_From_Source
=> False,
3889 -- modified by Set_Comes_From_Source_Default
3890 Error_Posted
=> False,
3909 Nkind
=> N_Unused_At_Start
,
3911 Sloc
=> No_Location
,
3912 Link
=> Empty_List_Or_Node
,
3913 Field1
=> Empty_List_Or_Node
,
3914 Field2
=> Empty_List_Or_Node
,
3915 Field3
=> Empty_List_Or_Node
,
3916 Field4
=> Empty_List_Or_Node
,
3917 Field5
=> Empty_List_Or_Node
);
3919 -- Default value used to initialize node extensions (i.e. the second
3920 -- through sixth components of an extended node). Note we are cheating
3921 -- a bit here when it comes to Node12, which really holds flags and (for
3922 -- the third component), the convention. But it works because Empty,
3923 -- False, Convention_Ada, all happen to be all zero bits.
3925 Default_Node_Extension
: constant Node_Record
:= (
3926 Is_Extension
=> True,
3930 Has_Aspects
=> False,
3931 Rewrite_Ins
=> False,
3933 Comes_From_Source
=> False,
3934 Error_Posted
=> False,
3953 Nkind
=> E_To_N
(E_Void
),
3955 Field6
=> Empty_List_Or_Node
,
3956 Field7
=> Empty_List_Or_Node
,
3957 Field8
=> Empty_List_Or_Node
,
3958 Field9
=> Empty_List_Or_Node
,
3959 Field10
=> Empty_List_Or_Node
,
3960 Field11
=> Empty_List_Or_Node
,
3961 Field12
=> Empty_List_Or_Node
);
3963 -- The following defines the extendable array used for the nodes table
3964 -- Nodes with extensions use six consecutive entries in the array
3966 package Nodes
is new Table
.Table
(
3967 Table_Component_Type
=> Node_Record
,
3968 Table_Index_Type
=> Node_Id
'Base,
3969 Table_Low_Bound
=> First_Node_Id
,
3970 Table_Initial
=> Alloc
.Nodes_Initial
,
3971 Table_Increment
=> Alloc
.Nodes_Increment
,
3972 Table_Name
=> "Nodes");
3974 -- The following is a parallel table to Nodes, which provides 8 more
3975 -- bits of space that logically belong to the corresponding node. This
3976 -- is currently used to implement Flags 0,1,2,3 for normal nodes, or
3977 -- the first component of an extended node (four bits unused). Entries
3978 -- for extending components are completely unused.
3980 type Flags_Byte
is record
3991 for Flags_Byte
'Size use 8;
3992 pragma Pack
(Flags_Byte
);
3994 Default_Flags
: constant Flags_Byte
:= (others => False);
3995 -- Default value used to initialize new entries
3997 package Flags
is new Table
.Table
(
3998 Table_Component_Type
=> Flags_Byte
,
3999 Table_Index_Type
=> Node_Id
'Base,
4000 Table_Low_Bound
=> First_Node_Id
,
4001 Table_Initial
=> Alloc
.Nodes_Initial
,
4002 Table_Increment
=> Alloc
.Nodes_Increment
,
4003 Table_Name
=> "Flags");
4005 end Atree_Private_Part
;