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