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 943 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
954 Label* slow, | 954 Label* slow, |
955 Condition cc) { | 955 Condition cc) { |
956 Label not_identical; | 956 Label not_identical; |
957 Label heap_number, return_equal; | 957 Label heap_number, return_equal; |
958 Register exp_mask_reg = t5; | 958 Register exp_mask_reg = t5; |
959 | 959 |
960 __ Branch(¬_identical, ne, a0, Operand(a1)); | 960 __ Branch(¬_identical, ne, a0, Operand(a1)); |
961 | 961 |
962 __ li(exp_mask_reg, Operand(HeapNumber::kExponentMask)); | 962 __ li(exp_mask_reg, Operand(HeapNumber::kExponentMask)); |
963 | 963 |
964 // Test for NaN. Sadly, we can't just compare to factory->nan_value(), | 964 // Test for NaN. Sadly, we can't just compare to Factory::nan_value(), |
965 // so we do the second best thing - test it ourselves. | 965 // so we do the second best thing - test it ourselves. |
966 // They are both equal and they are not both Smis so both of them are not | 966 // They are both equal and they are not both Smis so both of them are not |
967 // Smis. If it's not a heap number, then return equal. | 967 // Smis. If it's not a heap number, then return equal. |
968 if (cc == less || cc == greater) { | 968 if (cc == less || cc == greater) { |
969 __ GetObjectType(a0, t4, t4); | 969 __ GetObjectType(a0, t4, t4); |
970 __ Branch(slow, greater, t4, Operand(FIRST_SPEC_OBJECT_TYPE)); | 970 __ Branch(slow, greater, t4, Operand(FIRST_SPEC_OBJECT_TYPE)); |
971 } else { | 971 } else { |
972 __ GetObjectType(a0, t4, t4); | 972 __ GetObjectType(a0, t4, t4); |
973 __ Branch(&heap_number, eq, t4, Operand(HEAP_NUMBER_TYPE)); | 973 __ Branch(&heap_number, eq, t4, Operand(HEAP_NUMBER_TYPE)); |
974 // Comparing JS objects with <=, >= is complicated. | 974 // Comparing JS objects with <=, >= is complicated. |
(...skipping 6766 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
7741 __ Jump(generic_construct_stub, RelocInfo::CODE_TARGET); | 7741 __ Jump(generic_construct_stub, RelocInfo::CODE_TARGET); |
7742 } | 7742 } |
7743 } | 7743 } |
7744 | 7744 |
7745 | 7745 |
7746 #undef __ | 7746 #undef __ |
7747 | 7747 |
7748 } } // namespace v8::internal | 7748 } } // namespace v8::internal |
7749 | 7749 |
7750 #endif // V8_TARGET_ARCH_MIPS | 7750 #endif // V8_TARGET_ARCH_MIPS |
OLD | NEW |