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 115 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
126 __ mul(r0, r1, r0); | 126 __ mul(r0, r1, r0); |
127 __ sub(r1, r1, Operand(1)); | 127 __ sub(r1, r1, Operand(1)); |
128 | 128 |
129 __ bind(&C); | 129 __ bind(&C); |
130 __ teq(r1, Operand::Zero()); | 130 __ teq(r1, Operand::Zero()); |
131 __ b(ne, &L); | 131 __ b(ne, &L); |
132 __ mov(pc, Operand(lr)); | 132 __ mov(pc, Operand(lr)); |
133 | 133 |
134 // some relocated stuff here, not executed | 134 // some relocated stuff here, not executed |
135 __ RecordComment("dead code, just testing relocations"); | 135 __ RecordComment("dead code, just testing relocations"); |
136 __ mov(r0, Operand(FACTORY->true_value())); | 136 __ mov(r0, Operand(isolate->factory()->true_value())); |
137 __ RecordComment("dead code, just testing immediate operands"); | 137 __ RecordComment("dead code, just testing immediate operands"); |
138 __ mov(r0, Operand(-1)); | 138 __ mov(r0, Operand(-1)); |
139 __ mov(r0, Operand(0xFF000000)); | 139 __ mov(r0, Operand(0xFF000000)); |
140 __ mov(r0, Operand(0xF0F0F0F0)); | 140 __ mov(r0, Operand(0xF0F0F0F0)); |
141 __ mov(r0, Operand(0xFFF0FFFF)); | 141 __ mov(r0, Operand(0xFFF0FFFF)); |
142 | 142 |
143 CodeDesc desc; | 143 CodeDesc desc; |
144 assm.GetCode(&desc); | 144 assm.GetCode(&desc); |
145 Object* code = isolate->heap()->CreateCode( | 145 Object* code = isolate->heap()->CreateCode( |
146 desc, | 146 desc, |
(...skipping 1073 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1220 CHECK_EQ(kArmNanLower32, BitCast<int64_t>(t.add_result) & 0xffffffffu); | 1220 CHECK_EQ(kArmNanLower32, BitCast<int64_t>(t.add_result) & 0xffffffffu); |
1221 CHECK_EQ(kArmNanUpper32, (BitCast<int64_t>(t.sub_result) >> 32) & 0x7fffffff); | 1221 CHECK_EQ(kArmNanUpper32, (BitCast<int64_t>(t.sub_result) >> 32) & 0x7fffffff); |
1222 CHECK_EQ(kArmNanLower32, BitCast<int64_t>(t.sub_result) & 0xffffffffu); | 1222 CHECK_EQ(kArmNanLower32, BitCast<int64_t>(t.sub_result) & 0xffffffffu); |
1223 CHECK_EQ(kArmNanUpper32, (BitCast<int64_t>(t.mul_result) >> 32) & 0x7fffffff); | 1223 CHECK_EQ(kArmNanUpper32, (BitCast<int64_t>(t.mul_result) >> 32) & 0x7fffffff); |
1224 CHECK_EQ(kArmNanLower32, BitCast<int64_t>(t.mul_result) & 0xffffffffu); | 1224 CHECK_EQ(kArmNanLower32, BitCast<int64_t>(t.mul_result) & 0xffffffffu); |
1225 CHECK_EQ(kArmNanUpper32, (BitCast<int64_t>(t.div_result) >> 32) & 0x7fffffff); | 1225 CHECK_EQ(kArmNanUpper32, (BitCast<int64_t>(t.div_result) >> 32) & 0x7fffffff); |
1226 CHECK_EQ(kArmNanLower32, BitCast<int64_t>(t.div_result) & 0xffffffffu); | 1226 CHECK_EQ(kArmNanLower32, BitCast<int64_t>(t.div_result) & 0xffffffffu); |
1227 } | 1227 } |
1228 | 1228 |
1229 #undef __ | 1229 #undef __ |
OLD | NEW |