Lines Matching defs:last
72 /* Is this the last tuple in the clause */
73 bool last;
303 bi_instr *last = st.instructions[st.count - 1];
304 if (last->branch_target || last->op == BI_OPCODE_JUMP) {
568 /* Architecturally, no single instruction has a "not last" constraint. However,
570 * paired instructions) can run afoul of the "no two writes on the last clause"
1050 if (bi_opcode_props[instr->op].last && !tuple->last)
1053 if (bi_must_not_last(instr) && tuple->last)
1116 if (tuple->last && total_writes > 1)
1168 if (bi_opcode_props[instr->op].last)
1616 bool last = (i + 1) == constant_count;
1644 /* However, we can't swap the last constant, so we
1646 if (last && swap) {
1653 assert(!last);
1675 /* The last clause can only write one instruction, so initialize that */
1691 .last = (clause->tuple_count == 0),
1783 * last instruction" constraint */
1789 bool insert_empty = tuple_state.last && not_last;
1871 /* Branches must be last, so this can be factored out */
1872 bi_instr *last = clause->tuples[max_tuples - 1].add;
1873 clause->next_clause_prefetch = !last || (last->op != BI_OPCODE_JUMP);
1917 /* Back-to-back bit affects only the last clause of a block,