Chromium Code Reviews| 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 1532 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 1543 HValue* new_left = SimplifiedDividendForMathFloorOfDiv(left); | 1543 HValue* new_left = SimplifiedDividendForMathFloorOfDiv(left); |
| 1544 if (new_left == NULL && | 1544 if (new_left == NULL && |
| 1545 hdiv->observed_input_representation(1).IsSmiOrInteger32()) { | 1545 hdiv->observed_input_representation(1).IsSmiOrInteger32()) { |
| 1546 new_left = new(block()->zone()) | 1546 new_left = new(block()->zone()) |
| 1547 HChange(left, Representation::Integer32(), false, false); | 1547 HChange(left, Representation::Integer32(), false, false); |
| 1548 HChange::cast(new_left)->InsertBefore(this); | 1548 HChange::cast(new_left)->InsertBefore(this); |
| 1549 } | 1549 } |
| 1550 HValue* new_right = | 1550 HValue* new_right = |
| 1551 LChunkBuilder::SimplifiedDivisorForMathFloorOfDiv(right); | 1551 LChunkBuilder::SimplifiedDivisorForMathFloorOfDiv(right); |
| 1552 if (new_right == NULL && | 1552 if (new_right == NULL && |
| 1553 #ifdef V8_TARGET_ARCH_ARM | |
|
Sven Panne
2013/06/14 20:05:25
o_O I think we're doing something fundamentally wr
| |
| 1554 CpuFeatures::IsSupported(SUDIV) && | |
| 1555 #endif | |
| 1553 hdiv->observed_input_representation(2).IsSmiOrInteger32()) { | 1556 hdiv->observed_input_representation(2).IsSmiOrInteger32()) { |
| 1554 new_right = new(block()->zone()) | 1557 new_right = new(block()->zone()) |
| 1555 HChange(right, Representation::Integer32(), false, false); | 1558 HChange(right, Representation::Integer32(), false, false); |
| 1556 HChange::cast(new_right)->InsertBefore(this); | 1559 HChange::cast(new_right)->InsertBefore(this); |
| 1557 } | 1560 } |
| 1558 | 1561 |
| 1559 // Return if left or right are not optimizable. | 1562 // Return if left or right are not optimizable. |
| 1560 if ((new_left == NULL) || (new_right == NULL)) return this; | 1563 if ((new_left == NULL) || (new_right == NULL)) return this; |
| 1561 | 1564 |
| 1562 // Insert the new values in the graph. | 1565 // Insert the new values in the graph. |
| (...skipping 2303 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 3866 case kBackingStore: | 3869 case kBackingStore: |
| 3867 if (!name_.is_null()) stream->Add(*String::cast(*name_)->ToCString()); | 3870 if (!name_.is_null()) stream->Add(*String::cast(*name_)->ToCString()); |
| 3868 stream->Add("[backing-store]"); | 3871 stream->Add("[backing-store]"); |
| 3869 break; | 3872 break; |
| 3870 } | 3873 } |
| 3871 | 3874 |
| 3872 stream->Add("@%d", offset()); | 3875 stream->Add("@%d", offset()); |
| 3873 } | 3876 } |
| 3874 | 3877 |
| 3875 } } // namespace v8::internal | 3878 } } // namespace v8::internal |
| OLD | NEW |