gcc/ada/atree.adb

   1 ------------------------------------------------------------------------------
   2 --                                                                          --
   3 --                         GNAT COMPILER COMPONENTS                         --
   4 --                                                                          --
   5 --                                A T R E E                                 --
   6 --                                                                          --
   7 --                                 B o d y                                  --
   8 --                                                                          --
   9 --          Copyright (C) 1992-2007, Free Software Foundation, Inc.         --
  10 --                                                                          --
  11 -- GNAT is free software;  you can  redistribute it  and/or modify it under --
  12 -- terms of the  GNU General Public License as published  by the Free Soft- --
  13 -- ware  Foundation;  either version 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.                                              --
  21 --                                                                          --
  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.                                      --
  28 --                                                                          --
  29 -- GNAT was originally developed  by the GNAT team at  New York University. --
  30 -- Extensive contributions were provided by Ada Core Technologies Inc.      --
  31 --                                                                          --
  32 ------------------------------------------------------------------------------
  33
  34 pragma Style_Checks (All_Checks);
  35 --  Turn off subprogram ordering check for this package
  36
  37 --  WARNING: There is a C version of this package. Any changes to this source
  38 --  file must be properly reflected in the file atree.h which is a C header
  39 --  file containing equivalent definitions for use by gigi.
  40
  41 with Debug;   use Debug;
  42 with Nlists;  use Nlists;
  43 with Elists;  use Elists;
  44 with Output;  use Output;
  45 with Sinput;  use Sinput;
  46 with Tree_IO; use Tree_IO;
  47
  48 with GNAT.HTable; use GNAT.HTable;
  49
  50 package body Atree is
  51
  52    ---------------
  53    -- Debugging --
  54    ---------------
  55
  56    --  Suppose you find that node 12345 is messed up. You might want to find
  57    --  the code that created that node. There are two ways to do this:
  58
  59    --  One way is to set a conditional breakpoint on New_Node_Debugging_Output
  60    --  (nickname "nnd"):
  61    --     break nnd if n = 12345
  62    --  and run gnat1 again from the beginning.
  63
  64    --  The other way is to set a breakpoint near the beginning (e.g. on
  65    --  gnat1drv), and run. Then set Watch_Node (nickname "ww") to 12345 in gdb:
  66    --     ww := 12345
  67    --  and set a breakpoint on New_Node_Breakpoint (nickname "nn"). Continue.
  68
  69    --  Either way, gnat1 will stop when node 12345 is created
  70
  71    --  The second method is faster
  72
  73    ww : Node_Id'Base := Node_Id'First - 1;
  74    pragma Export (Ada, ww); --  trick the optimizer
  75    Watch_Node : Node_Id'Base renames ww;
  76    --  Node to "watch"; that is, whenever a node is created, we check if it is
  77    --  equal to Watch_Node, and if so, call New_Node_Breakpoint. You have
  78    --  presumably set a breakpoint on New_Node_Breakpoint. Note that the
  79    --  initial value of Node_Id'First - 1 ensures that by default, no node
  80    --  will be equal to Watch_Node.
  81
  82    procedure nn;
  83    pragma Export (Ada, nn);
  84    procedure New_Node_Breakpoint renames nn;
  85    --  This doesn't do anything interesting; it's just for setting breakpoint
  86    --  on as explained above.
  87
  88    procedure nnd (N : Node_Id);
  89    pragma Export (Ada, nnd);
  90    procedure New_Node_Debugging_Output (N : Node_Id) renames nnd;
  91    --  For debugging. If debugging is turned on, New_Node and New_Entity call
  92    --  this. If debug flag N is turned on, this prints out the new node.
  93    --
  94    --  If Node = Watch_Node, this prints out the new node and calls
  95    --  New_Node_Breakpoint. Otherwise, does nothing.
  96
  97    -----------------------------
  98    -- Local Objects and Types --
  99    -----------------------------
 100
 101    Node_Count : Nat;
 102    --  Count allocated nodes for Num_Nodes function
 103
 104    use Unchecked_Access;
 105    --  We are allowed to see these from within our own body!
 106
 107    use Atree_Private_Part;
 108    --  We are also allowed to see our private data structures!
 109
 110    function E_To_N is new Unchecked_Conversion (Entity_Kind, Node_Kind);
 111    function N_To_E is new Unchecked_Conversion (Node_Kind, Entity_Kind);
 112    --  Functions used to store Entity_Kind value in Nkind field
 113
 114    --  The following declarations are used to store flags 65-72 in the
 115    --  Nkind field of the third component of an extended (entity) node.
 116
 117    type Flag_Byte is record
 118       Flag65 : Boolean;
 119       Flag66 : Boolean;
 120       Flag67 : Boolean;
 121       Flag68 : Boolean;
 122       Flag69 : Boolean;
 123       Flag70 : Boolean;
 124       Flag71 : Boolean;
 125       Flag72 : Boolean;
 126    end record;
 127
 128    pragma Pack (Flag_Byte);
 129    for Flag_Byte'Size use 8;
 130
 131    type Flag_Byte_Ptr is access all Flag_Byte;
 132    type Node_Kind_Ptr is access all Node_Kind;
 133
 134    function To_Flag_Byte is new
 135      Unchecked_Conversion (Node_Kind, Flag_Byte);
 136
 137    function To_Flag_Byte_Ptr is new
 138      Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte_Ptr);
 139
 140    --  The following declarations are used to store flags 73-96 and the
 141    --  Convention field in the Field12 field of the third component of an
 142    --  extended (Entity) node.
 143
 144    type Flag_Word is record
 145       Flag73 : Boolean;
 146       Flag74 : Boolean;
 147       Flag75 : Boolean;
 148       Flag76 : Boolean;
 149       Flag77 : Boolean;
 150       Flag78 : Boolean;
 151       Flag79 : Boolean;
 152       Flag80 : Boolean;
 153
 154       Flag81 : Boolean;
 155       Flag82 : Boolean;
 156       Flag83 : Boolean;
 157       Flag84 : Boolean;
 158       Flag85 : Boolean;
 159       Flag86 : Boolean;
 160       Flag87 : Boolean;
 161       Flag88 : Boolean;
 162
 163       Flag89 : Boolean;
 164       Flag90 : Boolean;
 165       Flag91 : Boolean;
 166       Flag92 : Boolean;
 167       Flag93 : Boolean;
 168       Flag94 : Boolean;
 169       Flag95 : Boolean;
 170       Flag96 : Boolean;
 171
 172       Convention : Convention_Id;
 173    end record;
 174
 175    pragma Pack (Flag_Word);
 176    for Flag_Word'Size use 32;
 177    for Flag_Word'Alignment use 4;
 178
 179    type Flag_Word_Ptr is access all Flag_Word;
 180    type Union_Id_Ptr  is access all Union_Id;
 181
 182    function To_Flag_Word is new
 183      Unchecked_Conversion (Union_Id, Flag_Word);
 184
 185    function To_Flag_Word_Ptr is new
 186      Unchecked_Conversion (Union_Id_Ptr, Flag_Word_Ptr);
 187
 188    --  The following declarations are used to store flags 97-128 in the
 189    --  Field12 field of the fourth component of an extended (entity) node.
 190
 191    type Flag_Word2 is record
 192       Flag97  : Boolean;
 193       Flag98  : Boolean;
 194       Flag99  : Boolean;
 195       Flag100 : Boolean;
 196       Flag101 : Boolean;
 197       Flag102 : Boolean;
 198       Flag103 : Boolean;
 199       Flag104 : Boolean;
 200
 201       Flag105 : Boolean;
 202       Flag106 : Boolean;
 203       Flag107 : Boolean;
 204       Flag108 : Boolean;
 205       Flag109 : Boolean;
 206       Flag110 : Boolean;
 207       Flag111 : Boolean;
 208       Flag112 : Boolean;
 209
 210       Flag113 : Boolean;
 211       Flag114 : Boolean;
 212       Flag115 : Boolean;
 213       Flag116 : Boolean;
 214       Flag117 : Boolean;
 215       Flag118 : Boolean;
 216       Flag119 : Boolean;
 217       Flag120 : Boolean;
 218
 219       Flag121 : Boolean;
 220       Flag122 : Boolean;
 221       Flag123 : Boolean;
 222       Flag124 : Boolean;
 223       Flag125 : Boolean;
 224       Flag126 : Boolean;
 225       Flag127 : Boolean;
 226       Flag128 : Boolean;
 227    end record;
 228
 229    pragma Pack (Flag_Word2);
 230    for Flag_Word2'Size use 32;
 231    for Flag_Word2'Alignment use 4;
 232
 233    type Flag_Word2_Ptr is access all Flag_Word2;
 234
 235    function To_Flag_Word2 is new
 236      Unchecked_Conversion (Union_Id, Flag_Word2);
 237
 238    function To_Flag_Word2_Ptr is new
 239      Unchecked_Conversion (Union_Id_Ptr, Flag_Word2_Ptr);
 240
 241    --  The following declarations are used to store flags 152-183 in the
 242    --  Field11 field of the fourth component of an extended (entity) node.
 243
 244    type Flag_Word3 is record
 245       Flag152 : Boolean;
 246       Flag153 : Boolean;
 247       Flag154 : Boolean;
 248       Flag155 : Boolean;
 249       Flag156 : Boolean;
 250       Flag157 : Boolean;
 251       Flag158 : Boolean;
 252       Flag159 : Boolean;
 253
 254       Flag160 : Boolean;
 255       Flag161 : Boolean;
 256       Flag162 : Boolean;
 257       Flag163 : Boolean;
 258       Flag164 : Boolean;
 259       Flag165 : Boolean;
 260       Flag166 : Boolean;
 261       Flag167 : Boolean;
 262
 263       Flag168 : Boolean;
 264       Flag169 : Boolean;
 265       Flag170 : Boolean;
 266       Flag171 : Boolean;
 267       Flag172 : Boolean;
 268       Flag173 : Boolean;
 269       Flag174 : Boolean;
 270       Flag175 : Boolean;
 271
 272       Flag176 : Boolean;
 273       Flag177 : Boolean;
 274       Flag178 : Boolean;
 275       Flag179 : Boolean;
 276       Flag180 : Boolean;
 277       Flag181 : Boolean;
 278       Flag182 : Boolean;
 279       Flag183 : Boolean;
 280    end record;
 281
 282    pragma Pack (Flag_Word3);
 283    for Flag_Word3'Size use 32;
 284    for Flag_Word3'Alignment use 4;
 285
 286    type Flag_Word3_Ptr is access all Flag_Word3;
 287
 288    function To_Flag_Word3 is new
 289      Unchecked_Conversion (Union_Id, Flag_Word3);
 290
 291    function To_Flag_Word3_Ptr is new
 292      Unchecked_Conversion (Union_Id_Ptr, Flag_Word3_Ptr);
 293
 294    --  The following declarations are used to store flags 184-215 in the
 295    --  Field11 field of the fifth component of an extended (entity) node.
 296
 297    type Flag_Word4 is record
 298       Flag184 : Boolean;
 299       Flag185 : Boolean;
 300       Flag186 : Boolean;
 301       Flag187 : Boolean;
 302       Flag188 : Boolean;
 303       Flag189 : Boolean;
 304       Flag190 : Boolean;
 305       Flag191 : Boolean;
 306
 307       Flag192 : Boolean;
 308       Flag193 : Boolean;
 309       Flag194 : Boolean;
 310       Flag195 : Boolean;
 311       Flag196 : Boolean;
 312       Flag197 : Boolean;
 313       Flag198 : Boolean;
 314       Flag199 : Boolean;
 315
 316       Flag200 : Boolean;
 317       Flag201 : Boolean;
 318       Flag202 : Boolean;
 319       Flag203 : Boolean;
 320       Flag204 : Boolean;
 321       Flag205 : Boolean;
 322       Flag206 : Boolean;
 323       Flag207 : Boolean;
 324
 325       Flag208 : Boolean;
 326       Flag209 : Boolean;
 327       Flag210 : Boolean;
 328       Flag211 : Boolean;
 329       Flag212 : Boolean;
 330       Flag213 : Boolean;
 331       Flag214 : Boolean;
 332       Flag215 : Boolean;
 333    end record;
 334
 335    pragma Pack (Flag_Word4);
 336    for Flag_Word4'Size use 32;
 337    for Flag_Word4'Alignment use 4;
 338
 339    type Flag_Word4_Ptr is access all Flag_Word4;
 340
 341    function To_Flag_Word4 is new
 342      Unchecked_Conversion (Union_Id, Flag_Word4);
 343
 344    function To_Flag_Word4_Ptr is new
 345      Unchecked_Conversion (Union_Id_Ptr, Flag_Word4_Ptr);
 346
 347    --  The following declarations are used to store flags 216-247 in the
 348    --  Field12 field of the fifth component of an extended (entity) node.
 349
 350    type Flag_Word5 is record
 351       Flag216 : Boolean;
 352       Flag217 : Boolean;
 353       Flag218 : Boolean;
 354       Flag219 : Boolean;
 355       Flag220 : Boolean;
 356       Flag221 : Boolean;
 357       Flag222 : Boolean;
 358       Flag223 : Boolean;
 359
 360       Flag224 : Boolean;
 361       Flag225 : Boolean;
 362       Flag226 : Boolean;
 363       Flag227 : Boolean;
 364       Flag228 : Boolean;
 365       Flag229 : Boolean;
 366       Flag230 : Boolean;
 367       Flag231 : Boolean;
 368
 369       Flag232 : Boolean;
 370       Flag233 : Boolean;
 371       Flag234 : Boolean;
 372       Flag235 : Boolean;
 373       Flag236 : Boolean;
 374       Flag237 : Boolean;
 375       Flag238 : Boolean;
 376       Flag239 : Boolean;
 377
 378       Flag240 : Boolean;
 379       Flag241 : Boolean;
 380       Flag242 : Boolean;
 381       Flag243 : Boolean;
 382       Flag244 : Boolean;
 383       Flag245 : Boolean;
 384       Flag246 : Boolean;
 385       Flag247 : Boolean;
 386    end record;
 387
 388    pragma Pack (Flag_Word5);
 389    for Flag_Word5'Size use 32;
 390    for Flag_Word5'Alignment use 4;
 391
 392    type Flag_Word5_Ptr is access all Flag_Word5;
 393
 394    function To_Flag_Word5 is new
 395      Unchecked_Conversion (Union_Id, Flag_Word5);
 396
 397    function To_Flag_Word5_Ptr is new
 398      Unchecked_Conversion (Union_Id_Ptr, Flag_Word5_Ptr);
 399
 400    --  Default value used to initialize default nodes. Note that some of the
 401    --  fields get overwritten, and in particular, Nkind always gets reset.
 402
 403    Default_Node : Node_Record := (
 404       Is_Extension      => False,
 405       Pflag1            => False,
 406       Pflag2            => False,
 407       In_List           => False,
 408       Unused_1          => False,
 409       Rewrite_Ins       => False,
 410       Analyzed          => False,
 411       Comes_From_Source => False, -- modified by Set_Comes_From_Source_Default
 412       Error_Posted      => False,
 413       Flag4             => False,
 414
 415       Flag5             => False,
 416       Flag6             => False,
 417       Flag7             => False,
 418       Flag8             => False,
 419       Flag9             => False,
 420       Flag10            => False,
 421       Flag11            => False,
 422       Flag12            => False,
 423
 424       Flag13            => False,
 425       Flag14            => False,
 426       Flag15            => False,
 427       Flag16            => False,
 428       Flag17            => False,
 429       Flag18            => False,
 430
 431       Nkind             => N_Unused_At_Start,
 432
 433       Sloc              => No_Location,
 434       Link              => Empty_List_Or_Node,
 435       Field1            => Empty_List_Or_Node,
 436       Field2            => Empty_List_Or_Node,
 437       Field3            => Empty_List_Or_Node,
 438       Field4            => Empty_List_Or_Node,
 439       Field5            => Empty_List_Or_Node);
 440
 441    --  Default value used to initialize node extensions (i.e. the second
 442    --  and third and fourth components of an extended node). Note we are
 443    --  cheating a bit here when it comes to Node12, which really holds
 444    --  flags an (for the third component), the convention. But it works
 445    --  because Empty, False, Convention_Ada, all happen to be all zero bits.
 446
 447    Default_Node_Extension : constant Node_Record := (
 448       Is_Extension      => True,
 449       Pflag1            => False,
 450       Pflag2            => False,
 451       In_List           => False,
 452       Unused_1          => False,
 453       Rewrite_Ins       => False,
 454       Analyzed          => False,
 455       Comes_From_Source => False,
 456       Error_Posted      => False,
 457       Flag4             => False,
 458
 459       Flag5             => False,
 460       Flag6             => False,
 461       Flag7             => False,
 462       Flag8             => False,
 463       Flag9             => False,
 464       Flag10            => False,
 465       Flag11            => False,
 466       Flag12            => False,
 467
 468       Flag13            => False,
 469       Flag14            => False,
 470       Flag15            => False,
 471       Flag16            => False,
 472       Flag17            => False,
 473       Flag18            => False,
 474
 475       Nkind             => E_To_N (E_Void),
 476
 477       Field6            => Empty_List_Or_Node,
 478       Field7            => Empty_List_Or_Node,
 479       Field8            => Empty_List_Or_Node,
 480       Field9            => Empty_List_Or_Node,
 481       Field10           => Empty_List_Or_Node,
 482       Field11           => Empty_List_Or_Node,
 483       Field12           => Empty_List_Or_Node);
 484
 485    --------------------------------------------------
 486    -- Implementation of Tree Substitution Routines --
 487    --------------------------------------------------
 488
 489    --  A separate table keeps track of the mapping between rewritten nodes
 490    --  and their corresponding original tree nodes. Rewrite makes an entry
 491    --  in this table for use by Original_Node. By default, if no call is
 492    --  Rewrite, the entry in this table points to the original unwritten node.
 493
 494    --  Note: eventually, this should be a field in the Node directly, but
 495    --  for now we do not want to disturb the efficiency of a power of 2
 496    --  for the node size
 497
 498    package Orig_Nodes is new Table.Table (
 499       Table_Component_Type => Node_Id,
 500       Table_Index_Type     => Node_Id'Base,
 501       Table_Low_Bound      => First_Node_Id,
 502       Table_Initial        => Alloc.Orig_Nodes_Initial,
 503       Table_Increment      => Alloc.Orig_Nodes_Increment,
 504       Table_Name           => "Orig_Nodes");
 505
 506    ----------------------------------------
 507    -- Global_Variables for New_Copy_Tree --
 508    ----------------------------------------
 509
 510    --  These global variables are used by New_Copy_Tree. See description
 511    --  of the body of this subprogram for details. Global variables can be
 512    --  safely used by New_Copy_Tree, since there is no case of a recursive
 513    --  call from the processing inside New_Copy_Tree.
 514
 515    NCT_Hash_Threshhold : constant := 20;
 516    --  If there are more than this number of pairs of entries in the
 517    --  map, then Hash_Tables_Used will be set, and the hash tables will
 518    --  be initialized and used for the searches.
 519
 520    NCT_Hash_Tables_Used : Boolean := False;
 521    --  Set to True if hash tables are in use
 522
 523    NCT_Table_Entries : Nat;
 524    --  Count entries in table to see if threshhold is reached
 525
 526    NCT_Hash_Table_Setup : Boolean := False;
 527    --  Set to True if hash table contains data. We set this True if we
 528    --  setup the hash table with data, and leave it set permanently
 529    --  from then on, this is a signal that second and subsequent users
 530    --  of the hash table must clear the old entries before reuse.
 531
 532    subtype NCT_Header_Num is Int range 0 .. 511;
 533    --  Defines range of headers in hash tables (512 headers)
 534
 535    --------------------------
 536    -- Paren_Count Handling --
 537    --------------------------
 538
 539    --  As noted in the spec, the paren count in a sub-expression node has
 540    --  four possible values 0,1,2, and 3. The value 3 really means 3 or more,
 541    --  and we use an auxiliary serially scanned table to record the actual
 542    --  count. A serial search is fine, only pathological programs will use
 543    --  entries in this table. Normal programs won't use it at all.
 544
 545    type Paren_Count_Entry is record
 546       Nod   : Node_Id;
 547       --  The node to which this count applies
 548
 549       Count : Nat range 3 .. Nat'Last;
 550       --  The count of parentheses, which will be in the indicated range
 551    end record;
 552
 553    package Paren_Counts is new Table.Table (
 554      Table_Component_Type => Paren_Count_Entry,
 555      Table_Index_Type     => Int,
 556      Table_Low_Bound      => 0,
 557      Table_Initial        => 10,
 558      Table_Increment      => 200,
 559      Table_Name           => "Paren_Counts");
 560
 561    -----------------------
 562    -- Local Subprograms --
 563    -----------------------
 564
 565    procedure Fix_Parents (Old_Node, New_Node : Node_Id);
 566    --  Fixup parent pointers for the syntactic children of New_Node after
 567    --  a copy, setting them to New_Node when they pointed to Old_Node.
 568
 569    function Allocate_Initialize_Node
 570      (Src            : Node_Id;
 571       With_Extension : Boolean) return Node_Id;
 572    --  Allocate a new node or node extension. If Src is not empty,
 573    --  the information for the newly-allocated node is copied from it.
 574
 575    ------------------------------
 576    -- Allocate_Initialize_Node --
 577    ------------------------------
 578
 579    function Allocate_Initialize_Node
 580      (Src            : Node_Id;
 581       With_Extension : Boolean) return Node_Id
 582    is
 583       New_Id : Node_Id     := Src;
 584       Nod    : Node_Record := Default_Node;
 585       Ext1   : Node_Record := Default_Node_Extension;
 586       Ext2   : Node_Record := Default_Node_Extension;
 587       Ext3   : Node_Record := Default_Node_Extension;
 588       Ext4   : Node_Record := Default_Node_Extension;
 589
 590    begin
 591       if Present (Src) then
 592          Nod := Nodes.Table (Src);
 593
 594          if Has_Extension (Src) then
 595             Ext1 := Nodes.Table (Src + 1);
 596             Ext2 := Nodes.Table (Src + 2);
 597             Ext3 := Nodes.Table (Src + 3);
 598             Ext4 := Nodes.Table (Src + 4);
 599          end if;
 600       end if;
 601
 602       if not (Present (Src)
 603                and then not Has_Extension (Src)
 604                and then With_Extension
 605                and then Src = Nodes.Last)
 606       then
 607          --  We are allocating a new node, or extending a node
 608          --  other than Nodes.Last.
 609
 610          Nodes.Append (Nod);
 611          New_Id := Nodes.Last;
 612          Orig_Nodes.Append (New_Id);
 613          Node_Count := Node_Count + 1;
 614       end if;
 615
 616       --  Specifically copy Paren_Count to deal with creating new table entry
 617       --  if the parentheses count is at the maximum possible value already.
 618
 619       if Present (Src) and then Nkind (Src) in N_Subexpr then
 620          Set_Paren_Count (New_Id, Paren_Count (Src));
 621       end if;
 622
 623       --  Set extension nodes if required
 624
 625       if With_Extension then
 626          Nodes.Append (Ext1);
 627          Nodes.Append (Ext2);
 628          Nodes.Append (Ext3);
 629          Nodes.Append (Ext4);
 630       end if;
 631
 632       Orig_Nodes.Set_Last (Nodes.Last);
 633       Allocate_List_Tables (Nodes.Last);
 634       return New_Id;
 635    end Allocate_Initialize_Node;
 636
 637    --------------
 638    -- Analyzed --
 639    --------------
 640
 641    function Analyzed (N : Node_Id) return Boolean is
 642    begin
 643       pragma Assert (N <= Nodes.Last);
 644       return Nodes.Table (N).Analyzed;
 645    end Analyzed;
 646
 647    --------------------------
 648    -- Basic_Set_Convention --
 649    --------------------------
 650
 651    procedure Basic_Set_Convention  (E : Entity_Id; Val : Convention_Id) is
 652    begin
 653       pragma Assert (Nkind (E) in N_Entity);
 654       To_Flag_Word_Ptr
 655         (Union_Id_Ptr'
 656           (Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention := Val;
 657    end Basic_Set_Convention;
 658
 659    -----------------
 660    -- Change_Node --
 661    -----------------
 662
 663    procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind) is
 664       Save_Sloc    : constant Source_Ptr := Sloc (N);
 665       Save_In_List : constant Boolean    := Nodes.Table (N).In_List;
 666       Save_Link    : constant Union_Id   := Nodes.Table (N).Link;
 667       Save_CFS     : constant Boolean    := Nodes.Table (N).Comes_From_Source;
 668       Save_Posted  : constant Boolean    := Nodes.Table (N).Error_Posted;
 669       Par_Count    : Nat                 := 0;
 670
 671    begin
 672       if Nkind (N) in N_Subexpr then
 673          Par_Count := Paren_Count (N);
 674       end if;
 675
 676       Nodes.Table (N)                   := Default_Node;
 677       Nodes.Table (N).Sloc              := Save_Sloc;
 678       Nodes.Table (N).In_List           := Save_In_List;
 679       Nodes.Table (N).Link              := Save_Link;
 680       Nodes.Table (N).Comes_From_Source := Save_CFS;
 681       Nodes.Table (N).Nkind             := New_Node_Kind;
 682       Nodes.Table (N).Error_Posted      := Save_Posted;
 683
 684       if New_Node_Kind in N_Subexpr then
 685          Set_Paren_Count (N, Par_Count);
 686       end if;
 687    end Change_Node;
 688
 689    -----------------------
 690    -- Comes_From_Source --
 691    -----------------------
 692
 693    function Comes_From_Source (N : Node_Id) return Boolean is
 694    begin
 695       pragma Assert (N <= Nodes.Last);
 696       return Nodes.Table (N).Comes_From_Source;
 697    end Comes_From_Source;
 698
 699    ----------------
 700    -- Convention --
 701    ----------------
 702
 703    function Convention (E : Entity_Id) return Convention_Id is
 704    begin
 705       pragma Assert (Nkind (E) in N_Entity);
 706       return To_Flag_Word (Nodes.Table (E + 2).Field12).Convention;
 707    end Convention;
 708
 709    ---------------
 710    -- Copy_Node --
 711    ---------------
 712
 713    procedure Copy_Node (Source : Node_Id; Destination : Node_Id) is
 714       Save_In_List : constant Boolean  := Nodes.Table (Destination).In_List;
 715       Save_Link    : constant Union_Id := Nodes.Table (Destination).Link;
 716
 717    begin
 718       Nodes.Table (Destination)         := Nodes.Table (Source);
 719       Nodes.Table (Destination).In_List := Save_In_List;
 720       Nodes.Table (Destination).Link    := Save_Link;
 721
 722       --  Specifically set Paren_Count to make sure auxiliary table entry
 723       --  gets correctly made if the parentheses count is at the max value.
 724
 725       if Nkind (Destination) in N_Subexpr then
 726          Set_Paren_Count (Destination, Paren_Count (Source));
 727       end if;
 728
 729       --  Deal with copying extension nodes if present
 730
 731       if Has_Extension (Source) then
 732          pragma Assert (Has_Extension (Destination));
 733          Nodes.Table (Destination + 1) := Nodes.Table (Source + 1);
 734          Nodes.Table (Destination + 2) := Nodes.Table (Source + 2);
 735          Nodes.Table (Destination + 3) := Nodes.Table (Source + 3);
 736          Nodes.Table (Destination + 4) := Nodes.Table (Source + 4);
 737
 738       else
 739          pragma Assert (not Has_Extension (Source));
 740          null;
 741       end if;
 742    end Copy_Node;
 743
 744    ------------------------
 745    -- Copy_Separate_Tree --
 746    ------------------------
 747
 748    function Copy_Separate_Tree (Source : Node_Id) return Node_Id is
 749       New_Id  : Node_Id;
 750
 751       function Copy_Entity (E : Entity_Id) return Entity_Id;
 752       --  Copy Entity, copying only the Ekind and Chars fields
 753
 754       function Copy_List (List : List_Id) return List_Id;
 755       --  Copy list
 756
 757       function Possible_Copy (Field : Union_Id) return Union_Id;
 758       --  Given a field, returns a copy of the node or list if its parent
 759       --  is the current source node, and otherwise returns the input
 760
 761       -----------------
 762       -- Copy_Entity --
 763       -----------------
 764
 765       function Copy_Entity (E : Entity_Id) return Entity_Id is
 766          New_Ent : Entity_Id;
 767
 768       begin
 769          case N_Entity (Nkind (E)) is
 770             when N_Defining_Identifier =>
 771                New_Ent := New_Entity (N_Defining_Identifier, Sloc (E));
 772
 773             when N_Defining_Character_Literal =>
 774                New_Ent := New_Entity (N_Defining_Character_Literal, Sloc (E));
 775
 776             when N_Defining_Operator_Symbol =>
 777                New_Ent := New_Entity (N_Defining_Operator_Symbol, Sloc (E));
 778          end case;
 779
 780          Set_Chars (New_Ent, Chars (E));
 781          return New_Ent;
 782       end Copy_Entity;
 783
 784       ---------------
 785       -- Copy_List --
 786       ---------------
 787
 788       function Copy_List (List : List_Id) return List_Id is
 789          NL : List_Id;
 790          E  : Node_Id;
 791
 792       begin
 793          if List = No_List then
 794             return No_List;
 795
 796          else
 797             NL := New_List;
 798
 799             E := First (List);
 800             while Present (E) loop
 801                if Has_Extension (E) then
 802                   Append (Copy_Entity (E), NL);
 803                else
 804                   Append (Copy_Separate_Tree (E), NL);
 805                end if;
 806
 807                Next (E);
 808             end loop;
 809
 810             return NL;
 811          end if;
 812       end Copy_List;
 813
 814       -------------------
 815       -- Possible_Copy --
 816       -------------------
 817
 818       function Possible_Copy (Field : Union_Id) return Union_Id is
 819          New_N : Union_Id;
 820
 821       begin
 822          if Field in Node_Range then
 823             New_N := Union_Id (Copy_Separate_Tree (Node_Id (Field)));
 824
 825             if Parent (Node_Id (Field)) = Source then
 826                Set_Parent (Node_Id (New_N), New_Id);
 827             end if;
 828
 829             return New_N;
 830
 831          elsif Field in List_Range then
 832             New_N := Union_Id (Copy_List (List_Id (Field)));
 833
 834             if Parent (List_Id (Field)) = Source then
 835                Set_Parent (List_Id (New_N), New_Id);
 836             end if;
 837
 838             return New_N;
 839
 840          else
 841             return Field;
 842          end if;
 843       end Possible_Copy;
 844
 845    --  Start of processing for Copy_Separate_Tree
 846
 847    begin
 848       if Source <= Empty_Or_Error then
 849          return Source;
 850
 851       elsif Has_Extension (Source) then
 852          return Copy_Entity (Source);
 853
 854       else
 855          New_Id := New_Copy (Source);
 856
 857          --  Recursively copy descendents
 858
 859          Set_Field1 (New_Id, Possible_Copy (Field1 (New_Id)));
 860          Set_Field2 (New_Id, Possible_Copy (Field2 (New_Id)));
 861          Set_Field3 (New_Id, Possible_Copy (Field3 (New_Id)));
 862          Set_Field4 (New_Id, Possible_Copy (Field4 (New_Id)));
 863          Set_Field5 (New_Id, Possible_Copy (Field5 (New_Id)));
 864
 865          --  Set Entity field to Empty
 866          --  Why is this done??? and why is it always right to do it???
 867
 868          if Nkind (New_Id) in N_Has_Entity
 869            or else Nkind (New_Id) = N_Freeze_Entity
 870          then
 871             Set_Entity (New_Id, Empty);
 872          end if;
 873
 874          --  All done, return copied node
 875
 876          return New_Id;
 877       end if;
 878    end Copy_Separate_Tree;
 879
 880    -----------
 881    -- Ekind --
 882    -----------
 883
 884    function Ekind (E : Entity_Id) return Entity_Kind is
 885    begin
 886       pragma Assert (Nkind (E) in N_Entity);
 887       return N_To_E (Nodes.Table (E + 1).Nkind);
 888    end Ekind;
 889
 890    ------------------
 891    -- Error_Posted --
 892    ------------------
 893
 894    function Error_Posted (N : Node_Id) return Boolean is
 895    begin
 896       pragma Assert (N <= Nodes.Last);
 897       return Nodes.Table (N).Error_Posted;
 898    end Error_Posted;
 899
 900    -----------------------
 901    -- Exchange_Entities --
 902    -----------------------
 903
 904    procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id) is
 905       Temp_Ent : Node_Record;
 906
 907    begin
 908       pragma Assert (Has_Extension (E1)
 909         and then Has_Extension (E2)
 910         and then not Nodes.Table (E1).In_List
 911         and then not Nodes.Table (E2).In_List);
 912
 913       --  Exchange the contents of the two entities
 914
 915       Temp_Ent := Nodes.Table (E1);
 916       Nodes.Table (E1) := Nodes.Table (E2);
 917       Nodes.Table (E2) := Temp_Ent;
 918       Temp_Ent := Nodes.Table (E1 + 1);
 919       Nodes.Table (E1 + 1) := Nodes.Table (E2 + 1);
 920       Nodes.Table (E2 + 1) := Temp_Ent;
 921       Temp_Ent := Nodes.Table (E1 + 2);
 922       Nodes.Table (E1 + 2) := Nodes.Table (E2 + 2);
 923       Nodes.Table (E2 + 2) := Temp_Ent;
 924       Temp_Ent := Nodes.Table (E1 + 3);
 925       Nodes.Table (E1 + 3) := Nodes.Table (E2 + 3);
 926       Nodes.Table (E2 + 3) := Temp_Ent;
 927       Temp_Ent := Nodes.Table (E1 + 4);
 928       Nodes.Table (E1 + 4) := Nodes.Table (E2 + 4);
 929       Nodes.Table (E2 + 4) := Temp_Ent;
 930
 931       --  That exchange exchanged the parent pointers as well, which is what
 932       --  we want, but we need to patch up the defining identifier pointers
 933       --  in the parent nodes (the child pointers) to match this switch
 934       --  unless for Implicit types entities which have no parent, in which
 935       --  case we don't do anything otherwise we won't be able to revert back
 936       --  to the original situation.
 937
 938       --  Shouldn't this use Is_Itype instead of the Parent test
 939
 940       if Present (Parent (E1)) and then Present (Parent (E2)) then
 941          Set_Defining_Identifier (Parent (E1), E1);
 942          Set_Defining_Identifier (Parent (E2), E2);
 943       end if;
 944    end Exchange_Entities;
 945
 946    -----------------
 947    -- Extend_Node --
 948    -----------------
 949
 950    function Extend_Node (Node : Node_Id) return Entity_Id is
 951       Result : Entity_Id;
 952
 953       procedure Debug_Extend_Node;
 954       pragma Inline (Debug_Extend_Node);
 955       --  Debug routine for debug flag N
 956
 957       -----------------------
 958       -- Debug_Extend_Node --
 959       -----------------------
 960
 961       procedure Debug_Extend_Node is
 962       begin
 963          if Debug_Flag_N then
 964             Write_Str ("Extend node ");
 965             Write_Int (Int (Node));
 966
 967             if Result = Node then
 968                Write_Str (" in place");
 969             else
 970                Write_Str (" copied to ");
 971                Write_Int (Int (Result));
 972             end if;
 973
 974             --  Write_Eol;
 975          end if;
 976       end Debug_Extend_Node;
 977
 978    --  Start of processing for Extend_Node
 979
 980    begin
 981       pragma Assert (not (Has_Extension (Node)));
 982       Result := Allocate_Initialize_Node (Node, With_Extension => True);
 983       pragma Debug (Debug_Extend_Node);
 984       return Result;
 985    end Extend_Node;
 986
 987    -----------------
 988    -- Fix_Parents --
 989    -----------------
 990
 991    procedure Fix_Parents (Old_Node, New_Node : Node_Id) is
 992
 993       procedure Fix_Parent (Field : Union_Id; Old_Node, New_Node : Node_Id);
 994       --  Fixup one parent pointer. Field is checked to see if it
 995       --  points to a node, list, or element list that has a parent that
 996       --  points to Old_Node. If so, the parent is reset to point to New_Node.
 997
 998       ----------------
 999       -- Fix_Parent --
1000       ----------------
1001
1002       procedure Fix_Parent (Field : Union_Id; Old_Node, New_Node : Node_Id) is
1003       begin
1004          --  Fix parent of node that is referenced by Field. Note that we must
1005          --  exclude the case where the node is a member of a list, because in
1006          --  this case the parent is the parent of the list.
1007
1008          if Field in Node_Range
1009            and then Present (Node_Id (Field))
1010            and then not Nodes.Table (Node_Id (Field)).In_List
1011            and then Parent (Node_Id (Field)) = Old_Node
1012          then
1013             Set_Parent (Node_Id (Field), New_Node);
1014
1015          --  Fix parent of list that is referenced by Field
1016
1017          elsif Field in List_Range
1018            and then Present (List_Id (Field))
1019            and then Parent (List_Id (Field)) = Old_Node
1020          then
1021             Set_Parent (List_Id (Field), New_Node);
1022          end if;
1023       end Fix_Parent;
1024
1025    --  Start of processing for Fix_Parents
1026
1027    begin
1028       Fix_Parent (Field1 (New_Node), Old_Node, New_Node);
1029       Fix_Parent (Field2 (New_Node), Old_Node, New_Node);
1030       Fix_Parent (Field3 (New_Node), Old_Node, New_Node);
1031       Fix_Parent (Field4 (New_Node), Old_Node, New_Node);
1032       Fix_Parent (Field5 (New_Node), Old_Node, New_Node);
1033    end Fix_Parents;
1034
1035    -----------------------------------
1036    -- Get_Comes_From_Source_Default --
1037    -----------------------------------
1038
1039    function Get_Comes_From_Source_Default return Boolean is
1040    begin
1041       return Default_Node.Comes_From_Source;
1042    end Get_Comes_From_Source_Default;
1043
1044    -------------------
1045    -- Has_Extension --
1046    -------------------
1047
1048    function Has_Extension (N : Node_Id) return Boolean is
1049    begin
1050       return N < Nodes.Last and then Nodes.Table (N + 1).Is_Extension;
1051    end Has_Extension;
1052
1053    ----------------
1054    -- Initialize --
1055    ----------------
1056
1057    procedure Initialize is
1058       Dummy : Node_Id;
1059       pragma Warnings (Off, Dummy);
1060
1061    begin
1062       Node_Count := 0;
1063       Atree_Private_Part.Nodes.Init;
1064       Orig_Nodes.Init;
1065       Paren_Counts.Init;
1066
1067       --  Allocate Empty node
1068
1069       Dummy := New_Node (N_Empty, No_Location);
1070       Set_Name1 (Empty, No_Name);
1071
1072       --  Allocate Error node, and set Error_Posted, since we certainly
1073       --  only generate an Error node if we do post some kind of error!
1074
1075       Dummy := New_Node (N_Error, No_Location);
1076       Set_Name1 (Error, Error_Name);
1077       Set_Error_Posted (Error, True);
1078
1079       --  Set global variables for New_Copy_Tree
1080
1081       NCT_Hash_Tables_Used := False;
1082       NCT_Table_Entries    := 0;
1083       NCT_Hash_Table_Setup := False;
1084    end Initialize;
1085
1086    --------------------------
1087    -- Is_Rewrite_Insertion --
1088    --------------------------
1089
1090    function Is_Rewrite_Insertion (Node : Node_Id) return Boolean is
1091    begin
1092       return Nodes.Table (Node).Rewrite_Ins;
1093    end Is_Rewrite_Insertion;
1094
1095    -----------------------------
1096    -- Is_Rewrite_Substitution --
1097    -----------------------------
1098
1099    function Is_Rewrite_Substitution (Node : Node_Id) return Boolean is
1100    begin
1101       return Orig_Nodes.Table (Node) /= Node;
1102    end Is_Rewrite_Substitution;
1103
1104    ------------------
1105    -- Last_Node_Id --
1106    ------------------
1107
1108    function Last_Node_Id return Node_Id is
1109    begin
1110       return Nodes.Last;
1111    end Last_Node_Id;
1112
1113    ----------
1114    -- Lock --
1115    ----------
1116
1117    procedure Lock is
1118    begin
1119       Nodes.Locked := True;
1120       Orig_Nodes.Locked := True;
1121       Nodes.Release;
1122       Orig_Nodes.Release;
1123    end Lock;
1124
1125    ----------------------------
1126    -- Mark_Rewrite_Insertion --
1127    ----------------------------
1128
1129    procedure Mark_Rewrite_Insertion (New_Node : Node_Id) is
1130    begin
1131       Nodes.Table (New_Node).Rewrite_Ins := True;
1132    end Mark_Rewrite_Insertion;
1133
1134    --------------
1135    -- New_Copy --
1136    --------------
1137
1138    function New_Copy (Source : Node_Id) return Node_Id is
1139       New_Id : Node_Id := Source;
1140
1141    begin
1142       if Source > Empty_Or_Error then
1143
1144          New_Id := Allocate_Initialize_Node (Source, Has_Extension (Source));
1145
1146          Nodes.Table (New_Id).Link := Empty_List_Or_Node;
1147          Nodes.Table (New_Id).In_List := False;
1148
1149          --  If the original is marked as a rewrite insertion, then unmark
1150          --  the copy, since we inserted the original, not the copy.
1151
1152          Nodes.Table (New_Id).Rewrite_Ins := False;
1153          pragma Debug (New_Node_Debugging_Output (New_Id));
1154       end if;
1155
1156       return New_Id;
1157    end New_Copy;
1158
1159    -------------------
1160    -- New_Copy_Tree --
1161    -------------------
1162
1163    --  Our approach here requires a two pass traversal of the tree. The
1164    --  first pass visits all nodes that eventually will be copied looking
1165    --  for defining Itypes. If any defining Itypes are found, then they are
1166    --  copied, and an entry is added to the replacement map. In the second
1167    --  phase, the tree is copied, using the replacement map to replace any
1168    --  Itype references within the copied tree.
1169
1170    --  The following hash tables are used if the Map supplied has more
1171    --  than hash threshhold entries to speed up access to the map. If
1172    --  there are fewer entries, then the map is searched sequentially
1173    --  (because setting up a hash table for only a few entries takes
1174    --  more time than it saves.
1175
1176    function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num;
1177    --  Hash function used for hash operations
1178
1179    -------------------
1180    -- New_Copy_Hash --
1181    -------------------
1182
1183    function New_Copy_Hash (E : Entity_Id) return NCT_Header_Num is
1184    begin
1185       return Nat (E) mod (NCT_Header_Num'Last + 1);
1186    end New_Copy_Hash;
1187
1188    ---------------
1189    -- NCT_Assoc --
1190    ---------------
1191
1192    --  The hash table NCT_Assoc associates old entities in the table
1193    --  with their corresponding new entities (i.e. the pairs of entries
1194    --  presented in the original Map argument are Key-Element pairs).
1195
1196    package NCT_Assoc is new Simple_HTable (
1197      Header_Num => NCT_Header_Num,
1198      Element    => Entity_Id,
1199      No_Element => Empty,
1200      Key        => Entity_Id,
1201      Hash       => New_Copy_Hash,
1202      Equal      => Types."=");
1203
1204    ---------------------
1205    -- NCT_Itype_Assoc --
1206    ---------------------
1207
1208    --  The hash table NCT_Itype_Assoc contains entries only for those
1209    --  old nodes which have a non-empty Associated_Node_For_Itype set.
1210    --  The key is the associated node, and the element is the new node
1211    --  itself (NOT the associated node for the new node).
1212
1213    package NCT_Itype_Assoc is new Simple_HTable (
1214      Header_Num => NCT_Header_Num,
1215      Element    => Entity_Id,
1216      No_Element => Empty,
1217      Key        => Entity_Id,
1218      Hash       => New_Copy_Hash,
1219      Equal      => Types."=");
1220
1221    --  Start of processing for New_Copy_Tree function
1222
1223    function New_Copy_Tree
1224      (Source    : Node_Id;
1225       Map       : Elist_Id := No_Elist;
1226       New_Sloc  : Source_Ptr := No_Location;
1227       New_Scope : Entity_Id := Empty) return Node_Id
1228    is
1229       Actual_Map : Elist_Id := Map;
1230       --  This is the actual map for the copy. It is initialized with the
1231       --  given elements, and then enlarged as required for Itypes that are
1232       --  copied during the first phase of the copy operation. The visit
1233       --  procedures add elements to this map as Itypes are encountered.
1234       --  The reason we cannot use Map directly, is that it may well be
1235       --  (and normally is) initialized to No_Elist, and if we have mapped
1236       --  entities, we have to reset it to point to a real Elist.
1237
1238       function Assoc (N : Node_Or_Entity_Id) return Node_Id;
1239       --  Called during second phase to map entities into their corresponding
1240       --  copies using Actual_Map. If the argument is not an entity, or is not
1241       --  in Actual_Map, then it is returned unchanged.
1242
1243       procedure Build_NCT_Hash_Tables;
1244       --  Builds hash tables (number of elements >= threshold value)
1245
1246       function Copy_Elist_With_Replacement
1247         (Old_Elist : Elist_Id) return Elist_Id;
1248       --  Called during second phase to copy element list doing replacements
1249
1250       procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id);
1251       --  Called during the second phase to process a copied Itype. The actual
1252       --  copy happened during the first phase (so that we could make the entry
1253       --  in the mapping), but we still have to deal with the descendents of
1254       --  the copied Itype and copy them where necessary.
1255
1256       function Copy_List_With_Replacement (Old_List : List_Id) return List_Id;
1257       --  Called during second phase to copy list doing replacements
1258
1259       function Copy_Node_With_Replacement (Old_Node : Node_Id) return Node_Id;
1260       --  Called during second phase to copy node doing replacements
1261
1262       procedure Visit_Elist (E : Elist_Id);
1263       --  Called during first phase to visit all elements of an Elist
1264
1265       procedure Visit_Field (F : Union_Id; N : Node_Id);
1266       --  Visit a single field, recursing to call Visit_Node or Visit_List
1267       --  if the field is a syntactic descendent of the current node (i.e.
1268       --  its parent is Node N).
1269
1270       procedure Visit_Itype (Old_Itype : Entity_Id);
1271       --  Called during first phase to visit subsidiary fields of a defining
1272       --  Itype, and also create a copy and make an entry in the replacement
1273       --  map for the new copy.
1274
1275       procedure Visit_List (L : List_Id);
1276       --  Called during first phase to visit all elements of a List
1277
1278       procedure Visit_Node (N : Node_Or_Entity_Id);
1279       --  Called during first phase to visit a node and all its subtrees
1280
1281       -----------
1282       -- Assoc --
1283       -----------
1284
1285       function Assoc (N : Node_Or_Entity_Id) return Node_Id is
1286          E   : Elmt_Id;
1287          Ent : Entity_Id;
1288
1289       begin
1290          if not Has_Extension (N) or else No (Actual_Map) then
1291             return N;
1292
1293          elsif NCT_Hash_Tables_Used then
1294             Ent := NCT_Assoc.Get (Entity_Id (N));
1295
1296             if Present (Ent) then
1297                return Ent;
1298             else
1299                return N;
1300             end if;
1301
1302          --  No hash table used, do serial search
1303
1304          else
1305             E := First_Elmt (Actual_Map);
1306             while Present (E) loop
1307                if Node (E) = N then
1308                   return Node (Next_Elmt (E));
1309                else
1310                   E := Next_Elmt (Next_Elmt (E));
1311                end if;
1312             end loop;
1313          end if;
1314
1315          return N;
1316       end Assoc;
1317
1318       ---------------------------
1319       -- Build_NCT_Hash_Tables --
1320       ---------------------------
1321
1322       procedure Build_NCT_Hash_Tables is
1323          Elmt : Elmt_Id;
1324          Ent  : Entity_Id;
1325       begin
1326          if NCT_Hash_Table_Setup then
1327             NCT_Assoc.Reset;
1328             NCT_Itype_Assoc.Reset;
1329          end if;
1330
1331          Elmt := First_Elmt (Actual_Map);
1332          while Present (Elmt) loop
1333             Ent := Node (Elmt);
1334
1335             --  Get new entity, and associate old and new
1336
1337             Next_Elmt (Elmt);
1338             NCT_Assoc.Set (Ent, Node (Elmt));
1339
1340             if Is_Type (Ent) then
1341                declare
1342                   Anode : constant Entity_Id :=
1343                             Associated_Node_For_Itype (Ent);
1344
1345                begin
1346                   if Present (Anode) then
1347
1348                      --  Enter a link between the associated node of the
1349                      --  old Itype and the new Itype, for updating later
1350                      --  when node is copied.
1351
1352                      NCT_Itype_Assoc.Set (Anode, Node (Elmt));
1353                   end if;
1354                end;
1355             end if;
1356
1357             Next_Elmt (Elmt);
1358          end loop;
1359
1360          NCT_Hash_Tables_Used := True;
1361          NCT_Hash_Table_Setup := True;
1362       end Build_NCT_Hash_Tables;
1363
1364       ---------------------------------
1365       -- Copy_Elist_With_Replacement --
1366       ---------------------------------
1367
1368       function Copy_Elist_With_Replacement
1369         (Old_Elist : Elist_Id) return Elist_Id
1370       is
1371          M         : Elmt_Id;
1372          New_Elist : Elist_Id;
1373
1374       begin
1375          if No (Old_Elist) then
1376             return No_Elist;
1377
1378          else
1379             New_Elist := New_Elmt_List;
1380
1381             M := First_Elmt (Old_Elist);
1382             while Present (M) loop
1383                Append_Elmt (Copy_Node_With_Replacement (Node (M)), New_Elist);
1384                Next_Elmt (M);
1385             end loop;
1386          end if;
1387
1388          return New_Elist;
1389       end Copy_Elist_With_Replacement;
1390
1391       ---------------------------------
1392       -- Copy_Itype_With_Replacement --
1393       ---------------------------------
1394
1395       --  This routine exactly parallels its phase one analog Visit_Itype,
1396       --  and like that routine, knows far too many semantic details about
1397       --  the descendents of Itypes and whether they need copying or not.
1398
1399       procedure Copy_Itype_With_Replacement (New_Itype : Entity_Id) is
1400       begin
1401          --  Translate Next_Entity, Scope and Etype fields, in case they
1402          --  reference entities that have been mapped into copies.
1403
1404          Set_Next_Entity (New_Itype, Assoc (Next_Entity (New_Itype)));
1405          Set_Etype       (New_Itype, Assoc (Etype       (New_Itype)));
1406
1407          if Present (New_Scope) then
1408             Set_Scope    (New_Itype, New_Scope);
1409          else
1410             Set_Scope    (New_Itype, Assoc (Scope       (New_Itype)));
1411          end if;
1412
1413          --  Copy referenced fields
1414
1415          if Is_Discrete_Type (New_Itype) then
1416             Set_Scalar_Range (New_Itype,
1417               Copy_Node_With_Replacement (Scalar_Range (New_Itype)));
1418
1419          elsif Has_Discriminants (Base_Type (New_Itype)) then
1420             Set_Discriminant_Constraint (New_Itype,
1421               Copy_Elist_With_Replacement
1422                 (Discriminant_Constraint (New_Itype)));
1423
1424          elsif Is_Array_Type (New_Itype) then
1425             if Present (First_Index (New_Itype)) then
1426                Set_First_Index (New_Itype,
1427                  First (Copy_List_With_Replacement
1428                          (List_Containing (First_Index (New_Itype)))));
1429             end if;
1430
1431             if Is_Packed (New_Itype) then
1432                Set_Packed_Array_Type (New_Itype,
1433                  Copy_Node_With_Replacement
1434                    (Packed_Array_Type (New_Itype)));
1435             end if;
1436          end if;
1437       end Copy_Itype_With_Replacement;
1438
1439       --------------------------------
1440       -- Copy_List_With_Replacement --
1441       --------------------------------
1442
1443       function Copy_List_With_Replacement
1444         (Old_List : List_Id) return List_Id
1445       is
1446          New_List : List_Id;
1447          E        : Node_Id;
1448
1449       begin
1450          if Old_List = No_List then
1451             return No_List;
1452
1453          else
1454             New_List := Empty_List;
1455
1456             E := First (Old_List);
1457             while Present (E) loop
1458                Append (Copy_Node_With_Replacement (E), New_List);
1459                Next (E);
1460             end loop;
1461
1462             return New_List;
1463          end if;
1464       end Copy_List_With_Replacement;
1465
1466       --------------------------------
1467       -- Copy_Node_With_Replacement --
1468       --------------------------------
1469
1470       function Copy_Node_With_Replacement
1471         (Old_Node : Node_Id) return Node_Id
1472       is
1473          New_Node : Node_Id;
1474
1475          procedure Adjust_Named_Associations
1476            (Old_Node : Node_Id;
1477             New_Node : Node_Id);
1478          --  If a call node has named associations, these are chained through
1479          --  the First_Named_Actual, Next_Named_Actual links. These must be
1480          --  propagated separately to the new parameter list, because these
1481          --  are not syntactic fields.
1482
1483          function Copy_Field_With_Replacement
1484            (Field : Union_Id) return Union_Id;
1485          --  Given Field, which is a field of Old_Node, return a copy of it
1486          --  if it is a syntactic field (i.e. its parent is Node), setting
1487          --  the parent of the copy to poit to New_Node. Otherwise returns
1488          --  the field (possibly mapped if it is an entity).
1489
1490          -------------------------------
1491          -- Adjust_Named_Associations --
1492          -------------------------------
1493
1494          procedure Adjust_Named_Associations
1495            (Old_Node : Node_Id;
1496             New_Node : Node_Id)
1497          is
1498             Old_E : Node_Id;
1499             New_E : Node_Id;
1500
1501             Old_Next : Node_Id;
1502             New_Next : Node_Id;
1503
1504          begin
1505             Old_E := First (Parameter_Associations (Old_Node));
1506             New_E := First (Parameter_Associations (New_Node));
1507             while Present (Old_E) loop
1508                if Nkind (Old_E) = N_Parameter_Association
1509                  and then Present (Next_Named_Actual (Old_E))
1510                then
1511                   if First_Named_Actual (Old_Node)
1512                     =  Explicit_Actual_Parameter (Old_E)
1513                   then
1514                      Set_First_Named_Actual
1515                        (New_Node, Explicit_Actual_Parameter (New_E));
1516                   end if;
1517
1518                   --  Now scan parameter list from the beginning,to locate
1519                   --  next named actual, which can be out of order.
1520
1521                   Old_Next := First (Parameter_Associations (Old_Node));
1522                   New_Next := First (Parameter_Associations (New_Node));
1523
1524                   while Nkind (Old_Next) /= N_Parameter_Association
1525                     or else  Explicit_Actual_Parameter (Old_Next)
1526                       /= Next_Named_Actual (Old_E)
1527                   loop
1528                      Next (Old_Next);
1529                      Next (New_Next);
1530                   end loop;
1531
1532                   Set_Next_Named_Actual
1533                     (New_E, Explicit_Actual_Parameter (New_Next));
1534                end if;
1535
1536                Next (Old_E);
1537                Next (New_E);
1538             end loop;
1539          end Adjust_Named_Associations;
1540
1541          ---------------------------------
1542          -- Copy_Field_With_Replacement --
1543          ---------------------------------
1544
1545          function Copy_Field_With_Replacement
1546            (Field : Union_Id) return Union_Id
1547          is
1548          begin
1549             if Field = Union_Id (Empty) then
1550                return Field;
1551
1552             elsif Field in Node_Range then
1553                declare
1554                   Old_N : constant Node_Id := Node_Id (Field);
1555                   New_N : Node_Id;
1556
1557                begin
1558                   --  If syntactic field, as indicated by the parent pointer
1559                   --  being set, then copy the referenced node recursively.
1560
1561                   if Parent (Old_N) = Old_Node then
1562                      New_N := Copy_Node_With_Replacement (Old_N);
1563
1564                      if New_N /= Old_N then
1565                         Set_Parent (New_N, New_Node);
1566                      end if;
1567
1568                   --  For semantic fields, update possible entity reference
1569                   --  from the replacement map.
1570
1571                   else
1572                      New_N := Assoc (Old_N);
1573                   end if;
1574
1575                   return Union_Id (New_N);
1576                end;
1577
1578             elsif Field in List_Range then
1579                declare
1580                   Old_L : constant List_Id := List_Id (Field);
1581                   New_L : List_Id;
1582
1583                begin
1584                   --  If syntactic field, as indicated by the parent pointer,
1585                   --  then recursively copy the entire referenced list.
1586
1587                   if Parent (Old_L) = Old_Node then
1588                      New_L := Copy_List_With_Replacement (Old_L);
1589                      Set_Parent (New_L, New_Node);
1590
1591                   --  For semantic list, just returned unchanged
1592
1593                   else
1594                      New_L := Old_L;
1595                   end if;
1596
1597                   return Union_Id (New_L);
1598                end;
1599
1600             --  Anything other than a list or a node is returned unchanged
1601
1602             else
1603                return Field;
1604             end if;
1605          end Copy_Field_With_Replacement;
1606
1607       --  Start of processing for Copy_Node_With_Replacement
1608
1609       begin
1610          if Old_Node <= Empty_Or_Error then
1611             return Old_Node;
1612
1613          elsif Has_Extension (Old_Node) then
1614             return Assoc (Old_Node);
1615
1616          else
1617             New_Node := New_Copy (Old_Node);
1618
1619             --  If the node we are copying is the associated node of a
1620             --  previously copied Itype, then adjust the associated node
1621             --  of the copy of that Itype accordingly.
1622
1623             if Present (Actual_Map) then
1624                declare
1625                   E   : Elmt_Id;
1626                   Ent : Entity_Id;
1627
1628                begin
1629                   --  Case of hash table used
1630
1631                   if NCT_Hash_Tables_Used then
1632                      Ent := NCT_Itype_Assoc.Get (Old_Node);
1633
1634                      if Present (Ent) then
1635                         Set_Associated_Node_For_Itype (Ent, New_Node);
1636                      end if;
1637
1638                   --  Case of no hash table used
1639
1640                   else
1641                      E := First_Elmt (Actual_Map);
1642                      while Present (E) loop
1643                         if Is_Itype (Node (E))
1644                           and then
1645                             Old_Node = Associated_Node_For_Itype (Node (E))
1646                         then
1647                            Set_Associated_Node_For_Itype
1648                              (Node (Next_Elmt (E)), New_Node);
1649                         end if;
1650
1651                         E := Next_Elmt (Next_Elmt (E));
1652                      end loop;
1653                   end if;
1654                end;
1655             end if;
1656
1657             --  Recursively copy descendents
1658
1659             Set_Field1
1660               (New_Node, Copy_Field_With_Replacement (Field1 (New_Node)));
1661             Set_Field2
1662               (New_Node, Copy_Field_With_Replacement (Field2 (New_Node)));
1663             Set_Field3
1664               (New_Node, Copy_Field_With_Replacement (Field3 (New_Node)));
1665             Set_Field4
1666               (New_Node, Copy_Field_With_Replacement (Field4 (New_Node)));
1667             Set_Field5
1668               (New_Node, Copy_Field_With_Replacement (Field5 (New_Node)));
1669
1670             --  Adjust Sloc of new node if necessary
1671
1672             if New_Sloc /= No_Location then
1673                Set_Sloc (New_Node, New_Sloc);
1674
1675                --  If we adjust the Sloc, then we are essentially making
1676                --  a completely new node, so the Comes_From_Source flag
1677                --  should be reset to the proper default value.
1678
1679                Nodes.Table (New_Node).Comes_From_Source :=
1680                  Default_Node.Comes_From_Source;
1681             end if;
1682
1683             --  If the node is call and has named associations,
1684             --  set the corresponding links in the copy.
1685
1686             if (Nkind (Old_Node) = N_Function_Call
1687                  or else Nkind (Old_Node) = N_Entry_Call_Statement
1688                  or else
1689                    Nkind (Old_Node) = N_Procedure_Call_Statement)
1690               and then Present (First_Named_Actual (Old_Node))
1691             then
1692                Adjust_Named_Associations (Old_Node, New_Node);
1693             end if;
1694
1695             --  Reset First_Real_Statement for Handled_Sequence_Of_Statements.
1696             --  The replacement mechanism applies to entities, and is not used
1697             --  here. Eventually we may need a more general graph-copying
1698             --  routine. For now, do a sequential search to find desired node.
1699
1700             if Nkind (Old_Node) = N_Handled_Sequence_Of_Statements
1701               and then Present (First_Real_Statement (Old_Node))
1702             then
1703                declare
1704                   Old_F  : constant Node_Id := First_Real_Statement (Old_Node);
1705                   N1, N2 : Node_Id;
1706
1707                begin
1708                   N1 := First (Statements (Old_Node));
1709                   N2 := First (Statements (New_Node));
1710
1711                   while N1 /= Old_F loop
1712                      Next (N1);
1713                      Next (N2);
1714                   end loop;
1715
1716                   Set_First_Real_Statement (New_Node, N2);
1717                end;
1718             end if;
1719          end if;
1720
1721          --  All done, return copied node
1722
1723          return New_Node;
1724       end Copy_Node_With_Replacement;
1725
1726       -----------------
1727       -- Visit_Elist --
1728       -----------------
1729
1730       procedure Visit_Elist (E : Elist_Id) is
1731          Elmt : Elmt_Id;
1732       begin
1733          if Present (E) then
1734             Elmt := First_Elmt (E);
1735
1736             while Elmt /= No_Elmt loop
1737                Visit_Node (Node (Elmt));
1738                Next_Elmt (Elmt);
1739             end loop;
1740          end if;
1741       end Visit_Elist;
1742
1743       -----------------
1744       -- Visit_Field --
1745       -----------------
1746
1747       procedure Visit_Field (F : Union_Id; N : Node_Id) is
1748       begin
1749          if F = Union_Id (Empty) then
1750             return;
1751
1752          elsif F in Node_Range then
1753
1754             --  Copy node if it is syntactic, i.e. its parent pointer is
1755             --  set to point to the field that referenced it (certain
1756             --  Itypes will also meet this criterion, which is fine, since
1757             --  these are clearly Itypes that do need to be copied, since
1758             --  we are copying their parent.)
1759
1760             if Parent (Node_Id (F)) = N then
1761                Visit_Node (Node_Id (F));
1762                return;
1763
1764             --  Another case, if we are pointing to an Itype, then we want
1765             --  to copy it if its associated node is somewhere in the tree
1766             --  being copied.
1767
1768             --  Note: the exclusion of self-referential copies is just an
1769             --  optimization, since the search of the already copied list
1770             --  would catch it, but it is a common case (Etype pointing
1771             --  to itself for an Itype that is a base type).
1772
1773             elsif Has_Extension (Node_Id (F))
1774               and then Is_Itype (Entity_Id (F))
1775               and then Node_Id (F) /= N
1776             then
1777                declare
1778                   P : Node_Id;
1779
1780                begin
1781                   P := Associated_Node_For_Itype (Node_Id (F));
1782                   while Present (P) loop
1783                      if P = Source then
1784                         Visit_Node (Node_Id (F));
1785                         return;
1786                      else
1787                         P := Parent (P);
1788                      end if;
1789                   end loop;
1790
1791                   --  An Itype whose parent is not being copied definitely
1792                   --  should NOT be copied, since it does not belong in any
1793                   --  sense to the copied subtree.
1794
1795                   return;
1796                end;
1797             end if;
1798
1799          elsif F in List_Range
1800            and then Parent (List_Id (F)) = N
1801          then
1802             Visit_List (List_Id (F));
1803             return;
1804          end if;
1805       end Visit_Field;
1806
1807       -----------------
1808       -- Visit_Itype --
1809       -----------------
1810
1811       --  Note: we are relying on far too much semantic knowledge in this
1812       --  routine, it really should just do a blind replacement of all
1813       --  fields, or at least a more blind replacement. For example, we
1814       --  do not deal with corresponding record types, and that works
1815       --  because we have no Itypes of task types, but nowhere is there
1816       --  a guarantee that this will always be the case. ???
1817
1818       procedure Visit_Itype (Old_Itype : Entity_Id) is
1819          New_Itype : Entity_Id;
1820          E         : Elmt_Id;
1821          Ent       : Entity_Id;
1822
1823       begin
1824          --  Itypes that describe the designated type of access to subprograms
1825          --  have the structure of subprogram declarations, with signatures,
1826          --  etc. Either we duplicate the signatures completely, or choose to
1827          --  share such itypes, which is fine because their elaboration will
1828          --  have no side effects. In any case, this is additional semantic
1829          --  information that seems awkward to have in atree.
1830
1831          if Ekind (Old_Itype) = E_Subprogram_Type then
1832             return;
1833          end if;
1834
1835          New_Itype := New_Copy (Old_Itype);
1836
1837          --  The new Itype has all the attributes of the old one, and
1838          --  we just copy the contents of the entity. However, the back-end
1839          --  needs different names for debugging purposes, so we create a
1840          --  new internal name by appending the letter 'c' (copy) to the
1841          --  name of the original.
1842
1843          Get_Name_String (Chars (Old_Itype));
1844          Add_Char_To_Name_Buffer ('c');
1845          Set_Chars (New_Itype, Name_Enter);
1846
1847          --  If our associated node is an entity that has already been copied,
1848          --  then set the associated node of the copy to point to the right
1849          --  copy. If we have copied an Itype that is itself the associated
1850          --  node of some previously copied Itype, then we set the right
1851          --  pointer in the other direction.
1852
1853          if Present (Actual_Map) then
1854
1855             --  Case of hash tables used
1856
1857             if NCT_Hash_Tables_Used then
1858
1859                Ent := NCT_Assoc.Get (Associated_Node_For_Itype (Old_Itype));
1860
1861                if Present (Ent) then
1862                   Set_Associated_Node_For_Itype (New_Itype, Ent);
1863                end if;
1864
1865                Ent := NCT_Itype_Assoc.Get (Old_Itype);
1866                if Present (Ent) then
1867                   Set_Associated_Node_For_Itype (Ent, New_Itype);
1868
1869                --  If the hash table has no association for this Itype and
1870                --  its associated node, enter one now.
1871
1872                else
1873                   NCT_Itype_Assoc.Set
1874                     (Associated_Node_For_Itype (Old_Itype), New_Itype);
1875                end if;
1876
1877             --  Case of hash tables not used
1878
1879             else
1880                E := First_Elmt (Actual_Map);
1881                while Present (E) loop
1882                   if Associated_Node_For_Itype (Old_Itype) = Node (E) then
1883                      Set_Associated_Node_For_Itype
1884                        (New_Itype, Node (Next_Elmt (E)));
1885                   end if;
1886
1887                   if Is_Type (Node (E))
1888                     and then
1889                       Old_Itype = Associated_Node_For_Itype (Node (E))
1890                   then
1891                      Set_Associated_Node_For_Itype
1892                        (Node (Next_Elmt (E)), New_Itype);
1893                   end if;
1894
1895                   E := Next_Elmt (Next_Elmt (E));
1896                end loop;
1897             end if;
1898          end if;
1899
1900          if Present (Freeze_Node (New_Itype)) then
1901             Set_Is_Frozen (New_Itype, False);
1902             Set_Freeze_Node (New_Itype, Empty);
1903          end if;
1904
1905          --  Add new association to map
1906
1907          if No (Actual_Map) then
1908             Actual_Map := New_Elmt_List;
1909          end if;
1910
1911          Append_Elmt (Old_Itype, Actual_Map);
1912          Append_Elmt (New_Itype, Actual_Map);
1913
1914          if NCT_Hash_Tables_Used then
1915             NCT_Assoc.Set (Old_Itype, New_Itype);
1916
1917          else
1918             NCT_Table_Entries := NCT_Table_Entries + 1;
1919
1920             if NCT_Table_Entries > NCT_Hash_Threshhold then
1921                Build_NCT_Hash_Tables;
1922             end if;
1923          end if;
1924
1925          --  If a record subtype is simply copied, the entity list will be
1926          --  shared. Thus cloned_Subtype must be set to indicate the sharing.
1927
1928          if Ekind (Old_Itype) = E_Record_Subtype
1929            or else Ekind (Old_Itype) = E_Class_Wide_Subtype
1930          then
1931             Set_Cloned_Subtype (New_Itype, Old_Itype);
1932          end if;
1933
1934          --  Visit descendents that eventually get copied
1935
1936          Visit_Field (Union_Id (Etype (Old_Itype)), Old_Itype);
1937
1938          if Is_Discrete_Type (Old_Itype) then
1939             Visit_Field (Union_Id (Scalar_Range (Old_Itype)), Old_Itype);
1940
1941          elsif Has_Discriminants (Base_Type (Old_Itype)) then
1942             --  ??? This should involve call to Visit_Field
1943             Visit_Elist (Discriminant_Constraint (Old_Itype));
1944
1945          elsif Is_Array_Type (Old_Itype) then
1946             if Present (First_Index (Old_Itype)) then
1947                Visit_Field (Union_Id (List_Containing
1948                                 (First_Index (Old_Itype))),
1949                             Old_Itype);
1950             end if;
1951
1952             if Is_Packed (Old_Itype) then
1953                Visit_Field (Union_Id (Packed_Array_Type (Old_Itype)),
1954                             Old_Itype);
1955             end if;
1956          end if;
1957       end Visit_Itype;
1958
1959       ----------------
1960       -- Visit_List --
1961       ----------------
1962
1963       procedure Visit_List (L : List_Id) is
1964          N : Node_Id;
1965       begin
1966          if L /= No_List then
1967             N := First (L);
1968
1969             while Present (N) loop
1970                Visit_Node (N);
1971                Next (N);
1972             end loop;
1973          end if;
1974       end Visit_List;
1975
1976       ----------------
1977       -- Visit_Node --
1978       ----------------
1979
1980       procedure Visit_Node (N : Node_Or_Entity_Id) is
1981
1982       --  Start of processing for Visit_Node
1983
1984       begin
1985          --  Handle case of an Itype, which must be copied
1986
1987          if Has_Extension (N)
1988            and then Is_Itype (N)
1989          then
1990             --  Nothing to do if already in the list. This can happen with an
1991             --  Itype entity that appears more than once in the tree.
1992             --  Note that we do not want to visit descendents in this case.
1993
1994             --  Test for already in list when hash table is used
1995
1996             if NCT_Hash_Tables_Used then
1997                if Present (NCT_Assoc.Get (Entity_Id (N))) then
1998                   return;
1999                end if;
2000
2001             --  Test for already in list when hash table not used
2002
2003             else
2004                declare
2005                   E : Elmt_Id;
2006                begin
2007                   if Present (Actual_Map) then
2008                      E := First_Elmt (Actual_Map);
2009                      while Present (E) loop
2010                         if Node (E) = N then
2011                            return;
2012                         else
2013                            E := Next_Elmt (Next_Elmt (E));
2014                         end if;
2015                      end loop;
2016                   end if;
2017                end;
2018             end if;
2019
2020             Visit_Itype (N);
2021          end if;
2022
2023          --  Visit descendents
2024
2025          Visit_Field (Field1 (N), N);
2026          Visit_Field (Field2 (N), N);
2027          Visit_Field (Field3 (N), N);
2028          Visit_Field (Field4 (N), N);
2029          Visit_Field (Field5 (N), N);
2030       end Visit_Node;
2031
2032    --  Start of processing for New_Copy_Tree
2033
2034    begin
2035       Actual_Map := Map;
2036
2037       --  See if we should use hash table
2038
2039       if No (Actual_Map) then
2040          NCT_Hash_Tables_Used := False;
2041
2042       else
2043          declare
2044             Elmt : Elmt_Id;
2045
2046          begin
2047             NCT_Table_Entries := 0;
2048
2049             Elmt := First_Elmt (Actual_Map);
2050             while Present (Elmt) loop
2051                NCT_Table_Entries := NCT_Table_Entries + 1;
2052                Next_Elmt (Elmt);
2053                Next_Elmt (Elmt);
2054             end loop;
2055
2056             if NCT_Table_Entries > NCT_Hash_Threshhold then
2057                Build_NCT_Hash_Tables;
2058             else
2059                NCT_Hash_Tables_Used := False;
2060             end if;
2061          end;
2062       end if;
2063
2064       --  Hash table set up if required, now start phase one by visiting
2065       --  top node (we will recursively visit the descendents).
2066
2067       Visit_Node (Source);
2068
2069       --  Now the second phase of the copy can start. First we process
2070       --  all the mapped entities, copying their descendents.
2071
2072       if Present (Actual_Map) then
2073          declare
2074             Elmt      : Elmt_Id;
2075             New_Itype : Entity_Id;
2076          begin
2077             Elmt := First_Elmt (Actual_Map);
2078             while Present (Elmt) loop
2079                Next_Elmt (Elmt);
2080                New_Itype := Node (Elmt);
2081                Copy_Itype_With_Replacement (New_Itype);
2082                Next_Elmt (Elmt);
2083             end loop;
2084          end;
2085       end if;
2086
2087       --  Now we can copy the actual tree
2088
2089       return Copy_Node_With_Replacement (Source);
2090    end New_Copy_Tree;
2091
2092    ----------------
2093    -- New_Entity --
2094    ----------------
2095
2096    function New_Entity
2097      (New_Node_Kind : Node_Kind;
2098       New_Sloc      : Source_Ptr) return Entity_Id
2099    is
2100       Ent : Entity_Id;
2101
2102    begin
2103       pragma Assert (New_Node_Kind in N_Entity);
2104
2105       Ent := Allocate_Initialize_Node (Empty, With_Extension => True);
2106
2107       --  If this is a node with a real location and we are generating
2108       --  source nodes, then reset Current_Error_Node. This is useful
2109       --  if we bomb during parsing to get a error location for the bomb.
2110
2111       if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
2112          Current_Error_Node := Ent;
2113       end if;
2114
2115       Nodes.Table (Ent).Nkind  := New_Node_Kind;
2116       Nodes.Table (Ent).Sloc   := New_Sloc;
2117       pragma Debug (New_Node_Debugging_Output (Ent));
2118
2119       return Ent;
2120    end New_Entity;
2121
2122    --------------
2123    -- New_Node --
2124    --------------
2125
2126    function New_Node
2127      (New_Node_Kind : Node_Kind;
2128       New_Sloc      : Source_Ptr) return Node_Id
2129    is
2130       Nod : Node_Id;
2131
2132    begin
2133       pragma Assert (New_Node_Kind not in N_Entity);
2134       Nod := Allocate_Initialize_Node (Empty, With_Extension => False);
2135       Nodes.Table (Nod).Nkind := New_Node_Kind;
2136       Nodes.Table (Nod).Sloc  := New_Sloc;
2137       pragma Debug (New_Node_Debugging_Output (Nod));
2138
2139       --  If this is a node with a real location and we are generating source
2140       --  nodes, then reset Current_Error_Node. This is useful if we bomb
2141       --  during parsing to get an error location for the bomb.
2142
2143       if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
2144          Current_Error_Node := Nod;
2145       end if;
2146
2147       return Nod;
2148    end New_Node;
2149
2150    -------------------------
2151    -- New_Node_Breakpoint --
2152    -------------------------
2153
2154    procedure nn is -- New_Node_Breakpoint
2155    begin
2156       Write_Str ("Watched node ");
2157       Write_Int (Int (Watch_Node));
2158       Write_Str (" created");
2159       Write_Eol;
2160    end nn;
2161
2162    -------------------------------
2163    -- New_Node_Debugging_Output --
2164    -------------------------------
2165
2166    procedure nnd (N : Node_Id) is -- New_Node_Debugging_Output
2167       Node_Is_Watched : constant Boolean := N = Watch_Node;
2168
2169    begin
2170       if Debug_Flag_N or else Node_Is_Watched then
2171          Write_Str ("Allocate ");
2172
2173          if Nkind (N) in N_Entity then
2174             Write_Str ("entity");
2175          else
2176             Write_Str ("node");
2177          end if;
2178
2179          Write_Str (", Id = ");
2180          Write_Int (Int (N));
2181          Write_Str ("  ");
2182          Write_Location (Sloc (N));
2183          Write_Str ("  ");
2184          Write_Str (Node_Kind'Image (Nkind (N)));
2185          Write_Eol;
2186
2187          if Node_Is_Watched then
2188             New_Node_Breakpoint;
2189          end if;
2190       end if;
2191    end nnd;
2192
2193    -----------
2194    -- Nkind --
2195    -----------
2196
2197    function Nkind (N : Node_Id) return Node_Kind is
2198    begin
2199       return Nodes.Table (N).Nkind;
2200    end Nkind;
2201
2202    --------------
2203    -- Nkind_In --
2204    --------------
2205
2206    function Nkind_In
2207      (N  : Node_Id;
2208       V1 : Node_Kind;
2209       V2 : Node_Kind) return Boolean
2210    is
2211    begin
2212       return Nkind_In (Nkind (N), V1, V2);
2213    end Nkind_In;
2214
2215    function Nkind_In
2216      (N  : Node_Id;
2217       V1 : Node_Kind;
2218       V2 : Node_Kind;
2219       V3 : Node_Kind) return Boolean
2220    is
2221    begin
2222       return Nkind_In (Nkind (N), V1, V2, V3);
2223    end Nkind_In;
2224
2225    function Nkind_In
2226      (N  : Node_Id;
2227       V1 : Node_Kind;
2228       V2 : Node_Kind;
2229       V3 : Node_Kind;
2230       V4 : Node_Kind) return Boolean
2231    is
2232    begin
2233       return Nkind_In (Nkind (N), V1, V2, V3, V4);
2234    end Nkind_In;
2235
2236    function Nkind_In
2237      (N  : Node_Id;
2238       V1 : Node_Kind;
2239       V2 : Node_Kind;
2240       V3 : Node_Kind;
2241       V4 : Node_Kind;
2242       V5 : Node_Kind) return Boolean
2243    is
2244    begin
2245       return Nkind_In (Nkind (N), V1, V2, V3, V4, V5);
2246    end Nkind_In;
2247
2248    function Nkind_In
2249      (N  : Node_Id;
2250       V1 : Node_Kind;
2251       V2 : Node_Kind;
2252       V3 : Node_Kind;
2253       V4 : Node_Kind;
2254       V5 : Node_Kind;
2255       V6 : Node_Kind) return Boolean
2256    is
2257    begin
2258       return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6);
2259    end Nkind_In;
2260
2261    function Nkind_In
2262      (N  : Node_Id;
2263       V1 : Node_Kind;
2264       V2 : Node_Kind;
2265       V3 : Node_Kind;
2266       V4 : Node_Kind;
2267       V5 : Node_Kind;
2268       V6 : Node_Kind;
2269       V7 : Node_Kind) return Boolean
2270    is
2271    begin
2272       return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7);
2273    end Nkind_In;
2274
2275    function Nkind_In
2276      (N  : Node_Id;
2277       V1 : Node_Kind;
2278       V2 : Node_Kind;
2279       V3 : Node_Kind;
2280       V4 : Node_Kind;
2281       V5 : Node_Kind;
2282       V6 : Node_Kind;
2283       V7 : Node_Kind;
2284       V8 : Node_Kind) return Boolean
2285    is
2286    begin
2287       return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8);
2288    end Nkind_In;
2289
2290    --------
2291    -- No --
2292    --------
2293
2294    function No (N : Node_Id) return Boolean is
2295    begin
2296       return N = Empty;
2297    end No;
2298
2299    -------------------
2300    -- Nodes_Address --
2301    -------------------
2302
2303    function Nodes_Address return System.Address is
2304    begin
2305       return Nodes.Table (First_Node_Id)'Address;
2306    end Nodes_Address;
2307
2308    ---------------
2309    -- Num_Nodes --
2310    ---------------
2311
2312    function Num_Nodes return Nat is
2313    begin
2314       return Node_Count;
2315    end Num_Nodes;
2316
2317    -------------------
2318    -- Original_Node --
2319    -------------------
2320
2321    function Original_Node (Node : Node_Id) return Node_Id is
2322    begin
2323       return Orig_Nodes.Table (Node);
2324    end Original_Node;
2325
2326    -----------------
2327    -- Paren_Count --
2328    -----------------
2329
2330    function Paren_Count (N : Node_Id) return Nat is
2331       C : Nat := 0;
2332
2333    begin
2334       pragma Assert (N <= Nodes.Last);
2335
2336       if Nodes.Table (N).Pflag1 then
2337          C := C + 1;
2338       end if;
2339
2340       if Nodes.Table (N).Pflag2 then
2341          C := C + 2;
2342       end if;
2343
2344       --  Value of 0,1,2 returned as is
2345
2346       if C <= 2 then
2347          return C;
2348
2349       --  Value of 3 means we search the table, and we must find an entry
2350
2351       else
2352          for J in Paren_Counts.First .. Paren_Counts.Last loop
2353             if N = Paren_Counts.Table (J).Nod then
2354                return Paren_Counts.Table (J).Count;
2355             end if;
2356          end loop;
2357
2358          raise Program_Error;
2359       end if;
2360    end Paren_Count;
2361
2362    ------------
2363    -- Parent --
2364    ------------
2365
2366    function Parent (N : Node_Id) return Node_Id is
2367    begin
2368       if Is_List_Member (N) then
2369          return Parent (List_Containing (N));
2370       else
2371          return Node_Id (Nodes.Table (N).Link);
2372       end if;
2373    end Parent;
2374
2375    -------------
2376    -- Present --
2377    -------------
2378
2379    function Present (N : Node_Id) return Boolean is
2380    begin
2381       return N /= Empty;
2382    end Present;
2383
2384    --------------------------------
2385    -- Preserve_Comes_From_Source --
2386    --------------------------------
2387
2388    procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id) is
2389    begin
2390       Nodes.Table (NewN).Comes_From_Source :=
2391         Nodes.Table (OldN).Comes_From_Source;
2392    end Preserve_Comes_From_Source;
2393
2394    -------------------
2395    -- Relocate_Node --
2396    -------------------
2397
2398    function Relocate_Node (Source : Node_Id) return Node_Id is
2399       New_Node : Node_Id;
2400
2401    begin
2402       if No (Source) then
2403          return Empty;
2404       end if;
2405
2406       New_Node := New_Copy (Source);
2407       Fix_Parents (Source, New_Node);
2408
2409       --  We now set the parent of the new node to be the same as the
2410       --  parent of the source. Almost always this parent will be
2411       --  replaced by a new value when the relocated node is reattached
2412       --  to the tree, but by doing it now, we ensure that this node is
2413       --  not even temporarily disconnected from the tree. Note that this
2414       --  does not happen free, because in the list case, the parent does
2415       --  not get set.
2416
2417       Set_Parent (New_Node, Parent (Source));
2418
2419       --  If the node being relocated was a rewriting of some original
2420       --  node, then the relocated node has the same original node.
2421
2422       if Orig_Nodes.Table (Source) /= Source then
2423          Orig_Nodes.Table (New_Node) := Orig_Nodes.Table (Source);
2424       end if;
2425
2426       return New_Node;
2427    end Relocate_Node;
2428
2429    -------------
2430    -- Replace --
2431    -------------
2432
2433    procedure Replace (Old_Node, New_Node : Node_Id) is
2434       Old_Post : constant Boolean  := Nodes.Table (Old_Node).Error_Posted;
2435       Old_CFS  : constant Boolean  := Nodes.Table (Old_Node).Comes_From_Source;
2436
2437    begin
2438       pragma Assert
2439         (not Has_Extension (Old_Node)
2440            and not Has_Extension (New_Node)
2441            and not Nodes.Table (New_Node).In_List);
2442
2443       --  Do copy, preserving link and in list status and comes from source
2444
2445       Copy_Node (Source => New_Node, Destination => Old_Node);
2446       Nodes.Table (Old_Node).Comes_From_Source := Old_CFS;
2447       Nodes.Table (Old_Node).Error_Posted      := Old_Post;
2448
2449       --  Fix parents of substituted node, since it has changed identity
2450
2451       Fix_Parents (New_Node, Old_Node);
2452
2453       --  Since we are doing a replace, we assume that the original node
2454       --  is intended to become the new replaced node. The call would be
2455       --  to Rewrite if there were an intention to save the original node.
2456
2457       Orig_Nodes.Table (Old_Node) := Old_Node;
2458    end Replace;
2459
2460    -------------
2461    -- Rewrite --
2462    -------------
2463
2464    procedure Rewrite (Old_Node, New_Node : Node_Id) is
2465       Old_Error_P : constant Boolean  := Nodes.Table (Old_Node).Error_Posted;
2466       --  This fields is always preserved in the new node
2467
2468       Old_Paren_Count     : Nat;
2469       Old_Must_Not_Freeze : Boolean;
2470       --  These fields are preserved in the new node only if the new node
2471       --  and the old node are both subexpression nodes.
2472
2473       --  Note: it is a violation of abstraction levels for Must_Not_Freeze
2474       --  to be referenced like this. ???
2475
2476       Sav_Node : Node_Id;
2477
2478    begin
2479       pragma Assert
2480         (not Has_Extension (Old_Node)
2481            and not Has_Extension (New_Node)
2482            and not Nodes.Table (New_Node).In_List);
2483
2484       if Nkind (Old_Node) in N_Subexpr then
2485          Old_Paren_Count     := Paren_Count (Old_Node);
2486          Old_Must_Not_Freeze := Must_Not_Freeze (Old_Node);
2487       else
2488          Old_Paren_Count := 0;
2489          Old_Must_Not_Freeze := False;
2490       end if;
2491
2492       --  Allocate a new node, to be used to preserve the original contents
2493       --  of the Old_Node, for possible later retrival by Original_Node and
2494       --  make an entry in the Orig_Nodes table. This is only done if we have
2495       --  not already rewritten the node, as indicated by an Orig_Nodes entry
2496       --  that does not reference the Old_Node.
2497
2498       if Orig_Nodes.Table (Old_Node) = Old_Node then
2499          Sav_Node := New_Copy (Old_Node);
2500          Orig_Nodes.Table (Sav_Node) := Sav_Node;
2501          Orig_Nodes.Table (Old_Node) := Sav_Node;
2502       end if;
2503
2504       --  Copy substitute node into place, preserving old fields as required
2505
2506       Copy_Node (Source => New_Node, Destination => Old_Node);
2507       Nodes.Table (Old_Node).Error_Posted := Old_Error_P;
2508
2509       if Nkind (New_Node) in N_Subexpr then
2510          Set_Paren_Count     (Old_Node, Old_Paren_Count);
2511          Set_Must_Not_Freeze (Old_Node, Old_Must_Not_Freeze);
2512       end if;
2513
2514       Fix_Parents (New_Node, Old_Node);
2515    end Rewrite;
2516
2517    ------------------
2518    -- Set_Analyzed --
2519    ------------------
2520
2521    procedure Set_Analyzed (N : Node_Id; Val : Boolean := True) is
2522    begin
2523       Nodes.Table (N).Analyzed := Val;
2524    end Set_Analyzed;
2525
2526    ---------------------------
2527    -- Set_Comes_From_Source --
2528    ---------------------------
2529
2530    procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean) is
2531    begin
2532       pragma Assert (N <= Nodes.Last);
2533       Nodes.Table (N).Comes_From_Source := Val;
2534    end Set_Comes_From_Source;
2535
2536    -----------------------------------
2537    -- Set_Comes_From_Source_Default --
2538    -----------------------------------
2539
2540    procedure Set_Comes_From_Source_Default (Default : Boolean) is
2541    begin
2542       Default_Node.Comes_From_Source := Default;
2543    end Set_Comes_From_Source_Default;
2544
2545    ---------------
2546    -- Set_Ekind --
2547    ---------------
2548
2549    procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is
2550    begin
2551       pragma Assert (Nkind (E) in N_Entity);
2552       Nodes.Table (E + 1).Nkind := E_To_N (Val);
2553    end Set_Ekind;
2554
2555    ----------------------
2556    -- Set_Error_Posted --
2557    ----------------------
2558
2559    procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is
2560    begin
2561       Nodes.Table (N).Error_Posted := Val;
2562    end Set_Error_Posted;
2563
2564    ---------------------
2565    -- Set_Paren_Count --
2566    ---------------------
2567
2568    procedure Set_Paren_Count (N : Node_Id; Val : Nat) is
2569    begin
2570       pragma Assert (Nkind (N) in N_Subexpr);
2571
2572       --  Value of 0,1,2 stored as is
2573
2574       if Val <= 2 then
2575          Nodes.Table (N).Pflag1 := (Val mod 2 /= 0);
2576          Nodes.Table (N).Pflag2 := (Val = 2);
2577
2578       --  Value of 3 or greater stores 3 in node and makes table entry
2579
2580       else
2581          Nodes.Table (N).Pflag1 := True;
2582          Nodes.Table (N).Pflag2 := True;
2583
2584          for J in Paren_Counts.First .. Paren_Counts.Last loop
2585             if N = Paren_Counts.Table (J).Nod then
2586                Paren_Counts.Table (J).Count := Val;
2587                return;
2588             end if;
2589          end loop;
2590
2591          Paren_Counts.Append ((Nod => N, Count => Val));
2592       end if;
2593    end Set_Paren_Count;
2594
2595    ----------------
2596    -- Set_Parent --
2597    ----------------
2598
2599    procedure Set_Parent (N : Node_Id; Val : Node_Id) is
2600    begin
2601       pragma Assert (not Nodes.Table (N).In_List);
2602       Nodes.Table (N).Link := Union_Id (Val);
2603    end Set_Parent;
2604
2605    --------------
2606    -- Set_Sloc --
2607    --------------
2608
2609    procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is
2610    begin
2611       Nodes.Table (N).Sloc := Val;
2612    end Set_Sloc;
2613
2614    ----------
2615    -- Sloc --
2616    ----------
2617
2618    function Sloc (N : Node_Id) return Source_Ptr is
2619    begin
2620       return Nodes.Table (N).Sloc;
2621    end Sloc;
2622
2623    -------------------
2624    -- Traverse_Func --
2625    -------------------
2626
2627    function Traverse_Func (Node : Node_Id) return Traverse_Final_Result is
2628
2629       function Traverse_Field
2630         (Nod : Node_Id;
2631          Fld : Union_Id;
2632          FN  : Field_Num) return Traverse_Final_Result;
2633       --  Fld is one of the fields of Nod. If the field points to syntactic
2634       --  node or list, then this node or list is traversed, and the result is
2635       --  the result of this traversal. Otherwise a value of True is returned
2636       --  with no processing. FN is the number of the field (1 .. 5).
2637
2638       --------------------
2639       -- Traverse_Field --
2640       --------------------
2641
2642       function Traverse_Field
2643         (Nod : Node_Id;
2644          Fld : Union_Id;
2645          FN  : Field_Num) return Traverse_Final_Result
2646       is
2647       begin
2648          if Fld = Union_Id (Empty) then
2649             return OK;
2650
2651          --  Descendent is a node
2652
2653          elsif Fld in Node_Range then
2654
2655             --  Traverse descendent that is syntactic subtree node
2656
2657             if Is_Syntactic_Field (Nkind (Nod), FN) then
2658                return Traverse_Func (Node_Id (Fld));
2659
2660             --  Node that is not a syntactic subtree
2661
2662             else
2663                return OK;
2664             end if;
2665
2666          --  Descendent is a list
2667
2668          elsif Fld in List_Range then
2669
2670             --  Traverse descendent that is a syntactic subtree list
2671
2672             if Is_Syntactic_Field (Nkind (Nod), FN) then
2673                declare
2674                   Elmt : Node_Id := First (List_Id (Fld));
2675                begin
2676                   while Present (Elmt) loop
2677                      if Traverse_Func (Elmt) = Abandon then
2678                         return Abandon;
2679                      else
2680                         Next (Elmt);
2681                      end if;
2682                   end loop;
2683
2684                   return OK;
2685                end;
2686
2687             --  List that is not a syntactic subtree
2688
2689             else
2690                return OK;
2691             end if;
2692
2693          --  Field was not a node or a list
2694
2695          else
2696             return OK;
2697          end if;
2698       end Traverse_Field;
2699
2700       Cur_Node : Node_Id := Node;
2701
2702    --  Start of processing for Traverse_Func
2703
2704    begin
2705       --  We walk Field2 last, and if it is a node, we eliminate the tail
2706       --  recursion by jumping back to this label. This is because Field2 is
2707       --  where the Left_Opnd field of N_Op_Concat is stored, and in practice
2708       --  concatenations are sometimes deeply nested, as in X1&X2&...&XN. This
2709       --  trick prevents us from running out of memory in that case. We don't
2710       --  bother eliminating the tail recursion if Field2 is a list.
2711
2712       <<Tail_Recurse>>
2713
2714       case Process (Cur_Node) is
2715          when Abandon =>
2716             return Abandon;
2717
2718          when Skip =>
2719             return OK;
2720
2721          when OK =>
2722             null;
2723
2724          when OK_Orig =>
2725             Cur_Node := Original_Node (Cur_Node);
2726       end case;
2727
2728       if Traverse_Field (Cur_Node, Field1 (Cur_Node), 1) = Abandon
2729            or else  --  skip Field2 here
2730          Traverse_Field (Cur_Node, Field3 (Cur_Node), 3) = Abandon
2731            or else
2732          Traverse_Field (Cur_Node, Field4 (Cur_Node), 4) = Abandon
2733            or else
2734          Traverse_Field (Cur_Node, Field5 (Cur_Node), 5) = Abandon
2735       then
2736          return Abandon;
2737       end if;
2738
2739       if Field2 (Cur_Node) not in Node_Range then
2740          return Traverse_Field (Cur_Node, Field2 (Cur_Node), 2);
2741       elsif Is_Syntactic_Field (Nkind (Cur_Node), 2) and then
2742         Field2 (Cur_Node) /= Empty_List_Or_Node
2743       then
2744          --  Here is the tail recursion step, we reset Cur_Node and jump
2745          --  back to the start of the procedure, which has the same
2746          --  semantic effect as a call.
2747
2748          Cur_Node := Node_Id (Field2 (Cur_Node));
2749          goto Tail_Recurse;
2750       end if;
2751
2752       return OK;
2753    end Traverse_Func;
2754
2755    -------------------
2756    -- Traverse_Proc --
2757    -------------------
2758
2759    procedure Traverse_Proc (Node : Node_Id) is
2760       function Traverse is new Traverse_Func (Process);
2761       Discard : Traverse_Final_Result;
2762       pragma Warnings (Off, Discard);
2763    begin
2764       Discard := Traverse (Node);
2765    end Traverse_Proc;
2766
2767    ---------------
2768    -- Tree_Read --
2769    ---------------
2770
2771    procedure Tree_Read is
2772    begin
2773       Tree_Read_Int (Node_Count);
2774       Nodes.Tree_Read;
2775       Orig_Nodes.Tree_Read;
2776       Paren_Counts.Tree_Read;
2777    end Tree_Read;
2778
2779    ----------------
2780    -- Tree_Write --
2781    ----------------
2782
2783    procedure Tree_Write is
2784    begin
2785       Tree_Write_Int (Node_Count);
2786       Nodes.Tree_Write;
2787       Orig_Nodes.Tree_Write;
2788       Paren_Counts.Tree_Write;
2789    end Tree_Write;
2790
2791    ------------------------------
2792    -- Unchecked Access Package --
2793    ------------------------------
2794
2795    package body Unchecked_Access is
2796
2797       function Field1 (N : Node_Id) return Union_Id is
2798       begin
2799          pragma Assert (N <= Nodes.Last);
2800          return Nodes.Table (N).Field1;
2801       end Field1;
2802
2803       function Field2 (N : Node_Id) return Union_Id is
2804       begin
2805          pragma Assert (N <= Nodes.Last);
2806          return Nodes.Table (N).Field2;
2807       end Field2;
2808
2809       function Field3 (N : Node_Id) return Union_Id is
2810       begin
2811          pragma Assert (N <= Nodes.Last);
2812          return Nodes.Table (N).Field3;
2813       end Field3;
2814
2815       function Field4 (N : Node_Id) return Union_Id is
2816       begin
2817          pragma Assert (N <= Nodes.Last);
2818          return Nodes.Table (N).Field4;
2819       end Field4;
2820
2821       function Field5 (N : Node_Id) return Union_Id is
2822       begin
2823          pragma Assert (N <= Nodes.Last);
2824          return Nodes.Table (N).Field5;
2825       end Field5;
2826
2827       function Field6 (N : Node_Id) return Union_Id is
2828       begin
2829          pragma Assert (Nkind (N) in N_Entity);
2830          return Nodes.Table (N + 1).Field6;
2831       end Field6;
2832
2833       function Field7 (N : Node_Id) return Union_Id is
2834       begin
2835          pragma Assert (Nkind (N) in N_Entity);
2836          return Nodes.Table (N + 1).Field7;
2837       end Field7;
2838
2839       function Field8 (N : Node_Id) return Union_Id is
2840       begin
2841          pragma Assert (Nkind (N) in N_Entity);
2842          return Nodes.Table (N + 1).Field8;
2843       end Field8;
2844
2845       function Field9 (N : Node_Id) return Union_Id is
2846       begin
2847          pragma Assert (Nkind (N) in N_Entity);
2848          return Nodes.Table (N + 1).Field9;
2849       end Field9;
2850
2851       function Field10 (N : Node_Id) return Union_Id is
2852       begin
2853          pragma Assert (Nkind (N) in N_Entity);
2854          return Nodes.Table (N + 1).Field10;
2855       end Field10;
2856
2857       function Field11 (N : Node_Id) return Union_Id is
2858       begin
2859          pragma Assert (Nkind (N) in N_Entity);
2860          return Nodes.Table (N + 1).Field11;
2861       end Field11;
2862
2863       function Field12 (N : Node_Id) return Union_Id is
2864       begin
2865          pragma Assert (Nkind (N) in N_Entity);
2866          return Nodes.Table (N + 1).Field12;
2867       end Field12;
2868
2869       function Field13 (N : Node_Id) return Union_Id is
2870       begin
2871          pragma Assert (Nkind (N) in N_Entity);
2872          return Nodes.Table (N + 2).Field6;
2873       end Field13;
2874
2875       function Field14 (N : Node_Id) return Union_Id is
2876       begin
2877          pragma Assert (Nkind (N) in N_Entity);
2878          return Nodes.Table (N + 2).Field7;
2879       end Field14;
2880
2881       function Field15 (N : Node_Id) return Union_Id is
2882       begin
2883          pragma Assert (Nkind (N) in N_Entity);
2884          return Nodes.Table (N + 2).Field8;
2885       end Field15;
2886
2887       function Field16 (N : Node_Id) return Union_Id is
2888       begin
2889          pragma Assert (Nkind (N) in N_Entity);
2890          return Nodes.Table (N + 2).Field9;
2891       end Field16;
2892
2893       function Field17 (N : Node_Id) return Union_Id is
2894       begin
2895          pragma Assert (Nkind (N) in N_Entity);
2896          return Nodes.Table (N + 2).Field10;
2897       end Field17;
2898
2899       function Field18 (N : Node_Id) return Union_Id is
2900       begin
2901          pragma Assert (Nkind (N) in N_Entity);
2902          return Nodes.Table (N + 2).Field11;
2903       end Field18;
2904
2905       function Field19 (N : Node_Id) return Union_Id is
2906       begin
2907          pragma Assert (Nkind (N) in N_Entity);
2908          return Nodes.Table (N + 3).Field6;
2909       end Field19;
2910
2911       function Field20 (N : Node_Id) return Union_Id is
2912       begin
2913          pragma Assert (Nkind (N) in N_Entity);
2914          return Nodes.Table (N + 3).Field7;
2915       end Field20;
2916
2917       function Field21 (N : Node_Id) return Union_Id is
2918       begin
2919          pragma Assert (Nkind (N) in N_Entity);
2920          return Nodes.Table (N + 3).Field8;
2921       end Field21;
2922
2923       function Field22 (N : Node_Id) return Union_Id is
2924       begin
2925          pragma Assert (Nkind (N) in N_Entity);
2926          return Nodes.Table (N + 3).Field9;
2927       end Field22;
2928
2929       function Field23 (N : Node_Id) return Union_Id is
2930       begin
2931          pragma Assert (Nkind (N) in N_Entity);
2932          return Nodes.Table (N + 3).Field10;
2933       end Field23;
2934
2935       function Field24 (N : Node_Id) return Union_Id is
2936       begin
2937          pragma Assert (Nkind (N) in N_Entity);
2938          return Nodes.Table (N + 4).Field6;
2939       end Field24;
2940
2941       function Field25 (N : Node_Id) return Union_Id is
2942       begin
2943          pragma Assert (Nkind (N) in N_Entity);
2944          return Nodes.Table (N + 4).Field7;
2945       end Field25;
2946
2947       function Field26 (N : Node_Id) return Union_Id is
2948       begin
2949          pragma Assert (Nkind (N) in N_Entity);
2950          return Nodes.Table (N + 4).Field8;
2951       end Field26;
2952
2953       function Field27 (N : Node_Id) return Union_Id is
2954       begin
2955          pragma Assert (Nkind (N) in N_Entity);
2956          return Nodes.Table (N + 4).Field9;
2957       end Field27;
2958
2959       function Field28 (N : Node_Id) return Union_Id is
2960       begin
2961          pragma Assert (Nkind (N) in N_Entity);
2962          return Nodes.Table (N + 4).Field10;
2963       end Field28;
2964
2965       function Node1 (N : Node_Id) return Node_Id is
2966       begin
2967          pragma Assert (N <= Nodes.Last);
2968          return Node_Id (Nodes.Table (N).Field1);
2969       end Node1;
2970
2971       function Node2 (N : Node_Id) return Node_Id is
2972       begin
2973          pragma Assert (N <= Nodes.Last);
2974          return Node_Id (Nodes.Table (N).Field2);
2975       end Node2;
2976
2977       function Node3 (N : Node_Id) return Node_Id is
2978       begin
2979          pragma Assert (N <= Nodes.Last);
2980          return Node_Id (Nodes.Table (N).Field3);
2981       end Node3;
2982
2983       function Node4 (N : Node_Id) return Node_Id is
2984       begin
2985          pragma Assert (N <= Nodes.Last);
2986          return Node_Id (Nodes.Table (N).Field4);
2987       end Node4;
2988
2989       function Node5 (N : Node_Id) return Node_Id is
2990       begin
2991          pragma Assert (N <= Nodes.Last);
2992          return Node_Id (Nodes.Table (N).Field5);
2993       end Node5;
2994
2995       function Node6 (N : Node_Id) return Node_Id is
2996       begin
2997          pragma Assert (Nkind (N) in N_Entity);
2998          return Node_Id (Nodes.Table (N + 1).Field6);
2999       end Node6;
3000
3001       function Node7 (N : Node_Id) return Node_Id is
3002       begin
3003          pragma Assert (Nkind (N) in N_Entity);
3004          return Node_Id (Nodes.Table (N + 1).Field7);
3005       end Node7;
3006
3007       function Node8 (N : Node_Id) return Node_Id is
3008       begin
3009          pragma Assert (Nkind (N) in N_Entity);
3010          return Node_Id (Nodes.Table (N + 1).Field8);
3011       end Node8;
3012
3013       function Node9 (N : Node_Id) return Node_Id is
3014       begin
3015          pragma Assert (Nkind (N) in N_Entity);
3016          return Node_Id (Nodes.Table (N + 1).Field9);
3017       end Node9;
3018
3019       function Node10 (N : Node_Id) return Node_Id is
3020       begin
3021          pragma Assert (Nkind (N) in N_Entity);
3022          return Node_Id (Nodes.Table (N + 1).Field10);
3023       end Node10;
3024
3025       function Node11 (N : Node_Id) return Node_Id is
3026       begin
3027          pragma Assert (Nkind (N) in N_Entity);
3028          return Node_Id (Nodes.Table (N + 1).Field11);
3029       end Node11;
3030
3031       function Node12 (N : Node_Id) return Node_Id is
3032       begin
3033          pragma Assert (Nkind (N) in N_Entity);
3034          return Node_Id (Nodes.Table (N + 1).Field12);
3035       end Node12;
3036
3037       function Node13 (N : Node_Id) return Node_Id is
3038       begin
3039          pragma Assert (Nkind (N) in N_Entity);
3040          return Node_Id (Nodes.Table (N + 2).Field6);
3041       end Node13;
3042
3043       function Node14 (N : Node_Id) return Node_Id is
3044       begin
3045          pragma Assert (Nkind (N) in N_Entity);
3046          return Node_Id (Nodes.Table (N + 2).Field7);
3047       end Node14;
3048
3049       function Node15 (N : Node_Id) return Node_Id is
3050       begin
3051          pragma Assert (Nkind (N) in N_Entity);
3052          return Node_Id (Nodes.Table (N + 2).Field8);
3053       end Node15;
3054
3055       function Node16 (N : Node_Id) return Node_Id is
3056       begin
3057          pragma Assert (Nkind (N) in N_Entity);
3058          return Node_Id (Nodes.Table (N + 2).Field9);
3059       end Node16;
3060
3061       function Node17 (N : Node_Id) return Node_Id is
3062       begin
3063          pragma Assert (Nkind (N) in N_Entity);
3064          return Node_Id (Nodes.Table (N + 2).Field10);
3065       end Node17;
3066
3067       function Node18 (N : Node_Id) return Node_Id is
3068       begin
3069          pragma Assert (Nkind (N) in N_Entity);
3070          return Node_Id (Nodes.Table (N + 2).Field11);
3071       end Node18;
3072
3073       function Node19 (N : Node_Id) return Node_Id is
3074       begin
3075          pragma Assert (Nkind (N) in N_Entity);
3076          return Node_Id (Nodes.Table (N + 3).Field6);
3077       end Node19;
3078
3079       function Node20 (N : Node_Id) return Node_Id is
3080       begin
3081          pragma Assert (Nkind (N) in N_Entity);
3082          return Node_Id (Nodes.Table (N + 3).Field7);
3083       end Node20;
3084
3085       function Node21 (N : Node_Id) return Node_Id is
3086       begin
3087          pragma Assert (Nkind (N) in N_Entity);
3088          return Node_Id (Nodes.Table (N + 3).Field8);
3089       end Node21;
3090
3091       function Node22 (N : Node_Id) return Node_Id is
3092       begin
3093          pragma Assert (Nkind (N) in N_Entity);
3094          return Node_Id (Nodes.Table (N + 3).Field9);
3095       end Node22;
3096
3097       function Node23 (N : Node_Id) return Node_Id is
3098       begin
3099          pragma Assert (Nkind (N) in N_Entity);
3100          return Node_Id (Nodes.Table (N + 3).Field10);
3101       end Node23;
3102
3103       function Node24 (N : Node_Id) return Node_Id is
3104       begin
3105          pragma Assert (Nkind (N) in N_Entity);
3106          return Node_Id (Nodes.Table (N + 4).Field6);
3107       end Node24;
3108
3109       function Node25 (N : Node_Id) return Node_Id is
3110       begin
3111          pragma Assert (Nkind (N) in N_Entity);
3112          return Node_Id (Nodes.Table (N + 4).Field7);
3113       end Node25;
3114
3115       function Node26 (N : Node_Id) return Node_Id is
3116       begin
3117          pragma Assert (Nkind (N) in N_Entity);
3118          return Node_Id (Nodes.Table (N + 4).Field8);
3119       end Node26;
3120
3121       function Node27 (N : Node_Id) return Node_Id is
3122       begin
3123          pragma Assert (Nkind (N) in N_Entity);
3124          return Node_Id (Nodes.Table (N + 4).Field9);
3125       end Node27;
3126
3127       function Node28 (N : Node_Id) return Node_Id is
3128       begin
3129          pragma Assert (Nkind (N) in N_Entity);
3130          return Node_Id (Nodes.Table (N + 4).Field10);
3131       end Node28;
3132
3133       function List1 (N : Node_Id) return List_Id is
3134       begin
3135          pragma Assert (N <= Nodes.Last);
3136          return List_Id (Nodes.Table (N).Field1);
3137       end List1;
3138
3139       function List2 (N : Node_Id) return List_Id is
3140       begin
3141          pragma Assert (N <= Nodes.Last);
3142          return List_Id (Nodes.Table (N).Field2);
3143       end List2;
3144
3145       function List3 (N : Node_Id) return List_Id is
3146       begin
3147          pragma Assert (N <= Nodes.Last);
3148          return List_Id (Nodes.Table (N).Field3);
3149       end List3;
3150
3151       function List4 (N : Node_Id) return List_Id is
3152       begin
3153          pragma Assert (N <= Nodes.Last);
3154          return List_Id (Nodes.Table (N).Field4);
3155       end List4;
3156
3157       function List5 (N : Node_Id) return List_Id is
3158       begin
3159          pragma Assert (N <= Nodes.Last);
3160          return List_Id (Nodes.Table (N).Field5);
3161       end List5;
3162
3163       function List10 (N : Node_Id) return List_Id is
3164       begin
3165          pragma Assert (Nkind (N) in N_Entity);
3166          return List_Id (Nodes.Table (N + 1).Field10);
3167       end List10;
3168
3169       function List14 (N : Node_Id) return List_Id is
3170       begin
3171          pragma Assert (Nkind (N) in N_Entity);
3172          return List_Id (Nodes.Table (N + 2).Field7);
3173       end List14;
3174
3175       function Elist1 (N : Node_Id) return Elist_Id is
3176          pragma Assert (N <= Nodes.Last);
3177          Value : constant Union_Id := Nodes.Table (N).Field1;
3178       begin
3179          if Value = 0 then
3180             return No_Elist;
3181          else
3182             return Elist_Id (Value);
3183          end if;
3184       end Elist1;
3185
3186       function Elist2 (N : Node_Id) return Elist_Id is
3187          pragma Assert (N <= Nodes.Last);
3188          Value : constant Union_Id := Nodes.Table (N).Field2;
3189       begin
3190          if Value = 0 then
3191             return No_Elist;
3192          else
3193             return Elist_Id (Value);
3194          end if;
3195       end Elist2;
3196
3197       function Elist3 (N : Node_Id) return Elist_Id is
3198          pragma Assert (N <= Nodes.Last);
3199          Value : constant Union_Id := Nodes.Table (N).Field3;
3200       begin
3201          if Value = 0 then
3202             return No_Elist;
3203          else
3204             return Elist_Id (Value);
3205          end if;
3206       end Elist3;
3207
3208       function Elist4 (N : Node_Id) return Elist_Id is
3209          pragma Assert (N <= Nodes.Last);
3210          Value : constant Union_Id := Nodes.Table (N).Field4;
3211       begin
3212          if Value = 0 then
3213             return No_Elist;
3214          else
3215             return Elist_Id (Value);
3216          end if;
3217       end Elist4;
3218
3219       function Elist8 (N : Node_Id) return Elist_Id is
3220          pragma Assert (Nkind (N) in N_Entity);
3221          Value : constant Union_Id := Nodes.Table (N + 1).Field8;
3222       begin
3223          if Value = 0 then
3224             return No_Elist;
3225          else
3226             return Elist_Id (Value);
3227          end if;
3228       end Elist8;
3229
3230       function Elist13 (N : Node_Id) return Elist_Id is
3231          pragma Assert (Nkind (N) in N_Entity);
3232          Value : constant Union_Id := Nodes.Table (N + 2).Field6;
3233       begin
3234          if Value = 0 then
3235             return No_Elist;
3236          else
3237             return Elist_Id (Value);
3238          end if;
3239       end Elist13;
3240
3241       function Elist15 (N : Node_Id) return Elist_Id is
3242          pragma Assert (Nkind (N) in N_Entity);
3243          Value : constant Union_Id := Nodes.Table (N + 2).Field8;
3244       begin
3245          if Value = 0 then
3246             return No_Elist;
3247          else
3248             return Elist_Id (Value);
3249          end if;
3250       end Elist15;
3251
3252       function Elist16 (N : Node_Id) return Elist_Id is
3253          pragma Assert (Nkind (N) in N_Entity);
3254          Value : constant Union_Id := Nodes.Table (N + 2).Field9;
3255       begin
3256          if Value = 0 then
3257             return No_Elist;
3258          else
3259             return Elist_Id (Value);
3260          end if;
3261       end Elist16;
3262
3263       function Elist18 (N : Node_Id) return Elist_Id is
3264          pragma Assert (Nkind (N) in N_Entity);
3265          Value : constant Union_Id := Nodes.Table (N + 2).Field11;
3266       begin
3267          if Value = 0 then
3268             return No_Elist;
3269          else
3270             return Elist_Id (Value);
3271          end if;
3272       end Elist18;
3273
3274       function Elist21 (N : Node_Id) return Elist_Id is
3275          pragma Assert (Nkind (N) in N_Entity);
3276          Value : constant Union_Id := Nodes.Table (N + 3).Field8;
3277       begin
3278          if Value = 0 then
3279             return No_Elist;
3280          else
3281             return Elist_Id (Value);
3282          end if;
3283       end Elist21;
3284
3285       function Elist23 (N : Node_Id) return Elist_Id is
3286          pragma Assert (Nkind (N) in N_Entity);
3287          Value : constant Union_Id := Nodes.Table (N + 3).Field10;
3288       begin
3289          if Value = 0 then
3290             return No_Elist;
3291          else
3292             return Elist_Id (Value);
3293          end if;
3294       end Elist23;
3295
3296       function Elist25 (N : Node_Id) return Elist_Id is
3297          pragma Assert (Nkind (N) in N_Entity);
3298          Value : constant Union_Id := Nodes.Table (N + 4).Field7;
3299       begin
3300          if Value = 0 then
3301             return No_Elist;
3302          else
3303             return Elist_Id (Value);
3304          end if;
3305       end Elist25;
3306
3307       function Name1 (N : Node_Id) return Name_Id is
3308       begin
3309          pragma Assert (N <= Nodes.Last);
3310          return Name_Id (Nodes.Table (N).Field1);
3311       end Name1;
3312
3313       function Name2 (N : Node_Id) return Name_Id is
3314       begin
3315          pragma Assert (N <= Nodes.Last);
3316          return Name_Id (Nodes.Table (N).Field2);
3317       end Name2;
3318
3319       function Str3 (N : Node_Id) return String_Id is
3320       begin
3321          pragma Assert (N <= Nodes.Last);
3322          return String_Id (Nodes.Table (N).Field3);
3323       end Str3;
3324
3325       function Uint2 (N : Node_Id) return Uint is
3326          pragma Assert (N <= Nodes.Last);
3327          U : constant Union_Id := Nodes.Table (N).Field2;
3328       begin
3329          if U = 0 then
3330             return Uint_0;
3331          else
3332             return From_Union (U);
3333          end if;
3334       end Uint2;
3335
3336       function Uint3 (N : Node_Id) return Uint is
3337          pragma Assert (N <= Nodes.Last);
3338          U : constant Union_Id := Nodes.Table (N).Field3;
3339       begin
3340          if U = 0 then
3341             return Uint_0;
3342          else
3343             return From_Union (U);
3344          end if;
3345       end Uint3;
3346
3347       function Uint4 (N : Node_Id) return Uint is
3348          pragma Assert (N <= Nodes.Last);
3349          U : constant Union_Id := Nodes.Table (N).Field4;
3350       begin
3351          if U = 0 then
3352             return Uint_0;
3353          else
3354             return From_Union (U);
3355          end if;
3356       end Uint4;
3357
3358       function Uint5 (N : Node_Id) return Uint is
3359          pragma Assert (N <= Nodes.Last);
3360          U : constant Union_Id := Nodes.Table (N).Field5;
3361       begin
3362          if U = 0 then
3363             return Uint_0;
3364          else
3365             return From_Union (U);
3366          end if;
3367       end Uint5;
3368
3369       function Uint8 (N : Node_Id) return Uint is
3370          pragma Assert (Nkind (N) in N_Entity);
3371          U : constant Union_Id := Nodes.Table (N + 1).Field8;
3372       begin
3373          if U = 0 then
3374             return Uint_0;
3375          else
3376             return From_Union (U);
3377          end if;
3378       end Uint8;
3379
3380       function Uint9 (N : Node_Id) return Uint is
3381          pragma Assert (Nkind (N) in N_Entity);
3382          U : constant Union_Id := Nodes.Table (N + 1).Field9;
3383       begin
3384          if U = 0 then
3385             return Uint_0;
3386          else
3387             return From_Union (U);
3388          end if;
3389       end Uint9;
3390
3391       function Uint10 (N : Node_Id) return Uint is
3392          pragma Assert (Nkind (N) in N_Entity);
3393          U : constant Union_Id := Nodes.Table (N + 1).Field10;
3394       begin
3395          if U = 0 then
3396             return Uint_0;
3397          else
3398             return From_Union (U);
3399          end if;
3400       end Uint10;
3401
3402       function Uint11 (N : Node_Id) return Uint is
3403          pragma Assert (Nkind (N) in N_Entity);
3404          U : constant Union_Id := Nodes.Table (N + 1).Field11;
3405       begin
3406          if U = 0 then
3407             return Uint_0;
3408          else
3409             return From_Union (U);
3410          end if;
3411       end Uint11;
3412
3413       function Uint12 (N : Node_Id) return Uint is
3414          pragma Assert (Nkind (N) in N_Entity);
3415          U : constant Union_Id := Nodes.Table (N + 1).Field12;
3416       begin
3417          if U = 0 then
3418             return Uint_0;
3419          else
3420             return From_Union (U);
3421          end if;
3422       end Uint12;
3423
3424       function Uint13 (N : Node_Id) return Uint is
3425          pragma Assert (Nkind (N) in N_Entity);
3426          U : constant Union_Id := Nodes.Table (N + 2).Field6;
3427       begin
3428          if U = 0 then
3429             return Uint_0;
3430          else
3431             return From_Union (U);
3432          end if;
3433       end Uint13;
3434
3435       function Uint14 (N : Node_Id) return Uint is
3436          pragma Assert (Nkind (N) in N_Entity);
3437          U : constant Union_Id := Nodes.Table (N + 2).Field7;
3438       begin
3439          if U = 0 then
3440             return Uint_0;
3441          else
3442             return From_Union (U);
3443          end if;
3444       end Uint14;
3445
3446       function Uint15 (N : Node_Id) return Uint is
3447          pragma Assert (Nkind (N) in N_Entity);
3448          U : constant Union_Id := Nodes.Table (N + 2).Field8;
3449       begin
3450          if U = 0 then
3451             return Uint_0;
3452          else
3453             return From_Union (U);
3454          end if;
3455       end Uint15;
3456
3457       function Uint16 (N : Node_Id) return Uint is
3458          pragma Assert (Nkind (N) in N_Entity);
3459          U : constant Union_Id := Nodes.Table (N + 2).Field9;
3460       begin
3461          if U = 0 then
3462             return Uint_0;
3463          else
3464             return From_Union (U);
3465          end if;
3466       end Uint16;
3467
3468       function Uint17 (N : Node_Id) return Uint is
3469          pragma Assert (Nkind (N) in N_Entity);
3470          U : constant Union_Id := Nodes.Table (N + 2).Field10;
3471       begin
3472          if U = 0 then
3473             return Uint_0;
3474          else
3475             return From_Union (U);
3476          end if;
3477       end Uint17;
3478
3479       function Uint22 (N : Node_Id) return Uint is
3480          pragma Assert (Nkind (N) in N_Entity);
3481          U : constant Union_Id := Nodes.Table (N + 3).Field9;
3482       begin
3483          if U = 0 then
3484             return Uint_0;
3485          else
3486             return From_Union (U);
3487          end if;
3488       end Uint22;
3489
3490       function Ureal3 (N : Node_Id) return Ureal is
3491       begin
3492          pragma Assert (N <= Nodes.Last);
3493          return From_Union (Nodes.Table (N).Field3);
3494       end Ureal3;
3495
3496       function Ureal18 (N : Node_Id) return Ureal is
3497       begin
3498          pragma Assert (Nkind (N) in N_Entity);
3499          return From_Union (Nodes.Table (N + 2).Field11);
3500       end Ureal18;
3501
3502       function Ureal21 (N : Node_Id) return Ureal is
3503       begin
3504          pragma Assert (Nkind (N) in N_Entity);
3505          return From_Union (Nodes.Table (N + 3).Field8);
3506       end Ureal21;
3507
3508       function Flag4 (N : Node_Id) return Boolean is
3509       begin
3510          pragma Assert (N <= Nodes.Last);
3511          return Nodes.Table (N).Flag4;
3512       end Flag4;
3513
3514       function Flag5 (N : Node_Id) return Boolean is
3515       begin
3516          pragma Assert (N <= Nodes.Last);
3517          return Nodes.Table (N).Flag5;
3518       end Flag5;
3519
3520       function Flag6 (N : Node_Id) return Boolean is
3521       begin
3522          pragma Assert (N <= Nodes.Last);
3523          return Nodes.Table (N).Flag6;
3524       end Flag6;
3525
3526       function Flag7 (N : Node_Id) return Boolean is
3527       begin
3528          pragma Assert (N <= Nodes.Last);
3529          return Nodes.Table (N).Flag7;
3530       end Flag7;
3531
3532       function Flag8 (N : Node_Id) return Boolean is
3533       begin
3534          pragma Assert (N <= Nodes.Last);
3535          return Nodes.Table (N).Flag8;
3536       end Flag8;
3537
3538       function Flag9 (N : Node_Id) return Boolean is
3539       begin
3540          pragma Assert (N <= Nodes.Last);
3541          return Nodes.Table (N).Flag9;
3542       end Flag9;
3543
3544       function Flag10 (N : Node_Id) return Boolean is
3545       begin
3546          pragma Assert (N <= Nodes.Last);
3547          return Nodes.Table (N).Flag10;
3548       end Flag10;
3549
3550       function Flag11 (N : Node_Id) return Boolean is
3551       begin
3552          pragma Assert (N <= Nodes.Last);
3553          return Nodes.Table (N).Flag11;
3554       end Flag11;
3555
3556       function Flag12 (N : Node_Id) return Boolean is
3557       begin
3558          pragma Assert (N <= Nodes.Last);
3559          return Nodes.Table (N).Flag12;
3560       end Flag12;
3561
3562       function Flag13 (N : Node_Id) return Boolean is
3563       begin
3564          pragma Assert (N <= Nodes.Last);
3565          return Nodes.Table (N).Flag13;
3566       end Flag13;
3567
3568       function Flag14 (N : Node_Id) return Boolean is
3569       begin
3570          pragma Assert (N <= Nodes.Last);
3571          return Nodes.Table (N).Flag14;
3572       end Flag14;
3573
3574       function Flag15 (N : Node_Id) return Boolean is
3575       begin
3576          pragma Assert (N <= Nodes.Last);
3577          return Nodes.Table (N).Flag15;
3578       end Flag15;
3579
3580       function Flag16 (N : Node_Id) return Boolean is
3581       begin
3582          pragma Assert (N <= Nodes.Last);
3583          return Nodes.Table (N).Flag16;
3584       end Flag16;
3585
3586       function Flag17 (N : Node_Id) return Boolean is
3587       begin
3588          pragma Assert (N <= Nodes.Last);
3589          return Nodes.Table (N).Flag17;
3590       end Flag17;
3591
3592       function Flag18 (N : Node_Id) return Boolean is
3593       begin
3594          pragma Assert (N <= Nodes.Last);
3595          return Nodes.Table (N).Flag18;
3596       end Flag18;
3597
3598       function Flag19 (N : Node_Id) return Boolean is
3599       begin
3600          pragma Assert (Nkind (N) in N_Entity);
3601          return Nodes.Table (N + 1).In_List;
3602       end Flag19;
3603
3604       function Flag20 (N : Node_Id) return Boolean is
3605       begin
3606          pragma Assert (Nkind (N) in N_Entity);
3607          return Nodes.Table (N + 1).Unused_1;
3608       end Flag20;
3609
3610       function Flag21 (N : Node_Id) return Boolean is
3611       begin
3612          pragma Assert (Nkind (N) in N_Entity);
3613          return Nodes.Table (N + 1).Rewrite_Ins;
3614       end Flag21;
3615
3616       function Flag22 (N : Node_Id) return Boolean is
3617       begin
3618          pragma Assert (Nkind (N) in N_Entity);
3619          return Nodes.Table (N + 1).Analyzed;
3620       end Flag22;
3621
3622       function Flag23 (N : Node_Id) return Boolean is
3623       begin
3624          pragma Assert (Nkind (N) in N_Entity);
3625          return Nodes.Table (N + 1).Comes_From_Source;
3626       end Flag23;
3627
3628       function Flag24 (N : Node_Id) return Boolean is
3629       begin
3630          pragma Assert (Nkind (N) in N_Entity);
3631          return Nodes.Table (N + 1).Error_Posted;
3632       end Flag24;
3633
3634       function Flag25 (N : Node_Id) return Boolean is
3635       begin
3636          pragma Assert (Nkind (N) in N_Entity);
3637          return Nodes.Table (N + 1).Flag4;
3638       end Flag25;
3639
3640       function Flag26 (N : Node_Id) return Boolean is
3641       begin
3642          pragma Assert (Nkind (N) in N_Entity);
3643          return Nodes.Table (N + 1).Flag5;
3644       end Flag26;
3645
3646       function Flag27 (N : Node_Id) return Boolean is
3647       begin
3648          pragma Assert (Nkind (N) in N_Entity);
3649          return Nodes.Table (N + 1).Flag6;
3650       end Flag27;
3651
3652       function Flag28 (N : Node_Id) return Boolean is
3653       begin
3654          pragma Assert (Nkind (N) in N_Entity);
3655          return Nodes.Table (N + 1).Flag7;
3656       end Flag28;
3657
3658       function Flag29 (N : Node_Id) return Boolean is
3659       begin
3660          pragma Assert (Nkind (N) in N_Entity);
3661          return Nodes.Table (N + 1).Flag8;
3662       end Flag29;
3663
3664       function Flag30 (N : Node_Id) return Boolean is
3665       begin
3666          pragma Assert (Nkind (N) in N_Entity);
3667          return Nodes.Table (N + 1).Flag9;
3668       end Flag30;
3669
3670       function Flag31 (N : Node_Id) return Boolean is
3671       begin
3672          pragma Assert (Nkind (N) in N_Entity);
3673          return Nodes.Table (N + 1).Flag10;
3674       end Flag31;
3675
3676       function Flag32 (N : Node_Id) return Boolean is
3677       begin
3678          pragma Assert (Nkind (N) in N_Entity);
3679          return Nodes.Table (N + 1).Flag11;
3680       end Flag32;
3681
3682       function Flag33 (N : Node_Id) return Boolean is
3683       begin
3684          pragma Assert (Nkind (N) in N_Entity);
3685          return Nodes.Table (N + 1).Flag12;
3686       end Flag33;
3687
3688       function Flag34 (N : Node_Id) return Boolean is
3689       begin
3690          pragma Assert (Nkind (N) in N_Entity);
3691          return Nodes.Table (N + 1).Flag13;
3692       end Flag34;
3693
3694       function Flag35 (N : Node_Id) return Boolean is
3695       begin
3696          pragma Assert (Nkind (N) in N_Entity);
3697          return Nodes.Table (N + 1).Flag14;
3698       end Flag35;
3699
3700       function Flag36 (N : Node_Id) return Boolean is
3701       begin
3702          pragma Assert (Nkind (N) in N_Entity);
3703          return Nodes.Table (N + 1).Flag15;
3704       end Flag36;
3705
3706       function Flag37 (N : Node_Id) return Boolean is
3707       begin
3708          pragma Assert (Nkind (N) in N_Entity);
3709          return Nodes.Table (N + 1).Flag16;
3710       end Flag37;
3711
3712       function Flag38 (N : Node_Id) return Boolean is
3713       begin
3714          pragma Assert (Nkind (N) in N_Entity);
3715          return Nodes.Table (N + 1).Flag17;
3716       end Flag38;
3717
3718       function Flag39 (N : Node_Id) return Boolean is
3719       begin
3720          pragma Assert (Nkind (N) in N_Entity);
3721          return Nodes.Table (N + 1).Flag18;
3722       end Flag39;
3723
3724       function Flag40 (N : Node_Id) return Boolean is
3725       begin
3726          pragma Assert (Nkind (N) in N_Entity);
3727          return Nodes.Table (N + 2).In_List;
3728       end Flag40;
3729
3730       function Flag41 (N : Node_Id) return Boolean is
3731       begin
3732          pragma Assert (Nkind (N) in N_Entity);
3733          return Nodes.Table (N + 2).Unused_1;
3734       end Flag41;
3735
3736       function Flag42 (N : Node_Id) return Boolean is
3737       begin
3738          pragma Assert (Nkind (N) in N_Entity);
3739          return Nodes.Table (N + 2).Rewrite_Ins;
3740       end Flag42;
3741
3742       function Flag43 (N : Node_Id) return Boolean is
3743       begin
3744          pragma Assert (Nkind (N) in N_Entity);
3745          return Nodes.Table (N + 2).Analyzed;
3746       end Flag43;
3747
3748       function Flag44 (N : Node_Id) return Boolean is
3749       begin
3750          pragma Assert (Nkind (N) in N_Entity);
3751          return Nodes.Table (N + 2).Comes_From_Source;
3752       end Flag44;
3753
3754       function Flag45 (N : Node_Id) return Boolean is
3755       begin
3756          pragma Assert (Nkind (N) in N_Entity);
3757          return Nodes.Table (N + 2).Error_Posted;
3758       end Flag45;
3759
3760       function Flag46 (N : Node_Id) return Boolean is
3761       begin
3762          pragma Assert (Nkind (N) in N_Entity);
3763          return Nodes.Table (N + 2).Flag4;
3764       end Flag46;
3765
3766       function Flag47 (N : Node_Id) return Boolean is
3767       begin
3768          pragma Assert (Nkind (N) in N_Entity);
3769          return Nodes.Table (N + 2).Flag5;
3770       end Flag47;
3771
3772       function Flag48 (N : Node_Id) return Boolean is
3773       begin
3774          pragma Assert (Nkind (N) in N_Entity);
3775          return Nodes.Table (N + 2).Flag6;
3776       end Flag48;
3777
3778       function Flag49 (N : Node_Id) return Boolean is
3779       begin
3780          pragma Assert (Nkind (N) in N_Entity);
3781          return Nodes.Table (N + 2).Flag7;
3782       end Flag49;
3783
3784       function Flag50 (N : Node_Id) return Boolean is
3785       begin
3786          pragma Assert (Nkind (N) in N_Entity);
3787          return Nodes.Table (N + 2).Flag8;
3788       end Flag50;
3789
3790       function Flag51 (N : Node_Id) return Boolean is
3791       begin
3792          pragma Assert (Nkind (N) in N_Entity);
3793          return Nodes.Table (N + 2).Flag9;
3794       end Flag51;
3795
3796       function Flag52 (N : Node_Id) return Boolean is
3797       begin
3798          pragma Assert (Nkind (N) in N_Entity);
3799          return Nodes.Table (N + 2).Flag10;
3800       end Flag52;
3801
3802       function Flag53 (N : Node_Id) return Boolean is
3803       begin
3804          pragma Assert (Nkind (N) in N_Entity);
3805          return Nodes.Table (N + 2).Flag11;
3806       end Flag53;
3807
3808       function Flag54 (N : Node_Id) return Boolean is
3809       begin
3810          pragma Assert (Nkind (N) in N_Entity);
3811          return Nodes.Table (N + 2).Flag12;
3812       end Flag54;
3813
3814       function Flag55 (N : Node_Id) return Boolean is
3815       begin
3816          pragma Assert (Nkind (N) in N_Entity);
3817          return Nodes.Table (N + 2).Flag13;
3818       end Flag55;
3819
3820       function Flag56 (N : Node_Id) return Boolean is
3821       begin
3822          pragma Assert (Nkind (N) in N_Entity);
3823          return Nodes.Table (N + 2).Flag14;
3824       end Flag56;
3825
3826       function Flag57 (N : Node_Id) return Boolean is
3827       begin
3828          pragma Assert (Nkind (N) in N_Entity);
3829          return Nodes.Table (N + 2).Flag15;
3830       end Flag57;
3831
3832       function Flag58 (N : Node_Id) return Boolean is
3833       begin
3834          pragma Assert (Nkind (N) in N_Entity);
3835          return Nodes.Table (N + 2).Flag16;
3836       end Flag58;
3837
3838       function Flag59 (N : Node_Id) return Boolean is
3839       begin
3840          pragma Assert (Nkind (N) in N_Entity);
3841          return Nodes.Table (N + 2).Flag17;
3842       end Flag59;
3843
3844       function Flag60 (N : Node_Id) return Boolean is
3845       begin
3846          pragma Assert (Nkind (N) in N_Entity);
3847          return Nodes.Table (N + 2).Flag18;
3848       end Flag60;
3849
3850       function Flag61 (N : Node_Id) return Boolean is
3851       begin
3852          pragma Assert (Nkind (N) in N_Entity);
3853          return Nodes.Table (N + 1).Pflag1;
3854       end Flag61;
3855
3856       function Flag62 (N : Node_Id) return Boolean is
3857       begin
3858          pragma Assert (Nkind (N) in N_Entity);
3859          return Nodes.Table (N + 1).Pflag2;
3860       end Flag62;
3861
3862       function Flag63 (N : Node_Id) return Boolean is
3863       begin
3864          pragma Assert (Nkind (N) in N_Entity);
3865          return Nodes.Table (N + 2).Pflag1;
3866       end Flag63;
3867
3868       function Flag64 (N : Node_Id) return Boolean is
3869       begin
3870          pragma Assert (Nkind (N) in N_Entity);
3871          return Nodes.Table (N + 2).Pflag2;
3872       end Flag64;
3873
3874       function Flag65 (N : Node_Id) return Boolean is
3875       begin
3876          pragma Assert (Nkind (N) in N_Entity);
3877          return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
3878       end Flag65;
3879
3880       function Flag66 (N : Node_Id) return Boolean is
3881       begin
3882          pragma Assert (Nkind (N) in N_Entity);
3883          return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
3884       end Flag66;
3885
3886       function Flag67 (N : Node_Id) return Boolean is
3887       begin
3888          pragma Assert (Nkind (N) in N_Entity);
3889          return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
3890       end Flag67;
3891
3892       function Flag68 (N : Node_Id) return Boolean is
3893       begin
3894          pragma Assert (Nkind (N) in N_Entity);
3895          return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
3896       end Flag68;
3897
3898       function Flag69 (N : Node_Id) return Boolean is
3899       begin
3900          pragma Assert (Nkind (N) in N_Entity);
3901          return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
3902       end Flag69;
3903
3904       function Flag70 (N : Node_Id) return Boolean is
3905       begin
3906          pragma Assert (Nkind (N) in N_Entity);
3907          return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
3908       end Flag70;
3909
3910       function Flag71 (N : Node_Id) return Boolean is
3911       begin
3912          pragma Assert (Nkind (N) in N_Entity);
3913          return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
3914       end Flag71;
3915
3916       function Flag72 (N : Node_Id) return Boolean is
3917       begin
3918          pragma Assert (Nkind (N) in N_Entity);
3919          return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
3920       end Flag72;
3921
3922       function Flag73 (N : Node_Id) return Boolean is
3923       begin
3924          pragma Assert (Nkind (N) in N_Entity);
3925          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
3926       end Flag73;
3927
3928       function Flag74 (N : Node_Id) return Boolean is
3929       begin
3930          pragma Assert (Nkind (N) in N_Entity);
3931          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
3932       end Flag74;
3933
3934       function Flag75 (N : Node_Id) return Boolean is
3935       begin
3936          pragma Assert (Nkind (N) in N_Entity);
3937          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
3938       end Flag75;
3939
3940       function Flag76 (N : Node_Id) return Boolean is
3941       begin
3942          pragma Assert (Nkind (N) in N_Entity);
3943          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
3944       end Flag76;
3945
3946       function Flag77 (N : Node_Id) return Boolean is
3947       begin
3948          pragma Assert (Nkind (N) in N_Entity);
3949          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
3950       end Flag77;
3951
3952       function Flag78 (N : Node_Id) return Boolean is
3953       begin
3954          pragma Assert (Nkind (N) in N_Entity);
3955          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
3956       end Flag78;
3957
3958       function Flag79 (N : Node_Id) return Boolean is
3959       begin
3960          pragma Assert (Nkind (N) in N_Entity);
3961          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
3962       end Flag79;
3963
3964       function Flag80 (N : Node_Id) return Boolean is
3965       begin
3966          pragma Assert (Nkind (N) in N_Entity);
3967          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
3968       end Flag80;
3969
3970       function Flag81 (N : Node_Id) return Boolean is
3971       begin
3972          pragma Assert (Nkind (N) in N_Entity);
3973          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
3974       end Flag81;
3975
3976       function Flag82 (N : Node_Id) return Boolean is
3977       begin
3978          pragma Assert (Nkind (N) in N_Entity);
3979          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
3980       end Flag82;
3981
3982       function Flag83 (N : Node_Id) return Boolean is
3983       begin
3984          pragma Assert (Nkind (N) in N_Entity);
3985          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
3986       end Flag83;
3987
3988       function Flag84 (N : Node_Id) return Boolean is
3989       begin
3990          pragma Assert (Nkind (N) in N_Entity);
3991          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
3992       end Flag84;
3993
3994       function Flag85 (N : Node_Id) return Boolean is
3995       begin
3996          pragma Assert (Nkind (N) in N_Entity);
3997          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
3998       end Flag85;
3999
4000       function Flag86 (N : Node_Id) return Boolean is
4001       begin
4002          pragma Assert (Nkind (N) in N_Entity);
4003          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
4004       end Flag86;
4005
4006       function Flag87 (N : Node_Id) return Boolean is
4007       begin
4008          pragma Assert (Nkind (N) in N_Entity);
4009          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
4010       end Flag87;
4011
4012       function Flag88 (N : Node_Id) return Boolean is
4013       begin
4014          pragma Assert (Nkind (N) in N_Entity);
4015          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
4016       end Flag88;
4017
4018       function Flag89 (N : Node_Id) return Boolean is
4019       begin
4020          pragma Assert (Nkind (N) in N_Entity);
4021          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
4022       end Flag89;
4023
4024       function Flag90 (N : Node_Id) return Boolean is
4025       begin
4026          pragma Assert (Nkind (N) in N_Entity);
4027          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
4028       end Flag90;
4029
4030       function Flag91 (N : Node_Id) return Boolean is
4031       begin
4032          pragma Assert (Nkind (N) in N_Entity);
4033          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
4034       end Flag91;
4035
4036       function Flag92 (N : Node_Id) return Boolean is
4037       begin
4038          pragma Assert (Nkind (N) in N_Entity);
4039          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
4040       end Flag92;
4041
4042       function Flag93 (N : Node_Id) return Boolean is
4043       begin
4044          pragma Assert (Nkind (N) in N_Entity);
4045          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
4046       end Flag93;
4047
4048       function Flag94 (N : Node_Id) return Boolean is
4049       begin
4050          pragma Assert (Nkind (N) in N_Entity);
4051          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
4052       end Flag94;
4053
4054       function Flag95 (N : Node_Id) return Boolean is
4055       begin
4056          pragma Assert (Nkind (N) in N_Entity);
4057          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
4058       end Flag95;
4059
4060       function Flag96 (N : Node_Id) return Boolean is
4061       begin
4062          pragma Assert (Nkind (N) in N_Entity);
4063          return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
4064       end Flag96;
4065
4066       function Flag97 (N : Node_Id) return Boolean is
4067       begin
4068          pragma Assert (Nkind (N) in N_Entity);
4069          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
4070       end Flag97;
4071
4072       function Flag98 (N : Node_Id) return Boolean is
4073       begin
4074          pragma Assert (Nkind (N) in N_Entity);
4075          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
4076       end Flag98;
4077
4078       function Flag99 (N : Node_Id) return Boolean is
4079       begin
4080          pragma Assert (Nkind (N) in N_Entity);
4081          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
4082       end Flag99;
4083
4084       function Flag100 (N : Node_Id) return Boolean is
4085       begin
4086          pragma Assert (Nkind (N) in N_Entity);
4087          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
4088       end Flag100;
4089
4090       function Flag101 (N : Node_Id) return Boolean is
4091       begin
4092          pragma Assert (Nkind (N) in N_Entity);
4093          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
4094       end Flag101;
4095
4096       function Flag102 (N : Node_Id) return Boolean is
4097       begin
4098          pragma Assert (Nkind (N) in N_Entity);
4099          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
4100       end Flag102;
4101
4102       function Flag103 (N : Node_Id) return Boolean is
4103       begin
4104          pragma Assert (Nkind (N) in N_Entity);
4105          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
4106       end Flag103;
4107
4108       function Flag104 (N : Node_Id) return Boolean is
4109       begin
4110          pragma Assert (Nkind (N) in N_Entity);
4111          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
4112       end Flag104;
4113
4114       function Flag105 (N : Node_Id) return Boolean is
4115       begin
4116          pragma Assert (Nkind (N) in N_Entity);
4117          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
4118       end Flag105;
4119
4120       function Flag106 (N : Node_Id) return Boolean is
4121       begin
4122          pragma Assert (Nkind (N) in N_Entity);
4123          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
4124       end Flag106;
4125
4126       function Flag107 (N : Node_Id) return Boolean is
4127       begin
4128          pragma Assert (Nkind (N) in N_Entity);
4129          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
4130       end Flag107;
4131
4132       function Flag108 (N : Node_Id) return Boolean is
4133       begin
4134          pragma Assert (Nkind (N) in N_Entity);
4135          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
4136       end Flag108;
4137
4138       function Flag109 (N : Node_Id) return Boolean is
4139       begin
4140          pragma Assert (Nkind (N) in N_Entity);
4141          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
4142       end Flag109;
4143
4144       function Flag110 (N : Node_Id) return Boolean is
4145       begin
4146          pragma Assert (Nkind (N) in N_Entity);
4147          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
4148       end Flag110;
4149
4150       function Flag111 (N : Node_Id) return Boolean is
4151       begin
4152          pragma Assert (Nkind (N) in N_Entity);
4153          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
4154       end Flag111;
4155
4156       function Flag112 (N : Node_Id) return Boolean is
4157       begin
4158          pragma Assert (Nkind (N) in N_Entity);
4159          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
4160       end Flag112;
4161
4162       function Flag113 (N : Node_Id) return Boolean is
4163       begin
4164          pragma Assert (Nkind (N) in N_Entity);
4165          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
4166       end Flag113;
4167
4168       function Flag114 (N : Node_Id) return Boolean is
4169       begin
4170          pragma Assert (Nkind (N) in N_Entity);
4171          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
4172       end Flag114;
4173
4174       function Flag115 (N : Node_Id) return Boolean is
4175       begin
4176          pragma Assert (Nkind (N) in N_Entity);
4177          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
4178       end Flag115;
4179
4180       function Flag116 (N : Node_Id) return Boolean is
4181       begin
4182          pragma Assert (Nkind (N) in N_Entity);
4183          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
4184       end Flag116;
4185
4186       function Flag117 (N : Node_Id) return Boolean is
4187       begin
4188          pragma Assert (Nkind (N) in N_Entity);
4189          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
4190       end Flag117;
4191
4192       function Flag118 (N : Node_Id) return Boolean is
4193       begin
4194          pragma Assert (Nkind (N) in N_Entity);
4195          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
4196       end Flag118;
4197
4198       function Flag119 (N : Node_Id) return Boolean is
4199       begin
4200          pragma Assert (Nkind (N) in N_Entity);
4201          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
4202       end Flag119;
4203
4204       function Flag120 (N : Node_Id) return Boolean is
4205       begin
4206          pragma Assert (Nkind (N) in N_Entity);
4207          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
4208       end Flag120;
4209
4210       function Flag121 (N : Node_Id) return Boolean is
4211       begin
4212          pragma Assert (Nkind (N) in N_Entity);
4213          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
4214       end Flag121;
4215
4216       function Flag122 (N : Node_Id) return Boolean is
4217       begin
4218          pragma Assert (Nkind (N) in N_Entity);
4219          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
4220       end Flag122;
4221
4222       function Flag123 (N : Node_Id) return Boolean is
4223       begin
4224          pragma Assert (Nkind (N) in N_Entity);
4225          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
4226       end Flag123;
4227
4228       function Flag124 (N : Node_Id) return Boolean is
4229       begin
4230          pragma Assert (Nkind (N) in N_Entity);
4231          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
4232       end Flag124;
4233
4234       function Flag125 (N : Node_Id) return Boolean is
4235       begin
4236          pragma Assert (Nkind (N) in N_Entity);
4237          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
4238       end Flag125;
4239
4240       function Flag126 (N : Node_Id) return Boolean is
4241       begin
4242          pragma Assert (Nkind (N) in N_Entity);
4243          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
4244       end Flag126;
4245
4246       function Flag127 (N : Node_Id) return Boolean is
4247       begin
4248          pragma Assert (Nkind (N) in N_Entity);
4249          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
4250       end Flag127;
4251
4252       function Flag128 (N : Node_Id) return Boolean is
4253       begin
4254          pragma Assert (Nkind (N) in N_Entity);
4255          return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
4256       end Flag128;
4257
4258       function Flag129 (N : Node_Id) return Boolean is
4259       begin
4260          pragma Assert (Nkind (N) in N_Entity);
4261          return Nodes.Table (N + 3).In_List;
4262       end Flag129;
4263
4264       function Flag130 (N : Node_Id) return Boolean is
4265       begin
4266          pragma Assert (Nkind (N) in N_Entity);
4267          return Nodes.Table (N + 3).Unused_1;
4268       end Flag130;
4269
4270       function Flag131 (N : Node_Id) return Boolean is
4271       begin
4272          pragma Assert (Nkind (N) in N_Entity);
4273          return Nodes.Table (N + 3).Rewrite_Ins;
4274       end Flag131;
4275
4276       function Flag132 (N : Node_Id) return Boolean is
4277       begin
4278          pragma Assert (Nkind (N) in N_Entity);
4279          return Nodes.Table (N + 3).Analyzed;
4280       end Flag132;
4281
4282       function Flag133 (N : Node_Id) return Boolean is
4283       begin
4284          pragma Assert (Nkind (N) in N_Entity);
4285          return Nodes.Table (N + 3).Comes_From_Source;
4286       end Flag133;
4287
4288       function Flag134 (N : Node_Id) return Boolean is
4289       begin
4290          pragma Assert (Nkind (N) in N_Entity);
4291          return Nodes.Table (N + 3).Error_Posted;
4292       end Flag134;
4293
4294       function Flag135 (N : Node_Id) return Boolean is
4295       begin
4296          pragma Assert (Nkind (N) in N_Entity);
4297          return Nodes.Table (N + 3).Flag4;
4298       end Flag135;
4299
4300       function Flag136 (N : Node_Id) return Boolean is
4301       begin
4302          pragma Assert (Nkind (N) in N_Entity);
4303          return Nodes.Table (N + 3).Flag5;
4304       end Flag136;
4305
4306       function Flag137 (N : Node_Id) return Boolean is
4307       begin
4308          pragma Assert (Nkind (N) in N_Entity);
4309          return Nodes.Table (N + 3).Flag6;
4310       end Flag137;
4311
4312       function Flag138 (N : Node_Id) return Boolean is
4313       begin
4314          pragma Assert (Nkind (N) in N_Entity);
4315          return Nodes.Table (N + 3).Flag7;
4316       end Flag138;
4317
4318       function Flag139 (N : Node_Id) return Boolean is
4319       begin
4320          pragma Assert (Nkind (N) in N_Entity);
4321          return Nodes.Table (N + 3).Flag8;
4322       end Flag139;
4323
4324       function Flag140 (N : Node_Id) return Boolean is
4325       begin
4326          pragma Assert (Nkind (N) in N_Entity);
4327          return Nodes.Table (N + 3).Flag9;
4328       end Flag140;
4329
4330       function Flag141 (N : Node_Id) return Boolean is
4331       begin
4332          pragma Assert (Nkind (N) in N_Entity);
4333          return Nodes.Table (N + 3).Flag10;
4334       end Flag141;
4335
4336       function Flag142 (N : Node_Id) return Boolean is
4337       begin
4338          pragma Assert (Nkind (N) in N_Entity);
4339          return Nodes.Table (N + 3).Flag11;
4340       end Flag142;
4341
4342       function Flag143 (N : Node_Id) return Boolean is
4343       begin
4344          pragma Assert (Nkind (N) in N_Entity);
4345          return Nodes.Table (N + 3).Flag12;
4346       end Flag143;
4347
4348       function Flag144 (N : Node_Id) return Boolean is
4349       begin
4350          pragma Assert (Nkind (N) in N_Entity);
4351          return Nodes.Table (N + 3).Flag13;
4352       end Flag144;
4353
4354       function Flag145 (N : Node_Id) return Boolean is
4355       begin
4356          pragma Assert (Nkind (N) in N_Entity);
4357          return Nodes.Table (N + 3).Flag14;
4358       end Flag145;
4359
4360       function Flag146 (N : Node_Id) return Boolean is
4361       begin
4362          pragma Assert (Nkind (N) in N_Entity);
4363          return Nodes.Table (N + 3).Flag15;
4364       end Flag146;
4365
4366       function Flag147 (N : Node_Id) return Boolean is
4367       begin
4368          pragma Assert (Nkind (N) in N_Entity);
4369          return Nodes.Table (N + 3).Flag16;
4370       end Flag147;
4371
4372       function Flag148 (N : Node_Id) return Boolean is
4373       begin
4374          pragma Assert (Nkind (N) in N_Entity);
4375          return Nodes.Table (N + 3).Flag17;
4376       end Flag148;
4377
4378       function Flag149 (N : Node_Id) return Boolean is
4379       begin
4380          pragma Assert (Nkind (N) in N_Entity);
4381          return Nodes.Table (N + 3).Flag18;
4382       end Flag149;
4383
4384       function Flag150 (N : Node_Id) return Boolean is
4385       begin
4386          pragma Assert (Nkind (N) in N_Entity);
4387          return Nodes.Table (N + 3).Pflag1;
4388       end Flag150;
4389
4390       function Flag151 (N : Node_Id) return Boolean is
4391       begin
4392          pragma Assert (Nkind (N) in N_Entity);
4393          return Nodes.Table (N + 3).Pflag2;
4394       end Flag151;
4395
4396       function Flag152 (N : Node_Id) return Boolean is
4397       begin
4398          pragma Assert (Nkind (N) in N_Entity);
4399          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
4400       end Flag152;
4401
4402       function Flag153 (N : Node_Id) return Boolean is
4403       begin
4404          pragma Assert (Nkind (N) in N_Entity);
4405          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
4406       end Flag153;
4407
4408       function Flag154 (N : Node_Id) return Boolean is
4409       begin
4410          pragma Assert (Nkind (N) in N_Entity);
4411          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
4412       end Flag154;
4413
4414       function Flag155 (N : Node_Id) return Boolean is
4415       begin
4416          pragma Assert (Nkind (N) in N_Entity);
4417          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
4418       end Flag155;
4419
4420       function Flag156 (N : Node_Id) return Boolean is
4421       begin
4422          pragma Assert (Nkind (N) in N_Entity);
4423          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
4424       end Flag156;
4425
4426       function Flag157 (N : Node_Id) return Boolean is
4427       begin
4428          pragma Assert (Nkind (N) in N_Entity);
4429          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
4430       end Flag157;
4431
4432       function Flag158 (N : Node_Id) return Boolean is
4433       begin
4434          pragma Assert (Nkind (N) in N_Entity);
4435          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
4436       end Flag158;
4437
4438       function Flag159 (N : Node_Id) return Boolean is
4439       begin
4440          pragma Assert (Nkind (N) in N_Entity);
4441          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
4442       end Flag159;
4443
4444       function Flag160 (N : Node_Id) return Boolean is
4445       begin
4446          pragma Assert (Nkind (N) in N_Entity);
4447          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
4448       end Flag160;
4449
4450       function Flag161 (N : Node_Id) return Boolean is
4451       begin
4452          pragma Assert (Nkind (N) in N_Entity);
4453          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
4454       end Flag161;
4455
4456       function Flag162 (N : Node_Id) return Boolean is
4457       begin
4458          pragma Assert (Nkind (N) in N_Entity);
4459          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
4460       end Flag162;
4461
4462       function Flag163 (N : Node_Id) return Boolean is
4463       begin
4464          pragma Assert (Nkind (N) in N_Entity);
4465          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
4466       end Flag163;
4467
4468       function Flag164 (N : Node_Id) return Boolean is
4469       begin
4470          pragma Assert (Nkind (N) in N_Entity);
4471          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
4472       end Flag164;
4473
4474       function Flag165 (N : Node_Id) return Boolean is
4475       begin
4476          pragma Assert (Nkind (N) in N_Entity);
4477          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
4478       end Flag165;
4479
4480       function Flag166 (N : Node_Id) return Boolean is
4481       begin
4482          pragma Assert (Nkind (N) in N_Entity);
4483          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
4484       end Flag166;
4485
4486       function Flag167 (N : Node_Id) return Boolean is
4487       begin
4488          pragma Assert (Nkind (N) in N_Entity);
4489          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
4490       end Flag167;
4491
4492       function Flag168 (N : Node_Id) return Boolean is
4493       begin
4494          pragma Assert (Nkind (N) in N_Entity);
4495          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
4496       end Flag168;
4497
4498       function Flag169 (N : Node_Id) return Boolean is
4499       begin
4500          pragma Assert (Nkind (N) in N_Entity);
4501          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
4502       end Flag169;
4503
4504       function Flag170 (N : Node_Id) return Boolean is
4505       begin
4506          pragma Assert (Nkind (N) in N_Entity);
4507          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
4508       end Flag170;
4509
4510       function Flag171 (N : Node_Id) return Boolean is
4511       begin
4512          pragma Assert (Nkind (N) in N_Entity);
4513          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
4514       end Flag171;
4515
4516       function Flag172 (N : Node_Id) return Boolean is
4517       begin
4518          pragma Assert (Nkind (N) in N_Entity);
4519          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
4520       end Flag172;
4521
4522       function Flag173 (N : Node_Id) return Boolean is
4523       begin
4524          pragma Assert (Nkind (N) in N_Entity);
4525          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
4526       end Flag173;
4527
4528       function Flag174 (N : Node_Id) return Boolean is
4529       begin
4530          pragma Assert (Nkind (N) in N_Entity);
4531          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
4532       end Flag174;
4533
4534       function Flag175 (N : Node_Id) return Boolean is
4535       begin
4536          pragma Assert (Nkind (N) in N_Entity);
4537          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
4538       end Flag175;
4539
4540       function Flag176 (N : Node_Id) return Boolean is
4541       begin
4542          pragma Assert (Nkind (N) in N_Entity);
4543          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
4544       end Flag176;
4545
4546       function Flag177 (N : Node_Id) return Boolean is
4547       begin
4548          pragma Assert (Nkind (N) in N_Entity);
4549          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
4550       end Flag177;
4551
4552       function Flag178 (N : Node_Id) return Boolean is
4553       begin
4554          pragma Assert (Nkind (N) in N_Entity);
4555          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
4556       end Flag178;
4557
4558       function Flag179 (N : Node_Id) return Boolean is
4559       begin
4560          pragma Assert (Nkind (N) in N_Entity);
4561          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
4562       end Flag179;
4563
4564       function Flag180 (N : Node_Id) return Boolean is
4565       begin
4566          pragma Assert (Nkind (N) in N_Entity);
4567          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
4568       end Flag180;
4569
4570       function Flag181 (N : Node_Id) return Boolean is
4571       begin
4572          pragma Assert (Nkind (N) in N_Entity);
4573          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
4574       end Flag181;
4575
4576       function Flag182 (N : Node_Id) return Boolean is
4577       begin
4578          pragma Assert (Nkind (N) in N_Entity);
4579          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
4580       end Flag182;
4581
4582       function Flag183 (N : Node_Id) return Boolean is
4583       begin
4584          pragma Assert (Nkind (N) in N_Entity);
4585          return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
4586       end Flag183;
4587
4588       function Flag184 (N : Node_Id) return Boolean is
4589       begin
4590          pragma Assert (Nkind (N) in N_Entity);
4591          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag184;
4592       end Flag184;
4593
4594       function Flag185 (N : Node_Id) return Boolean is
4595       begin
4596          pragma Assert (Nkind (N) in N_Entity);
4597          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag185;
4598       end Flag185;
4599
4600       function Flag186 (N : Node_Id) return Boolean is
4601       begin
4602          pragma Assert (Nkind (N) in N_Entity);
4603          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag186;
4604       end Flag186;
4605
4606       function Flag187 (N : Node_Id) return Boolean is
4607       begin
4608          pragma Assert (Nkind (N) in N_Entity);
4609          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag187;
4610       end Flag187;
4611
4612       function Flag188 (N : Node_Id) return Boolean is
4613       begin
4614          pragma Assert (Nkind (N) in N_Entity);
4615          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag188;
4616       end Flag188;
4617
4618       function Flag189 (N : Node_Id) return Boolean is
4619       begin
4620          pragma Assert (Nkind (N) in N_Entity);
4621          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag189;
4622       end Flag189;
4623
4624       function Flag190 (N : Node_Id) return Boolean is
4625       begin
4626          pragma Assert (Nkind (N) in N_Entity);
4627          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag190;
4628       end Flag190;
4629
4630       function Flag191 (N : Node_Id) return Boolean is
4631       begin
4632          pragma Assert (Nkind (N) in N_Entity);
4633          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag191;
4634       end Flag191;
4635
4636       function Flag192 (N : Node_Id) return Boolean is
4637       begin
4638          pragma Assert (Nkind (N) in N_Entity);
4639          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag192;
4640       end Flag192;
4641
4642       function Flag193 (N : Node_Id) return Boolean is
4643       begin
4644          pragma Assert (Nkind (N) in N_Entity);
4645          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag193;
4646       end Flag193;
4647
4648       function Flag194 (N : Node_Id) return Boolean is
4649       begin
4650          pragma Assert (Nkind (N) in N_Entity);
4651          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag194;
4652       end Flag194;
4653
4654       function Flag195 (N : Node_Id) return Boolean is
4655       begin
4656          pragma Assert (Nkind (N) in N_Entity);
4657          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag195;
4658       end Flag195;
4659
4660       function Flag196 (N : Node_Id) return Boolean is
4661       begin
4662          pragma Assert (Nkind (N) in N_Entity);
4663          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag196;
4664       end Flag196;
4665
4666       function Flag197 (N : Node_Id) return Boolean is
4667       begin
4668          pragma Assert (Nkind (N) in N_Entity);
4669          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag197;
4670       end Flag197;
4671
4672       function Flag198 (N : Node_Id) return Boolean is
4673       begin
4674          pragma Assert (Nkind (N) in N_Entity);
4675          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag198;
4676       end Flag198;
4677
4678       function Flag199 (N : Node_Id) return Boolean is
4679       begin
4680          pragma Assert (Nkind (N) in N_Entity);
4681          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag199;
4682       end Flag199;
4683
4684       function Flag200 (N : Node_Id) return Boolean is
4685       begin
4686          pragma Assert (Nkind (N) in N_Entity);
4687          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag200;
4688       end Flag200;
4689
4690       function Flag201 (N : Node_Id) return Boolean is
4691       begin
4692          pragma Assert (Nkind (N) in N_Entity);
4693          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag201;
4694       end Flag201;
4695
4696       function Flag202 (N : Node_Id) return Boolean is
4697       begin
4698          pragma Assert (Nkind (N) in N_Entity);
4699          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag202;
4700       end Flag202;
4701
4702       function Flag203 (N : Node_Id) return Boolean is
4703       begin
4704          pragma Assert (Nkind (N) in N_Entity);
4705          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag203;
4706       end Flag203;
4707
4708       function Flag204 (N : Node_Id) return Boolean is
4709       begin
4710          pragma Assert (Nkind (N) in N_Entity);
4711          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag204;
4712       end Flag204;
4713
4714       function Flag205 (N : Node_Id) return Boolean is
4715       begin
4716          pragma Assert (Nkind (N) in N_Entity);
4717          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag205;
4718       end Flag205;
4719
4720       function Flag206 (N : Node_Id) return Boolean is
4721       begin
4722          pragma Assert (Nkind (N) in N_Entity);
4723          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag206;
4724       end Flag206;
4725
4726       function Flag207 (N : Node_Id) return Boolean is
4727       begin
4728          pragma Assert (Nkind (N) in N_Entity);
4729          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag207;
4730       end Flag207;
4731
4732       function Flag208 (N : Node_Id) return Boolean is
4733       begin
4734          pragma Assert (Nkind (N) in N_Entity);
4735          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag208;
4736       end Flag208;
4737
4738       function Flag209 (N : Node_Id) return Boolean is
4739       begin
4740          pragma Assert (Nkind (N) in N_Entity);
4741          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag209;
4742       end Flag209;
4743
4744       function Flag210 (N : Node_Id) return Boolean is
4745       begin
4746          pragma Assert (Nkind (N) in N_Entity);
4747          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag210;
4748       end Flag210;
4749
4750       function Flag211 (N : Node_Id) return Boolean is
4751       begin
4752          pragma Assert (Nkind (N) in N_Entity);
4753          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag211;
4754       end Flag211;
4755
4756       function Flag212 (N : Node_Id) return Boolean is
4757       begin
4758          pragma Assert (Nkind (N) in N_Entity);
4759          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag212;
4760       end Flag212;
4761
4762       function Flag213 (N : Node_Id) return Boolean is
4763       begin
4764          pragma Assert (Nkind (N) in N_Entity);
4765          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag213;
4766       end Flag213;
4767
4768       function Flag214 (N : Node_Id) return Boolean is
4769       begin
4770          pragma Assert (Nkind (N) in N_Entity);
4771          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag214;
4772       end Flag214;
4773
4774       function Flag215 (N : Node_Id) return Boolean is
4775       begin
4776          pragma Assert (Nkind (N) in N_Entity);
4777          return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag215;
4778       end Flag215;
4779
4780       function Flag216 (N : Node_Id) return Boolean is
4781       begin
4782          pragma Assert (Nkind (N) in N_Entity);
4783          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag216;
4784       end Flag216;
4785
4786       function Flag217 (N : Node_Id) return Boolean is
4787       begin
4788          pragma Assert (Nkind (N) in N_Entity);
4789          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag217;
4790       end Flag217;
4791
4792       function Flag218 (N : Node_Id) return Boolean is
4793       begin
4794          pragma Assert (Nkind (N) in N_Entity);
4795          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag218;
4796       end Flag218;
4797
4798       function Flag219 (N : Node_Id) return Boolean is
4799       begin
4800          pragma Assert (Nkind (N) in N_Entity);
4801          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag219;
4802       end Flag219;
4803
4804       function Flag220 (N : Node_Id) return Boolean is
4805       begin
4806          pragma Assert (Nkind (N) in N_Entity);
4807          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag220;
4808       end Flag220;
4809
4810       function Flag221 (N : Node_Id) return Boolean is
4811       begin
4812          pragma Assert (Nkind (N) in N_Entity);
4813          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag221;
4814       end Flag221;
4815
4816       function Flag222 (N : Node_Id) return Boolean is
4817       begin
4818          pragma Assert (Nkind (N) in N_Entity);
4819          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag222;
4820       end Flag222;
4821
4822       function Flag223 (N : Node_Id) return Boolean is
4823       begin
4824          pragma Assert (Nkind (N) in N_Entity);
4825          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag223;
4826       end Flag223;
4827
4828       function Flag224 (N : Node_Id) return Boolean is
4829       begin
4830          pragma Assert (Nkind (N) in N_Entity);
4831          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag224;
4832       end Flag224;
4833
4834       function Flag225 (N : Node_Id) return Boolean is
4835       begin
4836          pragma Assert (Nkind (N) in N_Entity);
4837          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag225;
4838       end Flag225;
4839
4840       function Flag226 (N : Node_Id) return Boolean is
4841       begin
4842          pragma Assert (Nkind (N) in N_Entity);
4843          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag226;
4844       end Flag226;
4845
4846       function Flag227 (N : Node_Id) return Boolean is
4847       begin
4848          pragma Assert (Nkind (N) in N_Entity);
4849          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag227;
4850       end Flag227;
4851
4852       function Flag228 (N : Node_Id) return Boolean is
4853       begin
4854          pragma Assert (Nkind (N) in N_Entity);
4855          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag228;
4856       end Flag228;
4857
4858       function Flag229 (N : Node_Id) return Boolean is
4859       begin
4860          pragma Assert (Nkind (N) in N_Entity);
4861          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag229;
4862       end Flag229;
4863
4864       function Flag230 (N : Node_Id) return Boolean is
4865       begin
4866          pragma Assert (Nkind (N) in N_Entity);
4867          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag230;
4868       end Flag230;
4869
4870       function Flag231 (N : Node_Id) return Boolean is
4871       begin
4872          pragma Assert (Nkind (N) in N_Entity);
4873          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag231;
4874       end Flag231;
4875
4876       function Flag232 (N : Node_Id) return Boolean is
4877       begin
4878          pragma Assert (Nkind (N) in N_Entity);
4879          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag232;
4880       end Flag232;
4881
4882       function Flag233 (N : Node_Id) return Boolean is
4883       begin
4884          pragma Assert (Nkind (N) in N_Entity);
4885          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag233;
4886       end Flag233;
4887
4888       function Flag234 (N : Node_Id) return Boolean is
4889       begin
4890          pragma Assert (Nkind (N) in N_Entity);
4891          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag234;
4892       end Flag234;
4893
4894       function Flag235 (N : Node_Id) return Boolean is
4895       begin
4896          pragma Assert (Nkind (N) in N_Entity);
4897          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag235;
4898       end Flag235;
4899
4900       function Flag236 (N : Node_Id) return Boolean is
4901       begin
4902          pragma Assert (Nkind (N) in N_Entity);
4903          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag236;
4904       end Flag236;
4905
4906       function Flag237 (N : Node_Id) return Boolean is
4907       begin
4908          pragma Assert (Nkind (N) in N_Entity);
4909          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag237;
4910       end Flag237;
4911
4912       function Flag238 (N : Node_Id) return Boolean is
4913       begin
4914          pragma Assert (Nkind (N) in N_Entity);
4915          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag238;
4916       end Flag238;
4917
4918       function Flag239 (N : Node_Id) return Boolean is
4919       begin
4920          pragma Assert (Nkind (N) in N_Entity);
4921          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag239;
4922       end Flag239;
4923
4924       function Flag240 (N : Node_Id) return Boolean is
4925       begin
4926          pragma Assert (Nkind (N) in N_Entity);
4927          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag240;
4928       end Flag240;
4929
4930       function Flag241 (N : Node_Id) return Boolean is
4931       begin
4932          pragma Assert (Nkind (N) in N_Entity);
4933          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag241;
4934       end Flag241;
4935
4936       function Flag242 (N : Node_Id) return Boolean is
4937       begin
4938          pragma Assert (Nkind (N) in N_Entity);
4939          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag242;
4940       end Flag242;
4941
4942       function Flag243 (N : Node_Id) return Boolean is
4943       begin
4944          pragma Assert (Nkind (N) in N_Entity);
4945          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag243;
4946       end Flag243;
4947
4948       function Flag244 (N : Node_Id) return Boolean is
4949       begin
4950          pragma Assert (Nkind (N) in N_Entity);
4951          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag244;
4952       end Flag244;
4953
4954       function Flag245 (N : Node_Id) return Boolean is
4955       begin
4956          pragma Assert (Nkind (N) in N_Entity);
4957          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag245;
4958       end Flag245;
4959
4960       function Flag246 (N : Node_Id) return Boolean is
4961       begin
4962          pragma Assert (Nkind (N) in N_Entity);
4963          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag246;
4964       end Flag246;
4965
4966       function Flag247 (N : Node_Id) return Boolean is
4967       begin
4968          pragma Assert (Nkind (N) in N_Entity);
4969          return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag247;
4970       end Flag247;
4971
4972       procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
4973       begin
4974          pragma Assert (N <= Nodes.Last);
4975          Nodes.Table (N).Nkind := Val;
4976       end Set_Nkind;
4977
4978       procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
4979       begin
4980          pragma Assert (N <= Nodes.Last);
4981          Nodes.Table (N).Field1 := Val;
4982       end Set_Field1;
4983
4984       procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
4985       begin
4986          pragma Assert (N <= Nodes.Last);
4987          Nodes.Table (N).Field2 := Val;
4988       end Set_Field2;
4989
4990       procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
4991       begin
4992          pragma Assert (N <= Nodes.Last);
4993          Nodes.Table (N).Field3 := Val;
4994       end Set_Field3;
4995
4996       procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
4997       begin
4998          pragma Assert (N <= Nodes.Last);
4999          Nodes.Table (N).Field4 := Val;
5000       end Set_Field4;
5001
5002       procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
5003       begin
5004          pragma Assert (N <= Nodes.Last);
5005          Nodes.Table (N).Field5 := Val;
5006       end Set_Field5;
5007
5008       procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
5009       begin
5010          pragma Assert (Nkind (N) in N_Entity);
5011          Nodes.Table (N + 1).Field6 := Val;
5012       end Set_Field6;
5013
5014       procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
5015       begin
5016          pragma Assert (Nkind (N) in N_Entity);
5017          Nodes.Table (N + 1).Field7 := Val;
5018       end Set_Field7;
5019
5020       procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
5021       begin
5022          pragma Assert (Nkind (N) in N_Entity);
5023          Nodes.Table (N + 1).Field8 := Val;
5024       end Set_Field8;
5025
5026       procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
5027       begin
5028          pragma Assert (Nkind (N) in N_Entity);
5029          Nodes.Table (N + 1).Field9 := Val;
5030       end Set_Field9;
5031
5032       procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
5033       begin
5034          pragma Assert (Nkind (N) in N_Entity);
5035          Nodes.Table (N + 1).Field10 := Val;
5036       end Set_Field10;
5037
5038       procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
5039       begin
5040          pragma Assert (Nkind (N) in N_Entity);
5041          Nodes.Table (N + 1).Field11 := Val;
5042       end Set_Field11;
5043
5044       procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
5045       begin
5046          pragma Assert (Nkind (N) in N_Entity);
5047          Nodes.Table (N + 1).Field12 := Val;
5048       end Set_Field12;
5049
5050       procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
5051       begin
5052          pragma Assert (Nkind (N) in N_Entity);
5053          Nodes.Table (N + 2).Field6 := Val;
5054       end Set_Field13;
5055
5056       procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
5057       begin
5058          pragma Assert (Nkind (N) in N_Entity);
5059          Nodes.Table (N + 2).Field7 := Val;
5060       end Set_Field14;
5061
5062       procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
5063       begin
5064          pragma Assert (Nkind (N) in N_Entity);
5065          Nodes.Table (N + 2).Field8 := Val;
5066       end Set_Field15;
5067
5068       procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
5069       begin
5070          pragma Assert (Nkind (N) in N_Entity);
5071          Nodes.Table (N + 2).Field9 := Val;
5072       end Set_Field16;
5073
5074       procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
5075       begin
5076          pragma Assert (Nkind (N) in N_Entity);
5077          Nodes.Table (N + 2).Field10 := Val;
5078       end Set_Field17;
5079
5080       procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
5081       begin
5082          pragma Assert (Nkind (N) in N_Entity);
5083          Nodes.Table (N + 2).Field11 := Val;
5084       end Set_Field18;
5085
5086       procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
5087       begin
5088          pragma Assert (Nkind (N) in N_Entity);
5089          Nodes.Table (N + 3).Field6 := Val;
5090       end Set_Field19;
5091
5092       procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
5093       begin
5094          pragma Assert (Nkind (N) in N_Entity);
5095          Nodes.Table (N + 3).Field7 := Val;
5096       end Set_Field20;
5097
5098       procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
5099       begin
5100          pragma Assert (Nkind (N) in N_Entity);
5101          Nodes.Table (N + 3).Field8 := Val;
5102       end Set_Field21;
5103
5104       procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
5105       begin
5106          pragma Assert (Nkind (N) in N_Entity);
5107          Nodes.Table (N + 3).Field9 := Val;
5108       end Set_Field22;
5109
5110       procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
5111       begin
5112          pragma Assert (Nkind (N) in N_Entity);
5113          Nodes.Table (N + 3).Field10 := Val;
5114       end Set_Field23;
5115
5116       procedure Set_Field24 (N : Node_Id; Val : Union_Id) is
5117       begin
5118          pragma Assert (Nkind (N) in N_Entity);
5119          Nodes.Table (N + 4).Field6 := Val;
5120       end Set_Field24;
5121
5122       procedure Set_Field25 (N : Node_Id; Val : Union_Id) is
5123       begin
5124          pragma Assert (Nkind (N) in N_Entity);
5125          Nodes.Table (N + 4).Field7 := Val;
5126       end Set_Field25;
5127
5128       procedure Set_Field26 (N : Node_Id; Val : Union_Id) is
5129       begin
5130          pragma Assert (Nkind (N) in N_Entity);
5131          Nodes.Table (N + 4).Field8 := Val;
5132       end Set_Field26;
5133
5134       procedure Set_Field27 (N : Node_Id; Val : Union_Id) is
5135       begin
5136          pragma Assert (Nkind (N) in N_Entity);
5137          Nodes.Table (N + 4).Field9 := Val;
5138       end Set_Field27;
5139
5140       procedure Set_Field28 (N : Node_Id; Val : Union_Id) is
5141       begin
5142          pragma Assert (Nkind (N) in N_Entity);
5143          Nodes.Table (N + 4).Field10 := Val;
5144       end Set_Field28;
5145
5146       procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
5147       begin
5148          pragma Assert (N <= Nodes.Last);
5149          Nodes.Table (N).Field1 := Union_Id (Val);
5150       end Set_Node1;
5151
5152       procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
5153       begin
5154          pragma Assert (N <= Nodes.Last);
5155          Nodes.Table (N).Field2 := Union_Id (Val);
5156       end Set_Node2;
5157
5158       procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
5159       begin
5160          pragma Assert (N <= Nodes.Last);
5161          Nodes.Table (N).Field3 := Union_Id (Val);
5162       end Set_Node3;
5163
5164       procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
5165       begin
5166          pragma Assert (N <= Nodes.Last);
5167          Nodes.Table (N).Field4 := Union_Id (Val);
5168       end Set_Node4;
5169
5170       procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
5171       begin
5172          pragma Assert (N <= Nodes.Last);
5173          Nodes.Table (N).Field5 := Union_Id (Val);
5174       end Set_Node5;
5175
5176       procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
5177       begin
5178          pragma Assert (Nkind (N) in N_Entity);
5179          Nodes.Table (N + 1).Field6 := Union_Id (Val);
5180       end Set_Node6;
5181
5182       procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
5183       begin
5184          pragma Assert (Nkind (N) in N_Entity);
5185          Nodes.Table (N + 1).Field7 := Union_Id (Val);
5186       end Set_Node7;
5187
5188       procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
5189       begin
5190          pragma Assert (Nkind (N) in N_Entity);
5191          Nodes.Table (N + 1).Field8 := Union_Id (Val);
5192       end Set_Node8;
5193
5194       procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
5195       begin
5196          pragma Assert (Nkind (N) in N_Entity);
5197          Nodes.Table (N + 1).Field9 := Union_Id (Val);
5198       end Set_Node9;
5199
5200       procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
5201       begin
5202          pragma Assert (Nkind (N) in N_Entity);
5203          Nodes.Table (N + 1).Field10 := Union_Id (Val);
5204       end Set_Node10;
5205
5206       procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
5207       begin
5208          pragma Assert (Nkind (N) in N_Entity);
5209          Nodes.Table (N + 1).Field11 := Union_Id (Val);
5210       end Set_Node11;
5211
5212       procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
5213       begin
5214          pragma Assert (Nkind (N) in N_Entity);
5215          Nodes.Table (N + 1).Field12 := Union_Id (Val);
5216       end Set_Node12;
5217
5218       procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
5219       begin
5220          pragma Assert (Nkind (N) in N_Entity);
5221          Nodes.Table (N + 2).Field6 := Union_Id (Val);
5222       end Set_Node13;
5223
5224       procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
5225       begin
5226          pragma Assert (Nkind (N) in N_Entity);
5227          Nodes.Table (N + 2).Field7 := Union_Id (Val);
5228       end Set_Node14;
5229
5230       procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
5231       begin
5232          pragma Assert (Nkind (N) in N_Entity);
5233          Nodes.Table (N + 2).Field8 := Union_Id (Val);
5234       end Set_Node15;
5235
5236       procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
5237       begin
5238          pragma Assert (Nkind (N) in N_Entity);
5239          Nodes.Table (N + 2).Field9 := Union_Id (Val);
5240       end Set_Node16;
5241
5242       procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
5243       begin
5244          pragma Assert (Nkind (N) in N_Entity);
5245          Nodes.Table (N + 2).Field10 := Union_Id (Val);
5246       end Set_Node17;
5247
5248       procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
5249       begin
5250          pragma Assert (Nkind (N) in N_Entity);
5251          Nodes.Table (N + 2).Field11 := Union_Id (Val);
5252       end Set_Node18;
5253
5254       procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
5255       begin
5256          pragma Assert (Nkind (N) in N_Entity);
5257          Nodes.Table (N + 3).Field6 := Union_Id (Val);
5258       end Set_Node19;
5259
5260       procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
5261       begin
5262          pragma Assert (Nkind (N) in N_Entity);
5263          Nodes.Table (N + 3).Field7 := Union_Id (Val);
5264       end Set_Node20;
5265
5266       procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
5267       begin
5268          pragma Assert (Nkind (N) in N_Entity);
5269          Nodes.Table (N + 3).Field8 := Union_Id (Val);
5270       end Set_Node21;
5271
5272       procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
5273       begin
5274          pragma Assert (Nkind (N) in N_Entity);
5275          Nodes.Table (N + 3).Field9 := Union_Id (Val);
5276       end Set_Node22;
5277
5278       procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
5279       begin
5280          pragma Assert (Nkind (N) in N_Entity);
5281          Nodes.Table (N + 3).Field10 := Union_Id (Val);
5282       end Set_Node23;
5283
5284       procedure Set_Node24 (N : Node_Id; Val : Node_Id) is
5285       begin
5286          pragma Assert (Nkind (N) in N_Entity);
5287          Nodes.Table (N + 4).Field6 := Union_Id (Val);
5288       end Set_Node24;
5289
5290       procedure Set_Node25 (N : Node_Id; Val : Node_Id) is
5291       begin
5292          pragma Assert (Nkind (N) in N_Entity);
5293          Nodes.Table (N + 4).Field7 := Union_Id (Val);
5294       end Set_Node25;
5295
5296       procedure Set_Node26 (N : Node_Id; Val : Node_Id) is
5297       begin
5298          pragma Assert (Nkind (N) in N_Entity);
5299          Nodes.Table (N + 4).Field8 := Union_Id (Val);
5300       end Set_Node26;
5301
5302       procedure Set_Node27 (N : Node_Id; Val : Node_Id) is
5303       begin
5304          pragma Assert (Nkind (N) in N_Entity);
5305          Nodes.Table (N + 4).Field9 := Union_Id (Val);
5306       end Set_Node27;
5307
5308       procedure Set_Node28 (N : Node_Id; Val : Node_Id) is
5309       begin
5310          pragma Assert (Nkind (N) in N_Entity);
5311          Nodes.Table (N + 4).Field10 := Union_Id (Val);
5312       end Set_Node28;
5313
5314       procedure Set_List1 (N : Node_Id; Val : List_Id) is
5315       begin
5316          pragma Assert (N <= Nodes.Last);
5317          Nodes.Table (N).Field1 := Union_Id (Val);
5318       end Set_List1;
5319
5320       procedure Set_List2 (N : Node_Id; Val : List_Id) is
5321       begin
5322          pragma Assert (N <= Nodes.Last);
5323          Nodes.Table (N).Field2 := Union_Id (Val);
5324       end Set_List2;
5325
5326       procedure Set_List3 (N : Node_Id; Val : List_Id) is
5327       begin
5328          pragma Assert (N <= Nodes.Last);
5329          Nodes.Table (N).Field3 := Union_Id (Val);
5330       end Set_List3;
5331
5332       procedure Set_List4 (N : Node_Id; Val : List_Id) is
5333       begin
5334          pragma Assert (N <= Nodes.Last);
5335          Nodes.Table (N).Field4 := Union_Id (Val);
5336       end Set_List4;
5337
5338       procedure Set_List5 (N : Node_Id; Val : List_Id) is
5339       begin
5340          pragma Assert (N <= Nodes.Last);
5341          Nodes.Table (N).Field5 := Union_Id (Val);
5342       end Set_List5;
5343
5344       procedure Set_List10 (N : Node_Id; Val : List_Id) is
5345       begin
5346          pragma Assert (Nkind (N) in N_Entity);
5347          Nodes.Table (N + 1).Field10 := Union_Id (Val);
5348       end Set_List10;
5349
5350       procedure Set_List14 (N : Node_Id; Val : List_Id) is
5351       begin
5352          pragma Assert (Nkind (N) in N_Entity);
5353          Nodes.Table (N + 2).Field7 := Union_Id (Val);
5354       end Set_List14;
5355
5356       procedure Set_Elist1 (N : Node_Id; Val : Elist_Id) is
5357       begin
5358          Nodes.Table (N).Field1 := Union_Id (Val);
5359       end Set_Elist1;
5360
5361       procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
5362       begin
5363          Nodes.Table (N).Field2 := Union_Id (Val);
5364       end Set_Elist2;
5365
5366       procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
5367       begin
5368          Nodes.Table (N).Field3 := Union_Id (Val);
5369       end Set_Elist3;
5370
5371       procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
5372       begin
5373          Nodes.Table (N).Field4 := Union_Id (Val);
5374       end Set_Elist4;
5375
5376       procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
5377       begin
5378          pragma Assert (Nkind (N) in N_Entity);
5379          Nodes.Table (N + 1).Field8 := Union_Id (Val);
5380       end Set_Elist8;
5381
5382       procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
5383       begin
5384          pragma Assert (Nkind (N) in N_Entity);
5385          Nodes.Table (N + 2).Field6 := Union_Id (Val);
5386       end Set_Elist13;
5387
5388       procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
5389       begin
5390          pragma Assert (Nkind (N) in N_Entity);
5391          Nodes.Table (N + 2).Field8 := Union_Id (Val);
5392       end Set_Elist15;
5393
5394       procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
5395       begin
5396          pragma Assert (Nkind (N) in N_Entity);
5397          Nodes.Table (N + 2).Field9 := Union_Id (Val);
5398       end Set_Elist16;
5399
5400       procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
5401       begin
5402          pragma Assert (Nkind (N) in N_Entity);
5403          Nodes.Table (N + 2).Field11 := Union_Id (Val);
5404       end Set_Elist18;
5405
5406       procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
5407       begin
5408          pragma Assert (Nkind (N) in N_Entity);
5409          Nodes.Table (N + 3).Field8 := Union_Id (Val);
5410       end Set_Elist21;
5411
5412       procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
5413       begin
5414          pragma Assert (Nkind (N) in N_Entity);
5415          Nodes.Table (N + 3).Field10 := Union_Id (Val);
5416       end Set_Elist23;
5417
5418       procedure Set_Elist25 (N : Node_Id; Val : Elist_Id) is
5419       begin
5420          pragma Assert (Nkind (N) in N_Entity);
5421          Nodes.Table (N + 4).Field7 := Union_Id (Val);
5422       end Set_Elist25;
5423
5424       procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
5425       begin
5426          pragma Assert (N <= Nodes.Last);
5427          Nodes.Table (N).Field1 := Union_Id (Val);
5428       end Set_Name1;
5429
5430       procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
5431       begin
5432          pragma Assert (N <= Nodes.Last);
5433          Nodes.Table (N).Field2 := Union_Id (Val);
5434       end Set_Name2;
5435
5436       procedure Set_Str3 (N : Node_Id; Val : String_Id) is
5437       begin
5438          pragma Assert (N <= Nodes.Last);
5439          Nodes.Table (N).Field3 := Union_Id (Val);
5440       end Set_Str3;
5441
5442       procedure Set_Uint2 (N : Node_Id; Val : Uint) is
5443       begin
5444          pragma Assert (N <= Nodes.Last);
5445          Nodes.Table (N).Field2 := To_Union (Val);
5446       end Set_Uint2;
5447
5448       procedure Set_Uint3 (N : Node_Id; Val : Uint) is
5449       begin
5450          pragma Assert (N <= Nodes.Last);
5451          Nodes.Table (N).Field3 := To_Union (Val);
5452       end Set_Uint3;
5453
5454       procedure Set_Uint4 (N : Node_Id; Val : Uint) is
5455       begin
5456          pragma Assert (N <= Nodes.Last);
5457          Nodes.Table (N).Field4 := To_Union (Val);
5458       end Set_Uint4;
5459
5460       procedure Set_Uint5 (N : Node_Id; Val : Uint) is
5461       begin
5462          pragma Assert (N <= Nodes.Last);
5463          Nodes.Table (N).Field5 := To_Union (Val);
5464       end Set_Uint5;
5465
5466       procedure Set_Uint8 (N : Node_Id; Val : Uint) is
5467       begin
5468          pragma Assert (Nkind (N) in N_Entity);
5469          Nodes.Table (N + 1).Field8 := To_Union (Val);
5470       end Set_Uint8;
5471
5472       procedure Set_Uint9 (N : Node_Id; Val : Uint) is
5473       begin
5474          pragma Assert (Nkind (N) in N_Entity);
5475          Nodes.Table (N + 1).Field9 := To_Union (Val);
5476       end Set_Uint9;
5477
5478       procedure Set_Uint10 (N : Node_Id; Val : Uint) is
5479       begin
5480          pragma Assert (Nkind (N) in N_Entity);
5481          Nodes.Table (N + 1).Field10 := To_Union (Val);
5482       end Set_Uint10;
5483
5484       procedure Set_Uint11 (N : Node_Id; Val : Uint) is
5485       begin
5486          pragma Assert (Nkind (N) in N_Entity);
5487          Nodes.Table (N + 1).Field11 := To_Union (Val);
5488       end Set_Uint11;
5489
5490       procedure Set_Uint12 (N : Node_Id; Val : Uint) is
5491       begin
5492          pragma Assert (Nkind (N) in N_Entity);
5493          Nodes.Table (N + 1).Field12 := To_Union (Val);
5494       end Set_Uint12;
5495
5496       procedure Set_Uint13 (N : Node_Id; Val : Uint) is
5497       begin
5498          pragma Assert (Nkind (N) in N_Entity);
5499          Nodes.Table (N + 2).Field6 := To_Union (Val);
5500       end Set_Uint13;
5501
5502       procedure Set_Uint14 (N : Node_Id; Val : Uint) is
5503       begin
5504          pragma Assert (Nkind (N) in N_Entity);
5505          Nodes.Table (N + 2).Field7 := To_Union (Val);
5506       end Set_Uint14;
5507
5508       procedure Set_Uint15 (N : Node_Id; Val : Uint) is
5509       begin
5510          pragma Assert (Nkind (N) in N_Entity);
5511          Nodes.Table (N + 2).Field8 := To_Union (Val);
5512       end Set_Uint15;
5513
5514       procedure Set_Uint16 (N : Node_Id; Val : Uint) is
5515       begin
5516          pragma Assert (Nkind (N) in N_Entity);
5517          Nodes.Table (N + 2).Field9 := To_Union (Val);
5518       end Set_Uint16;
5519
5520       procedure Set_Uint17 (N : Node_Id; Val : Uint) is
5521       begin
5522          pragma Assert (Nkind (N) in N_Entity);
5523          Nodes.Table (N + 2).Field10 := To_Union (Val);
5524       end Set_Uint17;
5525
5526       procedure Set_Uint22 (N : Node_Id; Val : Uint) is
5527       begin
5528          pragma Assert (Nkind (N) in N_Entity);
5529          Nodes.Table (N + 3).Field9 := To_Union (Val);
5530       end Set_Uint22;
5531
5532       procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
5533       begin
5534          pragma Assert (N <= Nodes.Last);
5535          Nodes.Table (N).Field3 := To_Union (Val);
5536       end Set_Ureal3;
5537
5538       procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
5539       begin
5540          pragma Assert (Nkind (N) in N_Entity);
5541          Nodes.Table (N + 2).Field11 := To_Union (Val);
5542       end Set_Ureal18;
5543
5544       procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
5545       begin
5546          pragma Assert (Nkind (N) in N_Entity);
5547          Nodes.Table (N + 3).Field8 := To_Union (Val);
5548       end Set_Ureal21;
5549
5550       procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
5551       begin
5552          pragma Assert (N <= Nodes.Last);
5553          Nodes.Table (N).Flag4 := Val;
5554       end Set_Flag4;
5555
5556       procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
5557       begin
5558          pragma Assert (N <= Nodes.Last);
5559          Nodes.Table (N).Flag5 := Val;
5560       end Set_Flag5;
5561
5562       procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
5563       begin
5564          pragma Assert (N <= Nodes.Last);
5565          Nodes.Table (N).Flag6 := Val;
5566       end Set_Flag6;
5567
5568       procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
5569       begin
5570          pragma Assert (N <= Nodes.Last);
5571          Nodes.Table (N).Flag7 := Val;
5572       end Set_Flag7;
5573
5574       procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
5575       begin
5576          pragma Assert (N <= Nodes.Last);
5577          Nodes.Table (N).Flag8 := Val;
5578       end Set_Flag8;
5579
5580       procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
5581       begin
5582          pragma Assert (N <= Nodes.Last);
5583          Nodes.Table (N).Flag9 := Val;
5584       end Set_Flag9;
5585
5586       procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
5587       begin
5588          pragma Assert (N <= Nodes.Last);
5589          Nodes.Table (N).Flag10 := Val;
5590       end Set_Flag10;
5591
5592       procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
5593       begin
5594          pragma Assert (N <= Nodes.Last);
5595          Nodes.Table (N).Flag11 := Val;
5596       end Set_Flag11;
5597
5598       procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
5599       begin
5600          pragma Assert (N <= Nodes.Last);
5601          Nodes.Table (N).Flag12 := Val;
5602       end Set_Flag12;
5603
5604       procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
5605       begin
5606          pragma Assert (N <= Nodes.Last);
5607          Nodes.Table (N).Flag13 := Val;
5608       end Set_Flag13;
5609
5610       procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
5611       begin
5612          pragma Assert (N <= Nodes.Last);
5613          Nodes.Table (N).Flag14 := Val;
5614       end Set_Flag14;
5615
5616       procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
5617       begin
5618          pragma Assert (N <= Nodes.Last);
5619          Nodes.Table (N).Flag15 := Val;
5620       end Set_Flag15;
5621
5622       procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
5623       begin
5624          pragma Assert (N <= Nodes.Last);
5625          Nodes.Table (N).Flag16 := Val;
5626       end Set_Flag16;
5627
5628       procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
5629       begin
5630          pragma Assert (N <= Nodes.Last);
5631          Nodes.Table (N).Flag17 := Val;
5632       end Set_Flag17;
5633
5634       procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
5635       begin
5636          pragma Assert (N <= Nodes.Last);
5637          Nodes.Table (N).Flag18 := Val;
5638       end Set_Flag18;
5639
5640       procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
5641       begin
5642          pragma Assert (Nkind (N) in N_Entity);
5643          Nodes.Table (N + 1).In_List := Val;
5644       end Set_Flag19;
5645
5646       procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
5647       begin
5648          pragma Assert (Nkind (N) in N_Entity);
5649          Nodes.Table (N + 1).Unused_1 := Val;
5650       end Set_Flag20;
5651
5652       procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
5653       begin
5654          pragma Assert (Nkind (N) in N_Entity);
5655          Nodes.Table (N + 1).Rewrite_Ins := Val;
5656       end Set_Flag21;
5657
5658       procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
5659       begin
5660          pragma Assert (Nkind (N) in N_Entity);
5661          Nodes.Table (N + 1).Analyzed := Val;
5662       end Set_Flag22;
5663
5664       procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
5665       begin
5666          pragma Assert (Nkind (N) in N_Entity);
5667          Nodes.Table (N + 1).Comes_From_Source := Val;
5668       end Set_Flag23;
5669
5670       procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
5671       begin
5672          pragma Assert (Nkind (N) in N_Entity);
5673          Nodes.Table (N + 1).Error_Posted := Val;
5674       end Set_Flag24;
5675
5676       procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
5677       begin
5678          pragma Assert (Nkind (N) in N_Entity);
5679          Nodes.Table (N + 1).Flag4 := Val;
5680       end Set_Flag25;
5681
5682       procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
5683       begin
5684          pragma Assert (Nkind (N) in N_Entity);
5685          Nodes.Table (N + 1).Flag5 := Val;
5686       end Set_Flag26;
5687
5688       procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
5689       begin
5690          pragma Assert (Nkind (N) in N_Entity);
5691          Nodes.Table (N + 1).Flag6 := Val;
5692       end Set_Flag27;
5693
5694       procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
5695       begin
5696          pragma Assert (Nkind (N) in N_Entity);
5697          Nodes.Table (N + 1).Flag7 := Val;
5698       end Set_Flag28;
5699
5700       procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
5701       begin
5702          pragma Assert (Nkind (N) in N_Entity);
5703          Nodes.Table (N + 1).Flag8 := Val;
5704       end Set_Flag29;
5705
5706       procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
5707       begin
5708          pragma Assert (Nkind (N) in N_Entity);
5709          Nodes.Table (N + 1).Flag9 := Val;
5710       end Set_Flag30;
5711
5712       procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
5713       begin
5714          pragma Assert (Nkind (N) in N_Entity);
5715          Nodes.Table (N + 1).Flag10 := Val;
5716       end Set_Flag31;
5717
5718       procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
5719       begin
5720          pragma Assert (Nkind (N) in N_Entity);
5721          Nodes.Table (N + 1).Flag11 := Val;
5722       end Set_Flag32;
5723
5724       procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
5725       begin
5726          pragma Assert (Nkind (N) in N_Entity);
5727          Nodes.Table (N + 1).Flag12 := Val;
5728       end Set_Flag33;
5729
5730       procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
5731       begin
5732          pragma Assert (Nkind (N) in N_Entity);
5733          Nodes.Table (N + 1).Flag13 := Val;
5734       end Set_Flag34;
5735
5736       procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
5737       begin
5738          pragma Assert (Nkind (N) in N_Entity);
5739          Nodes.Table (N + 1).Flag14 := Val;
5740       end Set_Flag35;
5741
5742       procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
5743       begin
5744          pragma Assert (Nkind (N) in N_Entity);
5745          Nodes.Table (N + 1).Flag15 := Val;
5746       end Set_Flag36;
5747
5748       procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
5749       begin
5750          pragma Assert (Nkind (N) in N_Entity);
5751          Nodes.Table (N + 1).Flag16 := Val;
5752       end Set_Flag37;
5753
5754       procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
5755       begin
5756          pragma Assert (Nkind (N) in N_Entity);
5757          Nodes.Table (N + 1).Flag17 := Val;
5758       end Set_Flag38;
5759
5760       procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
5761       begin
5762          pragma Assert (Nkind (N) in N_Entity);
5763          Nodes.Table (N + 1).Flag18 := Val;
5764       end Set_Flag39;
5765
5766       procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
5767       begin
5768          pragma Assert (Nkind (N) in N_Entity);
5769          Nodes.Table (N + 2).In_List := Val;
5770       end Set_Flag40;
5771
5772       procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
5773       begin
5774          pragma Assert (Nkind (N) in N_Entity);
5775          Nodes.Table (N + 2).Unused_1 := Val;
5776       end Set_Flag41;
5777
5778       procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
5779       begin
5780          pragma Assert (Nkind (N) in N_Entity);
5781          Nodes.Table (N + 2).Rewrite_Ins := Val;
5782       end Set_Flag42;
5783
5784       procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
5785       begin
5786          pragma Assert (Nkind (N) in N_Entity);
5787          Nodes.Table (N + 2).Analyzed := Val;
5788       end Set_Flag43;
5789
5790       procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
5791       begin
5792          pragma Assert (Nkind (N) in N_Entity);
5793          Nodes.Table (N + 2).Comes_From_Source := Val;
5794       end Set_Flag44;
5795
5796       procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
5797       begin
5798          pragma Assert (Nkind (N) in N_Entity);
5799          Nodes.Table (N + 2).Error_Posted := Val;
5800       end Set_Flag45;
5801
5802       procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
5803       begin
5804          pragma Assert (Nkind (N) in N_Entity);
5805          Nodes.Table (N + 2).Flag4 := Val;
5806       end Set_Flag46;
5807
5808       procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
5809       begin
5810          pragma Assert (Nkind (N) in N_Entity);
5811          Nodes.Table (N + 2).Flag5 := Val;
5812       end Set_Flag47;
5813
5814       procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
5815       begin
5816          pragma Assert (Nkind (N) in N_Entity);
5817          Nodes.Table (N + 2).Flag6 := Val;
5818       end Set_Flag48;
5819
5820       procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
5821       begin
5822          pragma Assert (Nkind (N) in N_Entity);
5823          Nodes.Table (N + 2).Flag7 := Val;
5824       end Set_Flag49;
5825
5826       procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
5827       begin
5828          pragma Assert (Nkind (N) in N_Entity);
5829          Nodes.Table (N + 2).Flag8 := Val;
5830       end Set_Flag50;
5831
5832       procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
5833       begin
5834          pragma Assert (Nkind (N) in N_Entity);
5835          Nodes.Table (N + 2).Flag9 := Val;
5836       end Set_Flag51;
5837
5838       procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
5839       begin
5840          pragma Assert (Nkind (N) in N_Entity);
5841          Nodes.Table (N + 2).Flag10 := Val;
5842       end Set_Flag52;
5843
5844       procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
5845       begin
5846          pragma Assert (Nkind (N) in N_Entity);
5847          Nodes.Table (N + 2).Flag11 := Val;
5848       end Set_Flag53;
5849
5850       procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
5851       begin
5852          pragma Assert (Nkind (N) in N_Entity);
5853          Nodes.Table (N + 2).Flag12 := Val;
5854       end Set_Flag54;
5855
5856       procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
5857       begin
5858          pragma Assert (Nkind (N) in N_Entity);
5859          Nodes.Table (N + 2).Flag13 := Val;
5860       end Set_Flag55;
5861
5862       procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
5863       begin
5864          pragma Assert (Nkind (N) in N_Entity);
5865          Nodes.Table (N + 2).Flag14 := Val;
5866       end Set_Flag56;
5867
5868       procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
5869       begin
5870          pragma Assert (Nkind (N) in N_Entity);
5871          Nodes.Table (N + 2).Flag15 := Val;
5872       end Set_Flag57;
5873
5874       procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
5875       begin
5876          pragma Assert (Nkind (N) in N_Entity);
5877          Nodes.Table (N + 2).Flag16 := Val;
5878       end Set_Flag58;
5879
5880       procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
5881       begin
5882          pragma Assert (Nkind (N) in N_Entity);
5883          Nodes.Table (N + 2).Flag17 := Val;
5884       end Set_Flag59;
5885
5886       procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
5887       begin
5888          pragma Assert (Nkind (N) in N_Entity);
5889          Nodes.Table (N + 2).Flag18 := Val;
5890       end Set_Flag60;
5891
5892       procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
5893       begin
5894          pragma Assert (Nkind (N) in N_Entity);
5895          Nodes.Table (N + 1).Pflag1 := Val;
5896       end Set_Flag61;
5897
5898       procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
5899       begin
5900          pragma Assert (Nkind (N) in N_Entity);
5901          Nodes.Table (N + 1).Pflag2 := Val;
5902       end Set_Flag62;
5903
5904       procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
5905       begin
5906          pragma Assert (Nkind (N) in N_Entity);
5907          Nodes.Table (N + 2).Pflag1 := Val;
5908       end Set_Flag63;
5909
5910       procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
5911       begin
5912          pragma Assert (Nkind (N) in N_Entity);
5913          Nodes.Table (N + 2).Pflag2 := Val;
5914       end Set_Flag64;
5915
5916       procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
5917       begin
5918          pragma Assert (Nkind (N) in N_Entity);
5919          To_Flag_Byte_Ptr
5920            (Node_Kind_Ptr'
5921              (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag65 := Val;
5922       end Set_Flag65;
5923
5924       procedure Set_Flag66 (N : Node_Id; Val : Boolean) is
5925       begin
5926          pragma Assert (Nkind (N) in N_Entity);
5927          To_Flag_Byte_Ptr
5928            (Node_Kind_Ptr'
5929              (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
5930       end Set_Flag66;
5931
5932       procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
5933       begin
5934          pragma Assert (Nkind (N) in N_Entity);
5935          To_Flag_Byte_Ptr
5936            (Node_Kind_Ptr'
5937              (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag67 := Val;
5938       end Set_Flag67;
5939
5940       procedure Set_Flag68 (N : Node_Id; Val : Boolean) is
5941       begin
5942          pragma Assert (Nkind (N) in N_Entity);
5943          To_Flag_Byte_Ptr
5944            (Node_Kind_Ptr'
5945              (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
5946       end Set_Flag68;
5947
5948       procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
5949       begin
5950          pragma Assert (Nkind (N) in N_Entity);
5951          To_Flag_Byte_Ptr
5952            (Node_Kind_Ptr'
5953              (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag69 := Val;
5954       end Set_Flag69;
5955
5956       procedure Set_Flag70 (N : Node_Id; Val : Boolean) is
5957       begin
5958          pragma Assert (Nkind (N) in N_Entity);
5959          To_Flag_Byte_Ptr
5960            (Node_Kind_Ptr'
5961              (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
5962       end Set_Flag70;
5963
5964       procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
5965       begin
5966          pragma Assert (Nkind (N) in N_Entity);
5967          To_Flag_Byte_Ptr
5968            (Node_Kind_Ptr'
5969              (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag71 := Val;
5970       end Set_Flag71;
5971
5972       procedure Set_Flag72 (N : Node_Id; Val : Boolean) is
5973       begin
5974          pragma Assert (Nkind (N) in N_Entity);
5975          To_Flag_Byte_Ptr
5976            (Node_Kind_Ptr'
5977              (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
5978       end Set_Flag72;
5979
5980       procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
5981       begin
5982          pragma Assert (Nkind (N) in N_Entity);
5983          To_Flag_Word_Ptr
5984            (Union_Id_Ptr'
5985              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag73 := Val;
5986       end Set_Flag73;
5987
5988       procedure Set_Flag74 (N : Node_Id; Val : Boolean) is
5989       begin
5990          pragma Assert (Nkind (N) in N_Entity);
5991          To_Flag_Word_Ptr
5992            (Union_Id_Ptr'
5993              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
5994       end Set_Flag74;
5995
5996       procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
5997       begin
5998          pragma Assert (Nkind (N) in N_Entity);
5999          To_Flag_Word_Ptr
6000            (Union_Id_Ptr'
6001              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag75 := Val;
6002       end Set_Flag75;
6003
6004       procedure Set_Flag76 (N : Node_Id; Val : Boolean) is
6005       begin
6006          pragma Assert (Nkind (N) in N_Entity);
6007          To_Flag_Word_Ptr
6008            (Union_Id_Ptr'
6009              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
6010       end Set_Flag76;
6011
6012       procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
6013       begin
6014          pragma Assert (Nkind (N) in N_Entity);
6015          To_Flag_Word_Ptr
6016            (Union_Id_Ptr'
6017              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag77 := Val;
6018       end Set_Flag77;
6019
6020       procedure Set_Flag78 (N : Node_Id; Val : Boolean) is
6021       begin
6022          pragma Assert (Nkind (N) in N_Entity);
6023          To_Flag_Word_Ptr
6024            (Union_Id_Ptr'
6025              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
6026       end Set_Flag78;
6027
6028       procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
6029       begin
6030          pragma Assert (Nkind (N) in N_Entity);
6031          To_Flag_Word_Ptr
6032            (Union_Id_Ptr'
6033              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag79 := Val;
6034       end Set_Flag79;
6035
6036       procedure Set_Flag80 (N : Node_Id; Val : Boolean) is
6037       begin
6038          pragma Assert (Nkind (N) in N_Entity);
6039          To_Flag_Word_Ptr
6040            (Union_Id_Ptr'
6041              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
6042       end Set_Flag80;
6043
6044       procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
6045       begin
6046          pragma Assert (Nkind (N) in N_Entity);
6047          To_Flag_Word_Ptr
6048            (Union_Id_Ptr'
6049              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag81 := Val;
6050       end Set_Flag81;
6051
6052       procedure Set_Flag82 (N : Node_Id; Val : Boolean) is
6053       begin
6054          pragma Assert (Nkind (N) in N_Entity);
6055          To_Flag_Word_Ptr
6056            (Union_Id_Ptr'
6057              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
6058       end Set_Flag82;
6059
6060       procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
6061       begin
6062          pragma Assert (Nkind (N) in N_Entity);
6063          To_Flag_Word_Ptr
6064            (Union_Id_Ptr'
6065              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag83 := Val;
6066       end Set_Flag83;
6067
6068       procedure Set_Flag84 (N : Node_Id; Val : Boolean) is
6069       begin
6070          pragma Assert (Nkind (N) in N_Entity);
6071          To_Flag_Word_Ptr
6072            (Union_Id_Ptr'
6073              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
6074       end Set_Flag84;
6075
6076       procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
6077       begin
6078          pragma Assert (Nkind (N) in N_Entity);
6079          To_Flag_Word_Ptr
6080            (Union_Id_Ptr'
6081              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag85 := Val;
6082       end Set_Flag85;
6083
6084       procedure Set_Flag86 (N : Node_Id; Val : Boolean) is
6085       begin
6086          pragma Assert (Nkind (N) in N_Entity);
6087          To_Flag_Word_Ptr
6088            (Union_Id_Ptr'
6089              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
6090       end Set_Flag86;
6091
6092       procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
6093       begin
6094          pragma Assert (Nkind (N) in N_Entity);
6095          To_Flag_Word_Ptr
6096            (Union_Id_Ptr'
6097              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag87 := Val;
6098       end Set_Flag87;
6099
6100       procedure Set_Flag88 (N : Node_Id; Val : Boolean) is
6101       begin
6102          pragma Assert (Nkind (N) in N_Entity);
6103          To_Flag_Word_Ptr
6104            (Union_Id_Ptr'
6105              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
6106       end Set_Flag88;
6107
6108       procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
6109       begin
6110          pragma Assert (Nkind (N) in N_Entity);
6111          To_Flag_Word_Ptr
6112            (Union_Id_Ptr'
6113              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag89 := Val;
6114       end Set_Flag89;
6115
6116       procedure Set_Flag90 (N : Node_Id; Val : Boolean) is
6117       begin
6118          pragma Assert (Nkind (N) in N_Entity);
6119          To_Flag_Word_Ptr
6120            (Union_Id_Ptr'
6121              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
6122       end Set_Flag90;
6123
6124       procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
6125       begin
6126          pragma Assert (Nkind (N) in N_Entity);
6127          To_Flag_Word_Ptr
6128            (Union_Id_Ptr'
6129              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag91 := Val;
6130       end Set_Flag91;
6131
6132       procedure Set_Flag92 (N : Node_Id; Val : Boolean) is
6133       begin
6134          pragma Assert (Nkind (N) in N_Entity);
6135          To_Flag_Word_Ptr
6136            (Union_Id_Ptr'
6137              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
6138       end Set_Flag92;
6139
6140       procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
6141       begin
6142          pragma Assert (Nkind (N) in N_Entity);
6143          To_Flag_Word_Ptr
6144            (Union_Id_Ptr'
6145              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag93 := Val;
6146       end Set_Flag93;
6147
6148       procedure Set_Flag94 (N : Node_Id; Val : Boolean) is
6149       begin
6150          pragma Assert (Nkind (N) in N_Entity);
6151          To_Flag_Word_Ptr
6152            (Union_Id_Ptr'
6153              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
6154       end Set_Flag94;
6155
6156       procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
6157       begin
6158          pragma Assert (Nkind (N) in N_Entity);
6159          To_Flag_Word_Ptr
6160            (Union_Id_Ptr'
6161              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag95 := Val;
6162       end Set_Flag95;
6163
6164       procedure Set_Flag96 (N : Node_Id; Val : Boolean) is
6165       begin
6166          pragma Assert (Nkind (N) in N_Entity);
6167          To_Flag_Word_Ptr
6168            (Union_Id_Ptr'
6169              (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
6170       end Set_Flag96;
6171
6172       procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
6173       begin
6174          pragma Assert (Nkind (N) in N_Entity);
6175          To_Flag_Word2_Ptr
6176            (Union_Id_Ptr'
6177              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag97 := Val;
6178       end Set_Flag97;
6179
6180       procedure Set_Flag98 (N : Node_Id; Val : Boolean) is
6181       begin
6182          pragma Assert (Nkind (N) in N_Entity);
6183          To_Flag_Word2_Ptr
6184            (Union_Id_Ptr'
6185              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
6186       end Set_Flag98;
6187
6188       procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
6189       begin
6190          pragma Assert (Nkind (N) in N_Entity);
6191          To_Flag_Word2_Ptr
6192            (Union_Id_Ptr'
6193              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag99 := Val;
6194       end Set_Flag99;
6195
6196       procedure Set_Flag100 (N : Node_Id; Val : Boolean) is
6197       begin
6198          pragma Assert (Nkind (N) in N_Entity);
6199          To_Flag_Word2_Ptr
6200            (Union_Id_Ptr'
6201              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
6202       end Set_Flag100;
6203
6204       procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
6205       begin
6206          pragma Assert (Nkind (N) in N_Entity);
6207          To_Flag_Word2_Ptr
6208            (Union_Id_Ptr'
6209              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag101 := Val;
6210       end Set_Flag101;
6211
6212       procedure Set_Flag102 (N : Node_Id; Val : Boolean) is
6213       begin
6214          pragma Assert (Nkind (N) in N_Entity);
6215          To_Flag_Word2_Ptr
6216            (Union_Id_Ptr'
6217              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
6218       end Set_Flag102;
6219
6220       procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
6221       begin
6222          pragma Assert (Nkind (N) in N_Entity);
6223          To_Flag_Word2_Ptr
6224            (Union_Id_Ptr'
6225              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag103 := Val;
6226       end Set_Flag103;
6227
6228       procedure Set_Flag104 (N : Node_Id; Val : Boolean) is
6229       begin
6230          pragma Assert (Nkind (N) in N_Entity);
6231          To_Flag_Word2_Ptr
6232            (Union_Id_Ptr'
6233              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
6234       end Set_Flag104;
6235
6236       procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
6237       begin
6238          pragma Assert (Nkind (N) in N_Entity);
6239          To_Flag_Word2_Ptr
6240            (Union_Id_Ptr'
6241              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag105 := Val;
6242       end Set_Flag105;
6243
6244       procedure Set_Flag106 (N : Node_Id; Val : Boolean) is
6245       begin
6246          pragma Assert (Nkind (N) in N_Entity);
6247          To_Flag_Word2_Ptr
6248            (Union_Id_Ptr'
6249              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
6250       end Set_Flag106;
6251
6252       procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
6253       begin
6254          pragma Assert (Nkind (N) in N_Entity);
6255          To_Flag_Word2_Ptr
6256            (Union_Id_Ptr'
6257              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag107 := Val;
6258       end Set_Flag107;
6259
6260       procedure Set_Flag108 (N : Node_Id; Val : Boolean) is
6261       begin
6262          pragma Assert (Nkind (N) in N_Entity);
6263          To_Flag_Word2_Ptr
6264            (Union_Id_Ptr'
6265              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
6266       end Set_Flag108;
6267
6268       procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
6269       begin
6270          pragma Assert (Nkind (N) in N_Entity);
6271          To_Flag_Word2_Ptr
6272            (Union_Id_Ptr'
6273              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag109 := Val;
6274       end Set_Flag109;
6275
6276       procedure Set_Flag110 (N : Node_Id; Val : Boolean) is
6277       begin
6278          pragma Assert (Nkind (N) in N_Entity);
6279          To_Flag_Word2_Ptr
6280            (Union_Id_Ptr'
6281              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
6282       end Set_Flag110;
6283
6284       procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
6285       begin
6286          pragma Assert (Nkind (N) in N_Entity);
6287          To_Flag_Word2_Ptr
6288            (Union_Id_Ptr'
6289              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag111 := Val;
6290       end Set_Flag111;
6291
6292       procedure Set_Flag112 (N : Node_Id; Val : Boolean) is
6293       begin
6294          pragma Assert (Nkind (N) in N_Entity);
6295          To_Flag_Word2_Ptr
6296            (Union_Id_Ptr'
6297              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
6298       end Set_Flag112;
6299
6300       procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
6301       begin
6302          pragma Assert (Nkind (N) in N_Entity);
6303          To_Flag_Word2_Ptr
6304            (Union_Id_Ptr'
6305              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag113 := Val;
6306       end Set_Flag113;
6307
6308       procedure Set_Flag114 (N : Node_Id; Val : Boolean) is
6309       begin
6310          pragma Assert (Nkind (N) in N_Entity);
6311          To_Flag_Word2_Ptr
6312            (Union_Id_Ptr'
6313              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
6314       end Set_Flag114;
6315
6316       procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
6317       begin
6318          pragma Assert (Nkind (N) in N_Entity);
6319          To_Flag_Word2_Ptr
6320            (Union_Id_Ptr'
6321              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag115 := Val;
6322       end Set_Flag115;
6323
6324       procedure Set_Flag116 (N : Node_Id; Val : Boolean) is
6325       begin
6326          pragma Assert (Nkind (N) in N_Entity);
6327          To_Flag_Word2_Ptr
6328            (Union_Id_Ptr'
6329              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
6330       end Set_Flag116;
6331
6332       procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
6333       begin
6334          pragma Assert (Nkind (N) in N_Entity);
6335          To_Flag_Word2_Ptr
6336            (Union_Id_Ptr'
6337              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag117 := Val;
6338       end Set_Flag117;
6339
6340       procedure Set_Flag118 (N : Node_Id; Val : Boolean) is
6341       begin
6342          pragma Assert (Nkind (N) in N_Entity);
6343          To_Flag_Word2_Ptr
6344            (Union_Id_Ptr'
6345              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
6346       end Set_Flag118;
6347
6348       procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
6349       begin
6350          pragma Assert (Nkind (N) in N_Entity);
6351          To_Flag_Word2_Ptr
6352            (Union_Id_Ptr'
6353              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag119 := Val;
6354       end Set_Flag119;
6355
6356       procedure Set_Flag120 (N : Node_Id; Val : Boolean) is
6357       begin
6358          pragma Assert (Nkind (N) in N_Entity);
6359          To_Flag_Word2_Ptr
6360            (Union_Id_Ptr'
6361              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
6362       end Set_Flag120;
6363
6364       procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
6365       begin
6366          pragma Assert (Nkind (N) in N_Entity);
6367          To_Flag_Word2_Ptr
6368            (Union_Id_Ptr'
6369              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag121 := Val;
6370       end Set_Flag121;
6371
6372       procedure Set_Flag122 (N : Node_Id; Val : Boolean) is
6373       begin
6374          pragma Assert (Nkind (N) in N_Entity);
6375          To_Flag_Word2_Ptr
6376            (Union_Id_Ptr'
6377              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
6378       end Set_Flag122;
6379
6380       procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
6381       begin
6382          pragma Assert (Nkind (N) in N_Entity);
6383          To_Flag_Word2_Ptr
6384            (Union_Id_Ptr'
6385              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag123 := Val;
6386       end Set_Flag123;
6387
6388       procedure Set_Flag124 (N : Node_Id; Val : Boolean) is
6389       begin
6390          pragma Assert (Nkind (N) in N_Entity);
6391          To_Flag_Word2_Ptr
6392            (Union_Id_Ptr'
6393              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
6394       end Set_Flag124;
6395
6396       procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
6397       begin
6398          pragma Assert (Nkind (N) in N_Entity);
6399          To_Flag_Word2_Ptr
6400            (Union_Id_Ptr'
6401              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag125 := Val;
6402       end Set_Flag125;
6403
6404       procedure Set_Flag126 (N : Node_Id; Val : Boolean) is
6405       begin
6406          pragma Assert (Nkind (N) in N_Entity);
6407          To_Flag_Word2_Ptr
6408            (Union_Id_Ptr'
6409              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
6410       end Set_Flag126;
6411
6412       procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
6413       begin
6414          pragma Assert (Nkind (N) in N_Entity);
6415          To_Flag_Word2_Ptr
6416            (Union_Id_Ptr'
6417              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag127 := Val;
6418       end Set_Flag127;
6419
6420       procedure Set_Flag128 (N : Node_Id; Val : Boolean) is
6421       begin
6422          pragma Assert (Nkind (N) in N_Entity);
6423          To_Flag_Word2_Ptr
6424            (Union_Id_Ptr'
6425              (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
6426       end Set_Flag128;
6427
6428       procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
6429       begin
6430          pragma Assert (Nkind (N) in N_Entity);
6431          Nodes.Table (N + 3).In_List := Val;
6432       end Set_Flag129;
6433
6434       procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
6435       begin
6436          pragma Assert (Nkind (N) in N_Entity);
6437          Nodes.Table (N + 3).Unused_1 := Val;
6438       end Set_Flag130;
6439
6440       procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
6441       begin
6442          pragma Assert (Nkind (N) in N_Entity);
6443          Nodes.Table (N + 3).Rewrite_Ins := Val;
6444       end Set_Flag131;
6445
6446       procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
6447       begin
6448          pragma Assert (Nkind (N) in N_Entity);
6449          Nodes.Table (N + 3).Analyzed := Val;
6450       end Set_Flag132;
6451
6452       procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
6453       begin
6454          pragma Assert (Nkind (N) in N_Entity);
6455          Nodes.Table (N + 3).Comes_From_Source := Val;
6456       end Set_Flag133;
6457
6458       procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
6459       begin
6460          pragma Assert (Nkind (N) in N_Entity);
6461          Nodes.Table (N + 3).Error_Posted := Val;
6462       end Set_Flag134;
6463
6464       procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
6465       begin
6466          pragma Assert (Nkind (N) in N_Entity);
6467          Nodes.Table (N + 3).Flag4 := Val;
6468       end Set_Flag135;
6469
6470       procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
6471       begin
6472          pragma Assert (Nkind (N) in N_Entity);
6473          Nodes.Table (N + 3).Flag5 := Val;
6474       end Set_Flag136;
6475
6476       procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
6477       begin
6478          pragma Assert (Nkind (N) in N_Entity);
6479          Nodes.Table (N + 3).Flag6 := Val;
6480       end Set_Flag137;
6481
6482       procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
6483       begin
6484          pragma Assert (Nkind (N) in N_Entity);
6485          Nodes.Table (N + 3).Flag7 := Val;
6486       end Set_Flag138;
6487
6488       procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
6489       begin
6490          pragma Assert (Nkind (N) in N_Entity);
6491          Nodes.Table (N + 3).Flag8 := Val;
6492       end Set_Flag139;
6493
6494       procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
6495       begin
6496          pragma Assert (Nkind (N) in N_Entity);
6497          Nodes.Table (N + 3).Flag9 := Val;
6498       end Set_Flag140;
6499
6500       procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
6501       begin
6502          pragma Assert (Nkind (N) in N_Entity);
6503          Nodes.Table (N + 3).Flag10 := Val;
6504       end Set_Flag141;
6505
6506       procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
6507       begin
6508          pragma Assert (Nkind (N) in N_Entity);
6509          Nodes.Table (N + 3).Flag11 := Val;
6510       end Set_Flag142;
6511
6512       procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
6513       begin
6514          pragma Assert (Nkind (N) in N_Entity);
6515          Nodes.Table (N + 3).Flag12 := Val;
6516       end Set_Flag143;
6517
6518       procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
6519       begin
6520          pragma Assert (Nkind (N) in N_Entity);
6521          Nodes.Table (N + 3).Flag13 := Val;
6522       end Set_Flag144;
6523
6524       procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
6525       begin
6526          pragma Assert (Nkind (N) in N_Entity);
6527          Nodes.Table (N + 3).Flag14 := Val;
6528       end Set_Flag145;
6529
6530       procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
6531       begin
6532          pragma Assert (Nkind (N) in N_Entity);
6533          Nodes.Table (N + 3).Flag15 := Val;
6534       end Set_Flag146;
6535
6536       procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
6537       begin
6538          pragma Assert (Nkind (N) in N_Entity);
6539          Nodes.Table (N + 3).Flag16 := Val;
6540       end Set_Flag147;
6541
6542       procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
6543       begin
6544          pragma Assert (Nkind (N) in N_Entity);
6545          Nodes.Table (N + 3).Flag17 := Val;
6546       end Set_Flag148;
6547
6548       procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
6549       begin
6550          pragma Assert (Nkind (N) in N_Entity);
6551          Nodes.Table (N + 3).Flag18 := Val;
6552       end Set_Flag149;
6553
6554       procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
6555       begin
6556          pragma Assert (Nkind (N) in N_Entity);
6557          Nodes.Table (N + 3).Pflag1 := Val;
6558       end Set_Flag150;
6559
6560       procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
6561       begin
6562          pragma Assert (Nkind (N) in N_Entity);
6563          Nodes.Table (N + 3).Pflag2 := Val;
6564       end Set_Flag151;
6565
6566       procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
6567       begin
6568          pragma Assert (Nkind (N) in N_Entity);
6569          To_Flag_Word3_Ptr
6570            (Union_Id_Ptr'
6571              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag152 := Val;
6572       end Set_Flag152;
6573
6574       procedure Set_Flag153 (N : Node_Id; Val : Boolean) is
6575       begin
6576          pragma Assert (Nkind (N) in N_Entity);
6577          To_Flag_Word3_Ptr
6578            (Union_Id_Ptr'
6579              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
6580       end Set_Flag153;
6581
6582       procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
6583       begin
6584          pragma Assert (Nkind (N) in N_Entity);
6585          To_Flag_Word3_Ptr
6586            (Union_Id_Ptr'
6587              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag154 := Val;
6588       end Set_Flag154;
6589
6590       procedure Set_Flag155 (N : Node_Id; Val : Boolean) is
6591       begin
6592          pragma Assert (Nkind (N) in N_Entity);
6593          To_Flag_Word3_Ptr
6594            (Union_Id_Ptr'
6595              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
6596       end Set_Flag155;
6597
6598       procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
6599       begin
6600          pragma Assert (Nkind (N) in N_Entity);
6601          To_Flag_Word3_Ptr
6602            (Union_Id_Ptr'
6603              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag156 := Val;
6604       end Set_Flag156;
6605
6606       procedure Set_Flag157 (N : Node_Id; Val : Boolean) is
6607       begin
6608          pragma Assert (Nkind (N) in N_Entity);
6609          To_Flag_Word3_Ptr
6610            (Union_Id_Ptr'
6611              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
6612       end Set_Flag157;
6613
6614       procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
6615       begin
6616          pragma Assert (Nkind (N) in N_Entity);
6617          To_Flag_Word3_Ptr
6618            (Union_Id_Ptr'
6619              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag158 := Val;
6620       end Set_Flag158;
6621
6622       procedure Set_Flag159 (N : Node_Id; Val : Boolean) is
6623       begin
6624          pragma Assert (Nkind (N) in N_Entity);
6625          To_Flag_Word3_Ptr
6626            (Union_Id_Ptr'
6627              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
6628       end Set_Flag159;
6629
6630       procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
6631       begin
6632          pragma Assert (Nkind (N) in N_Entity);
6633          To_Flag_Word3_Ptr
6634            (Union_Id_Ptr'
6635              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag160 := Val;
6636       end Set_Flag160;
6637
6638       procedure Set_Flag161 (N : Node_Id; Val : Boolean) is
6639       begin
6640          pragma Assert (Nkind (N) in N_Entity);
6641          To_Flag_Word3_Ptr
6642            (Union_Id_Ptr'
6643              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
6644       end Set_Flag161;
6645
6646       procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
6647       begin
6648          pragma Assert (Nkind (N) in N_Entity);
6649          To_Flag_Word3_Ptr
6650            (Union_Id_Ptr'
6651              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag162 := Val;
6652       end Set_Flag162;
6653
6654       procedure Set_Flag163 (N : Node_Id; Val : Boolean) is
6655       begin
6656          pragma Assert (Nkind (N) in N_Entity);
6657          To_Flag_Word3_Ptr
6658            (Union_Id_Ptr'
6659              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
6660       end Set_Flag163;
6661
6662       procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
6663       begin
6664          pragma Assert (Nkind (N) in N_Entity);
6665          To_Flag_Word3_Ptr
6666            (Union_Id_Ptr'
6667              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag164 := Val;
6668       end Set_Flag164;
6669
6670       procedure Set_Flag165 (N : Node_Id; Val : Boolean) is
6671       begin
6672          pragma Assert (Nkind (N) in N_Entity);
6673          To_Flag_Word3_Ptr
6674            (Union_Id_Ptr'
6675              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
6676       end Set_Flag165;
6677
6678       procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
6679       begin
6680          pragma Assert (Nkind (N) in N_Entity);
6681          To_Flag_Word3_Ptr
6682            (Union_Id_Ptr'
6683              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag166 := Val;
6684       end Set_Flag166;
6685
6686       procedure Set_Flag167 (N : Node_Id; Val : Boolean) is
6687       begin
6688          pragma Assert (Nkind (N) in N_Entity);
6689          To_Flag_Word3_Ptr
6690            (Union_Id_Ptr'
6691              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
6692       end Set_Flag167;
6693
6694       procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
6695       begin
6696          pragma Assert (Nkind (N) in N_Entity);
6697          To_Flag_Word3_Ptr
6698            (Union_Id_Ptr'
6699              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag168 := Val;
6700       end Set_Flag168;
6701
6702       procedure Set_Flag169 (N : Node_Id; Val : Boolean) is
6703       begin
6704          pragma Assert (Nkind (N) in N_Entity);
6705          To_Flag_Word3_Ptr
6706            (Union_Id_Ptr'
6707              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
6708       end Set_Flag169;
6709
6710       procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
6711       begin
6712          pragma Assert (Nkind (N) in N_Entity);
6713          To_Flag_Word3_Ptr
6714            (Union_Id_Ptr'
6715              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag170 := Val;
6716       end Set_Flag170;
6717
6718       procedure Set_Flag171 (N : Node_Id; Val : Boolean) is
6719       begin
6720          pragma Assert (Nkind (N) in N_Entity);
6721          To_Flag_Word3_Ptr
6722            (Union_Id_Ptr'
6723              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
6724       end Set_Flag171;
6725
6726       procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
6727       begin
6728          pragma Assert (Nkind (N) in N_Entity);
6729          To_Flag_Word3_Ptr
6730            (Union_Id_Ptr'
6731              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag172 := Val;
6732       end Set_Flag172;
6733
6734       procedure Set_Flag173 (N : Node_Id; Val : Boolean) is
6735       begin
6736          pragma Assert (Nkind (N) in N_Entity);
6737          To_Flag_Word3_Ptr
6738            (Union_Id_Ptr'
6739              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
6740       end Set_Flag173;
6741
6742       procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
6743       begin
6744          pragma Assert (Nkind (N) in N_Entity);
6745          To_Flag_Word3_Ptr
6746            (Union_Id_Ptr'
6747              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag174 := Val;
6748       end Set_Flag174;
6749
6750       procedure Set_Flag175 (N : Node_Id; Val : Boolean) is
6751       begin
6752          pragma Assert (Nkind (N) in N_Entity);
6753          To_Flag_Word3_Ptr
6754            (Union_Id_Ptr'
6755              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
6756       end Set_Flag175;
6757
6758       procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
6759       begin
6760          pragma Assert (Nkind (N) in N_Entity);
6761          To_Flag_Word3_Ptr
6762            (Union_Id_Ptr'
6763              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag176 := Val;
6764       end Set_Flag176;
6765
6766       procedure Set_Flag177 (N : Node_Id; Val : Boolean) is
6767       begin
6768          pragma Assert (Nkind (N) in N_Entity);
6769          To_Flag_Word3_Ptr
6770            (Union_Id_Ptr'
6771              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
6772       end Set_Flag177;
6773
6774       procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
6775       begin
6776          pragma Assert (Nkind (N) in N_Entity);
6777          To_Flag_Word3_Ptr
6778            (Union_Id_Ptr'
6779              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag178 := Val;
6780       end Set_Flag178;
6781
6782       procedure Set_Flag179 (N : Node_Id; Val : Boolean) is
6783       begin
6784          pragma Assert (Nkind (N) in N_Entity);
6785          To_Flag_Word3_Ptr
6786            (Union_Id_Ptr'
6787              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
6788       end Set_Flag179;
6789
6790       procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
6791       begin
6792          pragma Assert (Nkind (N) in N_Entity);
6793          To_Flag_Word3_Ptr
6794            (Union_Id_Ptr'
6795              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag180 := Val;
6796       end Set_Flag180;
6797
6798       procedure Set_Flag181 (N : Node_Id; Val : Boolean) is
6799       begin
6800          pragma Assert (Nkind (N) in N_Entity);
6801          To_Flag_Word3_Ptr
6802            (Union_Id_Ptr'
6803              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
6804       end Set_Flag181;
6805
6806       procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
6807       begin
6808          pragma Assert (Nkind (N) in N_Entity);
6809          To_Flag_Word3_Ptr
6810            (Union_Id_Ptr'
6811              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag182 := Val;
6812       end Set_Flag182;
6813
6814       procedure Set_Flag183 (N : Node_Id; Val : Boolean) is
6815       begin
6816          pragma Assert (Nkind (N) in N_Entity);
6817          To_Flag_Word3_Ptr
6818            (Union_Id_Ptr'
6819              (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
6820       end Set_Flag183;
6821
6822       procedure Set_Flag184 (N : Node_Id; Val : Boolean) is
6823       begin
6824          pragma Assert (Nkind (N) in N_Entity);
6825          To_Flag_Word4_Ptr
6826            (Union_Id_Ptr'
6827              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag184 := Val;
6828       end Set_Flag184;
6829
6830       procedure Set_Flag185 (N : Node_Id; Val : Boolean) is
6831       begin
6832          pragma Assert (Nkind (N) in N_Entity);
6833          To_Flag_Word4_Ptr
6834            (Union_Id_Ptr'
6835              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag185 := Val;
6836       end Set_Flag185;
6837
6838       procedure Set_Flag186 (N : Node_Id; Val : Boolean) is
6839       begin
6840          pragma Assert (Nkind (N) in N_Entity);
6841          To_Flag_Word4_Ptr
6842            (Union_Id_Ptr'
6843              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag186 := Val;
6844       end Set_Flag186;
6845
6846       procedure Set_Flag187 (N : Node_Id; Val : Boolean) is
6847       begin
6848          pragma Assert (Nkind (N) in N_Entity);
6849          To_Flag_Word4_Ptr
6850            (Union_Id_Ptr'
6851              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag187 := Val;
6852       end Set_Flag187;
6853
6854       procedure Set_Flag188 (N : Node_Id; Val : Boolean) is
6855       begin
6856          pragma Assert (Nkind (N) in N_Entity);
6857          To_Flag_Word4_Ptr
6858            (Union_Id_Ptr'
6859              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag188 := Val;
6860       end Set_Flag188;
6861
6862       procedure Set_Flag189 (N : Node_Id; Val : Boolean) is
6863       begin
6864          pragma Assert (Nkind (N) in N_Entity);
6865          To_Flag_Word4_Ptr
6866            (Union_Id_Ptr'
6867              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag189 := Val;
6868       end Set_Flag189;
6869
6870       procedure Set_Flag190 (N : Node_Id; Val : Boolean) is
6871       begin
6872          pragma Assert (Nkind (N) in N_Entity);
6873          To_Flag_Word4_Ptr
6874            (Union_Id_Ptr'
6875              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag190 := Val;
6876       end Set_Flag190;
6877
6878       procedure Set_Flag191 (N : Node_Id; Val : Boolean) is
6879       begin
6880          pragma Assert (Nkind (N) in N_Entity);
6881          To_Flag_Word4_Ptr
6882            (Union_Id_Ptr'
6883              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag191 := Val;
6884       end Set_Flag191;
6885
6886       procedure Set_Flag192 (N : Node_Id; Val : Boolean) is
6887       begin
6888          pragma Assert (Nkind (N) in N_Entity);
6889          To_Flag_Word4_Ptr
6890            (Union_Id_Ptr'
6891              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag192 := Val;
6892       end Set_Flag192;
6893
6894       procedure Set_Flag193 (N : Node_Id; Val : Boolean) is
6895       begin
6896          pragma Assert (Nkind (N) in N_Entity);
6897          To_Flag_Word4_Ptr
6898            (Union_Id_Ptr'
6899              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag193 := Val;
6900       end Set_Flag193;
6901
6902       procedure Set_Flag194 (N : Node_Id; Val : Boolean) is
6903       begin
6904          pragma Assert (Nkind (N) in N_Entity);
6905          To_Flag_Word4_Ptr
6906            (Union_Id_Ptr'
6907              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag194 := Val;
6908       end Set_Flag194;
6909
6910       procedure Set_Flag195 (N : Node_Id; Val : Boolean) is
6911       begin
6912          pragma Assert (Nkind (N) in N_Entity);
6913          To_Flag_Word4_Ptr
6914            (Union_Id_Ptr'
6915              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag195 := Val;
6916       end Set_Flag195;
6917
6918       procedure Set_Flag196 (N : Node_Id; Val : Boolean) is
6919       begin
6920          pragma Assert (Nkind (N) in N_Entity);
6921          To_Flag_Word4_Ptr
6922            (Union_Id_Ptr'
6923              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag196 := Val;
6924       end Set_Flag196;
6925
6926       procedure Set_Flag197 (N : Node_Id; Val : Boolean) is
6927       begin
6928          pragma Assert (Nkind (N) in N_Entity);
6929          To_Flag_Word4_Ptr
6930            (Union_Id_Ptr'
6931              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag197 := Val;
6932       end Set_Flag197;
6933
6934       procedure Set_Flag198 (N : Node_Id; Val : Boolean) is
6935       begin
6936          pragma Assert (Nkind (N) in N_Entity);
6937          To_Flag_Word4_Ptr
6938            (Union_Id_Ptr'
6939              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag198 := Val;
6940       end Set_Flag198;
6941
6942       procedure Set_Flag199 (N : Node_Id; Val : Boolean) is
6943       begin
6944          pragma Assert (Nkind (N) in N_Entity);
6945          To_Flag_Word4_Ptr
6946            (Union_Id_Ptr'
6947              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag199 := Val;
6948       end Set_Flag199;
6949
6950       procedure Set_Flag200 (N : Node_Id; Val : Boolean) is
6951       begin
6952          pragma Assert (Nkind (N) in N_Entity);
6953          To_Flag_Word4_Ptr
6954            (Union_Id_Ptr'
6955              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag200 := Val;
6956       end Set_Flag200;
6957
6958       procedure Set_Flag201 (N : Node_Id; Val : Boolean) is
6959       begin
6960          pragma Assert (Nkind (N) in N_Entity);
6961          To_Flag_Word4_Ptr
6962            (Union_Id_Ptr'
6963              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag201 := Val;
6964       end Set_Flag201;
6965
6966       procedure Set_Flag202 (N : Node_Id; Val : Boolean) is
6967       begin
6968          pragma Assert (Nkind (N) in N_Entity);
6969          To_Flag_Word4_Ptr
6970            (Union_Id_Ptr'
6971              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag202 := Val;
6972       end Set_Flag202;
6973
6974       procedure Set_Flag203 (N : Node_Id; Val : Boolean) is
6975       begin
6976          pragma Assert (Nkind (N) in N_Entity);
6977          To_Flag_Word4_Ptr
6978            (Union_Id_Ptr'
6979              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag203 := Val;
6980       end Set_Flag203;
6981
6982       procedure Set_Flag204 (N : Node_Id; Val : Boolean) is
6983       begin
6984          pragma Assert (Nkind (N) in N_Entity);
6985          To_Flag_Word4_Ptr
6986            (Union_Id_Ptr'
6987              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag204 := Val;
6988       end Set_Flag204;
6989
6990       procedure Set_Flag205 (N : Node_Id; Val : Boolean) is
6991       begin
6992          pragma Assert (Nkind (N) in N_Entity);
6993          To_Flag_Word4_Ptr
6994            (Union_Id_Ptr'
6995              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag205 := Val;
6996       end Set_Flag205;
6997
6998       procedure Set_Flag206 (N : Node_Id; Val : Boolean) is
6999       begin
7000          pragma Assert (Nkind (N) in N_Entity);
7001          To_Flag_Word4_Ptr
7002            (Union_Id_Ptr'
7003              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag206 := Val;
7004       end Set_Flag206;
7005
7006       procedure Set_Flag207 (N : Node_Id; Val : Boolean) is
7007       begin
7008          pragma Assert (Nkind (N) in N_Entity);
7009          To_Flag_Word4_Ptr
7010            (Union_Id_Ptr'
7011              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag207 := Val;
7012       end Set_Flag207;
7013
7014       procedure Set_Flag208 (N : Node_Id; Val : Boolean) is
7015       begin
7016          pragma Assert (Nkind (N) in N_Entity);
7017          To_Flag_Word4_Ptr
7018            (Union_Id_Ptr'
7019              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag208 := Val;
7020       end Set_Flag208;
7021
7022       procedure Set_Flag209 (N : Node_Id; Val : Boolean) is
7023       begin
7024          pragma Assert (Nkind (N) in N_Entity);
7025          To_Flag_Word4_Ptr
7026            (Union_Id_Ptr'
7027              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag209 := Val;
7028       end Set_Flag209;
7029
7030       procedure Set_Flag210 (N : Node_Id; Val : Boolean) is
7031       begin
7032          pragma Assert (Nkind (N) in N_Entity);
7033          To_Flag_Word4_Ptr
7034            (Union_Id_Ptr'
7035              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag210 := Val;
7036       end Set_Flag210;
7037
7038       procedure Set_Flag211 (N : Node_Id; Val : Boolean) is
7039       begin
7040          pragma Assert (Nkind (N) in N_Entity);
7041          To_Flag_Word4_Ptr
7042            (Union_Id_Ptr'
7043              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag211 := Val;
7044       end Set_Flag211;
7045
7046       procedure Set_Flag212 (N : Node_Id; Val : Boolean) is
7047       begin
7048          pragma Assert (Nkind (N) in N_Entity);
7049          To_Flag_Word4_Ptr
7050            (Union_Id_Ptr'
7051              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag212 := Val;
7052       end Set_Flag212;
7053
7054       procedure Set_Flag213 (N : Node_Id; Val : Boolean) is
7055       begin
7056          pragma Assert (Nkind (N) in N_Entity);
7057          To_Flag_Word4_Ptr
7058            (Union_Id_Ptr'
7059              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag213 := Val;
7060       end Set_Flag213;
7061
7062       procedure Set_Flag214 (N : Node_Id; Val : Boolean) is
7063       begin
7064          pragma Assert (Nkind (N) in N_Entity);
7065          To_Flag_Word4_Ptr
7066            (Union_Id_Ptr'
7067              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag214 := Val;
7068       end Set_Flag214;
7069
7070       procedure Set_Flag215 (N : Node_Id; Val : Boolean) is
7071       begin
7072          pragma Assert (Nkind (N) in N_Entity);
7073          To_Flag_Word4_Ptr
7074            (Union_Id_Ptr'
7075              (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag215 := Val;
7076       end Set_Flag215;
7077
7078       procedure Set_Flag216 (N : Node_Id; Val : Boolean) is
7079       begin
7080          pragma Assert (Nkind (N) in N_Entity);
7081          To_Flag_Word5_Ptr
7082            (Union_Id_Ptr'
7083              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag216 := Val;
7084       end Set_Flag216;
7085
7086       procedure Set_Flag217 (N : Node_Id; Val : Boolean) is
7087       begin
7088          pragma Assert (Nkind (N) in N_Entity);
7089          To_Flag_Word5_Ptr
7090            (Union_Id_Ptr'
7091              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag217 := Val;
7092       end Set_Flag217;
7093
7094       procedure Set_Flag218 (N : Node_Id; Val : Boolean) is
7095       begin
7096          pragma Assert (Nkind (N) in N_Entity);
7097          To_Flag_Word5_Ptr
7098            (Union_Id_Ptr'
7099              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag218 := Val;
7100       end Set_Flag218;
7101
7102       procedure Set_Flag219 (N : Node_Id; Val : Boolean) is
7103       begin
7104          pragma Assert (Nkind (N) in N_Entity);
7105          To_Flag_Word5_Ptr
7106            (Union_Id_Ptr'
7107              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag219 := Val;
7108       end Set_Flag219;
7109
7110       procedure Set_Flag220 (N : Node_Id; Val : Boolean) is
7111       begin
7112          pragma Assert (Nkind (N) in N_Entity);
7113          To_Flag_Word5_Ptr
7114            (Union_Id_Ptr'
7115              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag220 := Val;
7116       end Set_Flag220;
7117
7118       procedure Set_Flag221 (N : Node_Id; Val : Boolean) is
7119       begin
7120          pragma Assert (Nkind (N) in N_Entity);
7121          To_Flag_Word5_Ptr
7122            (Union_Id_Ptr'
7123              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag221 := Val;
7124       end Set_Flag221;
7125
7126       procedure Set_Flag222 (N : Node_Id; Val : Boolean) is
7127       begin
7128          pragma Assert (Nkind (N) in N_Entity);
7129          To_Flag_Word5_Ptr
7130            (Union_Id_Ptr'
7131              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag222 := Val;
7132       end Set_Flag222;
7133
7134       procedure Set_Flag223 (N : Node_Id; Val : Boolean) is
7135       begin
7136          pragma Assert (Nkind (N) in N_Entity);
7137          To_Flag_Word5_Ptr
7138            (Union_Id_Ptr'
7139              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag223 := Val;
7140       end Set_Flag223;
7141
7142       procedure Set_Flag224 (N : Node_Id; Val : Boolean) is
7143       begin
7144          pragma Assert (Nkind (N) in N_Entity);
7145          To_Flag_Word5_Ptr
7146            (Union_Id_Ptr'
7147              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag224 := Val;
7148       end Set_Flag224;
7149
7150       procedure Set_Flag225 (N : Node_Id; Val : Boolean) is
7151       begin
7152          pragma Assert (Nkind (N) in N_Entity);
7153          To_Flag_Word5_Ptr
7154            (Union_Id_Ptr'
7155              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag225 := Val;
7156       end Set_Flag225;
7157
7158       procedure Set_Flag226 (N : Node_Id; Val : Boolean) is
7159       begin
7160          pragma Assert (Nkind (N) in N_Entity);
7161          To_Flag_Word5_Ptr
7162            (Union_Id_Ptr'
7163              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag226 := Val;
7164       end Set_Flag226;
7165
7166       procedure Set_Flag227 (N : Node_Id; Val : Boolean) is
7167       begin
7168          pragma Assert (Nkind (N) in N_Entity);
7169          To_Flag_Word5_Ptr
7170            (Union_Id_Ptr'
7171              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag227 := Val;
7172       end Set_Flag227;
7173
7174       procedure Set_Flag228 (N : Node_Id; Val : Boolean) is
7175       begin
7176          pragma Assert (Nkind (N) in N_Entity);
7177          To_Flag_Word5_Ptr
7178            (Union_Id_Ptr'
7179              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag228 := Val;
7180       end Set_Flag228;
7181
7182       procedure Set_Flag229 (N : Node_Id; Val : Boolean) is
7183       begin
7184          pragma Assert (Nkind (N) in N_Entity);
7185          To_Flag_Word5_Ptr
7186            (Union_Id_Ptr'
7187              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag229 := Val;
7188       end Set_Flag229;
7189
7190       procedure Set_Flag230 (N : Node_Id; Val : Boolean) is
7191       begin
7192          pragma Assert (Nkind (N) in N_Entity);
7193          To_Flag_Word5_Ptr
7194            (Union_Id_Ptr'
7195              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag230 := Val;
7196       end Set_Flag230;
7197
7198       procedure Set_Flag231 (N : Node_Id; Val : Boolean) is
7199       begin
7200          pragma Assert (Nkind (N) in N_Entity);
7201          To_Flag_Word5_Ptr
7202            (Union_Id_Ptr'
7203              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag231 := Val;
7204       end Set_Flag231;
7205
7206       procedure Set_Flag232 (N : Node_Id; Val : Boolean) is
7207       begin
7208          pragma Assert (Nkind (N) in N_Entity);
7209          To_Flag_Word5_Ptr
7210            (Union_Id_Ptr'
7211              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag232 := Val;
7212       end Set_Flag232;
7213
7214       procedure Set_Flag233 (N : Node_Id; Val : Boolean) is
7215       begin
7216          pragma Assert (Nkind (N) in N_Entity);
7217          To_Flag_Word5_Ptr
7218            (Union_Id_Ptr'
7219              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag233 := Val;
7220       end Set_Flag233;
7221
7222       procedure Set_Flag234 (N : Node_Id; Val : Boolean) is
7223       begin
7224          pragma Assert (Nkind (N) in N_Entity);
7225          To_Flag_Word5_Ptr
7226            (Union_Id_Ptr'
7227              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag234 := Val;
7228       end Set_Flag234;
7229
7230       procedure Set_Flag235 (N : Node_Id; Val : Boolean) is
7231       begin
7232          pragma Assert (Nkind (N) in N_Entity);
7233          To_Flag_Word5_Ptr
7234            (Union_Id_Ptr'
7235              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag235 := Val;
7236       end Set_Flag235;
7237
7238       procedure Set_Flag236 (N : Node_Id; Val : Boolean) is
7239       begin
7240          pragma Assert (Nkind (N) in N_Entity);
7241          To_Flag_Word5_Ptr
7242            (Union_Id_Ptr'
7243              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag236 := Val;
7244       end Set_Flag236;
7245
7246       procedure Set_Flag237 (N : Node_Id; Val : Boolean) is
7247       begin
7248          pragma Assert (Nkind (N) in N_Entity);
7249          To_Flag_Word5_Ptr
7250            (Union_Id_Ptr'
7251              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag237 := Val;
7252       end Set_Flag237;
7253
7254       procedure Set_Flag238 (N : Node_Id; Val : Boolean) is
7255       begin
7256          pragma Assert (Nkind (N) in N_Entity);
7257          To_Flag_Word5_Ptr
7258            (Union_Id_Ptr'
7259              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag238 := Val;
7260       end Set_Flag238;
7261
7262       procedure Set_Flag239 (N : Node_Id; Val : Boolean) is
7263       begin
7264          pragma Assert (Nkind (N) in N_Entity);
7265          To_Flag_Word5_Ptr
7266            (Union_Id_Ptr'
7267              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag239 := Val;
7268       end Set_Flag239;
7269
7270       procedure Set_Flag240 (N : Node_Id; Val : Boolean) is
7271       begin
7272          pragma Assert (Nkind (N) in N_Entity);
7273          To_Flag_Word5_Ptr
7274            (Union_Id_Ptr'
7275              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag240 := Val;
7276       end Set_Flag240;
7277
7278       procedure Set_Flag241 (N : Node_Id; Val : Boolean) is
7279       begin
7280          pragma Assert (Nkind (N) in N_Entity);
7281          To_Flag_Word5_Ptr
7282            (Union_Id_Ptr'
7283              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag241 := Val;
7284       end Set_Flag241;
7285
7286       procedure Set_Flag242 (N : Node_Id; Val : Boolean) is
7287       begin
7288          pragma Assert (Nkind (N) in N_Entity);
7289          To_Flag_Word5_Ptr
7290            (Union_Id_Ptr'
7291              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag242 := Val;
7292       end Set_Flag242;
7293
7294       procedure Set_Flag243 (N : Node_Id; Val : Boolean) is
7295       begin
7296          pragma Assert (Nkind (N) in N_Entity);
7297          To_Flag_Word5_Ptr
7298            (Union_Id_Ptr'
7299              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag243 := Val;
7300       end Set_Flag243;
7301
7302       procedure Set_Flag244 (N : Node_Id; Val : Boolean) is
7303       begin
7304          pragma Assert (Nkind (N) in N_Entity);
7305          To_Flag_Word5_Ptr
7306            (Union_Id_Ptr'
7307              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag244 := Val;
7308       end Set_Flag244;
7309
7310       procedure Set_Flag245 (N : Node_Id; Val : Boolean) is
7311       begin
7312          pragma Assert (Nkind (N) in N_Entity);
7313          To_Flag_Word5_Ptr
7314            (Union_Id_Ptr'
7315              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag245 := Val;
7316       end Set_Flag245;
7317
7318       procedure Set_Flag246 (N : Node_Id; Val : Boolean) is
7319       begin
7320          pragma Assert (Nkind (N) in N_Entity);
7321          To_Flag_Word5_Ptr
7322            (Union_Id_Ptr'
7323              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag246 := Val;
7324       end Set_Flag246;
7325
7326       procedure Set_Flag247 (N : Node_Id; Val : Boolean) is
7327       begin
7328          pragma Assert (Nkind (N) in N_Entity);
7329          To_Flag_Word5_Ptr
7330            (Union_Id_Ptr'
7331              (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag247 := Val;
7332       end Set_Flag247;
7333
7334       procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
7335       begin
7336          pragma Assert (N <= Nodes.Last);
7337
7338          if Val > Error then
7339             Set_Parent (Val, N);
7340          end if;
7341
7342          Set_Node1 (N, Val);
7343       end Set_Node1_With_Parent;
7344
7345       procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
7346       begin
7347          pragma Assert (N <= Nodes.Last);
7348
7349          if Val > Error then
7350             Set_Parent (Val, N);
7351          end if;
7352
7353          Set_Node2 (N, Val);
7354       end Set_Node2_With_Parent;
7355
7356       procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
7357       begin
7358          pragma Assert (N <= Nodes.Last);
7359
7360          if Val > Error then
7361             Set_Parent (Val, N);
7362          end if;
7363
7364          Set_Node3 (N, Val);
7365       end Set_Node3_With_Parent;
7366
7367       procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
7368       begin
7369          pragma Assert (N <= Nodes.Last);
7370
7371          if Val > Error then
7372             Set_Parent (Val, N);
7373          end if;
7374
7375          Set_Node4 (N, Val);
7376       end Set_Node4_With_Parent;
7377
7378       procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
7379       begin
7380          pragma Assert (N <= Nodes.Last);
7381
7382          if Val > Error then
7383             Set_Parent (Val, N);
7384          end if;
7385
7386          Set_Node5 (N, Val);
7387       end Set_Node5_With_Parent;
7388
7389       procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
7390       begin
7391          pragma Assert (N <= Nodes.Last);
7392          if Val /= No_List and then Val /= Error_List then
7393             Set_Parent (Val, N);
7394          end if;
7395          Set_List1 (N, Val);
7396       end Set_List1_With_Parent;
7397
7398       procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
7399       begin
7400          pragma Assert (N <= Nodes.Last);
7401          if Val /= No_List and then Val /= Error_List then
7402             Set_Parent (Val, N);
7403          end if;
7404          Set_List2 (N, Val);
7405       end Set_List2_With_Parent;
7406
7407       procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
7408       begin
7409          pragma Assert (N <= Nodes.Last);
7410          if Val /= No_List and then Val /= Error_List then
7411             Set_Parent (Val, N);
7412          end if;
7413          Set_List3 (N, Val);
7414       end Set_List3_With_Parent;
7415
7416       procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
7417       begin
7418          pragma Assert (N <= Nodes.Last);
7419          if Val /= No_List and then Val /= Error_List then
7420             Set_Parent (Val, N);
7421          end if;
7422          Set_List4 (N, Val);
7423       end Set_List4_With_Parent;
7424
7425       procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
7426       begin
7427          pragma Assert (N <= Nodes.Last);
7428          if Val /= No_List and then Val /= Error_List then
7429             Set_Parent (Val, N);
7430          end if;
7431          Set_List5 (N, Val);
7432       end Set_List5_With_Parent;
7433
7434    end Unchecked_Access;
7435
7436    ------------
7437    -- Unlock --
7438    ------------
7439
7440    procedure Unlock is
7441    begin
7442       Nodes.Locked := False;
7443       Orig_Nodes.Locked := False;
7444    end Unlock;
7445
7446 end Atree;