Lines Matching refs:important
153 important ones. */
175 bool important; /* Whether this is an "important" candidate, i.e. such
230 /* A bitmap of important candidates. */
233 /* Whether to consider just related and important candidates when replacing a
479 cand->id, cand->important ? " (important)" : "");
1276 ??? TODO -- it is not really important to handle this case. */
1977 tree base, tree step, bool important, enum iv_position pos,
2048 cand->important = important;
2063 if (important && !cand->important)
2065 cand->important = true;
2067 fprintf (dump_file, "Candidate %d is important\n", cand->id);
2108 tree base, tree step, bool important, struct iv_use *use)
2111 add_candidate_1 (data, base, step, important, IP_NORMAL, use, NULL_TREE);
2114 add_candidate_1 (data, base, step, important, IP_END, use, NULL_TREE);
2199 /* The same, but with initial value zero. Make such variable important,
2240 /* Record important candidates and add them to related_cands bitmaps
2253 if (cand->important)
2272 /* Add important candidates to the related_cands bitmaps. */
2293 /* Record the important candidates. */
5074 /* First try important candidates. Only if it fails, try the specific ones.
5119 if (cand->important)
5367 /* An important special case -- if we are asked to express value of