2 * Copyright (C) 1995-2010 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 analyze graph to provide value range information
31 #include "irgraph_t.h"
39 #include "irphase_t.h"
43 static void *VISITED = &v;
47 DEBUG_ONLY(firm_dbg_module_t *dbg);
50 static vrp_attr *get_vrp_attr(const ir_node *node)
52 return (vrp_attr*) get_or_set_irn_phase_info(node, PHASE_VRP);
55 static int vrp_update_node(ir_node *node)
57 tarval *new_bits_set = get_tarval_bad();
58 tarval *new_bits_not_set = get_tarval_bad();
59 tarval *new_range_bottom = get_tarval_bad();
60 tarval *new_range_top = get_tarval_bad();
61 enum range_types new_range_type = VRP_UNDEFINED;
62 int something_changed = 0;
65 if (!mode_is_int(get_irn_mode(node))) {
66 return 0; /* we don't optimize for non-int-nodes*/
69 vrp = get_vrp_attr(node);
71 /* TODO: Check if all predecessors have valid VRP information*/
73 switch (get_irn_opcode(node)) {
75 tarval *tv = get_Const_tarval(node);
77 new_bits_not_set = tv;
78 new_range_bottom = tv;
80 new_range_type = VRP_RANGE;
84 const vrp_attr *vrp_left, *vrp_right;
85 const ir_node *left, *right;
87 left = get_And_left(node);
88 right = get_And_right(node);
89 vrp_left = get_vrp_attr(left);
90 vrp_right = get_vrp_attr(right);
91 new_bits_set = tarval_and(vrp_left->bits_set, vrp_right->bits_set);
92 new_bits_not_set = tarval_and(vrp_left->bits_not_set, vrp_right->bits_not_set);
98 int overflow_top, overflow_bottom;
99 tarval *new_top, *new_bottom;
100 const vrp_attr *vrp_left, *vrp_right;
101 vrp_left = get_vrp_attr(get_Add_left(node));
102 vrp_right = get_vrp_attr(get_Add_right(node));
104 if (vrp_left->range_type == VRP_UNDEFINED || vrp_right->range_type ==
105 VRP_UNDEFINED || vrp_left->range_type == VRP_VARYING ||
106 vrp_right->range_type == VRP_VARYING) {
110 new_top = tarval_add(vrp_left->range_top, vrp_right->range_top);
111 overflow_top = tarval_carry();
112 new_bottom = tarval_add(vrp_left->range_bottom, vrp_right->range_bottom);
113 overflow_bottom = tarval_carry();
115 if (!overflow_top && !overflow_bottom && vrp_left->range_type == VRP_RANGE
116 &&vrp_right->range_type == VRP_RANGE) {
117 new_range_bottom = new_bottom;
118 new_range_top = new_top;
119 new_range_type = VRP_RANGE;
122 if (overflow_top || overflow_bottom) {
123 /* TODO Implement overflow handling*/
124 new_range_type = VRP_UNDEFINED;
130 int overflow_top, overflow_bottom;
131 tarval *new_top, *new_bottom;
132 const vrp_attr *vrp_left, *vrp_right;
133 vrp_left = get_vrp_attr(get_Sub_left(node));
134 vrp_right = get_vrp_attr(get_Sub_right(node));
136 if (vrp_left->range_type == VRP_UNDEFINED || vrp_right->range_type ==
137 VRP_UNDEFINED || vrp_left->range_type == VRP_VARYING ||
138 vrp_right->range_type == VRP_VARYING) {
142 new_top = tarval_sub(vrp_left->range_top, vrp_right->range_top, NULL);
143 overflow_top = tarval_carry();
144 new_bottom = tarval_sub(vrp_left->range_bottom, vrp_right->range_bottom, NULL);
145 overflow_bottom = tarval_carry();
147 if (!overflow_top && !overflow_bottom && vrp_left->range_type == VRP_RANGE
148 &&vrp_right->range_type == VRP_RANGE) {
149 new_range_bottom = new_bottom;
150 new_range_top = new_top;
151 new_range_type = VRP_RANGE;
154 if (overflow_top || overflow_bottom) {
155 /* TODO Implement overflow handling*/
161 const vrp_attr *vrp_left, *vrp_right;
163 vrp_left = get_vrp_attr(get_Or_left(node));
164 vrp_right = get_vrp_attr(get_Or_right(node));
166 new_bits_set = tarval_or(vrp_left->bits_set, vrp_right->bits_set);
167 new_bits_not_set = tarval_or(vrp_left->bits_not_set, vrp_right->bits_not_set);
173 const vrp_attr *vrp_left, *vrp_right;
174 const ir_node *right = get_Rotl_right(node);
176 vrp_left = get_vrp_attr(get_Rotl_left(node));
177 vrp_right = get_vrp_attr(get_Rotl_right(node));
179 /* We can only compute this if the right value is a constant*/
180 if (is_Const(right)) {
181 tarval *bits_set, *bits_not_set;
182 bits_set = tarval_rotl(vrp_left->bits_set, get_Const_tarval(right));
183 bits_not_set = tarval_rotl(vrp_left->bits_not_set, get_Const_tarval(right));
189 const vrp_attr *vrp_left, *vrp_right;
190 const ir_node *right = get_Shl_right(node);
191 vrp_left = get_vrp_attr(get_Shl_left(node));
192 vrp_right = get_vrp_attr(get_Shl_right(node));
194 /* We can only compute this if the right value is a constant*/
195 if (is_Const(right)) {
196 new_bits_set = tarval_shl(vrp_left->bits_set, get_Const_tarval(right));
197 new_bits_not_set = tarval_shl(vrp_left->bits_not_set, get_Const_tarval(right));
203 const vrp_attr *vrp_left, *vrp_right;
204 const ir_node *right = get_Shr_right(node);
206 vrp_left = get_vrp_attr(get_Shr_left(node));
207 vrp_right = get_vrp_attr(get_Shr_right(node));
209 /* We can only compute this if the right value is a constant*/
210 if (is_Const(right)) {
211 new_bits_set = tarval_shr(vrp_left->bits_set, get_Const_tarval(right));
212 new_bits_not_set = tarval_shr(vrp_left->bits_not_set, get_Const_tarval(right));
218 const vrp_attr *vrp_left, *vrp_right;
219 const ir_node *right = get_Shrs_right(node);
221 vrp_left = get_vrp_attr(get_Shrs_left(node));
222 vrp_right = get_vrp_attr(get_Shrs_right(node));
224 /* We can only compute this if the right value is a constant*/
225 if (is_Const(right)) {
226 new_bits_set = tarval_shrs(vrp_left->bits_set, get_Const_tarval(right));
227 new_bits_not_set = tarval_shrs(vrp_left->bits_not_set, get_Const_tarval(right));
233 const vrp_attr *vrp_left, *vrp_right;
235 vrp_left = get_vrp_attr(get_Eor_left(node));
236 vrp_right = get_vrp_attr(get_Eor_right(node));
238 new_bits_set = tarval_or(
239 tarval_and(vrp_left->bits_set, tarval_not(vrp_right->bits_not_set)),
240 tarval_and(tarval_not(vrp_left->bits_not_set), vrp_right->bits_set));
242 new_bits_not_set = tarval_not(tarval_or(
243 tarval_and(vrp_left->bits_set,vrp_right->bits_set),
244 tarval_and(tarval_not(vrp_left->bits_not_set),
245 tarval_not(vrp_right->bits_not_set))));
251 const vrp_attr *vrp_pred = get_vrp_attr(get_Id_pred(node));
252 new_bits_set = vrp_pred->bits_set;
253 new_bits_not_set = vrp_pred->bits_not_set;
254 new_range_top = vrp_pred->range_top;
255 new_range_bottom = vrp_pred->range_bottom;
256 new_range_type = vrp_pred->range_type;
261 const vrp_attr *vrp_pred = get_vrp_attr(get_Not_op(node));
262 new_bits_set = tarval_not(vrp_pred->bits_not_set);
263 new_bits_not_set = tarval_not(vrp_pred->bits_set);
268 const ir_node *pred = get_Conv_op(node);
269 ir_mode *old_mode = get_irn_mode(pred);
270 const vrp_attr *vrp_pred = get_vrp_attr(pred);
274 if (!mode_is_int(old_mode))
277 new_mode = get_irn_mode(node);
279 /* The second and is needed if target type is smaller*/
280 new_bits_not_set = tarval_convert_to(get_mode_all_one(old_mode), new_mode);
281 new_bits_not_set = tarval_and(new_bits_not_set, tarval_convert_to(vrp_pred->bits_not_set, new_mode));
282 new_bits_set = tarval_and(
283 new_bits_not_set, tarval_convert_to(vrp_pred->bits_set, new_mode));
285 if (tarval_cmp(vrp_pred->range_top, get_mode_max(new_mode)) == pn_Cmp_Le) {
286 vrp->range_top = vrp_pred->range_top;
289 if (tarval_cmp(vrp_pred->range_bottom, get_mode_min(new_mode)) == pn_Cmp_Ge) {
290 vrp->range_bottom = vrp_pred->range_bottom;
296 const pn_Cmp cmp = get_Confirm_cmp(node);
297 const ir_node *bound = get_Confirm_bound(node);
300 if (cmp == pn_Cmp_Lg) {
301 /** @todo: Handle non-Const bounds */
302 if (is_Const(bound)) {
303 new_range_type = VRP_ANTIRANGE;
304 new_range_top = get_Const_tarval(bound);
305 new_range_bottom = get_Const_tarval(bound);
307 } else if (cmp == pn_Cmp_Le) {
308 if (is_Const(bound)) {
309 new_range_type = VRP_RANGE;
310 new_range_top = get_Const_tarval(bound);
311 new_range_bottom = get_tarval_min(get_irn_mode(node));
318 /* combine all ranges*/
320 int num = get_Phi_n_preds(node);
324 const ir_node *pred = get_Phi_pred(node,0);
325 const vrp_attr *vrp_pred = get_vrp_attr(pred);
326 new_range_top = vrp_pred->range_top;
327 new_range_bottom = vrp_pred->range_bottom;
328 new_range_type = vrp_pred->range_type;
329 new_bits_set = vrp_pred->bits_set;
330 new_bits_not_set = vrp_pred->bits_not_set;
334 for (i = 1; i < num; i++) {
335 pred = get_Phi_pred(node, i);
336 vrp_pred = get_vrp_attr(pred);
337 if (new_range_type == VRP_RANGE && vrp_pred->range_type ==
339 cmp = tarval_cmp(new_range_top, vrp_pred->range_top);
340 if (cmp == pn_Cmp_Lt) {
341 new_range_top = vrp_pred->range_top;
343 cmp = tarval_cmp(new_range_bottom, vrp_pred->range_bottom);
344 if (cmp == pn_Cmp_Gt) {
345 new_range_bottom = vrp_pred->range_bottom;
348 new_range_type = VRP_VARYING;
350 new_bits_set = tarval_and(new_bits_set, vrp_pred->bits_set);
351 new_bits_not_set = tarval_or(new_bits_not_set,
352 vrp_pred->bits_not_set);
358 /* unhandled, therefore never updated */
364 /* TODO: Check, if there can be information derived from any of these:
365 is_Abs(node) is_Alloc(node) is_Anchor(node) is_Borrow(node) is_Bound(node)
366 is_Break(node) is_Builtin(node) is_Call(node) is_CallBegin(node)
367 is_Carry(node) is_Cast(node) is_Cmp(node) is_Cond(node)
368 is_CopyB(node) is_Div(node) is_DivMod(node) is_Dummy(node)
369 is_End(node) is_EndExcept(node) is_EndReg(node) is_Filter(node) is_Free(node)
370 is_IJmp(node) is_InstOf(node) is_Jmp(node) is_Load(node) is_Minus(node)
371 is_Mod(node) is_Mul(node) is_Mulh(node) is_Mux(node) is_NoMem(node)
372 is_Pin(node) is_Proj(node) is_Quot(node)
373 is_Raise(node) is_Return(node) is_Sel(node) is_Start(node) is_Store(node)
374 is_SymConst(node) is_Sync(node) is_Tuple(node)
377 /* @todo: At this place, we check if the mode of the variable changed. A
378 * better place for this might be in the convopt.c file
381 if (new_bits_set != tarval_bad && get_tarval_mode(new_bits_set) != get_tarval_mode(vrp->bits_set)) {
382 vrp->bits_set = tarval_convert_to(vrp->bits_set, get_irn_mode(node));
384 if (new_bits_not_set != tarval_bad && get_tarval_mode(new_bits_not_set) != get_tarval_mode(vrp->bits_not_set)) {
385 vrp->bits_not_set = tarval_convert_to(vrp->bits_not_set, get_irn_mode(node));
388 if (vrp->range_type != VRP_UNDEFINED && new_range_type != VRP_UNDEFINED && get_tarval_mode(new_range_top) != get_tarval_mode(vrp->range_top)) {
389 /* @todo: We might be able to preserve this range information if it
391 vrp->range_type = VRP_VARYING;
394 /* Merge the newly calculated values with those that might already exist*/
395 if (new_bits_set != tarval_bad) {
396 new_bits_set = tarval_or(new_bits_set, vrp->bits_set);
397 if (tarval_cmp(new_bits_set, vrp->bits_set) != pn_Cmp_Eq) {
398 something_changed = 1;
399 vrp->bits_set = new_bits_set;
402 if (new_bits_not_set != tarval_bad) {
403 new_bits_not_set = tarval_and(new_bits_not_set, vrp->bits_not_set);
405 if (tarval_cmp(new_bits_not_set, vrp->bits_not_set) != pn_Cmp_Eq) {
406 something_changed = 1;
407 vrp->bits_not_set = new_bits_not_set;
411 if (vrp->range_type == VRP_UNDEFINED &&
412 new_range_type != VRP_UNDEFINED) {
413 something_changed = 1;
414 vrp->range_type = new_range_type;
415 vrp->range_bottom = new_range_bottom;
416 vrp->range_top = new_range_top;
418 } else if (vrp->range_type == VRP_RANGE) {
419 if (new_range_type == VRP_RANGE) {
420 if (tarval_cmp(vrp->range_bottom, new_range_bottom) == pn_Cmp_Lt) {
421 something_changed = 1;
422 vrp->range_bottom = new_range_bottom;
424 if (tarval_cmp(vrp->range_top, new_range_top) == pn_Cmp_Gt) {
425 something_changed = 1;
426 vrp->range_top = new_range_top;
430 if (new_range_type == VRP_ANTIRANGE) {
431 /* if they are overlapping, cut the range.*/
432 /* TODO: Maybe we can preserve more information here*/
433 if (tarval_cmp(vrp->range_bottom, new_range_top) == pn_Cmp_Gt &&
434 tarval_cmp(vrp->range_bottom, new_range_bottom) == pn_Cmp_Gt) {
435 something_changed = 1;
436 vrp->range_bottom = new_range_top;
438 } else if (tarval_cmp(vrp->range_top, new_range_bottom) == pn_Cmp_Gt &&
439 tarval_cmp(vrp->range_top, new_range_top) == pn_Cmp_Lt) {
440 something_changed = 1;
441 vrp->range_top = new_range_bottom;
444 /* We can not handle the case where the anti range is in the*/
448 } else if (vrp->range_type == VRP_ANTIRANGE) {
449 if (new_range_type == VRP_ANTIRANGE) {
450 if (tarval_cmp(vrp->range_bottom, new_range_bottom) == pn_Cmp_Gt) {
451 something_changed = 1;
452 vrp->range_bottom = new_range_bottom;
454 if (tarval_cmp(vrp->range_top, new_range_top) == pn_Cmp_Lt) {
455 something_changed = 1;
456 vrp->range_top = new_range_top;
460 if (new_range_type == VRP_RANGE) {
461 if (tarval_cmp(vrp->range_bottom, new_range_top) == pn_Cmp_Gt) {
462 something_changed = 1;
463 vrp->range_bottom = new_range_top;
465 if (tarval_cmp(vrp->range_top, new_range_bottom) == pn_Cmp_Lt) {
466 something_changed = 1;
467 vrp->range_top = new_range_bottom;
472 assert(tarval_is_null(
473 tarval_and(vrp->bits_set, tarval_not(vrp->bits_not_set))));
474 return something_changed;
477 static void vrp_first_pass(ir_node *n, void *e)
481 struct vrp_env_t *env = e;
486 set_irn_link(n, VISITED);
490 assure_irg_outs(get_current_ir_graph());
491 for (i = get_irn_n_outs(n) - 1; i >=0; --i) {
492 succ = get_irn_out(n, i);
493 if (get_irn_link(succ) == VISITED) {
495 waitq_put(env->workqueue, succ);
500 static void *vrp_init_node(ir_phase *phase, const ir_node *n, void *old)
504 struct vrp_env_t *env = phase->priv;
506 DBG((env->dbg, LEVEL_2, "initialized node nr: %d\n", get_irn_node_nr(n)));
507 assert(old==NULL && "init called for node already initialized");
508 vrp = phase_alloc(phase, sizeof(vrp_attr));
510 memset(vrp, 0, sizeof(vrp_attr));
511 /* Initialize the vrp information to default */
513 mode = get_irn_mode(n);
515 vrp->range_type = VRP_UNDEFINED;
517 /* TODO: We might be able to optimize space usage if we do not allocate
518 * vrp space for non-int nodes. (currently caught by vrp_update_node)
520 if (mode_is_int(mode)) {
521 /* We are assuming that 0 is always represented as this modes null */
523 vrp->bits_set = get_mode_null(mode);
524 vrp->bits_not_set = get_mode_all_one(mode);
525 vrp->range_bottom = get_tarval_top();
526 vrp->range_top = get_tarval_top();
529 vrp->bits_set = get_tarval_bad();
530 vrp->bits_not_set = get_tarval_bad();
531 vrp->range_bottom = get_tarval_bad();
532 vrp->range_top = get_tarval_bad();
535 /* TODO: We might be able to set better vrp info at this time, if this is
536 * a node which is newly created in an already initialized irg
538 * maybe just call vrp_update_node and if it returns one, iterate over
544 void set_vrp_data(ir_graph *irg)
546 ir_node *succ, *node;
548 struct vrp_env_t *env;
551 assure_irg_outs(irg); /* ensure that out edges are consistent*/
552 phase = irg_get_phase(irg, PHASE_VRP);
554 /* this is our first run */
555 phase = new_phase(irg, vrp_init_node);
556 irg_register_phase(irg, PHASE_VRP, phase);
557 env = phase_alloc(phase, sizeof(*env));
558 FIRM_DBG_REGISTER(env->dbg, "ir.ana.vrp");
564 env->workqueue = new_waitq();
566 irg_walk_graph(irg, NULL, vrp_first_pass, env);
568 /* while there are entries in the worklist, continue*/
569 while (!waitq_empty(env->workqueue)) {
570 node = waitq_get(env->workqueue);
572 if (vrp_update_node(node)) {
573 /* if something changed, add successors to worklist*/
574 for (i = get_irn_n_outs(node) - 1; i >=0; --i) {
575 succ = get_irn_out(node, i);
576 waitq_put(env->workqueue, node);
580 del_waitq(env->workqueue);
584 ir_graph_pass_t *set_vrp_pass(const char *name)
586 return def_graph_pass(name ? name : "set_vrp", set_vrp_data);
589 pn_Cmp vrp_cmp(const ir_node *left, const ir_node *right)
591 vrp_attr *vrp_left, *vrp_right;
593 vrp_left = vrp_get_info(left);
594 vrp_right = vrp_get_info(right);
596 if (!vrp_left || !vrp_right) {
600 if (vrp_left->range_type == VRP_RANGE && vrp_right->range_type == VRP_RANGE) {
601 if (tarval_cmp(vrp_left->range_top, vrp_right->range_bottom) == pn_Cmp_Lt) {
604 if (tarval_cmp(vrp_left->range_bottom, vrp_right->range_top) == pn_Cmp_Gt) {
609 if (!tarval_is_null(tarval_and(vrp_left->bits_set, tarval_not(vrp_right->bits_not_set))) ||
610 !tarval_is_null(tarval_and(tarval_not(vrp_left->bits_not_set), vrp_right->bits_set))) {
613 /* TODO: We can get way more information here*/
618 vrp_attr *vrp_get_info(const ir_node *node)
620 const ir_graph *irg = get_irn_irg(node);
621 const ir_phase *phase = irg_get_phase(irg, PHASE_VRP);
625 /* phase has not yet been initialized */
629 vrp = phase_get_irn_data(phase, node);
630 if (vrp && vrp->valid) {