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