1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2007, 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 2, 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. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
22 -- As a special exception, if other files instantiate generics from this --
23 -- unit, or you link this unit with other files to produce an executable, --
24 -- this unit does not by itself cause the resulting executable to be --
25 -- covered by the GNU General Public License. This exception does not --
26 -- however invalidate any other reasons why the executable file might be --
27 -- covered by the GNU Public License. --
29 -- GNAT was originally developed by the GNAT team at New York University. --
30 -- Extensive contributions were provided by Ada Core Technologies Inc. --
32 ------------------------------------------------------------------------------
35 with Sinfo; use Sinfo;
36 with Einfo; use Einfo;
37 with Namet; use Namet;
38 with Types; use Types;
39 with Snames; use Snames;
40 with System; use System;
42 with Uintp; use Uintp;
43 with Urealp; use Urealp;
44 with Unchecked_Conversion;
48 -- This package defines the format of the tree used to represent the Ada
49 -- program internally. Syntactic and semantic information is combined in
50 -- this tree. There is no separate symbol table structure.
52 -- WARNING: There is a C version of this package. Any changes to this
53 -- source file must be properly reflected in the C header file atree.h
55 -- Package Atree defines the basic structure of the tree and its nodes and
56 -- provides the basic abstract interface for manipulating the tree. Two
57 -- other packages use this interface to define the representation of Ada
58 -- programs using this tree format. The package Sinfo defines the basic
59 -- representation of the syntactic structure of the program, as output
60 -- by the parser. The package Entity_Info defines the semantic information
61 -- which is added to the tree nodes that represent declared entities (i.e.
62 -- the information which might typically be described in a separate symbol
65 -- The front end of the compiler first parses the program and generates a
66 -- tree that is simply a syntactic representation of the program in abstract
67 -- syntax tree format. Subsequent processing in the front end traverses the
68 -- tree, transforming it in various ways and adding semantic information.
70 ----------------------------------------
71 -- Definitions of Fields in Tree Node --
72 ----------------------------------------
74 -- The representation of the tree is completely hidden, using a functional
75 -- interface for accessing and modifying the contents of nodes. Logically
76 -- a node contains a number of fields, much as though the nodes were
77 -- defined as a record type. The fields in a node are as follows:
79 -- Nkind Indicates the kind of the node. This field is present
80 -- in all nodes. The type is Node_Kind, which is declared
81 -- in the package Sinfo.
83 -- Sloc Location (Source_Ptr) of the corresponding token
84 -- in the Source buffer. The individual node definitions
85 -- show which token is referenced by this pointer.
87 -- In_List A flag used to indicate if the node is a member
90 -- Rewrite_Sub A flag set if the node has been rewritten using
91 -- the Rewrite procedure. The original value of the
92 -- node is retrievable with Original_Node.
94 -- Rewrite_Ins A flag set if a node is marked as a rewrite inserted
95 -- node as a result of a call to Mark_Rewrite_Insertion.
97 -- Paren_Count A 2-bit count used on expression nodes to indicate
98 -- the level of parentheses. Up to 3 levels can be
99 -- accomodated. Anything more than 3 levels is treated
100 -- as 3 levels (conformance tests that complain about
101 -- this are hereby deemed pathological!). Set to zero
102 -- for non-subexpression nodes.
105 -- This flag is present in all nodes. It is set if the
106 -- node is built by the scanner or parser, and clear if
107 -- the node is built by the analyzer or expander. It
108 -- indicates that the node corresponds to a construct
109 -- that appears in the original source program.
111 -- Analyzed This flag is present in all nodes. It is set when
112 -- a node is analyzed, and is used to avoid analyzing
113 -- the same node twice. Analysis includes expansion if
114 -- expansion is active, so in this case if the flag is
115 -- set it means the node has been analyzed and expanded.
117 -- Error_Posted This flag is present in all nodes. It is set when
118 -- an error message is posted which is associated with
119 -- the flagged node. This is used to avoid posting more
120 -- than one message on the same node.
126 -- Field5 Five fields holding Union_Id values
128 -- ElistN Synonym for FieldN typed as Elist_Id (Empty = No_Elist)
129 -- ListN Synonym for FieldN typed as List_Id
130 -- NameN Synonym for FieldN typed as Name_Id
131 -- NodeN Synonym for FieldN typed as Node_Id
132 -- StrN Synonym for FieldN typed as String_Id
133 -- UintN Synonym for FieldN typed as Uint (Empty = Uint_0)
134 -- UrealN Synonym for FieldN typed as Ureal
136 -- Note: in the case of ElistN and UintN fields, it is common that we
137 -- end up with a value of Union_Id'(0) as the default value. This value
138 -- is meaningless as a Uint or Elist_Id value. We have two choices here.
139 -- We could require that all Uint and Elist fields be initialized to an
140 -- appropriate value, but that's error prone, since it would be easy to
141 -- miss an initialization. So instead we have the retrieval functions
142 -- generate an appropriate default value (Uint_0 or No_Elist). Probably
143 -- it would be cleaner to generate No_Uint in the Uint case but we got
144 -- stuck with representing an "unset" size value as zero early on, and
145 -- it will take a bit of fiddling to change that ???
147 -- Note: the actual usage of FieldN (i.e. whether it contains a Elist_Id,
148 -- List_Id, Name_Id, Node_Id, String_Id, Uint or Ureal) depends on the
149 -- value in Nkind. Generally the access to this field is always via the
150 -- functional interface, so the field names ElistN, ListN, NameN, NodeN,
151 -- StrN, UintN and UrealN are used only in the bodies of the access
152 -- functions (i.e. in the bodies of Sinfo and Einfo). These access
153 -- functions contain debugging code that checks that the use is
154 -- consistent with Nkind and Ekind values.
156 -- However, in specialized circumstances (examples are the circuit in
157 -- generic instantiation to copy trees, and in the tree dump routine),
158 -- it is useful to be able to do untyped traversals, and an internal
159 -- package in Atree allows for direct untyped accesses in such cases.
161 -- Flag4 Fifteen Boolean flags (use depends on Nkind and
162 -- Flag5 Ekind, as described for FieldN). Again the access
163 -- Flag6 is usually via subprograms in Sinfo and Einfo which
164 -- Flag7 provide high-level synonyms for these flags, and
165 -- Flag8 contain debugging code that checks that the values
166 -- Flag9 in Nkind and Ekind are appropriate for the access.
168 -- Flag11 Note that Flag1-3 are missing from this list. The
169 -- Flag12 first three flag positions are reserved for the
170 -- Flag13 standard flags (Comes_From_Source, Error_Posted,
171 -- Flag14 and Analyzed)
177 -- Link For a node, points to the Parent. For a list, points
178 -- to the list header. Note that in the latter case, a
179 -- client cannot modify the link field. This field is
180 -- private to the Atree package (but is also modified
181 -- by the Nlists package).
183 -- The following additional fields are present in extended nodes used
184 -- for entities (Nkind in N_Entity).
186 -- Ekind Entity type. This field indicates the type of the
187 -- entity, it is of type Entity_Kind which is defined
190 -- Flag19 229 additional flags
194 -- Convention Entity convention (Convention_Id value)
196 -- Field6 Additional Union_Id value stored in tree
198 -- Node6 Synonym for Field6 typed as Node_Id
199 -- Elist6 Synonym for Field6 typed as Elist_Id (Empty = No_Elist)
200 -- Uint6 Synonym for Field6 typed as Uint (Empty = Uint_0)
202 -- Similar definitions for Field7 to Field28 (and Node7-Node28,
203 -- Elist7-Elist28, Uint7-Uint28, Ureal7-Ureal28). Note that not all
204 -- these functions are defined, only the ones that are actually used.
206 type Paren_Count_Type is mod 4;
207 for Paren_Count_Type'Size use 2;
208 -- Type used for Paren_Count field
210 function Last_Node_Id return Node_Id;
211 pragma Inline (Last_Node_Id);
212 -- Returns Id of last allocated node Id
214 function Nodes_Address return System.Address;
215 -- Return address of Nodes table (used in Back_End for Gigi call)
217 function Num_Nodes return Nat;
218 -- Total number of nodes allocated, where an entity counts as a single
219 -- node. This count is incremented every time a node or entity is
220 -- allocated, and decremented every time a node or entity is deleted.
221 -- This value is used by Xref and by Treepr to allocate hash tables of
222 -- suitable size for hashing Node_Id values.
224 -----------------------
225 -- Use of Empty Node --
226 -----------------------
228 -- The special Node_Id Empty is used to mark missing fields. Whenever the
229 -- syntax has an optional component, then the corresponding field will be
230 -- set to Empty if the component is missing.
232 -- Note: Empty is not used to describe an empty list. Instead in this
233 -- case the node field contains a list which is empty, and these cases
234 -- should be distinguished (essentially from a type point of view, Empty
235 -- is a Node, and is thus not a list).
237 -- Note: Empty does in fact correspond to an allocated node. Only the
238 -- Nkind field of this node may be referenced. It contains N_Empty, which
239 -- uniquely identifies the empty case. This allows the Nkind field to be
240 -- dereferenced before the check for Empty which is sometimes useful.
242 -----------------------
243 -- Use of Error Node --
244 -----------------------
246 -- The Error node is used during syntactic and semantic analysis to
247 -- indicate that the corresponding piece of syntactic structure or
248 -- semantic meaning cannot properly be represented in the tree because
249 -- of an illegality in the program.
251 -- If an Error node is encountered, then you know that a previous
252 -- illegality has been detected. The proper reaction should be to
253 -- avoid posting related cascaded error messages, and to propagate
254 -- the error node if necessary.
256 ------------------------
257 -- Current_Error_Node --
258 ------------------------
260 -- The current error node is a global location indicating the current
261 -- node that is being processed for the purposes of placing a compiler
262 -- abort message. This is not necessarily perfectly accurate, it is
263 -- just a reasonably accurate best guess. It is used to output the
264 -- source location in the abort message by Comperr, and also to
265 -- implement the d3 debugging flag. This is also used by Rtsfind
266 -- to generate error messages for high integrity mode.
268 -- There are two ways this gets set. During parsing, when new source
269 -- nodes are being constructed by calls to New_Node and New_Entity,
270 -- either one of these calls sets Current_Error_Node to the newly
271 -- created node. During semantic analysis, this mechanism is not
272 -- used, and instead Current_Error_Node is set by the subprograms in
273 -- Debug_A that mark the start and end of analysis/expansion of a
276 Current_Error_Node : Node_Id;
277 -- Node to place error messages
279 -------------------------------
280 -- Default Setting of Fields --
281 -------------------------------
283 -- Nkind is set to N_Unused_At_Start
285 -- Ekind is set to E_Void
287 -- Sloc is always set, there is no default value
289 -- Field1-5 fields are set to Empty
291 -- Field6-22 fields in extended nodes are set to Empty
293 -- Parent is set to Empty
295 -- All Boolean flag fields are set to False
297 -- Note: the value Empty is used in Field1-Field17 to indicate a null node.
298 -- The usage varies. The common uses are to indicate absence of an
299 -- optional clause or a completely unused Field1-17 field.
301 -------------------------------------
302 -- Use of Synonyms for Node Fields --
303 -------------------------------------
305 -- A subpackage Atree.Unchecked_Access provides routines for reading and
306 -- writing the fields defined above (Field1-27, Node1-27, Flag1-247 etc).
307 -- These unchecked access routines can be used for untyped traversals.
308 -- In addition they are used in the implementations of the Sinfo and
309 -- Einfo packages. These packages both provide logical synonyms for
310 -- the generic fields, together with an appropriate set of access routines.
311 -- Normally access to information within tree nodes uses these synonyms,
312 -- providing a high level typed interface to the tree information.
314 --------------------------------------------------
315 -- Node Allocation and Modification Subprograms --
316 --------------------------------------------------
318 -- Generally the parser builds the tree and then it is further decorated
319 -- (e.g. by setting the entity fields), but not fundamentally modified.
320 -- However, there are cases in which the tree must be restructured by
321 -- adding and rearranging nodes, as a result of disambiguating cases
322 -- which the parser could not parse correctly, and adding additional
323 -- semantic information (e.g. making constraint checks explicit). The
324 -- following subprograms are used for constructing the tree in the first
325 -- place, and then for subsequent modifications as required.
327 procedure Initialize;
328 -- Called at the start of compilation to initialize the allocation of
329 -- the node and list tables and make the standard entries for Empty,
330 -- Error and Error_List. Note that Initialize must not be called if
331 -- Tree_Read is used.
334 -- Called before the back end is invoked to lock the nodes table
335 -- Also called after Unlock to relock???
338 -- Unlocks nodes table, in cases where the back end needs to modify it
341 -- Initializes internal tables from current tree file using the relevant
342 -- Table.Tree_Read routines. Note that Initialize should not be called if
343 -- Tree_Read is used. Tree_Read includes all necessary initialization.
345 procedure Tree_Write;
346 -- Writes out internal tables to current tree file using the relevant
347 -- Table.Tree_Write routines.
350 (New_Node_Kind : Node_Kind;
351 New_Sloc : Source_Ptr) return Node_Id;
352 -- Allocates a completely new node with the given node type and source
353 -- location values. All other fields are set to their standard defaults:
355 -- Empty for all FieldN fields
356 -- False for all FlagN fields
358 -- The usual approach is to build a new node using this function and
359 -- then, using the value returned, use the Set_xxx functions to set
360 -- fields of the node as required. New_Node can only be used for
361 -- non-entity nodes, i.e. it never generates an extended node.
363 -- If we are currently parsing, as indicated by a previous call to
364 -- Set_Comes_From_Source_Default (True), then this call also resets
365 -- the value of Current_Error_Node.
368 (New_Node_Kind : Node_Kind;
369 New_Sloc : Source_Ptr) return Entity_Id;
370 -- Similar to New_Node, except that it is used only for entity nodes
371 -- and returns an extended node.
373 procedure Set_Comes_From_Source_Default (Default : Boolean);
374 -- Sets value of Comes_From_Source flag to be used in all subsequent
375 -- New_Node and New_Entity calls until another call to this procedure
376 -- changes the default. This value is set True during parsing and
377 -- False during semantic analysis. This is also used to determine
378 -- if New_Node and New_Entity should set Current_Error_Node.
380 function Get_Comes_From_Source_Default return Boolean;
381 pragma Inline (Get_Comes_From_Source_Default);
382 -- Gets the current value of the Comes_From_Source flag
384 procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id);
385 pragma Inline (Preserve_Comes_From_Source);
386 -- When a node is rewritten, it is sometimes appropriate to preserve the
387 -- original comes from source indication. This is true when the rewrite
388 -- essentially corresponds to a transformation corresponding exactly to
389 -- semantics in the reference manual. This procedure copies the setting
390 -- of Comes_From_Source from OldN to NewN.
392 function Has_Extension (N : Node_Id) return Boolean;
393 pragma Inline (Has_Extension);
394 -- Returns True if the given node has an extension (i.e. was created by
395 -- a call to New_Entity rather than New_Node, and Nkind is in N_Entity)
397 procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind);
398 -- This procedure replaces the given node by setting its Nkind field to
399 -- the indicated value and resetting all other fields to their default
400 -- values except for Sloc, which is unchanged, and the Parent pointer
401 -- and list links, which are also unchanged. All other information in
402 -- the original node is lost. The new node has an extension if the
403 -- original node had an extension.
405 procedure Copy_Node (Source : Node_Id; Destination : Node_Id);
406 -- Copy the entire contents of the source node to the destination node.
407 -- The contents of the source node is not affected. If the source node
408 -- has an extension, then the destination must have an extension also.
409 -- The parent pointer of the destination and its list link, if any, are
410 -- not affected by the copy. Note that parent pointers of descendents
411 -- are not adjusted, so the descendents of the destination node after
412 -- the Copy_Node is completed have dubious parent pointers.
414 function New_Copy (Source : Node_Id) return Node_Id;
415 -- This function allocates a completely new node, and then initializes
416 -- it by copying the contents of the source node into it. The contents
417 -- of the source node is not affected. The target node is always marked
418 -- as not being in a list (even if the source is a list member). The
419 -- new node will have an extension if the source has an extension.
420 -- New_Copy (Empty) returns Empty and New_Copy (Error) returns Error.
421 -- Note that, unlike New_Copy_Tree, New_Copy does not recursively copy any
422 -- descendents, so in general parent pointers are not set correctly for
423 -- the descendents of the copied node. Both normal and extended nodes
424 -- (entities) may be copied using New_Copy.
426 function Relocate_Node (Source : Node_Id) return Node_Id;
427 -- Source is a non-entity node that is to be relocated. A new node is
428 -- allocated and the contents of Source are copied to this node using
429 -- Copy_Node. The parent pointers of descendents of the node are then
430 -- adjusted to point to the relocated copy. The original node is not
431 -- modified, but the parent pointers of its descendents are no longer
432 -- valid. This routine is used in conjunction with the tree rewrite
433 -- routines (see descriptions of Replace/Rewrite).
435 -- Note that the resulting node has the same parent as the source
436 -- node, and is thus still attached to the tree. It is valid for
437 -- Source to be Empty, in which case Relocate_Node simply returns
438 -- Empty as the result.
440 function New_Copy_Tree
442 Map : Elist_Id := No_Elist;
443 New_Sloc : Source_Ptr := No_Location;
444 New_Scope : Entity_Id := Empty) return Node_Id;
445 -- Given a node that is the root of a subtree, Copy_Tree copies the entire
446 -- syntactic subtree, including recursively any descendents whose parent
447 -- field references a copied node (descendents not linked to a copied node
448 -- by the parent field are not copied, instead the copied tree references
449 -- the same descendent as the original in this case, which is appropriate
450 -- for non-syntactic fields such as Etype). The parent pointers in the
451 -- copy are properly set. Copy_Tree (Empty/Error) returns Empty/Error.
452 -- The one exception to the rule of not copying semantic fields is that
453 -- any implicit types attached to the subtree are duplicated, so that
454 -- the copy contains a distinct set of implicit type entities. The Map
455 -- argument, if set to a non-empty Elist, specifies a set of mappings
456 -- to be applied to entities in the tree. The map has the form:
459 -- new entity to replace references to entity 1
461 -- new entity to replace references to entity 2
464 -- The call destroys the contents of Map in this case
466 -- The parameter New_Sloc, if set to a value other than No_Location, is
467 -- used as the Sloc value for all nodes in the new copy. If New_Sloc is
468 -- set to its default value No_Location, then the Sloc values of the
469 -- nodes in the copy are simply copied from the corresponding original.
471 -- The Comes_From_Source indication is unchanged if New_Sloc is set to
472 -- the default No_Location value, but is reset if New_Sloc is given, since
473 -- in this case the result clearly is neither a source node or an exact
474 -- copy of a source node.
476 -- The parameter New_Scope, if set to a value other than Empty, is the
477 -- value to use as the Scope for any Itypes that are copied. The most
478 -- typical value for this parameter, if given, is Current_Scope.
480 function Copy_Separate_Tree (Source : Node_Id) return Node_Id;
481 -- Given a node that is the root of a subtree, Copy_Separate_Tree copies
482 -- the entire syntactic subtree, including recursively any descendants
483 -- whose parent field references a copied node (descendants not linked to
484 -- a copied node by the parent field are also copied.) The parent pointers
485 -- in the copy are properly set. Copy_Separate_Tree (Empty/Error) returns
486 -- Empty/Error. The semantic fields are not copied and the new subtree
487 -- does not share any entity with source subtree.
488 -- But the code *does* copy semantic fields, and the description above
489 -- is in any case unclear on this point ??? (RBKD)
491 procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id);
492 -- Exchange the contents of two entities. The parent pointers are switched
493 -- as well as the Defining_Identifier fields in the parents, so that the
494 -- entities point correctly to their original parents. The effect is thus
495 -- to leave the tree completely unchanged in structure, except that the
496 -- entity ID values of the two entities are interchanged. Neither of the
497 -- two entities may be list members.
499 procedure Delete_Node (Node : Node_Id);
500 -- The node, which must not be a list member, is deleted from the tree and
501 -- its type is set to N_Unused_At_End. It is an error (not necessarily
502 -- detected) to reference this node after it has been deleted. The
503 -- implementation of the body of Atree is free to reuse the node to
504 -- satisfy future node allocation requests, but is not required to do so.
506 procedure Delete_Tree (Node : Node_Id);
507 -- The entire syntactic subtree referenced by Node (i.e. the given node
508 -- and all its syntactic descendents) are deleted as described above for
511 function Extend_Node (Node : Node_Id) return Entity_Id;
512 -- This function returns a copy of its input node with an extension
513 -- added. The fields of the extension are set to Empty. Due to the way
514 -- extensions are handled (as four consecutive array elements), it may
515 -- be necessary to reallocate the node, so that the returned value is
516 -- not the same as the input value, but where possible the returned
517 -- value will be the same as the input value (i.e. the extension will
518 -- occur in place). It is the caller's responsibility to ensure that
519 -- any pointers to the original node are appropriately updated. This
520 -- function is used only by Sinfo.CN to change nodes into their
521 -- corresponding entities.
523 type Traverse_Result is (OK, OK_Orig, Skip, Abandon);
524 -- This is the type of the result returned by the Process function passed
525 -- to Traverse_Func and Traverse_Proc and also the type of the result of
526 -- Traverse_Func itself. See descriptions below for details.
529 with function Process (N : Node_Id) return Traverse_Result is <>;
530 function Traverse_Func (Node : Node_Id) return Traverse_Result;
531 -- This is a generic function that, given the parent node for a subtree,
532 -- traverses all syntactic nodes of this tree, calling the given function
533 -- Process on each one. The traversal is controlled as follows by the
534 -- result returned by Process:
536 -- OK The traversal continues normally with the syntactic
537 -- children of the node just processed.
539 -- OK_Orig The traversal continues normally with the syntactic
540 -- children of the original node of the node just processed.
542 -- Skip The children of the node just processed are skipped and
543 -- excluded from the traversal, but otherwise processing
544 -- continues elsewhere in the tree.
546 -- Abandon The entire traversal is immediately abandoned, and the
547 -- original call to Traverse returns Abandon.
549 -- The result returned by Traverse is Abandon if processing was terminated
550 -- by a call to Process returning Abandon, otherwise it is OK (meaning that
551 -- all calls to process returned either OK or Skip).
554 with function Process (N : Node_Id) return Traverse_Result is <>;
555 procedure Traverse_Proc (Node : Node_Id);
556 pragma Inline (Traverse_Proc);
557 -- This is similar to Traverse_Func except that no result is returned,
558 -- i.e. Traverse_Func is called and the result is simply discarded.
560 ---------------------------
561 -- Node Access Functions --
562 ---------------------------
564 -- The following functions return the contents of the indicated field of
565 -- the node referenced by the argument, which is a Node_Id.
567 function Nkind (N : Node_Id) return Node_Kind;
568 pragma Inline (Nkind);
570 function Analyzed (N : Node_Id) return Boolean;
571 pragma Inline (Analyzed);
573 function Comes_From_Source (N : Node_Id) return Boolean;
574 pragma Inline (Comes_From_Source);
576 function Error_Posted (N : Node_Id) return Boolean;
577 pragma Inline (Error_Posted);
579 function Sloc (N : Node_Id) return Source_Ptr;
580 pragma Inline (Sloc);
582 function Paren_Count (N : Node_Id) return Paren_Count_Type;
583 pragma Inline (Paren_Count);
585 function Parent (N : Node_Id) return Node_Id;
586 pragma Inline (Parent);
587 -- Returns the parent of a node if the node is not a list member, or
588 -- else the parent of the list containing the node if the node is a
591 function No (N : Node_Id) return Boolean;
593 -- Tests given Id for equality with the Empty node. This allows notations
594 -- like "if No (Variant_Part)" as opposed to "if Variant_Part = Empty".
596 function Present (N : Node_Id) return Boolean;
597 pragma Inline (Present);
598 -- Tests given Id for inequality with the Empty node. This allows notations
599 -- like "if Present (Statement)" as opposed to "if Statement /= Empty".
601 -----------------------------
602 -- Entity Access Functions --
603 -----------------------------
605 -- The following functions apply only to Entity_Id values, i.e.
606 -- to extended nodes.
608 function Ekind (E : Entity_Id) return Entity_Kind;
609 pragma Inline (Ekind);
611 function Convention (E : Entity_Id) return Convention_Id;
612 pragma Inline (Convention);
614 ----------------------------
615 -- Node Update Procedures --
616 ----------------------------
618 -- The following functions set a specified field in the node whose Id is
619 -- passed as the first argument. The second parameter is the new value
620 -- to be set in the specified field. Note that Set_Nkind is in the next
621 -- section, since its use is restricted.
623 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr);
624 pragma Inline (Set_Sloc);
626 procedure Set_Paren_Count (N : Node_Id; Val : Paren_Count_Type);
627 pragma Inline (Set_Paren_Count);
629 procedure Set_Parent (N : Node_Id; Val : Node_Id);
630 pragma Inline (Set_Parent);
632 procedure Set_Analyzed (N : Node_Id; Val : Boolean := True);
633 pragma Inline (Set_Analyzed);
635 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True);
636 pragma Inline (Set_Error_Posted);
638 procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean);
639 pragma Inline (Set_Comes_From_Source);
640 -- Note that this routine is very rarely used, since usually the
641 -- default mechanism provided sets the right value, but in some
642 -- unusual cases, the value needs to be reset (e.g. when a source
643 -- node is copied, and the copy must not have Comes_From_Source set.
645 ------------------------------
646 -- Entity Update Procedures --
647 ------------------------------
649 -- The following procedures apply only to Entity_Id values, i.e.
650 -- to extended nodes.
652 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind);
653 pragma Inline (Set_Ekind);
655 procedure Set_Convention (E : Entity_Id; Val : Convention_Id);
656 pragma Inline (Set_Convention);
658 ---------------------------
659 -- Tree Rewrite Routines --
660 ---------------------------
662 -- During the compilation process it is necessary in a number of situations
663 -- to rewrite the tree. In some cases, such rewrites do not affect the
664 -- structure of the tree, for example, when an indexed component node is
665 -- replaced by the corresponding call node (the parser cannot distinguish
666 -- between these two cases).
668 -- In other situations, the rewrite does affect the structure of the
669 -- tree. Examples are the replacement of a generic instantiation by the
670 -- instantiated spec and body, and the static evaluation of expressions.
672 -- If such structural modifications are done by the expander, there are
673 -- no difficulties, since the form of the tree after the expander has no
674 -- special significance, except as input to the backend of the compiler.
675 -- However, if these modifications are done by the semantic phase, then
676 -- it is important that they be done in a manner which allows the original
677 -- tree to be preserved. This is because tools like pretty printers need
678 -- to have this original tree structure available.
680 -- The subprograms in this section allow rewriting of the tree by either
681 -- insertion of new nodes in an existing list, or complete replacement of
682 -- a subtree. The resulting tree for most purposes looks as though it has
683 -- been really changed, and there is no trace of the original. However,
684 -- special subprograms, also defined in this section, allow the original
685 -- tree to be reconstructed if necessary.
687 -- For tree modifications done in the expander, it is permissible to
688 -- destroy the original tree, although it is also allowable to use the
689 -- tree rewrite routines where it is convenient to do so.
691 procedure Mark_Rewrite_Insertion (New_Node : Node_Id);
692 pragma Inline (Mark_Rewrite_Insertion);
693 -- This procedure marks the given node as an insertion made during a tree
694 -- rewriting operation. Only the root needs to be marked. The call does
695 -- not do the actual insertion, which must be done using one of the normal
696 -- list insertion routines. The node is treated normally in all respects
697 -- except for its response to Is_Rewrite_Insertion. The function of these
698 -- calls is to be able to get an accurate original tree. This helps the
699 -- accuracy of Sprint.Sprint_Node, and in particular, when stubs are being
700 -- generated, it is essential that the original tree be accurate.
702 function Is_Rewrite_Insertion (Node : Node_Id) return Boolean;
703 pragma Inline (Is_Rewrite_Insertion);
704 -- Tests whether the given node was marked using Set_Rewrite_Insert. This
705 -- is used in reconstructing the original tree (where such nodes are to
706 -- be eliminated from the reconstructed tree).
708 procedure Rewrite (Old_Node, New_Node : Node_Id);
709 -- This is used when a complete subtree is to be replaced. Old_Node is the
710 -- root of the old subtree to be replaced, and New_Node is the root of the
711 -- newly constructed replacement subtree. The actual mechanism is to swap
712 -- the contents of these two nodes fixing up the parent pointers of the
713 -- replaced node (we do not attempt to preserve parent pointers for the
714 -- original node). Neither Old_Node nor New_Node can be extended nodes.
716 -- Note: New_Node may not contain references to Old_Node, for example as
717 -- descendents, since the rewrite would make such references invalid. If
718 -- New_Node does need to reference Old_Node, then these references should
719 -- be to a relocated copy of Old_Node (see Relocate_Node procedure).
721 -- Note: The Original_Node function applied to Old_Node (which has now
722 -- been replaced by the contents of New_Node), can be used to obtain the
723 -- original node, i.e. the old contents of Old_Node.
725 procedure Replace (Old_Node, New_Node : Node_Id);
726 -- This is similar to Rewrite, except that the old value of Old_Node is
727 -- not saved, and the New_Node is deleted after the replace, since it
728 -- is assumed that it can no longer be legitimately needed. The flag
729 -- Is_Rewrite_Susbtitute will be False for the resulting node, unless
730 -- it was already true on entry, and Original_Node will not return the
731 -- original contents of the Old_Node, but rather the New_Node value (unless
732 -- Old_Node had already been rewritten using Rewrite). Replace also
733 -- preserves the setting of Comes_From_Source.
735 -- Note, New_Node may not contain references to Old_Node, for example as
736 -- descendents, since the rewrite would make such references invalid. If
737 -- New_Node does need to reference Old_Node, then these references should
738 -- be to a relocated copy of Old_Node (see Relocate_Node procedure).
740 -- Replace is used in certain circumstances where it is desirable to
741 -- suppress any history of the rewriting operation. Notably, it is used
742 -- when the parser has mis-classified a node (e.g. a task entry call
743 -- that the parser has parsed as a procedure call).
745 function Is_Rewrite_Substitution (Node : Node_Id) return Boolean;
746 pragma Inline (Is_Rewrite_Substitution);
747 -- Return True iff Node has been rewritten (i.e. if Node is the root
748 -- of a subtree which was installed using Rewrite).
750 function Original_Node (Node : Node_Id) return Node_Id;
751 pragma Inline (Original_Node);
752 -- If Node has not been rewritten, then returns its input argument
753 -- unchanged, else returns the Node for the original subtree.
755 -- Note: Parents are not preserved in original tree nodes that are
756 -- retrieved in this way (i.e. their children may have children whose
757 -- pointers which reference some other node).
759 -- Note: there is no direct mechanism for deleting an original node (in
760 -- a manner that can be reversed later). One possible approach is to use
761 -- Rewrite to substitute a null statement for the node to be deleted.
763 -----------------------------------
764 -- Generic Field Access Routines --
765 -----------------------------------
767 -- This subpackage provides the functions for accessing and procedures
768 -- for setting fields that are normally referenced by their logical
769 -- synonyms defined in packages Sinfo and Einfo. As previously
770 -- described the implementations of these packages use the package
771 -- Atree.Unchecked_Access.
773 package Unchecked_Access is
775 -- Functions to allow interpretation of Union_Id values as Uint
778 function To_Union is new Unchecked_Conversion (Uint, Union_Id);
779 function To_Union is new Unchecked_Conversion (Ureal, Union_Id);
781 function From_Union is new Unchecked_Conversion (Union_Id, Uint);
782 function From_Union is new Unchecked_Conversion (Union_Id, Ureal);
784 -- Functions to fetch contents of indicated field. It is an error
785 -- to attempt to read the value of a field which is not present.
787 function Field1 (N : Node_Id) return Union_Id;
788 pragma Inline (Field1);
790 function Field2 (N : Node_Id) return Union_Id;
791 pragma Inline (Field2);
793 function Field3 (N : Node_Id) return Union_Id;
794 pragma Inline (Field3);
796 function Field4 (N : Node_Id) return Union_Id;
797 pragma Inline (Field4);
799 function Field5 (N : Node_Id) return Union_Id;
800 pragma Inline (Field5);
802 function Field6 (N : Node_Id) return Union_Id;
803 pragma Inline (Field6);
805 function Field7 (N : Node_Id) return Union_Id;
806 pragma Inline (Field7);
808 function Field8 (N : Node_Id) return Union_Id;
809 pragma Inline (Field8);
811 function Field9 (N : Node_Id) return Union_Id;
812 pragma Inline (Field9);
814 function Field10 (N : Node_Id) return Union_Id;
815 pragma Inline (Field10);
817 function Field11 (N : Node_Id) return Union_Id;
818 pragma Inline (Field11);
820 function Field12 (N : Node_Id) return Union_Id;
821 pragma Inline (Field12);
823 function Field13 (N : Node_Id) return Union_Id;
824 pragma Inline (Field13);
826 function Field14 (N : Node_Id) return Union_Id;
827 pragma Inline (Field14);
829 function Field15 (N : Node_Id) return Union_Id;
830 pragma Inline (Field15);
832 function Field16 (N : Node_Id) return Union_Id;
833 pragma Inline (Field16);
835 function Field17 (N : Node_Id) return Union_Id;
836 pragma Inline (Field17);
838 function Field18 (N : Node_Id) return Union_Id;
839 pragma Inline (Field18);
841 function Field19 (N : Node_Id) return Union_Id;
842 pragma Inline (Field19);
844 function Field20 (N : Node_Id) return Union_Id;
845 pragma Inline (Field20);
847 function Field21 (N : Node_Id) return Union_Id;
848 pragma Inline (Field21);
850 function Field22 (N : Node_Id) return Union_Id;
851 pragma Inline (Field22);
853 function Field23 (N : Node_Id) return Union_Id;
854 pragma Inline (Field23);
856 function Field24 (N : Node_Id) return Union_Id;
857 pragma Inline (Field24);
859 function Field25 (N : Node_Id) return Union_Id;
860 pragma Inline (Field25);
862 function Field26 (N : Node_Id) return Union_Id;
863 pragma Inline (Field26);
865 function Field27 (N : Node_Id) return Union_Id;
866 pragma Inline (Field27);
868 function Field28 (N : Node_Id) return Union_Id;
869 pragma Inline (Field28);
871 function Node1 (N : Node_Id) return Node_Id;
872 pragma Inline (Node1);
874 function Node2 (N : Node_Id) return Node_Id;
875 pragma Inline (Node2);
877 function Node3 (N : Node_Id) return Node_Id;
878 pragma Inline (Node3);
880 function Node4 (N : Node_Id) return Node_Id;
881 pragma Inline (Node4);
883 function Node5 (N : Node_Id) return Node_Id;
884 pragma Inline (Node5);
886 function Node6 (N : Node_Id) return Node_Id;
887 pragma Inline (Node6);
889 function Node7 (N : Node_Id) return Node_Id;
890 pragma Inline (Node7);
892 function Node8 (N : Node_Id) return Node_Id;
893 pragma Inline (Node8);
895 function Node9 (N : Node_Id) return Node_Id;
896 pragma Inline (Node9);
898 function Node10 (N : Node_Id) return Node_Id;
899 pragma Inline (Node10);
901 function Node11 (N : Node_Id) return Node_Id;
902 pragma Inline (Node11);
904 function Node12 (N : Node_Id) return Node_Id;
905 pragma Inline (Node12);
907 function Node13 (N : Node_Id) return Node_Id;
908 pragma Inline (Node13);
910 function Node14 (N : Node_Id) return Node_Id;
911 pragma Inline (Node14);
913 function Node15 (N : Node_Id) return Node_Id;
914 pragma Inline (Node15);
916 function Node16 (N : Node_Id) return Node_Id;
917 pragma Inline (Node16);
919 function Node17 (N : Node_Id) return Node_Id;
920 pragma Inline (Node17);
922 function Node18 (N : Node_Id) return Node_Id;
923 pragma Inline (Node18);
925 function Node19 (N : Node_Id) return Node_Id;
926 pragma Inline (Node19);
928 function Node20 (N : Node_Id) return Node_Id;
929 pragma Inline (Node20);
931 function Node21 (N : Node_Id) return Node_Id;
932 pragma Inline (Node21);
934 function Node22 (N : Node_Id) return Node_Id;
935 pragma Inline (Node22);
937 function Node23 (N : Node_Id) return Node_Id;
938 pragma Inline (Node23);
940 function Node24 (N : Node_Id) return Node_Id;
941 pragma Inline (Node24);
943 function Node25 (N : Node_Id) return Node_Id;
944 pragma Inline (Node25);
946 function Node26 (N : Node_Id) return Node_Id;
947 pragma Inline (Node26);
949 function Node27 (N : Node_Id) return Node_Id;
950 pragma Inline (Node27);
952 function Node28 (N : Node_Id) return Node_Id;
953 pragma Inline (Node28);
955 function List1 (N : Node_Id) return List_Id;
956 pragma Inline (List1);
958 function List2 (N : Node_Id) return List_Id;
959 pragma Inline (List2);
961 function List3 (N : Node_Id) return List_Id;
962 pragma Inline (List3);
964 function List4 (N : Node_Id) return List_Id;
965 pragma Inline (List4);
967 function List5 (N : Node_Id) return List_Id;
968 pragma Inline (List5);
970 function List10 (N : Node_Id) return List_Id;
971 pragma Inline (List10);
973 function List14 (N : Node_Id) return List_Id;
974 pragma Inline (List14);
976 function Elist1 (N : Node_Id) return Elist_Id;
977 pragma Inline (Elist1);
979 function Elist2 (N : Node_Id) return Elist_Id;
980 pragma Inline (Elist2);
982 function Elist3 (N : Node_Id) return Elist_Id;
983 pragma Inline (Elist3);
985 function Elist4 (N : Node_Id) return Elist_Id;
986 pragma Inline (Elist4);
988 function Elist8 (N : Node_Id) return Elist_Id;
989 pragma Inline (Elist8);
991 function Elist13 (N : Node_Id) return Elist_Id;
992 pragma Inline (Elist13);
994 function Elist15 (N : Node_Id) return Elist_Id;
995 pragma Inline (Elist15);
997 function Elist16 (N : Node_Id) return Elist_Id;
998 pragma Inline (Elist16);
1000 function Elist18 (N : Node_Id) return Elist_Id;
1001 pragma Inline (Elist18);
1003 function Elist21 (N : Node_Id) return Elist_Id;
1004 pragma Inline (Elist21);
1006 function Elist23 (N : Node_Id) return Elist_Id;
1007 pragma Inline (Elist23);
1009 function Elist25 (N : Node_Id) return Elist_Id;
1010 pragma Inline (Elist25);
1012 function Name1 (N : Node_Id) return Name_Id;
1013 pragma Inline (Name1);
1015 function Name2 (N : Node_Id) return Name_Id;
1016 pragma Inline (Name2);
1018 function Str3 (N : Node_Id) return String_Id;
1019 pragma Inline (Str3);
1021 -- Note: the following Uintnn functions have a special test for
1022 -- the Field value being Empty. If an Empty value is found then
1023 -- Uint_0 is returned. This avoids the rather tricky requirement
1024 -- of initializing all Uint fields in nodes and entities.
1026 function Uint2 (N : Node_Id) return Uint;
1027 pragma Inline (Uint2);
1029 function Uint3 (N : Node_Id) return Uint;
1030 pragma Inline (Uint3);
1032 function Uint4 (N : Node_Id) return Uint;
1033 pragma Inline (Uint4);
1035 function Uint5 (N : Node_Id) return Uint;
1036 pragma Inline (Uint5);
1038 function Uint8 (N : Node_Id) return Uint;
1039 pragma Inline (Uint8);
1041 function Uint9 (N : Node_Id) return Uint;
1042 pragma Inline (Uint9);
1044 function Uint10 (N : Node_Id) return Uint;
1045 pragma Inline (Uint10);
1047 function Uint11 (N : Node_Id) return Uint;
1048 pragma Inline (Uint11);
1050 function Uint12 (N : Node_Id) return Uint;
1051 pragma Inline (Uint12);
1053 function Uint13 (N : Node_Id) return Uint;
1054 pragma Inline (Uint13);
1056 function Uint14 (N : Node_Id) return Uint;
1057 pragma Inline (Uint14);
1059 function Uint15 (N : Node_Id) return Uint;
1060 pragma Inline (Uint15);
1062 function Uint16 (N : Node_Id) return Uint;
1063 pragma Inline (Uint16);
1065 function Uint17 (N : Node_Id) return Uint;
1066 pragma Inline (Uint17);
1068 function Uint22 (N : Node_Id) return Uint;
1069 pragma Inline (Uint22);
1071 function Ureal3 (N : Node_Id) return Ureal;
1072 pragma Inline (Ureal3);
1074 function Ureal18 (N : Node_Id) return Ureal;
1075 pragma Inline (Ureal18);
1077 function Ureal21 (N : Node_Id) return Ureal;
1078 pragma Inline (Ureal21);
1080 function Flag4 (N : Node_Id) return Boolean;
1081 pragma Inline (Flag4);
1083 function Flag5 (N : Node_Id) return Boolean;
1084 pragma Inline (Flag5);
1086 function Flag6 (N : Node_Id) return Boolean;
1087 pragma Inline (Flag6);
1089 function Flag7 (N : Node_Id) return Boolean;
1090 pragma Inline (Flag7);
1092 function Flag8 (N : Node_Id) return Boolean;
1093 pragma Inline (Flag8);
1095 function Flag9 (N : Node_Id) return Boolean;
1096 pragma Inline (Flag9);
1098 function Flag10 (N : Node_Id) return Boolean;
1099 pragma Inline (Flag10);
1101 function Flag11 (N : Node_Id) return Boolean;
1102 pragma Inline (Flag11);
1104 function Flag12 (N : Node_Id) return Boolean;
1105 pragma Inline (Flag12);
1107 function Flag13 (N : Node_Id) return Boolean;
1108 pragma Inline (Flag13);
1110 function Flag14 (N : Node_Id) return Boolean;
1111 pragma Inline (Flag14);
1113 function Flag15 (N : Node_Id) return Boolean;
1114 pragma Inline (Flag15);
1116 function Flag16 (N : Node_Id) return Boolean;
1117 pragma Inline (Flag16);
1119 function Flag17 (N : Node_Id) return Boolean;
1120 pragma Inline (Flag17);
1122 function Flag18 (N : Node_Id) return Boolean;
1123 pragma Inline (Flag18);
1125 function Flag19 (N : Node_Id) return Boolean;
1126 pragma Inline (Flag19);
1128 function Flag20 (N : Node_Id) return Boolean;
1129 pragma Inline (Flag20);
1131 function Flag21 (N : Node_Id) return Boolean;
1132 pragma Inline (Flag21);
1134 function Flag22 (N : Node_Id) return Boolean;
1135 pragma Inline (Flag22);
1137 function Flag23 (N : Node_Id) return Boolean;
1138 pragma Inline (Flag23);
1140 function Flag24 (N : Node_Id) return Boolean;
1141 pragma Inline (Flag24);
1143 function Flag25 (N : Node_Id) return Boolean;
1144 pragma Inline (Flag25);
1146 function Flag26 (N : Node_Id) return Boolean;
1147 pragma Inline (Flag26);
1149 function Flag27 (N : Node_Id) return Boolean;
1150 pragma Inline (Flag27);
1152 function Flag28 (N : Node_Id) return Boolean;
1153 pragma Inline (Flag28);
1155 function Flag29 (N : Node_Id) return Boolean;
1156 pragma Inline (Flag29);
1158 function Flag30 (N : Node_Id) return Boolean;
1159 pragma Inline (Flag30);
1161 function Flag31 (N : Node_Id) return Boolean;
1162 pragma Inline (Flag31);
1164 function Flag32 (N : Node_Id) return Boolean;
1165 pragma Inline (Flag32);
1167 function Flag33 (N : Node_Id) return Boolean;
1168 pragma Inline (Flag33);
1170 function Flag34 (N : Node_Id) return Boolean;
1171 pragma Inline (Flag34);
1173 function Flag35 (N : Node_Id) return Boolean;
1174 pragma Inline (Flag35);
1176 function Flag36 (N : Node_Id) return Boolean;
1177 pragma Inline (Flag36);
1179 function Flag37 (N : Node_Id) return Boolean;
1180 pragma Inline (Flag37);
1182 function Flag38 (N : Node_Id) return Boolean;
1183 pragma Inline (Flag38);
1185 function Flag39 (N : Node_Id) return Boolean;
1186 pragma Inline (Flag39);
1188 function Flag40 (N : Node_Id) return Boolean;
1189 pragma Inline (Flag40);
1191 function Flag41 (N : Node_Id) return Boolean;
1192 pragma Inline (Flag41);
1194 function Flag42 (N : Node_Id) return Boolean;
1195 pragma Inline (Flag42);
1197 function Flag43 (N : Node_Id) return Boolean;
1198 pragma Inline (Flag43);
1200 function Flag44 (N : Node_Id) return Boolean;
1201 pragma Inline (Flag44);
1203 function Flag45 (N : Node_Id) return Boolean;
1204 pragma Inline (Flag45);
1206 function Flag46 (N : Node_Id) return Boolean;
1207 pragma Inline (Flag46);
1209 function Flag47 (N : Node_Id) return Boolean;
1210 pragma Inline (Flag47);
1212 function Flag48 (N : Node_Id) return Boolean;
1213 pragma Inline (Flag48);
1215 function Flag49 (N : Node_Id) return Boolean;
1216 pragma Inline (Flag49);
1218 function Flag50 (N : Node_Id) return Boolean;
1219 pragma Inline (Flag50);
1221 function Flag51 (N : Node_Id) return Boolean;
1222 pragma Inline (Flag51);
1224 function Flag52 (N : Node_Id) return Boolean;
1225 pragma Inline (Flag52);
1227 function Flag53 (N : Node_Id) return Boolean;
1228 pragma Inline (Flag53);
1230 function Flag54 (N : Node_Id) return Boolean;
1231 pragma Inline (Flag54);
1233 function Flag55 (N : Node_Id) return Boolean;
1234 pragma Inline (Flag55);
1236 function Flag56 (N : Node_Id) return Boolean;
1237 pragma Inline (Flag56);
1239 function Flag57 (N : Node_Id) return Boolean;
1240 pragma Inline (Flag57);
1242 function Flag58 (N : Node_Id) return Boolean;
1243 pragma Inline (Flag58);
1245 function Flag59 (N : Node_Id) return Boolean;
1246 pragma Inline (Flag59);
1248 function Flag60 (N : Node_Id) return Boolean;
1249 pragma Inline (Flag60);
1251 function Flag61 (N : Node_Id) return Boolean;
1252 pragma Inline (Flag61);
1254 function Flag62 (N : Node_Id) return Boolean;
1255 pragma Inline (Flag62);
1257 function Flag63 (N : Node_Id) return Boolean;
1258 pragma Inline (Flag63);
1260 function Flag64 (N : Node_Id) return Boolean;
1261 pragma Inline (Flag64);
1263 function Flag65 (N : Node_Id) return Boolean;
1264 pragma Inline (Flag65);
1266 function Flag66 (N : Node_Id) return Boolean;
1267 pragma Inline (Flag66);
1269 function Flag67 (N : Node_Id) return Boolean;
1270 pragma Inline (Flag67);
1272 function Flag68 (N : Node_Id) return Boolean;
1273 pragma Inline (Flag68);
1275 function Flag69 (N : Node_Id) return Boolean;
1276 pragma Inline (Flag69);
1278 function Flag70 (N : Node_Id) return Boolean;
1279 pragma Inline (Flag70);
1281 function Flag71 (N : Node_Id) return Boolean;
1282 pragma Inline (Flag71);
1284 function Flag72 (N : Node_Id) return Boolean;
1285 pragma Inline (Flag72);
1287 function Flag73 (N : Node_Id) return Boolean;
1288 pragma Inline (Flag73);
1290 function Flag74 (N : Node_Id) return Boolean;
1291 pragma Inline (Flag74);
1293 function Flag75 (N : Node_Id) return Boolean;
1294 pragma Inline (Flag75);
1296 function Flag76 (N : Node_Id) return Boolean;
1297 pragma Inline (Flag76);
1299 function Flag77 (N : Node_Id) return Boolean;
1300 pragma Inline (Flag77);
1302 function Flag78 (N : Node_Id) return Boolean;
1303 pragma Inline (Flag78);
1305 function Flag79 (N : Node_Id) return Boolean;
1306 pragma Inline (Flag79);
1308 function Flag80 (N : Node_Id) return Boolean;
1309 pragma Inline (Flag80);
1311 function Flag81 (N : Node_Id) return Boolean;
1312 pragma Inline (Flag81);
1314 function Flag82 (N : Node_Id) return Boolean;
1315 pragma Inline (Flag82);
1317 function Flag83 (N : Node_Id) return Boolean;
1318 pragma Inline (Flag83);
1320 function Flag84 (N : Node_Id) return Boolean;
1321 pragma Inline (Flag84);
1323 function Flag85 (N : Node_Id) return Boolean;
1324 pragma Inline (Flag85);
1326 function Flag86 (N : Node_Id) return Boolean;
1327 pragma Inline (Flag86);
1329 function Flag87 (N : Node_Id) return Boolean;
1330 pragma Inline (Flag87);
1332 function Flag88 (N : Node_Id) return Boolean;
1333 pragma Inline (Flag88);
1335 function Flag89 (N : Node_Id) return Boolean;
1336 pragma Inline (Flag89);
1338 function Flag90 (N : Node_Id) return Boolean;
1339 pragma Inline (Flag90);
1341 function Flag91 (N : Node_Id) return Boolean;
1342 pragma Inline (Flag91);
1344 function Flag92 (N : Node_Id) return Boolean;
1345 pragma Inline (Flag92);
1347 function Flag93 (N : Node_Id) return Boolean;
1348 pragma Inline (Flag93);
1350 function Flag94 (N : Node_Id) return Boolean;
1351 pragma Inline (Flag94);
1353 function Flag95 (N : Node_Id) return Boolean;
1354 pragma Inline (Flag95);
1356 function Flag96 (N : Node_Id) return Boolean;
1357 pragma Inline (Flag96);
1359 function Flag97 (N : Node_Id) return Boolean;
1360 pragma Inline (Flag97);
1362 function Flag98 (N : Node_Id) return Boolean;
1363 pragma Inline (Flag98);
1365 function Flag99 (N : Node_Id) return Boolean;
1366 pragma Inline (Flag99);
1368 function Flag100 (N : Node_Id) return Boolean;
1369 pragma Inline (Flag100);
1371 function Flag101 (N : Node_Id) return Boolean;
1372 pragma Inline (Flag101);
1374 function Flag102 (N : Node_Id) return Boolean;
1375 pragma Inline (Flag102);
1377 function Flag103 (N : Node_Id) return Boolean;
1378 pragma Inline (Flag103);
1380 function Flag104 (N : Node_Id) return Boolean;
1381 pragma Inline (Flag104);
1383 function Flag105 (N : Node_Id) return Boolean;
1384 pragma Inline (Flag105);
1386 function Flag106 (N : Node_Id) return Boolean;
1387 pragma Inline (Flag106);
1389 function Flag107 (N : Node_Id) return Boolean;
1390 pragma Inline (Flag107);
1392 function Flag108 (N : Node_Id) return Boolean;
1393 pragma Inline (Flag108);
1395 function Flag109 (N : Node_Id) return Boolean;
1396 pragma Inline (Flag109);
1398 function Flag110 (N : Node_Id) return Boolean;
1399 pragma Inline (Flag110);
1401 function Flag111 (N : Node_Id) return Boolean;
1402 pragma Inline (Flag111);
1404 function Flag112 (N : Node_Id) return Boolean;
1405 pragma Inline (Flag112);
1407 function Flag113 (N : Node_Id) return Boolean;
1408 pragma Inline (Flag113);
1410 function Flag114 (N : Node_Id) return Boolean;
1411 pragma Inline (Flag114);
1413 function Flag115 (N : Node_Id) return Boolean;
1414 pragma Inline (Flag115);
1416 function Flag116 (N : Node_Id) return Boolean;
1417 pragma Inline (Flag116);
1419 function Flag117 (N : Node_Id) return Boolean;
1420 pragma Inline (Flag117);
1422 function Flag118 (N : Node_Id) return Boolean;
1423 pragma Inline (Flag118);
1425 function Flag119 (N : Node_Id) return Boolean;
1426 pragma Inline (Flag119);
1428 function Flag120 (N : Node_Id) return Boolean;
1429 pragma Inline (Flag120);
1431 function Flag121 (N : Node_Id) return Boolean;
1432 pragma Inline (Flag121);
1434 function Flag122 (N : Node_Id) return Boolean;
1435 pragma Inline (Flag122);
1437 function Flag123 (N : Node_Id) return Boolean;
1438 pragma Inline (Flag123);
1440 function Flag124 (N : Node_Id) return Boolean;
1441 pragma Inline (Flag124);
1443 function Flag125 (N : Node_Id) return Boolean;
1444 pragma Inline (Flag125);
1446 function Flag126 (N : Node_Id) return Boolean;
1447 pragma Inline (Flag126);
1449 function Flag127 (N : Node_Id) return Boolean;
1450 pragma Inline (Flag127);
1452 function Flag128 (N : Node_Id) return Boolean;
1453 pragma Inline (Flag128);
1455 function Flag129 (N : Node_Id) return Boolean;
1456 pragma Inline (Flag129);
1458 function Flag130 (N : Node_Id) return Boolean;
1459 pragma Inline (Flag130);
1461 function Flag131 (N : Node_Id) return Boolean;
1462 pragma Inline (Flag131);
1464 function Flag132 (N : Node_Id) return Boolean;
1465 pragma Inline (Flag132);
1467 function Flag133 (N : Node_Id) return Boolean;
1468 pragma Inline (Flag133);
1470 function Flag134 (N : Node_Id) return Boolean;
1471 pragma Inline (Flag134);
1473 function Flag135 (N : Node_Id) return Boolean;
1474 pragma Inline (Flag135);
1476 function Flag136 (N : Node_Id) return Boolean;
1477 pragma Inline (Flag136);
1479 function Flag137 (N : Node_Id) return Boolean;
1480 pragma Inline (Flag137);
1482 function Flag138 (N : Node_Id) return Boolean;
1483 pragma Inline (Flag138);
1485 function Flag139 (N : Node_Id) return Boolean;
1486 pragma Inline (Flag139);
1488 function Flag140 (N : Node_Id) return Boolean;
1489 pragma Inline (Flag140);
1491 function Flag141 (N : Node_Id) return Boolean;
1492 pragma Inline (Flag141);
1494 function Flag142 (N : Node_Id) return Boolean;
1495 pragma Inline (Flag142);
1497 function Flag143 (N : Node_Id) return Boolean;
1498 pragma Inline (Flag143);
1500 function Flag144 (N : Node_Id) return Boolean;
1501 pragma Inline (Flag144);
1503 function Flag145 (N : Node_Id) return Boolean;
1504 pragma Inline (Flag145);
1506 function Flag146 (N : Node_Id) return Boolean;
1507 pragma Inline (Flag146);
1509 function Flag147 (N : Node_Id) return Boolean;
1510 pragma Inline (Flag147);
1512 function Flag148 (N : Node_Id) return Boolean;
1513 pragma Inline (Flag148);
1515 function Flag149 (N : Node_Id) return Boolean;
1516 pragma Inline (Flag149);
1518 function Flag150 (N : Node_Id) return Boolean;
1519 pragma Inline (Flag150);
1521 function Flag151 (N : Node_Id) return Boolean;
1522 pragma Inline (Flag151);
1524 function Flag152 (N : Node_Id) return Boolean;
1525 pragma Inline (Flag152);
1527 function Flag153 (N : Node_Id) return Boolean;
1528 pragma Inline (Flag153);
1530 function Flag154 (N : Node_Id) return Boolean;
1531 pragma Inline (Flag154);
1533 function Flag155 (N : Node_Id) return Boolean;
1534 pragma Inline (Flag155);
1536 function Flag156 (N : Node_Id) return Boolean;
1537 pragma Inline (Flag156);
1539 function Flag157 (N : Node_Id) return Boolean;
1540 pragma Inline (Flag157);
1542 function Flag158 (N : Node_Id) return Boolean;
1543 pragma Inline (Flag158);
1545 function Flag159 (N : Node_Id) return Boolean;
1546 pragma Inline (Flag159);
1548 function Flag160 (N : Node_Id) return Boolean;
1549 pragma Inline (Flag160);
1551 function Flag161 (N : Node_Id) return Boolean;
1552 pragma Inline (Flag161);
1554 function Flag162 (N : Node_Id) return Boolean;
1555 pragma Inline (Flag162);
1557 function Flag163 (N : Node_Id) return Boolean;
1558 pragma Inline (Flag163);
1560 function Flag164 (N : Node_Id) return Boolean;
1561 pragma Inline (Flag164);
1563 function Flag165 (N : Node_Id) return Boolean;
1564 pragma Inline (Flag165);
1566 function Flag166 (N : Node_Id) return Boolean;
1567 pragma Inline (Flag166);
1569 function Flag167 (N : Node_Id) return Boolean;
1570 pragma Inline (Flag167);
1572 function Flag168 (N : Node_Id) return Boolean;
1573 pragma Inline (Flag168);
1575 function Flag169 (N : Node_Id) return Boolean;
1576 pragma Inline (Flag169);
1578 function Flag170 (N : Node_Id) return Boolean;
1579 pragma Inline (Flag170);
1581 function Flag171 (N : Node_Id) return Boolean;
1582 pragma Inline (Flag171);
1584 function Flag172 (N : Node_Id) return Boolean;
1585 pragma Inline (Flag172);
1587 function Flag173 (N : Node_Id) return Boolean;
1588 pragma Inline (Flag173);
1590 function Flag174 (N : Node_Id) return Boolean;
1591 pragma Inline (Flag174);
1593 function Flag175 (N : Node_Id) return Boolean;
1594 pragma Inline (Flag175);
1596 function Flag176 (N : Node_Id) return Boolean;
1597 pragma Inline (Flag176);
1599 function Flag177 (N : Node_Id) return Boolean;
1600 pragma Inline (Flag177);
1602 function Flag178 (N : Node_Id) return Boolean;
1603 pragma Inline (Flag178);
1605 function Flag179 (N : Node_Id) return Boolean;
1606 pragma Inline (Flag179);
1608 function Flag180 (N : Node_Id) return Boolean;
1609 pragma Inline (Flag180);
1611 function Flag181 (N : Node_Id) return Boolean;
1612 pragma Inline (Flag181);
1614 function Flag182 (N : Node_Id) return Boolean;
1615 pragma Inline (Flag182);
1617 function Flag183 (N : Node_Id) return Boolean;
1618 pragma Inline (Flag183);
1620 function Flag184 (N : Node_Id) return Boolean;
1621 pragma Inline (Flag184);
1623 function Flag185 (N : Node_Id) return Boolean;
1624 pragma Inline (Flag185);
1626 function Flag186 (N : Node_Id) return Boolean;
1627 pragma Inline (Flag186);
1629 function Flag187 (N : Node_Id) return Boolean;
1630 pragma Inline (Flag187);
1632 function Flag188 (N : Node_Id) return Boolean;
1633 pragma Inline (Flag188);
1635 function Flag189 (N : Node_Id) return Boolean;
1636 pragma Inline (Flag189);
1638 function Flag190 (N : Node_Id) return Boolean;
1639 pragma Inline (Flag190);
1641 function Flag191 (N : Node_Id) return Boolean;
1642 pragma Inline (Flag191);
1644 function Flag192 (N : Node_Id) return Boolean;
1645 pragma Inline (Flag192);
1647 function Flag193 (N : Node_Id) return Boolean;
1648 pragma Inline (Flag193);
1650 function Flag194 (N : Node_Id) return Boolean;
1651 pragma Inline (Flag194);
1653 function Flag195 (N : Node_Id) return Boolean;
1654 pragma Inline (Flag195);
1656 function Flag196 (N : Node_Id) return Boolean;
1657 pragma Inline (Flag196);
1659 function Flag197 (N : Node_Id) return Boolean;
1660 pragma Inline (Flag197);
1662 function Flag198 (N : Node_Id) return Boolean;
1663 pragma Inline (Flag198);
1665 function Flag199 (N : Node_Id) return Boolean;
1666 pragma Inline (Flag199);
1668 function Flag200 (N : Node_Id) return Boolean;
1669 pragma Inline (Flag200);
1671 function Flag201 (N : Node_Id) return Boolean;
1672 pragma Inline (Flag201);
1674 function Flag202 (N : Node_Id) return Boolean;
1675 pragma Inline (Flag202);
1677 function Flag203 (N : Node_Id) return Boolean;
1678 pragma Inline (Flag203);
1680 function Flag204 (N : Node_Id) return Boolean;
1681 pragma Inline (Flag204);
1683 function Flag205 (N : Node_Id) return Boolean;
1684 pragma Inline (Flag205);
1686 function Flag206 (N : Node_Id) return Boolean;
1687 pragma Inline (Flag206);
1689 function Flag207 (N : Node_Id) return Boolean;
1690 pragma Inline (Flag207);
1692 function Flag208 (N : Node_Id) return Boolean;
1693 pragma Inline (Flag208);
1695 function Flag209 (N : Node_Id) return Boolean;
1696 pragma Inline (Flag209);
1698 function Flag210 (N : Node_Id) return Boolean;
1699 pragma Inline (Flag210);
1701 function Flag211 (N : Node_Id) return Boolean;
1702 pragma Inline (Flag211);
1704 function Flag212 (N : Node_Id) return Boolean;
1705 pragma Inline (Flag212);
1707 function Flag213 (N : Node_Id) return Boolean;
1708 pragma Inline (Flag213);
1710 function Flag214 (N : Node_Id) return Boolean;
1711 pragma Inline (Flag214);
1713 function Flag215 (N : Node_Id) return Boolean;
1714 pragma Inline (Flag215);
1716 function Flag216 (N : Node_Id) return Boolean;
1717 pragma Inline (Flag216);
1719 function Flag217 (N : Node_Id) return Boolean;
1720 pragma Inline (Flag217);
1722 function Flag218 (N : Node_Id) return Boolean;
1723 pragma Inline (Flag218);
1725 function Flag219 (N : Node_Id) return Boolean;
1726 pragma Inline (Flag219);
1728 function Flag220 (N : Node_Id) return Boolean;
1729 pragma Inline (Flag220);
1731 function Flag221 (N : Node_Id) return Boolean;
1732 pragma Inline (Flag221);
1734 function Flag222 (N : Node_Id) return Boolean;
1735 pragma Inline (Flag222);
1737 function Flag223 (N : Node_Id) return Boolean;
1738 pragma Inline (Flag223);
1740 function Flag224 (N : Node_Id) return Boolean;
1741 pragma Inline (Flag224);
1743 function Flag225 (N : Node_Id) return Boolean;
1744 pragma Inline (Flag225);
1746 function Flag226 (N : Node_Id) return Boolean;
1747 pragma Inline (Flag226);
1749 function Flag227 (N : Node_Id) return Boolean;
1750 pragma Inline (Flag227);
1752 function Flag228 (N : Node_Id) return Boolean;
1753 pragma Inline (Flag228);
1755 function Flag229 (N : Node_Id) return Boolean;
1756 pragma Inline (Flag229);
1758 function Flag230 (N : Node_Id) return Boolean;
1759 pragma Inline (Flag230);
1761 -- Procedures to set value of indicated field
1763 procedure Set_Nkind (N : Node_Id; Val : Node_Kind);
1764 pragma Inline (Set_Nkind);
1766 procedure Set_Field1 (N : Node_Id; Val : Union_Id);
1767 pragma Inline (Set_Field1);
1769 procedure Set_Field2 (N : Node_Id; Val : Union_Id);
1770 pragma Inline (Set_Field2);
1772 procedure Set_Field3 (N : Node_Id; Val : Union_Id);
1773 pragma Inline (Set_Field3);
1775 procedure Set_Field4 (N : Node_Id; Val : Union_Id);
1776 pragma Inline (Set_Field4);
1778 procedure Set_Field5 (N : Node_Id; Val : Union_Id);
1779 pragma Inline (Set_Field5);
1781 procedure Set_Field6 (N : Node_Id; Val : Union_Id);
1782 pragma Inline (Set_Field6);
1784 procedure Set_Field7 (N : Node_Id; Val : Union_Id);
1785 pragma Inline (Set_Field7);
1787 procedure Set_Field8 (N : Node_Id; Val : Union_Id);
1788 pragma Inline (Set_Field8);
1790 procedure Set_Field9 (N : Node_Id; Val : Union_Id);
1791 pragma Inline (Set_Field9);
1793 procedure Set_Field10 (N : Node_Id; Val : Union_Id);
1794 pragma Inline (Set_Field10);
1796 procedure Set_Field11 (N : Node_Id; Val : Union_Id);
1797 pragma Inline (Set_Field11);
1799 procedure Set_Field12 (N : Node_Id; Val : Union_Id);
1800 pragma Inline (Set_Field12);
1802 procedure Set_Field13 (N : Node_Id; Val : Union_Id);
1803 pragma Inline (Set_Field13);
1805 procedure Set_Field14 (N : Node_Id; Val : Union_Id);
1806 pragma Inline (Set_Field14);
1808 procedure Set_Field15 (N : Node_Id; Val : Union_Id);
1809 pragma Inline (Set_Field15);
1811 procedure Set_Field16 (N : Node_Id; Val : Union_Id);
1812 pragma Inline (Set_Field16);
1814 procedure Set_Field17 (N : Node_Id; Val : Union_Id);
1815 pragma Inline (Set_Field17);
1817 procedure Set_Field18 (N : Node_Id; Val : Union_Id);
1818 pragma Inline (Set_Field18);
1820 procedure Set_Field19 (N : Node_Id; Val : Union_Id);
1821 pragma Inline (Set_Field19);
1823 procedure Set_Field20 (N : Node_Id; Val : Union_Id);
1824 pragma Inline (Set_Field20);
1826 procedure Set_Field21 (N : Node_Id; Val : Union_Id);
1827 pragma Inline (Set_Field21);
1829 procedure Set_Field22 (N : Node_Id; Val : Union_Id);
1830 pragma Inline (Set_Field22);
1832 procedure Set_Field23 (N : Node_Id; Val : Union_Id);
1833 pragma Inline (Set_Field23);
1835 procedure Set_Field24 (N : Node_Id; Val : Union_Id);
1836 pragma Inline (Set_Field24);
1838 procedure Set_Field25 (N : Node_Id; Val : Union_Id);
1839 pragma Inline (Set_Field25);
1841 procedure Set_Field26 (N : Node_Id; Val : Union_Id);
1842 pragma Inline (Set_Field26);
1844 procedure Set_Field27 (N : Node_Id; Val : Union_Id);
1845 pragma Inline (Set_Field27);
1847 procedure Set_Field28 (N : Node_Id; Val : Union_Id);
1848 pragma Inline (Set_Field28);
1850 procedure Set_Node1 (N : Node_Id; Val : Node_Id);
1851 pragma Inline (Set_Node1);
1853 procedure Set_Node2 (N : Node_Id; Val : Node_Id);
1854 pragma Inline (Set_Node2);
1856 procedure Set_Node3 (N : Node_Id; Val : Node_Id);
1857 pragma Inline (Set_Node3);
1859 procedure Set_Node4 (N : Node_Id; Val : Node_Id);
1860 pragma Inline (Set_Node4);
1862 procedure Set_Node5 (N : Node_Id; Val : Node_Id);
1863 pragma Inline (Set_Node5);
1865 procedure Set_Node6 (N : Node_Id; Val : Node_Id);
1866 pragma Inline (Set_Node6);
1868 procedure Set_Node7 (N : Node_Id; Val : Node_Id);
1869 pragma Inline (Set_Node7);
1871 procedure Set_Node8 (N : Node_Id; Val : Node_Id);
1872 pragma Inline (Set_Node8);
1874 procedure Set_Node9 (N : Node_Id; Val : Node_Id);
1875 pragma Inline (Set_Node9);
1877 procedure Set_Node10 (N : Node_Id; Val : Node_Id);
1878 pragma Inline (Set_Node10);
1880 procedure Set_Node11 (N : Node_Id; Val : Node_Id);
1881 pragma Inline (Set_Node11);
1883 procedure Set_Node12 (N : Node_Id; Val : Node_Id);
1884 pragma Inline (Set_Node12);
1886 procedure Set_Node13 (N : Node_Id; Val : Node_Id);
1887 pragma Inline (Set_Node13);
1889 procedure Set_Node14 (N : Node_Id; Val : Node_Id);
1890 pragma Inline (Set_Node14);
1892 procedure Set_Node15 (N : Node_Id; Val : Node_Id);
1893 pragma Inline (Set_Node15);
1895 procedure Set_Node16 (N : Node_Id; Val : Node_Id);
1896 pragma Inline (Set_Node16);
1898 procedure Set_Node17 (N : Node_Id; Val : Node_Id);
1899 pragma Inline (Set_Node17);
1901 procedure Set_Node18 (N : Node_Id; Val : Node_Id);
1902 pragma Inline (Set_Node18);
1904 procedure Set_Node19 (N : Node_Id; Val : Node_Id);
1905 pragma Inline (Set_Node19);
1907 procedure Set_Node20 (N : Node_Id; Val : Node_Id);
1908 pragma Inline (Set_Node20);
1910 procedure Set_Node21 (N : Node_Id; Val : Node_Id);
1911 pragma Inline (Set_Node21);
1913 procedure Set_Node22 (N : Node_Id; Val : Node_Id);
1914 pragma Inline (Set_Node22);
1916 procedure Set_Node23 (N : Node_Id; Val : Node_Id);
1917 pragma Inline (Set_Node23);
1919 procedure Set_Node24 (N : Node_Id; Val : Node_Id);
1920 pragma Inline (Set_Node24);
1922 procedure Set_Node25 (N : Node_Id; Val : Node_Id);
1923 pragma Inline (Set_Node25);
1925 procedure Set_Node26 (N : Node_Id; Val : Node_Id);
1926 pragma Inline (Set_Node26);
1928 procedure Set_Node27 (N : Node_Id; Val : Node_Id);
1929 pragma Inline (Set_Node27);
1931 procedure Set_Node28 (N : Node_Id; Val : Node_Id);
1932 pragma Inline (Set_Node28);
1934 procedure Set_List1 (N : Node_Id; Val : List_Id);
1935 pragma Inline (Set_List1);
1937 procedure Set_List2 (N : Node_Id; Val : List_Id);
1938 pragma Inline (Set_List2);
1940 procedure Set_List3 (N : Node_Id; Val : List_Id);
1941 pragma Inline (Set_List3);
1943 procedure Set_List4 (N : Node_Id; Val : List_Id);
1944 pragma Inline (Set_List4);
1946 procedure Set_List5 (N : Node_Id; Val : List_Id);
1947 pragma Inline (Set_List5);
1949 procedure Set_List10 (N : Node_Id; Val : List_Id);
1950 pragma Inline (Set_List10);
1952 procedure Set_List14 (N : Node_Id; Val : List_Id);
1953 pragma Inline (Set_List14);
1955 procedure Set_Elist1 (N : Node_Id; Val : Elist_Id);
1956 pragma Inline (Set_Elist1);
1958 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id);
1959 pragma Inline (Set_Elist2);
1961 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id);
1962 pragma Inline (Set_Elist3);
1964 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id);
1965 pragma Inline (Set_Elist4);
1967 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id);
1968 pragma Inline (Set_Elist8);
1970 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id);
1971 pragma Inline (Set_Elist13);
1973 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id);
1974 pragma Inline (Set_Elist15);
1976 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id);
1977 pragma Inline (Set_Elist16);
1979 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id);
1980 pragma Inline (Set_Elist18);
1982 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id);
1983 pragma Inline (Set_Elist21);
1985 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id);
1986 pragma Inline (Set_Elist23);
1988 procedure Set_Elist25 (N : Node_Id; Val : Elist_Id);
1989 pragma Inline (Set_Elist25);
1991 procedure Set_Name1 (N : Node_Id; Val : Name_Id);
1992 pragma Inline (Set_Name1);
1994 procedure Set_Name2 (N : Node_Id; Val : Name_Id);
1995 pragma Inline (Set_Name2);
1997 procedure Set_Str3 (N : Node_Id; Val : String_Id);
1998 pragma Inline (Set_Str3);
2000 procedure Set_Uint2 (N : Node_Id; Val : Uint);
2001 pragma Inline (Set_Uint2);
2003 procedure Set_Uint3 (N : Node_Id; Val : Uint);
2004 pragma Inline (Set_Uint3);
2006 procedure Set_Uint4 (N : Node_Id; Val : Uint);
2007 pragma Inline (Set_Uint4);
2009 procedure Set_Uint5 (N : Node_Id; Val : Uint);
2010 pragma Inline (Set_Uint5);
2012 procedure Set_Uint8 (N : Node_Id; Val : Uint);
2013 pragma Inline (Set_Uint8);
2015 procedure Set_Uint9 (N : Node_Id; Val : Uint);
2016 pragma Inline (Set_Uint9);
2018 procedure Set_Uint10 (N : Node_Id; Val : Uint);
2019 pragma Inline (Set_Uint10);
2021 procedure Set_Uint11 (N : Node_Id; Val : Uint);
2022 pragma Inline (Set_Uint11);
2024 procedure Set_Uint12 (N : Node_Id; Val : Uint);
2025 pragma Inline (Set_Uint12);
2027 procedure Set_Uint13 (N : Node_Id; Val : Uint);
2028 pragma Inline (Set_Uint13);
2030 procedure Set_Uint14 (N : Node_Id; Val : Uint);
2031 pragma Inline (Set_Uint14);
2033 procedure Set_Uint15 (N : Node_Id; Val : Uint);
2034 pragma Inline (Set_Uint15);
2036 procedure Set_Uint16 (N : Node_Id; Val : Uint);
2037 pragma Inline (Set_Uint16);
2039 procedure Set_Uint17 (N : Node_Id; Val : Uint);
2040 pragma Inline (Set_Uint17);
2042 procedure Set_Uint22 (N : Node_Id; Val : Uint);
2043 pragma Inline (Set_Uint22);
2045 procedure Set_Ureal3 (N : Node_Id; Val : Ureal);
2046 pragma Inline (Set_Ureal3);
2048 procedure Set_Ureal18 (N : Node_Id; Val : Ureal);
2049 pragma Inline (Set_Ureal18);
2051 procedure Set_Ureal21 (N : Node_Id; Val : Ureal);
2052 pragma Inline (Set_Ureal21);
2054 procedure Set_Flag4 (N : Node_Id; Val : Boolean);
2055 pragma Inline (Set_Flag4);
2057 procedure Set_Flag5 (N : Node_Id; Val : Boolean);
2058 pragma Inline (Set_Flag5);
2060 procedure Set_Flag6 (N : Node_Id; Val : Boolean);
2061 pragma Inline (Set_Flag6);
2063 procedure Set_Flag7 (N : Node_Id; Val : Boolean);
2064 pragma Inline (Set_Flag7);
2066 procedure Set_Flag8 (N : Node_Id; Val : Boolean);
2067 pragma Inline (Set_Flag8);
2069 procedure Set_Flag9 (N : Node_Id; Val : Boolean);
2070 pragma Inline (Set_Flag9);
2072 procedure Set_Flag10 (N : Node_Id; Val : Boolean);
2073 pragma Inline (Set_Flag10);
2075 procedure Set_Flag11 (N : Node_Id; Val : Boolean);
2076 pragma Inline (Set_Flag11);
2078 procedure Set_Flag12 (N : Node_Id; Val : Boolean);
2079 pragma Inline (Set_Flag12);
2081 procedure Set_Flag13 (N : Node_Id; Val : Boolean);
2082 pragma Inline (Set_Flag13);
2084 procedure Set_Flag14 (N : Node_Id; Val : Boolean);
2085 pragma Inline (Set_Flag14);
2087 procedure Set_Flag15 (N : Node_Id; Val : Boolean);
2088 pragma Inline (Set_Flag15);
2090 procedure Set_Flag16 (N : Node_Id; Val : Boolean);
2091 pragma Inline (Set_Flag16);
2093 procedure Set_Flag17 (N : Node_Id; Val : Boolean);
2094 pragma Inline (Set_Flag17);
2096 procedure Set_Flag18 (N : Node_Id; Val : Boolean);
2097 pragma Inline (Set_Flag18);
2099 procedure Set_Flag19 (N : Node_Id; Val : Boolean);
2100 pragma Inline (Set_Flag19);
2102 procedure Set_Flag20 (N : Node_Id; Val : Boolean);
2103 pragma Inline (Set_Flag20);
2105 procedure Set_Flag21 (N : Node_Id; Val : Boolean);
2106 pragma Inline (Set_Flag21);
2108 procedure Set_Flag22 (N : Node_Id; Val : Boolean);
2109 pragma Inline (Set_Flag22);
2111 procedure Set_Flag23 (N : Node_Id; Val : Boolean);
2112 pragma Inline (Set_Flag23);
2114 procedure Set_Flag24 (N : Node_Id; Val : Boolean);
2115 pragma Inline (Set_Flag24);
2117 procedure Set_Flag25 (N : Node_Id; Val : Boolean);
2118 pragma Inline (Set_Flag25);
2120 procedure Set_Flag26 (N : Node_Id; Val : Boolean);
2121 pragma Inline (Set_Flag26);
2123 procedure Set_Flag27 (N : Node_Id; Val : Boolean);
2124 pragma Inline (Set_Flag27);
2126 procedure Set_Flag28 (N : Node_Id; Val : Boolean);
2127 pragma Inline (Set_Flag28);
2129 procedure Set_Flag29 (N : Node_Id; Val : Boolean);
2130 pragma Inline (Set_Flag29);
2132 procedure Set_Flag30 (N : Node_Id; Val : Boolean);
2133 pragma Inline (Set_Flag30);
2135 procedure Set_Flag31 (N : Node_Id; Val : Boolean);
2136 pragma Inline (Set_Flag31);
2138 procedure Set_Flag32 (N : Node_Id; Val : Boolean);
2139 pragma Inline (Set_Flag32);
2141 procedure Set_Flag33 (N : Node_Id; Val : Boolean);
2142 pragma Inline (Set_Flag33);
2144 procedure Set_Flag34 (N : Node_Id; Val : Boolean);
2145 pragma Inline (Set_Flag34);
2147 procedure Set_Flag35 (N : Node_Id; Val : Boolean);
2148 pragma Inline (Set_Flag35);
2150 procedure Set_Flag36 (N : Node_Id; Val : Boolean);
2151 pragma Inline (Set_Flag36);
2153 procedure Set_Flag37 (N : Node_Id; Val : Boolean);
2154 pragma Inline (Set_Flag37);
2156 procedure Set_Flag38 (N : Node_Id; Val : Boolean);
2157 pragma Inline (Set_Flag38);
2159 procedure Set_Flag39 (N : Node_Id; Val : Boolean);
2160 pragma Inline (Set_Flag39);
2162 procedure Set_Flag40 (N : Node_Id; Val : Boolean);
2163 pragma Inline (Set_Flag40);
2165 procedure Set_Flag41 (N : Node_Id; Val : Boolean);
2166 pragma Inline (Set_Flag41);
2168 procedure Set_Flag42 (N : Node_Id; Val : Boolean);
2169 pragma Inline (Set_Flag42);
2171 procedure Set_Flag43 (N : Node_Id; Val : Boolean);
2172 pragma Inline (Set_Flag43);
2174 procedure Set_Flag44 (N : Node_Id; Val : Boolean);
2175 pragma Inline (Set_Flag44);
2177 procedure Set_Flag45 (N : Node_Id; Val : Boolean);
2178 pragma Inline (Set_Flag45);
2180 procedure Set_Flag46 (N : Node_Id; Val : Boolean);
2181 pragma Inline (Set_Flag46);
2183 procedure Set_Flag47 (N : Node_Id; Val : Boolean);
2184 pragma Inline (Set_Flag47);
2186 procedure Set_Flag48 (N : Node_Id; Val : Boolean);
2187 pragma Inline (Set_Flag48);
2189 procedure Set_Flag49 (N : Node_Id; Val : Boolean);
2190 pragma Inline (Set_Flag49);
2192 procedure Set_Flag50 (N : Node_Id; Val : Boolean);
2193 pragma Inline (Set_Flag50);
2195 procedure Set_Flag51 (N : Node_Id; Val : Boolean);
2196 pragma Inline (Set_Flag51);
2198 procedure Set_Flag52 (N : Node_Id; Val : Boolean);
2199 pragma Inline (Set_Flag52);
2201 procedure Set_Flag53 (N : Node_Id; Val : Boolean);
2202 pragma Inline (Set_Flag53);
2204 procedure Set_Flag54 (N : Node_Id; Val : Boolean);
2205 pragma Inline (Set_Flag54);
2207 procedure Set_Flag55 (N : Node_Id; Val : Boolean);
2208 pragma Inline (Set_Flag55);
2210 procedure Set_Flag56 (N : Node_Id; Val : Boolean);
2211 pragma Inline (Set_Flag56);
2213 procedure Set_Flag57 (N : Node_Id; Val : Boolean);
2214 pragma Inline (Set_Flag57);
2216 procedure Set_Flag58 (N : Node_Id; Val : Boolean);
2217 pragma Inline (Set_Flag58);
2219 procedure Set_Flag59 (N : Node_Id; Val : Boolean);
2220 pragma Inline (Set_Flag59);
2222 procedure Set_Flag60 (N : Node_Id; Val : Boolean);
2223 pragma Inline (Set_Flag60);
2225 procedure Set_Flag61 (N : Node_Id; Val : Boolean);
2226 pragma Inline (Set_Flag61);
2228 procedure Set_Flag62 (N : Node_Id; Val : Boolean);
2229 pragma Inline (Set_Flag62);
2231 procedure Set_Flag63 (N : Node_Id; Val : Boolean);
2232 pragma Inline (Set_Flag63);
2234 procedure Set_Flag64 (N : Node_Id; Val : Boolean);
2235 pragma Inline (Set_Flag64);
2237 procedure Set_Flag65 (N : Node_Id; Val : Boolean);
2238 pragma Inline (Set_Flag65);
2240 procedure Set_Flag66 (N : Node_Id; Val : Boolean);
2241 pragma Inline (Set_Flag66);
2243 procedure Set_Flag67 (N : Node_Id; Val : Boolean);
2244 pragma Inline (Set_Flag67);
2246 procedure Set_Flag68 (N : Node_Id; Val : Boolean);
2247 pragma Inline (Set_Flag68);
2249 procedure Set_Flag69 (N : Node_Id; Val : Boolean);
2250 pragma Inline (Set_Flag69);
2252 procedure Set_Flag70 (N : Node_Id; Val : Boolean);
2253 pragma Inline (Set_Flag70);
2255 procedure Set_Flag71 (N : Node_Id; Val : Boolean);
2256 pragma Inline (Set_Flag71);
2258 procedure Set_Flag72 (N : Node_Id; Val : Boolean);
2259 pragma Inline (Set_Flag72);
2261 procedure Set_Flag73 (N : Node_Id; Val : Boolean);
2262 pragma Inline (Set_Flag73);
2264 procedure Set_Flag74 (N : Node_Id; Val : Boolean);
2265 pragma Inline (Set_Flag74);
2267 procedure Set_Flag75 (N : Node_Id; Val : Boolean);
2268 pragma Inline (Set_Flag75);
2270 procedure Set_Flag76 (N : Node_Id; Val : Boolean);
2271 pragma Inline (Set_Flag76);
2273 procedure Set_Flag77 (N : Node_Id; Val : Boolean);
2274 pragma Inline (Set_Flag77);
2276 procedure Set_Flag78 (N : Node_Id; Val : Boolean);
2277 pragma Inline (Set_Flag78);
2279 procedure Set_Flag79 (N : Node_Id; Val : Boolean);
2280 pragma Inline (Set_Flag79);
2282 procedure Set_Flag80 (N : Node_Id; Val : Boolean);
2283 pragma Inline (Set_Flag80);
2285 procedure Set_Flag81 (N : Node_Id; Val : Boolean);
2286 pragma Inline (Set_Flag81);
2288 procedure Set_Flag82 (N : Node_Id; Val : Boolean);
2289 pragma Inline (Set_Flag82);
2291 procedure Set_Flag83 (N : Node_Id; Val : Boolean);
2292 pragma Inline (Set_Flag83);
2294 procedure Set_Flag84 (N : Node_Id; Val : Boolean);
2295 pragma Inline (Set_Flag84);
2297 procedure Set_Flag85 (N : Node_Id; Val : Boolean);
2298 pragma Inline (Set_Flag85);
2300 procedure Set_Flag86 (N : Node_Id; Val : Boolean);
2301 pragma Inline (Set_Flag86);
2303 procedure Set_Flag87 (N : Node_Id; Val : Boolean);
2304 pragma Inline (Set_Flag87);
2306 procedure Set_Flag88 (N : Node_Id; Val : Boolean);
2307 pragma Inline (Set_Flag88);
2309 procedure Set_Flag89 (N : Node_Id; Val : Boolean);
2310 pragma Inline (Set_Flag89);
2312 procedure Set_Flag90 (N : Node_Id; Val : Boolean);
2313 pragma Inline (Set_Flag90);
2315 procedure Set_Flag91 (N : Node_Id; Val : Boolean);
2316 pragma Inline (Set_Flag91);
2318 procedure Set_Flag92 (N : Node_Id; Val : Boolean);
2319 pragma Inline (Set_Flag92);
2321 procedure Set_Flag93 (N : Node_Id; Val : Boolean);
2322 pragma Inline (Set_Flag93);
2324 procedure Set_Flag94 (N : Node_Id; Val : Boolean);
2325 pragma Inline (Set_Flag94);
2327 procedure Set_Flag95 (N : Node_Id; Val : Boolean);
2328 pragma Inline (Set_Flag95);
2330 procedure Set_Flag96 (N : Node_Id; Val : Boolean);
2331 pragma Inline (Set_Flag96);
2333 procedure Set_Flag97 (N : Node_Id; Val : Boolean);
2334 pragma Inline (Set_Flag97);
2336 procedure Set_Flag98 (N : Node_Id; Val : Boolean);
2337 pragma Inline (Set_Flag98);
2339 procedure Set_Flag99 (N : Node_Id; Val : Boolean);
2340 pragma Inline (Set_Flag99);
2342 procedure Set_Flag100 (N : Node_Id; Val : Boolean);
2343 pragma Inline (Set_Flag100);
2345 procedure Set_Flag101 (N : Node_Id; Val : Boolean);
2346 pragma Inline (Set_Flag101);
2348 procedure Set_Flag102 (N : Node_Id; Val : Boolean);
2349 pragma Inline (Set_Flag102);
2351 procedure Set_Flag103 (N : Node_Id; Val : Boolean);
2352 pragma Inline (Set_Flag103);
2354 procedure Set_Flag104 (N : Node_Id; Val : Boolean);
2355 pragma Inline (Set_Flag104);
2357 procedure Set_Flag105 (N : Node_Id; Val : Boolean);
2358 pragma Inline (Set_Flag105);
2360 procedure Set_Flag106 (N : Node_Id; Val : Boolean);
2361 pragma Inline (Set_Flag106);
2363 procedure Set_Flag107 (N : Node_Id; Val : Boolean);
2364 pragma Inline (Set_Flag107);
2366 procedure Set_Flag108 (N : Node_Id; Val : Boolean);
2367 pragma Inline (Set_Flag108);
2369 procedure Set_Flag109 (N : Node_Id; Val : Boolean);
2370 pragma Inline (Set_Flag109);
2372 procedure Set_Flag110 (N : Node_Id; Val : Boolean);
2373 pragma Inline (Set_Flag110);
2375 procedure Set_Flag111 (N : Node_Id; Val : Boolean);
2376 pragma Inline (Set_Flag111);
2378 procedure Set_Flag112 (N : Node_Id; Val : Boolean);
2379 pragma Inline (Set_Flag112);
2381 procedure Set_Flag113 (N : Node_Id; Val : Boolean);
2382 pragma Inline (Set_Flag113);
2384 procedure Set_Flag114 (N : Node_Id; Val : Boolean);
2385 pragma Inline (Set_Flag114);
2387 procedure Set_Flag115 (N : Node_Id; Val : Boolean);
2388 pragma Inline (Set_Flag115);
2390 procedure Set_Flag116 (N : Node_Id; Val : Boolean);
2391 pragma Inline (Set_Flag116);
2393 procedure Set_Flag117 (N : Node_Id; Val : Boolean);
2394 pragma Inline (Set_Flag117);
2396 procedure Set_Flag118 (N : Node_Id; Val : Boolean);
2397 pragma Inline (Set_Flag118);
2399 procedure Set_Flag119 (N : Node_Id; Val : Boolean);
2400 pragma Inline (Set_Flag119);
2402 procedure Set_Flag120 (N : Node_Id; Val : Boolean);
2403 pragma Inline (Set_Flag120);
2405 procedure Set_Flag121 (N : Node_Id; Val : Boolean);
2406 pragma Inline (Set_Flag121);
2408 procedure Set_Flag122 (N : Node_Id; Val : Boolean);
2409 pragma Inline (Set_Flag122);
2411 procedure Set_Flag123 (N : Node_Id; Val : Boolean);
2412 pragma Inline (Set_Flag123);
2414 procedure Set_Flag124 (N : Node_Id; Val : Boolean);
2415 pragma Inline (Set_Flag124);
2417 procedure Set_Flag125 (N : Node_Id; Val : Boolean);
2418 pragma Inline (Set_Flag125);
2420 procedure Set_Flag126 (N : Node_Id; Val : Boolean);
2421 pragma Inline (Set_Flag126);
2423 procedure Set_Flag127 (N : Node_Id; Val : Boolean);
2424 pragma Inline (Set_Flag127);
2426 procedure Set_Flag128 (N : Node_Id; Val : Boolean);
2427 pragma Inline (Set_Flag128);
2429 procedure Set_Flag129 (N : Node_Id; Val : Boolean);
2430 pragma Inline (Set_Flag129);
2432 procedure Set_Flag130 (N : Node_Id; Val : Boolean);
2433 pragma Inline (Set_Flag130);
2435 procedure Set_Flag131 (N : Node_Id; Val : Boolean);
2436 pragma Inline (Set_Flag131);
2438 procedure Set_Flag132 (N : Node_Id; Val : Boolean);
2439 pragma Inline (Set_Flag132);
2441 procedure Set_Flag133 (N : Node_Id; Val : Boolean);
2442 pragma Inline (Set_Flag133);
2444 procedure Set_Flag134 (N : Node_Id; Val : Boolean);
2445 pragma Inline (Set_Flag134);
2447 procedure Set_Flag135 (N : Node_Id; Val : Boolean);
2448 pragma Inline (Set_Flag135);
2450 procedure Set_Flag136 (N : Node_Id; Val : Boolean);
2451 pragma Inline (Set_Flag136);
2453 procedure Set_Flag137 (N : Node_Id; Val : Boolean);
2454 pragma Inline (Set_Flag137);
2456 procedure Set_Flag138 (N : Node_Id; Val : Boolean);
2457 pragma Inline (Set_Flag138);
2459 procedure Set_Flag139 (N : Node_Id; Val : Boolean);
2460 pragma Inline (Set_Flag139);
2462 procedure Set_Flag140 (N : Node_Id; Val : Boolean);
2463 pragma Inline (Set_Flag140);
2465 procedure Set_Flag141 (N : Node_Id; Val : Boolean);
2466 pragma Inline (Set_Flag141);
2468 procedure Set_Flag142 (N : Node_Id; Val : Boolean);
2469 pragma Inline (Set_Flag142);
2471 procedure Set_Flag143 (N : Node_Id; Val : Boolean);
2472 pragma Inline (Set_Flag143);
2474 procedure Set_Flag144 (N : Node_Id; Val : Boolean);
2475 pragma Inline (Set_Flag144);
2477 procedure Set_Flag145 (N : Node_Id; Val : Boolean);
2478 pragma Inline (Set_Flag145);
2480 procedure Set_Flag146 (N : Node_Id; Val : Boolean);
2481 pragma Inline (Set_Flag146);
2483 procedure Set_Flag147 (N : Node_Id; Val : Boolean);
2484 pragma Inline (Set_Flag147);
2486 procedure Set_Flag148 (N : Node_Id; Val : Boolean);
2487 pragma Inline (Set_Flag148);
2489 procedure Set_Flag149 (N : Node_Id; Val : Boolean);
2490 pragma Inline (Set_Flag149);
2492 procedure Set_Flag150 (N : Node_Id; Val : Boolean);
2493 pragma Inline (Set_Flag150);
2495 procedure Set_Flag151 (N : Node_Id; Val : Boolean);
2496 pragma Inline (Set_Flag151);
2498 procedure Set_Flag152 (N : Node_Id; Val : Boolean);
2499 pragma Inline (Set_Flag152);
2501 procedure Set_Flag153 (N : Node_Id; Val : Boolean);
2502 pragma Inline (Set_Flag153);
2504 procedure Set_Flag154 (N : Node_Id; Val : Boolean);
2505 pragma Inline (Set_Flag154);
2507 procedure Set_Flag155 (N : Node_Id; Val : Boolean);
2508 pragma Inline (Set_Flag155);
2510 procedure Set_Flag156 (N : Node_Id; Val : Boolean);
2511 pragma Inline (Set_Flag156);
2513 procedure Set_Flag157 (N : Node_Id; Val : Boolean);
2514 pragma Inline (Set_Flag157);
2516 procedure Set_Flag158 (N : Node_Id; Val : Boolean);
2517 pragma Inline (Set_Flag158);
2519 procedure Set_Flag159 (N : Node_Id; Val : Boolean);
2520 pragma Inline (Set_Flag159);
2522 procedure Set_Flag160 (N : Node_Id; Val : Boolean);
2523 pragma Inline (Set_Flag160);
2525 procedure Set_Flag161 (N : Node_Id; Val : Boolean);
2526 pragma Inline (Set_Flag161);
2528 procedure Set_Flag162 (N : Node_Id; Val : Boolean);
2529 pragma Inline (Set_Flag162);
2531 procedure Set_Flag163 (N : Node_Id; Val : Boolean);
2532 pragma Inline (Set_Flag163);
2534 procedure Set_Flag164 (N : Node_Id; Val : Boolean);
2535 pragma Inline (Set_Flag164);
2537 procedure Set_Flag165 (N : Node_Id; Val : Boolean);
2538 pragma Inline (Set_Flag165);
2540 procedure Set_Flag166 (N : Node_Id; Val : Boolean);
2541 pragma Inline (Set_Flag166);
2543 procedure Set_Flag167 (N : Node_Id; Val : Boolean);
2544 pragma Inline (Set_Flag167);
2546 procedure Set_Flag168 (N : Node_Id; Val : Boolean);
2547 pragma Inline (Set_Flag168);
2549 procedure Set_Flag169 (N : Node_Id; Val : Boolean);
2550 pragma Inline (Set_Flag169);
2552 procedure Set_Flag170 (N : Node_Id; Val : Boolean);
2553 pragma Inline (Set_Flag170);
2555 procedure Set_Flag171 (N : Node_Id; Val : Boolean);
2556 pragma Inline (Set_Flag171);
2558 procedure Set_Flag172 (N : Node_Id; Val : Boolean);
2559 pragma Inline (Set_Flag172);
2561 procedure Set_Flag173 (N : Node_Id; Val : Boolean);
2562 pragma Inline (Set_Flag173);
2564 procedure Set_Flag174 (N : Node_Id; Val : Boolean);
2565 pragma Inline (Set_Flag174);
2567 procedure Set_Flag175 (N : Node_Id; Val : Boolean);
2568 pragma Inline (Set_Flag175);
2570 procedure Set_Flag176 (N : Node_Id; Val : Boolean);
2571 pragma Inline (Set_Flag176);
2573 procedure Set_Flag177 (N : Node_Id; Val : Boolean);
2574 pragma Inline (Set_Flag177);
2576 procedure Set_Flag178 (N : Node_Id; Val : Boolean);
2577 pragma Inline (Set_Flag178);
2579 procedure Set_Flag179 (N : Node_Id; Val : Boolean);
2580 pragma Inline (Set_Flag179);
2582 procedure Set_Flag180 (N : Node_Id; Val : Boolean);
2583 pragma Inline (Set_Flag180);
2585 procedure Set_Flag181 (N : Node_Id; Val : Boolean);
2586 pragma Inline (Set_Flag181);
2588 procedure Set_Flag182 (N : Node_Id; Val : Boolean);
2589 pragma Inline (Set_Flag182);
2591 procedure Set_Flag183 (N : Node_Id; Val : Boolean);
2592 pragma Inline (Set_Flag183);
2594 procedure Set_Flag184 (N : Node_Id; Val : Boolean);
2595 pragma Inline (Set_Flag184);
2597 procedure Set_Flag185 (N : Node_Id; Val : Boolean);
2598 pragma Inline (Set_Flag185);
2600 procedure Set_Flag186 (N : Node_Id; Val : Boolean);
2601 pragma Inline (Set_Flag186);
2603 procedure Set_Flag187 (N : Node_Id; Val : Boolean);
2604 pragma Inline (Set_Flag187);
2606 procedure Set_Flag188 (N : Node_Id; Val : Boolean);
2607 pragma Inline (Set_Flag188);
2609 procedure Set_Flag189 (N : Node_Id; Val : Boolean);
2610 pragma Inline (Set_Flag189);
2612 procedure Set_Flag190 (N : Node_Id; Val : Boolean);
2613 pragma Inline (Set_Flag190);
2615 procedure Set_Flag191 (N : Node_Id; Val : Boolean);
2616 pragma Inline (Set_Flag191);
2618 procedure Set_Flag192 (N : Node_Id; Val : Boolean);
2619 pragma Inline (Set_Flag192);
2621 procedure Set_Flag193 (N : Node_Id; Val : Boolean);
2622 pragma Inline (Set_Flag193);
2624 procedure Set_Flag194 (N : Node_Id; Val : Boolean);
2625 pragma Inline (Set_Flag194);
2627 procedure Set_Flag195 (N : Node_Id; Val : Boolean);
2628 pragma Inline (Set_Flag195);
2630 procedure Set_Flag196 (N : Node_Id; Val : Boolean);
2631 pragma Inline (Set_Flag196);
2633 procedure Set_Flag197 (N : Node_Id; Val : Boolean);
2634 pragma Inline (Set_Flag197);
2636 procedure Set_Flag198 (N : Node_Id; Val : Boolean);
2637 pragma Inline (Set_Flag198);
2639 procedure Set_Flag199 (N : Node_Id; Val : Boolean);
2640 pragma Inline (Set_Flag199);
2642 procedure Set_Flag200 (N : Node_Id; Val : Boolean);
2643 pragma Inline (Set_Flag200);
2645 procedure Set_Flag201 (N : Node_Id; Val : Boolean);
2646 pragma Inline (Set_Flag201);
2648 procedure Set_Flag202 (N : Node_Id; Val : Boolean);
2649 pragma Inline (Set_Flag202);
2651 procedure Set_Flag203 (N : Node_Id; Val : Boolean);
2652 pragma Inline (Set_Flag203);
2654 procedure Set_Flag204 (N : Node_Id; Val : Boolean);
2655 pragma Inline (Set_Flag204);
2657 procedure Set_Flag205 (N : Node_Id; Val : Boolean);
2658 pragma Inline (Set_Flag205);
2660 procedure Set_Flag206 (N : Node_Id; Val : Boolean);
2661 pragma Inline (Set_Flag206);
2663 procedure Set_Flag207 (N : Node_Id; Val : Boolean);
2664 pragma Inline (Set_Flag207);
2666 procedure Set_Flag208 (N : Node_Id; Val : Boolean);
2667 pragma Inline (Set_Flag208);
2669 procedure Set_Flag209 (N : Node_Id; Val : Boolean);
2670 pragma Inline (Set_Flag209);
2672 procedure Set_Flag210 (N : Node_Id; Val : Boolean);
2673 pragma Inline (Set_Flag210);
2675 procedure Set_Flag211 (N : Node_Id; Val : Boolean);
2676 pragma Inline (Set_Flag211);
2678 procedure Set_Flag212 (N : Node_Id; Val : Boolean);
2679 pragma Inline (Set_Flag212);
2681 procedure Set_Flag213 (N : Node_Id; Val : Boolean);
2682 pragma Inline (Set_Flag213);
2684 procedure Set_Flag214 (N : Node_Id; Val : Boolean);
2685 pragma Inline (Set_Flag214);
2687 procedure Set_Flag215 (N : Node_Id; Val : Boolean);
2688 pragma Inline (Set_Flag215);
2690 procedure Set_Flag216 (N : Node_Id; Val : Boolean);
2691 pragma Inline (Set_Flag216);
2693 procedure Set_Flag217 (N : Node_Id; Val : Boolean);
2694 pragma Inline (Set_Flag217);
2696 procedure Set_Flag218 (N : Node_Id; Val : Boolean);
2697 pragma Inline (Set_Flag218);
2699 procedure Set_Flag219 (N : Node_Id; Val : Boolean);
2700 pragma Inline (Set_Flag219);
2702 procedure Set_Flag220 (N : Node_Id; Val : Boolean);
2703 pragma Inline (Set_Flag220);
2705 procedure Set_Flag221 (N : Node_Id; Val : Boolean);
2706 pragma Inline (Set_Flag221);
2708 procedure Set_Flag222 (N : Node_Id; Val : Boolean);
2709 pragma Inline (Set_Flag222);
2711 procedure Set_Flag223 (N : Node_Id; Val : Boolean);
2712 pragma Inline (Set_Flag223);
2714 procedure Set_Flag224 (N : Node_Id; Val : Boolean);
2715 pragma Inline (Set_Flag224);
2717 procedure Set_Flag225 (N : Node_Id; Val : Boolean);
2718 pragma Inline (Set_Flag225);
2720 procedure Set_Flag226 (N : Node_Id; Val : Boolean);
2721 pragma Inline (Set_Flag226);
2723 procedure Set_Flag227 (N : Node_Id; Val : Boolean);
2724 pragma Inline (Set_Flag227);
2726 procedure Set_Flag228 (N : Node_Id; Val : Boolean);
2727 pragma Inline (Set_Flag228);
2729 procedure Set_Flag229 (N : Node_Id; Val : Boolean);
2730 pragma Inline (Set_Flag229);
2732 procedure Set_Flag230 (N : Node_Id; Val : Boolean);
2733 pragma Inline (Set_Flag230);
2735 -- The following versions of Set_Noden also set the parent
2736 -- pointer of the referenced node if it is non_Empty
2738 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id);
2739 pragma Inline (Set_Node1_With_Parent);
2741 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id);
2742 pragma Inline (Set_Node2_With_Parent);
2744 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id);
2745 pragma Inline (Set_Node3_With_Parent);
2747 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id);
2748 pragma Inline (Set_Node4_With_Parent);
2750 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id);
2751 pragma Inline (Set_Node5_With_Parent);
2753 -- The following versions of Set_Listn also set the parent pointer of
2754 -- the referenced node if it is non_Empty. The procedures for List6
2755 -- to List12 can only be applied to nodes which have an extension.
2757 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id);
2758 pragma Inline (Set_List1_With_Parent);
2760 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id);
2761 pragma Inline (Set_List2_With_Parent);
2763 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id);
2764 pragma Inline (Set_List3_With_Parent);
2766 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id);
2767 pragma Inline (Set_List4_With_Parent);
2769 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id);
2770 pragma Inline (Set_List5_With_Parent);
2772 end Unchecked_Access;
2774 -----------------------------
2775 -- Private Part Subpackage --
2776 -----------------------------
2778 -- The following package contains the definition of the data structure
2779 -- used by the implementation of the Atree package. Logically it really
2780 -- corresponds to the private part, hence the name. The reason that it
2781 -- is defined as a sub-package is to allow special access from clients
2782 -- that need to see the internals of the data structures.
2784 package Atree_Private_Part is
2786 -------------------------
2787 -- Tree Representation --
2788 -------------------------
2790 -- The nodes of the tree are stored in a table (i.e. an array). In the
2791 -- case of extended nodes five consecutive components in the array are
2792 -- used. There are thus two formats for array components. One is used
2793 -- for non-extended nodes, and for the first component of extended
2794 -- nodes. The other is used for the extension parts (second, third,
2795 -- fourth and fifth components) of an extended node. A variant record
2796 -- structure is used to distinguish the two formats.
2798 type Node_Record (Is_Extension : Boolean := False) is record
2800 -- Logically, the only field in the common part is the above
2801 -- Is_Extension discriminant (a single bit). However, Gigi cannot
2802 -- yet handle such a structure, so we fill out the common part of
2803 -- the record with fields that are used in different ways for
2804 -- normal nodes and node extensions.
2806 Pflag1, Pflag2 : Boolean;
2807 -- The Paren_Count field is represented using two boolean flags,
2808 -- where Pflag1 is worth 1, and Pflag2 is worth 2. This is done
2809 -- because we need to be easily able to reuse this field for
2810 -- extra flags in the extended node case.
2813 -- Flag used to indicate if node is a member of a list.
2814 -- This field is considered private to the Atree package.
2817 -- Currently unused flag
2819 Rewrite_Ins : Boolean;
2820 -- Flag set by Mark_Rewrite_Insertion procedure.
2821 -- This field is considered private to the Atree package.
2824 -- Flag to indicate the node has been analyzed (and expanded)
2826 Comes_From_Source : Boolean;
2827 -- Flag to indicate that node comes from the source program (i.e.
2828 -- was built by the parser or scanner, not the analyzer or expander).
2830 Error_Posted : Boolean;
2831 -- Flag to indicate that an error message has been posted on the
2832 -- node (to avoid duplicate flags on the same node)
2849 -- The eighteen flags for a normal node
2851 -- The above fields are used as follows in components 2-4 of
2852 -- an extended node entry. These fields are not currently
2853 -- used in component 5 (where we still have lots of room!)
2855 -- In_List used as Flag19, Flag40, Flag129
2856 -- Unused_1 used as Flag20, Flag41, Flag130
2857 -- Rewrite_Ins used as Flag21, Flag42, Flag131
2858 -- Analyzed used as Flag22, Flag43, Flag132
2859 -- Comes_From_Source used as Flag23, Flag44, Flag133
2860 -- Error_Posted used as Flag24, Flag45, Flag134
2861 -- Flag4 used as Flag25, Flag46, Flag135
2862 -- Flag5 used as Flag26, Flag47, Flag136
2863 -- Flag6 used as Flag27, Flag48, Flag137
2864 -- Flag7 used as Flag28, Flag49, Flag138
2865 -- Flag8 used as Flag29, Flag50, Flag139
2866 -- Flag9 used as Flag30, Flag51, Flag140
2867 -- Flag10 used as Flag31, Flag52, Flag141
2868 -- Flag11 used as Flag32, Flag53, Flag142
2869 -- Flag12 used as Flag33, Flag54, Flag143
2870 -- Flag13 used as Flag34, Flag55, Flag144
2871 -- Flag14 used as Flag35, Flag56, Flag145
2872 -- Flag15 used as Flag36, Flag57, Flag146
2873 -- Flag16 used as Flag37, Flag58, Flag147
2874 -- Flag17 used as Flag38, Flag59, Flag148
2875 -- Flag18 used as Flag39, Flag60, Flag149
2876 -- Pflag1 used as Flag61, Flag62, Flag150
2877 -- Pflag2 used as Flag63, Flag64, Flag151
2880 -- For a non-extended node, or the initial section of an extended
2881 -- node, this field holds the Node_Kind value. For an extended node,
2882 -- The Nkind field is used as follows:
2884 -- Second entry: holds the Ekind field of the entity
2885 -- Third entry: holds 8 additional flags (Flag65-Flag72)
2886 -- Fourth entry: not currently used
2888 -- Now finally (on an 32-bit boundary!) comes the variant part
2890 case Is_Extension is
2892 -- Non-extended node, or first component of extended node
2897 -- Source location for this node
2900 -- This field is used either as the Parent pointer (if In_List
2901 -- is False), or to point to the list header (if In_List is
2902 -- True). This field is considered private and can be modified
2903 -- only by Atree or by Nlists.
2910 -- Five general use fields, which can contain Node_Id, List_Id,
2911 -- Elist_Id, String_Id, or Name_Id values depending on the
2912 -- values in Nkind and (for extended nodes), in Ekind. See
2913 -- packages Sinfo and Einfo for details of their use.
2915 -- Extension (second component) of extended node
2926 -- Seven additional general fields available only for entities
2927 -- See package Einfo for details of their use (which depends
2928 -- on the value in the Ekind field).
2930 -- In the third component, the extension format as described
2931 -- above is used to hold additional general fields and flags
2934 -- Field6-11 Holds Field13-Field18
2935 -- Field12 Holds Flag73-Flag96 and Convention
2937 -- In the fourth component, the extension format as described
2938 -- above is used to hold additional general fields and flags
2941 -- Field6-10 Holds Field19-Field23
2942 -- Field11 Holds Flag152-Flag183
2943 -- Field12 Holds Flag97-Flag128
2945 -- In the fifth component, the extension format as described
2946 -- above is used to hold additional general fields and flags
2949 -- Field6-10 Holds Field24-Field28
2950 -- Field11 Holds Flag184-Flag215
2951 -- Field12 Holds Flag216-Flag230
2956 pragma Pack (Node_Record);
2957 for Node_Record'Size use 8*32;
2958 for Node_Record'Alignment use 4;
2960 -- The following defines the extendable array used for the nodes table
2961 -- Nodes with extensions use five consecutive entries in the array
2963 package Nodes is new Table.Table (
2964 Table_Component_Type => Node_Record,
2965 Table_Index_Type => Node_Id'Base,
2966 Table_Low_Bound => First_Node_Id,
2967 Table_Initial => Alloc.Nodes_Initial,
2968 Table_Increment => Alloc.Nodes_Increment,
2969 Table_Name => "Nodes");
2971 end Atree_Private_Part;