Daily bump.
[official-gcc.git] / gcc / ada / repinfo.h
blobdeb1ed30ec93149d3094ee82e6ffc23554458352
1 /****************************************************************************
2 * *
3 * GNAT COMPILER COMPONENTS *
4 * *
5 * R E P I N F O *
6 * *
7 * C Header File *
8 * *
9 * $Revision: 1.1 $
10 * *
11 * Copyright (C) 1999-2001 Free Software Foundation, Inc. *
12 * *
13 * GNAT is free software; you can redistribute it and/or modify it under *
14 * terms of the GNU General Public License as published by the Free Soft- *
15 * ware Foundation; either version 2, or (at your option) any later ver- *
16 * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
17 * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
18 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
19 * for more details. You should have received a copy of the GNU General *
20 * Public License distributed with GNAT; see file COPYING. If not, write *
21 * to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, *
22 * MA 02111-1307, USA. *
23 * *
24 * As a special exception, if you link this file with other files to *
25 * produce an executable, this file does not by itself cause the resulting *
26 * executable to be covered by the GNU General Public License. This except- *
27 * ion does not however invalidate any other reasons why the executable *
28 * file might be covered by the GNU Public License. *
29 * *
30 * GNAT was originally developed by the GNAT team at New York University. *
31 * Extensive contributions were provided by Ada Core Technologies Inc. *
32 * *
33 ****************************************************************************/
35 /* This file corresponds to the Ada file repinfo.ads. */
37 typedef Uint Node_Ref;
38 typedef Uint Node_Ref_Or_Val;
39 typedef char TCode;
41 /* These are the values of TCcode that correspond to tree codes in tree.def,
42 except for the first, which is how we encode discriminants. */
44 #define Discrim_Val 0
45 #define Cond_Expr 1
46 #define Plus_Expr 2
47 #define Minus_Expr 3
48 #define Mult_Expr 4
49 #define Trunc_Div_Expr 5
50 #define Ceil_Div_Expr 6
51 #define Floor_Div_Expr 7
52 #define Trunc_Mod_Expr 8
53 #define Ceil_Mod_Expr 9
54 #define Floor_Mod_Expr 10
55 #define Exact_Div_Expr 11
56 #define Negate_Expr 12
57 #define Min_Expr 13
58 #define Max_Expr 14
59 #define Abs_Expr 15
60 #define Truth_Andif_Expr 16
61 #define Truth_Orif_Expr 17
62 #define Truth_And_Expr 18
63 #define Truth_Or_Expr 19
64 #define Truth_Xor_Expr 20
65 #define Truth_Not_Expr 21
66 #define Lt_Expr 22
67 #define Le_Expr 23
68 #define Gt_Expr 24
69 #define Ge_Expr 25
70 #define Eq_Expr 26
71 #define Ne_Expr 27
73 /* Creates a node using the tree code defined by Expr and from 1-3
74 operands as required (unused operands set as shown to No_Uint) Note
75 that this call can be used to create a discriminant reference by
76 using (Expr => Discrim_Val, Op1 => discriminant_number). */
77 #define Create_Node repinfo__create_node
78 extern Node_Ref Create_Node PARAMS((TCode, Node_Ref_Or_Val,
79 Node_Ref_Or_Val, Node_Ref_Or_Val));