| OLD | NEW |
| 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 479 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 490 // ----------------------------------- | 490 // ----------------------------------- |
| 491 | 491 |
| 492 __ ldr(r3, MemOperand(sp, 0)); | 492 __ ldr(r3, MemOperand(sp, 0)); |
| 493 __ stm(db_w, sp, r2.bit() | r3.bit()); | 493 __ stm(db_w, sp, r2.bit() | r3.bit()); |
| 494 | 494 |
| 495 // Perform tail call to the entry. | 495 // Perform tail call to the entry. |
| 496 __ TailCallRuntime(f, 2); | 496 __ TailCallRuntime(f, 2); |
| 497 } | 497 } |
| 498 | 498 |
| 499 | 499 |
| 500 // TODO(181): Implement map patching once loop nesting is tracked on | 500 // TODO(181): Implement map patching once loop nesting is tracked on the |
| 501 // the ARM platform so we can generate inlined fast-case code for | 501 // ARM platform so we can generate inlined fast-case code loads in |
| 502 // array indexing in loops. | 502 // loops. |
| 503 bool KeyedLoadIC::HasInlinedVersion(Address address) { return false; } | 503 void LoadIC::ClearInlinedVersion(Address address) {} |
| 504 void KeyedLoadIC::ClearInlinedVersion(Address address) { } | 504 bool LoadIC::PatchInlinedLoad(Address address, Object* map, int offset) { |
| 505 void KeyedLoadIC::PatchInlinedMapCheck(Address address, Object* value) { } | 505 return false; |
| 506 } |
| 507 |
| 508 void KeyedLoadIC::ClearInlinedVersion(Address address) {} |
| 509 bool KeyedLoadIC::PatchInlinedLoad(Address address, Object* map) { |
| 510 return false; |
| 511 } |
| 506 | 512 |
| 507 | 513 |
| 508 Object* KeyedLoadIC_Miss(Arguments args); | 514 Object* KeyedLoadIC_Miss(Arguments args); |
| 509 | 515 |
| 510 | 516 |
| 511 void KeyedLoadIC::GenerateMiss(MacroAssembler* masm) { | 517 void KeyedLoadIC::GenerateMiss(MacroAssembler* masm) { |
| 512 Generate(masm, ExternalReference(IC_Utility(kKeyedLoadIC_Miss))); | 518 Generate(masm, ExternalReference(IC_Utility(kKeyedLoadIC_Miss))); |
| 513 } | 519 } |
| 514 | 520 |
| 515 | 521 |
| (...skipping 271 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 787 | 793 |
| 788 // Perform tail call to the entry. | 794 // Perform tail call to the entry. |
| 789 __ TailCallRuntime(f, 3); | 795 __ TailCallRuntime(f, 3); |
| 790 } | 796 } |
| 791 | 797 |
| 792 | 798 |
| 793 #undef __ | 799 #undef __ |
| 794 | 800 |
| 795 | 801 |
| 796 } } // namespace v8::internal | 802 } } // namespace v8::internal |
| OLD | NEW |