HomeSort by relevance Sort by last modified time
    Searched full:getsuccessors (Results 1 - 25 of 69) sorted by null

1 2 3

  /art/compiler/optimizing/
loop_optimization_test.cc 134 b = s->GetSuccessors()[0];
145 s = b->GetSuccessors()[1];
156 s = b->GetSuccessors()[1];
157 HBasicBlock* bi = b->GetSuccessors()[0];
161 bi = si->GetSuccessors()[0];
183 b = s->GetSuccessors()[0];
186 s = b->GetSuccessors()[1];
189 s = b->GetSuccessors()[1];
212 DCHECK(header->GetSuccessors()[1] == return_block_);
267 HBasicBlock* body = header->GetSuccessors()[0]
    [all...]
graph_test.cc 107 ASSERT_EQ(false_block->GetSuccessors()[0], return_block);
139 ASSERT_EQ(true_block->GetSuccessors()[0], return_block);
237 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors().size(), 1u);
238 ASSERT_EQ(if_instr->IfTrueSuccessor()->GetSuccessors()[0],
272 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors().size(), 1u);
273 ASSERT_EQ(if_instr->IfFalseSuccessor()->GetSuccessors()[0],
pretty_printer.h 85 const ArenaVector<HBasicBlock*>& successors = block->GetSuccessors();
136 PrintInt(current_block_->GetSuccessors()[0]->GetBlockId());
nodes_x86.h 118 return GetBlock()->GetSuccessors()[num_entries_];
nodes_mips.h 64 return GetBlock()->GetSuccessors()[num_entries_];
nodes.cc 79 if (successors_visited[current_id] == current->GetSuccessors().size()) {
83 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++];
163 for (HBasicBlock* successor : block->GetSuccessors()) {
249 DCHECK(ContainsElement(block->GetSuccessors(), successor));
286 if (successors_visited[current_id] == current->GetSuccessors().size()) {
289 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++];
321 for (HBasicBlock* successor : block->GetSuccessors()) {
332 for (HBasicBlock* successor : block->GetSuccessors()) {
567 if (block->GetSuccessors().size() > 1) {
    [all...]
graph_checker.cc 75 std::count(p->GetSuccessors().begin(), p->GetSuccessors().end(), block);
89 sorted_successors.assign(block->GetSuccessors().begin(), block->GetSuccessors().end());
196 if (block->GetSuccessors().size() > 1) {
579 if (loop_information->GetPreHeader()->GetSuccessors().size() != 1) {
584 loop_information->GetPreHeader()->GetSuccessors().size()));
    [all...]
block_builder.cc 250 DCHECK(!graph_->GetEntryBlock()->GetSuccessors().empty())
373 for (size_t i = 0, e = try_block->GetSuccessors().size(); i < e; ++i) {
374 HBasicBlock* successor = try_block->GetSuccessors()[i];
dead_code_elimination.cc 44 ArrayRef<HBasicBlock* const> live_successors(block->GetSuccessors());
72 DCHECK_EQ(live_successors[0], block->GetSuccessors()[switch_index]);
251 DCHECK_EQ(block->GetSuccessors().size(), 1u);
linear_order.cc 119 for (HBasicBlock* successor : current->GetSuccessors()) {
superblock_cloner.cc 248 if (successors_visited[current_id] == current->GetSuccessors().size()) {
252 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++];
404 for (HBasicBlock* succ : block->GetSuccessors()) {
448 for (HBasicBlock* orig_succ : orig_block->GetSuccessors()) {
  /dalvik/dx/src/com/android/dx/ssa/back/
IdenticalBlockCombiner.java 79 || iBlock.getSuccessors().size() > 1
92 if (jBlock.getSuccessors().size() == 1
160 IntList newSuccessors = block.getSuccessors().mutableCopy();
  /dalvik/dexgen/src/com/android/dexgen/rop/code/
BasicBlockList.java 232 IntList successors = block.getSuccessors();
269 IntList succ1 = block1.getSuccessors();
270 IntList succ2 = block2.getSuccessors();
LocalVariableExtractor.java 177 IntList successors = block.getSuccessors();
RopMethod.java 164 IntList successors = one.getSuccessors();
  /dalvik/dx/src/com/android/dx/rop/code/
BasicBlockList.java 231 IntList successors = block.getSuccessors();
267 IntList succ1 = block1.getSuccessors();
268 IntList succ2 = block2.getSuccessors();
  /dalvik/dx/src/com/android/dx/ssa/
SsaConverter.java 172 int countSuccessors = block.getSuccessors().cardinality();
242 BitSet successors = (BitSet)block.getSuccessors().clone();
279 if (block.getSuccessors().cardinality() > 1 && succ.getPredecessors().cardinality() > 1) {
Dominators.java 98 return block.getSuccessors();
104 return block.getSuccessors();
ConstCollector.java 203 if (insn.getBlock().getSuccessors().cardinality() > 1) {
393 && use.getBlock().getSuccessors().cardinality() > 1) {
  /dalvik/dexgen/src/com/android/dexgen/rop/
ByteBlock.java 133 public IntList getSuccessors() {
  /dalvik/dx/src/com/android/dx/cf/code/
ByteBlock.java 134 public IntList getSuccessors() {
Ropper.java 290 IntList getSuccessors() {
302 successors.add(subCaller.getSuccessors().get(0));
322 int succLabel = subCaller.getSuccessors().get(0);
680 IntList successors = block.getSuccessors();
802 IntList successors = block.getSuccessors();
841 successors = subroutines[subroutineLabel].getSuccessors();
    [all...]
  /dalvik/dx/src/com/android/dx/command/dump/
BlockDumper.java 237 IntList successors = bb.getSuccessors();
320 IntList successors = bb.getSuccessors();
DotDumper.java 145 IntList successors = bb.getSuccessors();
SsaDumper.java 150 if (block.getSuccessors().cardinality() == 0) {

Completed in 1297 milliseconds

1 2 3