| /external/v8/test/unittests/compiler/ |
| D | graph-reducer-unittest.cc | 529 size_t before = graph()->NodeCount(); in TEST_F()
531 EXPECT_EQ(before, graph()->NodeCount()); in TEST_F()
549 size_t before = graph()->NodeCount(); in TEST_F()
551 EXPECT_EQ(before, graph()->NodeCount()); in TEST_F()
574 size_t before = graph()->NodeCount(); in TEST_F()
577 EXPECT_NE(before, graph()->NodeCount()); in TEST_F()
579 EXPECT_EQ(before, graph()->NodeCount()); in TEST_F()
601 EXPECT_EQ(1U, graph()->NodeCount()); in TEST_F()
606 EXPECT_EQ(2U, graph()->NodeCount()); in TEST_F()
619 EXPECT_EQ(1U, graph()->NodeCount()); in TEST_F()
[all …]
|
| D | control-equivalence-unittest.cc | 39 classes_.resize(graph()->NodeCount()); in ComputeEquivalence()
46 BitVector in_class(static_cast<int>(graph()->NodeCount()), zone()); in IsEquivalenceClass()
|
| D | instruction-selector-unittest.cc | 34 size_t const node_count = graph()->NodeCount(); in Build()
|
| D | scheduler-unittest.cc | 55 node_count += block->NodeCount(); in GetScheduledNodeCount()
|
| /external/v8/src/compiler/ |
| D | all-nodes.cc | 14 : live(local_zone), is_live(graph->NodeCount(), false, local_zone) { in AllNodes()
25 if (input->id() >= graph->NodeCount()) { in AllNodes()
|
| D | graph-trimmer.cc | 15 live_.reserve(graph->NodeCount()); in GraphTrimmer()
|
| D | loop-analysis.cc | 58 info_(graph->NodeCount(), {nullptr, nullptr}, zone), in LoopFinderImpl()
60 loop_num_(graph->NodeCount(), -1, zone),
452 new (graph->zone()) LoopTree(graph->NodeCount(), graph->zone()); in BuildLoopTree()
|
| D | control-equivalence.h | 38 node_data_(graph->NodeCount(), EmptyData(), zone) {} in ControlEquivalence()
|
| D | escape-analysis.cc | 607 if (status_.size() <= graph()->NodeCount()) { in ResizeStatusVector()
608 status_.resize(graph()->NodeCount() * 1.1, kUnknown); in ResizeStatusVector()
862 replacements_.resize(graph()->NodeCount()); in Run()
866 replacements_.resize(graph()->NodeCount()); in Run()
877 std::min(std::max(graph()->NodeCount() / 5, min_size), max_size); in AssignAliases()
881 CHECK_LT(graph()->NodeCount(), kUntrackable); in AssignAliases()
882 aliases_.resize(graph()->NodeCount(), kNotReachable); in AssignAliases()
940 virtual_states_.resize(graph()->NodeCount()); in RunObjectAnalysis()
|
| D | graph.h | 116 size_t NodeCount() const { return next_node_id_; } in NodeCount() function
|
| D | graph-reducer.cc | 130 NodeId const max_id = static_cast<NodeId>(graph()->NodeCount() - 1); in ReduceTop()
|
| D | verifier.cc | 1212 use_pos = static_cast<int>(block->NodeCount()) - 1; in HasDominatingDef()
1238 use_pos = static_cast<int>(use_block->NodeCount()) - 1; in CheckInputsDominate()
1424 static_cast<int>(block->NodeCount()) - 1); in Run()
1427 for (size_t i = 0; i < block->NodeCount(); i++) { in Run()
|
| D | branch-elimination.cc | 19 node_conditions_(zone, js_graph->graph()->NodeCount()), in BranchElimination()
|
| D | schedule.h | 82 size_t NodeCount() const { return nodes_.size(); } in NodeCount() function
|
| D | escape-analysis-reducer.cc | 31 fully_reduced_(static_cast<int>(jsgraph->graph()->NodeCount() * 2), zone), in EscapeAnalysisReducer()
|
| D | osr.cc | 50 const size_t original_count = graph->NodeCount(); in PeelOuterLoopsForOsr()
|
| D | int64-lowering.cc | 37 replacements_ = zone->NewArray<Replacement>(graph->NodeCount()); in Int64Lowering()
38 memset(replacements_, 0, sizeof(Replacement) * graph->NodeCount()); in Int64Lowering()
|
| D | scheduler.cc | 36 node_data_(graph_->NodeCount(), DefaultSchedulerData(), zone) {} in Scheduler()
41 Schedule(graph->zone(), static_cast<size_t>(graph->NodeCount())); in ComputeSchedule()
1197 BoolVector visited(graph_->NodeCount(), false, zone_); in PrepareUses()
|
| D | graph-visualizer.cc | 658 ZoneVector<byte> state(ar.graph.NodeCount(), kUnvisited, &local_zone); in operator <<()
|
| D | effect-control-linearizer.cc | 147 for (; instr < block->NodeCount(); instr++) { in Run()
247 for (; instr < block->NodeCount(); instr++) { in Run()
|
| D | pipeline.cc | 1140 temp_zone, data->graph()->NodeCount(), linkage, data->sequence(), in Run()
|
| D | simplified-lowering.cc | 231 count_(jsgraph->graph()->NodeCount()), in RepresentationSelector()
|
| D | wasm-compiler.cc | 3202 node_count = jsgraph_->graph()->NodeCount(); in ExecuteCompilation()
|
| /external/v8/test/cctest/compiler/ |
| D | test-js-constant-cache.cc | 338 size_t count_before = T.graph()->NodeCount(); in TEST()
360 size_t count_before = T.graph()->NodeCount(); in TEST()
382 size_t count_before = T.graph()->NodeCount(); in TEST()
404 size_t count_before = T.graph()->NodeCount(); in TEST()
431 size_t count_before = T.graph()->NodeCount(); in TEST()
|