Home | History | Annotate | Download | only in mips

Lines Matching full:divisor

599   LModByPowerOf2I(LOperand* dividend, int32_t divisor) {
601 divisor_ = divisor;
605 int32_t divisor() const { return divisor_; }
617 LModByConstI(LOperand* dividend, int32_t divisor) {
619 divisor_ = divisor;
623 int32_t divisor() const { return divisor_; }
651 LDivByPowerOf2I(LOperand* dividend, int32_t divisor) {
653 divisor_ = divisor;
657 int32_t divisor() const { return divisor_; }
669 LDivByConstI(LOperand* dividend, int32_t divisor) {
671 divisor_ = divisor;
675 int32_t divisor() const { return divisor_; }
687 LDivI(LOperand* dividend, LOperand* divisor, LOperand* temp) {
689 inputs_[1] = divisor;
694 LOperand* divisor() { return inputs_[1]; }
704 LFlooringDivByPowerOf2I(LOperand* dividend, int32_t divisor) {
706 divisor_ = divisor;
710 int32_t divisor() { return divisor_; }
723 LFlooringDivByConstI(LOperand* dividend, int32_t divisor, LOperand* temp) {
725 divisor_ = divisor;
730 int32_t divisor() const { return divisor_; }
743 LFlooringDivI(LOperand* dividend, LOperand* divisor) {
745 inputs_[1] = divisor;
749 LOperand* divisor() { return inputs_[1]; }
2625 static bool HasMagicNumberForDivisor(int32_t divisor);