Lines Matching refs:first
151 sorted in the order of first-to-be-allocated first. */
605 first try allocating in the class that is cheapest
1004 we want to give the lower-priority allocno the first chance for
1038 The registers marked in PREFREGS are tried first.
1087 In the first pass, skip registers that are preferred by some other pseudo
1090 However, we never allocate a register for the first time in pass 0. */
1266 /* Count from the end, to find the least-used ones first. */
1398 first try allocating in the class that is cheapest
1437 record conflicts first with hard regs,
1661 that SRC is a register. If SRC or the first operand of SRC is a register,
1855 build_insn_chain (rtx first)
1863 for (; first; first = NEXT_INSN (first))
1867 if (first == BB_HEAD (b))
1883 if (!NOTE_P (first) && !BARRIER_P (first))
1890 c->insn = first;
1893 if (INSN_P (first))
1899 for (link = REG_NOTES (first); link; link = XEXP (link, 1))
1909 note_stores (PATTERN (first), reg_becomes_live,
1915 if (INSN_P (first))
1921 for (link = REG_NOTES (first); link; link = XEXP (link, 1))
1929 if (first == BB_END (b))
1941 for (first = NEXT_INSN (first); first; first = NEXT_INSN (first))
1942 gcc_assert (!INSN_P (first)
1943 || GET_CODE (PATTERN (first)) == USE
1944 || ((GET_CODE (PATTERN (first)) == ADDR_VEC
1945 || GET_CODE (PATTERN (first)) == ADDR_DIFF_VEC)
1946 && prev_real_insn (first) != 0
1947 && JUMP_P (prev_real_insn (first))));
2049 The standard GCC live information means only the first condition.
2457 insn if the pseudo-register is used first time in given BB