+void lower_highlevel_graph(ir_graph *irg, int lower_bitfields) {
+
+ if (lower_bitfields) {
+ /* First step: lower bitfield access: must be run as long as Sels still
+ * exists. */
+ irg_walk_graph(irg, NULL, lower_bf_access, NULL);
+ }
+
+ /* Finally: lower SymConst-Size and Sel nodes, Casts, unaligned Load/Stores. */
+ irg_walk_graph(irg, NULL, lower_irnode, NULL);
+} /* lower_highlevel_graph */
+
+/*
+ * does the same as lower_highlevel() for all nodes on the const code irg
+ */
+void lower_const_code(void) {
+ walk_const_code(NULL, lower_irnode, NULL);
+} /* lower_const_code */
+
+/*
+ * Replaces SymConsts by a real constant if possible.
+ * Replace Sel nodes by address computation. Also resolves array access.
+ * Handle Bitfields by added And/Or calculations.
+ */
+void lower_highlevel(int lower_bitfields) {