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 373 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
384 } | 384 } |
385 | 385 |
386 | 386 |
387 Representation LChunk::LookupLiteralRepresentation( | 387 Representation LChunk::LookupLiteralRepresentation( |
388 LConstantOperand* operand) const { | 388 LConstantOperand* operand) const { |
389 return graph_->LookupValue(operand->index())->representation(); | 389 return graph_->LookupValue(operand->index())->representation(); |
390 } | 390 } |
391 | 391 |
392 | 392 |
393 LChunk* LChunk::NewChunk(HGraph* graph) { | 393 LChunk* LChunk::NewChunk(HGraph* graph) { |
| 394 NoHandleAllocation no_handles; |
| 395 AssertNoAllocation no_gc; |
| 396 |
394 int values = graph->GetMaximumValueID(); | 397 int values = graph->GetMaximumValueID(); |
395 if (values > LUnallocated::kMaxVirtualRegisters) { | 398 if (values > LUnallocated::kMaxVirtualRegisters) { |
396 if (FLAG_trace_bailout) { | 399 if (FLAG_trace_bailout) { |
397 PrintF("Not enough virtual registers for (values).\n"); | 400 PrintF("Not enough virtual registers for (values).\n"); |
398 } | 401 } |
399 return NULL; | 402 return NULL; |
400 } | 403 } |
401 LAllocator allocator(values, graph); | 404 LAllocator allocator(values, graph); |
402 LChunkBuilder builder(graph->info(), graph, &allocator); | 405 LChunkBuilder builder(graph->info(), graph, &allocator); |
403 LChunk* chunk = builder.Build(); | 406 LChunk* chunk = builder.Build(); |
(...skipping 26 matching lines...) Expand all Loading... |
430 CodeGenerator::MakeCodeEpilogue(&assembler, flags, info()); | 433 CodeGenerator::MakeCodeEpilogue(&assembler, flags, info()); |
431 generator.FinishCode(code); | 434 generator.FinishCode(code); |
432 CodeGenerator::PrintCode(code, info()); | 435 CodeGenerator::PrintCode(code, info()); |
433 return code; | 436 return code; |
434 } | 437 } |
435 return Handle<Code>::null(); | 438 return Handle<Code>::null(); |
436 } | 439 } |
437 | 440 |
438 | 441 |
439 } } // namespace v8::internal | 442 } } // namespace v8::internal |
OLD | NEW |