Lines Matching defs:last

272    Instead, we store below the value last assigned to CC0.  If it should
324 /* The SUBREG that was set when REG_TICK was last incremented. Set
325 to -1 if the last store was to the whole register, not a subreg. */
515 /* Get the SUBREG set at the last increment to REG_TICK (-1 if not a
559 rtx last;
957 struct table_elt *last = first;
961 while (last->next_same_hash != NULL)
962 last = last->next_same_hash;
967 last->next_same_hash = free_element_chain;
1152 the last store to this register really stored into this
1576 /* Put it after the last element cheaper than X. */
2436 /* If we are about to do the last recursive call
6063 the last insn of a libcall. In this case, we only need
6750 the total number of SETs in all the insns of the block, the last insn of the
6775 /* Update the previous branch path, if any. If the last branch was
6885 didn't see this branch the last time around (when the
6937 data->last = p;
7020 insn = (val.last ? NEXT_INSN (val.last) : 0);
7031 INSN_UID (insn), val.last ? INSN_UID (val.last) : 0,
7043 cse_basic_block (insn, val.last, val.path);
7053 temp = cse_basic_block (insn, val.last, val.path);
7132 /* Set the last insn as the jump insn; it doesn't affect cc0.
7157 we do not want to record destinations. The last insn of a
7168 /* Keep libcall_insn for the last SET insn of a no-conflict
7196 basic block by pretending that we just did the last insn in the
7236 /* If TO was the last insn in the function, we are done. */
7269 to = val.last;
7567 /* Go from the last insn to the first and delete insns that only set unused
7571 The first jump optimization pass may leave a real insn as the last