PR ada/18819
[official-gcc.git] / gcc / ada / repinfo.h
blobec5452dafb6b707cae192b88e558769e1bcf1f7e
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-2005 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 2, 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. See the GNU General Public License *
17 * for more details. You should have received a copy of the GNU General *
18 * Public License distributed with GNAT; see file COPYING. If not, write *
19 * to the Free Software Foundation, 51 Franklin Street, Fifth Floor, *
20 * Boston, MA 02110-1301, USA. *
21 * *
22 * As a special exception, if you link this file with other files to *
23 * produce an executable, this file does not by itself cause the resulting *
24 * executable to be covered by the GNU General Public License. This except- *
25 * ion does not however invalidate any other reasons why the executable *
26 * file might be covered by the GNU Public License. *
27 * *
28 * GNAT was originally developed by the GNAT team at New York University. *
29 * Extensive contributions were provided by Ada Core Technologies Inc. *
30 * *
31 ****************************************************************************/
33 /* This file corresponds to the Ada file repinfo.ads. */
35 typedef Uint Node_Ref;
36 typedef Uint Node_Ref_Or_Val;
37 typedef char TCode;
39 /* These are the values of TCcode that correspond to tree codes in tree.def,
40 except for the first, which is how we encode discriminants. */
42 #define Discrim_Val 0
43 #define Cond_Expr 1
44 #define Plus_Expr 2
45 #define Minus_Expr 3
46 #define Mult_Expr 4
47 #define Trunc_Div_Expr 5
48 #define Ceil_Div_Expr 6
49 #define Floor_Div_Expr 7
50 #define Trunc_Mod_Expr 8
51 #define Ceil_Mod_Expr 9
52 #define Floor_Mod_Expr 10
53 #define Exact_Div_Expr 11
54 #define Negate_Expr 12
55 #define Min_Expr 13
56 #define Max_Expr 14
57 #define Abs_Expr 15
58 #define Truth_Andif_Expr 16
59 #define Truth_Orif_Expr 17
60 #define Truth_And_Expr 18
61 #define Truth_Or_Expr 19
62 #define Truth_Xor_Expr 20
63 #define Truth_Not_Expr 21
64 #define Lt_Expr 22
65 #define Le_Expr 23
66 #define Gt_Expr 24
67 #define Ge_Expr 25
68 #define Eq_Expr 26
69 #define Ne_Expr 27
70 #define Bit_And_Expr 28
72 /* Creates a node using the tree code defined by Expr and from 1-3
73 operands as required (unused operands set as shown to No_Uint) Note
74 that this call can be used to create a discriminant reference by
75 using (Expr => Discrim_Val, Op1 => discriminant_number). */
76 #define Create_Node repinfo__create_node
77 extern Node_Ref Create_Node (TCode, Node_Ref_Or_Val,
78 Node_Ref_Or_Val, Node_Ref_Or_Val);