gcc/tree-flow-inline.h

   1 /* Inline functions for tree-flow.h
   2    Copyright (C) 2001, 2003, 2005 Free Software Foundation, Inc.
   3    Contributed by Diego Novillo <dnovillo@redhat.com>
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify
   8 it under the terms of the GNU General Public License as published by
   9 the Free Software Foundation; either version 2, or (at your option)
  10 any later version.
  11
  12 GCC is distributed in the hope that it will be useful,
  13 but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 GNU General Public License for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING.  If not, write to
  19 the Free Software Foundation, 59 Temple Place - Suite 330,
  20 Boston, MA 02111-1307, USA.  */
  21
  22 #ifndef _TREE_FLOW_INLINE_H
  23 #define _TREE_FLOW_INLINE_H 1
  24
  25 /* Inline functions for manipulating various data structures defined in
  26    tree-flow.h.  See tree-flow.h for documentation.  */
  27
  28 /* Return the variable annotation for T, which must be a _DECL node.
  29    Return NULL if the variable annotation doesn't already exist.  */
  30 static inline var_ann_t
  31 var_ann (tree t)
  32 {
  33   gcc_assert (t);
  34   gcc_assert (DECL_P (t));
  35   gcc_assert (!t->common.ann || t->common.ann->common.type == VAR_ANN);
  36
  37   return (var_ann_t) t->common.ann;
  38 }
  39
  40 /* Return the variable annotation for T, which must be a _DECL node.
  41    Create the variable annotation if it doesn't exist.  */
  42 static inline var_ann_t
  43 get_var_ann (tree var)
  44 {
  45   var_ann_t ann = var_ann (var);
  46   return (ann) ? ann : create_var_ann (var);
  47 }
  48
  49 /* Return the statement annotation for T, which must be a statement
  50    node.  Return NULL if the statement annotation doesn't exist.  */
  51 static inline stmt_ann_t
  52 stmt_ann (tree t)
  53 {
  54 #ifdef ENABLE_CHECKING
  55   gcc_assert (is_gimple_stmt (t));
  56 #endif
  57   return (stmt_ann_t) t->common.ann;
  58 }
  59
  60 /* Return the statement annotation for T, which must be a statement
  61    node.  Create the statement annotation if it doesn't exist.  */
  62 static inline stmt_ann_t
  63 get_stmt_ann (tree stmt)
  64 {
  65   stmt_ann_t ann = stmt_ann (stmt);
  66   return (ann) ? ann : create_stmt_ann (stmt);
  67 }
  68
  69
  70 /* Return the annotation type for annotation ANN.  */
  71 static inline enum tree_ann_type
  72 ann_type (tree_ann_t ann)
  73 {
  74   return ann->common.type;
  75 }
  76
  77 /* Return the basic block for statement T.  */
  78 static inline basic_block
  79 bb_for_stmt (tree t)
  80 {
  81   stmt_ann_t ann;
  82
  83   if (TREE_CODE (t) == PHI_NODE)
  84     return PHI_BB (t);
  85
  86   ann = stmt_ann (t);
  87   return ann ? ann->bb : NULL;
  88 }
  89
  90 /* Return the may_aliases varray for variable VAR, or NULL if it has
  91    no may aliases.  */
  92 static inline varray_type
  93 may_aliases (tree var)
  94 {
  95   var_ann_t ann = var_ann (var);
  96   return ann ? ann->may_aliases : NULL;
  97 }
  98
  99 /* Return the line number for EXPR, or return -1 if we have no line
 100    number information for it.  */
 101 static inline int
 102 get_lineno (tree expr)
 103 {
 104   if (expr == NULL_TREE)
 105     return -1;
 106
 107   if (TREE_CODE (expr) == COMPOUND_EXPR)
 108     expr = TREE_OPERAND (expr, 0);
 109
 110   if (! EXPR_HAS_LOCATION (expr))
 111     return -1;
 112
 113   return EXPR_LINENO (expr);
 114 }
 115
 116 /* Return the file name for EXPR, or return "???" if we have no
 117    filename information.  */
 118 static inline const char *
 119 get_filename (tree expr)
 120 {
 121   const char *filename;
 122   if (expr == NULL_TREE)
 123     return "???";
 124
 125   if (TREE_CODE (expr) == COMPOUND_EXPR)
 126     expr = TREE_OPERAND (expr, 0);
 127
 128   if (EXPR_HAS_LOCATION (expr) && (filename = EXPR_FILENAME (expr)))
 129     return filename;
 130   else
 131     return "???";
 132 }
 133
 134 /* Mark statement T as modified.  */
 135 static inline void
 136 modify_stmt (tree t)
 137 {
 138   stmt_ann_t ann = stmt_ann (t);
 139   if (ann == NULL)
 140     ann = create_stmt_ann (t);
 141   ann->modified = 1;
 142 }
 143
 144 /* Mark statement T as unmodified.  */
 145 static inline void
 146 unmodify_stmt (tree t)
 147 {
 148   stmt_ann_t ann = stmt_ann (t);
 149   if (ann == NULL)
 150     ann = create_stmt_ann (t);
 151   ann->modified = 0;
 152 }
 153
 154 /* Return true if T is marked as modified, false otherwise.  */
 155 static inline bool
 156 stmt_modified_p (tree t)
 157 {
 158   stmt_ann_t ann = stmt_ann (t);
 159
 160   /* Note that if the statement doesn't yet have an annotation, we consider it
 161      modified.  This will force the next call to get_stmt_operands to scan the
 162      statement.  */
 163   return ann ? ann->modified : true;
 164 }
 165
 166 /* Return the definitions present in ANN, a statement annotation.
 167    Return NULL if this annotation contains no definitions.  */
 168 static inline def_optype
 169 get_def_ops (stmt_ann_t ann)
 170 {
 171   return ann ? ann->operands.def_ops : NULL;
 172 }
 173
 174 /* Return the uses present in ANN, a statement annotation.
 175    Return NULL if this annotation contains no uses.  */
 176 static inline use_optype
 177 get_use_ops (stmt_ann_t ann)
 178 {
 179   return ann ? ann->operands.use_ops : NULL;
 180 }
 181
 182 /* Return the virtual may-defs present in ANN, a statement
 183    annotation.
 184    Return NULL if this annotation contains no virtual may-defs.  */
 185 static inline v_may_def_optype
 186 get_v_may_def_ops (stmt_ann_t ann)
 187 {
 188   return ann ? ann->operands.v_may_def_ops : NULL;
 189 }
 190
 191 /* Return the virtual uses present in ANN, a statement annotation.
 192    Return NULL if this annotation contains no virtual uses.  */
 193 static inline vuse_optype
 194 get_vuse_ops (stmt_ann_t ann)
 195 {
 196   return ann ? ann->operands.vuse_ops : NULL;
 197 }
 198
 199 /* Return the virtual must-defs present in ANN, a statement
 200    annotation.  Return NULL if this annotation contains no must-defs.*/
 201 static inline v_must_def_optype
 202 get_v_must_def_ops (stmt_ann_t ann)
 203 {
 204   return ann ? ann->operands.v_must_def_ops : NULL;
 205 }
 206
 207 /* Return the tree pointer to by USE.  */
 208 static inline tree
 209 get_use_from_ptr (use_operand_p use)
 210 {
 211   return *(use.use);
 212 }
 213
 214 /* Return the tree pointer to by DEF.  */
 215 static inline tree
 216 get_def_from_ptr (def_operand_p def)
 217 {
 218   return *(def.def);
 219 }
 220
 221 /* Return a pointer to the tree that is at INDEX in the USES array.  */
 222 static inline use_operand_p
 223 get_use_op_ptr (use_optype uses, unsigned int index)
 224 {
 225   gcc_assert (index < uses->num_uses);
 226   return uses->uses[index];
 227 }
 228
 229 /* Return a def_operand_p pointer for element INDEX of DEFS.  */
 230 static inline def_operand_p
 231 get_def_op_ptr (def_optype defs, unsigned int index)
 232 {
 233   gcc_assert (index < defs->num_defs);
 234   return defs->defs[index];
 235 }
 236
 237
 238 /* Return the def_operand_p that is the V_MAY_DEF_RESULT for the V_MAY_DEF
 239    at INDEX in the V_MAY_DEFS array.  */
 240 static inline def_operand_p
 241 get_v_may_def_result_ptr(v_may_def_optype v_may_defs, unsigned int index)
 242 {
 243   def_operand_p op;
 244   gcc_assert (index < v_may_defs->num_v_may_defs);
 245   op.def = &(v_may_defs->v_may_defs[index].def);
 246   return op;
 247 }
 248
 249 /* Return a use_operand_p that is the V_MAY_DEF_OP for the V_MAY_DEF at
 250    INDEX in the V_MAY_DEFS array.  */
 251 static inline use_operand_p
 252 get_v_may_def_op_ptr(v_may_def_optype v_may_defs, unsigned int index)
 253 {
 254   use_operand_p op;
 255   gcc_assert (index < v_may_defs->num_v_may_defs);
 256   op.use = &(v_may_defs->v_may_defs[index].use);
 257   return op;
 258 }
 259
 260 /* Return a use_operand_p that is at INDEX in the VUSES array.  */
 261 static inline use_operand_p
 262 get_vuse_op_ptr(vuse_optype vuses, unsigned int index)
 263 {
 264   use_operand_p op;
 265   gcc_assert (index < vuses->num_vuses);
 266   op.use = &(vuses->vuses[index]);
 267   return op;
 268 }
 269
 270 /* Return a def_operand_p that is the V_MUST_DEF_RESULT for the
 271    V_MUST_DEF at INDEX in the V_MUST_DEFS array.  */
 272 static inline def_operand_p
 273 get_v_must_def_result_ptr (v_must_def_optype v_must_defs, unsigned int index)
 274 {
 275   def_operand_p op;
 276   gcc_assert (index < v_must_defs->num_v_must_defs);
 277   op.def = &(v_must_defs->v_must_defs[index].def);
 278   return op;
 279 }
 280
 281 /* Return a use_operand_p that is the V_MUST_DEF_KILL for the
 282    V_MUST_DEF at INDEX in the V_MUST_DEFS array.  */
 283 static inline use_operand_p
 284 get_v_must_def_kill_ptr (v_must_def_optype v_must_defs, unsigned int index)
 285 {
 286   use_operand_p op;
 287   gcc_assert (index < v_must_defs->num_v_must_defs);
 288   op.use = &(v_must_defs->v_must_defs[index].use);
 289   return op;
 290 }
 291
 292 /* Return a def_operand_p pointer for the result of PHI.  */
 293 static inline def_operand_p
 294 get_phi_result_ptr (tree phi)
 295 {
 296   def_operand_p op;
 297   op.def = &(PHI_RESULT_TREE (phi));
 298   return op;
 299 }
 300
 301 /* Return a use_operand_p pointer for argument I of phinode PHI.  */
 302 static inline use_operand_p
 303 get_phi_arg_def_ptr (tree phi, int i)
 304 {
 305   use_operand_p op;
 306   op.use = &(PHI_ARG_DEF_TREE (phi, i));
 307   return op;
 308 }
 309
 310 /* Return the bitmap of addresses taken by STMT, or NULL if it takes
 311    no addresses.  */
 312 static inline bitmap
 313 addresses_taken (tree stmt)
 314 {
 315   stmt_ann_t ann = stmt_ann (stmt);
 316   return ann ? ann->addresses_taken : NULL;
 317 }
 318
 319 /* Return the immediate uses of STMT, or NULL if this information is
 320    not computed.  */
 321 static dataflow_t
 322 get_immediate_uses (tree stmt)
 323 {
 324   stmt_ann_t ann;
 325
 326   if (TREE_CODE (stmt) == PHI_NODE)
 327     return PHI_DF (stmt);
 328
 329   ann = stmt_ann (stmt);
 330   return ann ? ann->df : NULL;
 331 }
 332
 333 /* Return the number of immediate uses present in the dataflow
 334    information at DF.  */
 335 static inline int
 336 num_immediate_uses (dataflow_t df)
 337 {
 338   varray_type imm;
 339
 340   if (!df)
 341     return 0;
 342
 343   imm = df->immediate_uses;
 344   if (!imm)
 345     return df->uses[1] ? 2 : 1;
 346
 347   return VARRAY_ACTIVE_SIZE (imm) + 2;
 348 }
 349
 350 /* Return the tree that is at NUM in the immediate use DF array.  */
 351 static inline tree
 352 immediate_use (dataflow_t df, int num)
 353 {
 354   if (!df)
 355     return NULL_TREE;
 356
 357 #ifdef ENABLE_CHECKING
 358   gcc_assert (num < num_immediate_uses (df));
 359 #endif
 360   if (num < 2)
 361     return df->uses[num];
 362   return VARRAY_TREE (df->immediate_uses, num - 2);
 363 }
 364
 365 /* Return the basic_block annotation for BB.  */
 366 static inline bb_ann_t
 367 bb_ann (basic_block bb)
 368 {
 369   return (bb_ann_t)bb->tree_annotations;
 370 }
 371
 372 /* Return the PHI nodes for basic block BB, or NULL if there are no
 373    PHI nodes.  */
 374 static inline tree
 375 phi_nodes (basic_block bb)
 376 {
 377   return bb_ann (bb)->phi_nodes;
 378 }
 379
 380 /* Set list of phi nodes of a basic block BB to L.  */
 381
 382 static inline void
 383 set_phi_nodes (basic_block bb, tree l)
 384 {
 385   tree phi;
 386
 387   bb_ann (bb)->phi_nodes = l;
 388   for (phi = l; phi; phi = PHI_CHAIN (phi))
 389     set_bb_for_stmt (phi, bb);
 390 }
 391
 392 /* Mark VAR as used, so that it'll be preserved during rtl expansion.  */
 393
 394 static inline void
 395 set_is_used (tree var)
 396 {
 397   var_ann_t ann = get_var_ann (var);
 398   ann->used = 1;
 399 }
 400
 401
 402 /*  -----------------------------------------------------------------------  */
 403
 404 /* Return true if T is an executable statement.  */
 405 static inline bool
 406 is_exec_stmt (tree t)
 407 {
 408   return (t && !IS_EMPTY_STMT (t) && t != error_mark_node);
 409 }
 410
 411
 412 /* Return true if this stmt can be the target of a control transfer stmt such
 413    as a goto.  */
 414 static inline bool
 415 is_label_stmt (tree t)
 416 {
 417   if (t)
 418     switch (TREE_CODE (t))
 419       {
 420         case LABEL_DECL:
 421         case LABEL_EXPR:
 422         case CASE_LABEL_EXPR:
 423           return true;
 424         default:
 425           return false;
 426       }
 427   return false;
 428 }
 429
 430 /* Set the default definition for VAR to DEF.  */
 431 static inline void
 432 set_default_def (tree var, tree def)
 433 {
 434   var_ann_t ann = get_var_ann (var);
 435   ann->default_def = def;
 436 }
 437
 438 /* Return the default definition for variable VAR, or NULL if none
 439    exists.  */
 440 static inline tree
 441 default_def (tree var)
 442 {
 443   var_ann_t ann = var_ann (var);
 444   return ann ? ann->default_def : NULL_TREE;
 445 }
 446
 447 /* PHI nodes should contain only ssa_names and invariants.  A test
 448    for ssa_name is definitely simpler; don't let invalid contents
 449    slip in in the meantime.  */
 450
 451 static inline bool
 452 phi_ssa_name_p (tree t)
 453 {
 454   if (TREE_CODE (t) == SSA_NAME)
 455     return true;
 456 #ifdef ENABLE_CHECKING
 457   gcc_assert (is_gimple_min_invariant (t));
 458 #endif
 459   return false;
 460 }
 461
 462 /*  -----------------------------------------------------------------------  */
 463
 464 /* Return a block_stmt_iterator that points to beginning of basic
 465    block BB.  */
 466 static inline block_stmt_iterator
 467 bsi_start (basic_block bb)
 468 {
 469   block_stmt_iterator bsi;
 470   if (bb->stmt_list)
 471     bsi.tsi = tsi_start (bb->stmt_list);
 472   else
 473     {
 474       gcc_assert (bb->index < 0);
 475       bsi.tsi.ptr = NULL;
 476       bsi.tsi.container = NULL;
 477     }
 478   bsi.bb = bb;
 479   return bsi;
 480 }
 481
 482 /* Return a block statement iterator that points to the last label in
 483    block BB.  */
 484
 485 static inline block_stmt_iterator
 486 bsi_after_labels (basic_block bb)
 487 {
 488   block_stmt_iterator bsi;
 489   tree_stmt_iterator next;
 490
 491   bsi.bb = bb;
 492
 493   if (!bb->stmt_list)
 494     {
 495       gcc_assert (bb->index < 0);
 496       bsi.tsi.ptr = NULL;
 497       bsi.tsi.container = NULL;
 498       return bsi;
 499     }
 500
 501   bsi.tsi = tsi_start (bb->stmt_list);
 502   if (tsi_end_p (bsi.tsi))
 503     return bsi;
 504
 505   /* Ensure that there are some labels.  The rationale is that we want
 506      to insert after the bsi that is returned, and these insertions should
 507      be placed at the start of the basic block.  This would not work if the
 508      first statement was not label; rather fail here than enable the user
 509      proceed in wrong way.  */
 510   gcc_assert (TREE_CODE (tsi_stmt (bsi.tsi)) == LABEL_EXPR);
 511
 512   next = bsi.tsi;
 513   tsi_next (&next);
 514
 515   while (!tsi_end_p (next)
 516          && TREE_CODE (tsi_stmt (next)) == LABEL_EXPR)
 517     {
 518       bsi.tsi = next;
 519       tsi_next (&next);
 520     }
 521
 522   return bsi;
 523 }
 524
 525 /* Return a block statement iterator that points to the end of basic
 526    block BB.  */
 527 static inline block_stmt_iterator
 528 bsi_last (basic_block bb)
 529 {
 530   block_stmt_iterator bsi;
 531   if (bb->stmt_list)
 532     bsi.tsi = tsi_last (bb->stmt_list);
 533   else
 534     {
 535       gcc_assert (bb->index < 0);
 536       bsi.tsi.ptr = NULL;
 537       bsi.tsi.container = NULL;
 538     }
 539   bsi.bb = bb;
 540   return bsi;
 541 }
 542
 543 /* Return true if block statement iterator I has reached the end of
 544    the basic block.  */
 545 static inline bool
 546 bsi_end_p (block_stmt_iterator i)
 547 {
 548   return tsi_end_p (i.tsi);
 549 }
 550
 551 /* Modify block statement iterator I so that it is at the next
 552    statement in the basic block.  */
 553 static inline void
 554 bsi_next (block_stmt_iterator *i)
 555 {
 556   tsi_next (&i->tsi);
 557 }
 558
 559 /* Modify block statement iterator I so that it is at the previous
 560    statement in the basic block.  */
 561 static inline void
 562 bsi_prev (block_stmt_iterator *i)
 563 {
 564   tsi_prev (&i->tsi);
 565 }
 566
 567 /* Return the statement that block statement iterator I is currently
 568    at.  */
 569 static inline tree
 570 bsi_stmt (block_stmt_iterator i)
 571 {
 572   return tsi_stmt (i.tsi);
 573 }
 574
 575 /* Return a pointer to the statement that block statement iterator I
 576    is currently at.  */
 577 static inline tree *
 578 bsi_stmt_ptr (block_stmt_iterator i)
 579 {
 580   return tsi_stmt_ptr (i.tsi);
 581 }
 582
 583 /* Returns the loop of the statement STMT.  */
 584
 585 static inline struct loop *
 586 loop_containing_stmt (tree stmt)
 587 {
 588   basic_block bb = bb_for_stmt (stmt);
 589   if (!bb)
 590     return NULL;
 591
 592   return bb->loop_father;
 593 }
 594
 595 /* Return true if VAR is a clobbered by function calls.  */
 596 static inline bool
 597 is_call_clobbered (tree var)
 598 {
 599   return is_global_var (var)
 600          || bitmap_bit_p (call_clobbered_vars, var_ann (var)->uid);
 601 }
 602
 603 /* Mark variable VAR as being clobbered by function calls.  */
 604 static inline void
 605 mark_call_clobbered (tree var)
 606 {
 607   var_ann_t ann = var_ann (var);
 608   /* If VAR is a memory tag, then we need to consider it a global
 609      variable.  This is because the pointer that VAR represents has
 610      been found to point to either an arbitrary location or to a known
 611      location in global memory.  */
 612   if (ann->mem_tag_kind != NOT_A_TAG)
 613     DECL_EXTERNAL (var) = 1;
 614   bitmap_set_bit (call_clobbered_vars, ann->uid);
 615   ssa_call_clobbered_cache_valid = false;
 616   ssa_ro_call_cache_valid = false;
 617 }
 618
 619 /* Clear the call-clobbered attribute from variable VAR.  */
 620 static inline void
 621 clear_call_clobbered (tree var)
 622 {
 623   var_ann_t ann = var_ann (var);
 624   if (ann->mem_tag_kind != NOT_A_TAG)
 625     DECL_EXTERNAL (var) = 0;
 626   bitmap_clear_bit (call_clobbered_vars, ann->uid);
 627   ssa_call_clobbered_cache_valid = false;
 628   ssa_ro_call_cache_valid = false;
 629 }
 630
 631 /* Mark variable VAR as being non-addressable.  */
 632 static inline void
 633 mark_non_addressable (tree var)
 634 {
 635   bitmap_clear_bit (call_clobbered_vars, var_ann (var)->uid);
 636   TREE_ADDRESSABLE (var) = 0;
 637   ssa_call_clobbered_cache_valid = false;
 638   ssa_ro_call_cache_valid = false;
 639 }
 640
 641 /* Return the common annotation for T.  Return NULL if the annotation
 642    doesn't already exist.  */
 643 static inline tree_ann_t
 644 tree_ann (tree t)
 645 {
 646   return t->common.ann;
 647 }
 648
 649 /* Return a common annotation for T.  Create the constant annotation if it
 650    doesn't exist.  */
 651 static inline tree_ann_t
 652 get_tree_ann (tree t)
 653 {
 654   tree_ann_t ann = tree_ann (t);
 655   return (ann) ? ann : create_tree_ann (t);
 656 }
 657
 658 /*  -----------------------------------------------------------------------  */
 659
 660 /* The following set of routines are used to iterator over various type of
 661    SSA operands.  */
 662
 663 /* Return true if PTR is finished iterating.  */
 664 static inline bool
 665 op_iter_done (ssa_op_iter *ptr)
 666 {
 667   return ptr->done;
 668 }
 669
 670 /* Get the next iterator use value for PTR.  */
 671 static inline use_operand_p
 672 op_iter_next_use (ssa_op_iter *ptr)
 673 {
 674   if (ptr->use_i < ptr->num_use)
 675     {
 676       return USE_OP_PTR (ptr->ops->use_ops, (ptr->use_i)++);
 677     }
 678   if (ptr->vuse_i < ptr->num_vuse)
 679     {
 680       return VUSE_OP_PTR (ptr->ops->vuse_ops, (ptr->vuse_i)++);
 681     }
 682   if (ptr->v_mayu_i < ptr->num_v_mayu)
 683     {
 684       return V_MAY_DEF_OP_PTR (ptr->ops->v_may_def_ops,
 685                                (ptr->v_mayu_i)++);
 686     }
 687   if (ptr->v_mustu_i < ptr->num_v_mustu)
 688     {
 689       return V_MUST_DEF_KILL_PTR (ptr->ops->v_must_def_ops,
 690                                   (ptr->v_mustu_i)++);
 691     }
 692   ptr->done = true;
 693   return NULL_USE_OPERAND_P;
 694 }
 695
 696 /* Get the next iterator def value for PTR.  */
 697 static inline def_operand_p
 698 op_iter_next_def (ssa_op_iter *ptr)
 699 {
 700   if (ptr->def_i < ptr->num_def)
 701     {
 702       return DEF_OP_PTR (ptr->ops->def_ops, (ptr->def_i)++);
 703     }
 704   if (ptr->v_mustd_i < ptr->num_v_mustd)
 705     {
 706       return V_MUST_DEF_RESULT_PTR (ptr->ops->v_must_def_ops,
 707                                         (ptr->v_mustd_i)++);
 708     }
 709   if (ptr->v_mayd_i < ptr->num_v_mayd)
 710     {
 711       return V_MAY_DEF_RESULT_PTR (ptr->ops->v_may_def_ops,
 712                                            (ptr->v_mayd_i)++);
 713     }
 714   ptr->done = true;
 715   return NULL_DEF_OPERAND_P;
 716 }
 717
 718 /* Get the next iterator tree value for PTR.  */
 719 static inline tree
 720 op_iter_next_tree (ssa_op_iter *ptr)
 721 {
 722   if (ptr->use_i < ptr->num_use)
 723     {
 724       return USE_OP (ptr->ops->use_ops, (ptr->use_i)++);
 725     }
 726   if (ptr->vuse_i < ptr->num_vuse)
 727     {
 728       return VUSE_OP (ptr->ops->vuse_ops, (ptr->vuse_i)++);
 729     }
 730   if (ptr->v_mayu_i < ptr->num_v_mayu)
 731     {
 732       return V_MAY_DEF_OP (ptr->ops->v_may_def_ops, (ptr->v_mayu_i)++);
 733     }
 734   if (ptr->v_mustu_i < ptr->num_v_mustu)
 735     {
 736       return V_MUST_DEF_KILL (ptr->ops->v_must_def_ops, (ptr->v_mustu_i)++);
 737     }
 738   if (ptr->def_i < ptr->num_def)
 739     {
 740       return DEF_OP (ptr->ops->def_ops, (ptr->def_i)++);
 741     }
 742   if (ptr->v_mustd_i < ptr->num_v_mustd)
 743     {
 744       return V_MUST_DEF_RESULT (ptr->ops->v_must_def_ops,
 745                                         (ptr->v_mustd_i)++);
 746     }
 747   if (ptr->v_mayd_i < ptr->num_v_mayd)
 748     {
 749       return V_MAY_DEF_RESULT (ptr->ops->v_may_def_ops,
 750                                            (ptr->v_mayd_i)++);
 751     }
 752   ptr->done = true;
 753   return NULL;
 754 }
 755
 756 /* Initialize the iterator PTR to the virtual defs in STMT.  */
 757 static inline void
 758 op_iter_init (ssa_op_iter *ptr, tree stmt, int flags)
 759 {
 760   stmt_operands_p ops;
 761   stmt_ann_t ann = get_stmt_ann (stmt);
 762
 763   ops = &(ann->operands);
 764   ptr->done = false;
 765   ptr->ops = ops;
 766   ptr->num_def = (flags & SSA_OP_DEF) ? NUM_DEFS (ops->def_ops) : 0;
 767   ptr->num_use = (flags & SSA_OP_USE) ? NUM_USES (ops->use_ops) : 0;
 768   ptr->num_vuse = (flags & SSA_OP_VUSE) ? NUM_VUSES (ops->vuse_ops) : 0;
 769   ptr->num_v_mayu = (flags & SSA_OP_VMAYUSE)
 770                      ?  NUM_V_MAY_DEFS (ops->v_may_def_ops) : 0;
 771   ptr->num_v_mayd = (flags & SSA_OP_VMAYDEF)
 772                      ?  NUM_V_MAY_DEFS (ops->v_may_def_ops) : 0;
 773   ptr->num_v_mustu = (flags & SSA_OP_VMUSTDEFKILL)
 774                      ? NUM_V_MUST_DEFS (ops->v_must_def_ops) : 0;
 775   ptr->num_v_mustd = (flags & SSA_OP_VMUSTDEF)
 776                      ? NUM_V_MUST_DEFS (ops->v_must_def_ops) : 0;
 777   ptr->def_i = 0;
 778   ptr->use_i = 0;
 779   ptr->vuse_i = 0;
 780   ptr->v_mayu_i = 0;
 781   ptr->v_mayd_i = 0;
 782   ptr->v_mustu_i = 0;
 783   ptr->v_mustd_i = 0;
 784 }
 785
 786 /* Initialize iterator PTR to the use operands in STMT based on FLAGS. Return
 787    the first use.  */
 788 static inline use_operand_p
 789 op_iter_init_use (ssa_op_iter *ptr, tree stmt, int flags)
 790 {
 791   op_iter_init (ptr, stmt, flags);
 792   return op_iter_next_use (ptr);
 793 }
 794
 795 /* Initialize iterator PTR to the def operands in STMT based on FLAGS. Return
 796    the first def.  */
 797 static inline def_operand_p
 798 op_iter_init_def (ssa_op_iter *ptr, tree stmt, int flags)
 799 {
 800   op_iter_init (ptr, stmt, flags);
 801   return op_iter_next_def (ptr);
 802 }
 803
 804 /* Initialize iterator PTR to the operands in STMT based on FLAGS. Return
 805    the first operand as a tree.  */
 806 static inline tree
 807 op_iter_init_tree (ssa_op_iter *ptr, tree stmt, int flags)
 808 {
 809   op_iter_init (ptr, stmt, flags);
 810   return op_iter_next_tree (ptr);
 811 }
 812
 813 /* Get the next iterator mustdef value for PTR, returning the mustdef values in
 814    KILL and DEF.  */
 815 static inline void
 816 op_iter_next_mustdef (use_operand_p *kill, def_operand_p *def, ssa_op_iter *ptr)
 817 {
 818   if (ptr->v_mustu_i < ptr->num_v_mustu)
 819     {
 820       *def = V_MUST_DEF_RESULT_PTR (ptr->ops->v_must_def_ops, ptr->v_mustu_i);
 821       *kill = V_MUST_DEF_KILL_PTR (ptr->ops->v_must_def_ops, (ptr->v_mustu_i)++);
 822       return;
 823     }
 824   else
 825     {
 826       *def = NULL_DEF_OPERAND_P;
 827       *kill = NULL_USE_OPERAND_P;
 828     }
 829   ptr->done = true;
 830   return;
 831 }
 832 /* Get the next iterator maydef value for PTR, returning the maydef values in
 833    USE and DEF.  */
 834 static inline void
 835 op_iter_next_maydef (use_operand_p *use, def_operand_p *def, ssa_op_iter *ptr)
 836 {
 837   if (ptr->v_mayu_i < ptr->num_v_mayu)
 838     {
 839       *def = V_MAY_DEF_RESULT_PTR (ptr->ops->v_may_def_ops, ptr->v_mayu_i);
 840       *use = V_MAY_DEF_OP_PTR (ptr->ops->v_may_def_ops, (ptr->v_mayu_i)++);
 841       return;
 842     }
 843   else
 844     {
 845       *def = NULL_DEF_OPERAND_P;
 846       *use = NULL_USE_OPERAND_P;
 847     }
 848   ptr->done = true;
 849   return;
 850 }
 851
 852 /* Initialize iterator PTR to the operands in STMT.  Return the first operands
 853    in USE and DEF.  */
 854 static inline void
 855 op_iter_init_maydef (ssa_op_iter *ptr, tree stmt, use_operand_p *use,
 856                      def_operand_p *def)
 857 {
 858   op_iter_init (ptr, stmt, SSA_OP_VMAYUSE);
 859   op_iter_next_maydef (use, def, ptr);
 860 }
 861
 862 /* Initialize iterator PTR to the operands in STMT.  Return the first operands
 863    in KILL and DEF.  */
 864 static inline void
 865 op_iter_init_mustdef (ssa_op_iter *ptr, tree stmt, use_operand_p *kill,
 866                      def_operand_p *def)
 867 {
 868   op_iter_init (ptr, stmt, SSA_OP_VMUSTDEFKILL);
 869   op_iter_next_mustdef (kill, def, ptr);
 870 }
 871 #endif /* _TREE_FLOW_INLINE_H  */