blob: db620edb55c27d5b0651de74e6441709e3b5ec9e (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
// Copyright 2013 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef V8_COMPILER_SCHEDULER_H_
#define V8_COMPILER_SCHEDULER_H_
#include <vector>
#include "src/v8.h"
#include "src/compiler/opcodes.h"
#include "src/compiler/schedule.h"
#include "src/zone-allocator.h"
#include "src/zone-containers.h"
namespace v8 {
namespace internal {
namespace compiler {
// Computes a schedule from a graph, placing nodes into basic blocks and
// ordering the basic blocks in the special RPO order.
class Scheduler {
public:
// Create a new schedule and place all computations from the graph in it.
static Schedule* ComputeSchedule(Graph* graph);
// Compute the RPO of blocks in an existing schedule.
static BasicBlockVector* ComputeSpecialRPO(Schedule* schedule);
private:
Graph* graph_;
Schedule* schedule_;
NodeVector branches_;
NodeVector calls_;
NodeVector deopts_;
NodeVector returns_;
NodeVector loops_and_merges_;
BasicBlockVector node_block_placement_;
IntVector unscheduled_uses_;
NodeVectorVector scheduled_nodes_;
NodeVector schedule_root_nodes_;
IntVector schedule_early_rpo_index_;
Scheduler(Zone* zone, Graph* graph, Schedule* schedule);
int GetRPONumber(BasicBlock* block) {
DCHECK(block->rpo_number_ >= 0 &&
block->rpo_number_ < static_cast<int>(schedule_->rpo_order_.size()));
DCHECK(schedule_->rpo_order_[block->rpo_number_] == block);
return block->rpo_number_;
}
void PrepareAuxiliaryNodeData();
void PrepareAuxiliaryBlockData();
friend class CreateBlockVisitor;
void CreateBlocks();
void WireBlocks();
void AddPredecessorsForLoopsAndMerges();
void AddSuccessorsForBranches();
void AddSuccessorsForReturns();
void AddSuccessorsForCalls();
void AddSuccessorsForDeopts();
void GenerateImmediateDominatorTree();
BasicBlock* GetCommonDominator(BasicBlock* b1, BasicBlock* b2);
friend class ScheduleEarlyNodeVisitor;
void ScheduleEarly();
friend class PrepareUsesVisitor;
void PrepareUses();
friend class ScheduleLateNodeVisitor;
void ScheduleLate();
};
}
}
} // namespace v8::internal::compiler
#endif // V8_COMPILER_SCHEDULER_H_
|
