| /art/compiler/optimizing/ |
| gvn_test.cc | 34 graph->AddBlock(entry);
43 graph->AddBlock(block);
118 graph->AddBlock(entry);
127 graph->AddBlock(block);
143 graph->AddBlock(then);
144 graph->AddBlock(else_);
145 graph->AddBlock(join);
200 graph->AddBlock(entry);
210 graph->AddBlock(block);
227 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...] |
| loop_optimization_test.cc | 46 graph_->AddBlock(entry_block_);
47 graph_->AddBlock(return_block_);
48 graph_->AddBlock(exit_block_);
66 graph_->AddBlock(header);
67 graph_->AddBlock(body);
|
| licm_test.cc | 58 graph_->AddBlock(entry_);
59 graph_->AddBlock(loop_preheader_);
60 graph_->AddBlock(loop_header_);
61 graph_->AddBlock(loop_body_);
62 graph_->AddBlock(return_);
63 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);
|
| codegen_test.cc | 421 graph->AddBlock(entry);
426 graph->AddBlock(first_block);
439 graph->AddBlock(then_block);
440 graph->AddBlock(else_block);
441 graph->AddBlock(exit_block);
483 graph->AddBlock(entry_block);
487 graph->AddBlock(code_block);
489 graph->AddBlock(exit_block);
531 graph->AddBlock(entry_block);
536 graph->AddBlock(if_block)
[all...] |
| graph_checker_test.cc | 34 graph->AddBlock(entry_block);
38 graph->AddBlock(exit_block);
|
| block_builder.cc | 123 graph_->AddBlock(block);
144 graph_->AddBlock(block);
180 graph_->AddBlock(block);
197 graph_->AddBlock(graph_->GetExitBlock());
308 graph_->AddBlock(new_catch_block);
|
| register_allocator_test.cc | 495 graph->AddBlock(entry);
502 graph->AddBlock(block);
519 graph->AddBlock(then);
520 graph->AddBlock(else_);
521 graph->AddBlock(join);
657 graph->AddBlock(entry);
664 graph->AddBlock(block);
681 graph->AddBlock(exit);
741 graph->AddBlock(entry);
751 graph->AddBlock(block)
[all...] |
| graph_test.cc | 29 graph->AddBlock(if_block);
40 graph->AddBlock(block);
54 graph->AddBlock(block);
62 graph->AddBlock(block);
|
| ssa_liveness_analysis_test.cc | 47 graph_->AddBlock(entry_);
55 graph->AddBlock(successor);
|
| induction_var_analysis_test.cc | 56 graph_->AddBlock(loop_preheader_[d]);
58 graph_->AddBlock(loop_header_[d]);
64 graph_->AddBlock(loop_body_[d]);
83 graph_->AddBlock(entry_);
86 graph_->AddBlock(return_);
88 graph_->AddBlock(exit_);
131 graph_->AddBlock(cond);
132 graph_->AddBlock(ifTrue);
133 graph_->AddBlock(ifFalse);
[all...] |
| scheduler_test.cc | 83 graph_->AddBlock(entry);
84 graph_->AddBlock(block1);
199 graph_->AddBlock(entry);
|
| load_store_analysis_test.cc | 38 graph_->AddBlock(entry);
110 graph_->AddBlock(entry);
189 graph_->AddBlock(entry);
273 graph_->AddBlock(entry);
|
| /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/v8/src/zone/ |
| zone.h | 190 Vector<T> AddBlock(T value, int count, Zone* zone) {
191 return List<T, ZoneAllocationPolicy>::AddBlock(value, count,
|
| /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/src/parsing/ |
| duplicate-finder.cc | 83 backing_store_.AddBlock(bytes);
|
| /external/v8/src/ |
| collector.h | 54 inline Vector<T> AddBlock(int size, T initial_value) {
72 inline Vector<T> AddBlock(Vector<const T> source) {
177 * NOTICE: Blocks allocated using Collector::AddBlock(int) can move
|
| small-pointer-list.h | 33 list()->AddBlock(NULL, capacity - list()->capacity(), zone);
|
| /external/protobuf/src/google/protobuf/ |
| arena.cc | 151 void Arena::AddBlock(Block* b) {
225 AddBlock(b);
|
