gcc/gcc/gimple-ssa-strength-reduction.c

303   cand_idx dependent;
609       c->sibling = basis->dependent;
610       basis->dependent = c->cand_num;
672   c->dependent = 0;
1833   fprintf (dump_file, "\n     basis: %d  dependent: %d  sibling: %d\n",
1834 	   c->basis, c->dependent, c->sibling);
1945    dependent of candidate C with an equivalent strength-reduced data
1978   if (c->dependent)
1979     replace_refs (lookup_cand (c->dependent));
1982 /* Return TRUE if candidate C is dependent upon a PHI.  */
1987   /* A candidate is not necessarily dependent upon a PHI just because
2424 /* For candidate C, each sibling of candidate C, and each dependent of
2425    candidate C, determine whether the candidate is dependent upon a
2438 	  /* A candidate dependent upon a phi will replace a multiply by
2474   if (c->dependent)
2475     replace_uncond_cands_and_profitable_phis (lookup_cand (c->dependent));
2490   if (c->dependent)
2491     count += count_candidates (lookup_cand (c->dependent));
2654   if (c->dependent)
2655     record_increments (lookup_cand (c->dependent));
2723   if (c->dependent)
2725       slsr_cand_t dep = unreplaced_cand_in_tree (lookup_cand (c->dependent));
2746 /* Add COST_IN to the lowest cost of any dependent path starting at
2778   if (c->dependent)
2780 				   lookup_cand (c->dependent), incr,
2822   if (c->dependent)
2823     savings += total_savings (repl_savings, lookup_cand (c->dependent), incr,
2835    MODE and SPEED.  FIRST_DEP is the first dependent of the root of
3085   if (c->dependent)
3086     dep_ncd = nearest_common_dominator_for_cands (lookup_cand (c->dependent),
3536   if (c->dependent)
3537     replace_profitable_candidates (lookup_cand (c->dependent));
3551      dependent is the root of a tree of related statements.
3558       if (c->basis != 0 || c->dependent == 0)
3565       first_dep = lookup_cand (c->dependent);
3583 	 to replace some or all of the dependent candidates, depending