• Home
  • Raw
  • Download

Lines Matching refs:NA

502                     if (arg != NA) { live[arg] = true; }  in eliminate_dead_code()
533 std::vector<Val> new_id(program.size(), NA); in eliminate_dead_code()
538 if (*arg != NA) { in eliminate_dead_code()
540 SkASSERT(*arg != NA); in eliminate_dead_code()
571 if (arg != NA) { optimized[arg].death = id; } in finalize()
585 if (arg != NA) { inst.can_hoist &= optimized[arg].can_hoist; } in finalize()
594 if (arg != NA && optimized[arg].can_hoist) { in finalize()
680 (void)push(Op::trace_line, mask.id,NA,NA,NA, line); in trace_line()
684 (void)push(Op::trace_var, mask.id,val.id,NA,NA, slot, kVarTypeInt.bits); in trace_var()
688 (void)push(Op::trace_var, mask.id,val.id,NA,NA, slot, kVarTypeFloat.bits); in trace_var()
693 (void)push(Op::trace_var, mask.id,val.id,NA,NA, slot, kVarTypeBool.bits); in trace_var()
697 (void)push(Op::trace_call, mask.id,NA,NA,NA, line, kCallTypeEnter.bits); in trace_call_enter()
701 (void)push(Op::trace_call, mask.id,NA,NA,NA, line, kCallTypeExit.bits); in trace_call_exit()
704 void Builder::store8 (Ptr ptr, I32 val) { (void)push(Op::store8 , val.id,NA,NA,NA, ptr.ix); } in store8()
705 void Builder::store16(Ptr ptr, I32 val) { (void)push(Op::store16, val.id,NA,NA,NA, ptr.ix); } in store16()
706 void Builder::store32(Ptr ptr, I32 val) { (void)push(Op::store32, val.id,NA,NA,NA, ptr.ix); } in store32()
708 (void)push(Op::store64, lo.id,hi.id,NA,NA, ptr.ix); in store64()
716 I32 Builder::load8 (Ptr ptr) { return {this, push(Op::load8 , NA,NA,NA,NA, ptr.ix) }; } in load8()
717 I32 Builder::load16(Ptr ptr) { return {this, push(Op::load16, NA,NA,NA,NA, ptr.ix) }; } in load16()
718 I32 Builder::load32(Ptr ptr) { return {this, push(Op::load32, NA,NA,NA,NA, ptr.ix) }; } in load32()
720 return {this, push(Op::load64 , NA,NA,NA,NA, ptr.ix,lane) }; in load64()
723 return {this, push(Op::load128, NA,NA,NA,NA, ptr.ix,lane) }; in load128()
727 return {this, push(Op::gather8 , index.id,NA,NA,NA, ptr.ix,offset)}; in gather8()
730 return {this, push(Op::gather16, index.id,NA,NA,NA, ptr.ix,offset)}; in gather16()
733 return {this, push(Op::gather32, index.id,NA,NA,NA, ptr.ix,offset)}; in gather32()
737 return {this, push(Op::uniform32, NA,NA,NA,NA, ptr.ix, offset)}; in uniform32()
742 return {this, push(Op::array32, NA,NA,NA,NA, ptr.ix, offset, index * sizeof(int))}; in array32()
745 I32 Builder::splat(int n) { return {this, push(Op::splat, NA,NA,NA,NA, n) }; } in splat()
1009 return {this, this->push(Op::shl_i32, x.id,NA,NA,NA, bits)}; in shl()
1014 return {this, this->push(Op::shr_i32, x.id,NA,NA,NA, bits)}; in shr()
1019 return {this, this->push(Op::sra_i32, x.id,NA,NA,NA, bits)}; in sra()
3130 if (input != NA && instructions[input].death == id) { in setupInterpreter()
3172 return id == NA ? (Reg)0 in setupInterpreter()
3232 constexpr Val RES = NA-1, in jit()
3236 std::vector<int> stack_slot(instructions.size(), NA); in jit()
3254 NA, NA, NA, NA, NA, NA,RES,RES, in jit()
3292 regs[r] = NA; in jit()
3329 NA,NA,NA,NA, NA,NA,NA,NA, in jit()
3330 NA,NA,NA,NA, NA,NA,NA,NA, in jit()
3355 SkASSERT(stack_slot[v] != NA); in jit()
3373 NA, NA, NA, NA, NA, NA, NA, NA, in jit()
3375 NA, NA, NA, NA, NA, NA, NA, NA, in jit()
3376 NA, NA, NA, NA, NA, NA, NA, NA, in jit()
3391 SkASSERT(stack_slot[v] != NA); in jit()
3425 return stack_slot[v] == NA // We haven't spilled it already? in jit()
3437 if (v == NA) { in jit()
3473 SkASSERT(v == NA || v >= 0); in jit()
3488 regs[r] = NA; in jit()
3492 int rd = NA, in jit()
3493 rx = NA, in jit()
3494 ry = NA, in jit()
3495 rz = NA, in jit()
3496 rw = NA; in jit()
3509 if (v == id && rd != NA) { return rd; } in jit()
3510 if (v == x && rx != NA) { return rx; } in jit()
3511 if (v == y && ry != NA) { return ry; } in jit()
3512 if (v == z && rz != NA) { return rz; } in jit()
3513 if (v == w && rw != NA) { return rw; } in jit()
3521 return NA; in jit()
3529 if (int found = find_existing_reg(v); found != NA) { in jit()
3564 auto dst = [&](Val hint1 = NA, Val hint2 = NA) -> Reg { in jit()
3565 if (hint1 != NA && try_alias(hint1)) { return r(id); } in jit()
3566 if (hint2 != NA && try_alias(hint2)) { return r(id); } in jit()
3585 if (int found = find_existing_reg(v); found != NA) { in jit()
3597 return find_existing_reg(v) != NA; in jit()
4239 if (rd != NA && dies_here(regs[rd])) { regs[rd] = NA; } in jit()
4240 if (rx != NA && regs[rx] != NA && dies_here(regs[rx])) { regs[rx] = NA; } in jit()
4241 if (ry != NA && regs[ry] != NA && dies_here(regs[ry])) { regs[ry] = NA; } in jit()
4242 if (rz != NA && regs[rz] != NA && dies_here(regs[rz])) { regs[rz] = NA; } in jit()
4243 if (rw != NA && regs[rw] != NA && dies_here(regs[rw])) { regs[rw] = NA; } in jit()