| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 18 matching lines...) Expand all Loading... |
| 29 | 29 |
| 30 #include "code-stubs.h" | 30 #include "code-stubs.h" |
| 31 #include "hydrogen.h" | 31 #include "hydrogen.h" |
| 32 #include "lithium.h" | 32 #include "lithium.h" |
| 33 | 33 |
| 34 namespace v8 { | 34 namespace v8 { |
| 35 namespace internal { | 35 namespace internal { |
| 36 | 36 |
| 37 | 37 |
| 38 static LChunk* OptimizeGraph(HGraph* graph) { | 38 static LChunk* OptimizeGraph(HGraph* graph) { |
| 39 Isolate* isolate = graph->isolate(); | 39 DisallowHeapAllocation no_allocation; |
| 40 AssertNoAllocation no_gc; | 40 DisallowHandleAllocation no_handles; |
| 41 NoHandleAllocation no_handles(isolate); | 41 DisallowHandleDereference no_deref; |
| 42 HandleDereferenceGuard no_deref(isolate, HandleDereferenceGuard::DISALLOW); | |
| 43 | 42 |
| 44 ASSERT(graph != NULL); | 43 ASSERT(graph != NULL); |
| 45 SmartArrayPointer<char> bailout_reason; | 44 SmartArrayPointer<char> bailout_reason; |
| 46 if (!graph->Optimize(&bailout_reason)) { | 45 if (!graph->Optimize(&bailout_reason)) { |
| 47 FATAL(bailout_reason.is_empty() ? "unknown" : *bailout_reason); | 46 FATAL(bailout_reason.is_empty() ? "unknown" : *bailout_reason); |
| 48 } | 47 } |
| 49 LChunk* chunk = LChunk::NewChunk(graph); | 48 LChunk* chunk = LChunk::NewChunk(graph); |
| 50 if (chunk == NULL) { | 49 if (chunk == NULL) { |
| 51 FATAL(graph->info()->bailout_reason()); | 50 FATAL(graph->info()->bailout_reason()); |
| 52 } | 51 } |
| (...skipping 635 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 688 return graph()->GetConstant0(); | 687 return graph()->GetConstant0(); |
| 689 } | 688 } |
| 690 | 689 |
| 691 | 690 |
| 692 Handle<Code> ToBooleanStub::GenerateCode() { | 691 Handle<Code> ToBooleanStub::GenerateCode() { |
| 693 return DoGenerateCode(this); | 692 return DoGenerateCode(this); |
| 694 } | 693 } |
| 695 | 694 |
| 696 | 695 |
| 697 } } // namespace v8::internal | 696 } } // namespace v8::internal |
| OLD | NEW |