| 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 398 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 409 } | 409 } |
| 410 | 410 |
| 411 | 411 |
| 412 Representation LChunk::LookupLiteralRepresentation( | 412 Representation LChunk::LookupLiteralRepresentation( |
| 413 LConstantOperand* operand) const { | 413 LConstantOperand* operand) const { |
| 414 return graph_->LookupValue(operand->index())->representation(); | 414 return graph_->LookupValue(operand->index())->representation(); |
| 415 } | 415 } |
| 416 | 416 |
| 417 | 417 |
| 418 LChunk* LChunk::NewChunk(HGraph* graph) { | 418 LChunk* LChunk::NewChunk(HGraph* graph) { |
| 419 NoHandleAllocation no_handles; | 419 NoHandleAllocation no_handles(graph->isolate()); |
| 420 AssertNoAllocation no_gc; | 420 AssertNoAllocation no_gc; |
| 421 | 421 |
| 422 int values = graph->GetMaximumValueID(); | 422 int values = graph->GetMaximumValueID(); |
| 423 CompilationInfo* info = graph->info(); | 423 CompilationInfo* info = graph->info(); |
| 424 if (values > LUnallocated::kMaxVirtualRegisters) { | 424 if (values > LUnallocated::kMaxVirtualRegisters) { |
| 425 info->set_bailout_reason("not enough virtual registers for values"); | 425 info->set_bailout_reason("not enough virtual registers for values"); |
| 426 return NULL; | 426 return NULL; |
| 427 } | 427 } |
| 428 LAllocator allocator(values, graph); | 428 LAllocator allocator(values, graph); |
| 429 LChunkBuilder builder(info, graph, &allocator); | 429 LChunkBuilder builder(info, graph, &allocator); |
| (...skipping 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 486 } else { | 486 } else { |
| 487 spill_slot_count_++; | 487 spill_slot_count_++; |
| 488 } | 488 } |
| 489 } | 489 } |
| 490 iterator.Advance(); | 490 iterator.Advance(); |
| 491 } | 491 } |
| 492 } | 492 } |
| 493 | 493 |
| 494 | 494 |
| 495 } } // namespace v8::internal | 495 } } // namespace v8::internal |
| OLD | NEW |