OLD | NEW |
1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 2321 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2332 Result constant_operand(value); | 2332 Result constant_operand(value); |
2333 if (reversed) { | 2333 if (reversed) { |
2334 answer = LikelySmiBinaryOperation(expr, &constant_operand, operand, | 2334 answer = LikelySmiBinaryOperation(expr, &constant_operand, operand, |
2335 overwrite_mode); | 2335 overwrite_mode); |
2336 } else { | 2336 } else { |
2337 answer = LikelySmiBinaryOperation(expr, operand, &constant_operand, | 2337 answer = LikelySmiBinaryOperation(expr, operand, &constant_operand, |
2338 overwrite_mode); | 2338 overwrite_mode); |
2339 } | 2339 } |
2340 } | 2340 } |
2341 break; | 2341 break; |
| 2342 |
2342 // Generate inline code for mod of powers of 2 and negative powers of 2. | 2343 // Generate inline code for mod of powers of 2 and negative powers of 2. |
2343 case Token::MOD: | 2344 case Token::MOD: |
2344 if (!reversed && | 2345 if (!reversed && |
2345 int_value != 0 && | 2346 int_value != 0 && |
2346 (IsPowerOf2(int_value) || IsPowerOf2(-int_value))) { | 2347 (IsPowerOf2(int_value) || IsPowerOf2(-int_value))) { |
2347 operand->ToRegister(); | 2348 operand->ToRegister(); |
2348 frame_->Spill(operand->reg()); | 2349 frame_->Spill(operand->reg()); |
2349 DeferredCode* deferred = | 2350 DeferredCode* deferred = |
2350 new DeferredInlineSmiOperation(op, | 2351 new DeferredInlineSmiOperation(op, |
2351 operand->reg(), | 2352 operand->reg(), |
(...skipping 10580 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
12932 | 12933 |
12933 // Call the runtime; it returns -1 (less), 0 (equal), or 1 (greater) | 12934 // Call the runtime; it returns -1 (less), 0 (equal), or 1 (greater) |
12934 // tagged as a small integer. | 12935 // tagged as a small integer. |
12935 __ bind(&runtime); | 12936 __ bind(&runtime); |
12936 __ TailCallRuntime(Runtime::kStringCompare, 2, 1); | 12937 __ TailCallRuntime(Runtime::kStringCompare, 2, 1); |
12937 } | 12938 } |
12938 | 12939 |
12939 #undef __ | 12940 #undef __ |
12940 | 12941 |
12941 } } // namespace v8::internal | 12942 } } // namespace v8::internal |
OLD | NEW |