Lines Matching defs:lhs
263 Node* BuildUint32Mod(Node* lhs, Node* rhs);
2075 Node* lhs = node->InputAt(1);
2085 Node* value = __ Call(call_descriptor, __ HeapConstant(callable.code()), lhs,
2093 Node* lhs = node->InputAt(0);
2096 Node* value = __ Int32AddWithOverflow(lhs, rhs);
2105 Node* lhs = node->InputAt(0);
2108 Node* value = __ Int32SubWithOverflow(lhs, rhs);
2117 Node* lhs = node->InputAt(0);
2125 // check to see if the relevant least significant bits of the {lhs}
2128 // right shift on {lhs}).
2132 Node* check = __ Word32Equal(__ Word32And(lhs, mask), zero);
2135 return __ Word32Sar(lhs, shift);
2148 __ Goto(&done, __ Int32Div(lhs, rhs));
2161 // Check if {lhs} is zero, as that would produce minus zero.
2162 Node* check_lhs_zero = __ Word32Equal(lhs, zero);
2166 // Check if {lhs} is kMinInt and {rhs} is -1, in which case we'd have
2168 Node* check_lhs_minint = __ Word32Equal(lhs, __ Int32Constant(kMinInt));
2179 __ Goto(&done, __ Int32Div(lhs, rhs));
2185 __ Goto(&done, __ Int32Div(lhs, rhs));
2193 Node* check = __ Word32Equal(lhs, __ Int32Mul(value, rhs));
2230 Node* EffectControlLinearizer::BuildUint32Mod(Node* lhs, Node* rhs) {
2243 __ Goto(&done, __ Uint32Mod(lhs, rhs));
2249 __ Goto(&done, __ Word32And(lhs, msk));
2265 // if lhs < 0 then
2271 // if lhs < 0 then
2278 // lhs & msk
2280 // lhs % rhs
2282 Node* lhs = node->InputAt(0);
2313 __ GotoIf(__ Int32LessThan(lhs, zero), &if_lhs_negative);
2315 // The {lhs} is a non-negative integer.
2316 __ Goto(&done, BuildUint32Mod(lhs, rhs));
2321 // The {lhs} is a negative integer. This is very unlikely and
2325 Node* res = __ Uint32Mod(__ Int32Sub(zero, lhs), rhs);
2339 Node* lhs = node->InputAt(0);
2347 // check to see if the relevant least significant bits of the {lhs}
2350 // shift on {lhs}).
2354 Node* check = __ Word32Equal(__ Word32And(lhs, mask), zero);
2357 return __ Word32Shr(lhs, shift);
2365 Node* value = __ Uint32Div(lhs, rhs);
2368 check = __ Word32Equal(lhs, __ Int32Mul(rhs, value));
2377 Node* lhs = node->InputAt(0);
2388 return BuildUint32Mod(lhs, rhs);
2394 Node* lhs = node->InputAt(0);
2397 Node* projection = __ Int32MulWithOverflow(lhs, rhs);
2414 Node* check_or = __ Int32LessThan(__ Word32Or(lhs, rhs), zero);
3751 Node* lhs = node->InputAt(0);
3761 return __ Call(call_descriptor, __ HeapConstant(callable.code()), lhs, rhs,
3766 Node* lhs = node->InputAt(0);
3776 return __ Call(call_descriptor, __ HeapConstant(callable.code()), lhs, rhs,
3781 Node* lhs = node->InputAt(0);
3787 __ GotoIf(__ Float64Equal(lhs, rhs), &is_float64_equal);
3789 // Return true iff both {lhs} and {rhs} are NaN.
3790 __ GotoIf(__ Float64Equal(lhs, lhs), &done, __ Int32Constant(0));
3797 Node* lhs_hi = __ Float64ExtractHighWord32(lhs);
4315 Node* lhs = node->InputAt(0);
4323 return __ Call(call_descriptor, __ HeapConstant(callable.code()), lhs, rhs,
4359 Node* lhs = node->InputAt(0);
4368 Node* value = __ Call(call_descriptor, __ HeapConstant(callable.code()), lhs,
4380 Node* lhs = node->InputAt(0);
4389 Node* value = __ Call(call_descriptor, __ HeapConstant(callable.code()), lhs,