| 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 268 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 279 #endif | 279 #endif |
| 280 | 280 |
| 281 FullCodeGenerator cgen(&masm); | 281 FullCodeGenerator cgen(&masm); |
| 282 cgen.Generate(info); | 282 cgen.Generate(info); |
| 283 if (cgen.HasStackOverflow()) { | 283 if (cgen.HasStackOverflow()) { |
| 284 ASSERT(!isolate->has_pending_exception()); | 284 ASSERT(!isolate->has_pending_exception()); |
| 285 return false; | 285 return false; |
| 286 } | 286 } |
| 287 unsigned table_offset = cgen.EmitStackCheckTable(); | 287 unsigned table_offset = cgen.EmitStackCheckTable(); |
| 288 | 288 |
| 289 Code::Flags flags = Code::ComputeFlags(Code::FUNCTION, NOT_IN_LOOP); | 289 Code::Flags flags = Code::ComputeFlags(Code::FUNCTION); |
| 290 Handle<Code> code = CodeGenerator::MakeCodeEpilogue(&masm, flags, info); | 290 Handle<Code> code = CodeGenerator::MakeCodeEpilogue(&masm, flags, info); |
| 291 code->set_optimizable(info->IsOptimizable()); | 291 code->set_optimizable(info->IsOptimizable()); |
| 292 cgen.PopulateDeoptimizationData(code); | 292 cgen.PopulateDeoptimizationData(code); |
| 293 code->set_has_deoptimization_support(info->HasDeoptimizationSupport()); | 293 code->set_has_deoptimization_support(info->HasDeoptimizationSupport()); |
| 294 code->set_allow_osr_at_loop_nesting_level(0); | 294 code->set_allow_osr_at_loop_nesting_level(0); |
| 295 code->set_stack_check_table_offset(table_offset); | 295 code->set_stack_check_table_offset(table_offset); |
| 296 CodeGenerator::PrintCode(code, info); | 296 CodeGenerator::PrintCode(code, info); |
| 297 info->SetCode(code); // may be an empty handle. | 297 info->SetCode(code); // may be an empty handle. |
| 298 #ifdef ENABLE_GDB_JIT_INTERFACE | 298 #ifdef ENABLE_GDB_JIT_INTERFACE |
| 299 if (FLAG_gdbjit && !code.is_null()) { | 299 if (FLAG_gdbjit && !code.is_null()) { |
| (...skipping 1036 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1336 } | 1336 } |
| 1337 | 1337 |
| 1338 return false; | 1338 return false; |
| 1339 } | 1339 } |
| 1340 | 1340 |
| 1341 | 1341 |
| 1342 #undef __ | 1342 #undef __ |
| 1343 | 1343 |
| 1344 | 1344 |
| 1345 } } // namespace v8::internal | 1345 } } // namespace v8::internal |
| OLD | NEW |