V8 Project
v8::internal::compiler::ScheduleEarlyNodeVisitor Class Reference
+ Inheritance diagram for v8::internal::compiler::ScheduleEarlyNodeVisitor:
+ Collaboration diagram for v8::internal::compiler::ScheduleEarlyNodeVisitor:

Public Member Functions

 ScheduleEarlyNodeVisitor (Scheduler *scheduler)
 
GenericGraphVisit::Control Pre (Node *node)
 
GenericGraphVisit::Control Post (Node *node)
 
- Public Member Functions inherited from v8::internal::compiler::GenericGraphVisit::NullNodeVisitor< B, S >
Control Pre (GenericNode< B, S > *node)
 
Control Post (GenericNode< B, S > *node)
 
void PreEdge (GenericNode< B, S > *from, int index, GenericNode< B, S > *to)
 
void PostEdge (GenericNode< B, S > *from, int index, GenericNode< B, S > *to)
 

Public Attributes

bool has_changed_rpo_constraints_
 

Private Attributes

Schedulerscheduler_
 
Scheduleschedule_
 

Detailed Description

Definition at line 355 of file scheduler.cc.

Constructor & Destructor Documentation

◆ ScheduleEarlyNodeVisitor()

v8::internal::compiler::ScheduleEarlyNodeVisitor::ScheduleEarlyNodeVisitor ( Scheduler scheduler)
inlineexplicit

Definition at line 357 of file scheduler.cc.

Member Function Documentation

◆ Post()

GenericGraphVisit::Control v8::internal::compiler::ScheduleEarlyNodeVisitor::Post ( Node *  node)
inline

Definition at line 379 of file scheduler.cc.

379  {
380  int max_rpo = 0;
381  // Otherwise, the minimum rpo for the node is the max of all of the inputs.
382  if (scheduler_->GetPlacement(node) != Scheduler::kFixed) {
383  for (InputIter i = node->inputs().begin(); i != node->inputs().end();
384  ++i) {
385  int control_rpo = scheduler_->GetData(*i)->minimum_rpo_;
386  if (control_rpo > max_rpo) {
387  max_rpo = control_rpo;
388  }
389  }
390  if (scheduler_->GetData(node)->minimum_rpo_ != max_rpo) {
392  }
393  scheduler_->GetData(node)->minimum_rpo_ = max_rpo;
394  Trace("Postschedule #%d:%s minimum_rpo = %d\n", node->id(),
395  node->op()->mnemonic(), max_rpo);
396  }
398  }
SchedulerData * GetData(Node *node)
Definition: scheduler.h:59
Placement GetPlacement(Node *node)
Definition: scheduler.cc:262
static void Trace(const char *msg,...)
Definition: scheduler.cc:21
Node::Inputs::iterator InputIter
Definition: node.h:82

References v8::internal::compiler::GenericGraphVisit::CONTINUE, v8::internal::compiler::Scheduler::GetData(), v8::internal::compiler::Scheduler::GetPlacement(), has_changed_rpo_constraints_, v8::internal::compiler::Scheduler::kFixed, v8::internal::compiler::Scheduler::SchedulerData::minimum_rpo_, scheduler_, and v8::internal::compiler::Trace().

+ Here is the call graph for this function:

◆ Pre()

GenericGraphVisit::Control v8::internal::compiler::ScheduleEarlyNodeVisitor::Pre ( Node *  node)
inline

Definition at line 362 of file scheduler.cc.

362  {
363  int max_rpo = 0;
364  // Fixed nodes already know their schedule early position.
365  if (scheduler_->GetPlacement(node) == Scheduler::kFixed) {
366  BasicBlock* block = schedule_->block(node);
367  DCHECK(block != NULL);
368  max_rpo = block->rpo_number_;
369  if (scheduler_->GetData(node)->minimum_rpo_ != max_rpo) {
371  }
372  scheduler_->GetData(node)->minimum_rpo_ = max_rpo;
373  Trace("Preschedule #%d:%s minimum_rpo = %d\n", node->id(),
374  node->op()->mnemonic(), max_rpo);
375  }
377  }
BasicBlock * block(Node *node) const
Definition: schedule.h:171
enable harmony numeric enable harmony object literal extensions Optimize object Array DOM strings and string trace pretenuring decisions of HAllocate instructions Enables optimizations which favor memory size over execution speed maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining trace the tracking of allocation sites deoptimize every n garbage collections perform array bounds checks elimination analyze liveness of environment slots and zap dead values flushes the cache of optimized code for closures on every GC allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes enable context specialization in TurboFan execution budget before interrupt is triggered max percentage of megamorphic generic ICs to allow optimization enable use of SAHF instruction if enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable use of MLS instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of d16 d31 registers on ARM this requires VFP3 force all emitted branches to be in long enable alignment of csp to bytes on platforms which prefer the register to always be NULL
#define DCHECK(condition)
Definition: logging.h:205

References v8::internal::compiler::Schedule::block(), v8::internal::compiler::GenericGraphVisit::CONTINUE, DCHECK, v8::internal::compiler::Scheduler::GetData(), v8::internal::compiler::Scheduler::GetPlacement(), has_changed_rpo_constraints_, v8::internal::compiler::Scheduler::kFixed, v8::internal::compiler::Scheduler::SchedulerData::minimum_rpo_, NULL, schedule_, scheduler_, and v8::internal::compiler::Trace().

+ Here is the call graph for this function:

Member Data Documentation

◆ has_changed_rpo_constraints_

bool v8::internal::compiler::ScheduleEarlyNodeVisitor::has_changed_rpo_constraints_

Definition at line 402 of file scheduler.cc.

Referenced by Post(), Pre(), and v8::internal::compiler::Scheduler::ScheduleEarly().

◆ schedule_

Schedule* v8::internal::compiler::ScheduleEarlyNodeVisitor::schedule_
private

Definition at line 406 of file scheduler.cc.

Referenced by Pre().

◆ scheduler_

Scheduler* v8::internal::compiler::ScheduleEarlyNodeVisitor::scheduler_
private

Definition at line 405 of file scheduler.cc.

Referenced by Post(), and Pre().


The documentation for this class was generated from the following file: