2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief boolean condition/control flow optimizations
23 * @author Matthias Braun, Christoph Mallon, Michael Beck
24 * @version $Id: cfopt.c 22579 2008-10-07 14:54:04Z beck $
32 #include "../adt/array_t.h"
33 #include "iroptimize.h"
43 /** Describes a pair of relative conditions lo < hi, lo pnc_lo x, hi pnc_hi x */
44 typedef struct cond_pair {
45 ir_node *cmp_lo; /**< The lo compare node. */
46 ir_node *cmp_hi; /**< The hi compare node. */
47 pn_Cmp pnc_lo; /**< The lo relation node. */
48 pn_Cmp pnc_hi; /**< The hi relation node. */
49 ir_node *proj_lo; /**< The mode_b result proj of cmp_lo. */
50 ir_node *proj_hi; /**< The mode_b result proj of cmp_hi. */
51 tarval *tv_lo; /**< The tarval of cmp_lo node. */
52 tarval *tv_hi; /**< The tarval of cmp_hi node. */
53 ir_mode *lo_mode; /**< The mode of the cmp_lo operands. */
56 /** Environment for all walker in boolopt. */
58 int changed; /**< Set if the graph was changed. */
61 DEBUG_ONLY(static firm_dbg_module_t *dbg);
64 * Check if tho given nodes, l and r, represent two compares with
65 * ... . If yes, return non-zero and fill the res struct.
67 static int find_cond_pair(ir_node *const l, ir_node *const r, cond_pair *const res)
69 if (is_Proj(l) && is_Proj(r)) {
70 ir_node *const lo = get_Proj_pred(l);
71 ir_node *const ro = get_Proj_pred(r);
73 if (is_Cmp(lo) && is_Cmp(ro)) {
74 ir_node *const lol = get_Cmp_left(lo);
75 ir_node *const lor = get_Cmp_right(lo);
76 ir_node *const rol = get_Cmp_left(ro);
77 ir_node *const ror = get_Cmp_right(ro);
78 pn_Cmp const pnc_l = get_Proj_proj(l);
79 pn_Cmp const pnc_r = get_Proj_proj(r);
81 if (is_Const(lor) && is_Const_null(lor) &&
82 is_Const(ror) && is_Const_null(ror) &&
84 (pnc_l == pn_Cmp_Lg || pnc_l == pn_Cmp_Eq)) {
85 /* lo == (lol !=|== NULL) && ro == (rol !=|== NULL) */
92 res->tv_lo = get_Const_tarval(lor);
93 res->tv_hi = get_Const_tarval(ror);
94 res->lo_mode = get_irn_mode(lor);
99 if (lol == rol && lor != ror && is_Const(lor) && is_Const(ror)) {
100 /* lo == (x CMP c_l), ro == (x cmp c_r) */
101 tarval *const tv_l = get_Const_tarval(lor);
102 tarval *const tv_r = get_Const_tarval(ror);
103 pn_Cmp const rel = tarval_cmp(tv_l, tv_r);
105 res->lo_mode = get_irn_mode(lol);
107 if (rel == pn_Cmp_Lt) {
117 } else if (rel == pn_Cmp_Gt) {
128 /* The constants shall be unequal but comparable.
129 * Local optimizations handle the equal case. */
140 * Handle (lo pnc_lo x) AND (hi pnc_hi x)
142 static ir_node *bool_and(cond_pair* const cpair, ir_node *dst_block)
144 ir_node *const cmp_lo = cpair->cmp_lo;
145 ir_node *const cmp_hi = cpair->cmp_hi;
146 pn_Cmp pnc_lo = cpair->pnc_lo;
147 pn_Cmp const pnc_hi = cpair->pnc_hi;
148 ir_node *const proj_lo = cpair->proj_lo;
149 ir_node *const proj_hi = cpair->proj_hi;
150 tarval * tv_lo = cpair->tv_lo;
151 tarval * tv_hi = cpair->tv_hi;
152 ir_mode * mode = cpair->lo_mode;
154 if (pnc_lo == pn_Cmp_Eq && pnc_hi == pn_Cmp_Eq &&
155 tarval_is_null(tv_lo) && tarval_is_null(tv_hi) &&
156 mode == get_tarval_mode(tv_hi)) {
157 /* p == NULL && q == NULL ==> (p&q) == NULL) */
158 ir_node *lol, *hil, *cmp, *c, *p;
160 if (mode_is_reference(mode)) {
161 mode = find_unsigned_mode(mode);
164 tv_lo = tarval_convert_to(tv_lo, mode);
165 if (tv_lo == tarval_bad)
168 if (mode_is_int(mode)) {
169 lol = get_Cmp_left(cmp_lo);
170 lol = new_r_Conv(dst_block, lol, mode);
171 hil = get_Cmp_left(cmp_hi);
172 hil = new_r_Conv(dst_block, hil, mode);
173 p = new_r_And(dst_block, lol, hil, mode);
174 c = new_Const(tv_lo);
175 cmp = new_r_Cmp(dst_block, p, c);
176 p = new_r_Proj(dst_block, cmp, mode_b, pn_Cmp_Eq);
181 /* the following tests expect one common operand */
182 if (get_Cmp_left(cmp_lo) != get_Cmp_left(cmp_hi))
185 /* TODO: for now reject float modes */
186 if (! mode_is_int(mode))
189 /* Beware of NaN's, we can only check for (ordered) != here (which is Lg, not Ne) */
190 if ((pnc_lo == pn_Cmp_Lt || pnc_lo == pn_Cmp_Le || pnc_lo == pn_Cmp_Eq) &&
191 (pnc_hi == pn_Cmp_Eq || pnc_hi == pn_Cmp_Ge || pnc_hi == pn_Cmp_Gt)) {
192 /* x <|<=|== lo && x ==|>=|> hi ==> false */
193 ir_node *const t = new_Const(tarval_b_false);
195 } else if ((pnc_lo == pn_Cmp_Lt || pnc_lo == pn_Cmp_Le || pnc_lo == pn_Cmp_Eq) &&
196 (pnc_hi == pn_Cmp_Lt || pnc_hi == pn_Cmp_Le || pnc_hi == pn_Cmp_Lg)) {
197 /* x <|<=|== lo && x <|<=|!= hi ==> x <|<=|== lo */
199 } else if ((pnc_lo == pn_Cmp_Ge || pnc_lo == pn_Cmp_Gt || pnc_lo == pn_Cmp_Lg) &&
200 (pnc_hi == pn_Cmp_Eq || pnc_hi == pn_Cmp_Ge || pnc_hi == pn_Cmp_Gt)) {
201 /* x >=|>|!= lo && x ==|>=|> hi ==> x ==|>=|> hi */
203 } else if (tarval_is_one(tarval_sub(tv_hi, tv_lo, NULL))) { /* lo + 1 == hi */
204 if (pnc_lo == pn_Cmp_Ge && pnc_hi == pn_Cmp_Lt) {
205 /* x >= c && x < c + 1 ==> x == c */
206 ir_node *const block = get_nodes_block(cmp_lo);
207 ir_node *const p = new_r_Proj(block, cmp_lo, mode_b, pn_Cmp_Eq);
209 } else if (pnc_lo == pn_Cmp_Gt) {
210 if (pnc_hi == pn_Cmp_Lg) {
211 /* x > c && x != c + 1 ==> x > c + 1 */
212 ir_node *const block = get_nodes_block(cmp_hi);
213 ir_node *const p = new_r_Proj(block, cmp_hi, mode_b, pn_Cmp_Gt);
215 } else if (pnc_hi == pn_Cmp_Lt) {
216 /* x > c && x < c + 1 ==> false */
217 ir_node *const t = new_Const(tarval_b_false);
219 } else if (pnc_hi == pn_Cmp_Le) {
220 /* x > c && x <= c + 1 ==> x != c + 1 */
221 ir_node *const block = get_nodes_block(cmp_hi);
222 ir_node *const p = new_r_Proj(block, cmp_hi, mode_b, pn_Cmp_Eq);
225 } else if (pnc_lo == pn_Cmp_Lg && pnc_hi == pn_Cmp_Lt) {
226 /* x != c && c < c + 1 ==> x < c */
227 ir_node *const block = get_nodes_block(cmp_lo);
228 ir_node *const p = new_r_Proj(block, cmp_lo, mode_b, pn_Cmp_Lt);
231 } else if ((pnc_lo == pn_Cmp_Gt || pnc_lo == pn_Cmp_Ge) &&
232 (pnc_hi == pn_Cmp_Lt || pnc_lo == pn_Cmp_Le) &&
233 get_mode_arithmetic(mode) == irma_twos_complement) {
234 /* works for two-complements only */
235 /* x >|\= lo && x <|<= hi ==> (x - lo) <u|<=u (hi-lo) */
236 if (pnc_lo == pn_Cmp_Gt) {
237 /* must convert to >= */
238 ir_mode *mode = get_tarval_mode(tv_lo);
239 tarval *n = tarval_add(tv_lo, get_mode_one(mode));
240 if (n != tarval_bad && tarval_cmp(n, tv_lo) == pn_Cmp_Gt) {
246 if (pnc_lo == pn_Cmp_Ge) {
248 ir_node *const block = get_nodes_block(cmp_hi);
249 ir_node * x = get_Cmp_left(cmp_hi);
250 ir_mode * mode = get_irn_mode(x);
251 ir_node *sub, *cmp, *c, *subc, *p;
253 if (mode_is_signed(mode)) {
254 /* convert to unsigned */
255 mode = find_unsigned_mode(mode);
258 x = new_r_Conv(block, x, mode);
259 tv_lo = tarval_convert_to(tv_lo, mode);
260 tv_hi = tarval_convert_to(tv_hi, mode);
261 if (tv_lo == tarval_bad || tv_hi == tarval_bad)
264 c = new_Const(tv_lo);
265 sub = new_r_Sub(block, x, c, mode);
266 subc = new_r_Sub(block, new_Const(tv_hi), c, mode);
267 cmp = new_r_Cmp(block, sub, subc);
268 p = new_r_Proj(block, cmp, mode_b, pnc_hi);
276 * Handle (lo pnc_lo x) OR (hi pnc_hi x)
278 static ir_node *bool_or(cond_pair *const cpair, ir_node *dst_block)
280 ir_node *const cmp_lo = cpair->cmp_lo;
281 ir_node *const cmp_hi = cpair->cmp_hi;
282 pn_Cmp pnc_lo = cpair->pnc_lo;
283 pn_Cmp const pnc_hi = cpair->pnc_hi;
284 ir_node *const proj_lo = cpair->proj_lo;
285 ir_node *const proj_hi = cpair->proj_hi;
286 tarval * tv_lo = cpair->tv_lo;
287 tarval * tv_hi = cpair->tv_hi;
288 ir_mode * mode = cpair->lo_mode;
290 if (pnc_lo == pn_Cmp_Lg && pnc_hi == pn_Cmp_Lg &&
291 tarval_is_null(tv_lo) && tarval_is_null(tv_hi) &&
292 mode == get_tarval_mode(tv_hi)) {
293 /* p != NULL || q != NULL ==> (p|q) != NULL) */
294 ir_node *lol, *hil, *cmp, *c, *p;
296 if (mode_is_reference(mode)) {
297 mode = find_unsigned_mode(mode);
300 tv_lo = tarval_convert_to(tv_lo, mode);
301 if (tv_lo == tarval_bad)
304 if (mode_is_int(mode)) {
305 lol = get_Cmp_left(cmp_lo);
306 lol = new_r_Conv(dst_block, lol, mode);
307 hil = get_Cmp_left(cmp_hi);
308 hil = new_r_Conv(dst_block, hil, mode);
309 p = new_r_Or(dst_block, lol, hil, mode);
310 c = new_Const(tv_lo);
311 cmp = new_r_Cmp(dst_block, p, c);
312 p = new_r_Proj(dst_block, cmp, mode_b, pn_Cmp_Lg);
317 /* the following tests expect one common operand */
318 if (get_Cmp_left(cmp_lo) != get_Cmp_left(cmp_hi))
321 /* TODO: for now reject float modes */
322 if (! mode_is_int(mode))
325 /* Beware of NaN's, we can only check for (ordered) != here (which is Lg, not Ne) */
326 if ((pnc_lo == pn_Cmp_Ge || pnc_lo == pn_Cmp_Gt || pnc_lo == pn_Cmp_Lg) &&
327 (pnc_hi == pn_Cmp_Lt || pnc_hi == pn_Cmp_Le || pnc_hi == pn_Cmp_Lg)) {
328 /* x >=|>|!= lo | x <|<=|!= hi ==> true */
329 ir_node *const t = new_Const(tarval_b_true);
331 } else if ((pnc_lo == pn_Cmp_Lt || pnc_lo == pn_Cmp_Le || pnc_lo == pn_Cmp_Eq) &&
332 (pnc_hi == pn_Cmp_Lt || pnc_hi == pn_Cmp_Le || pnc_hi == pn_Cmp_Lg)) {
333 /* x <|<=|== lo || x <|<=|!= hi ==> x <|<=|!= hi */
335 } else if ((pnc_lo == pn_Cmp_Ge || pnc_lo == pn_Cmp_Gt || pnc_lo == pn_Cmp_Lg) &&
336 (pnc_hi == pn_Cmp_Eq || pnc_hi == pn_Cmp_Ge || pnc_hi == pn_Cmp_Gt)) {
337 /* x >=|>|!= lo || x ==|>=|> hi ==> x >=|>|!= lo */
339 } else if (tarval_is_one(tarval_sub(tv_hi, tv_lo, NULL))) { /* lo + 1 == hi */
340 if (pnc_lo == pn_Cmp_Lt && pnc_hi == pn_Cmp_Ge) {
341 /* x < c || x >= c + 1 ==> x != c */
342 ir_node *const block = get_nodes_block(cmp_lo);
343 ir_node *const p = new_r_Proj(block, cmp_lo, mode_b, pn_Cmp_Lg);
345 } else if (pnc_lo == pn_Cmp_Le) {
346 if (pnc_hi == pn_Cmp_Eq) {
347 /* x <= c || x == c + 1 ==> x <= c + 1 */
348 ir_node *const block = get_nodes_block(cmp_hi);
349 ir_node *const p = new_r_Proj(block, cmp_hi, mode_b, pn_Cmp_Le);
351 } else if (pnc_hi == pn_Cmp_Ge) {
352 /* x <= c || x >= c + 1 ==> true */
353 ir_node *const t = new_Const(tarval_b_true);
355 } else if (pnc_hi == pn_Cmp_Gt) {
356 /* x <= c || x > c + 1 ==> x != c + 1 */
357 ir_node *const block = get_nodes_block(cmp_hi);
358 ir_node *const p = new_r_Proj(block, cmp_hi, mode_b, pn_Cmp_Lg);
361 } else if (pnc_lo == pn_Cmp_Eq && pnc_hi == pn_Cmp_Ge) {
362 /* x == c || x >= c + 1 ==> x >= c */
363 ir_node *const block = get_nodes_block(cmp_lo);
364 ir_node *const p = new_r_Proj(block, cmp_lo, mode_b, pn_Cmp_Ge);
367 } else if ((pnc_lo == pn_Cmp_Lt || pnc_lo == pn_Cmp_Le) &&
368 (pnc_hi == pn_Cmp_Gt || pnc_lo == pn_Cmp_Ge) &&
369 get_mode_arithmetic(mode) == irma_twos_complement) {
370 /* works for two-complements only */
371 /* x <|<= lo || x >|>= hi ==> (x - lo) >u|>=u (hi-lo) */
372 if (pnc_lo == pn_Cmp_Le) {
373 /* must convert to < */
374 ir_mode *mode = get_tarval_mode(tv_lo);
375 tarval *n = tarval_add(tv_lo, get_mode_one(mode));
376 if (n != tarval_bad && tarval_cmp(n, tv_lo) == pn_Cmp_Gt) {
382 if (pnc_lo == pn_Cmp_Lt) {
384 ir_node *const block = get_nodes_block(cmp_hi);
385 ir_node * x = get_Cmp_left(cmp_hi);
386 ir_mode * mode = get_irn_mode(x);
387 ir_node *sub, *cmp, *c, *subc, *p;
389 if (mode_is_signed(mode)) {
390 /* convert to unsigned */
391 mode = find_unsigned_mode(mode);
394 x = new_r_Conv(block, x, mode);
395 tv_lo = tarval_convert_to(tv_lo, mode);
396 tv_hi = tarval_convert_to(tv_hi, mode);
397 if (tv_lo == tarval_bad || tv_hi == tarval_bad)
400 c = new_Const(tv_lo);
401 sub = new_r_Sub(block, x, c, mode);
402 subc = new_r_Sub(block, new_Const(tv_hi), c, mode);
403 cmp = new_r_Cmp(block, sub, subc);
404 p = new_r_Proj(block, cmp, mode_b, pnc_hi);
412 * Walker, tries to optimize Andb and Orb nodes.
414 static void bool_walk(ir_node *n, void *ctx)
416 bool_opt_env_t *env = ctx;
418 if (get_irn_mode(n) != mode_b)
422 ir_node *const l = get_And_left(n);
423 ir_node *const r = get_And_right(n);
424 ir_node * replacement;
426 if (!find_cond_pair(l, r, &cpair))
428 replacement = bool_and(&cpair, get_nodes_block(n));
430 exchange(n, replacement);
433 } else if (is_Or(n)) {
434 ir_node *const l = get_Or_left(n);
435 ir_node *const r = get_Or_right(n);
436 ir_node * replacement;
438 if (!find_cond_pair(l, r, &cpair))
440 replacement = bool_or(&cpair, get_nodes_block(n));
442 exchange(n, replacement);
449 * Walker, clear Block marker and Phi lists.
451 static void clear_block_infos(ir_node *node, void *env)
455 /* we visit blocks before any other nodes (from the block) */
459 /* clear the PHI list */
460 set_Block_phis(node, NULL);
461 set_Block_mark(node, 0);
465 * Walker: collect Phi nodes and mark
467 static void collect_phis(ir_node *node, void *env)
472 ir_node *block = get_nodes_block(node);
473 add_Block_phi(block, node);
477 /* Ignore control flow nodes, these will be removed. */
478 if (get_irn_pinned(node) == op_pin_state_pinned &&
479 !is_Block(node) && !is_cfop(node)) {
480 /* found a pinned non-cf node, mark its block */
481 ir_node *block = get_nodes_block(node);
482 set_Block_mark(block, 1);
487 * If node is a Jmp in a block containing no pinned instruction
488 * and having only one predecessor, skip the block and return its
489 * cf predecessor, else the node itself.
491 static ir_node *skip_empty_blocks(ir_node *node)
493 while (is_Jmp(node)) {
494 ir_node *block = get_nodes_block(node);
496 if (get_Block_n_cfgpreds(block) != 1)
499 if (get_Block_mark(block))
502 node = get_Block_cfgpred(block, 0);
508 * Check if two block inputs can be fused.
509 * This can be done, if block contains no Phi node that depends on
510 * different inputs idx_i and idx_j.
512 static int can_fuse_block_inputs(const ir_node *block, int idx_i, int idx_j) {
515 for (phi = get_Block_phis(block); phi != NULL; phi = get_Phi_next(phi)) {
516 if (get_Phi_pred(phi, idx_i) != get_Phi_pred(phi, idx_j))
523 * Remove block input with given index.
525 static void remove_block_input(ir_node *block, int idx)
527 int i, j, n = get_Block_n_cfgpreds(block) - 1;
530 NEW_ARR_A(ir_node *, ins, n);
533 /* all Phis will be deleted */
536 for (phi = get_Block_phis(block); phi != NULL; phi = next_phi) {
537 next_phi = get_Phi_next(phi);
538 exchange(phi, get_Phi_pred(phi, idx ^ 1));
540 set_Block_phis(block, NULL);
542 for (phi = get_Block_phis(block); phi != NULL; phi = get_Phi_next(phi)) {
543 for (i = j = 0; i <= n; ++i) {
545 ins[j++] = get_Phi_pred(phi, i);
547 set_irn_in(phi, n, ins);
550 for (i = j = 0; i <= n; ++i) {
552 ins[j++] = get_Block_cfgpred(block, i);
554 set_irn_in(block, n, ins);
558 * Under the preposition that we have a chain of blocks from
559 * from_block to to_block, collapse them all into to_block.
561 static void move_nodes_to_block(ir_node *jmp, ir_node *to_block) {
562 ir_node *new_jmp = NULL;
563 ir_node *block, *next_block;
565 for (block = get_nodes_block(jmp); block != to_block; block = next_block) {
566 new_jmp = get_Block_cfgpred(block, 0);
567 next_block = get_nodes_block(new_jmp);
568 exchange(block, to_block);
571 exchange(jmp, new_jmp);
577 * if we can find the following structure,
588 * try to convert it into a (x pnc_lo c_lo) || (x pnc_hi c_hi)
591 static void find_cf_and_or_walker(ir_node *block, void *ctx)
594 int n_cfgpreds = get_Block_n_cfgpreds(block);
595 bool_opt_env_t *env = ctx;
601 for (low_idx = 0; low_idx < n_cfgpreds; ++low_idx) {
602 ir_node *lower_block;
605 ir_node *cond_selector;
608 lower_cf = get_Block_cfgpred(block, low_idx);
609 lower_cf = skip_empty_blocks(lower_cf);
610 if (!is_Proj(lower_cf))
613 cond = get_Proj_pred(lower_cf);
617 lower_block = get_nodes_block(cond);
618 if (get_Block_n_cfgpreds(lower_block) != 1)
621 /* the block must not produce any side-effects */
622 if (get_Block_mark(lower_block))
625 cond_selector = get_Cond_selector(cond);
626 if (get_irn_mode(cond_selector) != mode_b)
629 lower_pred = get_Block_cfgpred_block(lower_block, 0);
631 for (up_idx = 0; up_idx < n_cfgpreds; ++up_idx) {
632 ir_node *upper_block;
635 ir_node *upper_cond_selector;
636 ir_node *replacement;
639 upper_cf = get_Block_cfgpred(block, up_idx);
640 upper_cf = skip_empty_blocks(upper_cf);
641 if (is_Bad(upper_cf))
643 upper_block = get_nodes_block(upper_cf);
644 if (upper_block != lower_pred)
646 if (!block_dominates(upper_block, block))
649 assert(is_Proj(upper_cf));
650 upper_cond = get_Proj_pred(upper_cf);
651 assert(is_Cond(upper_cond));
652 upper_cond_selector = get_Cond_selector(upper_cond);
653 if (get_irn_mode(upper_cond_selector) != mode_b)
656 /* we have found the structure */
657 /* check Phis: There must be NO Phi in block that
658 depends on the existence of low block */
659 if (!can_fuse_block_inputs(block, low_idx, up_idx))
662 /* all fine, try it */
663 if (!find_cond_pair(cond_selector, upper_cond_selector, &cpair))
666 /* normalize pncs: we need the true case to jump into the
667 * common block (ie. conjunctive normal form) */
668 if (get_Proj_proj(lower_cf) == pn_Cond_false) {
669 if (cpair.proj_lo == cond_selector) {
670 ir_mode *mode = get_tarval_mode(cpair.tv_lo);
671 ir_node *cmp = get_Proj_pred(cpair.proj_lo);
672 ir_node *block = get_nodes_block(cmp);
673 cpair.pnc_lo = get_negated_pnc(cpair.pnc_lo, mode);
674 cpair.proj_lo = new_r_Proj(block, cmp, mode_b, cpair.pnc_lo);
676 ir_mode *mode = get_tarval_mode(cpair.tv_hi);
677 ir_node *cmp = get_Proj_pred(cpair.proj_hi);
678 ir_node *block = get_nodes_block(cmp);
679 assert(cpair.proj_hi == cond_selector);
680 cpair.pnc_hi = get_negated_pnc(cpair.pnc_hi, mode);
681 cpair.proj_hi = new_r_Proj(block, cmp, mode_b, cpair.pnc_hi);
684 if (get_Proj_proj(upper_cf) == pn_Cond_false) {
685 if (cpair.proj_lo == upper_cond_selector) {
686 ir_mode *mode = get_tarval_mode(cpair.tv_lo);
687 ir_node *cmp = get_Proj_pred(cpair.proj_lo);
688 ir_node *block = get_nodes_block(cmp);
689 cpair.pnc_lo = get_negated_pnc(cpair.pnc_lo, mode);
690 cpair.proj_lo = new_r_Proj(block, cmp, mode_b, cpair.pnc_lo);
692 ir_mode *mode = get_tarval_mode(cpair.tv_hi);
693 ir_node *cmp = get_Proj_pred(cpair.proj_hi);
694 ir_node *block = get_nodes_block(cmp);
695 assert(cpair.proj_hi == upper_cond_selector);
696 cpair.pnc_hi = get_negated_pnc(cpair.pnc_hi, mode);
697 cpair.proj_hi = new_r_Proj(block, cmp, mode_b, cpair.pnc_hi);
701 /* can we optimize the case? */
702 replacement = bool_or(&cpair, upper_block);
703 if (replacement == NULL)
708 DB((dbg, LEVEL_1, "boolopt: %+F: fusing (ub %+F lb %+F)\n",
709 current_ir_graph, upper_block, lower_block));
711 /* move all expressions on the path to lower/upper block */
712 move_nodes_to_block(get_Block_cfgpred(block, up_idx), upper_block);
713 move_nodes_to_block(get_Block_cfgpred(block, low_idx), lower_block);
715 /* move all nodes from lower block to upper block */
716 exchange(lower_block, upper_block);
718 remove_block_input(block, up_idx);
721 /* the optimizations expected the true case to jump */
722 if (get_Proj_proj(lower_cf) == pn_Cond_false) {
723 ir_node *block = get_nodes_block(replacement);
724 replacement = new_rd_Not(NULL, block, replacement, mode_b);
726 set_Cond_selector(cond, replacement);
733 void opt_bool(ir_graph *const irg)
737 /* register a debug mask */
738 FIRM_DBG_REGISTER(dbg, "firm.opt.bool");
740 /* works better with one return block only */
741 normalize_one_return(irg);
745 /* optimize simple Andb and Orb cases */
746 irg_walk_graph(irg, NULL, bool_walk, &env);
748 ir_reserve_resources(irg, IR_RESOURCE_BLOCK_MARK | IR_RESOURCE_PHI_LIST);
750 /* now more complicated cases: find control flow And/Or and optimize. */
751 irg_walk_graph(irg, clear_block_infos, collect_phis, NULL);
752 irg_block_walk_graph(irg, NULL, find_cf_and_or_walker, &env);
755 set_irg_outs_inconsistent(irg);
756 set_irg_doms_inconsistent(irg);
757 set_irg_extblk_inconsistent(irg);
758 set_irg_loopinfo_inconsistent(irg);
761 ir_free_resources(irg, IR_RESOURCE_BLOCK_MARK | IR_RESOURCE_PHI_LIST);
764 /* Creates an ir_graph pass for opt_bool. */
765 ir_graph_pass_t *opt_bool_pass(const char *name)
767 return def_graph_pass(name ? name : "opt_bool", opt_bool);
768 } /* opt_bool_pass */