[Ada] Various typo fixes and reformatting of comments

[gcc.git] / gcc / ada / atree.h

diff --git a/gcc/ada/atree.h b/gcc/ada/atree.h
index 7d603ba425dde19a7ef88b38a10b801056fab2bd..c63c53552bcccdd0d5d60624b4338f2682c354fe 100644 (file)
--- a/gcc/ada/atree.h
+++ b/gcc/ada/atree.h
@@ -6,7 +6,7 @@
  *                                                                          *
  *                              C Header File                               *
  *                                                                          *
- *          Copyright (C) 1992-2013, 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- *
@@ -23,9 +23,9 @@
  *                                                                          *
  ****************************************************************************/
 
-/* 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
@@ -359,6 +359,9 @@ extern struct Node *Nodes_Ptr;
 #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
@@ -448,6 +451,12 @@ extern Node_Id Current_Error_Node;
 #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)
@@ -485,6 +494,11 @@ extern Node_Id Current_Error_Node;
 #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)
@@ -494,6 +508,8 @@ extern Node_Id Current_Error_Node;
 #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)
@@ -503,6 +519,7 @@ extern Node_Id Current_Error_Node;
 #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)
@@ -512,6 +529,9 @@ extern Node_Id Current_Error_Node;
 #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)
@@ -535,6 +555,7 @@ extern Node_Id Current_Error_Node;
 #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)
@@ -846,6 +867,29 @@ extern Node_Id Current_Error_Node;
 #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
 }