Lines Matching defs:dependent
278 cand_idx dependent;
634 c->sibling = basis->dependent;
635 basis->dependent = c->cand_num;
699 c->dependent = 0;
1896 fprintf (dump_file, "\n basis: %d dependent: %d sibling: %d\n",
1897 c->basis, c->dependent, c->sibling);
2027 dependent of candidate C with an equivalent strength-reduced data
2037 && c->dependent
2038 && !lookup_cand (c->dependent)->dependent
2040 && valid_mem_ref_cand_p (lookup_cand (c->dependent)))
2070 if (c->dependent)
2071 replace_refs (lookup_cand (c->dependent));
2074 /* Return TRUE if candidate C is dependent upon a PHI. */
2079 /* A candidate is not necessarily dependent upon a PHI just because
2613 /* For candidate C, each sibling of candidate C, and each dependent of
2614 candidate C, determine whether the candidate is dependent upon a
2629 /* A candidate dependent upon a phi will replace a multiply by
2665 if (c->dependent)
2666 replace_uncond_cands_and_profitable_phis (lookup_cand (c->dependent));
2681 if (c->dependent)
2682 count += count_candidates (lookup_cand (c->dependent));
2863 if (c->dependent)
2864 record_increments (lookup_cand (c->dependent));
2963 if (c->dependent)
2965 slsr_cand_t dep = unreplaced_cand_in_tree (lookup_cand (c->dependent));
2986 /* Add COST_IN to the lowest cost of any dependent path starting at
3018 if (c->dependent)
3020 lookup_cand (c->dependent), incr,
3062 if (c->dependent)
3063 savings += total_savings (repl_savings, lookup_cand (c->dependent), incr,
3075 MODE and SPEED. FIRST_DEP is the first dependent of the root of
3332 if (c->dependent)
3333 dep_ncd = nearest_common_dominator_for_cands (lookup_cand (c->dependent),
3901 if (c->dependent)
3902 replace_profitable_candidates (lookup_cand (c->dependent));
3916 dependent is the root of a tree of related statements.
3925 if (c->basis != 0 || c->dependent == 0)
3932 first_dep = lookup_cand (c->dependent);
3950 to replace some or all of the dependent candidates, depending
Indexes created Mon Mar 16 00:23:04 UTC 2026