Searched refs:end2 (Results 1 – 3 of 3) sorted by path
1247 ir_insn *end2 = &ctx->ir_base[end2_ref]; in ir_try_remove_empty_diamond() local1307 MAKE_NOP(end2); CLEAR_USES(end2_ref); in ir_try_remove_empty_diamond()1395 ir_insn *end2 = &ctx->ir_base[end2_ref]; in ir_optimize_phi() local1757 ir_insn *end2 = &ctx->ir_base[end2_ref]; in ir_try_split_if() local1771 SWAP_INSNS(end1, end2); in ir_try_split_if()1885 end2->op2 = cond->op3; in ir_try_split_if()1905 if (ctx->ir_base[end2->op1].op == IR_BEGIN || ctx->ir_base[end2->op1].op == IR_MERGE) { in ir_try_split_if()1906 ir_bitqueue_add(worklist, end2->op1); in ir_try_split_if()1955 SWAP_INSNS(end1, end2); in ir_try_split_if_cmp()2080 end2->op2 = insn->op2; in ir_try_split_if_cmp()[all …]
5373 struct sljit_jump *end2 = NULL; in mainloop_entry() local5451 end2 = CMP(SLJIT_LESS_EQUAL, TMP2, 0, STR_END, 0); in mainloop_entry()5453 JUMPHERE(end2); in mainloop_entry()5474 end2 = JUMP(SLJIT_JUMP); in mainloop_entry()5551 JUMPHERE(end2); in mainloop_entry()
3621 const char *end2 = (char *) txt2 + len2; local3627 for (q = (char *) txt2; q < end2; q++) {3628 for (l = 0; (p + l < end1) && (q + l < end2) && (p[l] == q[l]); l++);
Completed in 81 milliseconds