HomeSort by relevance Sort by last modified time
    Searched refs:AddBlock (Results 1 - 25 of 48) sorted by null

1 2

  /art/compiler/optimizing/
gvn_test.cc 35 graph->AddBlock(entry);
44 graph->AddBlock(block);
120 graph->AddBlock(entry);
129 graph->AddBlock(block);
145 graph->AddBlock(then);
146 graph->AddBlock(else_);
147 graph->AddBlock(join);
203 graph->AddBlock(entry);
213 graph->AddBlock(block);
230 graph->AddBlock(loop_header)
    [all...]
bounds_check_elimination_test.cc 70 graph_->AddBlock(entry);
83 graph_->AddBlock(block1);
91 graph_->AddBlock(block2);
104 graph_->AddBlock(block3);
115 graph_->AddBlock(block4);
128 graph_->AddBlock(block5);
141 graph_->AddBlock(exit);
167 graph_->AddBlock(entry);
181 graph_->AddBlock(block1);
189 graph_->AddBlock(block2)
    [all...]
licm_test.cc 47 graph_->AddBlock(entry_);
48 graph_->AddBlock(loop_preheader_);
49 graph_->AddBlock(loop_header_);
50 graph_->AddBlock(loop_body_);
51 graph_->AddBlock(return_);
52 graph_->AddBlock(exit_);
nodes_test.cc 35 graph->AddBlock(entry);
43 graph->AddBlock(first_block);
50 graph->AddBlock(exit_block);
78 graph->AddBlock(entry);
106 graph->AddBlock(entry);
127 graph->AddBlock(entry);
graph_checker_test.cc 34 graph->AddBlock(entry_block);
38 graph->AddBlock(exit_block);
codegen_test.cc 638 graph->AddBlock(entry);
643 graph->AddBlock(first_block);
656 graph->AddBlock(then_block);
657 graph->AddBlock(else_block);
658 graph->AddBlock(exit_block);
700 graph->AddBlock(entry_block);
704 graph->AddBlock(code_block);
706 graph->AddBlock(exit_block);
748 graph->AddBlock(entry_block);
753 graph->AddBlock(if_block)
    [all...]
block_builder.cc 122 graph_->AddBlock(block);
138 graph_->AddBlock(block);
170 graph_->AddBlock(block);
187 graph_->AddBlock(graph_->GetExitBlock());
298 graph_->AddBlock(new_catch_block);
register_allocator_test.cc 463 graph->AddBlock(entry);
470 graph->AddBlock(block);
487 graph->AddBlock(then);
488 graph->AddBlock(else_);
489 graph->AddBlock(join);
616 graph->AddBlock(entry);
623 graph->AddBlock(block);
640 graph->AddBlock(exit);
692 graph->AddBlock(entry);
702 graph->AddBlock(block)
    [all...]
graph_test.cc 30 graph->AddBlock(if_block);
41 graph->AddBlock(block);
55 graph->AddBlock(block);
63 graph->AddBlock(block);
induction_var_analysis_test.cc 42 graph_->AddBlock(loop_preheader_[d]);
44 graph_->AddBlock(loop_header_[d]);
50 graph_->AddBlock(loop_body_[d]);
69 graph_->AddBlock(entry_);
72 graph_->AddBlock(return_);
74 graph_->AddBlock(exit_);
114 graph_->AddBlock(cond);
115 graph_->AddBlock(ifTrue);
116 graph_->AddBlock(ifFalse);
constant_folding_test.cc 747 graph_->AddBlock(entry_block);
750 graph_->AddBlock(block);
752 graph_->AddBlock(exit_block);
induction_var_range_test.cc 60 graph_->AddBlock(entry_block_);
61 graph_->AddBlock(exit_block_);
75 graph_->AddBlock(loop_preheader_);
77 graph_->AddBlock(loop_header);
79 graph_->AddBlock(loop_body);
81 graph_->AddBlock(return_block);
    [all...]
  /system/update_engine/payload_generator/
block_mapping.h 44 BlockId AddBlock(const brillo::Blob& block_data);
65 BlockId AddBlock(int fd, off_t byte_offset, const brillo::Blob& block_data);
block_mapping.cc 43 BlockMapping::BlockId BlockMapping::AddBlock(const brillo::Blob& block_data) {
44 return AddBlock(-1, 0, block_data);
54 return AddBlock(fd, byte_offset, blob);
71 BlockMapping::BlockId BlockMapping::AddBlock(int fd,
147 if (mapping.AddBlock(brillo::Blob(block_size, '\0')) != 0)
block_mapping_unittest.cc 69 EXPECT_EQ(0, bm_.AddBlock(blob));
71 EXPECT_EQ(1, bm_.AddBlock(blob));
92 EXPECT_EQ(0, bm_.AddBlock(block));
extent_ranges_unittest.cc 154 ranges.AddBlock(0);
156 ranges.AddBlock(1);
157 ranges.AddBlock(3);
163 ranges.AddBlock(2);
167 ranges.AddBlock(kSparseHole);
217 ranges_a.AddBlock(0);
218 ranges_b.AddBlock(4);
219 ranges_b.AddBlock(3);
extent_ranges.h 50 void AddBlock(uint64_t block);
  /external/dbus-binding-generator/chromeos-dbus-bindings/
indented_text.h 25 void AddBlock(const IndentedText& block);
indented_text_unittest.cc 60 TEST_F(IndentedTextTest, AddBlock) {
68 text_.AddBlock(block0);
69 text_.AddBlock(block1);
adaptor_generator.cc 322 text->AddBlock(block);
374 text->AddBlock(block);
412 text->AddBlock(block);
476 text->AddBlock(block);
497 text->AddBlock(block);
indented_text.cc 26 void IndentedText::AddBlock(const IndentedText& block) {
  /external/v8/src/
zone.h 205 Vector<T> AddBlock(T value, int count, Zone* zone) {
206 return List<T, ZoneAllocationPolicy>::AddBlock(value, count,
small-pointer-list.h 33 list()->AddBlock(NULL, capacity - list()->capacity(), zone);
  /external/v8/src/crankshaft/
hydrogen-flow-engine.h 78 loop_effects_.AddBlock(NULL, graph_->blocks()->length(), zone);
191 pred_counts_.AddBlock(0, graph_->blocks()->length(), zone_);
194 block_states_.AddBlock(NULL, graph_->blocks()->length(), zone_);
  /external/v8/test/cctest/
test-utils.cc 198 Vector<int> block = collector.AddBlock(7, 0xbadcafe);
257 collector.AddBlock(

Completed in 675 milliseconds

1 2