clean up and renames beginigs of a testsuite
[official-gcc.git] / gcc / ada / repinfo.h
blob668f520ffa08eecadb38290bc9aaefd5512f5a3d
1 /****************************************************************************
2 * *
3 * GNAT COMPILER COMPONENTS *
4 * *
5 * R E P I N F O *
6 * *
7 * C Header File *
8 * *
9 * Copyright (C) 1999-2009 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 /* This file corresponds to the Ada file repinfo.ads. */
34 typedef Uint Node_Ref;
35 typedef Uint Node_Ref_Or_Val;
36 typedef char TCode;
38 /* These are the values of TCcode that correspond to tree codes in tree.def,
39 except for the first, which is how we encode discriminants. */
41 #define Discrim_Val 0
42 #define Cond_Expr 1
43 #define Plus_Expr 2
44 #define Minus_Expr 3
45 #define Mult_Expr 4
46 #define Trunc_Div_Expr 5
47 #define Ceil_Div_Expr 6
48 #define Floor_Div_Expr 7
49 #define Trunc_Mod_Expr 8
50 #define Ceil_Mod_Expr 9
51 #define Floor_Mod_Expr 10
52 #define Exact_Div_Expr 11
53 #define Negate_Expr 12
54 #define Min_Expr 13
55 #define Max_Expr 14
56 #define Abs_Expr 15
57 #define Truth_Andif_Expr 16
58 #define Truth_Orif_Expr 17
59 #define Truth_And_Expr 18
60 #define Truth_Or_Expr 19
61 #define Truth_Xor_Expr 20
62 #define Truth_Not_Expr 21
63 #define Lt_Expr 22
64 #define Le_Expr 23
65 #define Gt_Expr 24
66 #define Ge_Expr 25
67 #define Eq_Expr 26
68 #define Ne_Expr 27
69 #define Bit_And_Expr 28
71 /* Creates a node using the tree code defined by Expr and from 1-3
72 operands as required (unused operands set as shown to No_Uint) Note
73 that this call can be used to create a discriminant reference by
74 using (Expr => Discrim_Val, Op1 => discriminant_number). */
75 #define Create_Node repinfo__create_node
76 extern Node_Ref Create_Node (TCode, Node_Ref_Or_Val,
77 Node_Ref_Or_Val, Node_Ref_Or_Val);