Home | History | Annotate | Download | only in mips64

Lines Matching full:divisor

602   LModByPowerOf2I(LOperand* dividend, int32_t divisor) {
604 divisor_ = divisor;
608 int32_t divisor() const { return divisor_; }
620 LModByConstI(LOperand* dividend, int32_t divisor) {
622 divisor_ = divisor;
626 int32_t divisor() const { return divisor_; }
654 LDivByPowerOf2I(LOperand* dividend, int32_t divisor) {
656 divisor_ = divisor;
660 int32_t divisor() const { return divisor_; }
672 LDivByConstI(LOperand* dividend, int32_t divisor) {
674 divisor_ = divisor;
678 int32_t divisor() const { return divisor_; }
690 LDivI(LOperand* dividend, LOperand* divisor, LOperand* temp) {
692 inputs_[1] = divisor;
697 LOperand* divisor() { return inputs_[1]; }
707 LFlooringDivByPowerOf2I(LOperand* dividend, int32_t divisor) {
709 divisor_ = divisor;
713 int32_t divisor() { return divisor_; }
726 LFlooringDivByConstI(LOperand* dividend, int32_t divisor, LOperand* temp) {
728 divisor_ = divisor;
733 int32_t divisor() const { return divisor_; }
746 LFlooringDivI(LOperand* dividend, LOperand* divisor) {
748 inputs_[1] = divisor;
752 LOperand* divisor() { return inputs_[1]; }
2671 static bool HasMagicNumberForDivisor(int32_t divisor);