12 typedef struct cond_pair {
23 static int find_cond_pair(ir_node *const l, ir_node *const r, cond_pair *const res)
25 if (is_Proj(l) && is_Proj(r)) {
26 ir_node *const lo = get_Proj_pred(l);
27 ir_node *const ro = get_Proj_pred(r);
29 if (is_Cmp(lo) && is_Cmp(ro)) {
30 ir_node *const lol = get_Cmp_left(lo);
31 ir_node *const lor = get_Cmp_right(lo);
32 ir_node *const rol = get_Cmp_left(ro);
33 ir_node *const ror = get_Cmp_right(ro);
35 if(is_Const(lor) && is_Const_null(lor) && is_Const(ror) && is_Const_null(ror) && get_Proj_proj(l) == pn_Cmp_Lg && get_Proj_proj(r) == pn_Cmp_Lg) {
36 ir_fprintf(stderr, "found zero zero\n");
40 /* The constants shall be unequal. Local optimisations handle the
42 if (lol == rol && mode_is_int(get_irn_mode(lol)) && lor != ror && is_Const(lor) && is_Const(ror)) {
43 tarval *const tv_l = get_Const_tarval(lor);
44 tarval *const tv_r = get_Const_tarval(ror);
45 pn_Cmp const pnc_l = get_Proj_proj(l);
46 pn_Cmp const pnc_r = get_Proj_proj(r);
47 pn_Cmp const rel = tarval_cmp(tv_l, tv_r);
49 assert(rel != pn_Cmp_Eq);
51 if (rel == pn_Cmp_Lt) {
61 assert(rel == pn_Cmp_Gt);
78 static ir_node *bool_and(cond_pair* const cpair)
80 ir_node *const cmp_lo = cpair->cmp_lo;
81 ir_node *const cmp_hi = cpair->cmp_hi;
82 pn_Cmp const pnc_lo = cpair->pnc_lo;
83 pn_Cmp const pnc_hi = cpair->pnc_hi;
84 ir_node *const proj_lo = cpair->proj_lo;
85 ir_node *const proj_hi = cpair->proj_hi;
86 tarval *const tv_lo = cpair->tv_lo;
87 tarval *const tv_hi = cpair->tv_hi;
89 /* Beware of NaN's, we can only check for (ordered) != here (which is Lg, not Ne) */
90 if ((pnc_lo == pn_Cmp_Lt || pnc_lo == pn_Cmp_Le || pnc_lo == pn_Cmp_Eq) &&
91 (pnc_hi == pn_Cmp_Eq || pnc_hi == pn_Cmp_Ge || pnc_hi == pn_Cmp_Gt)) {
92 /* x <|<=|== lo | x ==|>=|> hi -> false */
93 ir_node *const t = new_Const(mode_b, tarval_b_false);
95 } else if ((pnc_lo == pn_Cmp_Lt || pnc_lo == pn_Cmp_Le || pnc_lo == pn_Cmp_Eq) &&
96 (pnc_hi == pn_Cmp_Lt || pnc_hi == pn_Cmp_Le || pnc_hi == pn_Cmp_Lg)) {
97 /* x <|<=|== lo && x <|<=|!= hi -> x <|<=|== lo */
99 } else if ((pnc_lo == pn_Cmp_Ge || pnc_lo == pn_Cmp_Gt || pnc_lo == pn_Cmp_Lg) &&
100 (pnc_hi == pn_Cmp_Eq || pnc_hi == pn_Cmp_Ge || pnc_hi == pn_Cmp_Gt)) {
101 /* x >=|>|!= lo || x ==|>=|> hi -> x ==|>=|> hi */
103 } else if (tarval_is_one(tarval_sub(tv_hi, tv_lo, NULL))) { /* lo + 1 == hi */
104 if (pnc_lo == pn_Cmp_Ge && pnc_hi == pn_Cmp_Lt) {
105 /* x >= c || x < c + 1 -> x == c */
106 ir_graph *const irg = current_ir_graph;
107 ir_node *const block = get_nodes_block(cmp_lo);
108 ir_node *const p = new_r_Proj(irg, block, cmp_lo, mode_b, pn_Cmp_Eq);
110 } else if (pnc_lo == pn_Cmp_Gt) {
111 if (pnc_hi == pn_Cmp_Lg) {
112 /* x > c || x != c + 1 -> x > c + 1 */
113 ir_graph *const irg = current_ir_graph;
114 ir_node *const block = get_nodes_block(cmp_hi);
115 ir_node *const p = new_r_Proj(irg, block, cmp_hi, mode_b, pn_Cmp_Gt);
117 } else if (pnc_hi == pn_Cmp_Lt) {
118 /* x > c || x < c + 1 -> false */
119 ir_node *const t = new_Const(mode_b, tarval_b_false);
121 } else if (pnc_hi == pn_Cmp_Le) {
122 /* x > c || x <= c + 1 -> x != c + 1 */
123 ir_graph *const irg = current_ir_graph;
124 ir_node *const block = get_nodes_block(cmp_hi);
125 ir_node *const p = new_r_Proj(irg, block, cmp_hi, mode_b, pn_Cmp_Eq);
128 } else if (pnc_lo == pn_Cmp_Lg && pnc_hi == pn_Cmp_Lt) {
129 /* x != c || c < c + 1 -> x < c */
130 ir_graph *const irg = current_ir_graph;
131 ir_node *const block = get_nodes_block(cmp_lo);
132 ir_node *const p = new_r_Proj(irg, block, cmp_lo, mode_b, pn_Cmp_Lt);
139 static ir_node *bool_or(cond_pair *const cpair)
141 ir_node *const cmp_lo = cpair->cmp_lo;
142 ir_node *const cmp_hi = cpair->cmp_hi;
143 pn_Cmp const pnc_lo = cpair->pnc_lo;
144 pn_Cmp const pnc_hi = cpair->pnc_hi;
145 ir_node *const proj_lo = cpair->proj_lo;
146 ir_node *const proj_hi = cpair->proj_hi;
147 tarval *const tv_lo = cpair->tv_lo;
148 tarval *const tv_hi = cpair->tv_hi;
150 /* Beware of NaN's, we can only check for (ordered) != here (which is Lg, not Ne) */
151 if ((pnc_lo == pn_Cmp_Ge || pnc_lo == pn_Cmp_Gt || pnc_lo == pn_Cmp_Lg) &&
152 (pnc_hi == pn_Cmp_Lt || pnc_hi == pn_Cmp_Le || pnc_hi == pn_Cmp_Lg)) {
153 /* x >=|>|!= lo | x <|<=|!= hi -> true */
154 ir_node *const t = new_Const(mode_b, tarval_b_true);
156 } else if ((pnc_lo == pn_Cmp_Lt || pnc_lo == pn_Cmp_Le || pnc_lo == pn_Cmp_Eq) &&
157 (pnc_hi == pn_Cmp_Lt || pnc_hi == pn_Cmp_Le || pnc_hi == pn_Cmp_Lg)) {
158 /* x <|<=|== lo || x <|<=|!= hi -> x <|<=|!= hi */
160 } else if ((pnc_lo == pn_Cmp_Ge || pnc_lo == pn_Cmp_Gt || pnc_lo == pn_Cmp_Lg) &&
161 (pnc_hi == pn_Cmp_Eq || pnc_hi == pn_Cmp_Ge || pnc_hi == pn_Cmp_Gt)) {
162 /* x >=|>|!= lo || x ==|>=|> hi -> x >=|>|!= lo */
164 } else if (tarval_is_one(tarval_sub(tv_hi, tv_lo, NULL))) { /* lo + 1 == hi */
165 if (pnc_lo == pn_Cmp_Lt && pnc_hi == pn_Cmp_Ge) {
166 /* x < c || x >= c + 1 -> x != c */
167 ir_graph *const irg = current_ir_graph;
168 ir_node *const block = get_nodes_block(cmp_lo);
169 ir_node *const p = new_r_Proj(irg, block, cmp_lo, mode_b, pn_Cmp_Lg);
171 } else if (pnc_lo == pn_Cmp_Le) {
172 if (pnc_hi == pn_Cmp_Eq) {
173 /* x <= c || x == c + 1 -> x <= c + 1 */
174 ir_graph *const irg = current_ir_graph;
175 ir_node *const block = get_nodes_block(cmp_hi);
176 ir_node *const p = new_r_Proj(irg, block, cmp_hi, mode_b, pn_Cmp_Le);
178 } else if (pnc_hi == pn_Cmp_Ge) {
179 /* x <= c || x >= c + 1 -> true */
180 ir_node *const t = new_Const(mode_b, tarval_b_true);
182 } else if (pnc_hi == pn_Cmp_Gt) {
183 /* x <= c || x > c + 1 -> x != c + 1 */
184 ir_graph *const irg = current_ir_graph;
185 ir_node *const block = get_nodes_block(cmp_hi);
186 ir_node *const p = new_r_Proj(irg, block, cmp_hi, mode_b, pn_Cmp_Lg);
189 } else if (pnc_lo == pn_Cmp_Eq && pnc_hi == pn_Cmp_Ge) {
190 /* x == c || x >= c + 1 -> x >= c */
191 ir_graph *const irg = current_ir_graph;
192 ir_node *const block = get_nodes_block(cmp_lo);
193 ir_node *const p = new_r_Proj(irg, block, cmp_lo, mode_b, pn_Cmp_Ge);
200 static void bool_walk(ir_node *n, void *env)
204 if (get_irn_mode(n) != mode_b)
208 ir_node *const l = get_And_left(n);
209 ir_node *const r = get_And_right(n);
210 ir_node * replacement;
212 if (!find_cond_pair(l, r, &cpair))
214 replacement = bool_and(&cpair);
216 exchange(n, replacement);
217 } else if (is_Or(n)) {
218 ir_node *const l = get_Or_left(n);
219 ir_node *const r = get_Or_right(n);
220 ir_node * replacement;
222 if (!find_cond_pair(l, r, &cpair))
224 replacement = bool_or(&cpair);
226 exchange(n, replacement);
231 * Walker, clear Block mark and Phi list
233 static void clear_block_infos(ir_node *node, void *env)
237 /* we visit blocks before any other nodes (from the block) */
241 /* clear the PHI list */
242 set_Block_phis(node, NULL);
243 set_Block_mark(node, 0);
247 * Walker: collect Phi nodes and update the
249 static void collect_phis(ir_node *node, void *env)
254 ir_node *block = get_nodes_block(node);
255 add_Block_phi(block, node);
259 /* Ignore control flow nodes, these will be removed. */
260 if (get_irn_pinned(node) == op_pin_state_pinned &&
261 !is_Block(node) && !is_cfop(node)) {
262 ir_node *block = get_nodes_block(node);
263 set_Block_mark(block, 1);
268 * If node is a Jmp in a block containing no pinned instruction
269 * and having only one predecessor, skip the block and return its
270 * cf predecessor, else the node itself.
272 static ir_node *skip_empty_block(ir_node *node)
279 block = get_nodes_block(node);
280 if(get_Block_n_cfgpreds(block) != 1)
283 if(get_Block_mark(block))
286 return get_Block_cfgpred(block, 0);
289 static void find_cf_and_or_walker(ir_node *block, void *env)
292 int n_cfgpreds = get_Block_n_cfgpreds(block);
298 /* Find the following structure:
310 for(i = 0; i < n_cfgpreds; ++i) {
311 ir_node *lower_block;
314 ir_node *cond_selector;
317 lower_cf = get_Block_cfgpred(block, i);
318 lower_cf = skip_empty_block(lower_cf);
319 if(!is_Proj(lower_cf))
322 cond = get_Proj_pred(lower_cf);
326 lower_block = get_nodes_block(cond);
327 if(get_Block_n_cfgpreds(lower_block) != 1)
330 /* the block must not produce any side-effects */
331 if(get_Block_mark(lower_block))
334 cond_selector = get_Cond_selector(cond);
335 if(get_irn_mode(cond_selector) != mode_b)
338 lower_pred = get_Block_cfgpred_block(lower_block, 0);
340 for(i2 = 0; i2 < n_cfgpreds; ++i2) {
341 ir_node *upper_block;
344 ir_node *upper_cond_selector;
345 ir_node *replacement;
349 upper_cf = get_Block_cfgpred(block, i2);
350 upper_cf = skip_empty_block(upper_cf);
353 upper_block = get_nodes_block(upper_cf);
354 if(upper_block != lower_pred)
357 assert(is_Proj(upper_cf));
358 upper_cond = get_Proj_pred(upper_cf);
359 assert(is_Cond(upper_cond));
360 upper_cond_selector = get_Cond_selector(upper_cond);
361 if(get_irn_mode(upper_cond_selector) != mode_b)
364 /* we have found the structure */
365 /* TODO: check phis */
366 if(!find_cond_pair(cond_selector, upper_cond_selector, &cpair))
369 /* normalize pncs: we need the true case to jump into the
370 * common block (ie. conjunctive normal form) */
371 irg = current_ir_graph;
372 if(get_Proj_proj(lower_cf) == pn_Cond_false) {
373 if(cpair.proj_lo == cond_selector) {
374 ir_mode *mode = get_tarval_mode(cpair.tv_lo);
375 cpair.pnc_lo = get_negated_pnc(cpair.pnc_lo, mode);
376 cpair.proj_lo = new_r_Proj(irg, lower_block,
377 get_Proj_pred(cpair.proj_lo), mode_b, cpair.pnc_lo);
379 ir_mode *mode = get_tarval_mode(cpair.tv_hi);
380 assert(cpair.proj_hi == cond_selector);
381 cpair.pnc_hi = get_negated_pnc(cpair.pnc_hi, mode);
382 cpair.proj_hi = new_r_Proj(irg, lower_block,
383 get_Proj_pred(cpair.proj_hi), mode_b, cpair.pnc_hi);
386 if(get_Proj_proj(upper_cf) == pn_Cond_false) {
387 if(cpair.proj_lo == upper_cond_selector) {
388 ir_mode *mode = get_tarval_mode(cpair.tv_lo);
389 cpair.pnc_lo = get_negated_pnc(cpair.pnc_lo, mode);
390 cpair.proj_lo = new_r_Proj(irg, upper_block,
391 get_Proj_pred(cpair.proj_lo), mode_b, cpair.pnc_lo);
393 ir_mode *mode = get_tarval_mode(cpair.tv_hi);
394 assert(cpair.proj_hi == upper_cond_selector);
395 cpair.pnc_hi = get_negated_pnc(cpair.pnc_hi, mode);
396 cpair.proj_hi = new_r_Proj(irg, upper_block,
397 get_Proj_pred(cpair.proj_hi), mode_b, cpair.pnc_hi);
401 /* can we optimize the case? */
402 replacement = bool_or(&cpair);
403 if(replacement == NULL)
406 /* move all nodes from lower block to upper block */
407 exchange(lower_block, upper_block);
409 set_Block_cfgpred(block, i2, new_Bad());
411 /* the optimisations expected the true case to jump */
412 if(get_Proj_proj(lower_cf) == pn_Cond_false) {
413 ir_node *block = get_nodes_block(replacement);
414 replacement = new_rd_Not(NULL, current_ir_graph, block,
415 replacement, mode_b);
417 set_Cond_selector(cond, replacement);
419 ir_fprintf(stderr, "replaced (ub %+F)\n", upper_block);
425 void opt_bool(ir_graph *const irg)
427 irg_walk_graph(irg, NULL, bool_walk, NULL);
429 ir_reserve_resources(irg, IR_RESOURCE_BLOCK_MARK);
431 irg_walk_graph(irg, clear_block_infos, collect_phis, NULL);
433 irg_block_walk_graph(irg, NULL, find_cf_and_or_walker, NULL);
435 set_irg_outs_inconsistent(irg);
436 set_irg_doms_inconsistent(irg);
437 set_irg_extblk_inconsistent(irg);
438 set_irg_loopinfo_inconsistent(irg);
440 ir_free_resources(irg, IR_RESOURCE_BLOCK_MARK);