+/**
+ * @ingroup Switch
+ * A switch table mapping integer numbers to proj-numbers of a Switch-node.
+ * Entries map a continuous range of integer numbers to a proj-number.
+ * There must never be two different entries matching the same integer number.
+ */
+typedef struct ir_switch_table ir_switch_table;
+
+/**
+ * @ingroup ir_cons
+ * This function is called, whenever a local variable is used before definition
+ *
+ * @param irg the IR graph on which this happens
+ * @param mode the mode of the local var
+ * @param pos position chosen be the frontend for this variable (n_loc)
+ *
+ * @return a firm node of mode @p mode that initializes the var at position pos
+ *
+ * @note
+ * Do not return NULL!
+ * If this function is not set, FIRM will create a const node with tarval BAD.
+ * Use set_irg_loc_description()/get_irg_loc_description() to assign additional
+ * informations to local variables.
+ */
+typedef ir_node *uninitialized_local_variable_func_t(ir_graph *irg, ir_mode *mode, int pos);
+
+#ifdef __cplusplus
+# define ENUM_BITSET(type) \
+ extern "C++" { \
+ static inline type operator ~ (type a) { return (type)~(int)a; } \
+ static inline type operator & (type a, type b) { return (type)((int)a & (int)b); } \
+ static inline type operator &= (type& a, type b) { return a = (type)((int)a & (int)b); } \
+ static inline type operator ^ (type a, type b) { return (type)((int)a ^ (int)b); } \
+ static inline type operator ^= (type& a, type b) { return a = (type)((int)a ^ (int)b); } \
+ static inline type operator | (type a, type b) { return (type)((int)a | (int)b); } \
+ static inline type operator |= (type& a, type b) { return a = (type)((int)a | (int)b); } \
+ }
+#else
+/** Marks an enum type as bitset enum. That is the enumeration values will
+ * probably be combined to form a (bit)set of flags.
+ * When compiling for C++ this macro will define the ~, &, &=, ^, ^=, | and |=
+ * operators for the enum values. */
+# define ENUM_BITSET(type)
+#endif
+
+#ifdef __cplusplus
+# define ENUM_COUNTABLE(type) \
+ extern "C++" { \
+ static inline type operator ++(type& a) { return a = (type)((int)a + 1); } \
+ static inline type operator --(type& a) { return a = (type)((int)a - 1); } \
+ }
+#else
+/** Marks an enum type as countable enum. The enumeration values will be a
+ * linear sequence of numbers which can be iterated through by incrementing
+ * by 1.
+ * When compiling for C++ this macro will define the ++ and -- operators. */
+# define ENUM_COUNTABLE(type)
+#endif
+
+/**
+ * @ingroup ir_node
+ * Relations for comparing numbers
+ */
+typedef enum ir_relation {
+ ir_relation_false = 0, /**< always false */
+ ir_relation_equal = 1u << 0, /**< equal */
+ ir_relation_less = 1u << 1, /**< less */
+ ir_relation_greater = 1u << 2, /**< greater */
+ ir_relation_unordered = 1u << 3, /**< unordered */
+ ir_relation_less_equal = ir_relation_equal|ir_relation_less, /**< less or equal */
+ ir_relation_greater_equal = ir_relation_equal|ir_relation_greater, /**< greater or equal */
+ ir_relation_less_greater = ir_relation_less|ir_relation_greater, /** less or greater ('not equal' for integer numbers) */
+ ir_relation_less_equal_greater = ir_relation_equal|ir_relation_less|ir_relation_greater, /**< less equal or greater ('not unordered') */
+ ir_relation_unordered_equal = ir_relation_unordered|ir_relation_equal, /**< unordered or equal */
+ ir_relation_unordered_less = ir_relation_unordered|ir_relation_less, /**< unordered or less */
+ ir_relation_unordered_less_equal = ir_relation_unordered|ir_relation_less|ir_relation_equal, /**< unordered, less or equal */
+ ir_relation_unordered_greater = ir_relation_unordered|ir_relation_greater, /**< unordered or greater */
+ ir_relation_unordered_greater_equal = ir_relation_unordered|ir_relation_greater|ir_relation_equal, /**< unordered, greater or equal */
+ ir_relation_unordered_less_greater = ir_relation_unordered|ir_relation_less|ir_relation_greater, /**< unordered, less or greater ('not equal' for floatingpoint numbers) */
+ ir_relation_true = ir_relation_equal|ir_relation_less|ir_relation_greater|ir_relation_unordered, /**< always true */
+} ir_relation;
+ENUM_BITSET(ir_relation)
+
+/**
+ * @ingroup ir_node
+ * constrained flags for memory operations.
+ */
+typedef enum ir_cons_flags {
+ cons_none = 0, /**< No constrains. */
+ cons_volatile = 1U << 0, /**< Memory operation is volatile. */
+ cons_unaligned = 1U << 1, /**< Memory operation is unaligned. */
+ cons_floats = 1U << 2, /**< Memory operation can float. */
+ cons_throws_exception = 1U << 3, /**< fragile op throws exception (and
+ produces X_regular and X_except
+ values) */
+} ir_cons_flags;
+ENUM_BITSET(ir_cons_flags)
+
+/**
+ * @ingroup ir_node
+ * pinned states.
+ */
+typedef enum op_pin_state {
+ op_pin_state_floats = 0, /**< Nodes of this opcode can be placed in any basic block. */
+ op_pin_state_pinned = 1, /**< Nodes must remain in this basic block. */
+ op_pin_state_exc_pinned, /**< Node must be remain in this basic block if it can throw an
+ exception, else can float. Used internally. */
+ op_pin_state_mem_pinned /**< Node must be remain in this basic block if it can throw an
+ exception or uses memory, else can float. Used internally. */
+} op_pin_state;
+
+/**
+ * @ingroup Cond
+ * A type to express conditional jump predictions.
+ */
+typedef enum cond_jmp_predicate {
+ COND_JMP_PRED_NONE, /**< No jump prediction. Default. */
+ COND_JMP_PRED_TRUE, /**< The True case is predicted. */
+ COND_JMP_PRED_FALSE /**< The False case is predicted. */
+} cond_jmp_predicate;