gcc/ada/atree.h

   1 /****************************************************************************
   2  *                                                                          *
   3  *                         GNAT COMPILER COMPONENTS                         *
   4  *                                                                          *
   5  *                                A T R E E                                 *
   6  *                                                                          *
   7  *                              C Header File                               *
   8  *                                                                          *
   9  *                                                                          *
  10  *          Copyright (C) 1992-2001, Free Software Foundation, Inc.         *
  11  *                                                                          *
  12  * GNAT is free software;  you can  redistribute it  and/or modify it under *
  13  * terms of the  GNU General Public License as published  by the Free Soft- *
  14  * ware  Foundation;  either version 2,  or (at your option) any later ver- *
  15  * sion.  GNAT is distributed in the hope that it will be useful, but WITH- *
  16  * OUT ANY WARRANTY;  without even the  implied warranty of MERCHANTABILITY *
  17  * or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License *
  18  * for  more details.  You should have  received  a copy of the GNU General *
  19  * Public License  distributed with GNAT;  see file COPYING.  If not, write *
  20  * to  the Free Software Foundation,  59 Temple Place - Suite 330,  Boston, *
  21  * MA 02111-1307, USA.                                                      *
  22  *                                                                          *
  23  * GNAT was originally developed  by the GNAT team at  New York University. *
  24  * Extensive contributions were provided by Ada Core Technologies Inc.      *
  25  *                                                                          *
  26  ****************************************************************************/
  27
  28 /* This is the C header corresponding to the Ada package specification for
  29    Atree. It also contains the implementations of inlined functions from the
  30    package body for Tree.  It was generated manually from atree.ads and
  31    atree.adb and must be kept synchronized with changes in these files.
  32
  33    Note that only routines for reading the tree are included, since the tree
  34    transformer is not supposed to modify the tree in any way. */
  35
  36 /* Structure used for the first part of the node in the case where we have
  37    an Nkind.  */
  38
  39 struct NFK
  40 {
  41   Boolean      is_extension      :  1;
  42   Boolean      pflag1            :  1;
  43   Boolean      pflag2            :  1;
  44   Boolean      in_list           :  1;
  45   Boolean      rewrite_sub       :  1;
  46   Boolean      rewrite_ins       :  1;
  47   Boolean      analyzed          :  1;
  48   Boolean      c_f_s             :  1;
  49
  50   Boolean      error_posted  :  1;
  51   Boolean      flag4  :  1;
  52   Boolean      flag5  :  1;
  53   Boolean      flag6  :  1;
  54   Boolean      flag7  :  1;
  55   Boolean      flag8  :  1;
  56   Boolean      flag9  :  1;
  57   Boolean      flag10 :  1;
  58
  59   Boolean      flag11 :  1;
  60   Boolean      flag12 :  1;
  61   Boolean      flag13 :  1;
  62   Boolean      flag14 :  1;
  63   Boolean      flag15 :  1;
  64   Boolean      flag16 :  1;
  65   Boolean      flag17 :  1;
  66   Boolean      flag18 :  1;
  67
  68   unsigned char kind;
  69 };
  70
  71 /* Structure for the first part of a node when Nkind is not present by
  72    extra flag bits are.  */
  73
  74 struct NFNK
  75 {
  76   Boolean      is_extension      :  1;
  77   Boolean      pflag1            :  1;
  78   Boolean      pflag2            :  1;
  79   Boolean      in_list           :  1;
  80   Boolean      rewrite_sub       :  1;
  81   Boolean      rewrite_ins       :  1;
  82   Boolean      analyzed          :  1;
  83   Boolean      c_f_s             :  1;
  84
  85   Boolean      error_posted  :  1;
  86   Boolean      flag4  :  1;
  87   Boolean      flag5  :  1;
  88   Boolean      flag6  :  1;
  89   Boolean      flag7  :  1;
  90   Boolean      flag8  :  1;
  91   Boolean      flag9  :  1;
  92   Boolean      flag10 :  1;
  93
  94   Boolean      flag11 :  1;
  95   Boolean      flag12 :  1;
  96   Boolean      flag13 :  1;
  97   Boolean      flag14 :  1;
  98   Boolean      flag15 :  1;
  99   Boolean      flag16 :  1;
 100   Boolean      flag17 :  1;
 101   Boolean      flag18 :  1;
 102
 103   Boolean      flag65 :  1;
 104   Boolean      flag66 :  1;
 105   Boolean      flag67 :  1;
 106   Boolean      flag68 :  1;
 107   Boolean      flag69 :  1;
 108   Boolean      flag70 :  1;
 109   Boolean      flag71 :  1;
 110   Boolean      flag72 :  1;
 111 };
 112
 113 /* Structure used for extra flags in third component overlaying Field12 */
 114 struct Flag_Word
 115 {
 116   Boolean      flag73       :  1;
 117   Boolean      flag74       :  1;
 118   Boolean      flag75       :  1;
 119   Boolean      flag76       :  1;
 120   Boolean      flag77       :  1;
 121   Boolean      flag78       :  1;
 122   Boolean      flag79       :  1;
 123   Boolean      flag80       :  1;
 124   Boolean      flag81       :  1;
 125   Boolean      flag82       :  1;
 126   Boolean      flag83       :  1;
 127   Boolean      flag84       :  1;
 128   Boolean      flag85       :  1;
 129   Boolean      flag86       :  1;
 130   Boolean      flag87       :  1;
 131   Boolean      flag88       :  1;
 132   Boolean      flag89       :  1;
 133   Boolean      flag90       :  1;
 134   Boolean      flag91       :  1;
 135   Boolean      flag92       :  1;
 136   Boolean      flag93       :  1;
 137   Boolean      flag94       :  1;
 138   Boolean      flag95       :  1;
 139   Boolean      flag96       :  1;
 140   Short        convention   :  8;
 141 };
 142
 143 /* Structure used for extra flags in fourth component overlaying Field12 */
 144 struct Flag_Word2
 145 {
 146   Boolean      flag97       :  1;
 147   Boolean      flag98       :  1;
 148   Boolean      flag99       :  1;
 149   Boolean      flag100      :  1;
 150   Boolean      flag101      :  1;
 151   Boolean      flag102      :  1;
 152   Boolean      flag103      :  1;
 153   Boolean      flag104      :  1;
 154   Boolean      flag105      :  1;
 155   Boolean      flag106      :  1;
 156   Boolean      flag107      :  1;
 157   Boolean      flag108      :  1;
 158   Boolean      flag109      :  1;
 159   Boolean      flag110      :  1;
 160   Boolean      flag111      :  1;
 161   Boolean      flag112      :  1;
 162   Boolean      flag113      :  1;
 163   Boolean      flag114      :  1;
 164   Boolean      flag115      :  1;
 165   Boolean      flag116      :  1;
 166   Boolean      flag117      :  1;
 167   Boolean      flag118      :  1;
 168   Boolean      flag119      :  1;
 169   Boolean      flag120      :  1;
 170   Boolean      flag121      :  1;
 171   Boolean      flag122      :  1;
 172   Boolean      flag123      :  1;
 173   Boolean      flag124      :  1;
 174   Boolean      flag125      :  1;
 175   Boolean      flag126      :  1;
 176   Boolean      flag127      :  1;
 177   Boolean      flag128      :  1;
 178 };
 179
 180 /* Structure used for extra flags in fourth component overlaying Field11 */
 181 struct Flag_Word3
 182 {
 183   Boolean      flag152      :  1;
 184   Boolean      flag153      :  1;
 185   Boolean      flag154      :  1;
 186   Boolean      flag155      :  1;
 187   Boolean      flag156      :  1;
 188   Boolean      flag157      :  1;
 189   Boolean      flag158      :  1;
 190   Boolean      flag159      :  1;
 191
 192   Boolean      flag160      :  1;
 193   Boolean      flag161      :  1;
 194   Boolean      flag162      :  1;
 195   Boolean      flag163      :  1;
 196   Boolean      flag164      :  1;
 197   Boolean      flag165      :  1;
 198   Boolean      flag166      :  1;
 199   Boolean      flag167      :  1;
 200
 201   Boolean      flag168      :  1;
 202   Boolean      flag169      :  1;
 203   Boolean      flag170      :  1;
 204   Boolean      flag171      :  1;
 205   Boolean      flag172      :  1;
 206   Boolean      flag173      :  1;
 207   Boolean      flag174      :  1;
 208   Boolean      flag175      :  1;
 209
 210   Boolean      flag176      :  1;
 211   Boolean      flag177      :  1;
 212   Boolean      flag178      :  1;
 213   Boolean      flag179      :  1;
 214   Boolean      flag180      :  1;
 215   Boolean      flag181      :  1;
 216   Boolean      flag182      :  1;
 217   Boolean      flag183      :  1;
 218 };
 219
 220 struct Non_Extended
 221 {
 222   Source_Ptr   sloc;
 223   Int          link;
 224   Int          field1;
 225   Int          field2;
 226   Int          field3;
 227   Int          field4;
 228   Int          field5;
 229 };
 230
 231 /* The Following structure corresponds to variant with is_extension = True.  */
 232 struct Extended
 233 {
 234   Int          field6;
 235   Int          field7;
 236   Int          field8;
 237   Int          field9;
 238   Int          field10;
 239   union
 240     {
 241       Int      field11;
 242       struct Flag_Word3 fw3;
 243     } X;
 244
 245   union
 246     {
 247       Int      field12;
 248       struct Flag_Word fw;
 249       struct Flag_Word2 fw2;
 250     } U;
 251 };
 252
 253 /* A tree node itself.  */
 254
 255 struct Node
 256 {
 257   union kind
 258     {
 259       struct NFK K;
 260       struct NFNK NK;
 261     } U;
 262
 263   union variant
 264     {
 265       struct Non_Extended NX;
 266       struct Extended EX;
 267     } V;
 268 };
 269
 270 /* The actual tree is an array of nodes. The pointer to this array is passed
 271    as a parameter to the tree transformer procedure and stored in the global
 272    variable Nodes_Ptr after adjusting it by subtracting Node_First_Entry, so
 273    that Node_Id values can be used as subscripts.  */
 274 extern struct Node *Nodes_Ptr;
 275
 276
 277 #define Parent atree__parent
 278 extern Node_Id Parent PARAMS((Node_Id));
 279
 280 /* Overloaded Functions:
 281
 282    These functions are overloaded in the original Ada source, but there is
 283    only one corresponding C function, which works as described below.   */
 284
 285 /* Type used for union of Node_Id, List_Id, Elist_Id. */
 286 typedef Int Tree_Id;
 287
 288 /* These two functions can only be used for Node_Id and List_Id values and
 289    they work in the C version because Empty = No_List = 0.  */
 290
 291 static Boolean No       PARAMS ((Tree_Id));
 292 static Boolean Present  PARAMS ((Tree_Id));
 293
 294 INLINE Boolean
 295 No (N)
 296      Tree_Id N;
 297 {
 298   return N == Empty;
 299 }
 300
 301 INLINE Boolean
 302 Present (N)
 303      Tree_Id N;
 304 {
 305   return N != Empty;
 306 }
 307
 308 extern Node_Id Parent           PARAMS((Tree_Id));
 309
 310 #define Current_Error_Node atree__current_error_node
 311 extern Node_Id Current_Error_Node;
 312
 313 /* Node Access Functions:  */
 314
 315 #define Nkind(N)        ((Node_Kind) (Nodes_Ptr[(N) - First_Node_Id].U.K.kind))
 316 #define Ekind(N)        ((Entity_Kind) (Nodes_Ptr[N + 1].U.K.kind))
 317 #define Sloc(N)         (Nodes_Ptr[(N) - First_Node_Id].V.NX.sloc)
 318 #define Paren_Count(N)  (Nodes_Ptr[(N) - First_Node_Id].U.K.pflag1      \
 319                          + 2 * Nodes_Ptr[(N) - First_Node_Id].U.K.pflag2)
 320
 321 #define Field1(N)     (Nodes_Ptr[(N) - First_Node_Id].V.NX.field1)
 322 #define Field2(N)     (Nodes_Ptr[(N) - First_Node_Id].V.NX.field2)
 323 #define Field3(N)     (Nodes_Ptr[(N) - First_Node_Id].V.NX.field3)
 324 #define Field4(N)     (Nodes_Ptr[(N) - First_Node_Id].V.NX.field4)
 325 #define Field5(N)     (Nodes_Ptr[(N) - First_Node_Id].V.NX.field5)
 326 #define Field6(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].V.EX.field6)
 327 #define Field7(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].V.EX.field7)
 328 #define Field8(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].V.EX.field8)
 329 #define Field9(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].V.EX.field9)
 330 #define Field10(N)    (Nodes_Ptr[(N) - First_Node_Id + 1].V.EX.field10)
 331 #define Field11(N)    (Nodes_Ptr[(N) - First_Node_Id + 1].V.EX.X.field11)
 332 #define Field12(N)    (Nodes_Ptr[(N) - First_Node_Id + 1].V.EX.U.field12)
 333 #define Field13(N)    (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.field6)
 334 #define Field14(N)    (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.field7)
 335 #define Field15(N)    (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.field8)
 336 #define Field16(N)    (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.field9)
 337 #define Field17(N)    (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.field10)
 338 #define Field18(N)    (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.X.field11)
 339 #define Field19(N)    (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.field6)
 340 #define Field20(N)    (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.field7)
 341 #define Field21(N)    (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.field8)
 342 #define Field22(N)    (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.field9)
 343 #define Field23(N)    (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.field10)
 344
 345 #define Node1(N)      Field1  (N)
 346 #define Node2(N)      Field2  (N)
 347 #define Node3(N)      Field3  (N)
 348 #define Node4(N)      Field4  (N)
 349 #define Node5(N)      Field5  (N)
 350 #define Node6(N)      Field6  (N)
 351 #define Node7(N)      Field7  (N)
 352 #define Node8(N)      Field8  (N)
 353 #define Node9(N)      Field9  (N)
 354 #define Node10(N)     Field10 (N)
 355 #define Node11(N)     Field11 (N)
 356 #define Node12(N)     Field12 (N)
 357 #define Node13(N)     Field13 (N)
 358 #define Node14(N)     Field14 (N)
 359 #define Node15(N)     Field15 (N)
 360 #define Node16(N)     Field16 (N)
 361 #define Node17(N)     Field17 (N)
 362 #define Node18(N)     Field18 (N)
 363 #define Node19(N)     Field19 (N)
 364 #define Node20(N)     Field20 (N)
 365 #define Node21(N)     Field21 (N)
 366 #define Node22(N)     Field22 (N)
 367 #define Node23(N)     Field23 (N)
 368
 369 #define List1(N)      Field1  (N)
 370 #define List2(N)      Field2  (N)
 371 #define List3(N)      Field3  (N)
 372 #define List4(N)      Field4  (N)
 373 #define List5(N)      Field5  (N)
 374 #define List10(N)     Field10 (N)
 375 #define List14(N)     Field14 (N)
 376
 377 #define Elist2(N)     Field2  (N)
 378 #define Elist3(N)     Field3  (N)
 379 #define Elist4(N)     Field4  (N)
 380 #define Elist8(N)     Field8  (N)
 381 #define Elist13(N)    Field13 (N)
 382 #define Elist15(N)    Field15 (N)
 383 #define Elist18(N)    Field18 (N)
 384 #define Elist21(N)    Field21 (N)
 385 #define Elist23(N)    Field23 (N)
 386
 387 #define Name1(N)      Field1  (N)
 388 #define Name2(N)      Field2  (N)
 389
 390 #define Char_Code2(N) (Field2 (N) - Char_Code_Bias)
 391
 392 #define Str3(N)       Field3  (N)
 393
 394 #define Uint3(N)      ((Field3  (N) == 0) ? Uint_0 : Field3  (N))
 395 #define Uint4(N)      ((Field4  (N) == 0) ? Uint_0 : Field4  (N))
 396 #define Uint5(N)      ((Field5  (N) == 0) ? Uint_0 : Field5  (N))
 397 #define Uint8(N)      ((Field8  (N) == 0) ? Uint_0 : Field8  (N))
 398 #define Uint9(N)      ((Field9  (N) == 0) ? Uint_0 : Field9  (N))
 399 #define Uint10(N)     ((Field10 (N) == 0) ? Uint_0 : Field10 (N))
 400 #define Uint11(N)     ((Field11 (N) == 0) ? Uint_0 : Field11 (N))
 401 #define Uint12(N)     ((Field12 (N) == 0) ? Uint_0 : Field12 (N))
 402 #define Uint13(N)     ((Field13 (N) == 0) ? Uint_0 : Field13 (N))
 403 #define Uint14(N)     ((Field14 (N) == 0) ? Uint_0 : Field14 (N))
 404 #define Uint15(N)     ((Field15 (N) == 0) ? Uint_0 : Field15 (N))
 405 #define Uint16(N)     ((Field16 (N) == 0) ? Uint_0 : Field16 (N))
 406 #define Uint17(N)     ((Field17 (N) == 0) ? Uint_0 : Field17 (N))
 407 #define Uint22(N)     ((Field22 (N) == 0) ? Uint_0 : Field22 (N))
 408
 409 #define Ureal3(N)     Field3  (N)
 410 #define Ureal18(N)    Field18 (N)
 411 #define Ureal21(N)    Field21 (N)
 412
 413 #define Analyzed(N)          (Nodes_Ptr[(N) - First_Node_Id].U.K.analyzed)
 414 #define Comes_From_Source(N) (Nodes_Ptr[(N) - First_Node_Id].U.K.c_f_s)
 415 #define Error_Posted(N)      (Nodes_Ptr[(N) - First_Node_Id].U.K.error_posted)
 416 #define Convention(N) \
 417     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.convention)
 418
 419 #define Flag4(N)      (Nodes_Ptr[(N) - First_Node_Id].U.K.flag4)
 420 #define Flag5(N)      (Nodes_Ptr[(N) - First_Node_Id].U.K.flag5)
 421 #define Flag6(N)      (Nodes_Ptr[(N) - First_Node_Id].U.K.flag6)
 422 #define Flag7(N)      (Nodes_Ptr[(N) - First_Node_Id].U.K.flag7)
 423 #define Flag8(N)      (Nodes_Ptr[(N) - First_Node_Id].U.K.flag8)
 424 #define Flag9(N)      (Nodes_Ptr[(N) - First_Node_Id].U.K.flag9)
 425 #define Flag10(N)     (Nodes_Ptr[(N) - First_Node_Id].U.K.flag10)
 426 #define Flag11(N)     (Nodes_Ptr[(N) - First_Node_Id].U.K.flag11)
 427 #define Flag12(N)     (Nodes_Ptr[(N) - First_Node_Id].U.K.flag12)
 428 #define Flag13(N)     (Nodes_Ptr[(N) - First_Node_Id].U.K.flag13)
 429 #define Flag14(N)     (Nodes_Ptr[(N) - First_Node_Id].U.K.flag14)
 430 #define Flag15(N)     (Nodes_Ptr[(N) - First_Node_Id].U.K.flag15)
 431 #define Flag16(N)     (Nodes_Ptr[(N) - First_Node_Id].U.K.flag16)
 432 #define Flag17(N)     (Nodes_Ptr[(N) - First_Node_Id].U.K.flag17)
 433 #define Flag18(N)     (Nodes_Ptr[(N) - First_Node_Id].U.K.flag18)
 434
 435 #define Flag19(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.in_list)
 436 #define Flag20(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.rewrite_sub)
 437 #define Flag21(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.rewrite_ins)
 438 #define Flag22(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.analyzed)
 439 #define Flag23(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.c_f_s)
 440 #define Flag24(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.error_posted)
 441 #define Flag25(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag4)
 442 #define Flag26(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag5)
 443 #define Flag27(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag6)
 444 #define Flag28(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag7)
 445 #define Flag29(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag8)
 446 #define Flag30(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag9)
 447 #define Flag31(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag10)
 448 #define Flag32(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag11)
 449 #define Flag33(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag12)
 450 #define Flag34(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag13)
 451 #define Flag35(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag14)
 452 #define Flag36(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag15)
 453 #define Flag37(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag16)
 454 #define Flag38(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag17)
 455 #define Flag39(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.flag18)
 456
 457 #define Flag40(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.in_list)
 458 #define Flag41(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.rewrite_sub)
 459 #define Flag42(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.rewrite_ins)
 460 #define Flag43(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.analyzed)
 461 #define Flag44(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.c_f_s)
 462 #define Flag45(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.error_posted)
 463 #define Flag46(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag4)
 464 #define Flag47(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag5)
 465 #define Flag48(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag6)
 466 #define Flag49(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag7)
 467 #define Flag50(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag8)
 468 #define Flag51(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag9)
 469 #define Flag52(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag10)
 470 #define Flag53(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag11)
 471 #define Flag54(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag12)
 472 #define Flag55(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag13)
 473 #define Flag56(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag14)
 474 #define Flag57(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag15)
 475 #define Flag58(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag16)
 476 #define Flag59(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag17)
 477 #define Flag60(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.flag18)
 478 #define Flag61(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.pflag1)
 479 #define Flag62(N)     (Nodes_Ptr[(N) - First_Node_Id + 1].U.K.pflag2)
 480 #define Flag63(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.pflag1)
 481 #define Flag64(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.K.pflag2)
 482
 483 #define Flag65(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.NK.flag65)
 484 #define Flag66(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.NK.flag66)
 485 #define Flag67(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.NK.flag67)
 486 #define Flag68(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.NK.flag68)
 487 #define Flag69(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.NK.flag69)
 488 #define Flag70(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.NK.flag70)
 489 #define Flag71(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.NK.flag71)
 490 #define Flag72(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].U.NK.flag72)
 491
 492 #define Flag73(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag73)
 493 #define Flag74(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag74)
 494 #define Flag75(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag75)
 495 #define Flag76(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag76)
 496 #define Flag77(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag77)
 497 #define Flag78(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag78)
 498 #define Flag79(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag79)
 499 #define Flag80(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag80)
 500 #define Flag81(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag81)
 501 #define Flag82(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag82)
 502 #define Flag83(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag83)
 503 #define Flag84(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag84)
 504 #define Flag85(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag85)
 505 #define Flag86(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag86)
 506 #define Flag87(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag87)
 507 #define Flag88(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag88)
 508 #define Flag89(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag89)
 509 #define Flag90(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag90)
 510 #define Flag91(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag91)
 511 #define Flag92(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag92)
 512 #define Flag93(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag93)
 513 #define Flag94(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag94)
 514 #define Flag95(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag95)
 515 #define Flag96(N)     (Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.flag96)
 516 #define Flag97(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag97)
 517 #define Flag98(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag98)
 518 #define Flag99(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag99)
 519 #define Flag100(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag100)
 520 #define Flag101(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag101)
 521 #define Flag102(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag102)
 522 #define Flag103(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag103)
 523 #define Flag104(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag104)
 524 #define Flag105(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag105)
 525 #define Flag106(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag106)
 526 #define Flag107(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag107)
 527 #define Flag108(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag108)
 528 #define Flag109(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag109)
 529 #define Flag110(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag110)
 530 #define Flag111(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag111)
 531 #define Flag112(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag112)
 532 #define Flag113(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag113)
 533 #define Flag114(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag114)
 534 #define Flag115(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag115)
 535 #define Flag116(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag116)
 536 #define Flag117(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag117)
 537 #define Flag118(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag118)
 538 #define Flag119(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag119)
 539 #define Flag120(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag120)
 540 #define Flag121(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag121)
 541 #define Flag122(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag122)
 542 #define Flag123(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag123)
 543 #define Flag124(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag124)
 544 #define Flag125(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag125)
 545 #define Flag126(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag126)
 546 #define Flag127(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag127)
 547 #define Flag128(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.U.fw2.flag128)
 548
 549 #define Flag129(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.in_list)
 550 #define Flag130(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.rewrite_sub)
 551 #define Flag131(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.rewrite_ins)
 552 #define Flag132(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.analyzed)
 553 #define Flag133(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.c_f_s)
 554 #define Flag134(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.error_posted)
 555 #define Flag135(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag4)
 556 #define Flag136(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag5)
 557 #define Flag137(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag6)
 558 #define Flag138(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag7)
 559 #define Flag139(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag8)
 560 #define Flag140(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag9)
 561 #define Flag141(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag10)
 562 #define Flag142(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag11)
 563 #define Flag143(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag12)
 564 #define Flag144(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag13)
 565 #define Flag145(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag14)
 566 #define Flag146(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag15)
 567 #define Flag147(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag16)
 568 #define Flag148(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag17)
 569 #define Flag149(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.flag18)
 570 #define Flag150(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.pflag1)
 571 #define Flag151(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].U.K.pflag2)
 572
 573 #define Flag152(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag152)
 574 #define Flag153(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag153)
 575 #define Flag154(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag154)
 576 #define Flag155(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag155)
 577 #define Flag156(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag156)
 578 #define Flag157(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag157)
 579 #define Flag158(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag158)
 580 #define Flag159(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag159)
 581 #define Flag160(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag160)
 582 #define Flag161(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag161)
 583 #define Flag162(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag162)
 584 #define Flag163(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag163)
 585 #define Flag164(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag164)
 586 #define Flag165(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag165)
 587 #define Flag166(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag166)
 588 #define Flag167(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag167)
 589 #define Flag168(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag168)
 590 #define Flag169(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag169)
 591 #define Flag170(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag170)
 592 #define Flag171(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag171)
 593 #define Flag172(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag172)
 594 #define Flag173(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag173)
 595 #define Flag174(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag174)
 596 #define Flag175(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag175)
 597 #define Flag176(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag176)
 598 #define Flag177(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag177)
 599 #define Flag178(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag178)
 600 #define Flag179(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag179)
 601 #define Flag180(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag180)
 602 #define Flag181(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag181)
 603 #define Flag182(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag182)
 604 #define Flag183(N)     (Nodes_Ptr[(N) - First_Node_Id + 3].V.EX.X.fw3.flag183)