| 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 13 matching lines...) Expand all Loading... |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 | 28 |
| 29 #include "v8.h" | 29 #include "v8.h" |
| 30 | 30 |
| 31 #include "bootstrapper.h" | 31 #include "bootstrapper.h" |
| 32 #include "codegen-inl.h" | 32 #include "codegen-inl.h" |
| 33 #include "debug.h" | 33 #include "debug.h" |
| 34 #include "ic-inl.h" |
| 34 #include "parser.h" | 35 #include "parser.h" |
| 35 #include "register-allocator-inl.h" | 36 #include "register-allocator-inl.h" |
| 36 #include "runtime.h" | 37 #include "runtime.h" |
| 37 #include "scopes.h" | 38 #include "scopes.h" |
| 38 #include "compiler.h" | 39 #include "compiler.h" |
| 39 | 40 |
| 40 | 41 |
| 41 | 42 |
| 42 namespace v8 { | 43 namespace v8 { |
| 43 namespace internal { | 44 namespace internal { |
| (...skipping 246 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 290 void CodeGenerator::GenerateIsNonNegativeSmi(ZoneList<Expression*>* args) { | 291 void CodeGenerator::GenerateIsNonNegativeSmi(ZoneList<Expression*>* args) { |
| 291 UNIMPLEMENTED_MIPS(); | 292 UNIMPLEMENTED_MIPS(); |
| 292 } | 293 } |
| 293 | 294 |
| 294 | 295 |
| 295 void CodeGenerator::GenerateMathPow(ZoneList<Expression*>* args) { | 296 void CodeGenerator::GenerateMathPow(ZoneList<Expression*>* args) { |
| 296 UNIMPLEMENTED_MIPS(); | 297 UNIMPLEMENTED_MIPS(); |
| 297 } | 298 } |
| 298 | 299 |
| 299 | 300 |
| 301 void CodeGenerator::GenerateMathCos(ZoneList<Expression*>* args) { |
| 302 UNIMPLEMENTED_MIPS(); |
| 303 } |
| 304 |
| 305 |
| 306 void CodeGenerator::GenerateMathSin(ZoneList<Expression*>* args) { |
| 307 UNIMPLEMENTED_MIPS(); |
| 308 } |
| 309 |
| 310 |
| 300 void CodeGenerator::GenerateMathSqrt(ZoneList<Expression*>* args) { | 311 void CodeGenerator::GenerateMathSqrt(ZoneList<Expression*>* args) { |
| 301 UNIMPLEMENTED_MIPS(); | 312 UNIMPLEMENTED_MIPS(); |
| 302 } | 313 } |
| 303 | 314 |
| 304 | 315 |
| 305 // This should generate code that performs a charCodeAt() call or returns | 316 // This should generate code that performs a charCodeAt() call or returns |
| 306 // undefined in order to trigger the slow case, Runtime_StringCharCodeAt. | 317 // undefined in order to trigger the slow case, Runtime_StringCharCodeAt. |
| 307 // It is not yet implemented on ARM, so it always goes to the slow case. | 318 // It is not yet implemented on ARM, so it always goes to the slow case. |
| 308 void CodeGenerator::GenerateFastCharCodeAt(ZoneList<Expression*>* args) { | 319 void CodeGenerator::GenerateFastCharCodeAt(ZoneList<Expression*>* args) { |
| 309 UNIMPLEMENTED_MIPS(); | 320 UNIMPLEMENTED_MIPS(); |
| (...skipping 18 matching lines...) Expand all Loading... |
| 328 void CodeGenerator::GenerateIsConstructCall(ZoneList<Expression*>* args) { | 339 void CodeGenerator::GenerateIsConstructCall(ZoneList<Expression*>* args) { |
| 329 UNIMPLEMENTED_MIPS(); | 340 UNIMPLEMENTED_MIPS(); |
| 330 } | 341 } |
| 331 | 342 |
| 332 | 343 |
| 333 void CodeGenerator::GenerateArgumentsLength(ZoneList<Expression*>* args) { | 344 void CodeGenerator::GenerateArgumentsLength(ZoneList<Expression*>* args) { |
| 334 UNIMPLEMENTED_MIPS(); | 345 UNIMPLEMENTED_MIPS(); |
| 335 } | 346 } |
| 336 | 347 |
| 337 | 348 |
| 338 void CodeGenerator::GenerateArgumentsAccess(ZoneList<Expression*>* args) { | 349 void CodeGenerator::GenerateArguments(ZoneList<Expression*>* args) { |
| 339 UNIMPLEMENTED_MIPS(); | 350 UNIMPLEMENTED_MIPS(); |
| 340 } | 351 } |
| 341 | 352 |
| 342 | 353 |
| 343 void CodeGenerator::GenerateRandomPositiveSmi(ZoneList<Expression*>* args) { | 354 void CodeGenerator::GenerateRandomPositiveSmi(ZoneList<Expression*>* args) { |
| 344 UNIMPLEMENTED_MIPS(); | 355 UNIMPLEMENTED_MIPS(); |
| 345 } | 356 } |
| 346 | 357 |
| 347 | 358 |
| 348 void CodeGenerator::GenerateObjectEquals(ZoneList<Expression*>* args) { | 359 void CodeGenerator::GenerateObjectEquals(ZoneList<Expression*>* args) { |
| (...skipping 73 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 422 | 433 |
| 423 #ifdef DEBUG | 434 #ifdef DEBUG |
| 424 bool CodeGenerator::HasValidEntryRegisters() { return true; } | 435 bool CodeGenerator::HasValidEntryRegisters() { return true; } |
| 425 #endif | 436 #endif |
| 426 | 437 |
| 427 | 438 |
| 428 #undef __ | 439 #undef __ |
| 429 #define __ ACCESS_MASM(masm) | 440 #define __ ACCESS_MASM(masm) |
| 430 | 441 |
| 431 | 442 |
| 443 Handle<Code> GetBinaryOpStub(int key, BinaryOpIC::TypeInfo type_info) { |
| 444 return Handle<Code>::null(); |
| 445 } |
| 446 |
| 447 |
| 432 // On entry a0 and a1 are the things to be compared. On exit v0 is 0, | 448 // On entry a0 and a1 are the things to be compared. On exit v0 is 0, |
| 433 // positive or negative to indicate the result of the comparison. | 449 // positive or negative to indicate the result of the comparison. |
| 434 void CompareStub::Generate(MacroAssembler* masm) { | 450 void CompareStub::Generate(MacroAssembler* masm) { |
| 435 UNIMPLEMENTED_MIPS(); | 451 UNIMPLEMENTED_MIPS(); |
| 436 __ break_(0x765); | 452 __ break_(0x765); |
| 437 } | 453 } |
| 438 | 454 |
| 439 | 455 |
| 440 void StackCheckStub::Generate(MacroAssembler* masm) { | 456 void StackCheckStub::Generate(MacroAssembler* masm) { |
| 441 UNIMPLEMENTED_MIPS(); | 457 UNIMPLEMENTED_MIPS(); |
| (...skipping 102 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 544 int CompareStub::MinorKey() { | 560 int CompareStub::MinorKey() { |
| 545 // Encode the two parameters in a unique 16 bit value. | 561 // Encode the two parameters in a unique 16 bit value. |
| 546 ASSERT(static_cast<unsigned>(cc_) >> 28 < (1 << 15)); | 562 ASSERT(static_cast<unsigned>(cc_) >> 28 < (1 << 15)); |
| 547 return (static_cast<unsigned>(cc_) >> 27) | (strict_ ? 1 : 0); | 563 return (static_cast<unsigned>(cc_) >> 27) | (strict_ ? 1 : 0); |
| 548 } | 564 } |
| 549 | 565 |
| 550 | 566 |
| 551 #undef __ | 567 #undef __ |
| 552 | 568 |
| 553 } } // namespace v8::internal | 569 } } // namespace v8::internal |
| OLD | NEW |