nsz Git - libfirm/blob - ir/ana/vrp.c

   1 /*
   2  * Copyright (C) 1995-2010 University of Karlsruhe.  All right reserved.
   3  *
   4  * This file is part of libFirm.
   5  *
   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.
  10  *
  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.
  14  *
  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
  17  * PURPOSE.
  18  */
  19
  20 /**
  21  * @file
  22  * @brief       analyze graph to provide value range information
  23  * @author      Jonas Fietz
  24  * @version     $Id$
  25  */
  26 #include "config.h"
  27
  28 #include "irtypes.h"
  29 #include "vrp.h"
  30 #include "irouts.h"
  31 #include "irgraph_t.h"
  32 #include "irgopt.h"
  33 #include "irpass.h"
  34 #include "irgwalk.h"
  35 #include "iredges.h"
  36 #include "tv.h"
  37 #include "irop.h"
  38 #include "pdeq.h"
  39 #include "irphase_t.h"
  40 #include "irprintf.h"
  41
  42 static char v;
  43 static void *VISITED = &v;
  44
  45 struct vrp_env_t {
  46         waitq *workqueue;
  47 };
  48
  49 static vrp_attr *get_vrp_attr(const ir_node *node)
  50 {
  51         return (vrp_attr*) get_or_set_irn_phase_info(node, PHASE_VRP);
  52 }
  53
  54 static int vrp_update_node(ir_node *node)
  55 {
  56         tarval *new_bits_set = get_tarval_bad();
  57         tarval *new_bits_not_set = get_tarval_bad();
  58         tarval *new_range_bottom = get_tarval_bad();
  59         tarval *new_range_top = get_tarval_bad();
  60         enum range_types new_range_type = VRP_UNDEFINED;
  61         int something_changed = 0;
  62         vrp_attr *vrp;
  63
  64         if (!mode_is_int(get_irn_mode(node))) {
  65                 return 0; /* we don't optimize for non-int-nodes*/
  66         }
  67
  68         ir_printf("update_vrp for %d called\n", get_irn_node_nr(node));
  69         vrp = get_vrp_attr(node);
  70
  71         /* TODO: Check if all predecessors have valid VRP information*/
  72
  73         switch (get_irn_opcode(node)) {
  74         case iro_Const: {
  75                 tarval *tv = get_Const_tarval(node);
  76                 new_bits_set = tv;
  77                 new_bits_not_set = tarval_not(tv);
  78                 new_range_bottom = tv;
  79                 new_range_top = tv;
  80                 new_range_type = VRP_RANGE;
  81                 break;
  82         }
  83
  84         case iro_And: {
  85                 vrp_attr *vrp_left, *vrp_right;
  86                 ir_node *left, *right;
  87
  88                 left = get_And_left(node);
  89                 right = get_And_right(node);
  90                 vrp_left = get_vrp_attr(left);
  91                 vrp_right = get_vrp_attr(right);
  92                 new_bits_set = tarval_and(vrp_left->bits_set, vrp_right->bits_set);
  93                 new_bits_not_set = tarval_or(vrp_left->bits_not_set, vrp_right->bits_not_set);
  94
  95                 break;
  96         }
  97
  98         case iro_Add: {
  99                 int overflow_top, overflow_bottom;
 100                 tarval *new_top, *new_bottom;
 101                 vrp_attr *vrp_left, *vrp_right;
 102                 vrp_left = get_vrp_attr(get_Add_left(node));
 103                 vrp_right = get_vrp_attr(get_Add_right(node));
 104
 105                 if (vrp_left->range_type == VRP_UNDEFINED || vrp_right->range_type ==
 106                                 VRP_UNDEFINED || vrp_left->range_type == VRP_VARYING ||
 107                                 vrp_right->range_type == VRP_VARYING) {
 108                         return 0;
 109                 }
 110
 111                 new_top = tarval_add(vrp_left->range_top, vrp_right->range_top);
 112                 overflow_top = tarval_carry();
 113                 new_bottom = tarval_add(vrp_left->range_bottom, vrp_right->range_bottom);
 114                 overflow_bottom = tarval_carry();
 115
 116                 if (!overflow_top && !overflow_bottom && vrp_left->range_type == VRP_RANGE
 117                                 &&vrp_right->range_type == VRP_RANGE) {
 118                         new_range_bottom = new_bottom;
 119                         new_range_top = new_top;
 120                         new_range_type = VRP_RANGE;
 121                 }
 122
 123                 if (overflow_top || overflow_bottom) {
 124                         /* TODO Implement overflow handling*/
 125                         new_range_type = VRP_UNDEFINED;
 126                 }
 127                 break;
 128         }
 129
 130         case iro_Sub: {
 131                 int overflow_top, overflow_bottom;
 132                 tarval *new_top, *new_bottom;
 133                 vrp_attr *vrp_left, *vrp_right;
 134                 vrp_left = get_vrp_attr(get_Sub_left(node));
 135                 vrp_right = get_vrp_attr(get_Sub_right(node));
 136
 137                 if (vrp_left->range_type == VRP_UNDEFINED || vrp_right->range_type ==
 138                                 VRP_UNDEFINED) {
 139                         return 0;
 140                 }
 141
 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();
 146
 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;
 152                 }
 153
 154                 if (overflow_top || overflow_bottom) {
 155                         /* TODO Implement overflow handling*/
 156                 }
 157                 break;
 158         }
 159
 160         case iro_Or: {
 161                 vrp_attr *vrp_left, *vrp_right;
 162
 163                 vrp_left = get_vrp_attr(get_Or_left(node));
 164                 vrp_right = get_vrp_attr(get_Or_right(node));
 165
 166                 new_bits_set = tarval_or(vrp_left->bits_set, vrp_right->bits_set);
 167                 new_bits_not_set = tarval_and(vrp_left->bits_not_set, vrp_right->bits_not_set);
 168
 169                 break;
 170         }
 171
 172         case iro_Rotl: {
 173                 vrp_attr *vrp_left, *vrp_right;
 174                 ir_node *right = get_Rotl_right(node);
 175
 176                 vrp_left = get_vrp_attr(get_Rotl_left(node));
 177                 vrp_right = get_vrp_attr(get_Rotl_right(node));
 178
 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));
 184
 185                         new_bits_set = tarval_or(bits_set, vrp->bits_set);
 186                         new_bits_not_set = tarval_or(bits_not_set, vrp->bits_not_set);
 187                 }
 188                 break;
 189         }
 190
 191         case iro_Shl: {
 192                 vrp_attr *vrp_left, *vrp_right;
 193                 ir_node *right = get_Shl_right(node);
 194                 vrp_left = get_vrp_attr(get_Shl_left(node));
 195                 vrp_right = get_vrp_attr(get_Shl_right(node));
 196
 197                 /* We can only compute this if the right value is a constant*/
 198                 if (is_Const(right)) {
 199                         tarval *bits_set, *bits_not_set;
 200                         ir_mode *m = get_tarval_mode(vrp->bits_not_set);
 201                         bits_set = tarval_shl(vrp_left->bits_set, get_Const_tarval(right));
 202                         bits_not_set = tarval_shl(vrp_left->bits_not_set, get_Const_tarval(right));
 203
 204                         new_bits_set = tarval_or(bits_set, vrp->bits_set);
 205                         new_bits_not_set = tarval_or(bits_not_set, vrp->bits_not_set);
 206
 207                         bits_not_set = tarval_not( tarval_shl(
 208                                                                                 get_mode_all_one(m),
 209                                                                                 get_Const_tarval(right)));
 210                         new_bits_not_set = tarval_or(bits_not_set, new_bits_not_set);
 211
 212                 }
 213                 break;
 214         }
 215
 216         case iro_Shr: {
 217                 vrp_attr *vrp_left, *vrp_right;
 218                 ir_node *right = get_Shr_right(node);
 219
 220                 vrp_left = get_vrp_attr(get_Shr_left(node));
 221                 vrp_right = get_vrp_attr(get_Shr_right(node));
 222
 223                 /* We can only compute this if the right value is a constant*/
 224                 if (is_Const(right)) {
 225                         tarval *bits_set, *bits_not_set;
 226                         ir_mode *m = get_tarval_mode(vrp->bits_not_set);
 227                         bits_set = tarval_shr(vrp_left->bits_set, get_Const_tarval(right));
 228                         bits_not_set = tarval_shr(vrp_left->bits_not_set, get_Const_tarval(right));
 229
 230                         new_bits_set = tarval_or(bits_set, vrp->bits_set);
 231                         new_bits_not_set = tarval_or(bits_not_set, vrp->bits_not_set);
 232
 233                         bits_not_set = tarval_not( tarval_shr(
 234                                                                                 get_mode_all_one(m),
 235                                                                                 get_Const_tarval(right)));
 236                         new_bits_not_set = tarval_or(bits_not_set, new_bits_not_set);
 237                 }
 238                 break;
 239         }
 240
 241         case iro_Shrs: {
 242                 vrp_attr *vrp_left, *vrp_right;
 243                 ir_node *right = get_Shrs_right(node);
 244
 245                 vrp_left = get_vrp_attr(get_Shrs_left(node));
 246                 vrp_right = get_vrp_attr(get_Shrs_right(node));
 247
 248                 /* We can only compute this if the right value is a constant*/
 249                 if (is_Const(right)) {
 250                         tarval *bits_set, *bits_not_set;
 251                         ir_mode *m = get_tarval_mode(vrp->bits_not_set);
 252                         bits_set = tarval_shrs(vrp_left->bits_set, get_Const_tarval(right));
 253                         bits_not_set = tarval_shrs(vrp_left->bits_not_set, get_Const_tarval(right));
 254
 255                         new_bits_set = tarval_or(bits_set, vrp->bits_set);
 256                         new_bits_not_set = tarval_or(bits_not_set, vrp->bits_not_set);
 257
 258                         bits_not_set = tarval_not( tarval_shrs(
 259                                                                                 get_mode_all_one(m),
 260                                                                                 get_Const_tarval(right)));
 261                         new_bits_not_set = tarval_or(bits_not_set, new_bits_not_set);
 262                 }
 263                 break;
 264         }
 265
 266         case iro_Eor: {
 267                 tarval *bits_set, *bits_not_set;
 268                 vrp_attr *vrp_left, *vrp_right;
 269
 270                 vrp_left = get_vrp_attr(get_Eor_left(node));
 271                 vrp_right = get_vrp_attr(get_Eor_right(node));
 272
 273                 bits_not_set = tarval_or(
 274                                                         tarval_and(vrp_left->bits_set, vrp_right->bits_set),
 275                                                         tarval_and(vrp_left->bits_not_set,
 276                                                                 vrp_right->bits_not_set));
 277
 278                 bits_set = tarval_or(
 279                                                 tarval_and(vrp_left->bits_set, vrp_right->bits_not_set),
 280                                                 tarval_and(vrp_left->bits_not_set, vrp_right->bits_set));
 281
 282                 break;
 283         }
 284
 285         case iro_Id: {
 286                 vrp_attr *vrp_pred = get_vrp_attr(get_Id_pred(node));
 287                 new_bits_set = vrp_pred->bits_set;
 288                 new_bits_not_set = vrp_pred->bits_not_set;
 289                 new_range_top = vrp_pred->range_top;
 290                 new_range_bottom = vrp_pred->range_bottom;
 291                 new_range_type = vrp_pred->range_type;
 292                 break;
 293         }
 294
 295         case iro_Not: {
 296                 vrp_attr *vrp_pred = get_vrp_attr(get_Not_op(node));
 297                 new_bits_set = tarval_or(vrp_pred->bits_not_set, vrp->bits_set);
 298                 new_bits_not_set = tarval_or(vrp_pred->bits_set, vrp->bits_not_set);
 299                 break;
 300         }
 301
 302         case iro_Conv: {
 303                 ir_node *pred = get_Conv_op(node);
 304                 ir_mode *old_mode = get_irn_mode(pred);
 305                 vrp_attr *vrp_pred = get_vrp_attr(pred);
 306
 307                 ir_mode *new_mode;
 308                 tarval *bits_not_set;
 309
 310                 if (!mode_is_int(old_mode))
 311                         return 0;
 312
 313                 new_mode = get_irn_mode(node);
 314
 315                 /* The second and is needed if target type is smaller*/
 316                 bits_not_set = tarval_not(
 317                                                         tarval_convert_to(get_mode_all_one(old_mode),
 318                                                                 new_mode
 319                                                                 ));
 320                 bits_not_set = tarval_or(bits_not_set, tarval_convert_to(vrp_pred->bits_not_set, new_mode));
 321                 new_bits_not_set = tarval_or(bits_not_set, vrp->bits_not_set);
 322                 new_bits_set = tarval_and(
 323                                 tarval_not(bits_not_set), tarval_convert_to(vrp_pred->bits_set, new_mode));
 324
 325                 if (tarval_cmp(vrp_pred->range_top, get_mode_max(new_mode)) == pn_Cmp_Le) {
 326                         vrp->range_top = vrp_pred->range_top;
 327                 }
 328
 329                 if (tarval_cmp(vrp_pred->range_bottom, get_mode_min(new_mode)) == pn_Cmp_Ge) {
 330                         vrp->range_bottom = vrp_pred->range_bottom;
 331                 }
 332                 break;
 333         }
 334
 335         case iro_Confirm: {
 336                 pn_Cmp cmp = get_Confirm_cmp(node);
 337                 ir_node *bound = get_Confirm_bound(node);
 338
 339
 340                 if (cmp == pn_Cmp_Lg) {
 341                         /** @todo: Handle non-Const bounds */
 342                         if (is_Const(bound)) {
 343                                 new_range_type = VRP_ANTIRANGE;
 344                                 new_range_top = get_Const_tarval(bound);
 345                                 new_range_bottom = get_Const_tarval(bound);
 346                         }
 347                 } else if (cmp == pn_Cmp_Le) {
 348                         if (is_Const(bound)) {
 349                                 new_range_type = VRP_RANGE;
 350                                 new_range_top = get_Const_tarval(bound);
 351                                 new_range_bottom = get_tarval_min(get_irn_mode(node));
 352                         }
 353                 }
 354                 break;
 355         }
 356
 357         case iro_Phi: {
 358                 /* combine all ranges*/
 359
 360                 int num = get_Phi_n_preds(node);
 361                 pn_Cmp cmp;
 362                 int i;
 363
 364                 ir_node *pred = get_Phi_pred(node,0);
 365                 vrp_attr *vrp_pred = get_vrp_attr(pred);
 366                 new_range_top = vrp_pred->range_top;
 367                 new_range_bottom = vrp_pred->range_bottom;
 368                 new_range_type = vrp_pred->range_type;
 369                 new_bits_set = vrp_pred->bits_set;
 370                 new_bits_not_set = vrp_pred->bits_not_set;
 371
 372                 assert(num > 0);
 373
 374
 375                 for (i = 1; i < num; i++) {
 376                         pred = get_Phi_pred(node, i);
 377                         vrp_pred = get_vrp_attr(pred);
 378                         if (new_range_type == VRP_RANGE && vrp_pred->range_type ==
 379                                         VRP_RANGE) {
 380                                 cmp = tarval_cmp(new_range_top, vrp_pred->range_top);
 381                                 if (cmp == pn_Cmp_Lt) {
 382                                         new_range_top = vrp_pred->range_top;
 383                                 }
 384                                 cmp = tarval_cmp(new_range_bottom, vrp_pred->range_bottom);
 385                                 if (cmp == pn_Cmp_Gt) {
 386                                         new_range_bottom = vrp_pred->range_bottom;
 387                                 }
 388                         } else {
 389                                 new_range_type = VRP_VARYING;
 390                                 break;
 391                         }
 392                 }
 393
 394                 break;
 395         }
 396         default:
 397                 /* unhandled, therefore never updated */
 398                 break;
 399         }
 400
 401
 402
 403         /* TODO: Check, if there can be information derived from any of these:
 404         is_Abs(node) is_Alloc(node) is_Anchor(node) is_Borrow(node) is_Bound(node)
 405         is_Break(node) is_Builtin(node) is_Call(node) is_CallBegin(node)
 406         is_Carry(node) is_Cast(node) is_Cmp(node) is_Cond(node)
 407         is_CopyB(node) is_Div(node) is_DivMod(node) is_Dummy(node)
 408         is_End(node) is_EndExcept(node) is_EndReg(node) is_Filter(node) is_Free(node)
 409         is_IJmp(node) is_InstOf(node) is_Jmp(node) is_Load(node) is_Minus(node)
 410         is_Mod(node) is_Mul(node) is_Mulh(node) is_Mux(node) is_NoMem(node)
 411         is_Pin(node) is_Proj(node) is_Quot(node)
 412         is_Raise(node) is_Return(node) is_Sel(node) is_Start(node) is_Store(node)
 413         is_SymConst(node) is_Sync(node) is_Tuple(node)
 414         */
 415
 416         /* Merge the newly calculated values with those that might already exist*/
 417         if (new_bits_set != tarval_bad) {
 418                 new_bits_set = tarval_or(new_bits_set, vrp->bits_set);
 419                 if (tarval_cmp(new_bits_set, vrp->bits_set) != pn_Cmp_Eq) {
 420                         something_changed = 1;
 421                         vrp->bits_set = new_bits_set;
 422                 }
 423         }
 424
 425         if (new_bits_not_set != tarval_bad) {
 426                 new_bits_not_set = tarval_or(new_bits_not_set, vrp->bits_not_set);
 427
 428                 if (tarval_cmp(new_bits_not_set, vrp->bits_not_set) != pn_Cmp_Eq) {
 429                         something_changed = 1;
 430                         vrp->bits_not_set = new_bits_not_set;
 431                 }
 432         }
 433
 434         if (vrp->range_type == VRP_UNDEFINED &&
 435                         new_range_type != VRP_UNDEFINED) {
 436                 something_changed = 1;
 437                 vrp->range_type = new_range_type;
 438                 vrp->range_bottom = new_range_bottom;
 439                 vrp->range_top = new_range_top;
 440
 441         } else if (vrp->range_type == VRP_RANGE) {
 442                 if (new_range_type == VRP_RANGE) {
 443                         if (tarval_cmp(vrp->range_bottom, new_range_bottom) == pn_Cmp_Lt) {
 444                                 something_changed = 1;
 445                                 vrp->range_bottom = new_range_bottom;
 446                         }
 447                         if (tarval_cmp(vrp->range_top, new_range_top) == pn_Cmp_Gt) {
 448                                 something_changed = 1;
 449                                 vrp->range_top = new_range_top;
 450                         }
 451                 }
 452
 453                 if (new_range_type == VRP_ANTIRANGE) {
 454                         /* if they are overlapping, cut the range.*/
 455                         /* TODO: Maybe we can preserve more information here*/
 456                         if (tarval_cmp(vrp->range_bottom, new_range_top) == pn_Cmp_Gt &&
 457                                         tarval_cmp(vrp->range_bottom, new_range_bottom) == pn_Cmp_Gt) {
 458                                 something_changed = 1;
 459                                 vrp->range_bottom = new_range_top;
 460
 461                         } else if (tarval_cmp(vrp->range_top, new_range_bottom) == pn_Cmp_Gt &&
 462                                         tarval_cmp(vrp->range_top, new_range_top) == pn_Cmp_Lt) {
 463                                 something_changed = 1;
 464                                 vrp->range_top = new_range_bottom;
 465                         }
 466
 467                         /* We can not handle the case where the anti range is in the*/
 468                         /* range*/
 469
 470                 }
 471         } else if (vrp->range_type == VRP_ANTIRANGE) {
 472                 if (new_range_type == VRP_ANTIRANGE) {
 473                         if (tarval_cmp(vrp->range_bottom, new_range_bottom) == pn_Cmp_Gt) {
 474                                 something_changed = 1;
 475                                 vrp->range_bottom = new_range_bottom;
 476                         }
 477                         if (tarval_cmp(vrp->range_top, new_range_top) == pn_Cmp_Lt) {
 478                                 something_changed = 1;
 479                                 vrp->range_top = new_range_top;
 480                         }
 481                 }
 482
 483                 if (new_range_type == VRP_RANGE) {
 484                         if (tarval_cmp(vrp->range_bottom, new_range_top) == pn_Cmp_Gt) {
 485                                 something_changed = 1;
 486                                 vrp->range_bottom = new_range_top;
 487                         }
 488                         if (tarval_cmp(vrp->range_top, new_range_bottom) == pn_Cmp_Lt) {
 489                                 something_changed = 1;
 490                                 vrp->range_top = new_range_bottom;
 491                         }
 492                 }
 493         }
 494
 495         assert(tarval_is_null(
 496                                 tarval_and(vrp->bits_set, vrp->bits_not_set)));
 497         return something_changed;
 498 }
 499
 500 static void vrp_first_pass(ir_node *n, void *e)
 501 {
 502         ir_node *succ;
 503         int i;
 504         struct vrp_env_t *env = e;
 505
 506         if (is_Block(n))
 507                 return;
 508
 509         set_irn_link(n, VISITED);
 510
 511         vrp_update_node(n);
 512
 513         for (i = get_irn_n_outs(n) - 1; i >=0; --i) {
 514                 succ =  get_irn_out(n, i);
 515                 if (get_irn_link(succ) == VISITED) {
 516                         /* we found a loop*/
 517                         waitq_put(env->workqueue, n);
 518                 }
 519         }
 520 }
 521
 522 static void *vrp_init_node(ir_phase *phase, const ir_node *n, void *old)
 523 {
 524         ir_mode *mode;
 525         vrp_attr *vrp;
 526
 527         ir_printf("initialized node nr: %d\n", get_irn_node_nr(n));
 528         if (old) {
 529                 assert(1==0 && "init called for node already initialized");
 530         }
 531         vrp = phase_alloc(phase, sizeof(vrp_attr));
 532
 533         memset(vrp, 0, sizeof(vrp_attr));
 534         /* Initialize the vrp information to default */
 535
 536         mode = get_irn_mode(n);
 537
 538         vrp->range_type = VRP_UNDEFINED;
 539
 540         /* TODO: We might be able to optimize space usage if we do not allocate
 541          * vrp space for non-int nodes. (currently caught by vrp_update_node)
 542          */
 543         if (mode_is_int(mode)) {
 544                 /* We are assuming that 0 is always represented as this modes null */
 545                 vrp->valid = 1;
 546                 vrp->bits_set = get_mode_null(mode);
 547                 vrp->bits_not_set = get_mode_null(mode);
 548                 vrp->range_bottom = get_tarval_top();
 549                 vrp->range_top = get_tarval_top();
 550         } else {
 551                 vrp->valid = 0;
 552                 vrp->bits_set = get_tarval_bad();
 553                 vrp->bits_not_set = get_tarval_bad();
 554                 vrp->range_bottom = get_tarval_bad();
 555                 vrp->range_top = get_tarval_bad();
 556         }
 557
 558         /* TODO: We might be able to set better vrp info at this time, if this is
 559          * a node which is newly created in an already initialized irg
 560          *
 561          * maybe just call vrp_update_node and if it returns one, iterate over
 562          * successors
 563          */
 564         return vrp;
 565 }
 566
 567 void set_vrp_data(ir_graph *irg)
 568 {
 569         ir_node *succ, *node;
 570         int i;
 571         struct vrp_env_t *env;
 572         ir_phase *phase;
 573
 574         assure_irg_outs(irg); /* ensure that out edges are consistent*/
 575         phase = irg_get_phase(irg, PHASE_VRP);
 576         if (phase == NULL) {
 577                 /* this is our first run */
 578                 phase = new_phase(irg, vrp_init_node);
 579                 irg_register_phase(irg, PHASE_VRP, phase);
 580                 env = phase_alloc(phase, sizeof(*env));
 581                 phase->priv = env;
 582         } else {
 583                 env = phase->priv;
 584         }
 585
 586         env->workqueue = new_waitq();
 587
 588         irg_walk_graph(irg, NULL, vrp_first_pass, env);
 589
 590         /* while there are entries in the worklist, continue*/
 591         while (!waitq_empty(env->workqueue)) {
 592                 node = waitq_get(env->workqueue);
 593
 594                 if (vrp_update_node(node)) {
 595                         /* if something changed, add successors to worklist*/
 596                         for (i = get_irn_n_outs(node) - 1; i >=0; --i) {
 597                                 succ =  get_irn_out(node, i);
 598                                 waitq_put(env->workqueue, node);
 599                         }
 600                 }
 601         }
 602         del_waitq(env->workqueue);
 603 }
 604
 605
 606 ir_graph_pass_t *set_vrp_pass(const char *name)
 607 {
 608         return def_graph_pass(name ? name : "set_vrp", set_vrp_data);
 609 }
 610
 611 pn_Cmp vrp_cmp(const ir_node *left, const ir_node *right)
 612 {
 613         vrp_attr *vrp_left, *vrp_right;
 614
 615         vrp_left = vrp_get_info(left);
 616         vrp_right = vrp_get_info(right);
 617
 618         if (!vrp_left || !vrp_right) {
 619                 return pn_Cmp_False;
 620         }
 621
 622         if (vrp_left->range_type == VRP_RANGE && vrp_right->range_type == VRP_RANGE) {
 623                 if (tarval_cmp(vrp_left->range_top, vrp_right->range_bottom) == pn_Cmp_Lt) {
 624                         return pn_Cmp_Lt;
 625                 }
 626                 if (tarval_cmp(vrp_left->range_bottom, vrp_right->range_top) == pn_Cmp_Gt) {
 627                         return pn_Cmp_Gt;
 628                 }
 629         }
 630
 631         if (!tarval_is_null(tarval_and(vrp_left->bits_set, vrp_right->bits_not_set)) ||
 632                         !tarval_is_null(tarval_and(vrp_left->bits_not_set, vrp_right->bits_set))) {
 633                 return pn_Cmp_Lg;
 634         }
 635         /* TODO: We can get way more information here*/
 636
 637         return pn_Cmp_False;
 638 }
 639
 640 vrp_attr *vrp_get_info(const ir_node *node)
 641 {
 642         const ir_graph *irg   = get_irn_irg(node);
 643         const ir_phase *phase = irg_get_phase(irg, PHASE_VRP);
 644
 645         if (phase == NULL) {
 646                 /* phase has not yet been initialized */
 647                 return NULL;
 648         }
 649
 650         return phase_get_irn_data(phase, node);
 651 }