dist/gcc/tree-ssa-loop.c

586 for_each_index (tree *addr_p, bool (*cbck) (tree, tree *, void *), void *data)
590   for (; ; addr_p = nxt)
592       switch (TREE_CODE (*addr_p))
595 	  return cbck (*addr_p, addr_p, data);
598 	  nxt = &TREE_OPERAND (*addr_p, 0);
599 	  return cbck (*addr_p, nxt, data);
605 	  nxt = &TREE_OPERAND (*addr_p, 0);
611 	  idx = &TREE_OPERAND (*addr_p, 2);
613 	      && !cbck (*addr_p, idx, data))
616 	  nxt = &TREE_OPERAND (*addr_p, 0);
621 	  nxt = &TREE_OPERAND (*addr_p, 0);
622 	  if (!cbck (*addr_p, &TREE_OPERAND (*addr_p, 1), data))
630 	  gcc_assert (is_gimple_min_invariant (*addr_p));
634 	  idx = &TMR_BASE (*addr_p);
636 	      && !cbck (*addr_p, idx, data))
638 	  idx = &TMR_INDEX (*addr_p);
640 	      && !cbck (*addr_p, idx, data))
642 	  idx = &TMR_INDEX2 (*addr_p);
644 	      && !cbck (*addr_p, idx, data))
649 	  if (DECL_P (*addr_p)
650 	      || CONSTANT_CLASS_P (*addr_p))