28 #ifndef V8_LITHIUM_ALLOCATOR_INL_H_
29 #define V8_LITHIUM_ALLOCATOR_INL_H_
33 #if V8_TARGET_ARCH_IA32
35 #elif V8_TARGET_ARCH_X64
37 #elif V8_TARGET_ARCH_ARM64
39 #elif V8_TARGET_ARCH_ARM
41 #elif V8_TARGET_ARCH_MIPS
44 #error "Unknown architecture."
50 bool LAllocator::IsGapAt(
int index) {
return chunk_->IsGapAt(index); }
53 LInstruction* LAllocator::InstructionAt(
int index) {
54 return chunk_->instructions()->at(index);
58 LGap* LAllocator::GapAt(
int index) {
59 return chunk_->GetGapAt(index);
63 TempIterator::TempIterator(LInstruction* instr)
65 limit_(instr->TempCount()),
71 bool TempIterator::Done() {
return current_ >= limit_; }
74 LOperand* TempIterator::Current() {
80 void TempIterator::SkipUninteresting() {
85 void TempIterator::Advance() {
91 InputIterator::InputIterator(LInstruction* instr)
93 limit_(instr->InputCount()),
99 bool InputIterator::Done() {
return current_ >= limit_; }
102 LOperand* InputIterator::Current() {
109 void InputIterator::Advance() {
115 void InputIterator::SkipUninteresting() {
117 LOperand* current = instr_->InputAt(
current_);
118 if (current !=
NULL && !current->IsConstantOperand())
break;
124 UseIterator::UseIterator(LInstruction* instr)
125 : input_iterator_(instr), env_iterator_(instr->environment()) { }
128 bool UseIterator::Done() {
129 return input_iterator_.Done() && env_iterator_.Done();
133 LOperand* UseIterator::Current() {
135 LOperand* result = input_iterator_.Done()
136 ? env_iterator_.Current()
137 : input_iterator_.Current();
143 void UseIterator::Advance() {
144 input_iterator_.Done()
145 ? env_iterator_.Advance()
146 : input_iterator_.Advance();
150 void LAllocator::SetLiveRangeAssignedRegister(LiveRange* range,
int reg) {
152 assigned_double_registers_->Add(reg);
155 assigned_registers_->Add(reg);
157 range->set_assigned_register(reg, chunk()->zone());
163 #endif // V8_LITHIUM_ALLOCATOR_INL_H_
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter NULL
#define ASSERT(condition)