* *
* C Header File *
* *
- * Copyright (C) 1992-2010, Free Software Foundation, Inc. *
+ * Copyright (C) 1992-2020, Free Software Foundation, Inc. *
* *
* GNAT is free software; you can redistribute it and/or modify it under *
* terms of the GNU General Public License as published by the Free Soft- *
* *
****************************************************************************/
-/* This is the C header corresponding to the Ada package specification for
- Atree. It also contains the implementations of inlined functions from the
- package body for Atree. It was generated manually from atree.ads and
+/* This is the C header that corresponds to the Ada package specification for
+ Atree. It also contains the implementation of inlined functions from the
+ package body for Atree. It was created manually from atree.ads and
atree.adb and must be kept synchronized with changes in these files.
Note that only routines for reading the tree are included, since the tree
- transformer is not supposed to modify the tree in any way. */
+ transformer is not supposed to modify the tree in any way. */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
/* Structure used for the first part of the node in the case where we have
an Nkind. */
Boolean flag94 : 1;
Boolean flag95 : 1;
Boolean flag96 : 1;
- Short convention : 8;
+ Byte convention : 8;
};
/* Structure used for extra flags in fourth component overlaying Field12 */
Boolean flag215 : 1;
};
+/* Structure used for extra flags in sixth component overlaying Field12 */
+struct Flag_Word5
+{
+ Boolean flag255 : 1;
+ Boolean flag256 : 1;
+ Boolean flag257 : 1;
+ Boolean flag258 : 1;
+ Boolean flag259 : 1;
+ Boolean flag260 : 1;
+ Boolean flag261 : 1;
+ Boolean flag262 : 1;
+
+ Boolean flag263 : 1;
+ Boolean flag264 : 1;
+ Boolean flag265 : 1;
+ Boolean flag266 : 1;
+ Boolean flag267 : 1;
+ Boolean flag268 : 1;
+ Boolean flag269 : 1;
+ Boolean flag270 : 1;
+
+ Boolean flag271 : 1;
+ Boolean flag272 : 1;
+ Boolean flag273 : 1;
+ Boolean flag274 : 1;
+ Boolean flag275 : 1;
+ Boolean flag276 : 1;
+ Boolean flag277 : 1;
+ Boolean flag278 : 1;
+
+ Boolean flag279 : 1;
+ Boolean flag280 : 1;
+ Boolean flag281 : 1;
+ Boolean flag282 : 1;
+ Boolean flag283 : 1;
+ Boolean flag284 : 1;
+ Boolean flag285 : 1;
+ Boolean flag286 : 1;
+};
struct Non_Extended
{
Source_Ptr sloc;
struct Flag_Word fw;
struct Flag_Word2 fw2;
struct Flag_Word4 fw4;
+ struct Flag_Word5 fw5;
} U;
};
#define Parent atree__parent
extern Node_Id Parent (Node_Id);
+#define Original_Node atree__original_node
+extern Node_Id Original_Node (Node_Id);
+
+/* The auxiliary flags array which is allocated in parallel to Nodes */
+
+struct Flags
+{
+ Boolean Flag0 : 1;
+ Boolean Flag1 : 1;
+ Boolean Flag2 : 1;
+ Boolean Flag3 : 1;
+ Boolean Spare0 : 1;
+ Boolean Spare1 : 1;
+ Boolean Spare2 : 1;
+ Boolean Spare3 : 1;
+};
+extern struct Flags *Flags_Ptr;
+
/* Overloaded Functions:
These functions are overloaded in the original Ada source, but there is
#define Field27(N) (Nodes_Ptr[(N) - First_Node_Id + 4].V.EX.field9)
#define Field28(N) (Nodes_Ptr[(N) - First_Node_Id + 4].V.EX.field10)
#define Field29(N) (Nodes_Ptr[(N) - First_Node_Id + 4].V.EX.X.field11)
+#define Field30(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.field6)
+#define Field31(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.field7)
+#define Field32(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.field8)
+#define Field33(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.field9)
+#define Field34(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.field10)
+#define Field35(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.X.field11)
+#define Field36(N) (Nodes_Ptr[(N) - First_Node_Id + 6].V.EX.field6)
+#define Field37(N) (Nodes_Ptr[(N) - First_Node_Id + 6].V.EX.field7)
+#define Field38(N) (Nodes_Ptr[(N) - First_Node_Id + 6].V.EX.field8)
+#define Field39(N) (Nodes_Ptr[(N) - First_Node_Id + 6].V.EX.field9)
+#define Field40(N) (Nodes_Ptr[(N) - First_Node_Id + 6].V.EX.field10)
+#define Field41(N) (Nodes_Ptr[(N) - First_Node_Id + 6].V.EX.X.field11)
#define Node1(N) Field1 (N)
#define Node2(N) Field2 (N)
#define Node27(N) Field27 (N)
#define Node28(N) Field28 (N)
#define Node29(N) Field29 (N)
+#define Node30(N) Field30 (N)
+#define Node31(N) Field31 (N)
+#define Node32(N) Field32 (N)
+#define Node33(N) Field33 (N)
+#define Node34(N) Field34 (N)
+#define Node35(N) Field35 (N)
+#define Node36(N) Field36 (N)
+#define Node37(N) Field37 (N)
+#define Node38(N) Field38 (N)
+#define Node39(N) Field39 (N)
+#define Node40(N) Field40 (N)
+#define Node41(N) Field41 (N)
#define List1(N) Field1 (N)
#define List2(N) Field2 (N)
#define List10(N) Field10 (N)
#define List14(N) Field14 (N)
#define List25(N) Field25 (N)
+#define List38(N) Field38 (N)
+#define List39(N) Field39 (N)
#define Elist1(N) Field1 (N)
#define Elist2(N) Field2 (N)
#define Elist3(N) Field3 (N)
#define Elist4(N) Field4 (N)
+#define Elist5(N) Field5 (N)
#define Elist8(N) Field8 (N)
+#define Elist9(N) Field9 (N)
#define Elist10(N) Field10 (N)
+#define Elist11(N) Field11 (N)
#define Elist13(N) Field13 (N)
#define Elist15(N) Field15 (N)
#define Elist16(N) Field16 (N)
#define Elist18(N) Field18 (N)
#define Elist21(N) Field21 (N)
#define Elist23(N) Field23 (N)
+#define Elist24(N) Field24 (N)
#define Elist25(N) Field25 (N)
#define Elist26(N) Field26 (N)
+#define Elist29(N) Field29 (N)
+#define Elist30(N) Field30 (N)
+#define Elist36(N) Field36 (N)
#define Name1(N) Field1 (N)
#define Name2(N) Field2 (N)
#define Uint16(N) ((Field16 (N) == 0) ? Uint_0 : Field16 (N))
#define Uint17(N) ((Field17 (N) == 0) ? Uint_0 : Field17 (N))
#define Uint22(N) ((Field22 (N) == 0) ? Uint_0 : Field22 (N))
+#define Uint24(N) ((Field24 (N) == 0) ? Uint_0 : Field24 (N))
#define Ureal3(N) Field3 (N)
#define Ureal18(N) Field18 (N)
#define Convention(N) \
(Nodes_Ptr[(N) - First_Node_Id + 2].V.EX.U.fw.convention)
+#define Flag0(N) (Flags_Ptr[(N) - First_Node_Id].Flag0)
+#define Flag1(N) (Flags_Ptr[(N) - First_Node_Id].Flag1)
+#define Flag2(N) (Flags_Ptr[(N) - First_Node_Id].Flag2)
+#define Flag3(N) (Flags_Ptr[(N) - First_Node_Id].Flag3)
+
#define Flag4(N) (Nodes_Ptr[(N) - First_Node_Id].U.K.flag4)
#define Flag5(N) (Nodes_Ptr[(N) - First_Node_Id].U.K.flag5)
#define Flag6(N) (Nodes_Ptr[(N) - First_Node_Id].U.K.flag6)
#define Flag253(N) (Nodes_Ptr[(N) - First_Node_Id + 4].U.NK.flag71)
#define Flag254(N) (Nodes_Ptr[(N) - First_Node_Id + 4].U.NK.flag72)
+#define Flag255(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag255)
+#define Flag256(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag256)
+#define Flag257(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag257)
+#define Flag258(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag258)
+#define Flag259(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag259)
+#define Flag260(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag260)
+#define Flag261(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag261)
+#define Flag262(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag262)
+#define Flag263(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag263)
+#define Flag264(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag264)
+#define Flag265(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag265)
+#define Flag266(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag266)
+#define Flag267(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag267)
+#define Flag268(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag268)
+#define Flag269(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag269)
+#define Flag270(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag270)
+#define Flag271(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag271)
+#define Flag272(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag272)
+#define Flag273(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag273)
+#define Flag274(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag274)
+#define Flag275(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag275)
+#define Flag276(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag276)
+#define Flag277(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag277)
+#define Flag278(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag278)
+#define Flag279(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag279)
+#define Flag280(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag280)
+#define Flag281(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag281)
+#define Flag282(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag282)
+#define Flag283(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag283)
+#define Flag284(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag284)
+#define Flag285(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag285)
+#define Flag286(N) (Nodes_Ptr[(N) - First_Node_Id + 5].V.EX.U.fw5.flag286)
+#define Flag287(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.in_list)
+#define Flag288(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.has_aspects)
+#define Flag289(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.rewrite_ins)
+#define Flag290(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.analyzed)
+#define Flag291(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.c_f_s)
+#define Flag292(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.error_posted)
+#define Flag293(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag4)
+#define Flag294(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag5)
+#define Flag295(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag6)
+#define Flag296(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag7)
+#define Flag297(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag8)
+#define Flag298(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag9)
+#define Flag299(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag10)
+#define Flag300(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag11)
+#define Flag301(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag12)
+#define Flag302(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag13)
+#define Flag303(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag14)
+#define Flag304(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag15)
+#define Flag305(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag16)
+#define Flag306(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag17)
+#define Flag307(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.flag18)
+#define Flag308(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.pflag1)
+#define Flag309(N) (Nodes_Ptr[(N) - First_Node_Id + 5].U.K.pflag2)
+
+#ifdef __cplusplus
+}
+#endif
projects / gcc.git / blobdiff