| /external/v8/src/ |
| hydrogen-gvn.h | 122 HBasicBlock* dominator,
123 HBasicBlock* dominated);
127 void ProcessLoopBlock(HBasicBlock* block,
128 HBasicBlock* before_loop,
131 bool ShouldMove(HInstruction* instr, HBasicBlock* loop_header);
|
| hydrogen-removable-simulates.cc | 80 HBasicBlock* succ_block,
82 HBasicBlock* pred_block,
89 static State* Finish(State* state, HBasicBlock* block, Zone* zone) {
130 State* Copy(HBasicBlock* succ_block, HBasicBlock* pred_block, Zone* zone) {
140 State* Merge(HBasicBlock* succ_block,
142 HBasicBlock* pred_block,
|
| hydrogen-redundant-phi.cc | 12 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
15 HBasicBlock* block = blocks->at(i);
35 void HRedundantPhiEliminationPhase::ProcessBlock(HBasicBlock* block) {
|
| hydrogen-infer-types.cc | 12 HBasicBlock* block = graph()->blocks()->at(i);
24 HBasicBlock* last_back_edge =
|
| hydrogen-mark-deoptimize.cc | 45 const ZoneList<HBasicBlock*>* blocks(graph()->blocks());
47 const HBasicBlock* block(blocks->at(i));
|
| hydrogen.h | 35 class HBasicBlock FINAL : public ZoneObject {
37 explicit HBasicBlock(HGraph* graph);
38 ~HBasicBlock() { }
56 const ZoneList<HBasicBlock*>* predecessors() const { return &predecessors_; }
58 const ZoneList<HBasicBlock*>* dominated_blocks() const {
67 HBasicBlock* dominator() const { return dominator_; }
92 bool Dominates(HBasicBlock* other) const;
93 bool EqualToOrDominates(HBasicBlock* other) const;
104 HBasicBlock* parent_loop_header() const { return parent_loop_header_; }
106 void set_parent_loop_header(HBasicBlock* block)
[all...] |
| hydrogen-dce.cc | 51 HBasicBlock* block = graph()->blocks()->at(i);
71 HBasicBlock* block = graph()->blocks()->at(i);
96 HBasicBlock* block = phi->block();
|
| hydrogen-osr.cc | 17 HBasicBlock* HOsrBuilder::BuildOsrLoopEntry(IterationStatement* statement) {
29 HBasicBlock* non_osr_entry = graph->CreateBasicBlock();
36 HBasicBlock* loop_predecessor = graph->CreateBasicBlock();
|
| hydrogen-range-analysis.h | 26 HBasicBlock* dest);
|
| lithium-allocator.h | 18 class HBasicBlock;
393 bool CanEagerlyResolveControlFlow(HBasicBlock* block) const;
398 BitVector* ComputeLiveOut(HBasicBlock* block);
399 void AddInitialIntervals(HBasicBlock* block, BitVector* live_out);
400 void ProcessInstructions(HBasicBlock* block, BitVector* live);
401 void MeetRegisterConstraints(HBasicBlock* block);
405 void ResolvePhis(HBasicBlock* block);
483 HBasicBlock* block,
484 HBasicBlock* pred);
493 HBasicBlock* GetBlock(LifetimePosition pos)
[all...] |
| hydrogen-range-analysis.cc | 13 Pending(HBasicBlock* block, int last_changed_range)
16 HBasicBlock* block() const { return block_; }
20 HBasicBlock* block_;
36 HBasicBlock* block(graph()->entry_block());
43 HBasicBlock* pred = block->predecessors()->first();
84 const ZoneList<HBasicBlock*>* dominated_blocks(block->dominated_blocks());
112 HBasicBlock* block = graph()->blocks()->at(i);
123 HBasicBlock* dest) {
|
| hydrogen-gvn.cc | 530 HBasicBlock* block = graph()->blocks()->at(i);
547 HBasicBlock* with_parent = block;
550 HBasicBlock* parent_block = with_parent->parent_loop_header();
564 HBasicBlock* block = graph()->blocks()->at(i);
572 HBasicBlock* last = block->loop_information()->GetLastBackEdge();
582 HBasicBlock* block,
583 HBasicBlock* loop_header,
585 HBasicBlock* pre_header = loop_header->predecessors()->at(0);
638 HBasicBlock* loop_header) {
648 HBasicBlock* dominator, HBasicBlock* dominated)
[all...] |
| hydrogen-bce.cc | 101 HBasicBlock* BasicBlock() const { return basic_block_; }
198 HBasicBlock* bb,
216 HBasicBlock* basic_block_;
328 HBasicBlock* block_;
340 HBasicBlock* entry) {
355 const ZoneList<HBasicBlock*>* children = state->block_->dominated_blocks();
359 HBasicBlock* child = children->at(state->index_++);
374 HBasicBlock* bb) {
454 HBasicBlock* block, BoundsCheckBbData* data) {
|
| /art/compiler/optimizing/ |
| dead_code_elimination.cc | 23 static void MarkReachableBlocks(HBasicBlock* block, ArenaBitVector* visited) {
50 static void MarkLoopHeadersContaining(const HBasicBlock& block, ArenaBitVector* set) {
56 void HDeadCodeElimination::MaybeRecordDeadBlock(HBasicBlock* block) {
76 HBasicBlock* block = it.Current();
100 HBasicBlock* block = it.Current();
105 HBasicBlock* successor = block->GetSuccessors().Get(0);
120 HBasicBlock* block = b.Current();
|
| licm.cc | 22 static bool IsPhiOf(HInstruction* instruction, HBasicBlock* block) {
87 HBasicBlock* block = it.Current();
95 HBasicBlock* pre_header = loop_info->GetPreHeader();
98 HBasicBlock* inner = it_loop.Current();
|
| graph_checker.cc | 28 void GraphChecker::VisitBasicBlock(HBasicBlock* block) {
32 const GrowableArray<HBasicBlock*>& predecessors = block->GetPredecessors();
33 std::map<HBasicBlock*, size_t> predecessors_count;
35 HBasicBlock* p = predecessors.Get(i);
39 HBasicBlock* p = pc.first;
41 const GrowableArray<HBasicBlock*>& p_successors = p->GetSuccessors();
58 const GrowableArray<HBasicBlock*>& successors = block->GetSuccessors();
59 std::map<HBasicBlock*, size_t> successors_count;
61 HBasicBlock* s = successors.Get(i);
65 HBasicBlock* s = sc.first
[all...] |
| graph_checker_test.cc | 34 HBasicBlock* entry_block = new (allocator) HBasicBlock(graph);
38 HBasicBlock* exit_block = new (allocator) HBasicBlock(graph);
140 HBasicBlock* exit_block = graph->GetExitBlock();
|
| register_allocator.h | 28 class HBasicBlock;
110 void ConnectSplitSiblings(LiveInterval* interval, HBasicBlock* from, HBasicBlock* to) const;
113 void InsertParallelMoveAtExitOf(HBasicBlock* block,
117 void InsertParallelMoveAtEntryOf(HBasicBlock* block,
|
| register_allocator_test.cc | 315 HBasicBlock* loop_header = graph->GetBlocks().Get(2);
324 HBasicBlock* return_block = graph->GetBlocks().Get(3);
467 HBasicBlock* entry = new (allocator) HBasicBlock(graph);
473 HBasicBlock* block = new (allocator) HBasicBlock(graph);
481 HBasicBlock* then = new (allocator) HBasicBlock(graph);
482 HBasicBlock* else_ = new (allocator) HBasicBlock(graph)
[all...] |
| codegen_test.cc | 528 HBasicBlock* entry = new (&allocator) HBasicBlock(graph);
533 HBasicBlock* first_block = new (&allocator) HBasicBlock(graph);
542 HBasicBlock* then = new (&allocator) HBasicBlock(graph);
543 HBasicBlock* else_ = new (&allocator) HBasicBlock(graph);
544 HBasicBlock* exit = new (&allocator) HBasicBlock(graph)
[all...] |
| bounds_check_elimination.cc | 272 static bool EarlyExit(HBasicBlock* block, HLoopInformation* loop_info) {
278 const GrowableArray<HBasicBlock*>& successors = block->GetSuccessors();
288 static bool DominatesAllBackEdges(HBasicBlock* block, HLoopInformation* loop_info) {
290 HBasicBlock* back_edge = loop_info->GetBackEdges().Get(i);
301 HBasicBlock* block = it_loop.Current();
515 HBasicBlock* GetLoopHeader() const {
522 HBasicBlock* GetLoopHeaderSuccesorInLoop() {
523 HBasicBlock* header = GetLoopHeader();
700 HBasicBlock* header = induction_variable_->GetBlock();
702 HBasicBlock* pre_header = header->GetLoopInformation()->GetPreHeader()
[all...] |
| ssa_liveness_analysis.cc | 46 static void AddToListForLinearization(GrowableArray<HBasicBlock*>* worklist, HBasicBlock* block) {
50 HBasicBlock* current = worklist->Get(insert_at - 1);
75 HBasicBlock* block = it.Current();
87 GrowableArray<HBasicBlock*> worklist(graph_->GetArena(), 1);
90 HBasicBlock* current = worklist.Pop();
93 HBasicBlock* successor = current->GetSuccessors().Get(i);
117 HBasicBlock* block = it.Current();
160 HBasicBlock* block = it.Current();
181 HBasicBlock* block = it.Current()
[all...] |
| nodes.h | 37 class HBasicBlock;
96 void SetBlockOfInstructions(HBasicBlock* block) const;
108 friend class HBasicBlock;
149 const GrowableArray<HBasicBlock*>& GetBlocks() const { return blocks_; }
150 HBasicBlock* GetBlock(size_t id) const { return blocks_.Get(id); }
152 HBasicBlock* GetEntryBlock() const { return entry_block_; }
153 HBasicBlock* GetExitBlock() const { return exit_block_; }
155 void SetEntryBlock(HBasicBlock* block) { entry_block_ = block; }
156 void SetExitBlock(HBasicBlock* block) { exit_block_ = block; }
158 void AddBlock(HBasicBlock* block)
[all...] |
| builder.h | 98 HBasicBlock* FindBlockStartingAt(int32_t index) const;
104 void PotentiallyAddSuspendCheck(HBasicBlock* target, uint32_t dex_pc);
242 GrowableArray<HBasicBlock*> branch_targets_;
246 HBasicBlock* entry_block_;
247 HBasicBlock* exit_block_;
248 HBasicBlock* current_block_;
|
| code_generator.h | 141 HBasicBlock* GetNextBlockToEmit() const;
142 HBasicBlock* FirstNonEmptyBlock(HBasicBlock* block) const;
143 bool GoesToNextBlock(HBasicBlock* current, HBasicBlock* next) const;
156 virtual void Bind(HBasicBlock* block) = 0;
161 virtual uintptr_t GetAddressOf(HBasicBlock* block) const = 0;
166 const GrowableArray<HBasicBlock*>& block_order);
407 T* CommonGetLabelOf(T* raw_pointer_to_labels_array, HBasicBlock* block) const {
449 const GrowableArray<HBasicBlock*>* block_order_
[all...] |
