* arm.md (reload_mulsi3, reload_mulsi_compare0, reload_muladdsi)
[official-gcc.git] / gcc / ada / repinfo.h
blob74e79b8dd58e0223eea4cf9f2ad07fe65db22c13
1 /****************************************************************************
2 * *
3 * GNAT COMPILER COMPONENTS *
4 * *
5 * R E P I N F O *
6 * *
7 * C Header File *
8 * *
9 * *
10 * Copyright (C) 1999-2001 Free Software Foundation, Inc. *
11 * *
12 * GNAT is free software; you can redistribute it and/or modify it under *
13 * terms of the GNU General Public License as published by the Free Soft- *
14 * ware Foundation; either version 2, or (at your option) any later ver- *
15 * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
16 * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
17 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
18 * for more details. You should have received a copy of the GNU General *
19 * Public License distributed with GNAT; see file COPYING. If not, write *
20 * to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, *
21 * MA 02111-1307, USA. *
22 * *
23 * As a special exception, if you link this file with other files to *
24 * produce an executable, this file does not by itself cause the resulting *
25 * executable to be covered by the GNU General Public License. This except- *
26 * ion does not however invalidate any other reasons why the executable *
27 * file might be covered by the GNU Public License. *
28 * *
29 * GNAT was originally developed by the GNAT team at New York University. *
30 * It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). *
31 * *
32 ****************************************************************************/
34 /* This file corresponds to the Ada file repinfo.ads. */
36 typedef Uint Node_Ref;
37 typedef Uint Node_Ref_Or_Val;
38 typedef char TCode;
40 /* These are the values of TCcode that correspond to tree codes in tree.def,
41 except for the first, which is how we encode discriminants. */
43 #define Discrim_Val 0
44 #define Cond_Expr 1
45 #define Plus_Expr 2
46 #define Minus_Expr 3
47 #define Mult_Expr 4
48 #define Trunc_Div_Expr 5
49 #define Ceil_Div_Expr 6
50 #define Floor_Div_Expr 7
51 #define Trunc_Mod_Expr 8
52 #define Ceil_Mod_Expr 9
53 #define Floor_Mod_Expr 10
54 #define Exact_Div_Expr 11
55 #define Negate_Expr 12
56 #define Min_Expr 13
57 #define Max_Expr 14
58 #define Abs_Expr 15
59 #define Truth_Andif_Expr 16
60 #define Truth_Orif_Expr 17
61 #define Truth_And_Expr 18
62 #define Truth_Or_Expr 19
63 #define Truth_Xor_Expr 20
64 #define Truth_Not_Expr 21
65 #define Lt_Expr 22
66 #define Le_Expr 23
67 #define Gt_Expr 24
68 #define Ge_Expr 25
69 #define Eq_Expr 26
70 #define Ne_Expr 27
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 PARAMS((TCode, Node_Ref_Or_Val,
78 Node_Ref_Or_Val, Node_Ref_Or_Val));