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 374 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
385 | 385 |
386 Representation LChunk::LookupLiteralRepresentation( | 386 Representation LChunk::LookupLiteralRepresentation( |
387 LConstantOperand* operand) const { | 387 LConstantOperand* operand) const { |
388 return graph_->LookupValue(operand->index())->representation(); | 388 return graph_->LookupValue(operand->index())->representation(); |
389 } | 389 } |
390 | 390 |
391 | 391 |
392 LChunk* LChunk::NewChunk(HGraph* graph) { | 392 LChunk* LChunk::NewChunk(HGraph* graph) { |
393 DisallowHandleAllocation no_handles; | 393 DisallowHandleAllocation no_handles; |
394 DisallowHeapAllocation no_gc; | 394 DisallowHeapAllocation no_gc; |
| 395 graph->DisallowAddingNewValues(); |
395 int values = graph->GetMaximumValueID(); | 396 int values = graph->GetMaximumValueID(); |
396 CompilationInfo* info = graph->info(); | 397 CompilationInfo* info = graph->info(); |
397 if (values > LUnallocated::kMaxVirtualRegisters) { | 398 if (values > LUnallocated::kMaxVirtualRegisters) { |
398 info->set_bailout_reason(kNotEnoughVirtualRegistersForValues); | 399 info->set_bailout_reason(kNotEnoughVirtualRegistersForValues); |
399 return NULL; | 400 return NULL; |
400 } | 401 } |
401 LAllocator allocator(values, graph); | 402 LAllocator allocator(values, graph); |
402 LChunkBuilder builder(info, graph, &allocator); | 403 LChunkBuilder builder(info, graph, &allocator); |
403 LChunk* chunk = builder.Build(); | 404 LChunk* chunk = builder.Build(); |
404 if (chunk == NULL) return NULL; | 405 if (chunk == NULL) return NULL; |
(...skipping 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
461 | 462 |
462 | 463 |
463 LPhase::~LPhase() { | 464 LPhase::~LPhase() { |
464 if (ShouldProduceTraceOutput()) { | 465 if (ShouldProduceTraceOutput()) { |
465 isolate()->GetHTracer()->TraceLithium(name(), chunk_); | 466 isolate()->GetHTracer()->TraceLithium(name(), chunk_); |
466 } | 467 } |
467 } | 468 } |
468 | 469 |
469 | 470 |
470 } } // namespace v8::internal | 471 } } // namespace v8::internal |
OLD | NEW |