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