OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 1136 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1147 | 1147 |
1148 | 1148 |
1149 void LCodeGen::EmitSignedIntegerDivisionByConstant( | 1149 void LCodeGen::EmitSignedIntegerDivisionByConstant( |
1150 Register result, | 1150 Register result, |
1151 Register dividend, | 1151 Register dividend, |
1152 int32_t divisor, | 1152 int32_t divisor, |
1153 Register remainder, | 1153 Register remainder, |
1154 Register scratch, | 1154 Register scratch, |
1155 LEnvironment* environment) { | 1155 LEnvironment* environment) { |
1156 ASSERT(!AreAliased(dividend, scratch, at, no_reg)); | 1156 ASSERT(!AreAliased(dividend, scratch, at, no_reg)); |
1157 ASSERT(LChunkBuilder::HasMagicNumberForDivisor(divisor)); | |
1158 | 1157 |
1159 uint32_t divisor_abs = abs(divisor); | 1158 uint32_t divisor_abs = abs(divisor); |
1160 | 1159 |
1161 int32_t power_of_2_factor = | 1160 int32_t power_of_2_factor = |
1162 CompilerIntrinsics::CountTrailingZeros(divisor_abs); | 1161 CompilerIntrinsics::CountTrailingZeros(divisor_abs); |
1163 | 1162 |
1164 switch (divisor_abs) { | 1163 switch (divisor_abs) { |
1165 case 0: | 1164 case 0: |
1166 DeoptimizeIf(al, environment); | 1165 DeoptimizeIf(al, environment); |
1167 return; | 1166 return; |
(...skipping 4678 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
5846 __ Subu(scratch, result, scratch); | 5845 __ Subu(scratch, result, scratch); |
5847 __ lw(result, FieldMemOperand(scratch, | 5846 __ lw(result, FieldMemOperand(scratch, |
5848 FixedArray::kHeaderSize - kPointerSize)); | 5847 FixedArray::kHeaderSize - kPointerSize)); |
5849 __ bind(&done); | 5848 __ bind(&done); |
5850 } | 5849 } |
5851 | 5850 |
5852 | 5851 |
5853 #undef __ | 5852 #undef __ |
5854 | 5853 |
5855 } } // namespace v8::internal | 5854 } } // namespace v8::internal |
OLD | NEW |