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 299 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
310 #endif | 310 #endif |
311 return !code.is_null(); | 311 return !code.is_null(); |
312 } | 312 } |
313 | 313 |
314 | 314 |
315 unsigned FullCodeGenerator::EmitStackCheckTable() { | 315 unsigned FullCodeGenerator::EmitStackCheckTable() { |
316 // The stack check table consists of a length (in number of entries) | 316 // The stack check table consists of a length (in number of entries) |
317 // field, and then a sequence of entries. Each entry is a pair of AST id | 317 // field, and then a sequence of entries. Each entry is a pair of AST id |
318 // and code-relative pc offset. | 318 // and code-relative pc offset. |
319 masm()->Align(kIntSize); | 319 masm()->Align(kIntSize); |
320 masm()->RecordComment("[ Stack check table"); | |
321 unsigned offset = masm()->pc_offset(); | 320 unsigned offset = masm()->pc_offset(); |
322 unsigned length = stack_checks_.length(); | 321 unsigned length = stack_checks_.length(); |
323 __ dd(length); | 322 __ dd(length); |
324 for (unsigned i = 0; i < length; ++i) { | 323 for (unsigned i = 0; i < length; ++i) { |
325 __ dd(stack_checks_[i].id); | 324 __ dd(stack_checks_[i].id); |
326 __ dd(stack_checks_[i].pc_and_state); | 325 __ dd(stack_checks_[i].pc_and_state); |
327 } | 326 } |
328 masm()->RecordComment("]"); | |
329 return offset; | 327 return offset; |
330 } | 328 } |
331 | 329 |
332 | 330 |
333 void FullCodeGenerator::PopulateDeoptimizationData(Handle<Code> code) { | 331 void FullCodeGenerator::PopulateDeoptimizationData(Handle<Code> code) { |
334 // Fill in the deoptimization information. | 332 // Fill in the deoptimization information. |
335 ASSERT(info_->HasDeoptimizationSupport() || bailout_entries_.is_empty()); | 333 ASSERT(info_->HasDeoptimizationSupport() || bailout_entries_.is_empty()); |
336 if (!info_->HasDeoptimizationSupport()) return; | 334 if (!info_->HasDeoptimizationSupport()) return; |
337 int length = bailout_entries_.length(); | 335 int length = bailout_entries_.length(); |
338 Handle<DeoptimizationOutputData> data = | 336 Handle<DeoptimizationOutputData> data = |
(...skipping 995 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1334 } | 1332 } |
1335 | 1333 |
1336 return false; | 1334 return false; |
1337 } | 1335 } |
1338 | 1336 |
1339 | 1337 |
1340 #undef __ | 1338 #undef __ |
1341 | 1339 |
1342 | 1340 |
1343 } } // namespace v8::internal | 1341 } } // namespace v8::internal |
OLD | NEW |