Lines Matching full:divisor
1274 LDivByPowerOf2I(LOperand* dividend, int32_t divisor) {
1276 divisor_ = divisor;
1280 int32_t divisor() const { return divisor_; }
1292 LDivByConstI(LOperand* dividend, int32_t divisor, LOperand* temp) {
1294 divisor_ = divisor;
1299 int32_t divisor() const { return divisor_; }
1312 LDivI(LOperand* dividend, LOperand* divisor, LOperand* temp) {
1314 inputs_[1] = divisor;
1319 LOperand* divisor() { return inputs_[1]; }
1894 LFlooringDivByPowerOf2I(LOperand* dividend, int32_t divisor) {
1896 divisor_ = divisor;
1900 int32_t divisor() const { return divisor_; }
1913 LFlooringDivByConstI(LOperand* dividend, int32_t divisor, LOperand* temp) {
1915 divisor_ = divisor;
1920 int32_t divisor() const { return divisor_; }
1933 LFlooringDivI(LOperand* dividend, LOperand* divisor, LOperand* temp) {
1935 inputs_[1] = divisor;
1940 LOperand* divisor() { return inputs_[1]; }
2026 LModByPowerOf2I(LOperand* dividend, int32_t divisor) {
2028 divisor_ = divisor;
2032 int32_t divisor() const { return divisor_; }
2044 LModByConstI(LOperand* dividend, int32_t divisor, LOperand* temp) {
2046 divisor_ = divisor;
2051 int32_t divisor() const { return divisor_; }
3021 static bool HasMagicNumberForDivision(int32_t divisor);
