PR testsuite/44195
[official-gcc.git] / gcc / ada / atree.adb
blob807527230af499346f671c044781a79f16e05d87
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT COMPILER COMPONENTS --
4 -- --
5 -- A T R E E --
6 -- --
7 -- B o d y --
8 -- --
9 -- Copyright (C) 1992-2010, 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 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. --
17 -- --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
21 -- --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
26 -- --
27 -- GNAT was originally developed by the GNAT team at New York University. --
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
29 -- --
30 ------------------------------------------------------------------------------
32 pragma Style_Checks (All_Checks);
33 -- Turn off subprogram ordering check for this package
35 -- WARNING: There is a C version of this package. Any changes to this source
36 -- file must be properly reflected in the file atree.h which is a C header
37 -- file containing equivalent definitions for use by gigi.
39 with Debug; use Debug;
40 with Nlists; use Nlists;
41 with Output; use Output;
42 with Sinput; use Sinput;
43 with Tree_IO; use Tree_IO;
45 package body Atree is
47 Reporting_Proc : Report_Proc := null;
48 -- Record argument to last call to Set_Reporting_Proc
50 ---------------
51 -- Debugging --
52 ---------------
54 -- Suppose you find that node 12345 is messed up. You might want to find
55 -- the code that created that node. There are two ways to do this:
57 -- One way is to set a conditional breakpoint on New_Node_Debugging_Output
58 -- (nickname "nnd"):
59 -- break nnd if n = 12345
60 -- and run gnat1 again from the beginning.
62 -- The other way is to set a breakpoint near the beginning (e.g. on
63 -- gnat1drv), and run. Then set Watch_Node (nickname "ww") to 12345 in gdb:
64 -- ww := 12345
65 -- and set a breakpoint on New_Node_Breakpoint (nickname "nn"). Continue.
67 -- Either way, gnat1 will stop when node 12345 is created
69 -- The second method is much faster
71 -- Similarly, rr and rrd allow breaking on rewriting of a given node
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
77 -- is 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.
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.
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.
94 -- If Node = Watch_Node, this prints out the new node and calls
95 -- New_Node_Breakpoint. Otherwise, does nothing.
97 procedure rr;
98 pragma Export (Ada, rr);
99 procedure Rewrite_Breakpoint renames rr;
100 -- This doesn't do anything interesting; it's just for setting breakpoint
101 -- on as explained above.
103 procedure rrd (Old_Node, New_Node : Node_Id);
104 pragma Export (Ada, rrd);
105 procedure Rewrite_Debugging_Output
106 (Old_Node, New_Node : Node_Id) renames rrd;
107 -- For debugging. If debugging is turned on, Rewrite calls this. If debug
108 -- flag N is turned on, this prints out the new node.
110 -- If Old_Node = Watch_Node, this prints out the old and new nodes and
111 -- calls Rewrite_Breakpoint. Otherwise, does nothing.
113 procedure Node_Debug_Output (Op : String; N : Node_Id);
114 -- Common code for nnd and rrd, writes Op followed by information about N
116 -----------------------------
117 -- Local Objects and Types --
118 -----------------------------
120 Node_Count : Nat;
121 -- Count allocated nodes for Num_Nodes function
123 use Unchecked_Access;
124 -- We are allowed to see these from within our own body!
126 use Atree_Private_Part;
127 -- We are also allowed to see our private data structures!
129 -- Functions used to store Entity_Kind value in Nkind field
131 -- The following declarations are used to store flags 65-72 in the
132 -- Nkind field of the third component of an extended (entity) node.
134 type Flag_Byte is record
135 Flag65 : Boolean;
136 Flag66 : Boolean;
137 Flag67 : Boolean;
138 Flag68 : Boolean;
139 Flag69 : Boolean;
140 Flag70 : Boolean;
141 Flag71 : Boolean;
142 Flag72 : Boolean;
143 end record;
145 pragma Pack (Flag_Byte);
146 for Flag_Byte'Size use 8;
148 type Flag_Byte_Ptr is access all Flag_Byte;
149 type Node_Kind_Ptr is access all Node_Kind;
151 function To_Flag_Byte is new
152 Unchecked_Conversion (Node_Kind, Flag_Byte);
154 function To_Flag_Byte_Ptr is new
155 Unchecked_Conversion (Node_Kind_Ptr, Flag_Byte_Ptr);
157 -- The following declarations are used to store flags 73-96 and the
158 -- Convention field in the Field12 field of the third component of an
159 -- extended (Entity) node.
161 type Flag_Word is record
162 Flag73 : Boolean;
163 Flag74 : Boolean;
164 Flag75 : Boolean;
165 Flag76 : Boolean;
166 Flag77 : Boolean;
167 Flag78 : Boolean;
168 Flag79 : Boolean;
169 Flag80 : Boolean;
171 Flag81 : Boolean;
172 Flag82 : Boolean;
173 Flag83 : Boolean;
174 Flag84 : Boolean;
175 Flag85 : Boolean;
176 Flag86 : Boolean;
177 Flag87 : Boolean;
178 Flag88 : Boolean;
180 Flag89 : Boolean;
181 Flag90 : Boolean;
182 Flag91 : Boolean;
183 Flag92 : Boolean;
184 Flag93 : Boolean;
185 Flag94 : Boolean;
186 Flag95 : Boolean;
187 Flag96 : Boolean;
189 Convention : Convention_Id;
190 end record;
192 pragma Pack (Flag_Word);
193 for Flag_Word'Size use 32;
194 for Flag_Word'Alignment use 4;
196 type Flag_Word_Ptr is access all Flag_Word;
197 type Union_Id_Ptr is access all Union_Id;
199 function To_Flag_Word is new
200 Unchecked_Conversion (Union_Id, Flag_Word);
202 function To_Flag_Word_Ptr is new
203 Unchecked_Conversion (Union_Id_Ptr, Flag_Word_Ptr);
205 -- The following declarations are used to store flags 97-128 in the
206 -- Field12 field of the fourth component of an extended (entity) node.
208 type Flag_Word2 is record
209 Flag97 : Boolean;
210 Flag98 : Boolean;
211 Flag99 : Boolean;
212 Flag100 : Boolean;
213 Flag101 : Boolean;
214 Flag102 : Boolean;
215 Flag103 : Boolean;
216 Flag104 : Boolean;
218 Flag105 : Boolean;
219 Flag106 : Boolean;
220 Flag107 : Boolean;
221 Flag108 : Boolean;
222 Flag109 : Boolean;
223 Flag110 : Boolean;
224 Flag111 : Boolean;
225 Flag112 : Boolean;
227 Flag113 : Boolean;
228 Flag114 : Boolean;
229 Flag115 : Boolean;
230 Flag116 : Boolean;
231 Flag117 : Boolean;
232 Flag118 : Boolean;
233 Flag119 : Boolean;
234 Flag120 : Boolean;
236 Flag121 : Boolean;
237 Flag122 : Boolean;
238 Flag123 : Boolean;
239 Flag124 : Boolean;
240 Flag125 : Boolean;
241 Flag126 : Boolean;
242 Flag127 : Boolean;
243 Flag128 : Boolean;
244 end record;
246 pragma Pack (Flag_Word2);
247 for Flag_Word2'Size use 32;
248 for Flag_Word2'Alignment use 4;
250 type Flag_Word2_Ptr is access all Flag_Word2;
252 function To_Flag_Word2 is new
253 Unchecked_Conversion (Union_Id, Flag_Word2);
255 function To_Flag_Word2_Ptr is new
256 Unchecked_Conversion (Union_Id_Ptr, Flag_Word2_Ptr);
258 -- The following declarations are used to store flags 152-183 in the
259 -- Field11 field of the fourth component of an extended (entity) node.
261 type Flag_Word3 is record
262 Flag152 : Boolean;
263 Flag153 : Boolean;
264 Flag154 : Boolean;
265 Flag155 : Boolean;
266 Flag156 : Boolean;
267 Flag157 : Boolean;
268 Flag158 : Boolean;
269 Flag159 : Boolean;
271 Flag160 : Boolean;
272 Flag161 : Boolean;
273 Flag162 : Boolean;
274 Flag163 : Boolean;
275 Flag164 : Boolean;
276 Flag165 : Boolean;
277 Flag166 : Boolean;
278 Flag167 : Boolean;
280 Flag168 : Boolean;
281 Flag169 : Boolean;
282 Flag170 : Boolean;
283 Flag171 : Boolean;
284 Flag172 : Boolean;
285 Flag173 : Boolean;
286 Flag174 : Boolean;
287 Flag175 : Boolean;
289 Flag176 : Boolean;
290 Flag177 : Boolean;
291 Flag178 : Boolean;
292 Flag179 : Boolean;
293 Flag180 : Boolean;
294 Flag181 : Boolean;
295 Flag182 : Boolean;
296 Flag183 : Boolean;
297 end record;
299 pragma Pack (Flag_Word3);
300 for Flag_Word3'Size use 32;
301 for Flag_Word3'Alignment use 4;
303 type Flag_Word3_Ptr is access all Flag_Word3;
305 function To_Flag_Word3 is new
306 Unchecked_Conversion (Union_Id, Flag_Word3);
308 function To_Flag_Word3_Ptr is new
309 Unchecked_Conversion (Union_Id_Ptr, Flag_Word3_Ptr);
311 -- The following declarations are used to store flags 184-215 in the
312 -- Field11 field of the fifth component of an extended (entity) node.
314 type Flag_Word4 is record
315 Flag184 : Boolean;
316 Flag185 : Boolean;
317 Flag186 : Boolean;
318 Flag187 : Boolean;
319 Flag188 : Boolean;
320 Flag189 : Boolean;
321 Flag190 : Boolean;
322 Flag191 : Boolean;
324 Flag192 : Boolean;
325 Flag193 : Boolean;
326 Flag194 : Boolean;
327 Flag195 : Boolean;
328 Flag196 : Boolean;
329 Flag197 : Boolean;
330 Flag198 : Boolean;
331 Flag199 : Boolean;
333 Flag200 : Boolean;
334 Flag201 : Boolean;
335 Flag202 : Boolean;
336 Flag203 : Boolean;
337 Flag204 : Boolean;
338 Flag205 : Boolean;
339 Flag206 : Boolean;
340 Flag207 : Boolean;
342 Flag208 : Boolean;
343 Flag209 : Boolean;
344 Flag210 : Boolean;
345 Flag211 : Boolean;
346 Flag212 : Boolean;
347 Flag213 : Boolean;
348 Flag214 : Boolean;
349 Flag215 : Boolean;
350 end record;
352 pragma Pack (Flag_Word4);
353 for Flag_Word4'Size use 32;
354 for Flag_Word4'Alignment use 4;
356 type Flag_Word4_Ptr is access all Flag_Word4;
358 function To_Flag_Word4 is new
359 Unchecked_Conversion (Union_Id, Flag_Word4);
361 function To_Flag_Word4_Ptr is new
362 Unchecked_Conversion (Union_Id_Ptr, Flag_Word4_Ptr);
364 -- The following declarations are used to store flags 216-247 in the
365 -- Field12 field of the fifth component of an extended (entity) node.
367 type Flag_Word5 is record
368 Flag216 : Boolean;
369 Flag217 : Boolean;
370 Flag218 : Boolean;
371 Flag219 : Boolean;
372 Flag220 : Boolean;
373 Flag221 : Boolean;
374 Flag222 : Boolean;
375 Flag223 : Boolean;
377 Flag224 : Boolean;
378 Flag225 : Boolean;
379 Flag226 : Boolean;
380 Flag227 : Boolean;
381 Flag228 : Boolean;
382 Flag229 : Boolean;
383 Flag230 : Boolean;
384 Flag231 : Boolean;
386 Flag232 : Boolean;
387 Flag233 : Boolean;
388 Flag234 : Boolean;
389 Flag235 : Boolean;
390 Flag236 : Boolean;
391 Flag237 : Boolean;
392 Flag238 : Boolean;
393 Flag239 : Boolean;
395 Flag240 : Boolean;
396 Flag241 : Boolean;
397 Flag242 : Boolean;
398 Flag243 : Boolean;
399 Flag244 : Boolean;
400 Flag245 : Boolean;
401 Flag246 : Boolean;
402 Flag247 : Boolean;
403 end record;
405 pragma Pack (Flag_Word5);
406 for Flag_Word5'Size use 32;
407 for Flag_Word5'Alignment use 4;
409 type Flag_Word5_Ptr is access all Flag_Word5;
411 function To_Flag_Word5 is new
412 Unchecked_Conversion (Union_Id, Flag_Word5);
414 function To_Flag_Word5_Ptr is new
415 Unchecked_Conversion (Union_Id_Ptr, Flag_Word5_Ptr);
417 --------------------------------------------------
418 -- Implementation of Tree Substitution Routines --
419 --------------------------------------------------
421 -- A separate table keeps track of the mapping between rewritten nodes
422 -- and their corresponding original tree nodes. Rewrite makes an entry
423 -- in this table for use by Original_Node. By default, if no call is
424 -- Rewrite, the entry in this table points to the original unwritten node.
426 -- Note: eventually, this should be a field in the Node directly, but
427 -- for now we do not want to disturb the efficiency of a power of 2
428 -- for the node size
430 package Orig_Nodes is new Table.Table (
431 Table_Component_Type => Node_Id,
432 Table_Index_Type => Node_Id'Base,
433 Table_Low_Bound => First_Node_Id,
434 Table_Initial => Alloc.Orig_Nodes_Initial,
435 Table_Increment => Alloc.Orig_Nodes_Increment,
436 Table_Name => "Orig_Nodes");
438 --------------------------
439 -- Paren_Count Handling --
440 --------------------------
442 -- As noted in the spec, the paren count in a sub-expression node has
443 -- four possible values 0,1,2, and 3. The value 3 really means 3 or more,
444 -- and we use an auxiliary serially scanned table to record the actual
445 -- count. A serial search is fine, only pathological programs will use
446 -- entries in this table. Normal programs won't use it at all.
448 type Paren_Count_Entry is record
449 Nod : Node_Id;
450 -- The node to which this count applies
452 Count : Nat range 3 .. Nat'Last;
453 -- The count of parentheses, which will be in the indicated range
454 end record;
456 package Paren_Counts is new Table.Table (
457 Table_Component_Type => Paren_Count_Entry,
458 Table_Index_Type => Int,
459 Table_Low_Bound => 0,
460 Table_Initial => 10,
461 Table_Increment => 200,
462 Table_Name => "Paren_Counts");
464 -----------------------
465 -- Local Subprograms --
466 -----------------------
468 procedure Fix_Parents (Ref_Node, Fix_Node : Node_Id);
469 -- Fixup parent pointers for the syntactic children of Fix_Node after
470 -- a copy, setting them to Fix_Node when they pointed to Ref_Node.
472 function Allocate_Initialize_Node
473 (Src : Node_Id;
474 With_Extension : Boolean) return Node_Id;
475 -- Allocate a new node or node extension. If Src is not empty,
476 -- the information for the newly-allocated node is copied from it.
478 ------------------------------
479 -- Allocate_Initialize_Node --
480 ------------------------------
482 function Allocate_Initialize_Node
483 (Src : Node_Id;
484 With_Extension : Boolean) return Node_Id
486 New_Id : Node_Id := Src;
487 Nod : Node_Record := Default_Node;
488 Ext1 : Node_Record := Default_Node_Extension;
489 Ext2 : Node_Record := Default_Node_Extension;
490 Ext3 : Node_Record := Default_Node_Extension;
491 Ext4 : Node_Record := Default_Node_Extension;
493 begin
494 if Present (Src) then
495 Nod := Nodes.Table (Src);
497 if Has_Extension (Src) then
498 Ext1 := Nodes.Table (Src + 1);
499 Ext2 := Nodes.Table (Src + 2);
500 Ext3 := Nodes.Table (Src + 3);
501 Ext4 := Nodes.Table (Src + 4);
502 end if;
503 end if;
505 if not (Present (Src)
506 and then not Has_Extension (Src)
507 and then With_Extension
508 and then Src = Nodes.Last)
509 then
510 -- We are allocating a new node, or extending a node
511 -- other than Nodes.Last.
513 Nodes.Append (Nod);
514 New_Id := Nodes.Last;
515 Orig_Nodes.Append (New_Id);
516 Node_Count := Node_Count + 1;
517 end if;
519 -- Specifically copy Paren_Count to deal with creating new table entry
520 -- if the parentheses count is at the maximum possible value already.
522 if Present (Src) and then Nkind (Src) in N_Subexpr then
523 Set_Paren_Count (New_Id, Paren_Count (Src));
524 end if;
526 -- Set extension nodes if required
528 if With_Extension then
529 Nodes.Append (Ext1);
530 Nodes.Append (Ext2);
531 Nodes.Append (Ext3);
532 Nodes.Append (Ext4);
533 end if;
535 Orig_Nodes.Set_Last (Nodes.Last);
536 Allocate_List_Tables (Nodes.Last);
538 -- Invoke the reporting procedure (if available)
540 if Reporting_Proc /= null then
541 Reporting_Proc.all (Target => New_Id, Source => Src);
542 end if;
544 return New_Id;
545 end Allocate_Initialize_Node;
547 --------------
548 -- Analyzed --
549 --------------
551 function Analyzed (N : Node_Id) return Boolean is
552 begin
553 pragma Assert (N <= Nodes.Last);
554 return Nodes.Table (N).Analyzed;
555 end Analyzed;
557 --------------------------
558 -- Basic_Set_Convention --
559 --------------------------
561 procedure Basic_Set_Convention (E : Entity_Id; Val : Convention_Id) is
562 begin
563 pragma Assert (Nkind (E) in N_Entity);
564 To_Flag_Word_Ptr
565 (Union_Id_Ptr'
566 (Nodes.Table (E + 2).Field12'Unrestricted_Access)).Convention := Val;
567 end Basic_Set_Convention;
569 -----------------
570 -- Change_Node --
571 -----------------
573 procedure Change_Node (N : Node_Id; New_Node_Kind : Node_Kind) is
574 Save_Sloc : constant Source_Ptr := Sloc (N);
575 Save_In_List : constant Boolean := Nodes.Table (N).In_List;
576 Save_Link : constant Union_Id := Nodes.Table (N).Link;
577 Save_CFS : constant Boolean := Nodes.Table (N).Comes_From_Source;
578 Save_Posted : constant Boolean := Nodes.Table (N).Error_Posted;
579 Par_Count : Nat := 0;
581 begin
582 if Nkind (N) in N_Subexpr then
583 Par_Count := Paren_Count (N);
584 end if;
586 Nodes.Table (N) := Default_Node;
587 Nodes.Table (N).Sloc := Save_Sloc;
588 Nodes.Table (N).In_List := Save_In_List;
589 Nodes.Table (N).Link := Save_Link;
590 Nodes.Table (N).Comes_From_Source := Save_CFS;
591 Nodes.Table (N).Nkind := New_Node_Kind;
592 Nodes.Table (N).Error_Posted := Save_Posted;
594 if New_Node_Kind in N_Subexpr then
595 Set_Paren_Count (N, Par_Count);
596 end if;
597 end Change_Node;
599 -----------------------
600 -- Comes_From_Source --
601 -----------------------
603 function Comes_From_Source (N : Node_Id) return Boolean is
604 begin
605 pragma Assert (N <= Nodes.Last);
606 return Nodes.Table (N).Comes_From_Source;
607 end Comes_From_Source;
609 ----------------
610 -- Convention --
611 ----------------
613 function Convention (E : Entity_Id) return Convention_Id is
614 begin
615 pragma Assert (Nkind (E) in N_Entity);
616 return To_Flag_Word (Nodes.Table (E + 2).Field12).Convention;
617 end Convention;
619 ---------------
620 -- Copy_Node --
621 ---------------
623 procedure Copy_Node (Source : Node_Id; Destination : Node_Id) is
624 Save_In_List : constant Boolean := Nodes.Table (Destination).In_List;
625 Save_Link : constant Union_Id := Nodes.Table (Destination).Link;
627 begin
628 Nodes.Table (Destination) := Nodes.Table (Source);
629 Nodes.Table (Destination).In_List := Save_In_List;
630 Nodes.Table (Destination).Link := Save_Link;
632 -- Specifically set Paren_Count to make sure auxiliary table entry
633 -- gets correctly made if the parentheses count is at the max value.
635 if Nkind (Destination) in N_Subexpr then
636 Set_Paren_Count (Destination, Paren_Count (Source));
637 end if;
639 -- Deal with copying extension nodes if present
641 if Has_Extension (Source) then
642 pragma Assert (Has_Extension (Destination));
643 Nodes.Table (Destination + 1) := Nodes.Table (Source + 1);
644 Nodes.Table (Destination + 2) := Nodes.Table (Source + 2);
645 Nodes.Table (Destination + 3) := Nodes.Table (Source + 3);
646 Nodes.Table (Destination + 4) := Nodes.Table (Source + 4);
648 else
649 pragma Assert (not Has_Extension (Source));
650 null;
651 end if;
652 end Copy_Node;
654 ------------------------
655 -- Copy_Separate_Tree --
656 ------------------------
658 function Copy_Separate_Tree (Source : Node_Id) return Node_Id is
659 New_Id : Node_Id;
661 function Copy_Entity (E : Entity_Id) return Entity_Id;
662 -- Copy Entity, copying only the Ekind and Chars fields
664 function Copy_List (List : List_Id) return List_Id;
665 -- Copy list
667 function Possible_Copy (Field : Union_Id) return Union_Id;
668 -- Given a field, returns a copy of the node or list if its parent
669 -- is the current source node, and otherwise returns the input
671 -----------------
672 -- Copy_Entity --
673 -----------------
675 function Copy_Entity (E : Entity_Id) return Entity_Id is
676 New_Ent : Entity_Id;
678 begin
679 case N_Entity (Nkind (E)) is
680 when N_Defining_Identifier =>
681 New_Ent := New_Entity (N_Defining_Identifier, Sloc (E));
683 when N_Defining_Character_Literal =>
684 New_Ent := New_Entity (N_Defining_Character_Literal, Sloc (E));
686 when N_Defining_Operator_Symbol =>
687 New_Ent := New_Entity (N_Defining_Operator_Symbol, Sloc (E));
688 end case;
690 Set_Chars (New_Ent, Chars (E));
691 return New_Ent;
692 end Copy_Entity;
694 ---------------
695 -- Copy_List --
696 ---------------
698 function Copy_List (List : List_Id) return List_Id is
699 NL : List_Id;
700 E : Node_Id;
702 begin
703 if List = No_List then
704 return No_List;
706 else
707 NL := New_List;
709 E := First (List);
710 while Present (E) loop
711 if Has_Extension (E) then
712 Append (Copy_Entity (E), NL);
713 else
714 Append (Copy_Separate_Tree (E), NL);
715 end if;
717 Next (E);
718 end loop;
720 return NL;
721 end if;
722 end Copy_List;
724 -------------------
725 -- Possible_Copy --
726 -------------------
728 function Possible_Copy (Field : Union_Id) return Union_Id is
729 New_N : Union_Id;
731 begin
732 if Field in Node_Range then
733 New_N := Union_Id (Copy_Separate_Tree (Node_Id (Field)));
735 if Parent (Node_Id (Field)) = Source then
736 Set_Parent (Node_Id (New_N), New_Id);
737 end if;
739 return New_N;
741 elsif Field in List_Range then
742 New_N := Union_Id (Copy_List (List_Id (Field)));
744 if Parent (List_Id (Field)) = Source then
745 Set_Parent (List_Id (New_N), New_Id);
746 end if;
748 return New_N;
750 else
751 return Field;
752 end if;
753 end Possible_Copy;
755 -- Start of processing for Copy_Separate_Tree
757 begin
758 if Source <= Empty_Or_Error then
759 return Source;
761 elsif Has_Extension (Source) then
762 return Copy_Entity (Source);
764 else
765 New_Id := New_Copy (Source);
767 -- Recursively copy descendents
769 Set_Field1 (New_Id, Possible_Copy (Field1 (New_Id)));
770 Set_Field2 (New_Id, Possible_Copy (Field2 (New_Id)));
771 Set_Field3 (New_Id, Possible_Copy (Field3 (New_Id)));
772 Set_Field4 (New_Id, Possible_Copy (Field4 (New_Id)));
773 Set_Field5 (New_Id, Possible_Copy (Field5 (New_Id)));
775 -- Set Entity field to Empty
776 -- Why is this done??? and why is it always right to do it???
778 if Nkind (New_Id) in N_Has_Entity
779 or else Nkind (New_Id) = N_Freeze_Entity
780 then
781 Set_Entity (New_Id, Empty);
782 end if;
784 -- All done, return copied node
786 return New_Id;
787 end if;
788 end Copy_Separate_Tree;
790 -----------
791 -- Ekind --
792 -----------
794 function Ekind (E : Entity_Id) return Entity_Kind is
795 begin
796 pragma Assert (Nkind (E) in N_Entity);
797 return N_To_E (Nodes.Table (E + 1).Nkind);
798 end Ekind;
800 --------------
801 -- Ekind_In --
802 --------------
804 function Ekind_In
805 (T : Entity_Kind;
806 V1 : Entity_Kind;
807 V2 : Entity_Kind) return Boolean
809 begin
810 return T = V1 or else
811 T = V2;
812 end Ekind_In;
814 function Ekind_In
815 (T : Entity_Kind;
816 V1 : Entity_Kind;
817 V2 : Entity_Kind;
818 V3 : Entity_Kind) return Boolean
820 begin
821 return T = V1 or else
822 T = V2 or else
823 T = V3;
824 end Ekind_In;
826 function Ekind_In
827 (T : Entity_Kind;
828 V1 : Entity_Kind;
829 V2 : Entity_Kind;
830 V3 : Entity_Kind;
831 V4 : Entity_Kind) return Boolean
833 begin
834 return T = V1 or else
835 T = V2 or else
836 T = V3 or else
837 T = V4;
838 end Ekind_In;
840 function Ekind_In
841 (T : Entity_Kind;
842 V1 : Entity_Kind;
843 V2 : Entity_Kind;
844 V3 : Entity_Kind;
845 V4 : Entity_Kind;
846 V5 : Entity_Kind) return Boolean
848 begin
849 return T = V1 or else
850 T = V2 or else
851 T = V3 or else
852 T = V4 or else
853 T = V5;
854 end Ekind_In;
856 function Ekind_In
857 (T : Entity_Kind;
858 V1 : Entity_Kind;
859 V2 : Entity_Kind;
860 V3 : Entity_Kind;
861 V4 : Entity_Kind;
862 V5 : Entity_Kind;
863 V6 : Entity_Kind) return Boolean
865 begin
866 return T = V1 or else
867 T = V2 or else
868 T = V3 or else
869 T = V4 or else
870 T = V5 or else
871 T = V6;
872 end Ekind_In;
874 function Ekind_In
875 (E : Entity_Id;
876 V1 : Entity_Kind;
877 V2 : Entity_Kind) return Boolean
879 begin
880 return Ekind_In (Ekind (E), V1, V2);
881 end Ekind_In;
883 function Ekind_In
884 (E : Entity_Id;
885 V1 : Entity_Kind;
886 V2 : Entity_Kind;
887 V3 : Entity_Kind) return Boolean
889 begin
890 return Ekind_In (Ekind (E), V1, V2, V3);
891 end Ekind_In;
893 function Ekind_In
894 (E : Entity_Id;
895 V1 : Entity_Kind;
896 V2 : Entity_Kind;
897 V3 : Entity_Kind;
898 V4 : Entity_Kind) return Boolean
900 begin
901 return Ekind_In (Ekind (E), V1, V2, V3, V4);
902 end Ekind_In;
904 function Ekind_In
905 (E : Entity_Id;
906 V1 : Entity_Kind;
907 V2 : Entity_Kind;
908 V3 : Entity_Kind;
909 V4 : Entity_Kind;
910 V5 : Entity_Kind) return Boolean
912 begin
913 return Ekind_In (Ekind (E), V1, V2, V3, V4, V5);
914 end Ekind_In;
916 function Ekind_In
917 (E : Entity_Id;
918 V1 : Entity_Kind;
919 V2 : Entity_Kind;
920 V3 : Entity_Kind;
921 V4 : Entity_Kind;
922 V5 : Entity_Kind;
923 V6 : Entity_Kind) return Boolean
925 begin
926 return Ekind_In (Ekind (E), V1, V2, V3, V4, V5, V6);
927 end Ekind_In;
929 ------------------------
930 -- Set_Reporting_Proc --
931 ------------------------
933 procedure Set_Reporting_Proc (P : Report_Proc) is
934 begin
935 pragma Assert (Reporting_Proc = null);
936 Reporting_Proc := P;
937 end Set_Reporting_Proc;
939 ------------------
940 -- Error_Posted --
941 ------------------
943 function Error_Posted (N : Node_Id) return Boolean is
944 begin
945 pragma Assert (N <= Nodes.Last);
946 return Nodes.Table (N).Error_Posted;
947 end Error_Posted;
949 -----------------------
950 -- Exchange_Entities --
951 -----------------------
953 procedure Exchange_Entities (E1 : Entity_Id; E2 : Entity_Id) is
954 Temp_Ent : Node_Record;
956 begin
957 pragma Assert (Has_Extension (E1)
958 and then Has_Extension (E2)
959 and then not Nodes.Table (E1).In_List
960 and then not Nodes.Table (E2).In_List);
962 -- Exchange the contents of the two entities
964 Temp_Ent := Nodes.Table (E1);
965 Nodes.Table (E1) := Nodes.Table (E2);
966 Nodes.Table (E2) := Temp_Ent;
967 Temp_Ent := Nodes.Table (E1 + 1);
968 Nodes.Table (E1 + 1) := Nodes.Table (E2 + 1);
969 Nodes.Table (E2 + 1) := Temp_Ent;
970 Temp_Ent := Nodes.Table (E1 + 2);
971 Nodes.Table (E1 + 2) := Nodes.Table (E2 + 2);
972 Nodes.Table (E2 + 2) := Temp_Ent;
973 Temp_Ent := Nodes.Table (E1 + 3);
974 Nodes.Table (E1 + 3) := Nodes.Table (E2 + 3);
975 Nodes.Table (E2 + 3) := Temp_Ent;
976 Temp_Ent := Nodes.Table (E1 + 4);
977 Nodes.Table (E1 + 4) := Nodes.Table (E2 + 4);
978 Nodes.Table (E2 + 4) := Temp_Ent;
980 -- That exchange exchanged the parent pointers as well, which is what
981 -- we want, but we need to patch up the defining identifier pointers
982 -- in the parent nodes (the child pointers) to match this switch
983 -- unless for Implicit types entities which have no parent, in which
984 -- case we don't do anything otherwise we won't be able to revert back
985 -- to the original situation.
987 -- Shouldn't this use Is_Itype instead of the Parent test
989 if Present (Parent (E1)) and then Present (Parent (E2)) then
990 Set_Defining_Identifier (Parent (E1), E1);
991 Set_Defining_Identifier (Parent (E2), E2);
992 end if;
993 end Exchange_Entities;
995 -----------------
996 -- Extend_Node --
997 -----------------
999 function Extend_Node (Node : Node_Id) return Entity_Id is
1000 Result : Entity_Id;
1002 procedure Debug_Extend_Node;
1003 pragma Inline (Debug_Extend_Node);
1004 -- Debug routine for debug flag N
1006 -----------------------
1007 -- Debug_Extend_Node --
1008 -----------------------
1010 procedure Debug_Extend_Node is
1011 begin
1012 if Debug_Flag_N then
1013 Write_Str ("Extend node ");
1014 Write_Int (Int (Node));
1016 if Result = Node then
1017 Write_Str (" in place");
1018 else
1019 Write_Str (" copied to ");
1020 Write_Int (Int (Result));
1021 end if;
1023 -- Write_Eol;
1024 end if;
1025 end Debug_Extend_Node;
1027 -- Start of processing for Extend_Node
1029 begin
1030 pragma Assert (not (Has_Extension (Node)));
1031 Result := Allocate_Initialize_Node (Node, With_Extension => True);
1032 pragma Debug (Debug_Extend_Node);
1033 return Result;
1034 end Extend_Node;
1036 -----------------
1037 -- Fix_Parents --
1038 -----------------
1040 procedure Fix_Parents (Ref_Node, Fix_Node : Node_Id) is
1042 procedure Fix_Parent (Field : Union_Id);
1043 -- Fixup one parent pointer. Field is checked to see if it points to
1044 -- a node, list, or element list that has a parent that points to
1045 -- Ref_Node. If so, the parent is reset to point to Fix_Node.
1047 ----------------
1048 -- Fix_Parent --
1049 ----------------
1051 procedure Fix_Parent (Field : Union_Id) is
1052 begin
1053 -- Fix parent of node that is referenced by Field. Note that we must
1054 -- exclude the case where the node is a member of a list, because in
1055 -- this case the parent is the parent of the list.
1057 if Field in Node_Range
1058 and then Present (Node_Id (Field))
1059 and then not Nodes.Table (Node_Id (Field)).In_List
1060 and then Parent (Node_Id (Field)) = Ref_Node
1061 then
1062 Set_Parent (Node_Id (Field), Fix_Node);
1064 -- Fix parent of list that is referenced by Field
1066 elsif Field in List_Range
1067 and then Present (List_Id (Field))
1068 and then Parent (List_Id (Field)) = Ref_Node
1069 then
1070 Set_Parent (List_Id (Field), Fix_Node);
1071 end if;
1072 end Fix_Parent;
1074 -- Start of processing for Fix_Parents
1076 begin
1077 Fix_Parent (Field1 (Fix_Node));
1078 Fix_Parent (Field2 (Fix_Node));
1079 Fix_Parent (Field3 (Fix_Node));
1080 Fix_Parent (Field4 (Fix_Node));
1081 Fix_Parent (Field5 (Fix_Node));
1082 end Fix_Parents;
1084 -----------------------------------
1085 -- Get_Comes_From_Source_Default --
1086 -----------------------------------
1088 function Get_Comes_From_Source_Default return Boolean is
1089 begin
1090 return Default_Node.Comes_From_Source;
1091 end Get_Comes_From_Source_Default;
1093 -------------------
1094 -- Has_Extension --
1095 -------------------
1097 function Has_Extension (N : Node_Id) return Boolean is
1098 begin
1099 return N < Nodes.Last and then Nodes.Table (N + 1).Is_Extension;
1100 end Has_Extension;
1102 ----------------
1103 -- Initialize --
1104 ----------------
1106 procedure Initialize is
1107 Dummy : Node_Id;
1108 pragma Warnings (Off, Dummy);
1110 begin
1111 Node_Count := 0;
1112 Atree_Private_Part.Nodes.Init;
1113 Orig_Nodes.Init;
1114 Paren_Counts.Init;
1116 -- Allocate Empty node
1118 Dummy := New_Node (N_Empty, No_Location);
1119 Set_Name1 (Empty, No_Name);
1121 -- Allocate Error node, and set Error_Posted, since we certainly
1122 -- only generate an Error node if we do post some kind of error!
1124 Dummy := New_Node (N_Error, No_Location);
1125 Set_Name1 (Error, Error_Name);
1126 Set_Error_Posted (Error, True);
1127 end Initialize;
1129 --------------------------
1130 -- Is_Rewrite_Insertion --
1131 --------------------------
1133 function Is_Rewrite_Insertion (Node : Node_Id) return Boolean is
1134 begin
1135 return Nodes.Table (Node).Rewrite_Ins;
1136 end Is_Rewrite_Insertion;
1138 -----------------------------
1139 -- Is_Rewrite_Substitution --
1140 -----------------------------
1142 function Is_Rewrite_Substitution (Node : Node_Id) return Boolean is
1143 begin
1144 return Orig_Nodes.Table (Node) /= Node;
1145 end Is_Rewrite_Substitution;
1147 ------------------
1148 -- Last_Node_Id --
1149 ------------------
1151 function Last_Node_Id return Node_Id is
1152 begin
1153 return Nodes.Last;
1154 end Last_Node_Id;
1156 ----------
1157 -- Lock --
1158 ----------
1160 procedure Lock is
1161 begin
1162 Nodes.Locked := True;
1163 Orig_Nodes.Locked := True;
1164 Nodes.Release;
1165 Orig_Nodes.Release;
1166 end Lock;
1168 ----------------------------
1169 -- Mark_Rewrite_Insertion --
1170 ----------------------------
1172 procedure Mark_Rewrite_Insertion (New_Node : Node_Id) is
1173 begin
1174 Nodes.Table (New_Node).Rewrite_Ins := True;
1175 end Mark_Rewrite_Insertion;
1177 --------------
1178 -- New_Copy --
1179 --------------
1181 function New_Copy (Source : Node_Id) return Node_Id is
1182 New_Id : Node_Id := Source;
1184 begin
1185 if Source > Empty_Or_Error then
1187 New_Id := Allocate_Initialize_Node (Source, Has_Extension (Source));
1189 Nodes.Table (New_Id).Link := Empty_List_Or_Node;
1190 Nodes.Table (New_Id).In_List := False;
1192 -- If the original is marked as a rewrite insertion, then unmark
1193 -- the copy, since we inserted the original, not the copy.
1195 Nodes.Table (New_Id).Rewrite_Ins := False;
1196 pragma Debug (New_Node_Debugging_Output (New_Id));
1197 end if;
1199 return New_Id;
1200 end New_Copy;
1202 ----------------
1203 -- New_Entity --
1204 ----------------
1206 function New_Entity
1207 (New_Node_Kind : Node_Kind;
1208 New_Sloc : Source_Ptr) return Entity_Id
1210 Ent : Entity_Id;
1212 begin
1213 pragma Assert (New_Node_Kind in N_Entity);
1215 Ent := Allocate_Initialize_Node (Empty, With_Extension => True);
1217 -- If this is a node with a real location and we are generating
1218 -- source nodes, then reset Current_Error_Node. This is useful
1219 -- if we bomb during parsing to get a error location for the bomb.
1221 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
1222 Current_Error_Node := Ent;
1223 end if;
1225 Nodes.Table (Ent).Nkind := New_Node_Kind;
1226 Nodes.Table (Ent).Sloc := New_Sloc;
1227 pragma Debug (New_Node_Debugging_Output (Ent));
1229 return Ent;
1230 end New_Entity;
1232 --------------
1233 -- New_Node --
1234 --------------
1236 function New_Node
1237 (New_Node_Kind : Node_Kind;
1238 New_Sloc : Source_Ptr) return Node_Id
1240 Nod : Node_Id;
1242 begin
1243 pragma Assert (New_Node_Kind not in N_Entity);
1244 Nod := Allocate_Initialize_Node (Empty, With_Extension => False);
1245 Nodes.Table (Nod).Nkind := New_Node_Kind;
1246 Nodes.Table (Nod).Sloc := New_Sloc;
1247 pragma Debug (New_Node_Debugging_Output (Nod));
1249 -- If this is a node with a real location and we are generating source
1250 -- nodes, then reset Current_Error_Node. This is useful if we bomb
1251 -- during parsing to get an error location for the bomb.
1253 if Default_Node.Comes_From_Source and then New_Sloc > No_Location then
1254 Current_Error_Node := Nod;
1255 end if;
1257 return Nod;
1258 end New_Node;
1260 -------------------------
1261 -- New_Node_Breakpoint --
1262 -------------------------
1264 procedure nn is -- New_Node_Breakpoint
1265 begin
1266 Write_Str ("Watched node ");
1267 Write_Int (Int (Watch_Node));
1268 Write_Str (" created");
1269 Write_Eol;
1270 end nn;
1272 -------------------------------
1273 -- New_Node_Debugging_Output --
1274 -------------------------------
1276 procedure nnd (N : Node_Id) is -- New_Node_Debugging_Output
1277 Node_Is_Watched : constant Boolean := N = Watch_Node;
1279 begin
1280 if Debug_Flag_N or else Node_Is_Watched then
1281 Node_Debug_Output ("Allocate", N);
1283 if Node_Is_Watched then
1284 New_Node_Breakpoint;
1285 end if;
1286 end if;
1287 end nnd;
1289 -----------
1290 -- Nkind --
1291 -----------
1293 function Nkind (N : Node_Id) return Node_Kind is
1294 begin
1295 return Nodes.Table (N).Nkind;
1296 end Nkind;
1298 --------------
1299 -- Nkind_In --
1300 --------------
1302 function Nkind_In
1303 (N : Node_Id;
1304 V1 : Node_Kind;
1305 V2 : Node_Kind) return Boolean
1307 begin
1308 return Nkind_In (Nkind (N), V1, V2);
1309 end Nkind_In;
1311 function Nkind_In
1312 (N : Node_Id;
1313 V1 : Node_Kind;
1314 V2 : Node_Kind;
1315 V3 : Node_Kind) return Boolean
1317 begin
1318 return Nkind_In (Nkind (N), V1, V2, V3);
1319 end Nkind_In;
1321 function Nkind_In
1322 (N : Node_Id;
1323 V1 : Node_Kind;
1324 V2 : Node_Kind;
1325 V3 : Node_Kind;
1326 V4 : Node_Kind) return Boolean
1328 begin
1329 return Nkind_In (Nkind (N), V1, V2, V3, V4);
1330 end Nkind_In;
1332 function Nkind_In
1333 (N : Node_Id;
1334 V1 : Node_Kind;
1335 V2 : Node_Kind;
1336 V3 : Node_Kind;
1337 V4 : Node_Kind;
1338 V5 : Node_Kind) return Boolean
1340 begin
1341 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5);
1342 end Nkind_In;
1344 function Nkind_In
1345 (N : Node_Id;
1346 V1 : Node_Kind;
1347 V2 : Node_Kind;
1348 V3 : Node_Kind;
1349 V4 : Node_Kind;
1350 V5 : Node_Kind;
1351 V6 : Node_Kind) return Boolean
1353 begin
1354 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6);
1355 end Nkind_In;
1357 function Nkind_In
1358 (N : Node_Id;
1359 V1 : Node_Kind;
1360 V2 : Node_Kind;
1361 V3 : Node_Kind;
1362 V4 : Node_Kind;
1363 V5 : Node_Kind;
1364 V6 : Node_Kind;
1365 V7 : Node_Kind) return Boolean
1367 begin
1368 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7);
1369 end Nkind_In;
1371 function Nkind_In
1372 (N : Node_Id;
1373 V1 : Node_Kind;
1374 V2 : Node_Kind;
1375 V3 : Node_Kind;
1376 V4 : Node_Kind;
1377 V5 : Node_Kind;
1378 V6 : Node_Kind;
1379 V7 : Node_Kind;
1380 V8 : Node_Kind) return Boolean
1382 begin
1383 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8);
1384 end Nkind_In;
1386 function Nkind_In
1387 (N : Node_Id;
1388 V1 : Node_Kind;
1389 V2 : Node_Kind;
1390 V3 : Node_Kind;
1391 V4 : Node_Kind;
1392 V5 : Node_Kind;
1393 V6 : Node_Kind;
1394 V7 : Node_Kind;
1395 V8 : Node_Kind;
1396 V9 : Node_Kind) return Boolean
1398 begin
1399 return Nkind_In (Nkind (N), V1, V2, V3, V4, V5, V6, V7, V8, V9);
1400 end Nkind_In;
1402 --------
1403 -- No --
1404 --------
1406 function No (N : Node_Id) return Boolean is
1407 begin
1408 return N = Empty;
1409 end No;
1411 -----------------------
1412 -- Node_Debug_Output --
1413 -----------------------
1415 procedure Node_Debug_Output (Op : String; N : Node_Id) is
1416 begin
1417 Write_Str (Op);
1419 if Nkind (N) in N_Entity then
1420 Write_Str (" entity");
1421 else
1422 Write_Str (" node");
1423 end if;
1425 Write_Str (" Id = ");
1426 Write_Int (Int (N));
1427 Write_Str (" ");
1428 Write_Location (Sloc (N));
1429 Write_Str (" ");
1430 Write_Str (Node_Kind'Image (Nkind (N)));
1431 Write_Eol;
1432 end Node_Debug_Output;
1434 -------------------
1435 -- Nodes_Address --
1436 -------------------
1438 function Nodes_Address return System.Address is
1439 begin
1440 return Nodes.Table (First_Node_Id)'Address;
1441 end Nodes_Address;
1443 ---------------
1444 -- Num_Nodes --
1445 ---------------
1447 function Num_Nodes return Nat is
1448 begin
1449 return Node_Count;
1450 end Num_Nodes;
1452 -------------------
1453 -- Original_Node --
1454 -------------------
1456 function Original_Node (Node : Node_Id) return Node_Id is
1457 begin
1458 return Orig_Nodes.Table (Node);
1459 end Original_Node;
1461 -----------------
1462 -- Paren_Count --
1463 -----------------
1465 function Paren_Count (N : Node_Id) return Nat is
1466 C : Nat := 0;
1468 begin
1469 pragma Assert (N <= Nodes.Last);
1471 if Nodes.Table (N).Pflag1 then
1472 C := C + 1;
1473 end if;
1475 if Nodes.Table (N).Pflag2 then
1476 C := C + 2;
1477 end if;
1479 -- Value of 0,1,2 returned as is
1481 if C <= 2 then
1482 return C;
1484 -- Value of 3 means we search the table, and we must find an entry
1486 else
1487 for J in Paren_Counts.First .. Paren_Counts.Last loop
1488 if N = Paren_Counts.Table (J).Nod then
1489 return Paren_Counts.Table (J).Count;
1490 end if;
1491 end loop;
1493 raise Program_Error;
1494 end if;
1495 end Paren_Count;
1497 ------------
1498 -- Parent --
1499 ------------
1501 function Parent (N : Node_Id) return Node_Id is
1502 begin
1503 if Is_List_Member (N) then
1504 return Parent (List_Containing (N));
1505 else
1506 return Node_Id (Nodes.Table (N).Link);
1507 end if;
1508 end Parent;
1510 -------------
1511 -- Present --
1512 -------------
1514 function Present (N : Node_Id) return Boolean is
1515 begin
1516 return N /= Empty;
1517 end Present;
1519 --------------------------------
1520 -- Preserve_Comes_From_Source --
1521 --------------------------------
1523 procedure Preserve_Comes_From_Source (NewN, OldN : Node_Id) is
1524 begin
1525 Nodes.Table (NewN).Comes_From_Source :=
1526 Nodes.Table (OldN).Comes_From_Source;
1527 end Preserve_Comes_From_Source;
1529 -------------------
1530 -- Relocate_Node --
1531 -------------------
1533 function Relocate_Node (Source : Node_Id) return Node_Id is
1534 New_Node : Node_Id;
1536 begin
1537 if No (Source) then
1538 return Empty;
1539 end if;
1541 New_Node := New_Copy (Source);
1542 Fix_Parents (Ref_Node => Source, Fix_Node => New_Node);
1544 -- We now set the parent of the new node to be the same as the
1545 -- parent of the source. Almost always this parent will be
1546 -- replaced by a new value when the relocated node is reattached
1547 -- to the tree, but by doing it now, we ensure that this node is
1548 -- not even temporarily disconnected from the tree. Note that this
1549 -- does not happen free, because in the list case, the parent does
1550 -- not get set.
1552 Set_Parent (New_Node, Parent (Source));
1554 -- If the node being relocated was a rewriting of some original
1555 -- node, then the relocated node has the same original node.
1557 if Orig_Nodes.Table (Source) /= Source then
1558 Orig_Nodes.Table (New_Node) := Orig_Nodes.Table (Source);
1559 end if;
1561 return New_Node;
1562 end Relocate_Node;
1564 -------------
1565 -- Replace --
1566 -------------
1568 procedure Replace (Old_Node, New_Node : Node_Id) is
1569 Old_Post : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
1570 Old_CFS : constant Boolean := Nodes.Table (Old_Node).Comes_From_Source;
1572 begin
1573 pragma Assert
1574 (not Has_Extension (Old_Node)
1575 and not Has_Extension (New_Node)
1576 and not Nodes.Table (New_Node).In_List);
1578 -- Do copy, preserving link and in list status and comes from source
1580 Copy_Node (Source => New_Node, Destination => Old_Node);
1581 Nodes.Table (Old_Node).Comes_From_Source := Old_CFS;
1582 Nodes.Table (Old_Node).Error_Posted := Old_Post;
1584 -- Fix parents of substituted node, since it has changed identity
1586 Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
1588 -- Since we are doing a replace, we assume that the original node
1589 -- is intended to become the new replaced node. The call would be
1590 -- to Rewrite if there were an intention to save the original node.
1592 Orig_Nodes.Table (Old_Node) := Old_Node;
1594 -- Invoke the reporting procedure (if available)
1596 if Reporting_Proc /= null then
1597 Reporting_Proc.all (Target => Old_Node, Source => New_Node);
1598 end if;
1599 end Replace;
1601 -------------
1602 -- Rewrite --
1603 -------------
1605 procedure Rewrite (Old_Node, New_Node : Node_Id) is
1606 Old_Error_P : constant Boolean := Nodes.Table (Old_Node).Error_Posted;
1607 -- This fields is always preserved in the new node
1609 Old_Paren_Count : Nat;
1610 Old_Must_Not_Freeze : Boolean;
1611 -- These fields are preserved in the new node only if the new node
1612 -- and the old node are both subexpression nodes.
1614 -- Note: it is a violation of abstraction levels for Must_Not_Freeze
1615 -- to be referenced like this. ???
1617 Sav_Node : Node_Id;
1619 begin
1620 pragma Assert
1621 (not Has_Extension (Old_Node)
1622 and not Has_Extension (New_Node)
1623 and not Nodes.Table (New_Node).In_List);
1624 pragma Debug (Rewrite_Debugging_Output (Old_Node, New_Node));
1626 if Nkind (Old_Node) in N_Subexpr then
1627 Old_Paren_Count := Paren_Count (Old_Node);
1628 Old_Must_Not_Freeze := Must_Not_Freeze (Old_Node);
1629 else
1630 Old_Paren_Count := 0;
1631 Old_Must_Not_Freeze := False;
1632 end if;
1634 -- Allocate a new node, to be used to preserve the original contents
1635 -- of the Old_Node, for possible later retrival by Original_Node and
1636 -- make an entry in the Orig_Nodes table. This is only done if we have
1637 -- not already rewritten the node, as indicated by an Orig_Nodes entry
1638 -- that does not reference the Old_Node.
1640 if Orig_Nodes.Table (Old_Node) = Old_Node then
1641 Sav_Node := New_Copy (Old_Node);
1642 Orig_Nodes.Table (Sav_Node) := Sav_Node;
1643 Orig_Nodes.Table (Old_Node) := Sav_Node;
1644 end if;
1646 -- Copy substitute node into place, preserving old fields as required
1648 Copy_Node (Source => New_Node, Destination => Old_Node);
1649 Nodes.Table (Old_Node).Error_Posted := Old_Error_P;
1651 if Nkind (New_Node) in N_Subexpr then
1652 Set_Paren_Count (Old_Node, Old_Paren_Count);
1653 Set_Must_Not_Freeze (Old_Node, Old_Must_Not_Freeze);
1654 end if;
1656 Fix_Parents (Ref_Node => New_Node, Fix_Node => Old_Node);
1658 -- Invoke the reporting procedure (if available)
1660 if Reporting_Proc /= null then
1661 Reporting_Proc.all (Target => Old_Node, Source => New_Node);
1662 end if;
1663 end Rewrite;
1665 -------------------------
1666 -- Rewrite_Breakpoint --
1667 -------------------------
1669 procedure rr is -- Rewrite_Breakpoint
1670 begin
1671 Write_Str ("Watched node ");
1672 Write_Int (Int (Watch_Node));
1673 Write_Str (" rewritten");
1674 Write_Eol;
1675 end rr;
1677 ------------------------------
1678 -- Rewrite_Debugging_Output --
1679 ------------------------------
1681 procedure rrd (Old_Node, New_Node : Node_Id) is -- Rewrite_Debugging_Output
1682 Node_Is_Watched : constant Boolean := Old_Node = Watch_Node;
1684 begin
1685 if Debug_Flag_N or else Node_Is_Watched then
1686 Node_Debug_Output ("Rewrite", Old_Node);
1687 Node_Debug_Output ("into", New_Node);
1689 if Node_Is_Watched then
1690 Rewrite_Breakpoint;
1691 end if;
1692 end if;
1693 end rrd;
1695 ------------------
1696 -- Set_Analyzed --
1697 ------------------
1699 procedure Set_Analyzed (N : Node_Id; Val : Boolean := True) is
1700 begin
1701 Nodes.Table (N).Analyzed := Val;
1702 end Set_Analyzed;
1704 ---------------------------
1705 -- Set_Comes_From_Source --
1706 ---------------------------
1708 procedure Set_Comes_From_Source (N : Node_Id; Val : Boolean) is
1709 begin
1710 pragma Assert (N <= Nodes.Last);
1711 Nodes.Table (N).Comes_From_Source := Val;
1712 end Set_Comes_From_Source;
1714 -----------------------------------
1715 -- Set_Comes_From_Source_Default --
1716 -----------------------------------
1718 procedure Set_Comes_From_Source_Default (Default : Boolean) is
1719 begin
1720 Default_Node.Comes_From_Source := Default;
1721 end Set_Comes_From_Source_Default;
1723 ---------------
1724 -- Set_Ekind --
1725 ---------------
1727 procedure Set_Ekind (E : Entity_Id; Val : Entity_Kind) is
1728 begin
1729 pragma Assert (Nkind (E) in N_Entity);
1730 Nodes.Table (E + 1).Nkind := E_To_N (Val);
1731 end Set_Ekind;
1733 ----------------------
1734 -- Set_Error_Posted --
1735 ----------------------
1737 procedure Set_Error_Posted (N : Node_Id; Val : Boolean := True) is
1738 begin
1739 Nodes.Table (N).Error_Posted := Val;
1740 end Set_Error_Posted;
1742 ---------------------
1743 -- Set_Paren_Count --
1744 ---------------------
1746 procedure Set_Paren_Count (N : Node_Id; Val : Nat) is
1747 begin
1748 pragma Assert (Nkind (N) in N_Subexpr);
1750 -- Value of 0,1,2 stored as is
1752 if Val <= 2 then
1753 Nodes.Table (N).Pflag1 := (Val mod 2 /= 0);
1754 Nodes.Table (N).Pflag2 := (Val = 2);
1756 -- Value of 3 or greater stores 3 in node and makes table entry
1758 else
1759 Nodes.Table (N).Pflag1 := True;
1760 Nodes.Table (N).Pflag2 := True;
1762 for J in Paren_Counts.First .. Paren_Counts.Last loop
1763 if N = Paren_Counts.Table (J).Nod then
1764 Paren_Counts.Table (J).Count := Val;
1765 return;
1766 end if;
1767 end loop;
1769 Paren_Counts.Append ((Nod => N, Count => Val));
1770 end if;
1771 end Set_Paren_Count;
1773 ----------------
1774 -- Set_Parent --
1775 ----------------
1777 procedure Set_Parent (N : Node_Id; Val : Node_Id) is
1778 begin
1779 pragma Assert (not Nodes.Table (N).In_List);
1780 Nodes.Table (N).Link := Union_Id (Val);
1781 end Set_Parent;
1783 --------------
1784 -- Set_Sloc --
1785 --------------
1787 procedure Set_Sloc (N : Node_Id; Val : Source_Ptr) is
1788 begin
1789 Nodes.Table (N).Sloc := Val;
1790 end Set_Sloc;
1792 ----------
1793 -- Sloc --
1794 ----------
1796 function Sloc (N : Node_Id) return Source_Ptr is
1797 begin
1798 return Nodes.Table (N).Sloc;
1799 end Sloc;
1801 -------------------
1802 -- Traverse_Func --
1803 -------------------
1805 function Traverse_Func (Node : Node_Id) return Traverse_Final_Result is
1807 function Traverse_Field
1808 (Nod : Node_Id;
1809 Fld : Union_Id;
1810 FN : Field_Num) return Traverse_Final_Result;
1811 -- Fld is one of the fields of Nod. If the field points to syntactic
1812 -- node or list, then this node or list is traversed, and the result is
1813 -- the result of this traversal. Otherwise a value of True is returned
1814 -- with no processing. FN is the number of the field (1 .. 5).
1816 --------------------
1817 -- Traverse_Field --
1818 --------------------
1820 function Traverse_Field
1821 (Nod : Node_Id;
1822 Fld : Union_Id;
1823 FN : Field_Num) return Traverse_Final_Result
1825 begin
1826 if Fld = Union_Id (Empty) then
1827 return OK;
1829 -- Descendent is a node
1831 elsif Fld in Node_Range then
1833 -- Traverse descendent that is syntactic subtree node
1835 if Is_Syntactic_Field (Nkind (Nod), FN) then
1836 return Traverse_Func (Node_Id (Fld));
1838 -- Node that is not a syntactic subtree
1840 else
1841 return OK;
1842 end if;
1844 -- Descendent is a list
1846 elsif Fld in List_Range then
1848 -- Traverse descendent that is a syntactic subtree list
1850 if Is_Syntactic_Field (Nkind (Nod), FN) then
1851 declare
1852 Elmt : Node_Id := First (List_Id (Fld));
1853 begin
1854 while Present (Elmt) loop
1855 if Traverse_Func (Elmt) = Abandon then
1856 return Abandon;
1857 else
1858 Next (Elmt);
1859 end if;
1860 end loop;
1862 return OK;
1863 end;
1865 -- List that is not a syntactic subtree
1867 else
1868 return OK;
1869 end if;
1871 -- Field was not a node or a list
1873 else
1874 return OK;
1875 end if;
1876 end Traverse_Field;
1878 Cur_Node : Node_Id := Node;
1880 -- Start of processing for Traverse_Func
1882 begin
1883 -- We walk Field2 last, and if it is a node, we eliminate the tail
1884 -- recursion by jumping back to this label. This is because Field2 is
1885 -- where the Left_Opnd field of N_Op_Concat is stored, and in practice
1886 -- concatenations are sometimes deeply nested, as in X1&X2&...&XN. This
1887 -- trick prevents us from running out of memory in that case. We don't
1888 -- bother eliminating the tail recursion if Field2 is a list.
1890 <<Tail_Recurse>>
1892 case Process (Cur_Node) is
1893 when Abandon =>
1894 return Abandon;
1896 when Skip =>
1897 return OK;
1899 when OK =>
1900 null;
1902 when OK_Orig =>
1903 Cur_Node := Original_Node (Cur_Node);
1904 end case;
1906 if Traverse_Field (Cur_Node, Field1 (Cur_Node), 1) = Abandon
1907 or else -- skip Field2 here
1908 Traverse_Field (Cur_Node, Field3 (Cur_Node), 3) = Abandon
1909 or else
1910 Traverse_Field (Cur_Node, Field4 (Cur_Node), 4) = Abandon
1911 or else
1912 Traverse_Field (Cur_Node, Field5 (Cur_Node), 5) = Abandon
1913 then
1914 return Abandon;
1915 end if;
1917 if Field2 (Cur_Node) not in Node_Range then
1918 return Traverse_Field (Cur_Node, Field2 (Cur_Node), 2);
1920 elsif Is_Syntactic_Field (Nkind (Cur_Node), 2)
1921 and then Field2 (Cur_Node) /= Empty_List_Or_Node
1922 then
1923 -- Here is the tail recursion step, we reset Cur_Node and jump back
1924 -- to the start of the procedure, which has the same semantic effect
1925 -- as a call.
1927 Cur_Node := Node_Id (Field2 (Cur_Node));
1928 goto Tail_Recurse;
1929 end if;
1931 return OK;
1932 end Traverse_Func;
1934 -------------------
1935 -- Traverse_Proc --
1936 -------------------
1938 procedure Traverse_Proc (Node : Node_Id) is
1939 function Traverse is new Traverse_Func (Process);
1940 Discard : Traverse_Final_Result;
1941 pragma Warnings (Off, Discard);
1942 begin
1943 Discard := Traverse (Node);
1944 end Traverse_Proc;
1946 ---------------
1947 -- Tree_Read --
1948 ---------------
1950 procedure Tree_Read is
1951 begin
1952 Tree_Read_Int (Node_Count);
1953 Nodes.Tree_Read;
1954 Orig_Nodes.Tree_Read;
1955 Paren_Counts.Tree_Read;
1956 end Tree_Read;
1958 ----------------
1959 -- Tree_Write --
1960 ----------------
1962 procedure Tree_Write is
1963 begin
1964 Tree_Write_Int (Node_Count);
1965 Nodes.Tree_Write;
1966 Orig_Nodes.Tree_Write;
1967 Paren_Counts.Tree_Write;
1968 end Tree_Write;
1970 ------------------------------
1971 -- Unchecked Access Package --
1972 ------------------------------
1974 package body Unchecked_Access is
1976 function Field1 (N : Node_Id) return Union_Id is
1977 begin
1978 pragma Assert (N <= Nodes.Last);
1979 return Nodes.Table (N).Field1;
1980 end Field1;
1982 function Field2 (N : Node_Id) return Union_Id is
1983 begin
1984 pragma Assert (N <= Nodes.Last);
1985 return Nodes.Table (N).Field2;
1986 end Field2;
1988 function Field3 (N : Node_Id) return Union_Id is
1989 begin
1990 pragma Assert (N <= Nodes.Last);
1991 return Nodes.Table (N).Field3;
1992 end Field3;
1994 function Field4 (N : Node_Id) return Union_Id is
1995 begin
1996 pragma Assert (N <= Nodes.Last);
1997 return Nodes.Table (N).Field4;
1998 end Field4;
2000 function Field5 (N : Node_Id) return Union_Id is
2001 begin
2002 pragma Assert (N <= Nodes.Last);
2003 return Nodes.Table (N).Field5;
2004 end Field5;
2006 function Field6 (N : Node_Id) return Union_Id is
2007 begin
2008 pragma Assert (Nkind (N) in N_Entity);
2009 return Nodes.Table (N + 1).Field6;
2010 end Field6;
2012 function Field7 (N : Node_Id) return Union_Id is
2013 begin
2014 pragma Assert (Nkind (N) in N_Entity);
2015 return Nodes.Table (N + 1).Field7;
2016 end Field7;
2018 function Field8 (N : Node_Id) return Union_Id is
2019 begin
2020 pragma Assert (Nkind (N) in N_Entity);
2021 return Nodes.Table (N + 1).Field8;
2022 end Field8;
2024 function Field9 (N : Node_Id) return Union_Id is
2025 begin
2026 pragma Assert (Nkind (N) in N_Entity);
2027 return Nodes.Table (N + 1).Field9;
2028 end Field9;
2030 function Field10 (N : Node_Id) return Union_Id is
2031 begin
2032 pragma Assert (Nkind (N) in N_Entity);
2033 return Nodes.Table (N + 1).Field10;
2034 end Field10;
2036 function Field11 (N : Node_Id) return Union_Id is
2037 begin
2038 pragma Assert (Nkind (N) in N_Entity);
2039 return Nodes.Table (N + 1).Field11;
2040 end Field11;
2042 function Field12 (N : Node_Id) return Union_Id is
2043 begin
2044 pragma Assert (Nkind (N) in N_Entity);
2045 return Nodes.Table (N + 1).Field12;
2046 end Field12;
2048 function Field13 (N : Node_Id) return Union_Id is
2049 begin
2050 pragma Assert (Nkind (N) in N_Entity);
2051 return Nodes.Table (N + 2).Field6;
2052 end Field13;
2054 function Field14 (N : Node_Id) return Union_Id is
2055 begin
2056 pragma Assert (Nkind (N) in N_Entity);
2057 return Nodes.Table (N + 2).Field7;
2058 end Field14;
2060 function Field15 (N : Node_Id) return Union_Id is
2061 begin
2062 pragma Assert (Nkind (N) in N_Entity);
2063 return Nodes.Table (N + 2).Field8;
2064 end Field15;
2066 function Field16 (N : Node_Id) return Union_Id is
2067 begin
2068 pragma Assert (Nkind (N) in N_Entity);
2069 return Nodes.Table (N + 2).Field9;
2070 end Field16;
2072 function Field17 (N : Node_Id) return Union_Id is
2073 begin
2074 pragma Assert (Nkind (N) in N_Entity);
2075 return Nodes.Table (N + 2).Field10;
2076 end Field17;
2078 function Field18 (N : Node_Id) return Union_Id is
2079 begin
2080 pragma Assert (Nkind (N) in N_Entity);
2081 return Nodes.Table (N + 2).Field11;
2082 end Field18;
2084 function Field19 (N : Node_Id) return Union_Id is
2085 begin
2086 pragma Assert (Nkind (N) in N_Entity);
2087 return Nodes.Table (N + 3).Field6;
2088 end Field19;
2090 function Field20 (N : Node_Id) return Union_Id is
2091 begin
2092 pragma Assert (Nkind (N) in N_Entity);
2093 return Nodes.Table (N + 3).Field7;
2094 end Field20;
2096 function Field21 (N : Node_Id) return Union_Id is
2097 begin
2098 pragma Assert (Nkind (N) in N_Entity);
2099 return Nodes.Table (N + 3).Field8;
2100 end Field21;
2102 function Field22 (N : Node_Id) return Union_Id is
2103 begin
2104 pragma Assert (Nkind (N) in N_Entity);
2105 return Nodes.Table (N + 3).Field9;
2106 end Field22;
2108 function Field23 (N : Node_Id) return Union_Id is
2109 begin
2110 pragma Assert (Nkind (N) in N_Entity);
2111 return Nodes.Table (N + 3).Field10;
2112 end Field23;
2114 function Field24 (N : Node_Id) return Union_Id is
2115 begin
2116 pragma Assert (Nkind (N) in N_Entity);
2117 return Nodes.Table (N + 4).Field6;
2118 end Field24;
2120 function Field25 (N : Node_Id) return Union_Id is
2121 begin
2122 pragma Assert (Nkind (N) in N_Entity);
2123 return Nodes.Table (N + 4).Field7;
2124 end Field25;
2126 function Field26 (N : Node_Id) return Union_Id is
2127 begin
2128 pragma Assert (Nkind (N) in N_Entity);
2129 return Nodes.Table (N + 4).Field8;
2130 end Field26;
2132 function Field27 (N : Node_Id) return Union_Id is
2133 begin
2134 pragma Assert (Nkind (N) in N_Entity);
2135 return Nodes.Table (N + 4).Field9;
2136 end Field27;
2138 function Field28 (N : Node_Id) return Union_Id is
2139 begin
2140 pragma Assert (Nkind (N) in N_Entity);
2141 return Nodes.Table (N + 4).Field10;
2142 end Field28;
2144 function Node1 (N : Node_Id) return Node_Id is
2145 begin
2146 pragma Assert (N <= Nodes.Last);
2147 return Node_Id (Nodes.Table (N).Field1);
2148 end Node1;
2150 function Node2 (N : Node_Id) return Node_Id is
2151 begin
2152 pragma Assert (N <= Nodes.Last);
2153 return Node_Id (Nodes.Table (N).Field2);
2154 end Node2;
2156 function Node3 (N : Node_Id) return Node_Id is
2157 begin
2158 pragma Assert (N <= Nodes.Last);
2159 return Node_Id (Nodes.Table (N).Field3);
2160 end Node3;
2162 function Node4 (N : Node_Id) return Node_Id is
2163 begin
2164 pragma Assert (N <= Nodes.Last);
2165 return Node_Id (Nodes.Table (N).Field4);
2166 end Node4;
2168 function Node5 (N : Node_Id) return Node_Id is
2169 begin
2170 pragma Assert (N <= Nodes.Last);
2171 return Node_Id (Nodes.Table (N).Field5);
2172 end Node5;
2174 function Node6 (N : Node_Id) return Node_Id is
2175 begin
2176 pragma Assert (Nkind (N) in N_Entity);
2177 return Node_Id (Nodes.Table (N + 1).Field6);
2178 end Node6;
2180 function Node7 (N : Node_Id) return Node_Id is
2181 begin
2182 pragma Assert (Nkind (N) in N_Entity);
2183 return Node_Id (Nodes.Table (N + 1).Field7);
2184 end Node7;
2186 function Node8 (N : Node_Id) return Node_Id is
2187 begin
2188 pragma Assert (Nkind (N) in N_Entity);
2189 return Node_Id (Nodes.Table (N + 1).Field8);
2190 end Node8;
2192 function Node9 (N : Node_Id) return Node_Id is
2193 begin
2194 pragma Assert (Nkind (N) in N_Entity);
2195 return Node_Id (Nodes.Table (N + 1).Field9);
2196 end Node9;
2198 function Node10 (N : Node_Id) return Node_Id is
2199 begin
2200 pragma Assert (Nkind (N) in N_Entity);
2201 return Node_Id (Nodes.Table (N + 1).Field10);
2202 end Node10;
2204 function Node11 (N : Node_Id) return Node_Id is
2205 begin
2206 pragma Assert (Nkind (N) in N_Entity);
2207 return Node_Id (Nodes.Table (N + 1).Field11);
2208 end Node11;
2210 function Node12 (N : Node_Id) return Node_Id is
2211 begin
2212 pragma Assert (Nkind (N) in N_Entity);
2213 return Node_Id (Nodes.Table (N + 1).Field12);
2214 end Node12;
2216 function Node13 (N : Node_Id) return Node_Id is
2217 begin
2218 pragma Assert (Nkind (N) in N_Entity);
2219 return Node_Id (Nodes.Table (N + 2).Field6);
2220 end Node13;
2222 function Node14 (N : Node_Id) return Node_Id is
2223 begin
2224 pragma Assert (Nkind (N) in N_Entity);
2225 return Node_Id (Nodes.Table (N + 2).Field7);
2226 end Node14;
2228 function Node15 (N : Node_Id) return Node_Id is
2229 begin
2230 pragma Assert (Nkind (N) in N_Entity);
2231 return Node_Id (Nodes.Table (N + 2).Field8);
2232 end Node15;
2234 function Node16 (N : Node_Id) return Node_Id is
2235 begin
2236 pragma Assert (Nkind (N) in N_Entity);
2237 return Node_Id (Nodes.Table (N + 2).Field9);
2238 end Node16;
2240 function Node17 (N : Node_Id) return Node_Id is
2241 begin
2242 pragma Assert (Nkind (N) in N_Entity);
2243 return Node_Id (Nodes.Table (N + 2).Field10);
2244 end Node17;
2246 function Node18 (N : Node_Id) return Node_Id is
2247 begin
2248 pragma Assert (Nkind (N) in N_Entity);
2249 return Node_Id (Nodes.Table (N + 2).Field11);
2250 end Node18;
2252 function Node19 (N : Node_Id) return Node_Id is
2253 begin
2254 pragma Assert (Nkind (N) in N_Entity);
2255 return Node_Id (Nodes.Table (N + 3).Field6);
2256 end Node19;
2258 function Node20 (N : Node_Id) return Node_Id is
2259 begin
2260 pragma Assert (Nkind (N) in N_Entity);
2261 return Node_Id (Nodes.Table (N + 3).Field7);
2262 end Node20;
2264 function Node21 (N : Node_Id) return Node_Id is
2265 begin
2266 pragma Assert (Nkind (N) in N_Entity);
2267 return Node_Id (Nodes.Table (N + 3).Field8);
2268 end Node21;
2270 function Node22 (N : Node_Id) return Node_Id is
2271 begin
2272 pragma Assert (Nkind (N) in N_Entity);
2273 return Node_Id (Nodes.Table (N + 3).Field9);
2274 end Node22;
2276 function Node23 (N : Node_Id) return Node_Id is
2277 begin
2278 pragma Assert (Nkind (N) in N_Entity);
2279 return Node_Id (Nodes.Table (N + 3).Field10);
2280 end Node23;
2282 function Node24 (N : Node_Id) return Node_Id is
2283 begin
2284 pragma Assert (Nkind (N) in N_Entity);
2285 return Node_Id (Nodes.Table (N + 4).Field6);
2286 end Node24;
2288 function Node25 (N : Node_Id) return Node_Id is
2289 begin
2290 pragma Assert (Nkind (N) in N_Entity);
2291 return Node_Id (Nodes.Table (N + 4).Field7);
2292 end Node25;
2294 function Node26 (N : Node_Id) return Node_Id is
2295 begin
2296 pragma Assert (Nkind (N) in N_Entity);
2297 return Node_Id (Nodes.Table (N + 4).Field8);
2298 end Node26;
2300 function Node27 (N : Node_Id) return Node_Id is
2301 begin
2302 pragma Assert (Nkind (N) in N_Entity);
2303 return Node_Id (Nodes.Table (N + 4).Field9);
2304 end Node27;
2306 function Node28 (N : Node_Id) return Node_Id is
2307 begin
2308 pragma Assert (Nkind (N) in N_Entity);
2309 return Node_Id (Nodes.Table (N + 4).Field10);
2310 end Node28;
2312 function List1 (N : Node_Id) return List_Id is
2313 begin
2314 pragma Assert (N <= Nodes.Last);
2315 return List_Id (Nodes.Table (N).Field1);
2316 end List1;
2318 function List2 (N : Node_Id) return List_Id is
2319 begin
2320 pragma Assert (N <= Nodes.Last);
2321 return List_Id (Nodes.Table (N).Field2);
2322 end List2;
2324 function List3 (N : Node_Id) return List_Id is
2325 begin
2326 pragma Assert (N <= Nodes.Last);
2327 return List_Id (Nodes.Table (N).Field3);
2328 end List3;
2330 function List4 (N : Node_Id) return List_Id is
2331 begin
2332 pragma Assert (N <= Nodes.Last);
2333 return List_Id (Nodes.Table (N).Field4);
2334 end List4;
2336 function List5 (N : Node_Id) return List_Id is
2337 begin
2338 pragma Assert (N <= Nodes.Last);
2339 return List_Id (Nodes.Table (N).Field5);
2340 end List5;
2342 function List10 (N : Node_Id) return List_Id is
2343 begin
2344 pragma Assert (Nkind (N) in N_Entity);
2345 return List_Id (Nodes.Table (N + 1).Field10);
2346 end List10;
2348 function List14 (N : Node_Id) return List_Id is
2349 begin
2350 pragma Assert (Nkind (N) in N_Entity);
2351 return List_Id (Nodes.Table (N + 2).Field7);
2352 end List14;
2354 function Elist1 (N : Node_Id) return Elist_Id is
2355 pragma Assert (N <= Nodes.Last);
2356 Value : constant Union_Id := Nodes.Table (N).Field1;
2357 begin
2358 if Value = 0 then
2359 return No_Elist;
2360 else
2361 return Elist_Id (Value);
2362 end if;
2363 end Elist1;
2365 function Elist2 (N : Node_Id) return Elist_Id is
2366 pragma Assert (N <= Nodes.Last);
2367 Value : constant Union_Id := Nodes.Table (N).Field2;
2368 begin
2369 if Value = 0 then
2370 return No_Elist;
2371 else
2372 return Elist_Id (Value);
2373 end if;
2374 end Elist2;
2376 function Elist3 (N : Node_Id) return Elist_Id is
2377 pragma Assert (N <= Nodes.Last);
2378 Value : constant Union_Id := Nodes.Table (N).Field3;
2379 begin
2380 if Value = 0 then
2381 return No_Elist;
2382 else
2383 return Elist_Id (Value);
2384 end if;
2385 end Elist3;
2387 function Elist4 (N : Node_Id) return Elist_Id is
2388 pragma Assert (N <= Nodes.Last);
2389 Value : constant Union_Id := Nodes.Table (N).Field4;
2390 begin
2391 if Value = 0 then
2392 return No_Elist;
2393 else
2394 return Elist_Id (Value);
2395 end if;
2396 end Elist4;
2398 function Elist8 (N : Node_Id) return Elist_Id is
2399 pragma Assert (Nkind (N) in N_Entity);
2400 Value : constant Union_Id := Nodes.Table (N + 1).Field8;
2401 begin
2402 if Value = 0 then
2403 return No_Elist;
2404 else
2405 return Elist_Id (Value);
2406 end if;
2407 end Elist8;
2409 function Elist13 (N : Node_Id) return Elist_Id is
2410 pragma Assert (Nkind (N) in N_Entity);
2411 Value : constant Union_Id := Nodes.Table (N + 2).Field6;
2412 begin
2413 if Value = 0 then
2414 return No_Elist;
2415 else
2416 return Elist_Id (Value);
2417 end if;
2418 end Elist13;
2420 function Elist15 (N : Node_Id) return Elist_Id is
2421 pragma Assert (Nkind (N) in N_Entity);
2422 Value : constant Union_Id := Nodes.Table (N + 2).Field8;
2423 begin
2424 if Value = 0 then
2425 return No_Elist;
2426 else
2427 return Elist_Id (Value);
2428 end if;
2429 end Elist15;
2431 function Elist16 (N : Node_Id) return Elist_Id is
2432 pragma Assert (Nkind (N) in N_Entity);
2433 Value : constant Union_Id := Nodes.Table (N + 2).Field9;
2434 begin
2435 if Value = 0 then
2436 return No_Elist;
2437 else
2438 return Elist_Id (Value);
2439 end if;
2440 end Elist16;
2442 function Elist18 (N : Node_Id) return Elist_Id is
2443 pragma Assert (Nkind (N) in N_Entity);
2444 Value : constant Union_Id := Nodes.Table (N + 2).Field11;
2445 begin
2446 if Value = 0 then
2447 return No_Elist;
2448 else
2449 return Elist_Id (Value);
2450 end if;
2451 end Elist18;
2453 function Elist21 (N : Node_Id) return Elist_Id is
2454 pragma Assert (Nkind (N) in N_Entity);
2455 Value : constant Union_Id := Nodes.Table (N + 3).Field8;
2456 begin
2457 if Value = 0 then
2458 return No_Elist;
2459 else
2460 return Elist_Id (Value);
2461 end if;
2462 end Elist21;
2464 function Elist23 (N : Node_Id) return Elist_Id is
2465 pragma Assert (Nkind (N) in N_Entity);
2466 Value : constant Union_Id := Nodes.Table (N + 3).Field10;
2467 begin
2468 if Value = 0 then
2469 return No_Elist;
2470 else
2471 return Elist_Id (Value);
2472 end if;
2473 end Elist23;
2475 function Elist25 (N : Node_Id) return Elist_Id is
2476 pragma Assert (Nkind (N) in N_Entity);
2477 Value : constant Union_Id := Nodes.Table (N + 4).Field7;
2478 begin
2479 if Value = 0 then
2480 return No_Elist;
2481 else
2482 return Elist_Id (Value);
2483 end if;
2484 end Elist25;
2486 function Elist26 (N : Node_Id) return Elist_Id is
2487 pragma Assert (Nkind (N) in N_Entity);
2488 Value : constant Union_Id := Nodes.Table (N + 4).Field8;
2489 begin
2490 if Value = 0 then
2491 return No_Elist;
2492 else
2493 return Elist_Id (Value);
2494 end if;
2495 end Elist26;
2497 function Name1 (N : Node_Id) return Name_Id is
2498 begin
2499 pragma Assert (N <= Nodes.Last);
2500 return Name_Id (Nodes.Table (N).Field1);
2501 end Name1;
2503 function Name2 (N : Node_Id) return Name_Id is
2504 begin
2505 pragma Assert (N <= Nodes.Last);
2506 return Name_Id (Nodes.Table (N).Field2);
2507 end Name2;
2509 function Str3 (N : Node_Id) return String_Id is
2510 begin
2511 pragma Assert (N <= Nodes.Last);
2512 return String_Id (Nodes.Table (N).Field3);
2513 end Str3;
2515 function Uint2 (N : Node_Id) return Uint is
2516 pragma Assert (N <= Nodes.Last);
2517 U : constant Union_Id := Nodes.Table (N).Field2;
2518 begin
2519 if U = 0 then
2520 return Uint_0;
2521 else
2522 return From_Union (U);
2523 end if;
2524 end Uint2;
2526 function Uint3 (N : Node_Id) return Uint is
2527 pragma Assert (N <= Nodes.Last);
2528 U : constant Union_Id := Nodes.Table (N).Field3;
2529 begin
2530 if U = 0 then
2531 return Uint_0;
2532 else
2533 return From_Union (U);
2534 end if;
2535 end Uint3;
2537 function Uint4 (N : Node_Id) return Uint is
2538 pragma Assert (N <= Nodes.Last);
2539 U : constant Union_Id := Nodes.Table (N).Field4;
2540 begin
2541 if U = 0 then
2542 return Uint_0;
2543 else
2544 return From_Union (U);
2545 end if;
2546 end Uint4;
2548 function Uint5 (N : Node_Id) return Uint is
2549 pragma Assert (N <= Nodes.Last);
2550 U : constant Union_Id := Nodes.Table (N).Field5;
2551 begin
2552 if U = 0 then
2553 return Uint_0;
2554 else
2555 return From_Union (U);
2556 end if;
2557 end Uint5;
2559 function Uint8 (N : Node_Id) return Uint is
2560 pragma Assert (Nkind (N) in N_Entity);
2561 U : constant Union_Id := Nodes.Table (N + 1).Field8;
2562 begin
2563 if U = 0 then
2564 return Uint_0;
2565 else
2566 return From_Union (U);
2567 end if;
2568 end Uint8;
2570 function Uint9 (N : Node_Id) return Uint is
2571 pragma Assert (Nkind (N) in N_Entity);
2572 U : constant Union_Id := Nodes.Table (N + 1).Field9;
2573 begin
2574 if U = 0 then
2575 return Uint_0;
2576 else
2577 return From_Union (U);
2578 end if;
2579 end Uint9;
2581 function Uint10 (N : Node_Id) return Uint is
2582 pragma Assert (Nkind (N) in N_Entity);
2583 U : constant Union_Id := Nodes.Table (N + 1).Field10;
2584 begin
2585 if U = 0 then
2586 return Uint_0;
2587 else
2588 return From_Union (U);
2589 end if;
2590 end Uint10;
2592 function Uint11 (N : Node_Id) return Uint is
2593 pragma Assert (Nkind (N) in N_Entity);
2594 U : constant Union_Id := Nodes.Table (N + 1).Field11;
2595 begin
2596 if U = 0 then
2597 return Uint_0;
2598 else
2599 return From_Union (U);
2600 end if;
2601 end Uint11;
2603 function Uint12 (N : Node_Id) return Uint is
2604 pragma Assert (Nkind (N) in N_Entity);
2605 U : constant Union_Id := Nodes.Table (N + 1).Field12;
2606 begin
2607 if U = 0 then
2608 return Uint_0;
2609 else
2610 return From_Union (U);
2611 end if;
2612 end Uint12;
2614 function Uint13 (N : Node_Id) return Uint is
2615 pragma Assert (Nkind (N) in N_Entity);
2616 U : constant Union_Id := Nodes.Table (N + 2).Field6;
2617 begin
2618 if U = 0 then
2619 return Uint_0;
2620 else
2621 return From_Union (U);
2622 end if;
2623 end Uint13;
2625 function Uint14 (N : Node_Id) return Uint is
2626 pragma Assert (Nkind (N) in N_Entity);
2627 U : constant Union_Id := Nodes.Table (N + 2).Field7;
2628 begin
2629 if U = 0 then
2630 return Uint_0;
2631 else
2632 return From_Union (U);
2633 end if;
2634 end Uint14;
2636 function Uint15 (N : Node_Id) return Uint is
2637 pragma Assert (Nkind (N) in N_Entity);
2638 U : constant Union_Id := Nodes.Table (N + 2).Field8;
2639 begin
2640 if U = 0 then
2641 return Uint_0;
2642 else
2643 return From_Union (U);
2644 end if;
2645 end Uint15;
2647 function Uint16 (N : Node_Id) return Uint is
2648 pragma Assert (Nkind (N) in N_Entity);
2649 U : constant Union_Id := Nodes.Table (N + 2).Field9;
2650 begin
2651 if U = 0 then
2652 return Uint_0;
2653 else
2654 return From_Union (U);
2655 end if;
2656 end Uint16;
2658 function Uint17 (N : Node_Id) return Uint is
2659 pragma Assert (Nkind (N) in N_Entity);
2660 U : constant Union_Id := Nodes.Table (N + 2).Field10;
2661 begin
2662 if U = 0 then
2663 return Uint_0;
2664 else
2665 return From_Union (U);
2666 end if;
2667 end Uint17;
2669 function Uint22 (N : Node_Id) return Uint is
2670 pragma Assert (Nkind (N) in N_Entity);
2671 U : constant Union_Id := Nodes.Table (N + 3).Field9;
2672 begin
2673 if U = 0 then
2674 return Uint_0;
2675 else
2676 return From_Union (U);
2677 end if;
2678 end Uint22;
2680 function Ureal3 (N : Node_Id) return Ureal is
2681 begin
2682 pragma Assert (N <= Nodes.Last);
2683 return From_Union (Nodes.Table (N).Field3);
2684 end Ureal3;
2686 function Ureal18 (N : Node_Id) return Ureal is
2687 begin
2688 pragma Assert (Nkind (N) in N_Entity);
2689 return From_Union (Nodes.Table (N + 2).Field11);
2690 end Ureal18;
2692 function Ureal21 (N : Node_Id) return Ureal is
2693 begin
2694 pragma Assert (Nkind (N) in N_Entity);
2695 return From_Union (Nodes.Table (N + 3).Field8);
2696 end Ureal21;
2698 function Flag4 (N : Node_Id) return Boolean is
2699 begin
2700 pragma Assert (N <= Nodes.Last);
2701 return Nodes.Table (N).Flag4;
2702 end Flag4;
2704 function Flag5 (N : Node_Id) return Boolean is
2705 begin
2706 pragma Assert (N <= Nodes.Last);
2707 return Nodes.Table (N).Flag5;
2708 end Flag5;
2710 function Flag6 (N : Node_Id) return Boolean is
2711 begin
2712 pragma Assert (N <= Nodes.Last);
2713 return Nodes.Table (N).Flag6;
2714 end Flag6;
2716 function Flag7 (N : Node_Id) return Boolean is
2717 begin
2718 pragma Assert (N <= Nodes.Last);
2719 return Nodes.Table (N).Flag7;
2720 end Flag7;
2722 function Flag8 (N : Node_Id) return Boolean is
2723 begin
2724 pragma Assert (N <= Nodes.Last);
2725 return Nodes.Table (N).Flag8;
2726 end Flag8;
2728 function Flag9 (N : Node_Id) return Boolean is
2729 begin
2730 pragma Assert (N <= Nodes.Last);
2731 return Nodes.Table (N).Flag9;
2732 end Flag9;
2734 function Flag10 (N : Node_Id) return Boolean is
2735 begin
2736 pragma Assert (N <= Nodes.Last);
2737 return Nodes.Table (N).Flag10;
2738 end Flag10;
2740 function Flag11 (N : Node_Id) return Boolean is
2741 begin
2742 pragma Assert (N <= Nodes.Last);
2743 return Nodes.Table (N).Flag11;
2744 end Flag11;
2746 function Flag12 (N : Node_Id) return Boolean is
2747 begin
2748 pragma Assert (N <= Nodes.Last);
2749 return Nodes.Table (N).Flag12;
2750 end Flag12;
2752 function Flag13 (N : Node_Id) return Boolean is
2753 begin
2754 pragma Assert (N <= Nodes.Last);
2755 return Nodes.Table (N).Flag13;
2756 end Flag13;
2758 function Flag14 (N : Node_Id) return Boolean is
2759 begin
2760 pragma Assert (N <= Nodes.Last);
2761 return Nodes.Table (N).Flag14;
2762 end Flag14;
2764 function Flag15 (N : Node_Id) return Boolean is
2765 begin
2766 pragma Assert (N <= Nodes.Last);
2767 return Nodes.Table (N).Flag15;
2768 end Flag15;
2770 function Flag16 (N : Node_Id) return Boolean is
2771 begin
2772 pragma Assert (N <= Nodes.Last);
2773 return Nodes.Table (N).Flag16;
2774 end Flag16;
2776 function Flag17 (N : Node_Id) return Boolean is
2777 begin
2778 pragma Assert (N <= Nodes.Last);
2779 return Nodes.Table (N).Flag17;
2780 end Flag17;
2782 function Flag18 (N : Node_Id) return Boolean is
2783 begin
2784 pragma Assert (N <= Nodes.Last);
2785 return Nodes.Table (N).Flag18;
2786 end Flag18;
2788 function Flag19 (N : Node_Id) return Boolean is
2789 begin
2790 pragma Assert (Nkind (N) in N_Entity);
2791 return Nodes.Table (N + 1).In_List;
2792 end Flag19;
2794 function Flag20 (N : Node_Id) return Boolean is
2795 begin
2796 pragma Assert (Nkind (N) in N_Entity);
2797 return Nodes.Table (N + 1).Unused_1;
2798 end Flag20;
2800 function Flag21 (N : Node_Id) return Boolean is
2801 begin
2802 pragma Assert (Nkind (N) in N_Entity);
2803 return Nodes.Table (N + 1).Rewrite_Ins;
2804 end Flag21;
2806 function Flag22 (N : Node_Id) return Boolean is
2807 begin
2808 pragma Assert (Nkind (N) in N_Entity);
2809 return Nodes.Table (N + 1).Analyzed;
2810 end Flag22;
2812 function Flag23 (N : Node_Id) return Boolean is
2813 begin
2814 pragma Assert (Nkind (N) in N_Entity);
2815 return Nodes.Table (N + 1).Comes_From_Source;
2816 end Flag23;
2818 function Flag24 (N : Node_Id) return Boolean is
2819 begin
2820 pragma Assert (Nkind (N) in N_Entity);
2821 return Nodes.Table (N + 1).Error_Posted;
2822 end Flag24;
2824 function Flag25 (N : Node_Id) return Boolean is
2825 begin
2826 pragma Assert (Nkind (N) in N_Entity);
2827 return Nodes.Table (N + 1).Flag4;
2828 end Flag25;
2830 function Flag26 (N : Node_Id) return Boolean is
2831 begin
2832 pragma Assert (Nkind (N) in N_Entity);
2833 return Nodes.Table (N + 1).Flag5;
2834 end Flag26;
2836 function Flag27 (N : Node_Id) return Boolean is
2837 begin
2838 pragma Assert (Nkind (N) in N_Entity);
2839 return Nodes.Table (N + 1).Flag6;
2840 end Flag27;
2842 function Flag28 (N : Node_Id) return Boolean is
2843 begin
2844 pragma Assert (Nkind (N) in N_Entity);
2845 return Nodes.Table (N + 1).Flag7;
2846 end Flag28;
2848 function Flag29 (N : Node_Id) return Boolean is
2849 begin
2850 pragma Assert (Nkind (N) in N_Entity);
2851 return Nodes.Table (N + 1).Flag8;
2852 end Flag29;
2854 function Flag30 (N : Node_Id) return Boolean is
2855 begin
2856 pragma Assert (Nkind (N) in N_Entity);
2857 return Nodes.Table (N + 1).Flag9;
2858 end Flag30;
2860 function Flag31 (N : Node_Id) return Boolean is
2861 begin
2862 pragma Assert (Nkind (N) in N_Entity);
2863 return Nodes.Table (N + 1).Flag10;
2864 end Flag31;
2866 function Flag32 (N : Node_Id) return Boolean is
2867 begin
2868 pragma Assert (Nkind (N) in N_Entity);
2869 return Nodes.Table (N + 1).Flag11;
2870 end Flag32;
2872 function Flag33 (N : Node_Id) return Boolean is
2873 begin
2874 pragma Assert (Nkind (N) in N_Entity);
2875 return Nodes.Table (N + 1).Flag12;
2876 end Flag33;
2878 function Flag34 (N : Node_Id) return Boolean is
2879 begin
2880 pragma Assert (Nkind (N) in N_Entity);
2881 return Nodes.Table (N + 1).Flag13;
2882 end Flag34;
2884 function Flag35 (N : Node_Id) return Boolean is
2885 begin
2886 pragma Assert (Nkind (N) in N_Entity);
2887 return Nodes.Table (N + 1).Flag14;
2888 end Flag35;
2890 function Flag36 (N : Node_Id) return Boolean is
2891 begin
2892 pragma Assert (Nkind (N) in N_Entity);
2893 return Nodes.Table (N + 1).Flag15;
2894 end Flag36;
2896 function Flag37 (N : Node_Id) return Boolean is
2897 begin
2898 pragma Assert (Nkind (N) in N_Entity);
2899 return Nodes.Table (N + 1).Flag16;
2900 end Flag37;
2902 function Flag38 (N : Node_Id) return Boolean is
2903 begin
2904 pragma Assert (Nkind (N) in N_Entity);
2905 return Nodes.Table (N + 1).Flag17;
2906 end Flag38;
2908 function Flag39 (N : Node_Id) return Boolean is
2909 begin
2910 pragma Assert (Nkind (N) in N_Entity);
2911 return Nodes.Table (N + 1).Flag18;
2912 end Flag39;
2914 function Flag40 (N : Node_Id) return Boolean is
2915 begin
2916 pragma Assert (Nkind (N) in N_Entity);
2917 return Nodes.Table (N + 2).In_List;
2918 end Flag40;
2920 function Flag41 (N : Node_Id) return Boolean is
2921 begin
2922 pragma Assert (Nkind (N) in N_Entity);
2923 return Nodes.Table (N + 2).Unused_1;
2924 end Flag41;
2926 function Flag42 (N : Node_Id) return Boolean is
2927 begin
2928 pragma Assert (Nkind (N) in N_Entity);
2929 return Nodes.Table (N + 2).Rewrite_Ins;
2930 end Flag42;
2932 function Flag43 (N : Node_Id) return Boolean is
2933 begin
2934 pragma Assert (Nkind (N) in N_Entity);
2935 return Nodes.Table (N + 2).Analyzed;
2936 end Flag43;
2938 function Flag44 (N : Node_Id) return Boolean is
2939 begin
2940 pragma Assert (Nkind (N) in N_Entity);
2941 return Nodes.Table (N + 2).Comes_From_Source;
2942 end Flag44;
2944 function Flag45 (N : Node_Id) return Boolean is
2945 begin
2946 pragma Assert (Nkind (N) in N_Entity);
2947 return Nodes.Table (N + 2).Error_Posted;
2948 end Flag45;
2950 function Flag46 (N : Node_Id) return Boolean is
2951 begin
2952 pragma Assert (Nkind (N) in N_Entity);
2953 return Nodes.Table (N + 2).Flag4;
2954 end Flag46;
2956 function Flag47 (N : Node_Id) return Boolean is
2957 begin
2958 pragma Assert (Nkind (N) in N_Entity);
2959 return Nodes.Table (N + 2).Flag5;
2960 end Flag47;
2962 function Flag48 (N : Node_Id) return Boolean is
2963 begin
2964 pragma Assert (Nkind (N) in N_Entity);
2965 return Nodes.Table (N + 2).Flag6;
2966 end Flag48;
2968 function Flag49 (N : Node_Id) return Boolean is
2969 begin
2970 pragma Assert (Nkind (N) in N_Entity);
2971 return Nodes.Table (N + 2).Flag7;
2972 end Flag49;
2974 function Flag50 (N : Node_Id) return Boolean is
2975 begin
2976 pragma Assert (Nkind (N) in N_Entity);
2977 return Nodes.Table (N + 2).Flag8;
2978 end Flag50;
2980 function Flag51 (N : Node_Id) return Boolean is
2981 begin
2982 pragma Assert (Nkind (N) in N_Entity);
2983 return Nodes.Table (N + 2).Flag9;
2984 end Flag51;
2986 function Flag52 (N : Node_Id) return Boolean is
2987 begin
2988 pragma Assert (Nkind (N) in N_Entity);
2989 return Nodes.Table (N + 2).Flag10;
2990 end Flag52;
2992 function Flag53 (N : Node_Id) return Boolean is
2993 begin
2994 pragma Assert (Nkind (N) in N_Entity);
2995 return Nodes.Table (N + 2).Flag11;
2996 end Flag53;
2998 function Flag54 (N : Node_Id) return Boolean is
2999 begin
3000 pragma Assert (Nkind (N) in N_Entity);
3001 return Nodes.Table (N + 2).Flag12;
3002 end Flag54;
3004 function Flag55 (N : Node_Id) return Boolean is
3005 begin
3006 pragma Assert (Nkind (N) in N_Entity);
3007 return Nodes.Table (N + 2).Flag13;
3008 end Flag55;
3010 function Flag56 (N : Node_Id) return Boolean is
3011 begin
3012 pragma Assert (Nkind (N) in N_Entity);
3013 return Nodes.Table (N + 2).Flag14;
3014 end Flag56;
3016 function Flag57 (N : Node_Id) return Boolean is
3017 begin
3018 pragma Assert (Nkind (N) in N_Entity);
3019 return Nodes.Table (N + 2).Flag15;
3020 end Flag57;
3022 function Flag58 (N : Node_Id) return Boolean is
3023 begin
3024 pragma Assert (Nkind (N) in N_Entity);
3025 return Nodes.Table (N + 2).Flag16;
3026 end Flag58;
3028 function Flag59 (N : Node_Id) return Boolean is
3029 begin
3030 pragma Assert (Nkind (N) in N_Entity);
3031 return Nodes.Table (N + 2).Flag17;
3032 end Flag59;
3034 function Flag60 (N : Node_Id) return Boolean is
3035 begin
3036 pragma Assert (Nkind (N) in N_Entity);
3037 return Nodes.Table (N + 2).Flag18;
3038 end Flag60;
3040 function Flag61 (N : Node_Id) return Boolean is
3041 begin
3042 pragma Assert (Nkind (N) in N_Entity);
3043 return Nodes.Table (N + 1).Pflag1;
3044 end Flag61;
3046 function Flag62 (N : Node_Id) return Boolean is
3047 begin
3048 pragma Assert (Nkind (N) in N_Entity);
3049 return Nodes.Table (N + 1).Pflag2;
3050 end Flag62;
3052 function Flag63 (N : Node_Id) return Boolean is
3053 begin
3054 pragma Assert (Nkind (N) in N_Entity);
3055 return Nodes.Table (N + 2).Pflag1;
3056 end Flag63;
3058 function Flag64 (N : Node_Id) return Boolean is
3059 begin
3060 pragma Assert (Nkind (N) in N_Entity);
3061 return Nodes.Table (N + 2).Pflag2;
3062 end Flag64;
3064 function Flag65 (N : Node_Id) return Boolean is
3065 begin
3066 pragma Assert (Nkind (N) in N_Entity);
3067 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag65;
3068 end Flag65;
3070 function Flag66 (N : Node_Id) return Boolean is
3071 begin
3072 pragma Assert (Nkind (N) in N_Entity);
3073 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag66;
3074 end Flag66;
3076 function Flag67 (N : Node_Id) return Boolean is
3077 begin
3078 pragma Assert (Nkind (N) in N_Entity);
3079 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag67;
3080 end Flag67;
3082 function Flag68 (N : Node_Id) return Boolean is
3083 begin
3084 pragma Assert (Nkind (N) in N_Entity);
3085 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag68;
3086 end Flag68;
3088 function Flag69 (N : Node_Id) return Boolean is
3089 begin
3090 pragma Assert (Nkind (N) in N_Entity);
3091 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag69;
3092 end Flag69;
3094 function Flag70 (N : Node_Id) return Boolean is
3095 begin
3096 pragma Assert (Nkind (N) in N_Entity);
3097 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag70;
3098 end Flag70;
3100 function Flag71 (N : Node_Id) return Boolean is
3101 begin
3102 pragma Assert (Nkind (N) in N_Entity);
3103 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag71;
3104 end Flag71;
3106 function Flag72 (N : Node_Id) return Boolean is
3107 begin
3108 pragma Assert (Nkind (N) in N_Entity);
3109 return To_Flag_Byte (Nodes.Table (N + 2).Nkind).Flag72;
3110 end Flag72;
3112 function Flag73 (N : Node_Id) return Boolean is
3113 begin
3114 pragma Assert (Nkind (N) in N_Entity);
3115 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag73;
3116 end Flag73;
3118 function Flag74 (N : Node_Id) return Boolean is
3119 begin
3120 pragma Assert (Nkind (N) in N_Entity);
3121 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag74;
3122 end Flag74;
3124 function Flag75 (N : Node_Id) return Boolean is
3125 begin
3126 pragma Assert (Nkind (N) in N_Entity);
3127 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag75;
3128 end Flag75;
3130 function Flag76 (N : Node_Id) return Boolean is
3131 begin
3132 pragma Assert (Nkind (N) in N_Entity);
3133 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag76;
3134 end Flag76;
3136 function Flag77 (N : Node_Id) return Boolean is
3137 begin
3138 pragma Assert (Nkind (N) in N_Entity);
3139 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag77;
3140 end Flag77;
3142 function Flag78 (N : Node_Id) return Boolean is
3143 begin
3144 pragma Assert (Nkind (N) in N_Entity);
3145 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag78;
3146 end Flag78;
3148 function Flag79 (N : Node_Id) return Boolean is
3149 begin
3150 pragma Assert (Nkind (N) in N_Entity);
3151 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag79;
3152 end Flag79;
3154 function Flag80 (N : Node_Id) return Boolean is
3155 begin
3156 pragma Assert (Nkind (N) in N_Entity);
3157 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag80;
3158 end Flag80;
3160 function Flag81 (N : Node_Id) return Boolean is
3161 begin
3162 pragma Assert (Nkind (N) in N_Entity);
3163 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag81;
3164 end Flag81;
3166 function Flag82 (N : Node_Id) return Boolean is
3167 begin
3168 pragma Assert (Nkind (N) in N_Entity);
3169 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag82;
3170 end Flag82;
3172 function Flag83 (N : Node_Id) return Boolean is
3173 begin
3174 pragma Assert (Nkind (N) in N_Entity);
3175 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag83;
3176 end Flag83;
3178 function Flag84 (N : Node_Id) return Boolean is
3179 begin
3180 pragma Assert (Nkind (N) in N_Entity);
3181 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag84;
3182 end Flag84;
3184 function Flag85 (N : Node_Id) return Boolean is
3185 begin
3186 pragma Assert (Nkind (N) in N_Entity);
3187 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag85;
3188 end Flag85;
3190 function Flag86 (N : Node_Id) return Boolean is
3191 begin
3192 pragma Assert (Nkind (N) in N_Entity);
3193 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag86;
3194 end Flag86;
3196 function Flag87 (N : Node_Id) return Boolean is
3197 begin
3198 pragma Assert (Nkind (N) in N_Entity);
3199 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag87;
3200 end Flag87;
3202 function Flag88 (N : Node_Id) return Boolean is
3203 begin
3204 pragma Assert (Nkind (N) in N_Entity);
3205 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag88;
3206 end Flag88;
3208 function Flag89 (N : Node_Id) return Boolean is
3209 begin
3210 pragma Assert (Nkind (N) in N_Entity);
3211 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag89;
3212 end Flag89;
3214 function Flag90 (N : Node_Id) return Boolean is
3215 begin
3216 pragma Assert (Nkind (N) in N_Entity);
3217 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag90;
3218 end Flag90;
3220 function Flag91 (N : Node_Id) return Boolean is
3221 begin
3222 pragma Assert (Nkind (N) in N_Entity);
3223 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag91;
3224 end Flag91;
3226 function Flag92 (N : Node_Id) return Boolean is
3227 begin
3228 pragma Assert (Nkind (N) in N_Entity);
3229 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag92;
3230 end Flag92;
3232 function Flag93 (N : Node_Id) return Boolean is
3233 begin
3234 pragma Assert (Nkind (N) in N_Entity);
3235 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag93;
3236 end Flag93;
3238 function Flag94 (N : Node_Id) return Boolean is
3239 begin
3240 pragma Assert (Nkind (N) in N_Entity);
3241 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag94;
3242 end Flag94;
3244 function Flag95 (N : Node_Id) return Boolean is
3245 begin
3246 pragma Assert (Nkind (N) in N_Entity);
3247 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag95;
3248 end Flag95;
3250 function Flag96 (N : Node_Id) return Boolean is
3251 begin
3252 pragma Assert (Nkind (N) in N_Entity);
3253 return To_Flag_Word (Nodes.Table (N + 2).Field12).Flag96;
3254 end Flag96;
3256 function Flag97 (N : Node_Id) return Boolean is
3257 begin
3258 pragma Assert (Nkind (N) in N_Entity);
3259 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag97;
3260 end Flag97;
3262 function Flag98 (N : Node_Id) return Boolean is
3263 begin
3264 pragma Assert (Nkind (N) in N_Entity);
3265 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag98;
3266 end Flag98;
3268 function Flag99 (N : Node_Id) return Boolean is
3269 begin
3270 pragma Assert (Nkind (N) in N_Entity);
3271 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag99;
3272 end Flag99;
3274 function Flag100 (N : Node_Id) return Boolean is
3275 begin
3276 pragma Assert (Nkind (N) in N_Entity);
3277 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag100;
3278 end Flag100;
3280 function Flag101 (N : Node_Id) return Boolean is
3281 begin
3282 pragma Assert (Nkind (N) in N_Entity);
3283 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag101;
3284 end Flag101;
3286 function Flag102 (N : Node_Id) return Boolean is
3287 begin
3288 pragma Assert (Nkind (N) in N_Entity);
3289 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag102;
3290 end Flag102;
3292 function Flag103 (N : Node_Id) return Boolean is
3293 begin
3294 pragma Assert (Nkind (N) in N_Entity);
3295 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag103;
3296 end Flag103;
3298 function Flag104 (N : Node_Id) return Boolean is
3299 begin
3300 pragma Assert (Nkind (N) in N_Entity);
3301 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag104;
3302 end Flag104;
3304 function Flag105 (N : Node_Id) return Boolean is
3305 begin
3306 pragma Assert (Nkind (N) in N_Entity);
3307 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag105;
3308 end Flag105;
3310 function Flag106 (N : Node_Id) return Boolean is
3311 begin
3312 pragma Assert (Nkind (N) in N_Entity);
3313 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag106;
3314 end Flag106;
3316 function Flag107 (N : Node_Id) return Boolean is
3317 begin
3318 pragma Assert (Nkind (N) in N_Entity);
3319 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag107;
3320 end Flag107;
3322 function Flag108 (N : Node_Id) return Boolean is
3323 begin
3324 pragma Assert (Nkind (N) in N_Entity);
3325 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag108;
3326 end Flag108;
3328 function Flag109 (N : Node_Id) return Boolean is
3329 begin
3330 pragma Assert (Nkind (N) in N_Entity);
3331 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag109;
3332 end Flag109;
3334 function Flag110 (N : Node_Id) return Boolean is
3335 begin
3336 pragma Assert (Nkind (N) in N_Entity);
3337 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag110;
3338 end Flag110;
3340 function Flag111 (N : Node_Id) return Boolean is
3341 begin
3342 pragma Assert (Nkind (N) in N_Entity);
3343 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag111;
3344 end Flag111;
3346 function Flag112 (N : Node_Id) return Boolean is
3347 begin
3348 pragma Assert (Nkind (N) in N_Entity);
3349 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag112;
3350 end Flag112;
3352 function Flag113 (N : Node_Id) return Boolean is
3353 begin
3354 pragma Assert (Nkind (N) in N_Entity);
3355 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag113;
3356 end Flag113;
3358 function Flag114 (N : Node_Id) return Boolean is
3359 begin
3360 pragma Assert (Nkind (N) in N_Entity);
3361 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag114;
3362 end Flag114;
3364 function Flag115 (N : Node_Id) return Boolean is
3365 begin
3366 pragma Assert (Nkind (N) in N_Entity);
3367 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag115;
3368 end Flag115;
3370 function Flag116 (N : Node_Id) return Boolean is
3371 begin
3372 pragma Assert (Nkind (N) in N_Entity);
3373 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag116;
3374 end Flag116;
3376 function Flag117 (N : Node_Id) return Boolean is
3377 begin
3378 pragma Assert (Nkind (N) in N_Entity);
3379 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag117;
3380 end Flag117;
3382 function Flag118 (N : Node_Id) return Boolean is
3383 begin
3384 pragma Assert (Nkind (N) in N_Entity);
3385 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag118;
3386 end Flag118;
3388 function Flag119 (N : Node_Id) return Boolean is
3389 begin
3390 pragma Assert (Nkind (N) in N_Entity);
3391 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag119;
3392 end Flag119;
3394 function Flag120 (N : Node_Id) return Boolean is
3395 begin
3396 pragma Assert (Nkind (N) in N_Entity);
3397 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag120;
3398 end Flag120;
3400 function Flag121 (N : Node_Id) return Boolean is
3401 begin
3402 pragma Assert (Nkind (N) in N_Entity);
3403 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag121;
3404 end Flag121;
3406 function Flag122 (N : Node_Id) return Boolean is
3407 begin
3408 pragma Assert (Nkind (N) in N_Entity);
3409 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag122;
3410 end Flag122;
3412 function Flag123 (N : Node_Id) return Boolean is
3413 begin
3414 pragma Assert (Nkind (N) in N_Entity);
3415 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag123;
3416 end Flag123;
3418 function Flag124 (N : Node_Id) return Boolean is
3419 begin
3420 pragma Assert (Nkind (N) in N_Entity);
3421 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag124;
3422 end Flag124;
3424 function Flag125 (N : Node_Id) return Boolean is
3425 begin
3426 pragma Assert (Nkind (N) in N_Entity);
3427 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag125;
3428 end Flag125;
3430 function Flag126 (N : Node_Id) return Boolean is
3431 begin
3432 pragma Assert (Nkind (N) in N_Entity);
3433 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag126;
3434 end Flag126;
3436 function Flag127 (N : Node_Id) return Boolean is
3437 begin
3438 pragma Assert (Nkind (N) in N_Entity);
3439 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag127;
3440 end Flag127;
3442 function Flag128 (N : Node_Id) return Boolean is
3443 begin
3444 pragma Assert (Nkind (N) in N_Entity);
3445 return To_Flag_Word2 (Nodes.Table (N + 3).Field12).Flag128;
3446 end Flag128;
3448 function Flag129 (N : Node_Id) return Boolean is
3449 begin
3450 pragma Assert (Nkind (N) in N_Entity);
3451 return Nodes.Table (N + 3).In_List;
3452 end Flag129;
3454 function Flag130 (N : Node_Id) return Boolean is
3455 begin
3456 pragma Assert (Nkind (N) in N_Entity);
3457 return Nodes.Table (N + 3).Unused_1;
3458 end Flag130;
3460 function Flag131 (N : Node_Id) return Boolean is
3461 begin
3462 pragma Assert (Nkind (N) in N_Entity);
3463 return Nodes.Table (N + 3).Rewrite_Ins;
3464 end Flag131;
3466 function Flag132 (N : Node_Id) return Boolean is
3467 begin
3468 pragma Assert (Nkind (N) in N_Entity);
3469 return Nodes.Table (N + 3).Analyzed;
3470 end Flag132;
3472 function Flag133 (N : Node_Id) return Boolean is
3473 begin
3474 pragma Assert (Nkind (N) in N_Entity);
3475 return Nodes.Table (N + 3).Comes_From_Source;
3476 end Flag133;
3478 function Flag134 (N : Node_Id) return Boolean is
3479 begin
3480 pragma Assert (Nkind (N) in N_Entity);
3481 return Nodes.Table (N + 3).Error_Posted;
3482 end Flag134;
3484 function Flag135 (N : Node_Id) return Boolean is
3485 begin
3486 pragma Assert (Nkind (N) in N_Entity);
3487 return Nodes.Table (N + 3).Flag4;
3488 end Flag135;
3490 function Flag136 (N : Node_Id) return Boolean is
3491 begin
3492 pragma Assert (Nkind (N) in N_Entity);
3493 return Nodes.Table (N + 3).Flag5;
3494 end Flag136;
3496 function Flag137 (N : Node_Id) return Boolean is
3497 begin
3498 pragma Assert (Nkind (N) in N_Entity);
3499 return Nodes.Table (N + 3).Flag6;
3500 end Flag137;
3502 function Flag138 (N : Node_Id) return Boolean is
3503 begin
3504 pragma Assert (Nkind (N) in N_Entity);
3505 return Nodes.Table (N + 3).Flag7;
3506 end Flag138;
3508 function Flag139 (N : Node_Id) return Boolean is
3509 begin
3510 pragma Assert (Nkind (N) in N_Entity);
3511 return Nodes.Table (N + 3).Flag8;
3512 end Flag139;
3514 function Flag140 (N : Node_Id) return Boolean is
3515 begin
3516 pragma Assert (Nkind (N) in N_Entity);
3517 return Nodes.Table (N + 3).Flag9;
3518 end Flag140;
3520 function Flag141 (N : Node_Id) return Boolean is
3521 begin
3522 pragma Assert (Nkind (N) in N_Entity);
3523 return Nodes.Table (N + 3).Flag10;
3524 end Flag141;
3526 function Flag142 (N : Node_Id) return Boolean is
3527 begin
3528 pragma Assert (Nkind (N) in N_Entity);
3529 return Nodes.Table (N + 3).Flag11;
3530 end Flag142;
3532 function Flag143 (N : Node_Id) return Boolean is
3533 begin
3534 pragma Assert (Nkind (N) in N_Entity);
3535 return Nodes.Table (N + 3).Flag12;
3536 end Flag143;
3538 function Flag144 (N : Node_Id) return Boolean is
3539 begin
3540 pragma Assert (Nkind (N) in N_Entity);
3541 return Nodes.Table (N + 3).Flag13;
3542 end Flag144;
3544 function Flag145 (N : Node_Id) return Boolean is
3545 begin
3546 pragma Assert (Nkind (N) in N_Entity);
3547 return Nodes.Table (N + 3).Flag14;
3548 end Flag145;
3550 function Flag146 (N : Node_Id) return Boolean is
3551 begin
3552 pragma Assert (Nkind (N) in N_Entity);
3553 return Nodes.Table (N + 3).Flag15;
3554 end Flag146;
3556 function Flag147 (N : Node_Id) return Boolean is
3557 begin
3558 pragma Assert (Nkind (N) in N_Entity);
3559 return Nodes.Table (N + 3).Flag16;
3560 end Flag147;
3562 function Flag148 (N : Node_Id) return Boolean is
3563 begin
3564 pragma Assert (Nkind (N) in N_Entity);
3565 return Nodes.Table (N + 3).Flag17;
3566 end Flag148;
3568 function Flag149 (N : Node_Id) return Boolean is
3569 begin
3570 pragma Assert (Nkind (N) in N_Entity);
3571 return Nodes.Table (N + 3).Flag18;
3572 end Flag149;
3574 function Flag150 (N : Node_Id) return Boolean is
3575 begin
3576 pragma Assert (Nkind (N) in N_Entity);
3577 return Nodes.Table (N + 3).Pflag1;
3578 end Flag150;
3580 function Flag151 (N : Node_Id) return Boolean is
3581 begin
3582 pragma Assert (Nkind (N) in N_Entity);
3583 return Nodes.Table (N + 3).Pflag2;
3584 end Flag151;
3586 function Flag152 (N : Node_Id) return Boolean is
3587 begin
3588 pragma Assert (Nkind (N) in N_Entity);
3589 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag152;
3590 end Flag152;
3592 function Flag153 (N : Node_Id) return Boolean is
3593 begin
3594 pragma Assert (Nkind (N) in N_Entity);
3595 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag153;
3596 end Flag153;
3598 function Flag154 (N : Node_Id) return Boolean is
3599 begin
3600 pragma Assert (Nkind (N) in N_Entity);
3601 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag154;
3602 end Flag154;
3604 function Flag155 (N : Node_Id) return Boolean is
3605 begin
3606 pragma Assert (Nkind (N) in N_Entity);
3607 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag155;
3608 end Flag155;
3610 function Flag156 (N : Node_Id) return Boolean is
3611 begin
3612 pragma Assert (Nkind (N) in N_Entity);
3613 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag156;
3614 end Flag156;
3616 function Flag157 (N : Node_Id) return Boolean is
3617 begin
3618 pragma Assert (Nkind (N) in N_Entity);
3619 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag157;
3620 end Flag157;
3622 function Flag158 (N : Node_Id) return Boolean is
3623 begin
3624 pragma Assert (Nkind (N) in N_Entity);
3625 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag158;
3626 end Flag158;
3628 function Flag159 (N : Node_Id) return Boolean is
3629 begin
3630 pragma Assert (Nkind (N) in N_Entity);
3631 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag159;
3632 end Flag159;
3634 function Flag160 (N : Node_Id) return Boolean is
3635 begin
3636 pragma Assert (Nkind (N) in N_Entity);
3637 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag160;
3638 end Flag160;
3640 function Flag161 (N : Node_Id) return Boolean is
3641 begin
3642 pragma Assert (Nkind (N) in N_Entity);
3643 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag161;
3644 end Flag161;
3646 function Flag162 (N : Node_Id) return Boolean is
3647 begin
3648 pragma Assert (Nkind (N) in N_Entity);
3649 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag162;
3650 end Flag162;
3652 function Flag163 (N : Node_Id) return Boolean is
3653 begin
3654 pragma Assert (Nkind (N) in N_Entity);
3655 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag163;
3656 end Flag163;
3658 function Flag164 (N : Node_Id) return Boolean is
3659 begin
3660 pragma Assert (Nkind (N) in N_Entity);
3661 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag164;
3662 end Flag164;
3664 function Flag165 (N : Node_Id) return Boolean is
3665 begin
3666 pragma Assert (Nkind (N) in N_Entity);
3667 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag165;
3668 end Flag165;
3670 function Flag166 (N : Node_Id) return Boolean is
3671 begin
3672 pragma Assert (Nkind (N) in N_Entity);
3673 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag166;
3674 end Flag166;
3676 function Flag167 (N : Node_Id) return Boolean is
3677 begin
3678 pragma Assert (Nkind (N) in N_Entity);
3679 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag167;
3680 end Flag167;
3682 function Flag168 (N : Node_Id) return Boolean is
3683 begin
3684 pragma Assert (Nkind (N) in N_Entity);
3685 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag168;
3686 end Flag168;
3688 function Flag169 (N : Node_Id) return Boolean is
3689 begin
3690 pragma Assert (Nkind (N) in N_Entity);
3691 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag169;
3692 end Flag169;
3694 function Flag170 (N : Node_Id) return Boolean is
3695 begin
3696 pragma Assert (Nkind (N) in N_Entity);
3697 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag170;
3698 end Flag170;
3700 function Flag171 (N : Node_Id) return Boolean is
3701 begin
3702 pragma Assert (Nkind (N) in N_Entity);
3703 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag171;
3704 end Flag171;
3706 function Flag172 (N : Node_Id) return Boolean is
3707 begin
3708 pragma Assert (Nkind (N) in N_Entity);
3709 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag172;
3710 end Flag172;
3712 function Flag173 (N : Node_Id) return Boolean is
3713 begin
3714 pragma Assert (Nkind (N) in N_Entity);
3715 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag173;
3716 end Flag173;
3718 function Flag174 (N : Node_Id) return Boolean is
3719 begin
3720 pragma Assert (Nkind (N) in N_Entity);
3721 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag174;
3722 end Flag174;
3724 function Flag175 (N : Node_Id) return Boolean is
3725 begin
3726 pragma Assert (Nkind (N) in N_Entity);
3727 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag175;
3728 end Flag175;
3730 function Flag176 (N : Node_Id) return Boolean is
3731 begin
3732 pragma Assert (Nkind (N) in N_Entity);
3733 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag176;
3734 end Flag176;
3736 function Flag177 (N : Node_Id) return Boolean is
3737 begin
3738 pragma Assert (Nkind (N) in N_Entity);
3739 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag177;
3740 end Flag177;
3742 function Flag178 (N : Node_Id) return Boolean is
3743 begin
3744 pragma Assert (Nkind (N) in N_Entity);
3745 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag178;
3746 end Flag178;
3748 function Flag179 (N : Node_Id) return Boolean is
3749 begin
3750 pragma Assert (Nkind (N) in N_Entity);
3751 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag179;
3752 end Flag179;
3754 function Flag180 (N : Node_Id) return Boolean is
3755 begin
3756 pragma Assert (Nkind (N) in N_Entity);
3757 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag180;
3758 end Flag180;
3760 function Flag181 (N : Node_Id) return Boolean is
3761 begin
3762 pragma Assert (Nkind (N) in N_Entity);
3763 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag181;
3764 end Flag181;
3766 function Flag182 (N : Node_Id) return Boolean is
3767 begin
3768 pragma Assert (Nkind (N) in N_Entity);
3769 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag182;
3770 end Flag182;
3772 function Flag183 (N : Node_Id) return Boolean is
3773 begin
3774 pragma Assert (Nkind (N) in N_Entity);
3775 return To_Flag_Word3 (Nodes.Table (N + 3).Field11).Flag183;
3776 end Flag183;
3778 function Flag184 (N : Node_Id) return Boolean is
3779 begin
3780 pragma Assert (Nkind (N) in N_Entity);
3781 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag184;
3782 end Flag184;
3784 function Flag185 (N : Node_Id) return Boolean is
3785 begin
3786 pragma Assert (Nkind (N) in N_Entity);
3787 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag185;
3788 end Flag185;
3790 function Flag186 (N : Node_Id) return Boolean is
3791 begin
3792 pragma Assert (Nkind (N) in N_Entity);
3793 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag186;
3794 end Flag186;
3796 function Flag187 (N : Node_Id) return Boolean is
3797 begin
3798 pragma Assert (Nkind (N) in N_Entity);
3799 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag187;
3800 end Flag187;
3802 function Flag188 (N : Node_Id) return Boolean is
3803 begin
3804 pragma Assert (Nkind (N) in N_Entity);
3805 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag188;
3806 end Flag188;
3808 function Flag189 (N : Node_Id) return Boolean is
3809 begin
3810 pragma Assert (Nkind (N) in N_Entity);
3811 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag189;
3812 end Flag189;
3814 function Flag190 (N : Node_Id) return Boolean is
3815 begin
3816 pragma Assert (Nkind (N) in N_Entity);
3817 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag190;
3818 end Flag190;
3820 function Flag191 (N : Node_Id) return Boolean is
3821 begin
3822 pragma Assert (Nkind (N) in N_Entity);
3823 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag191;
3824 end Flag191;
3826 function Flag192 (N : Node_Id) return Boolean is
3827 begin
3828 pragma Assert (Nkind (N) in N_Entity);
3829 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag192;
3830 end Flag192;
3832 function Flag193 (N : Node_Id) return Boolean is
3833 begin
3834 pragma Assert (Nkind (N) in N_Entity);
3835 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag193;
3836 end Flag193;
3838 function Flag194 (N : Node_Id) return Boolean is
3839 begin
3840 pragma Assert (Nkind (N) in N_Entity);
3841 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag194;
3842 end Flag194;
3844 function Flag195 (N : Node_Id) return Boolean is
3845 begin
3846 pragma Assert (Nkind (N) in N_Entity);
3847 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag195;
3848 end Flag195;
3850 function Flag196 (N : Node_Id) return Boolean is
3851 begin
3852 pragma Assert (Nkind (N) in N_Entity);
3853 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag196;
3854 end Flag196;
3856 function Flag197 (N : Node_Id) return Boolean is
3857 begin
3858 pragma Assert (Nkind (N) in N_Entity);
3859 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag197;
3860 end Flag197;
3862 function Flag198 (N : Node_Id) return Boolean is
3863 begin
3864 pragma Assert (Nkind (N) in N_Entity);
3865 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag198;
3866 end Flag198;
3868 function Flag199 (N : Node_Id) return Boolean is
3869 begin
3870 pragma Assert (Nkind (N) in N_Entity);
3871 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag199;
3872 end Flag199;
3874 function Flag200 (N : Node_Id) return Boolean is
3875 begin
3876 pragma Assert (Nkind (N) in N_Entity);
3877 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag200;
3878 end Flag200;
3880 function Flag201 (N : Node_Id) return Boolean is
3881 begin
3882 pragma Assert (Nkind (N) in N_Entity);
3883 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag201;
3884 end Flag201;
3886 function Flag202 (N : Node_Id) return Boolean is
3887 begin
3888 pragma Assert (Nkind (N) in N_Entity);
3889 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag202;
3890 end Flag202;
3892 function Flag203 (N : Node_Id) return Boolean is
3893 begin
3894 pragma Assert (Nkind (N) in N_Entity);
3895 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag203;
3896 end Flag203;
3898 function Flag204 (N : Node_Id) return Boolean is
3899 begin
3900 pragma Assert (Nkind (N) in N_Entity);
3901 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag204;
3902 end Flag204;
3904 function Flag205 (N : Node_Id) return Boolean is
3905 begin
3906 pragma Assert (Nkind (N) in N_Entity);
3907 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag205;
3908 end Flag205;
3910 function Flag206 (N : Node_Id) return Boolean is
3911 begin
3912 pragma Assert (Nkind (N) in N_Entity);
3913 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag206;
3914 end Flag206;
3916 function Flag207 (N : Node_Id) return Boolean is
3917 begin
3918 pragma Assert (Nkind (N) in N_Entity);
3919 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag207;
3920 end Flag207;
3922 function Flag208 (N : Node_Id) return Boolean is
3923 begin
3924 pragma Assert (Nkind (N) in N_Entity);
3925 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag208;
3926 end Flag208;
3928 function Flag209 (N : Node_Id) return Boolean is
3929 begin
3930 pragma Assert (Nkind (N) in N_Entity);
3931 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag209;
3932 end Flag209;
3934 function Flag210 (N : Node_Id) return Boolean is
3935 begin
3936 pragma Assert (Nkind (N) in N_Entity);
3937 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag210;
3938 end Flag210;
3940 function Flag211 (N : Node_Id) return Boolean is
3941 begin
3942 pragma Assert (Nkind (N) in N_Entity);
3943 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag211;
3944 end Flag211;
3946 function Flag212 (N : Node_Id) return Boolean is
3947 begin
3948 pragma Assert (Nkind (N) in N_Entity);
3949 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag212;
3950 end Flag212;
3952 function Flag213 (N : Node_Id) return Boolean is
3953 begin
3954 pragma Assert (Nkind (N) in N_Entity);
3955 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag213;
3956 end Flag213;
3958 function Flag214 (N : Node_Id) return Boolean is
3959 begin
3960 pragma Assert (Nkind (N) in N_Entity);
3961 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag214;
3962 end Flag214;
3964 function Flag215 (N : Node_Id) return Boolean is
3965 begin
3966 pragma Assert (Nkind (N) in N_Entity);
3967 return To_Flag_Word4 (Nodes.Table (N + 4).Field11).Flag215;
3968 end Flag215;
3970 function Flag216 (N : Node_Id) return Boolean is
3971 begin
3972 pragma Assert (Nkind (N) in N_Entity);
3973 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag216;
3974 end Flag216;
3976 function Flag217 (N : Node_Id) return Boolean is
3977 begin
3978 pragma Assert (Nkind (N) in N_Entity);
3979 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag217;
3980 end Flag217;
3982 function Flag218 (N : Node_Id) return Boolean is
3983 begin
3984 pragma Assert (Nkind (N) in N_Entity);
3985 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag218;
3986 end Flag218;
3988 function Flag219 (N : Node_Id) return Boolean is
3989 begin
3990 pragma Assert (Nkind (N) in N_Entity);
3991 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag219;
3992 end Flag219;
3994 function Flag220 (N : Node_Id) return Boolean is
3995 begin
3996 pragma Assert (Nkind (N) in N_Entity);
3997 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag220;
3998 end Flag220;
4000 function Flag221 (N : Node_Id) return Boolean is
4001 begin
4002 pragma Assert (Nkind (N) in N_Entity);
4003 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag221;
4004 end Flag221;
4006 function Flag222 (N : Node_Id) return Boolean is
4007 begin
4008 pragma Assert (Nkind (N) in N_Entity);
4009 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag222;
4010 end Flag222;
4012 function Flag223 (N : Node_Id) return Boolean is
4013 begin
4014 pragma Assert (Nkind (N) in N_Entity);
4015 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag223;
4016 end Flag223;
4018 function Flag224 (N : Node_Id) return Boolean is
4019 begin
4020 pragma Assert (Nkind (N) in N_Entity);
4021 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag224;
4022 end Flag224;
4024 function Flag225 (N : Node_Id) return Boolean is
4025 begin
4026 pragma Assert (Nkind (N) in N_Entity);
4027 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag225;
4028 end Flag225;
4030 function Flag226 (N : Node_Id) return Boolean is
4031 begin
4032 pragma Assert (Nkind (N) in N_Entity);
4033 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag226;
4034 end Flag226;
4036 function Flag227 (N : Node_Id) return Boolean is
4037 begin
4038 pragma Assert (Nkind (N) in N_Entity);
4039 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag227;
4040 end Flag227;
4042 function Flag228 (N : Node_Id) return Boolean is
4043 begin
4044 pragma Assert (Nkind (N) in N_Entity);
4045 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag228;
4046 end Flag228;
4048 function Flag229 (N : Node_Id) return Boolean is
4049 begin
4050 pragma Assert (Nkind (N) in N_Entity);
4051 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag229;
4052 end Flag229;
4054 function Flag230 (N : Node_Id) return Boolean is
4055 begin
4056 pragma Assert (Nkind (N) in N_Entity);
4057 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag230;
4058 end Flag230;
4060 function Flag231 (N : Node_Id) return Boolean is
4061 begin
4062 pragma Assert (Nkind (N) in N_Entity);
4063 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag231;
4064 end Flag231;
4066 function Flag232 (N : Node_Id) return Boolean is
4067 begin
4068 pragma Assert (Nkind (N) in N_Entity);
4069 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag232;
4070 end Flag232;
4072 function Flag233 (N : Node_Id) return Boolean is
4073 begin
4074 pragma Assert (Nkind (N) in N_Entity);
4075 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag233;
4076 end Flag233;
4078 function Flag234 (N : Node_Id) return Boolean is
4079 begin
4080 pragma Assert (Nkind (N) in N_Entity);
4081 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag234;
4082 end Flag234;
4084 function Flag235 (N : Node_Id) return Boolean is
4085 begin
4086 pragma Assert (Nkind (N) in N_Entity);
4087 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag235;
4088 end Flag235;
4090 function Flag236 (N : Node_Id) return Boolean is
4091 begin
4092 pragma Assert (Nkind (N) in N_Entity);
4093 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag236;
4094 end Flag236;
4096 function Flag237 (N : Node_Id) return Boolean is
4097 begin
4098 pragma Assert (Nkind (N) in N_Entity);
4099 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag237;
4100 end Flag237;
4102 function Flag238 (N : Node_Id) return Boolean is
4103 begin
4104 pragma Assert (Nkind (N) in N_Entity);
4105 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag238;
4106 end Flag238;
4108 function Flag239 (N : Node_Id) return Boolean is
4109 begin
4110 pragma Assert (Nkind (N) in N_Entity);
4111 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag239;
4112 end Flag239;
4114 function Flag240 (N : Node_Id) return Boolean is
4115 begin
4116 pragma Assert (Nkind (N) in N_Entity);
4117 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag240;
4118 end Flag240;
4120 function Flag241 (N : Node_Id) return Boolean is
4121 begin
4122 pragma Assert (Nkind (N) in N_Entity);
4123 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag241;
4124 end Flag241;
4126 function Flag242 (N : Node_Id) return Boolean is
4127 begin
4128 pragma Assert (Nkind (N) in N_Entity);
4129 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag242;
4130 end Flag242;
4132 function Flag243 (N : Node_Id) return Boolean is
4133 begin
4134 pragma Assert (Nkind (N) in N_Entity);
4135 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag243;
4136 end Flag243;
4138 function Flag244 (N : Node_Id) return Boolean is
4139 begin
4140 pragma Assert (Nkind (N) in N_Entity);
4141 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag244;
4142 end Flag244;
4144 function Flag245 (N : Node_Id) return Boolean is
4145 begin
4146 pragma Assert (Nkind (N) in N_Entity);
4147 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag245;
4148 end Flag245;
4150 function Flag246 (N : Node_Id) return Boolean is
4151 begin
4152 pragma Assert (Nkind (N) in N_Entity);
4153 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag246;
4154 end Flag246;
4156 function Flag247 (N : Node_Id) return Boolean is
4157 begin
4158 pragma Assert (Nkind (N) in N_Entity);
4159 return To_Flag_Word5 (Nodes.Table (N + 4).Field12).Flag247;
4160 end Flag247;
4162 procedure Set_Nkind (N : Node_Id; Val : Node_Kind) is
4163 begin
4164 pragma Assert (N <= Nodes.Last);
4165 Nodes.Table (N).Nkind := Val;
4166 end Set_Nkind;
4168 procedure Set_Field1 (N : Node_Id; Val : Union_Id) is
4169 begin
4170 pragma Assert (N <= Nodes.Last);
4171 Nodes.Table (N).Field1 := Val;
4172 end Set_Field1;
4174 procedure Set_Field2 (N : Node_Id; Val : Union_Id) is
4175 begin
4176 pragma Assert (N <= Nodes.Last);
4177 Nodes.Table (N).Field2 := Val;
4178 end Set_Field2;
4180 procedure Set_Field3 (N : Node_Id; Val : Union_Id) is
4181 begin
4182 pragma Assert (N <= Nodes.Last);
4183 Nodes.Table (N).Field3 := Val;
4184 end Set_Field3;
4186 procedure Set_Field4 (N : Node_Id; Val : Union_Id) is
4187 begin
4188 pragma Assert (N <= Nodes.Last);
4189 Nodes.Table (N).Field4 := Val;
4190 end Set_Field4;
4192 procedure Set_Field5 (N : Node_Id; Val : Union_Id) is
4193 begin
4194 pragma Assert (N <= Nodes.Last);
4195 Nodes.Table (N).Field5 := Val;
4196 end Set_Field5;
4198 procedure Set_Field6 (N : Node_Id; Val : Union_Id) is
4199 begin
4200 pragma Assert (Nkind (N) in N_Entity);
4201 Nodes.Table (N + 1).Field6 := Val;
4202 end Set_Field6;
4204 procedure Set_Field7 (N : Node_Id; Val : Union_Id) is
4205 begin
4206 pragma Assert (Nkind (N) in N_Entity);
4207 Nodes.Table (N + 1).Field7 := Val;
4208 end Set_Field7;
4210 procedure Set_Field8 (N : Node_Id; Val : Union_Id) is
4211 begin
4212 pragma Assert (Nkind (N) in N_Entity);
4213 Nodes.Table (N + 1).Field8 := Val;
4214 end Set_Field8;
4216 procedure Set_Field9 (N : Node_Id; Val : Union_Id) is
4217 begin
4218 pragma Assert (Nkind (N) in N_Entity);
4219 Nodes.Table (N + 1).Field9 := Val;
4220 end Set_Field9;
4222 procedure Set_Field10 (N : Node_Id; Val : Union_Id) is
4223 begin
4224 pragma Assert (Nkind (N) in N_Entity);
4225 Nodes.Table (N + 1).Field10 := Val;
4226 end Set_Field10;
4228 procedure Set_Field11 (N : Node_Id; Val : Union_Id) is
4229 begin
4230 pragma Assert (Nkind (N) in N_Entity);
4231 Nodes.Table (N + 1).Field11 := Val;
4232 end Set_Field11;
4234 procedure Set_Field12 (N : Node_Id; Val : Union_Id) is
4235 begin
4236 pragma Assert (Nkind (N) in N_Entity);
4237 Nodes.Table (N + 1).Field12 := Val;
4238 end Set_Field12;
4240 procedure Set_Field13 (N : Node_Id; Val : Union_Id) is
4241 begin
4242 pragma Assert (Nkind (N) in N_Entity);
4243 Nodes.Table (N + 2).Field6 := Val;
4244 end Set_Field13;
4246 procedure Set_Field14 (N : Node_Id; Val : Union_Id) is
4247 begin
4248 pragma Assert (Nkind (N) in N_Entity);
4249 Nodes.Table (N + 2).Field7 := Val;
4250 end Set_Field14;
4252 procedure Set_Field15 (N : Node_Id; Val : Union_Id) is
4253 begin
4254 pragma Assert (Nkind (N) in N_Entity);
4255 Nodes.Table (N + 2).Field8 := Val;
4256 end Set_Field15;
4258 procedure Set_Field16 (N : Node_Id; Val : Union_Id) is
4259 begin
4260 pragma Assert (Nkind (N) in N_Entity);
4261 Nodes.Table (N + 2).Field9 := Val;
4262 end Set_Field16;
4264 procedure Set_Field17 (N : Node_Id; Val : Union_Id) is
4265 begin
4266 pragma Assert (Nkind (N) in N_Entity);
4267 Nodes.Table (N + 2).Field10 := Val;
4268 end Set_Field17;
4270 procedure Set_Field18 (N : Node_Id; Val : Union_Id) is
4271 begin
4272 pragma Assert (Nkind (N) in N_Entity);
4273 Nodes.Table (N + 2).Field11 := Val;
4274 end Set_Field18;
4276 procedure Set_Field19 (N : Node_Id; Val : Union_Id) is
4277 begin
4278 pragma Assert (Nkind (N) in N_Entity);
4279 Nodes.Table (N + 3).Field6 := Val;
4280 end Set_Field19;
4282 procedure Set_Field20 (N : Node_Id; Val : Union_Id) is
4283 begin
4284 pragma Assert (Nkind (N) in N_Entity);
4285 Nodes.Table (N + 3).Field7 := Val;
4286 end Set_Field20;
4288 procedure Set_Field21 (N : Node_Id; Val : Union_Id) is
4289 begin
4290 pragma Assert (Nkind (N) in N_Entity);
4291 Nodes.Table (N + 3).Field8 := Val;
4292 end Set_Field21;
4294 procedure Set_Field22 (N : Node_Id; Val : Union_Id) is
4295 begin
4296 pragma Assert (Nkind (N) in N_Entity);
4297 Nodes.Table (N + 3).Field9 := Val;
4298 end Set_Field22;
4300 procedure Set_Field23 (N : Node_Id; Val : Union_Id) is
4301 begin
4302 pragma Assert (Nkind (N) in N_Entity);
4303 Nodes.Table (N + 3).Field10 := Val;
4304 end Set_Field23;
4306 procedure Set_Field24 (N : Node_Id; Val : Union_Id) is
4307 begin
4308 pragma Assert (Nkind (N) in N_Entity);
4309 Nodes.Table (N + 4).Field6 := Val;
4310 end Set_Field24;
4312 procedure Set_Field25 (N : Node_Id; Val : Union_Id) is
4313 begin
4314 pragma Assert (Nkind (N) in N_Entity);
4315 Nodes.Table (N + 4).Field7 := Val;
4316 end Set_Field25;
4318 procedure Set_Field26 (N : Node_Id; Val : Union_Id) is
4319 begin
4320 pragma Assert (Nkind (N) in N_Entity);
4321 Nodes.Table (N + 4).Field8 := Val;
4322 end Set_Field26;
4324 procedure Set_Field27 (N : Node_Id; Val : Union_Id) is
4325 begin
4326 pragma Assert (Nkind (N) in N_Entity);
4327 Nodes.Table (N + 4).Field9 := Val;
4328 end Set_Field27;
4330 procedure Set_Field28 (N : Node_Id; Val : Union_Id) is
4331 begin
4332 pragma Assert (Nkind (N) in N_Entity);
4333 Nodes.Table (N + 4).Field10 := Val;
4334 end Set_Field28;
4336 procedure Set_Node1 (N : Node_Id; Val : Node_Id) is
4337 begin
4338 pragma Assert (N <= Nodes.Last);
4339 Nodes.Table (N).Field1 := Union_Id (Val);
4340 end Set_Node1;
4342 procedure Set_Node2 (N : Node_Id; Val : Node_Id) is
4343 begin
4344 pragma Assert (N <= Nodes.Last);
4345 Nodes.Table (N).Field2 := Union_Id (Val);
4346 end Set_Node2;
4348 procedure Set_Node3 (N : Node_Id; Val : Node_Id) is
4349 begin
4350 pragma Assert (N <= Nodes.Last);
4351 Nodes.Table (N).Field3 := Union_Id (Val);
4352 end Set_Node3;
4354 procedure Set_Node4 (N : Node_Id; Val : Node_Id) is
4355 begin
4356 pragma Assert (N <= Nodes.Last);
4357 Nodes.Table (N).Field4 := Union_Id (Val);
4358 end Set_Node4;
4360 procedure Set_Node5 (N : Node_Id; Val : Node_Id) is
4361 begin
4362 pragma Assert (N <= Nodes.Last);
4363 Nodes.Table (N).Field5 := Union_Id (Val);
4364 end Set_Node5;
4366 procedure Set_Node6 (N : Node_Id; Val : Node_Id) is
4367 begin
4368 pragma Assert (Nkind (N) in N_Entity);
4369 Nodes.Table (N + 1).Field6 := Union_Id (Val);
4370 end Set_Node6;
4372 procedure Set_Node7 (N : Node_Id; Val : Node_Id) is
4373 begin
4374 pragma Assert (Nkind (N) in N_Entity);
4375 Nodes.Table (N + 1).Field7 := Union_Id (Val);
4376 end Set_Node7;
4378 procedure Set_Node8 (N : Node_Id; Val : Node_Id) is
4379 begin
4380 pragma Assert (Nkind (N) in N_Entity);
4381 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4382 end Set_Node8;
4384 procedure Set_Node9 (N : Node_Id; Val : Node_Id) is
4385 begin
4386 pragma Assert (Nkind (N) in N_Entity);
4387 Nodes.Table (N + 1).Field9 := Union_Id (Val);
4388 end Set_Node9;
4390 procedure Set_Node10 (N : Node_Id; Val : Node_Id) is
4391 begin
4392 pragma Assert (Nkind (N) in N_Entity);
4393 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4394 end Set_Node10;
4396 procedure Set_Node11 (N : Node_Id; Val : Node_Id) is
4397 begin
4398 pragma Assert (Nkind (N) in N_Entity);
4399 Nodes.Table (N + 1).Field11 := Union_Id (Val);
4400 end Set_Node11;
4402 procedure Set_Node12 (N : Node_Id; Val : Node_Id) is
4403 begin
4404 pragma Assert (Nkind (N) in N_Entity);
4405 Nodes.Table (N + 1).Field12 := Union_Id (Val);
4406 end Set_Node12;
4408 procedure Set_Node13 (N : Node_Id; Val : Node_Id) is
4409 begin
4410 pragma Assert (Nkind (N) in N_Entity);
4411 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4412 end Set_Node13;
4414 procedure Set_Node14 (N : Node_Id; Val : Node_Id) is
4415 begin
4416 pragma Assert (Nkind (N) in N_Entity);
4417 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4418 end Set_Node14;
4420 procedure Set_Node15 (N : Node_Id; Val : Node_Id) is
4421 begin
4422 pragma Assert (Nkind (N) in N_Entity);
4423 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4424 end Set_Node15;
4426 procedure Set_Node16 (N : Node_Id; Val : Node_Id) is
4427 begin
4428 pragma Assert (Nkind (N) in N_Entity);
4429 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4430 end Set_Node16;
4432 procedure Set_Node17 (N : Node_Id; Val : Node_Id) is
4433 begin
4434 pragma Assert (Nkind (N) in N_Entity);
4435 Nodes.Table (N + 2).Field10 := Union_Id (Val);
4436 end Set_Node17;
4438 procedure Set_Node18 (N : Node_Id; Val : Node_Id) is
4439 begin
4440 pragma Assert (Nkind (N) in N_Entity);
4441 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4442 end Set_Node18;
4444 procedure Set_Node19 (N : Node_Id; Val : Node_Id) is
4445 begin
4446 pragma Assert (Nkind (N) in N_Entity);
4447 Nodes.Table (N + 3).Field6 := Union_Id (Val);
4448 end Set_Node19;
4450 procedure Set_Node20 (N : Node_Id; Val : Node_Id) is
4451 begin
4452 pragma Assert (Nkind (N) in N_Entity);
4453 Nodes.Table (N + 3).Field7 := Union_Id (Val);
4454 end Set_Node20;
4456 procedure Set_Node21 (N : Node_Id; Val : Node_Id) is
4457 begin
4458 pragma Assert (Nkind (N) in N_Entity);
4459 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4460 end Set_Node21;
4462 procedure Set_Node22 (N : Node_Id; Val : Node_Id) is
4463 begin
4464 pragma Assert (Nkind (N) in N_Entity);
4465 Nodes.Table (N + 3).Field9 := Union_Id (Val);
4466 end Set_Node22;
4468 procedure Set_Node23 (N : Node_Id; Val : Node_Id) is
4469 begin
4470 pragma Assert (Nkind (N) in N_Entity);
4471 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4472 end Set_Node23;
4474 procedure Set_Node24 (N : Node_Id; Val : Node_Id) is
4475 begin
4476 pragma Assert (Nkind (N) in N_Entity);
4477 Nodes.Table (N + 4).Field6 := Union_Id (Val);
4478 end Set_Node24;
4480 procedure Set_Node25 (N : Node_Id; Val : Node_Id) is
4481 begin
4482 pragma Assert (Nkind (N) in N_Entity);
4483 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4484 end Set_Node25;
4486 procedure Set_Node26 (N : Node_Id; Val : Node_Id) is
4487 begin
4488 pragma Assert (Nkind (N) in N_Entity);
4489 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4490 end Set_Node26;
4492 procedure Set_Node27 (N : Node_Id; Val : Node_Id) is
4493 begin
4494 pragma Assert (Nkind (N) in N_Entity);
4495 Nodes.Table (N + 4).Field9 := Union_Id (Val);
4496 end Set_Node27;
4498 procedure Set_Node28 (N : Node_Id; Val : Node_Id) is
4499 begin
4500 pragma Assert (Nkind (N) in N_Entity);
4501 Nodes.Table (N + 4).Field10 := Union_Id (Val);
4502 end Set_Node28;
4504 procedure Set_List1 (N : Node_Id; Val : List_Id) is
4505 begin
4506 pragma Assert (N <= Nodes.Last);
4507 Nodes.Table (N).Field1 := Union_Id (Val);
4508 end Set_List1;
4510 procedure Set_List2 (N : Node_Id; Val : List_Id) is
4511 begin
4512 pragma Assert (N <= Nodes.Last);
4513 Nodes.Table (N).Field2 := Union_Id (Val);
4514 end Set_List2;
4516 procedure Set_List3 (N : Node_Id; Val : List_Id) is
4517 begin
4518 pragma Assert (N <= Nodes.Last);
4519 Nodes.Table (N).Field3 := Union_Id (Val);
4520 end Set_List3;
4522 procedure Set_List4 (N : Node_Id; Val : List_Id) is
4523 begin
4524 pragma Assert (N <= Nodes.Last);
4525 Nodes.Table (N).Field4 := Union_Id (Val);
4526 end Set_List4;
4528 procedure Set_List5 (N : Node_Id; Val : List_Id) is
4529 begin
4530 pragma Assert (N <= Nodes.Last);
4531 Nodes.Table (N).Field5 := Union_Id (Val);
4532 end Set_List5;
4534 procedure Set_List10 (N : Node_Id; Val : List_Id) is
4535 begin
4536 pragma Assert (Nkind (N) in N_Entity);
4537 Nodes.Table (N + 1).Field10 := Union_Id (Val);
4538 end Set_List10;
4540 procedure Set_List14 (N : Node_Id; Val : List_Id) is
4541 begin
4542 pragma Assert (Nkind (N) in N_Entity);
4543 Nodes.Table (N + 2).Field7 := Union_Id (Val);
4544 end Set_List14;
4546 procedure Set_Elist1 (N : Node_Id; Val : Elist_Id) is
4547 begin
4548 Nodes.Table (N).Field1 := Union_Id (Val);
4549 end Set_Elist1;
4551 procedure Set_Elist2 (N : Node_Id; Val : Elist_Id) is
4552 begin
4553 Nodes.Table (N).Field2 := Union_Id (Val);
4554 end Set_Elist2;
4556 procedure Set_Elist3 (N : Node_Id; Val : Elist_Id) is
4557 begin
4558 Nodes.Table (N).Field3 := Union_Id (Val);
4559 end Set_Elist3;
4561 procedure Set_Elist4 (N : Node_Id; Val : Elist_Id) is
4562 begin
4563 Nodes.Table (N).Field4 := Union_Id (Val);
4564 end Set_Elist4;
4566 procedure Set_Elist8 (N : Node_Id; Val : Elist_Id) is
4567 begin
4568 pragma Assert (Nkind (N) in N_Entity);
4569 Nodes.Table (N + 1).Field8 := Union_Id (Val);
4570 end Set_Elist8;
4572 procedure Set_Elist13 (N : Node_Id; Val : Elist_Id) is
4573 begin
4574 pragma Assert (Nkind (N) in N_Entity);
4575 Nodes.Table (N + 2).Field6 := Union_Id (Val);
4576 end Set_Elist13;
4578 procedure Set_Elist15 (N : Node_Id; Val : Elist_Id) is
4579 begin
4580 pragma Assert (Nkind (N) in N_Entity);
4581 Nodes.Table (N + 2).Field8 := Union_Id (Val);
4582 end Set_Elist15;
4584 procedure Set_Elist16 (N : Node_Id; Val : Elist_Id) is
4585 begin
4586 pragma Assert (Nkind (N) in N_Entity);
4587 Nodes.Table (N + 2).Field9 := Union_Id (Val);
4588 end Set_Elist16;
4590 procedure Set_Elist18 (N : Node_Id; Val : Elist_Id) is
4591 begin
4592 pragma Assert (Nkind (N) in N_Entity);
4593 Nodes.Table (N + 2).Field11 := Union_Id (Val);
4594 end Set_Elist18;
4596 procedure Set_Elist21 (N : Node_Id; Val : Elist_Id) is
4597 begin
4598 pragma Assert (Nkind (N) in N_Entity);
4599 Nodes.Table (N + 3).Field8 := Union_Id (Val);
4600 end Set_Elist21;
4602 procedure Set_Elist23 (N : Node_Id; Val : Elist_Id) is
4603 begin
4604 pragma Assert (Nkind (N) in N_Entity);
4605 Nodes.Table (N + 3).Field10 := Union_Id (Val);
4606 end Set_Elist23;
4608 procedure Set_Elist25 (N : Node_Id; Val : Elist_Id) is
4609 begin
4610 pragma Assert (Nkind (N) in N_Entity);
4611 Nodes.Table (N + 4).Field7 := Union_Id (Val);
4612 end Set_Elist25;
4614 procedure Set_Elist26 (N : Node_Id; Val : Elist_Id) is
4615 begin
4616 pragma Assert (Nkind (N) in N_Entity);
4617 Nodes.Table (N + 4).Field8 := Union_Id (Val);
4618 end Set_Elist26;
4620 procedure Set_Name1 (N : Node_Id; Val : Name_Id) is
4621 begin
4622 pragma Assert (N <= Nodes.Last);
4623 Nodes.Table (N).Field1 := Union_Id (Val);
4624 end Set_Name1;
4626 procedure Set_Name2 (N : Node_Id; Val : Name_Id) is
4627 begin
4628 pragma Assert (N <= Nodes.Last);
4629 Nodes.Table (N).Field2 := Union_Id (Val);
4630 end Set_Name2;
4632 procedure Set_Str3 (N : Node_Id; Val : String_Id) is
4633 begin
4634 pragma Assert (N <= Nodes.Last);
4635 Nodes.Table (N).Field3 := Union_Id (Val);
4636 end Set_Str3;
4638 procedure Set_Uint2 (N : Node_Id; Val : Uint) is
4639 begin
4640 pragma Assert (N <= Nodes.Last);
4641 Nodes.Table (N).Field2 := To_Union (Val);
4642 end Set_Uint2;
4644 procedure Set_Uint3 (N : Node_Id; Val : Uint) is
4645 begin
4646 pragma Assert (N <= Nodes.Last);
4647 Nodes.Table (N).Field3 := To_Union (Val);
4648 end Set_Uint3;
4650 procedure Set_Uint4 (N : Node_Id; Val : Uint) is
4651 begin
4652 pragma Assert (N <= Nodes.Last);
4653 Nodes.Table (N).Field4 := To_Union (Val);
4654 end Set_Uint4;
4656 procedure Set_Uint5 (N : Node_Id; Val : Uint) is
4657 begin
4658 pragma Assert (N <= Nodes.Last);
4659 Nodes.Table (N).Field5 := To_Union (Val);
4660 end Set_Uint5;
4662 procedure Set_Uint8 (N : Node_Id; Val : Uint) is
4663 begin
4664 pragma Assert (Nkind (N) in N_Entity);
4665 Nodes.Table (N + 1).Field8 := To_Union (Val);
4666 end Set_Uint8;
4668 procedure Set_Uint9 (N : Node_Id; Val : Uint) is
4669 begin
4670 pragma Assert (Nkind (N) in N_Entity);
4671 Nodes.Table (N + 1).Field9 := To_Union (Val);
4672 end Set_Uint9;
4674 procedure Set_Uint10 (N : Node_Id; Val : Uint) is
4675 begin
4676 pragma Assert (Nkind (N) in N_Entity);
4677 Nodes.Table (N + 1).Field10 := To_Union (Val);
4678 end Set_Uint10;
4680 procedure Set_Uint11 (N : Node_Id; Val : Uint) is
4681 begin
4682 pragma Assert (Nkind (N) in N_Entity);
4683 Nodes.Table (N + 1).Field11 := To_Union (Val);
4684 end Set_Uint11;
4686 procedure Set_Uint12 (N : Node_Id; Val : Uint) is
4687 begin
4688 pragma Assert (Nkind (N) in N_Entity);
4689 Nodes.Table (N + 1).Field12 := To_Union (Val);
4690 end Set_Uint12;
4692 procedure Set_Uint13 (N : Node_Id; Val : Uint) is
4693 begin
4694 pragma Assert (Nkind (N) in N_Entity);
4695 Nodes.Table (N + 2).Field6 := To_Union (Val);
4696 end Set_Uint13;
4698 procedure Set_Uint14 (N : Node_Id; Val : Uint) is
4699 begin
4700 pragma Assert (Nkind (N) in N_Entity);
4701 Nodes.Table (N + 2).Field7 := To_Union (Val);
4702 end Set_Uint14;
4704 procedure Set_Uint15 (N : Node_Id; Val : Uint) is
4705 begin
4706 pragma Assert (Nkind (N) in N_Entity);
4707 Nodes.Table (N + 2).Field8 := To_Union (Val);
4708 end Set_Uint15;
4710 procedure Set_Uint16 (N : Node_Id; Val : Uint) is
4711 begin
4712 pragma Assert (Nkind (N) in N_Entity);
4713 Nodes.Table (N + 2).Field9 := To_Union (Val);
4714 end Set_Uint16;
4716 procedure Set_Uint17 (N : Node_Id; Val : Uint) is
4717 begin
4718 pragma Assert (Nkind (N) in N_Entity);
4719 Nodes.Table (N + 2).Field10 := To_Union (Val);
4720 end Set_Uint17;
4722 procedure Set_Uint22 (N : Node_Id; Val : Uint) is
4723 begin
4724 pragma Assert (Nkind (N) in N_Entity);
4725 Nodes.Table (N + 3).Field9 := To_Union (Val);
4726 end Set_Uint22;
4728 procedure Set_Ureal3 (N : Node_Id; Val : Ureal) is
4729 begin
4730 pragma Assert (N <= Nodes.Last);
4731 Nodes.Table (N).Field3 := To_Union (Val);
4732 end Set_Ureal3;
4734 procedure Set_Ureal18 (N : Node_Id; Val : Ureal) is
4735 begin
4736 pragma Assert (Nkind (N) in N_Entity);
4737 Nodes.Table (N + 2).Field11 := To_Union (Val);
4738 end Set_Ureal18;
4740 procedure Set_Ureal21 (N : Node_Id; Val : Ureal) is
4741 begin
4742 pragma Assert (Nkind (N) in N_Entity);
4743 Nodes.Table (N + 3).Field8 := To_Union (Val);
4744 end Set_Ureal21;
4746 procedure Set_Flag4 (N : Node_Id; Val : Boolean) is
4747 begin
4748 pragma Assert (N <= Nodes.Last);
4749 Nodes.Table (N).Flag4 := Val;
4750 end Set_Flag4;
4752 procedure Set_Flag5 (N : Node_Id; Val : Boolean) is
4753 begin
4754 pragma Assert (N <= Nodes.Last);
4755 Nodes.Table (N).Flag5 := Val;
4756 end Set_Flag5;
4758 procedure Set_Flag6 (N : Node_Id; Val : Boolean) is
4759 begin
4760 pragma Assert (N <= Nodes.Last);
4761 Nodes.Table (N).Flag6 := Val;
4762 end Set_Flag6;
4764 procedure Set_Flag7 (N : Node_Id; Val : Boolean) is
4765 begin
4766 pragma Assert (N <= Nodes.Last);
4767 Nodes.Table (N).Flag7 := Val;
4768 end Set_Flag7;
4770 procedure Set_Flag8 (N : Node_Id; Val : Boolean) is
4771 begin
4772 pragma Assert (N <= Nodes.Last);
4773 Nodes.Table (N).Flag8 := Val;
4774 end Set_Flag8;
4776 procedure Set_Flag9 (N : Node_Id; Val : Boolean) is
4777 begin
4778 pragma Assert (N <= Nodes.Last);
4779 Nodes.Table (N).Flag9 := Val;
4780 end Set_Flag9;
4782 procedure Set_Flag10 (N : Node_Id; Val : Boolean) is
4783 begin
4784 pragma Assert (N <= Nodes.Last);
4785 Nodes.Table (N).Flag10 := Val;
4786 end Set_Flag10;
4788 procedure Set_Flag11 (N : Node_Id; Val : Boolean) is
4789 begin
4790 pragma Assert (N <= Nodes.Last);
4791 Nodes.Table (N).Flag11 := Val;
4792 end Set_Flag11;
4794 procedure Set_Flag12 (N : Node_Id; Val : Boolean) is
4795 begin
4796 pragma Assert (N <= Nodes.Last);
4797 Nodes.Table (N).Flag12 := Val;
4798 end Set_Flag12;
4800 procedure Set_Flag13 (N : Node_Id; Val : Boolean) is
4801 begin
4802 pragma Assert (N <= Nodes.Last);
4803 Nodes.Table (N).Flag13 := Val;
4804 end Set_Flag13;
4806 procedure Set_Flag14 (N : Node_Id; Val : Boolean) is
4807 begin
4808 pragma Assert (N <= Nodes.Last);
4809 Nodes.Table (N).Flag14 := Val;
4810 end Set_Flag14;
4812 procedure Set_Flag15 (N : Node_Id; Val : Boolean) is
4813 begin
4814 pragma Assert (N <= Nodes.Last);
4815 Nodes.Table (N).Flag15 := Val;
4816 end Set_Flag15;
4818 procedure Set_Flag16 (N : Node_Id; Val : Boolean) is
4819 begin
4820 pragma Assert (N <= Nodes.Last);
4821 Nodes.Table (N).Flag16 := Val;
4822 end Set_Flag16;
4824 procedure Set_Flag17 (N : Node_Id; Val : Boolean) is
4825 begin
4826 pragma Assert (N <= Nodes.Last);
4827 Nodes.Table (N).Flag17 := Val;
4828 end Set_Flag17;
4830 procedure Set_Flag18 (N : Node_Id; Val : Boolean) is
4831 begin
4832 pragma Assert (N <= Nodes.Last);
4833 Nodes.Table (N).Flag18 := Val;
4834 end Set_Flag18;
4836 procedure Set_Flag19 (N : Node_Id; Val : Boolean) is
4837 begin
4838 pragma Assert (Nkind (N) in N_Entity);
4839 Nodes.Table (N + 1).In_List := Val;
4840 end Set_Flag19;
4842 procedure Set_Flag20 (N : Node_Id; Val : Boolean) is
4843 begin
4844 pragma Assert (Nkind (N) in N_Entity);
4845 Nodes.Table (N + 1).Unused_1 := Val;
4846 end Set_Flag20;
4848 procedure Set_Flag21 (N : Node_Id; Val : Boolean) is
4849 begin
4850 pragma Assert (Nkind (N) in N_Entity);
4851 Nodes.Table (N + 1).Rewrite_Ins := Val;
4852 end Set_Flag21;
4854 procedure Set_Flag22 (N : Node_Id; Val : Boolean) is
4855 begin
4856 pragma Assert (Nkind (N) in N_Entity);
4857 Nodes.Table (N + 1).Analyzed := Val;
4858 end Set_Flag22;
4860 procedure Set_Flag23 (N : Node_Id; Val : Boolean) is
4861 begin
4862 pragma Assert (Nkind (N) in N_Entity);
4863 Nodes.Table (N + 1).Comes_From_Source := Val;
4864 end Set_Flag23;
4866 procedure Set_Flag24 (N : Node_Id; Val : Boolean) is
4867 begin
4868 pragma Assert (Nkind (N) in N_Entity);
4869 Nodes.Table (N + 1).Error_Posted := Val;
4870 end Set_Flag24;
4872 procedure Set_Flag25 (N : Node_Id; Val : Boolean) is
4873 begin
4874 pragma Assert (Nkind (N) in N_Entity);
4875 Nodes.Table (N + 1).Flag4 := Val;
4876 end Set_Flag25;
4878 procedure Set_Flag26 (N : Node_Id; Val : Boolean) is
4879 begin
4880 pragma Assert (Nkind (N) in N_Entity);
4881 Nodes.Table (N + 1).Flag5 := Val;
4882 end Set_Flag26;
4884 procedure Set_Flag27 (N : Node_Id; Val : Boolean) is
4885 begin
4886 pragma Assert (Nkind (N) in N_Entity);
4887 Nodes.Table (N + 1).Flag6 := Val;
4888 end Set_Flag27;
4890 procedure Set_Flag28 (N : Node_Id; Val : Boolean) is
4891 begin
4892 pragma Assert (Nkind (N) in N_Entity);
4893 Nodes.Table (N + 1).Flag7 := Val;
4894 end Set_Flag28;
4896 procedure Set_Flag29 (N : Node_Id; Val : Boolean) is
4897 begin
4898 pragma Assert (Nkind (N) in N_Entity);
4899 Nodes.Table (N + 1).Flag8 := Val;
4900 end Set_Flag29;
4902 procedure Set_Flag30 (N : Node_Id; Val : Boolean) is
4903 begin
4904 pragma Assert (Nkind (N) in N_Entity);
4905 Nodes.Table (N + 1).Flag9 := Val;
4906 end Set_Flag30;
4908 procedure Set_Flag31 (N : Node_Id; Val : Boolean) is
4909 begin
4910 pragma Assert (Nkind (N) in N_Entity);
4911 Nodes.Table (N + 1).Flag10 := Val;
4912 end Set_Flag31;
4914 procedure Set_Flag32 (N : Node_Id; Val : Boolean) is
4915 begin
4916 pragma Assert (Nkind (N) in N_Entity);
4917 Nodes.Table (N + 1).Flag11 := Val;
4918 end Set_Flag32;
4920 procedure Set_Flag33 (N : Node_Id; Val : Boolean) is
4921 begin
4922 pragma Assert (Nkind (N) in N_Entity);
4923 Nodes.Table (N + 1).Flag12 := Val;
4924 end Set_Flag33;
4926 procedure Set_Flag34 (N : Node_Id; Val : Boolean) is
4927 begin
4928 pragma Assert (Nkind (N) in N_Entity);
4929 Nodes.Table (N + 1).Flag13 := Val;
4930 end Set_Flag34;
4932 procedure Set_Flag35 (N : Node_Id; Val : Boolean) is
4933 begin
4934 pragma Assert (Nkind (N) in N_Entity);
4935 Nodes.Table (N + 1).Flag14 := Val;
4936 end Set_Flag35;
4938 procedure Set_Flag36 (N : Node_Id; Val : Boolean) is
4939 begin
4940 pragma Assert (Nkind (N) in N_Entity);
4941 Nodes.Table (N + 1).Flag15 := Val;
4942 end Set_Flag36;
4944 procedure Set_Flag37 (N : Node_Id; Val : Boolean) is
4945 begin
4946 pragma Assert (Nkind (N) in N_Entity);
4947 Nodes.Table (N + 1).Flag16 := Val;
4948 end Set_Flag37;
4950 procedure Set_Flag38 (N : Node_Id; Val : Boolean) is
4951 begin
4952 pragma Assert (Nkind (N) in N_Entity);
4953 Nodes.Table (N + 1).Flag17 := Val;
4954 end Set_Flag38;
4956 procedure Set_Flag39 (N : Node_Id; Val : Boolean) is
4957 begin
4958 pragma Assert (Nkind (N) in N_Entity);
4959 Nodes.Table (N + 1).Flag18 := Val;
4960 end Set_Flag39;
4962 procedure Set_Flag40 (N : Node_Id; Val : Boolean) is
4963 begin
4964 pragma Assert (Nkind (N) in N_Entity);
4965 Nodes.Table (N + 2).In_List := Val;
4966 end Set_Flag40;
4968 procedure Set_Flag41 (N : Node_Id; Val : Boolean) is
4969 begin
4970 pragma Assert (Nkind (N) in N_Entity);
4971 Nodes.Table (N + 2).Unused_1 := Val;
4972 end Set_Flag41;
4974 procedure Set_Flag42 (N : Node_Id; Val : Boolean) is
4975 begin
4976 pragma Assert (Nkind (N) in N_Entity);
4977 Nodes.Table (N + 2).Rewrite_Ins := Val;
4978 end Set_Flag42;
4980 procedure Set_Flag43 (N : Node_Id; Val : Boolean) is
4981 begin
4982 pragma Assert (Nkind (N) in N_Entity);
4983 Nodes.Table (N + 2).Analyzed := Val;
4984 end Set_Flag43;
4986 procedure Set_Flag44 (N : Node_Id; Val : Boolean) is
4987 begin
4988 pragma Assert (Nkind (N) in N_Entity);
4989 Nodes.Table (N + 2).Comes_From_Source := Val;
4990 end Set_Flag44;
4992 procedure Set_Flag45 (N : Node_Id; Val : Boolean) is
4993 begin
4994 pragma Assert (Nkind (N) in N_Entity);
4995 Nodes.Table (N + 2).Error_Posted := Val;
4996 end Set_Flag45;
4998 procedure Set_Flag46 (N : Node_Id; Val : Boolean) is
4999 begin
5000 pragma Assert (Nkind (N) in N_Entity);
5001 Nodes.Table (N + 2).Flag4 := Val;
5002 end Set_Flag46;
5004 procedure Set_Flag47 (N : Node_Id; Val : Boolean) is
5005 begin
5006 pragma Assert (Nkind (N) in N_Entity);
5007 Nodes.Table (N + 2).Flag5 := Val;
5008 end Set_Flag47;
5010 procedure Set_Flag48 (N : Node_Id; Val : Boolean) is
5011 begin
5012 pragma Assert (Nkind (N) in N_Entity);
5013 Nodes.Table (N + 2).Flag6 := Val;
5014 end Set_Flag48;
5016 procedure Set_Flag49 (N : Node_Id; Val : Boolean) is
5017 begin
5018 pragma Assert (Nkind (N) in N_Entity);
5019 Nodes.Table (N + 2).Flag7 := Val;
5020 end Set_Flag49;
5022 procedure Set_Flag50 (N : Node_Id; Val : Boolean) is
5023 begin
5024 pragma Assert (Nkind (N) in N_Entity);
5025 Nodes.Table (N + 2).Flag8 := Val;
5026 end Set_Flag50;
5028 procedure Set_Flag51 (N : Node_Id; Val : Boolean) is
5029 begin
5030 pragma Assert (Nkind (N) in N_Entity);
5031 Nodes.Table (N + 2).Flag9 := Val;
5032 end Set_Flag51;
5034 procedure Set_Flag52 (N : Node_Id; Val : Boolean) is
5035 begin
5036 pragma Assert (Nkind (N) in N_Entity);
5037 Nodes.Table (N + 2).Flag10 := Val;
5038 end Set_Flag52;
5040 procedure Set_Flag53 (N : Node_Id; Val : Boolean) is
5041 begin
5042 pragma Assert (Nkind (N) in N_Entity);
5043 Nodes.Table (N + 2).Flag11 := Val;
5044 end Set_Flag53;
5046 procedure Set_Flag54 (N : Node_Id; Val : Boolean) is
5047 begin
5048 pragma Assert (Nkind (N) in N_Entity);
5049 Nodes.Table (N + 2).Flag12 := Val;
5050 end Set_Flag54;
5052 procedure Set_Flag55 (N : Node_Id; Val : Boolean) is
5053 begin
5054 pragma Assert (Nkind (N) in N_Entity);
5055 Nodes.Table (N + 2).Flag13 := Val;
5056 end Set_Flag55;
5058 procedure Set_Flag56 (N : Node_Id; Val : Boolean) is
5059 begin
5060 pragma Assert (Nkind (N) in N_Entity);
5061 Nodes.Table (N + 2).Flag14 := Val;
5062 end Set_Flag56;
5064 procedure Set_Flag57 (N : Node_Id; Val : Boolean) is
5065 begin
5066 pragma Assert (Nkind (N) in N_Entity);
5067 Nodes.Table (N + 2).Flag15 := Val;
5068 end Set_Flag57;
5070 procedure Set_Flag58 (N : Node_Id; Val : Boolean) is
5071 begin
5072 pragma Assert (Nkind (N) in N_Entity);
5073 Nodes.Table (N + 2).Flag16 := Val;
5074 end Set_Flag58;
5076 procedure Set_Flag59 (N : Node_Id; Val : Boolean) is
5077 begin
5078 pragma Assert (Nkind (N) in N_Entity);
5079 Nodes.Table (N + 2).Flag17 := Val;
5080 end Set_Flag59;
5082 procedure Set_Flag60 (N : Node_Id; Val : Boolean) is
5083 begin
5084 pragma Assert (Nkind (N) in N_Entity);
5085 Nodes.Table (N + 2).Flag18 := Val;
5086 end Set_Flag60;
5088 procedure Set_Flag61 (N : Node_Id; Val : Boolean) is
5089 begin
5090 pragma Assert (Nkind (N) in N_Entity);
5091 Nodes.Table (N + 1).Pflag1 := Val;
5092 end Set_Flag61;
5094 procedure Set_Flag62 (N : Node_Id; Val : Boolean) is
5095 begin
5096 pragma Assert (Nkind (N) in N_Entity);
5097 Nodes.Table (N + 1).Pflag2 := Val;
5098 end Set_Flag62;
5100 procedure Set_Flag63 (N : Node_Id; Val : Boolean) is
5101 begin
5102 pragma Assert (Nkind (N) in N_Entity);
5103 Nodes.Table (N + 2).Pflag1 := Val;
5104 end Set_Flag63;
5106 procedure Set_Flag64 (N : Node_Id; Val : Boolean) is
5107 begin
5108 pragma Assert (Nkind (N) in N_Entity);
5109 Nodes.Table (N + 2).Pflag2 := Val;
5110 end Set_Flag64;
5112 procedure Set_Flag65 (N : Node_Id; Val : Boolean) is
5113 begin
5114 pragma Assert (Nkind (N) in N_Entity);
5115 To_Flag_Byte_Ptr
5116 (Node_Kind_Ptr'
5117 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag65 := Val;
5118 end Set_Flag65;
5120 procedure Set_Flag66 (N : Node_Id; Val : Boolean) is
5121 begin
5122 pragma Assert (Nkind (N) in N_Entity);
5123 To_Flag_Byte_Ptr
5124 (Node_Kind_Ptr'
5125 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag66 := Val;
5126 end Set_Flag66;
5128 procedure Set_Flag67 (N : Node_Id; Val : Boolean) is
5129 begin
5130 pragma Assert (Nkind (N) in N_Entity);
5131 To_Flag_Byte_Ptr
5132 (Node_Kind_Ptr'
5133 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag67 := Val;
5134 end Set_Flag67;
5136 procedure Set_Flag68 (N : Node_Id; Val : Boolean) is
5137 begin
5138 pragma Assert (Nkind (N) in N_Entity);
5139 To_Flag_Byte_Ptr
5140 (Node_Kind_Ptr'
5141 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag68 := Val;
5142 end Set_Flag68;
5144 procedure Set_Flag69 (N : Node_Id; Val : Boolean) is
5145 begin
5146 pragma Assert (Nkind (N) in N_Entity);
5147 To_Flag_Byte_Ptr
5148 (Node_Kind_Ptr'
5149 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag69 := Val;
5150 end Set_Flag69;
5152 procedure Set_Flag70 (N : Node_Id; Val : Boolean) is
5153 begin
5154 pragma Assert (Nkind (N) in N_Entity);
5155 To_Flag_Byte_Ptr
5156 (Node_Kind_Ptr'
5157 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag70 := Val;
5158 end Set_Flag70;
5160 procedure Set_Flag71 (N : Node_Id; Val : Boolean) is
5161 begin
5162 pragma Assert (Nkind (N) in N_Entity);
5163 To_Flag_Byte_Ptr
5164 (Node_Kind_Ptr'
5165 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag71 := Val;
5166 end Set_Flag71;
5168 procedure Set_Flag72 (N : Node_Id; Val : Boolean) is
5169 begin
5170 pragma Assert (Nkind (N) in N_Entity);
5171 To_Flag_Byte_Ptr
5172 (Node_Kind_Ptr'
5173 (Nodes.Table (N + 2).Nkind'Unrestricted_Access)).Flag72 := Val;
5174 end Set_Flag72;
5176 procedure Set_Flag73 (N : Node_Id; Val : Boolean) is
5177 begin
5178 pragma Assert (Nkind (N) in N_Entity);
5179 To_Flag_Word_Ptr
5180 (Union_Id_Ptr'
5181 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag73 := Val;
5182 end Set_Flag73;
5184 procedure Set_Flag74 (N : Node_Id; Val : Boolean) is
5185 begin
5186 pragma Assert (Nkind (N) in N_Entity);
5187 To_Flag_Word_Ptr
5188 (Union_Id_Ptr'
5189 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag74 := Val;
5190 end Set_Flag74;
5192 procedure Set_Flag75 (N : Node_Id; Val : Boolean) is
5193 begin
5194 pragma Assert (Nkind (N) in N_Entity);
5195 To_Flag_Word_Ptr
5196 (Union_Id_Ptr'
5197 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag75 := Val;
5198 end Set_Flag75;
5200 procedure Set_Flag76 (N : Node_Id; Val : Boolean) is
5201 begin
5202 pragma Assert (Nkind (N) in N_Entity);
5203 To_Flag_Word_Ptr
5204 (Union_Id_Ptr'
5205 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag76 := Val;
5206 end Set_Flag76;
5208 procedure Set_Flag77 (N : Node_Id; Val : Boolean) is
5209 begin
5210 pragma Assert (Nkind (N) in N_Entity);
5211 To_Flag_Word_Ptr
5212 (Union_Id_Ptr'
5213 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag77 := Val;
5214 end Set_Flag77;
5216 procedure Set_Flag78 (N : Node_Id; Val : Boolean) is
5217 begin
5218 pragma Assert (Nkind (N) in N_Entity);
5219 To_Flag_Word_Ptr
5220 (Union_Id_Ptr'
5221 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag78 := Val;
5222 end Set_Flag78;
5224 procedure Set_Flag79 (N : Node_Id; Val : Boolean) is
5225 begin
5226 pragma Assert (Nkind (N) in N_Entity);
5227 To_Flag_Word_Ptr
5228 (Union_Id_Ptr'
5229 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag79 := Val;
5230 end Set_Flag79;
5232 procedure Set_Flag80 (N : Node_Id; Val : Boolean) is
5233 begin
5234 pragma Assert (Nkind (N) in N_Entity);
5235 To_Flag_Word_Ptr
5236 (Union_Id_Ptr'
5237 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag80 := Val;
5238 end Set_Flag80;
5240 procedure Set_Flag81 (N : Node_Id; Val : Boolean) is
5241 begin
5242 pragma Assert (Nkind (N) in N_Entity);
5243 To_Flag_Word_Ptr
5244 (Union_Id_Ptr'
5245 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag81 := Val;
5246 end Set_Flag81;
5248 procedure Set_Flag82 (N : Node_Id; Val : Boolean) is
5249 begin
5250 pragma Assert (Nkind (N) in N_Entity);
5251 To_Flag_Word_Ptr
5252 (Union_Id_Ptr'
5253 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag82 := Val;
5254 end Set_Flag82;
5256 procedure Set_Flag83 (N : Node_Id; Val : Boolean) is
5257 begin
5258 pragma Assert (Nkind (N) in N_Entity);
5259 To_Flag_Word_Ptr
5260 (Union_Id_Ptr'
5261 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag83 := Val;
5262 end Set_Flag83;
5264 procedure Set_Flag84 (N : Node_Id; Val : Boolean) is
5265 begin
5266 pragma Assert (Nkind (N) in N_Entity);
5267 To_Flag_Word_Ptr
5268 (Union_Id_Ptr'
5269 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag84 := Val;
5270 end Set_Flag84;
5272 procedure Set_Flag85 (N : Node_Id; Val : Boolean) is
5273 begin
5274 pragma Assert (Nkind (N) in N_Entity);
5275 To_Flag_Word_Ptr
5276 (Union_Id_Ptr'
5277 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag85 := Val;
5278 end Set_Flag85;
5280 procedure Set_Flag86 (N : Node_Id; Val : Boolean) is
5281 begin
5282 pragma Assert (Nkind (N) in N_Entity);
5283 To_Flag_Word_Ptr
5284 (Union_Id_Ptr'
5285 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag86 := Val;
5286 end Set_Flag86;
5288 procedure Set_Flag87 (N : Node_Id; Val : Boolean) is
5289 begin
5290 pragma Assert (Nkind (N) in N_Entity);
5291 To_Flag_Word_Ptr
5292 (Union_Id_Ptr'
5293 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag87 := Val;
5294 end Set_Flag87;
5296 procedure Set_Flag88 (N : Node_Id; Val : Boolean) is
5297 begin
5298 pragma Assert (Nkind (N) in N_Entity);
5299 To_Flag_Word_Ptr
5300 (Union_Id_Ptr'
5301 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag88 := Val;
5302 end Set_Flag88;
5304 procedure Set_Flag89 (N : Node_Id; Val : Boolean) is
5305 begin
5306 pragma Assert (Nkind (N) in N_Entity);
5307 To_Flag_Word_Ptr
5308 (Union_Id_Ptr'
5309 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag89 := Val;
5310 end Set_Flag89;
5312 procedure Set_Flag90 (N : Node_Id; Val : Boolean) is
5313 begin
5314 pragma Assert (Nkind (N) in N_Entity);
5315 To_Flag_Word_Ptr
5316 (Union_Id_Ptr'
5317 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag90 := Val;
5318 end Set_Flag90;
5320 procedure Set_Flag91 (N : Node_Id; Val : Boolean) is
5321 begin
5322 pragma Assert (Nkind (N) in N_Entity);
5323 To_Flag_Word_Ptr
5324 (Union_Id_Ptr'
5325 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag91 := Val;
5326 end Set_Flag91;
5328 procedure Set_Flag92 (N : Node_Id; Val : Boolean) is
5329 begin
5330 pragma Assert (Nkind (N) in N_Entity);
5331 To_Flag_Word_Ptr
5332 (Union_Id_Ptr'
5333 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag92 := Val;
5334 end Set_Flag92;
5336 procedure Set_Flag93 (N : Node_Id; Val : Boolean) is
5337 begin
5338 pragma Assert (Nkind (N) in N_Entity);
5339 To_Flag_Word_Ptr
5340 (Union_Id_Ptr'
5341 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag93 := Val;
5342 end Set_Flag93;
5344 procedure Set_Flag94 (N : Node_Id; Val : Boolean) is
5345 begin
5346 pragma Assert (Nkind (N) in N_Entity);
5347 To_Flag_Word_Ptr
5348 (Union_Id_Ptr'
5349 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag94 := Val;
5350 end Set_Flag94;
5352 procedure Set_Flag95 (N : Node_Id; Val : Boolean) is
5353 begin
5354 pragma Assert (Nkind (N) in N_Entity);
5355 To_Flag_Word_Ptr
5356 (Union_Id_Ptr'
5357 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag95 := Val;
5358 end Set_Flag95;
5360 procedure Set_Flag96 (N : Node_Id; Val : Boolean) is
5361 begin
5362 pragma Assert (Nkind (N) in N_Entity);
5363 To_Flag_Word_Ptr
5364 (Union_Id_Ptr'
5365 (Nodes.Table (N + 2).Field12'Unrestricted_Access)).Flag96 := Val;
5366 end Set_Flag96;
5368 procedure Set_Flag97 (N : Node_Id; Val : Boolean) is
5369 begin
5370 pragma Assert (Nkind (N) in N_Entity);
5371 To_Flag_Word2_Ptr
5372 (Union_Id_Ptr'
5373 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag97 := Val;
5374 end Set_Flag97;
5376 procedure Set_Flag98 (N : Node_Id; Val : Boolean) is
5377 begin
5378 pragma Assert (Nkind (N) in N_Entity);
5379 To_Flag_Word2_Ptr
5380 (Union_Id_Ptr'
5381 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag98 := Val;
5382 end Set_Flag98;
5384 procedure Set_Flag99 (N : Node_Id; Val : Boolean) is
5385 begin
5386 pragma Assert (Nkind (N) in N_Entity);
5387 To_Flag_Word2_Ptr
5388 (Union_Id_Ptr'
5389 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag99 := Val;
5390 end Set_Flag99;
5392 procedure Set_Flag100 (N : Node_Id; Val : Boolean) is
5393 begin
5394 pragma Assert (Nkind (N) in N_Entity);
5395 To_Flag_Word2_Ptr
5396 (Union_Id_Ptr'
5397 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag100 := Val;
5398 end Set_Flag100;
5400 procedure Set_Flag101 (N : Node_Id; Val : Boolean) is
5401 begin
5402 pragma Assert (Nkind (N) in N_Entity);
5403 To_Flag_Word2_Ptr
5404 (Union_Id_Ptr'
5405 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag101 := Val;
5406 end Set_Flag101;
5408 procedure Set_Flag102 (N : Node_Id; Val : Boolean) is
5409 begin
5410 pragma Assert (Nkind (N) in N_Entity);
5411 To_Flag_Word2_Ptr
5412 (Union_Id_Ptr'
5413 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag102 := Val;
5414 end Set_Flag102;
5416 procedure Set_Flag103 (N : Node_Id; Val : Boolean) is
5417 begin
5418 pragma Assert (Nkind (N) in N_Entity);
5419 To_Flag_Word2_Ptr
5420 (Union_Id_Ptr'
5421 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag103 := Val;
5422 end Set_Flag103;
5424 procedure Set_Flag104 (N : Node_Id; Val : Boolean) is
5425 begin
5426 pragma Assert (Nkind (N) in N_Entity);
5427 To_Flag_Word2_Ptr
5428 (Union_Id_Ptr'
5429 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag104 := Val;
5430 end Set_Flag104;
5432 procedure Set_Flag105 (N : Node_Id; Val : Boolean) is
5433 begin
5434 pragma Assert (Nkind (N) in N_Entity);
5435 To_Flag_Word2_Ptr
5436 (Union_Id_Ptr'
5437 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag105 := Val;
5438 end Set_Flag105;
5440 procedure Set_Flag106 (N : Node_Id; Val : Boolean) is
5441 begin
5442 pragma Assert (Nkind (N) in N_Entity);
5443 To_Flag_Word2_Ptr
5444 (Union_Id_Ptr'
5445 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag106 := Val;
5446 end Set_Flag106;
5448 procedure Set_Flag107 (N : Node_Id; Val : Boolean) is
5449 begin
5450 pragma Assert (Nkind (N) in N_Entity);
5451 To_Flag_Word2_Ptr
5452 (Union_Id_Ptr'
5453 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag107 := Val;
5454 end Set_Flag107;
5456 procedure Set_Flag108 (N : Node_Id; Val : Boolean) is
5457 begin
5458 pragma Assert (Nkind (N) in N_Entity);
5459 To_Flag_Word2_Ptr
5460 (Union_Id_Ptr'
5461 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag108 := Val;
5462 end Set_Flag108;
5464 procedure Set_Flag109 (N : Node_Id; Val : Boolean) is
5465 begin
5466 pragma Assert (Nkind (N) in N_Entity);
5467 To_Flag_Word2_Ptr
5468 (Union_Id_Ptr'
5469 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag109 := Val;
5470 end Set_Flag109;
5472 procedure Set_Flag110 (N : Node_Id; Val : Boolean) is
5473 begin
5474 pragma Assert (Nkind (N) in N_Entity);
5475 To_Flag_Word2_Ptr
5476 (Union_Id_Ptr'
5477 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag110 := Val;
5478 end Set_Flag110;
5480 procedure Set_Flag111 (N : Node_Id; Val : Boolean) is
5481 begin
5482 pragma Assert (Nkind (N) in N_Entity);
5483 To_Flag_Word2_Ptr
5484 (Union_Id_Ptr'
5485 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag111 := Val;
5486 end Set_Flag111;
5488 procedure Set_Flag112 (N : Node_Id; Val : Boolean) is
5489 begin
5490 pragma Assert (Nkind (N) in N_Entity);
5491 To_Flag_Word2_Ptr
5492 (Union_Id_Ptr'
5493 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag112 := Val;
5494 end Set_Flag112;
5496 procedure Set_Flag113 (N : Node_Id; Val : Boolean) is
5497 begin
5498 pragma Assert (Nkind (N) in N_Entity);
5499 To_Flag_Word2_Ptr
5500 (Union_Id_Ptr'
5501 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag113 := Val;
5502 end Set_Flag113;
5504 procedure Set_Flag114 (N : Node_Id; Val : Boolean) is
5505 begin
5506 pragma Assert (Nkind (N) in N_Entity);
5507 To_Flag_Word2_Ptr
5508 (Union_Id_Ptr'
5509 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag114 := Val;
5510 end Set_Flag114;
5512 procedure Set_Flag115 (N : Node_Id; Val : Boolean) is
5513 begin
5514 pragma Assert (Nkind (N) in N_Entity);
5515 To_Flag_Word2_Ptr
5516 (Union_Id_Ptr'
5517 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag115 := Val;
5518 end Set_Flag115;
5520 procedure Set_Flag116 (N : Node_Id; Val : Boolean) is
5521 begin
5522 pragma Assert (Nkind (N) in N_Entity);
5523 To_Flag_Word2_Ptr
5524 (Union_Id_Ptr'
5525 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag116 := Val;
5526 end Set_Flag116;
5528 procedure Set_Flag117 (N : Node_Id; Val : Boolean) is
5529 begin
5530 pragma Assert (Nkind (N) in N_Entity);
5531 To_Flag_Word2_Ptr
5532 (Union_Id_Ptr'
5533 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag117 := Val;
5534 end Set_Flag117;
5536 procedure Set_Flag118 (N : Node_Id; Val : Boolean) is
5537 begin
5538 pragma Assert (Nkind (N) in N_Entity);
5539 To_Flag_Word2_Ptr
5540 (Union_Id_Ptr'
5541 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag118 := Val;
5542 end Set_Flag118;
5544 procedure Set_Flag119 (N : Node_Id; Val : Boolean) is
5545 begin
5546 pragma Assert (Nkind (N) in N_Entity);
5547 To_Flag_Word2_Ptr
5548 (Union_Id_Ptr'
5549 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag119 := Val;
5550 end Set_Flag119;
5552 procedure Set_Flag120 (N : Node_Id; Val : Boolean) is
5553 begin
5554 pragma Assert (Nkind (N) in N_Entity);
5555 To_Flag_Word2_Ptr
5556 (Union_Id_Ptr'
5557 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag120 := Val;
5558 end Set_Flag120;
5560 procedure Set_Flag121 (N : Node_Id; Val : Boolean) is
5561 begin
5562 pragma Assert (Nkind (N) in N_Entity);
5563 To_Flag_Word2_Ptr
5564 (Union_Id_Ptr'
5565 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag121 := Val;
5566 end Set_Flag121;
5568 procedure Set_Flag122 (N : Node_Id; Val : Boolean) is
5569 begin
5570 pragma Assert (Nkind (N) in N_Entity);
5571 To_Flag_Word2_Ptr
5572 (Union_Id_Ptr'
5573 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag122 := Val;
5574 end Set_Flag122;
5576 procedure Set_Flag123 (N : Node_Id; Val : Boolean) is
5577 begin
5578 pragma Assert (Nkind (N) in N_Entity);
5579 To_Flag_Word2_Ptr
5580 (Union_Id_Ptr'
5581 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag123 := Val;
5582 end Set_Flag123;
5584 procedure Set_Flag124 (N : Node_Id; Val : Boolean) is
5585 begin
5586 pragma Assert (Nkind (N) in N_Entity);
5587 To_Flag_Word2_Ptr
5588 (Union_Id_Ptr'
5589 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag124 := Val;
5590 end Set_Flag124;
5592 procedure Set_Flag125 (N : Node_Id; Val : Boolean) is
5593 begin
5594 pragma Assert (Nkind (N) in N_Entity);
5595 To_Flag_Word2_Ptr
5596 (Union_Id_Ptr'
5597 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag125 := Val;
5598 end Set_Flag125;
5600 procedure Set_Flag126 (N : Node_Id; Val : Boolean) is
5601 begin
5602 pragma Assert (Nkind (N) in N_Entity);
5603 To_Flag_Word2_Ptr
5604 (Union_Id_Ptr'
5605 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag126 := Val;
5606 end Set_Flag126;
5608 procedure Set_Flag127 (N : Node_Id; Val : Boolean) is
5609 begin
5610 pragma Assert (Nkind (N) in N_Entity);
5611 To_Flag_Word2_Ptr
5612 (Union_Id_Ptr'
5613 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag127 := Val;
5614 end Set_Flag127;
5616 procedure Set_Flag128 (N : Node_Id; Val : Boolean) is
5617 begin
5618 pragma Assert (Nkind (N) in N_Entity);
5619 To_Flag_Word2_Ptr
5620 (Union_Id_Ptr'
5621 (Nodes.Table (N + 3).Field12'Unrestricted_Access)).Flag128 := Val;
5622 end Set_Flag128;
5624 procedure Set_Flag129 (N : Node_Id; Val : Boolean) is
5625 begin
5626 pragma Assert (Nkind (N) in N_Entity);
5627 Nodes.Table (N + 3).In_List := Val;
5628 end Set_Flag129;
5630 procedure Set_Flag130 (N : Node_Id; Val : Boolean) is
5631 begin
5632 pragma Assert (Nkind (N) in N_Entity);
5633 Nodes.Table (N + 3).Unused_1 := Val;
5634 end Set_Flag130;
5636 procedure Set_Flag131 (N : Node_Id; Val : Boolean) is
5637 begin
5638 pragma Assert (Nkind (N) in N_Entity);
5639 Nodes.Table (N + 3).Rewrite_Ins := Val;
5640 end Set_Flag131;
5642 procedure Set_Flag132 (N : Node_Id; Val : Boolean) is
5643 begin
5644 pragma Assert (Nkind (N) in N_Entity);
5645 Nodes.Table (N + 3).Analyzed := Val;
5646 end Set_Flag132;
5648 procedure Set_Flag133 (N : Node_Id; Val : Boolean) is
5649 begin
5650 pragma Assert (Nkind (N) in N_Entity);
5651 Nodes.Table (N + 3).Comes_From_Source := Val;
5652 end Set_Flag133;
5654 procedure Set_Flag134 (N : Node_Id; Val : Boolean) is
5655 begin
5656 pragma Assert (Nkind (N) in N_Entity);
5657 Nodes.Table (N + 3).Error_Posted := Val;
5658 end Set_Flag134;
5660 procedure Set_Flag135 (N : Node_Id; Val : Boolean) is
5661 begin
5662 pragma Assert (Nkind (N) in N_Entity);
5663 Nodes.Table (N + 3).Flag4 := Val;
5664 end Set_Flag135;
5666 procedure Set_Flag136 (N : Node_Id; Val : Boolean) is
5667 begin
5668 pragma Assert (Nkind (N) in N_Entity);
5669 Nodes.Table (N + 3).Flag5 := Val;
5670 end Set_Flag136;
5672 procedure Set_Flag137 (N : Node_Id; Val : Boolean) is
5673 begin
5674 pragma Assert (Nkind (N) in N_Entity);
5675 Nodes.Table (N + 3).Flag6 := Val;
5676 end Set_Flag137;
5678 procedure Set_Flag138 (N : Node_Id; Val : Boolean) is
5679 begin
5680 pragma Assert (Nkind (N) in N_Entity);
5681 Nodes.Table (N + 3).Flag7 := Val;
5682 end Set_Flag138;
5684 procedure Set_Flag139 (N : Node_Id; Val : Boolean) is
5685 begin
5686 pragma Assert (Nkind (N) in N_Entity);
5687 Nodes.Table (N + 3).Flag8 := Val;
5688 end Set_Flag139;
5690 procedure Set_Flag140 (N : Node_Id; Val : Boolean) is
5691 begin
5692 pragma Assert (Nkind (N) in N_Entity);
5693 Nodes.Table (N + 3).Flag9 := Val;
5694 end Set_Flag140;
5696 procedure Set_Flag141 (N : Node_Id; Val : Boolean) is
5697 begin
5698 pragma Assert (Nkind (N) in N_Entity);
5699 Nodes.Table (N + 3).Flag10 := Val;
5700 end Set_Flag141;
5702 procedure Set_Flag142 (N : Node_Id; Val : Boolean) is
5703 begin
5704 pragma Assert (Nkind (N) in N_Entity);
5705 Nodes.Table (N + 3).Flag11 := Val;
5706 end Set_Flag142;
5708 procedure Set_Flag143 (N : Node_Id; Val : Boolean) is
5709 begin
5710 pragma Assert (Nkind (N) in N_Entity);
5711 Nodes.Table (N + 3).Flag12 := Val;
5712 end Set_Flag143;
5714 procedure Set_Flag144 (N : Node_Id; Val : Boolean) is
5715 begin
5716 pragma Assert (Nkind (N) in N_Entity);
5717 Nodes.Table (N + 3).Flag13 := Val;
5718 end Set_Flag144;
5720 procedure Set_Flag145 (N : Node_Id; Val : Boolean) is
5721 begin
5722 pragma Assert (Nkind (N) in N_Entity);
5723 Nodes.Table (N + 3).Flag14 := Val;
5724 end Set_Flag145;
5726 procedure Set_Flag146 (N : Node_Id; Val : Boolean) is
5727 begin
5728 pragma Assert (Nkind (N) in N_Entity);
5729 Nodes.Table (N + 3).Flag15 := Val;
5730 end Set_Flag146;
5732 procedure Set_Flag147 (N : Node_Id; Val : Boolean) is
5733 begin
5734 pragma Assert (Nkind (N) in N_Entity);
5735 Nodes.Table (N + 3).Flag16 := Val;
5736 end Set_Flag147;
5738 procedure Set_Flag148 (N : Node_Id; Val : Boolean) is
5739 begin
5740 pragma Assert (Nkind (N) in N_Entity);
5741 Nodes.Table (N + 3).Flag17 := Val;
5742 end Set_Flag148;
5744 procedure Set_Flag149 (N : Node_Id; Val : Boolean) is
5745 begin
5746 pragma Assert (Nkind (N) in N_Entity);
5747 Nodes.Table (N + 3).Flag18 := Val;
5748 end Set_Flag149;
5750 procedure Set_Flag150 (N : Node_Id; Val : Boolean) is
5751 begin
5752 pragma Assert (Nkind (N) in N_Entity);
5753 Nodes.Table (N + 3).Pflag1 := Val;
5754 end Set_Flag150;
5756 procedure Set_Flag151 (N : Node_Id; Val : Boolean) is
5757 begin
5758 pragma Assert (Nkind (N) in N_Entity);
5759 Nodes.Table (N + 3).Pflag2 := Val;
5760 end Set_Flag151;
5762 procedure Set_Flag152 (N : Node_Id; Val : Boolean) is
5763 begin
5764 pragma Assert (Nkind (N) in N_Entity);
5765 To_Flag_Word3_Ptr
5766 (Union_Id_Ptr'
5767 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag152 := Val;
5768 end Set_Flag152;
5770 procedure Set_Flag153 (N : Node_Id; Val : Boolean) is
5771 begin
5772 pragma Assert (Nkind (N) in N_Entity);
5773 To_Flag_Word3_Ptr
5774 (Union_Id_Ptr'
5775 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag153 := Val;
5776 end Set_Flag153;
5778 procedure Set_Flag154 (N : Node_Id; Val : Boolean) is
5779 begin
5780 pragma Assert (Nkind (N) in N_Entity);
5781 To_Flag_Word3_Ptr
5782 (Union_Id_Ptr'
5783 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag154 := Val;
5784 end Set_Flag154;
5786 procedure Set_Flag155 (N : Node_Id; Val : Boolean) is
5787 begin
5788 pragma Assert (Nkind (N) in N_Entity);
5789 To_Flag_Word3_Ptr
5790 (Union_Id_Ptr'
5791 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag155 := Val;
5792 end Set_Flag155;
5794 procedure Set_Flag156 (N : Node_Id; Val : Boolean) is
5795 begin
5796 pragma Assert (Nkind (N) in N_Entity);
5797 To_Flag_Word3_Ptr
5798 (Union_Id_Ptr'
5799 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag156 := Val;
5800 end Set_Flag156;
5802 procedure Set_Flag157 (N : Node_Id; Val : Boolean) is
5803 begin
5804 pragma Assert (Nkind (N) in N_Entity);
5805 To_Flag_Word3_Ptr
5806 (Union_Id_Ptr'
5807 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag157 := Val;
5808 end Set_Flag157;
5810 procedure Set_Flag158 (N : Node_Id; Val : Boolean) is
5811 begin
5812 pragma Assert (Nkind (N) in N_Entity);
5813 To_Flag_Word3_Ptr
5814 (Union_Id_Ptr'
5815 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag158 := Val;
5816 end Set_Flag158;
5818 procedure Set_Flag159 (N : Node_Id; Val : Boolean) is
5819 begin
5820 pragma Assert (Nkind (N) in N_Entity);
5821 To_Flag_Word3_Ptr
5822 (Union_Id_Ptr'
5823 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag159 := Val;
5824 end Set_Flag159;
5826 procedure Set_Flag160 (N : Node_Id; Val : Boolean) is
5827 begin
5828 pragma Assert (Nkind (N) in N_Entity);
5829 To_Flag_Word3_Ptr
5830 (Union_Id_Ptr'
5831 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag160 := Val;
5832 end Set_Flag160;
5834 procedure Set_Flag161 (N : Node_Id; Val : Boolean) is
5835 begin
5836 pragma Assert (Nkind (N) in N_Entity);
5837 To_Flag_Word3_Ptr
5838 (Union_Id_Ptr'
5839 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag161 := Val;
5840 end Set_Flag161;
5842 procedure Set_Flag162 (N : Node_Id; Val : Boolean) is
5843 begin
5844 pragma Assert (Nkind (N) in N_Entity);
5845 To_Flag_Word3_Ptr
5846 (Union_Id_Ptr'
5847 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag162 := Val;
5848 end Set_Flag162;
5850 procedure Set_Flag163 (N : Node_Id; Val : Boolean) is
5851 begin
5852 pragma Assert (Nkind (N) in N_Entity);
5853 To_Flag_Word3_Ptr
5854 (Union_Id_Ptr'
5855 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag163 := Val;
5856 end Set_Flag163;
5858 procedure Set_Flag164 (N : Node_Id; Val : Boolean) is
5859 begin
5860 pragma Assert (Nkind (N) in N_Entity);
5861 To_Flag_Word3_Ptr
5862 (Union_Id_Ptr'
5863 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag164 := Val;
5864 end Set_Flag164;
5866 procedure Set_Flag165 (N : Node_Id; Val : Boolean) is
5867 begin
5868 pragma Assert (Nkind (N) in N_Entity);
5869 To_Flag_Word3_Ptr
5870 (Union_Id_Ptr'
5871 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag165 := Val;
5872 end Set_Flag165;
5874 procedure Set_Flag166 (N : Node_Id; Val : Boolean) is
5875 begin
5876 pragma Assert (Nkind (N) in N_Entity);
5877 To_Flag_Word3_Ptr
5878 (Union_Id_Ptr'
5879 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag166 := Val;
5880 end Set_Flag166;
5882 procedure Set_Flag167 (N : Node_Id; Val : Boolean) is
5883 begin
5884 pragma Assert (Nkind (N) in N_Entity);
5885 To_Flag_Word3_Ptr
5886 (Union_Id_Ptr'
5887 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag167 := Val;
5888 end Set_Flag167;
5890 procedure Set_Flag168 (N : Node_Id; Val : Boolean) is
5891 begin
5892 pragma Assert (Nkind (N) in N_Entity);
5893 To_Flag_Word3_Ptr
5894 (Union_Id_Ptr'
5895 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag168 := Val;
5896 end Set_Flag168;
5898 procedure Set_Flag169 (N : Node_Id; Val : Boolean) is
5899 begin
5900 pragma Assert (Nkind (N) in N_Entity);
5901 To_Flag_Word3_Ptr
5902 (Union_Id_Ptr'
5903 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag169 := Val;
5904 end Set_Flag169;
5906 procedure Set_Flag170 (N : Node_Id; Val : Boolean) is
5907 begin
5908 pragma Assert (Nkind (N) in N_Entity);
5909 To_Flag_Word3_Ptr
5910 (Union_Id_Ptr'
5911 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag170 := Val;
5912 end Set_Flag170;
5914 procedure Set_Flag171 (N : Node_Id; Val : Boolean) is
5915 begin
5916 pragma Assert (Nkind (N) in N_Entity);
5917 To_Flag_Word3_Ptr
5918 (Union_Id_Ptr'
5919 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag171 := Val;
5920 end Set_Flag171;
5922 procedure Set_Flag172 (N : Node_Id; Val : Boolean) is
5923 begin
5924 pragma Assert (Nkind (N) in N_Entity);
5925 To_Flag_Word3_Ptr
5926 (Union_Id_Ptr'
5927 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag172 := Val;
5928 end Set_Flag172;
5930 procedure Set_Flag173 (N : Node_Id; Val : Boolean) is
5931 begin
5932 pragma Assert (Nkind (N) in N_Entity);
5933 To_Flag_Word3_Ptr
5934 (Union_Id_Ptr'
5935 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag173 := Val;
5936 end Set_Flag173;
5938 procedure Set_Flag174 (N : Node_Id; Val : Boolean) is
5939 begin
5940 pragma Assert (Nkind (N) in N_Entity);
5941 To_Flag_Word3_Ptr
5942 (Union_Id_Ptr'
5943 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag174 := Val;
5944 end Set_Flag174;
5946 procedure Set_Flag175 (N : Node_Id; Val : Boolean) is
5947 begin
5948 pragma Assert (Nkind (N) in N_Entity);
5949 To_Flag_Word3_Ptr
5950 (Union_Id_Ptr'
5951 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag175 := Val;
5952 end Set_Flag175;
5954 procedure Set_Flag176 (N : Node_Id; Val : Boolean) is
5955 begin
5956 pragma Assert (Nkind (N) in N_Entity);
5957 To_Flag_Word3_Ptr
5958 (Union_Id_Ptr'
5959 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag176 := Val;
5960 end Set_Flag176;
5962 procedure Set_Flag177 (N : Node_Id; Val : Boolean) is
5963 begin
5964 pragma Assert (Nkind (N) in N_Entity);
5965 To_Flag_Word3_Ptr
5966 (Union_Id_Ptr'
5967 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag177 := Val;
5968 end Set_Flag177;
5970 procedure Set_Flag178 (N : Node_Id; Val : Boolean) is
5971 begin
5972 pragma Assert (Nkind (N) in N_Entity);
5973 To_Flag_Word3_Ptr
5974 (Union_Id_Ptr'
5975 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag178 := Val;
5976 end Set_Flag178;
5978 procedure Set_Flag179 (N : Node_Id; Val : Boolean) is
5979 begin
5980 pragma Assert (Nkind (N) in N_Entity);
5981 To_Flag_Word3_Ptr
5982 (Union_Id_Ptr'
5983 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag179 := Val;
5984 end Set_Flag179;
5986 procedure Set_Flag180 (N : Node_Id; Val : Boolean) is
5987 begin
5988 pragma Assert (Nkind (N) in N_Entity);
5989 To_Flag_Word3_Ptr
5990 (Union_Id_Ptr'
5991 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag180 := Val;
5992 end Set_Flag180;
5994 procedure Set_Flag181 (N : Node_Id; Val : Boolean) is
5995 begin
5996 pragma Assert (Nkind (N) in N_Entity);
5997 To_Flag_Word3_Ptr
5998 (Union_Id_Ptr'
5999 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag181 := Val;
6000 end Set_Flag181;
6002 procedure Set_Flag182 (N : Node_Id; Val : Boolean) is
6003 begin
6004 pragma Assert (Nkind (N) in N_Entity);
6005 To_Flag_Word3_Ptr
6006 (Union_Id_Ptr'
6007 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag182 := Val;
6008 end Set_Flag182;
6010 procedure Set_Flag183 (N : Node_Id; Val : Boolean) is
6011 begin
6012 pragma Assert (Nkind (N) in N_Entity);
6013 To_Flag_Word3_Ptr
6014 (Union_Id_Ptr'
6015 (Nodes.Table (N + 3).Field11'Unrestricted_Access)).Flag183 := Val;
6016 end Set_Flag183;
6018 procedure Set_Flag184 (N : Node_Id; Val : Boolean) is
6019 begin
6020 pragma Assert (Nkind (N) in N_Entity);
6021 To_Flag_Word4_Ptr
6022 (Union_Id_Ptr'
6023 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag184 := Val;
6024 end Set_Flag184;
6026 procedure Set_Flag185 (N : Node_Id; Val : Boolean) is
6027 begin
6028 pragma Assert (Nkind (N) in N_Entity);
6029 To_Flag_Word4_Ptr
6030 (Union_Id_Ptr'
6031 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag185 := Val;
6032 end Set_Flag185;
6034 procedure Set_Flag186 (N : Node_Id; Val : Boolean) is
6035 begin
6036 pragma Assert (Nkind (N) in N_Entity);
6037 To_Flag_Word4_Ptr
6038 (Union_Id_Ptr'
6039 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag186 := Val;
6040 end Set_Flag186;
6042 procedure Set_Flag187 (N : Node_Id; Val : Boolean) is
6043 begin
6044 pragma Assert (Nkind (N) in N_Entity);
6045 To_Flag_Word4_Ptr
6046 (Union_Id_Ptr'
6047 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag187 := Val;
6048 end Set_Flag187;
6050 procedure Set_Flag188 (N : Node_Id; Val : Boolean) is
6051 begin
6052 pragma Assert (Nkind (N) in N_Entity);
6053 To_Flag_Word4_Ptr
6054 (Union_Id_Ptr'
6055 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag188 := Val;
6056 end Set_Flag188;
6058 procedure Set_Flag189 (N : Node_Id; Val : Boolean) is
6059 begin
6060 pragma Assert (Nkind (N) in N_Entity);
6061 To_Flag_Word4_Ptr
6062 (Union_Id_Ptr'
6063 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag189 := Val;
6064 end Set_Flag189;
6066 procedure Set_Flag190 (N : Node_Id; Val : Boolean) is
6067 begin
6068 pragma Assert (Nkind (N) in N_Entity);
6069 To_Flag_Word4_Ptr
6070 (Union_Id_Ptr'
6071 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag190 := Val;
6072 end Set_Flag190;
6074 procedure Set_Flag191 (N : Node_Id; Val : Boolean) is
6075 begin
6076 pragma Assert (Nkind (N) in N_Entity);
6077 To_Flag_Word4_Ptr
6078 (Union_Id_Ptr'
6079 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag191 := Val;
6080 end Set_Flag191;
6082 procedure Set_Flag192 (N : Node_Id; Val : Boolean) is
6083 begin
6084 pragma Assert (Nkind (N) in N_Entity);
6085 To_Flag_Word4_Ptr
6086 (Union_Id_Ptr'
6087 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag192 := Val;
6088 end Set_Flag192;
6090 procedure Set_Flag193 (N : Node_Id; Val : Boolean) is
6091 begin
6092 pragma Assert (Nkind (N) in N_Entity);
6093 To_Flag_Word4_Ptr
6094 (Union_Id_Ptr'
6095 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag193 := Val;
6096 end Set_Flag193;
6098 procedure Set_Flag194 (N : Node_Id; Val : Boolean) is
6099 begin
6100 pragma Assert (Nkind (N) in N_Entity);
6101 To_Flag_Word4_Ptr
6102 (Union_Id_Ptr'
6103 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag194 := Val;
6104 end Set_Flag194;
6106 procedure Set_Flag195 (N : Node_Id; Val : Boolean) is
6107 begin
6108 pragma Assert (Nkind (N) in N_Entity);
6109 To_Flag_Word4_Ptr
6110 (Union_Id_Ptr'
6111 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag195 := Val;
6112 end Set_Flag195;
6114 procedure Set_Flag196 (N : Node_Id; Val : Boolean) is
6115 begin
6116 pragma Assert (Nkind (N) in N_Entity);
6117 To_Flag_Word4_Ptr
6118 (Union_Id_Ptr'
6119 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag196 := Val;
6120 end Set_Flag196;
6122 procedure Set_Flag197 (N : Node_Id; Val : Boolean) is
6123 begin
6124 pragma Assert (Nkind (N) in N_Entity);
6125 To_Flag_Word4_Ptr
6126 (Union_Id_Ptr'
6127 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag197 := Val;
6128 end Set_Flag197;
6130 procedure Set_Flag198 (N : Node_Id; Val : Boolean) is
6131 begin
6132 pragma Assert (Nkind (N) in N_Entity);
6133 To_Flag_Word4_Ptr
6134 (Union_Id_Ptr'
6135 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag198 := Val;
6136 end Set_Flag198;
6138 procedure Set_Flag199 (N : Node_Id; Val : Boolean) is
6139 begin
6140 pragma Assert (Nkind (N) in N_Entity);
6141 To_Flag_Word4_Ptr
6142 (Union_Id_Ptr'
6143 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag199 := Val;
6144 end Set_Flag199;
6146 procedure Set_Flag200 (N : Node_Id; Val : Boolean) is
6147 begin
6148 pragma Assert (Nkind (N) in N_Entity);
6149 To_Flag_Word4_Ptr
6150 (Union_Id_Ptr'
6151 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag200 := Val;
6152 end Set_Flag200;
6154 procedure Set_Flag201 (N : Node_Id; Val : Boolean) is
6155 begin
6156 pragma Assert (Nkind (N) in N_Entity);
6157 To_Flag_Word4_Ptr
6158 (Union_Id_Ptr'
6159 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag201 := Val;
6160 end Set_Flag201;
6162 procedure Set_Flag202 (N : Node_Id; Val : Boolean) is
6163 begin
6164 pragma Assert (Nkind (N) in N_Entity);
6165 To_Flag_Word4_Ptr
6166 (Union_Id_Ptr'
6167 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag202 := Val;
6168 end Set_Flag202;
6170 procedure Set_Flag203 (N : Node_Id; Val : Boolean) is
6171 begin
6172 pragma Assert (Nkind (N) in N_Entity);
6173 To_Flag_Word4_Ptr
6174 (Union_Id_Ptr'
6175 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag203 := Val;
6176 end Set_Flag203;
6178 procedure Set_Flag204 (N : Node_Id; Val : Boolean) is
6179 begin
6180 pragma Assert (Nkind (N) in N_Entity);
6181 To_Flag_Word4_Ptr
6182 (Union_Id_Ptr'
6183 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag204 := Val;
6184 end Set_Flag204;
6186 procedure Set_Flag205 (N : Node_Id; Val : Boolean) is
6187 begin
6188 pragma Assert (Nkind (N) in N_Entity);
6189 To_Flag_Word4_Ptr
6190 (Union_Id_Ptr'
6191 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag205 := Val;
6192 end Set_Flag205;
6194 procedure Set_Flag206 (N : Node_Id; Val : Boolean) is
6195 begin
6196 pragma Assert (Nkind (N) in N_Entity);
6197 To_Flag_Word4_Ptr
6198 (Union_Id_Ptr'
6199 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag206 := Val;
6200 end Set_Flag206;
6202 procedure Set_Flag207 (N : Node_Id; Val : Boolean) is
6203 begin
6204 pragma Assert (Nkind (N) in N_Entity);
6205 To_Flag_Word4_Ptr
6206 (Union_Id_Ptr'
6207 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag207 := Val;
6208 end Set_Flag207;
6210 procedure Set_Flag208 (N : Node_Id; Val : Boolean) is
6211 begin
6212 pragma Assert (Nkind (N) in N_Entity);
6213 To_Flag_Word4_Ptr
6214 (Union_Id_Ptr'
6215 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag208 := Val;
6216 end Set_Flag208;
6218 procedure Set_Flag209 (N : Node_Id; Val : Boolean) is
6219 begin
6220 pragma Assert (Nkind (N) in N_Entity);
6221 To_Flag_Word4_Ptr
6222 (Union_Id_Ptr'
6223 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag209 := Val;
6224 end Set_Flag209;
6226 procedure Set_Flag210 (N : Node_Id; Val : Boolean) is
6227 begin
6228 pragma Assert (Nkind (N) in N_Entity);
6229 To_Flag_Word4_Ptr
6230 (Union_Id_Ptr'
6231 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag210 := Val;
6232 end Set_Flag210;
6234 procedure Set_Flag211 (N : Node_Id; Val : Boolean) is
6235 begin
6236 pragma Assert (Nkind (N) in N_Entity);
6237 To_Flag_Word4_Ptr
6238 (Union_Id_Ptr'
6239 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag211 := Val;
6240 end Set_Flag211;
6242 procedure Set_Flag212 (N : Node_Id; Val : Boolean) is
6243 begin
6244 pragma Assert (Nkind (N) in N_Entity);
6245 To_Flag_Word4_Ptr
6246 (Union_Id_Ptr'
6247 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag212 := Val;
6248 end Set_Flag212;
6250 procedure Set_Flag213 (N : Node_Id; Val : Boolean) is
6251 begin
6252 pragma Assert (Nkind (N) in N_Entity);
6253 To_Flag_Word4_Ptr
6254 (Union_Id_Ptr'
6255 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag213 := Val;
6256 end Set_Flag213;
6258 procedure Set_Flag214 (N : Node_Id; Val : Boolean) is
6259 begin
6260 pragma Assert (Nkind (N) in N_Entity);
6261 To_Flag_Word4_Ptr
6262 (Union_Id_Ptr'
6263 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag214 := Val;
6264 end Set_Flag214;
6266 procedure Set_Flag215 (N : Node_Id; Val : Boolean) is
6267 begin
6268 pragma Assert (Nkind (N) in N_Entity);
6269 To_Flag_Word4_Ptr
6270 (Union_Id_Ptr'
6271 (Nodes.Table (N + 4).Field11'Unrestricted_Access)).Flag215 := Val;
6272 end Set_Flag215;
6274 procedure Set_Flag216 (N : Node_Id; Val : Boolean) is
6275 begin
6276 pragma Assert (Nkind (N) in N_Entity);
6277 To_Flag_Word5_Ptr
6278 (Union_Id_Ptr'
6279 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag216 := Val;
6280 end Set_Flag216;
6282 procedure Set_Flag217 (N : Node_Id; Val : Boolean) is
6283 begin
6284 pragma Assert (Nkind (N) in N_Entity);
6285 To_Flag_Word5_Ptr
6286 (Union_Id_Ptr'
6287 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag217 := Val;
6288 end Set_Flag217;
6290 procedure Set_Flag218 (N : Node_Id; Val : Boolean) is
6291 begin
6292 pragma Assert (Nkind (N) in N_Entity);
6293 To_Flag_Word5_Ptr
6294 (Union_Id_Ptr'
6295 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag218 := Val;
6296 end Set_Flag218;
6298 procedure Set_Flag219 (N : Node_Id; Val : Boolean) is
6299 begin
6300 pragma Assert (Nkind (N) in N_Entity);
6301 To_Flag_Word5_Ptr
6302 (Union_Id_Ptr'
6303 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag219 := Val;
6304 end Set_Flag219;
6306 procedure Set_Flag220 (N : Node_Id; Val : Boolean) is
6307 begin
6308 pragma Assert (Nkind (N) in N_Entity);
6309 To_Flag_Word5_Ptr
6310 (Union_Id_Ptr'
6311 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag220 := Val;
6312 end Set_Flag220;
6314 procedure Set_Flag221 (N : Node_Id; Val : Boolean) is
6315 begin
6316 pragma Assert (Nkind (N) in N_Entity);
6317 To_Flag_Word5_Ptr
6318 (Union_Id_Ptr'
6319 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag221 := Val;
6320 end Set_Flag221;
6322 procedure Set_Flag222 (N : Node_Id; Val : Boolean) is
6323 begin
6324 pragma Assert (Nkind (N) in N_Entity);
6325 To_Flag_Word5_Ptr
6326 (Union_Id_Ptr'
6327 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag222 := Val;
6328 end Set_Flag222;
6330 procedure Set_Flag223 (N : Node_Id; Val : Boolean) is
6331 begin
6332 pragma Assert (Nkind (N) in N_Entity);
6333 To_Flag_Word5_Ptr
6334 (Union_Id_Ptr'
6335 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag223 := Val;
6336 end Set_Flag223;
6338 procedure Set_Flag224 (N : Node_Id; Val : Boolean) is
6339 begin
6340 pragma Assert (Nkind (N) in N_Entity);
6341 To_Flag_Word5_Ptr
6342 (Union_Id_Ptr'
6343 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag224 := Val;
6344 end Set_Flag224;
6346 procedure Set_Flag225 (N : Node_Id; Val : Boolean) is
6347 begin
6348 pragma Assert (Nkind (N) in N_Entity);
6349 To_Flag_Word5_Ptr
6350 (Union_Id_Ptr'
6351 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag225 := Val;
6352 end Set_Flag225;
6354 procedure Set_Flag226 (N : Node_Id; Val : Boolean) is
6355 begin
6356 pragma Assert (Nkind (N) in N_Entity);
6357 To_Flag_Word5_Ptr
6358 (Union_Id_Ptr'
6359 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag226 := Val;
6360 end Set_Flag226;
6362 procedure Set_Flag227 (N : Node_Id; Val : Boolean) is
6363 begin
6364 pragma Assert (Nkind (N) in N_Entity);
6365 To_Flag_Word5_Ptr
6366 (Union_Id_Ptr'
6367 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag227 := Val;
6368 end Set_Flag227;
6370 procedure Set_Flag228 (N : Node_Id; Val : Boolean) is
6371 begin
6372 pragma Assert (Nkind (N) in N_Entity);
6373 To_Flag_Word5_Ptr
6374 (Union_Id_Ptr'
6375 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag228 := Val;
6376 end Set_Flag228;
6378 procedure Set_Flag229 (N : Node_Id; Val : Boolean) is
6379 begin
6380 pragma Assert (Nkind (N) in N_Entity);
6381 To_Flag_Word5_Ptr
6382 (Union_Id_Ptr'
6383 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag229 := Val;
6384 end Set_Flag229;
6386 procedure Set_Flag230 (N : Node_Id; Val : Boolean) is
6387 begin
6388 pragma Assert (Nkind (N) in N_Entity);
6389 To_Flag_Word5_Ptr
6390 (Union_Id_Ptr'
6391 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag230 := Val;
6392 end Set_Flag230;
6394 procedure Set_Flag231 (N : Node_Id; Val : Boolean) is
6395 begin
6396 pragma Assert (Nkind (N) in N_Entity);
6397 To_Flag_Word5_Ptr
6398 (Union_Id_Ptr'
6399 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag231 := Val;
6400 end Set_Flag231;
6402 procedure Set_Flag232 (N : Node_Id; Val : Boolean) is
6403 begin
6404 pragma Assert (Nkind (N) in N_Entity);
6405 To_Flag_Word5_Ptr
6406 (Union_Id_Ptr'
6407 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag232 := Val;
6408 end Set_Flag232;
6410 procedure Set_Flag233 (N : Node_Id; Val : Boolean) is
6411 begin
6412 pragma Assert (Nkind (N) in N_Entity);
6413 To_Flag_Word5_Ptr
6414 (Union_Id_Ptr'
6415 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag233 := Val;
6416 end Set_Flag233;
6418 procedure Set_Flag234 (N : Node_Id; Val : Boolean) is
6419 begin
6420 pragma Assert (Nkind (N) in N_Entity);
6421 To_Flag_Word5_Ptr
6422 (Union_Id_Ptr'
6423 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag234 := Val;
6424 end Set_Flag234;
6426 procedure Set_Flag235 (N : Node_Id; Val : Boolean) is
6427 begin
6428 pragma Assert (Nkind (N) in N_Entity);
6429 To_Flag_Word5_Ptr
6430 (Union_Id_Ptr'
6431 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag235 := Val;
6432 end Set_Flag235;
6434 procedure Set_Flag236 (N : Node_Id; Val : Boolean) is
6435 begin
6436 pragma Assert (Nkind (N) in N_Entity);
6437 To_Flag_Word5_Ptr
6438 (Union_Id_Ptr'
6439 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag236 := Val;
6440 end Set_Flag236;
6442 procedure Set_Flag237 (N : Node_Id; Val : Boolean) is
6443 begin
6444 pragma Assert (Nkind (N) in N_Entity);
6445 To_Flag_Word5_Ptr
6446 (Union_Id_Ptr'
6447 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag237 := Val;
6448 end Set_Flag237;
6450 procedure Set_Flag238 (N : Node_Id; Val : Boolean) is
6451 begin
6452 pragma Assert (Nkind (N) in N_Entity);
6453 To_Flag_Word5_Ptr
6454 (Union_Id_Ptr'
6455 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag238 := Val;
6456 end Set_Flag238;
6458 procedure Set_Flag239 (N : Node_Id; Val : Boolean) is
6459 begin
6460 pragma Assert (Nkind (N) in N_Entity);
6461 To_Flag_Word5_Ptr
6462 (Union_Id_Ptr'
6463 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag239 := Val;
6464 end Set_Flag239;
6466 procedure Set_Flag240 (N : Node_Id; Val : Boolean) is
6467 begin
6468 pragma Assert (Nkind (N) in N_Entity);
6469 To_Flag_Word5_Ptr
6470 (Union_Id_Ptr'
6471 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag240 := Val;
6472 end Set_Flag240;
6474 procedure Set_Flag241 (N : Node_Id; Val : Boolean) is
6475 begin
6476 pragma Assert (Nkind (N) in N_Entity);
6477 To_Flag_Word5_Ptr
6478 (Union_Id_Ptr'
6479 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag241 := Val;
6480 end Set_Flag241;
6482 procedure Set_Flag242 (N : Node_Id; Val : Boolean) is
6483 begin
6484 pragma Assert (Nkind (N) in N_Entity);
6485 To_Flag_Word5_Ptr
6486 (Union_Id_Ptr'
6487 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag242 := Val;
6488 end Set_Flag242;
6490 procedure Set_Flag243 (N : Node_Id; Val : Boolean) is
6491 begin
6492 pragma Assert (Nkind (N) in N_Entity);
6493 To_Flag_Word5_Ptr
6494 (Union_Id_Ptr'
6495 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag243 := Val;
6496 end Set_Flag243;
6498 procedure Set_Flag244 (N : Node_Id; Val : Boolean) is
6499 begin
6500 pragma Assert (Nkind (N) in N_Entity);
6501 To_Flag_Word5_Ptr
6502 (Union_Id_Ptr'
6503 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag244 := Val;
6504 end Set_Flag244;
6506 procedure Set_Flag245 (N : Node_Id; Val : Boolean) is
6507 begin
6508 pragma Assert (Nkind (N) in N_Entity);
6509 To_Flag_Word5_Ptr
6510 (Union_Id_Ptr'
6511 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag245 := Val;
6512 end Set_Flag245;
6514 procedure Set_Flag246 (N : Node_Id; Val : Boolean) is
6515 begin
6516 pragma Assert (Nkind (N) in N_Entity);
6517 To_Flag_Word5_Ptr
6518 (Union_Id_Ptr'
6519 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag246 := Val;
6520 end Set_Flag246;
6522 procedure Set_Flag247 (N : Node_Id; Val : Boolean) is
6523 begin
6524 pragma Assert (Nkind (N) in N_Entity);
6525 To_Flag_Word5_Ptr
6526 (Union_Id_Ptr'
6527 (Nodes.Table (N + 4).Field12'Unrestricted_Access)).Flag247 := Val;
6528 end Set_Flag247;
6530 procedure Set_Node1_With_Parent (N : Node_Id; Val : Node_Id) is
6531 begin
6532 pragma Assert (N <= Nodes.Last);
6534 if Val > Error then
6535 Set_Parent (N => Val, Val => N);
6536 end if;
6538 Set_Node1 (N, Val);
6539 end Set_Node1_With_Parent;
6541 procedure Set_Node2_With_Parent (N : Node_Id; Val : Node_Id) is
6542 begin
6543 pragma Assert (N <= Nodes.Last);
6545 if Val > Error then
6546 Set_Parent (N => Val, Val => N);
6547 end if;
6549 Set_Node2 (N, Val);
6550 end Set_Node2_With_Parent;
6552 procedure Set_Node3_With_Parent (N : Node_Id; Val : Node_Id) is
6553 begin
6554 pragma Assert (N <= Nodes.Last);
6556 if Val > Error then
6557 Set_Parent (N => Val, Val => N);
6558 end if;
6560 Set_Node3 (N, Val);
6561 end Set_Node3_With_Parent;
6563 procedure Set_Node4_With_Parent (N : Node_Id; Val : Node_Id) is
6564 begin
6565 pragma Assert (N <= Nodes.Last);
6567 if Val > Error then
6568 Set_Parent (N => Val, Val => N);
6569 end if;
6571 Set_Node4 (N, Val);
6572 end Set_Node4_With_Parent;
6574 procedure Set_Node5_With_Parent (N : Node_Id; Val : Node_Id) is
6575 begin
6576 pragma Assert (N <= Nodes.Last);
6578 if Val > Error then
6579 Set_Parent (N => Val, Val => N);
6580 end if;
6582 Set_Node5 (N, Val);
6583 end Set_Node5_With_Parent;
6585 procedure Set_List1_With_Parent (N : Node_Id; Val : List_Id) is
6586 begin
6587 pragma Assert (N <= Nodes.Last);
6588 if Val /= No_List and then Val /= Error_List then
6589 Set_Parent (Val, N);
6590 end if;
6591 Set_List1 (N, Val);
6592 end Set_List1_With_Parent;
6594 procedure Set_List2_With_Parent (N : Node_Id; Val : List_Id) is
6595 begin
6596 pragma Assert (N <= Nodes.Last);
6597 if Val /= No_List and then Val /= Error_List then
6598 Set_Parent (Val, N);
6599 end if;
6600 Set_List2 (N, Val);
6601 end Set_List2_With_Parent;
6603 procedure Set_List3_With_Parent (N : Node_Id; Val : List_Id) is
6604 begin
6605 pragma Assert (N <= Nodes.Last);
6606 if Val /= No_List and then Val /= Error_List then
6607 Set_Parent (Val, N);
6608 end if;
6609 Set_List3 (N, Val);
6610 end Set_List3_With_Parent;
6612 procedure Set_List4_With_Parent (N : Node_Id; Val : List_Id) is
6613 begin
6614 pragma Assert (N <= Nodes.Last);
6615 if Val /= No_List and then Val /= Error_List then
6616 Set_Parent (Val, N);
6617 end if;
6618 Set_List4 (N, Val);
6619 end Set_List4_With_Parent;
6621 procedure Set_List5_With_Parent (N : Node_Id; Val : List_Id) is
6622 begin
6623 pragma Assert (N <= Nodes.Last);
6624 if Val /= No_List and then Val /= Error_List then
6625 Set_Parent (Val, N);
6626 end if;
6627 Set_List5 (N, Val);
6628 end Set_List5_With_Parent;
6630 end Unchecked_Access;
6632 ------------
6633 -- Unlock --
6634 ------------
6636 procedure Unlock is
6637 begin
6638 Nodes.Locked := False;
6639 Orig_Nodes.Locked := False;
6640 end Unlock;
6642 end Atree;