OLD | NEW |
1 // Copyright 2009 the V8 project authors. All rights reserved. | 1 // Copyright 2009 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 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
60 | 60 |
61 void EntryNode::Compile(MacroAssembler* masm) { | 61 void EntryNode::Compile(MacroAssembler* masm) { |
62 ASSERT(!is_marked()); | 62 ASSERT(!is_marked()); |
63 is_marked_ = true; | 63 is_marked_ = true; |
64 { | 64 { |
65 Comment cmnt(masm, "[ EntryNode"); | 65 Comment cmnt(masm, "[ EntryNode"); |
66 __ stm(db_w, sp, r1.bit() | cp.bit() | fp.bit() | lr.bit()); | 66 __ stm(db_w, sp, r1.bit() | cp.bit() | fp.bit() | lr.bit()); |
67 __ add(fp, sp, Operand(2 * kPointerSize)); | 67 __ add(fp, sp, Operand(2 * kPointerSize)); |
68 int count = CfgGlobals::current()->fun()->scope()->num_stack_slots(); | 68 int count = CfgGlobals::current()->fun()->scope()->num_stack_slots(); |
69 if (count > 0) { | 69 if (count > 0) { |
70 __ LoadRoot(ip, Heap::kUndefinedValueRootIndex); | 70 __ mov(ip, Operand(Factory::undefined_value())); |
71 for (int i = 0; i < count; i++) { | 71 for (int i = 0; i < count; i++) { |
72 __ push(ip); | 72 __ push(ip); |
73 } | 73 } |
74 } | 74 } |
75 if (FLAG_trace) { | 75 if (FLAG_trace) { |
76 __ CallRuntime(Runtime::kTraceEnter, 0); | 76 __ CallRuntime(Runtime::kTraceEnter, 0); |
77 } | 77 } |
78 if (FLAG_check_stack) { | 78 if (FLAG_check_stack) { |
79 StackCheckStub stub; | 79 StackCheckStub stub; |
80 __ CallStub(&stub); | 80 __ CallStub(&stub); |
(...skipping 211 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
292 __ str(ip, ToMemOperand(loc)); | 292 __ str(ip, ToMemOperand(loc)); |
293 break; | 293 break; |
294 case NOT_ALLOCATED: | 294 case NOT_ALLOCATED: |
295 UNREACHABLE(); | 295 UNREACHABLE(); |
296 } | 296 } |
297 } | 297 } |
298 | 298 |
299 #undef __ | 299 #undef __ |
300 | 300 |
301 } } // namespace v8::internal | 301 } } // namespace v8::internal |
OLD | NEW |