OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:HBasicBlock
(Results
1 - 25
of
131
) sorted by null
1
2
3
4
5
6
/external/v8/src/crankshaft/
hydrogen-osr.h
28
HBasicBlock
* BuildOsrLoopEntry(IterationStatement* statement);
47
HBasicBlock
* osr_entry_;
48
HBasicBlock
* osr_loop_entry_;
hydrogen-sce.cc
16
HBasicBlock
* block = graph()->blocks()->at(i);
18
HBasicBlock
* back_edge = block->loop_information()->GetLastBackEdge();
19
HBasicBlock
* dominator = back_edge;
hydrogen-load-elimination.h
21
void EliminateLoads(
HBasicBlock
* block);
hydrogen-mark-unreachable.cc
15
const ZoneList<
HBasicBlock
*>* blocks = graph()->blocks();
19
HBasicBlock
* block = blocks->at(i);
23
HBasicBlock
* predecessor = it.Current();
29
HBasicBlock
* pred_succ;
hydrogen-bce.h
39
void EliminateRedundantBoundsChecks(
HBasicBlock
* bb);
40
BoundsCheckBbData* PreProcessBlock(
HBasicBlock
* bb);
41
void PostProcessBlock(
HBasicBlock
* bb, BoundsCheckBbData* data);
hydrogen-redundant-phi.h
22
void ProcessBlock(
HBasicBlock
* block);
hydrogen-flow-engine.h
39
inline NoState* Copy(
HBasicBlock
* succ, Zone* zone) {
45
inline NoState* Merge(
HBasicBlock
* succ, NoState* other, Zone* zone) {
82
State* AnalyzeOneBlock(
HBasicBlock
* block, State* state) {
92
void AnalyzeDominatedBlocks(
HBasicBlock
* root, State* initial) {
98
HBasicBlock
* block = graph_->blocks()->at(i);
123
HBasicBlock
* succ = block->end()->SuccessorAt(i);
141
Effects* ComputeLoopEffects(
HBasicBlock
* block) {
154
HBasicBlock
* member = graph_->blocks()->at(i);
174
inline bool SkipNonDominatedBlock(
HBasicBlock
* root,
HBasicBlock
* other)
[
all
...]
hydrogen-environment-liveness.h
30
void ZapEnvironmentSlotsInSuccessors(
HBasicBlock
* block, BitVector* live);
32
void UpdateLivenessAtBlockEnd(
HBasicBlock
* block, BitVector* live);
hydrogen-escape-analysis.h
38
HPhi* NewPhiAndInsert(
HBasicBlock
* block, HValue* incoming_value, int index);
44
HCapturedObject* StateAt(
HBasicBlock
* block) {
48
void SetStateAt(
HBasicBlock
* block, HCapturedObject* state) {
/art/compiler/optimizing/
common_dominator.h
30
static
HBasicBlock
* ForPair(
HBasicBlock
* block1,
HBasicBlock
* block2) {
37
explicit CommonDominator(
HBasicBlock
* block)
43
void Update(
HBasicBlock
* block) {
45
HBasicBlock
* block2 = dominator_;
73
HBasicBlock
* Get() const {
78
static size_t ChainLength(
HBasicBlock
* block) {
87
HBasicBlock
* dominator_;
graph_test.cc
28
static
HBasicBlock
* createIfBlock(HGraph* graph, ArenaAllocator* allocator) {
29
HBasicBlock
* if_block = new (allocator)
HBasicBlock
(graph);
39
static
HBasicBlock
* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) {
40
HBasicBlock
* block = new (allocator)
HBasicBlock
(graph);
47
static
HBasicBlock
* createEntryBlock(HGraph* graph, ArenaAllocator* allocator) {
48
HBasicBlock
* block = createGotoBlock(graph, allocator);
53
static
HBasicBlock
* createReturnBlock(HGraph* graph, ArenaAllocator* allocator) {
54
HBasicBlock
* block = new (allocator) HBasicBlock(graph)
[
all
...]
block_builder.h
49
HBasicBlock
* GetBlockAt(uint32_t dex_pc) const { return branch_targets_[dex_pc]; }
53
HBasicBlock
* MaybeCreateBlockAt(uint32_t dex_pc);
58
HBasicBlock
* MaybeCreateBlockAt(uint32_t semantic_dex_pc, uint32_t store_dex_pc);
69
bool MightHaveLiveNormalPredecessors(
HBasicBlock
* catch_block);
77
ArenaVector<
HBasicBlock
*> branch_targets_;
78
ArenaVector<
HBasicBlock
*> throwing_blocks_;
gvn_test.cc
34
HBasicBlock
* entry = new (&allocator)
HBasicBlock
(graph);
43
HBasicBlock
* block = new (&allocator)
HBasicBlock
(graph);
119
HBasicBlock
* entry = new (&allocator)
HBasicBlock
(graph);
128
HBasicBlock
* block = new (&allocator)
HBasicBlock
(graph);
142
HBasicBlock
* then = new (&allocator)
HBasicBlock
(graph)
[
all
...]
bounds_check_elimination_test.cc
69
HBasicBlock
* entry = new (&allocator_)
HBasicBlock
(graph_);
82
HBasicBlock
* block1 = new (&allocator_)
HBasicBlock
(graph_);
90
HBasicBlock
* block2 = new (&allocator_)
HBasicBlock
(graph_);
103
HBasicBlock
* block3 = new (&allocator_)
HBasicBlock
(graph_);
114
HBasicBlock
* block4 = new (&allocator_)
HBasicBlock
(graph_)
[
all
...]
block_builder.cc
23
HBasicBlock
* HBasicBlockBuilder::MaybeCreateBlockAt(uint32_t dex_pc) {
27
HBasicBlock
* HBasicBlockBuilder::MaybeCreateBlockAt(uint32_t semantic_dex_pc,
29
HBasicBlock
* block = branch_targets_[store_dex_pc];
31
block = new (arena_)
HBasicBlock
(graph_, semantic_dex_pc);
121
HBasicBlock
* block = graph_->GetEntryBlock();
129
HBasicBlock
* next_block = GetBlockAt(dex_pc);
167
HBasicBlock
* next_case_block = GetBlockAt(next_case_dex_pc);
192
HBasicBlock
* block,
205
const ArenaSafeMap<uint32_t,
HBasicBlock
*>& catch_blocks) {
211
bool HBasicBlockBuilder::MightHaveLiveNormalPredecessors(
HBasicBlock
* catch_block)
[
all
...]
nodes.cc
47
void HGraph::AddBlock(
HBasicBlock
* block) {
63
ArenaVector<
HBasicBlock
*> worklist(arena_->Adapter(kArenaAllocGraphBuilder));
71
HBasicBlock
* current = worklist.back();
77
HBasicBlock
* successor = current->GetSuccessors()[successors_visited[current_id]++];
114
HBasicBlock
* block = blocks_[i];
127
HBasicBlock
* block = blocks_[i];
130
for (
HBasicBlock
* successor : block->GetSuccessors()) {
198
void
HBasicBlock
::ClearDominanceInformation() {
203
HInstruction*
HBasicBlock
::GetFirstInstructionDisregardMoves() const {
211
static bool UpdateDominatorOfSuccessor(
HBasicBlock
* block, HBasicBlock* successor)
[
all
...]
dead_code_elimination.h
43
void MaybeRecordDeadBlock(
HBasicBlock
* block);
side_effects_analysis.cc
30
HBasicBlock
* block = it.Current();
42
HBasicBlock
* block = it.Current();
62
HBasicBlock
* pre_header = block->GetLoopInformation()->GetPreHeader();
77
SideEffects SideEffectsAnalysis::GetLoopEffects(
HBasicBlock
* block) const {
82
SideEffects SideEffectsAnalysis::GetBlockEffects(
HBasicBlock
* block) const {
dead_code_elimination.cc
26
ArenaVector<
HBasicBlock
*> worklist(graph->GetArena()->Adapter(kArenaAllocDCE));
33
HBasicBlock
* block = worklist.back();
38
ArrayRef<
HBasicBlock
* const> live_successors(block->GetSuccessors());
74
for (
HBasicBlock
* successor : live_successors) {
84
void HDeadCodeElimination::MaybeRecordDeadBlock(
HBasicBlock
* block) {
110
HBasicBlock
* block = it.Current();
138
HBasicBlock
* block = it.Current();
143
HBasicBlock
* successor = block->GetSingleSuccessor();
158
HBasicBlock
* block = b.Current();
select_generator.cc
26
static bool IsSimpleBlock(
HBasicBlock
* block) {
50
static bool BlocksMergeTogether(
HBasicBlock
* block1,
HBasicBlock
* block2) {
56
static HPhi* GetSingleChangedPhi(
HBasicBlock
* block, size_t index1, size_t index2) {
80
HBasicBlock
* block = it.Current();
85
HBasicBlock
* true_block = if_instruction->IfTrueSuccessor();
86
HBasicBlock
* false_block = if_instruction->IfFalseSuccessor();
93
HBasicBlock
* merge_block = true_block->GetSingleSuccessor();
side_effects_analysis.h
36
SideEffects GetLoopEffects(
HBasicBlock
* block) const;
37
SideEffects GetBlockEffects(
HBasicBlock
* block) const;
licm_test.cc
40
entry_ = new (&allocator_)
HBasicBlock
(graph_);
41
loop_preheader_ = new (&allocator_)
HBasicBlock
(graph_);
42
loop_header_ = new (&allocator_)
HBasicBlock
(graph_);
43
loop_body_ = new (&allocator_)
HBasicBlock
(graph_);
44
return_ = new (&allocator_)
HBasicBlock
(graph_);
45
exit_ = new (&allocator_)
HBasicBlock
(graph_);
91
HBasicBlock
* entry_;
92
HBasicBlock
* loop_preheader_;
93
HBasicBlock
* loop_header_;
94
HBasicBlock
* loop_body_
[
all
...]
nodes_test.cc
34
HBasicBlock
* entry = new (&allocator)
HBasicBlock
(graph);
42
HBasicBlock
* first_block = new (&allocator)
HBasicBlock
(graph);
49
HBasicBlock
* exit_block = new (&allocator)
HBasicBlock
(graph);
77
HBasicBlock
* entry = new (&allocator)
HBasicBlock
(graph);
105
HBasicBlock
* entry = new (&allocator)
HBasicBlock
(graph)
[
all
...]
graph_checker_test.cc
32
HBasicBlock
* entry_block = new (allocator)
HBasicBlock
(graph);
36
HBasicBlock
* exit_block = new (allocator)
HBasicBlock
(graph);
125
HBasicBlock
* exit_block = graph->GetExitBlock();
pretty_printer.h
71
void VisitBasicBlock(
HBasicBlock
* block) OVERRIDE {
74
const ArenaVector<
HBasicBlock
*>& predecessors = block->GetPredecessors();
83
const ArenaVector<
HBasicBlock
*>& successors = block->GetSuccessors();
125
void VisitBasicBlock(
HBasicBlock
* block) OVERRIDE {
140
HBasicBlock
* current_block_;
Completed in 280 milliseconds
1
2
3
4
5
6