1 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
2 ** All rights reserved.
4 ** Authors: Martin Trapp, Christian Schaefer &
7 ** common.h: common firm declarations
13 /* There are two implementations of the Phi node construction. The first
14 is faster, but does not work for blocks with more than 2 predecessors.
15 The second works always but is slower and causes more unnecessary Phi
17 Select the implementations by the following preprocessor flag: */
18 #define USE_FAST_PHI_CONSTRUCTION 1
20 /* Further there are two versions of the fast Phi node construction.
21 If the following flag is set, new_r_Phi_in uses an explicit stack for
22 allocating and deallocating Phi nodes. Else it uses the obstack
24 #define USE_EXPICIT_PHI_IN_STACK 0
26 /* a list of firm kinds */
40 /* returns the kind of the thing */
41 firm_kind get_kind(void *firm_thing);
44 # endif /*_COMMON_H_ */