OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 259 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
270 } else { | 270 } else { |
271 __ subq(rsp, Immediate(slots * kPointerSize)); | 271 __ subq(rsp, Immediate(slots * kPointerSize)); |
272 #ifdef _MSC_VER | 272 #ifdef _MSC_VER |
273 // On windows, you may not access the stack more than one page below | 273 // On windows, you may not access the stack more than one page below |
274 // the most recently mapped page. To make the allocated area randomly | 274 // the most recently mapped page. To make the allocated area randomly |
275 // accessible, we write to each page in turn (the value is irrelevant). | 275 // accessible, we write to each page in turn (the value is irrelevant). |
276 const int kPageSize = 4 * KB; | 276 const int kPageSize = 4 * KB; |
277 for (int offset = slots * kPointerSize - kPageSize; | 277 for (int offset = slots * kPointerSize - kPageSize; |
278 offset > 0; | 278 offset > 0; |
279 offset -= kPageSize) { | 279 offset -= kPageSize) { |
280 __ moveq(Operand(rsp, offset), rax); | 280 __ movq(Operand(rsp, offset), rax); |
281 } | 281 } |
282 #endif | 282 #endif |
283 } | 283 } |
284 } | 284 } |
285 | 285 |
286 // Trace the call. | 286 // Trace the call. |
287 if (FLAG_trace) { | 287 if (FLAG_trace) { |
288 __ CallRuntime(Runtime::kTraceEnter, 0); | 288 __ CallRuntime(Runtime::kTraceEnter, 0); |
289 } | 289 } |
290 return !is_aborted(); | 290 return !is_aborted(); |
(...skipping 1170 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1461 | 1461 |
1462 void LCodeGen::DoOsrEntry(LOsrEntry* instr) { | 1462 void LCodeGen::DoOsrEntry(LOsrEntry* instr) { |
1463 Abort("Unimplemented: %s", "DoOsrEntry"); | 1463 Abort("Unimplemented: %s", "DoOsrEntry"); |
1464 } | 1464 } |
1465 | 1465 |
1466 #undef __ | 1466 #undef __ |
1467 | 1467 |
1468 } } // namespace v8::internal | 1468 } } // namespace v8::internal |
1469 | 1469 |
1470 #endif // V8_TARGET_ARCH_X64 | 1470 #endif // V8_TARGET_ARCH_X64 |
OLD | NEW |