Lines Matching defs:then
1317 JumpTarget then;
1320 LoadConditionAndSpill(node->condition(), &then, &else_, true);
1324 // then
1325 if (frame_ != NULL || then.is_linked()) {
1326 then.Bind();
1341 JumpTarget then;
1343 LoadConditionAndSpill(node->condition(), &then, &exit, true);
1347 // then
1348 if (frame_ != NULL || then.is_linked()) {
1349 then.Bind();
2187 // state in r2, then jump around the unlink blocks if any.
2369 JumpTarget then;
2371 LoadConditionAndSpill(node->condition(), &then, &else_, true);
2375 if (has_valid_frame() || then.is_linked()) {
2376 then.Bind();
2984 // call. Then
3814 // since the stack top is cached in r0, popping and then
4308 // At this point if instanceof succeeded then r0 == 0.
4864 // The two objects are identical. If we know that one of them isn't NaN then
4872 // Smis. If it's not a heap number, then return equal.
4972 // If rhs is not a number and lhs is a Smi then strict equality cannot
5011 // If lhs is not a number and rhs is a smi then strict equality cannot
5113 // If exponents are equal then return 0.
5140 // If either operand is a JSObject or an oddball value, then they are
5188 // Both are heap numbers. Load them up then jump to the code we have
5240 // If either is a Smi (we know that not both are), then they can only
5276 // If one of the sides was a NaN then the v flag is set. Load r0 with
5307 // that case. If the inputs are not doubles then jumps to check_for_symbols.
5602 // If we did not inline the operation, then the arguments are in:
5663 // If we have a match of the int32-but-not-Smi exponent then skip some logic.
5665 // If the exponent is higher than that then go to slow case. This catches
5670 // 0 (biased) then the number is smaller in magnitude than 1.0 * 2^0, ie
5827 // If all else failed then we go to the runtime system.
6058 // Unfortunately if the answer is 0 then we must return -0. And we
6158 // because then the 0s get shifted into bit 30 instead of bit 31.
7231 // If either r2 or r6 had the smi tag bit set, then carry is set now.
