Home
last modified time | relevance | path

Searched refs:NodeCount (Results 1 – 24 of 24) sorted by relevance

/external/v8/src/compiler/
Dall-nodes.cc15 is_reachable_(graph->NodeCount(), false, local_zone), in AllNodes()
23 is_reachable_(graph->NodeCount(), false, local_zone), in AllNodes()
29 DCHECK_LT(end->id(), graph->NodeCount()); in Mark()
46 if (use == nullptr || use->id() >= graph->NodeCount()) { in Mark()
Dmachine-graph-verifier.cc28 representation_vector_(graph->NodeCount(), MachineRepresentation::kNone, in MachineRepresentationInferrer()
89 for (size_t i = 0; i <= block->NodeCount(); ++i) { in Run()
91 i < block->NodeCount() ? block->NodeAt(i) : block->control_input(); in Run()
93 DCHECK_EQ(block->NodeCount(), i); in Run()
314 for (size_t i = 0; i <= block->NodeCount(); ++i) { in Run()
316 i < block->NodeCount() ? block->NodeAt(i) : block->control_input(); in Run()
318 DCHECK_EQ(block->NodeCount(), i); in Run()
Dgraph-trimmer.cc15 live_.reserve(graph->NodeCount()); in GraphTrimmer()
Dbranch-elimination.cc19 node_conditions_(js_graph->graph()->NodeCount(), zone), in BranchElimination()
20 reduced_(js_graph->graph()->NodeCount(), zone), in BranchElimination()
Dgraph.h84 size_t NodeCount() const { return next_node_id_; } in NON_EXPORTED_BASE()
Dloop-analysis.cc59 info_(graph->NodeCount(), {nullptr, nullptr}, zone), in LoopFinderImpl()
61 loop_num_(graph->NodeCount(), -1, zone),
518 new (graph->zone()) LoopTree(graph->NodeCount(), graph->zone()); in BuildLoopTree()
Dloop-variable-optimizer.cc31 limits_(graph->NodeCount(), zone), in LoopVariableOptimizer()
32 reduced_(graph->NodeCount(), zone), in LoopVariableOptimizer()
Dcontrol-equivalence.h41 node_data_(graph->NodeCount(), zone) {} in NON_EXPORTED_BASE()
Dstore-store-elimination.cc343 in_revisit_(js_graph->graph()->NodeCount(), temp_zone), in RedundantStoreFinder()
344 unobservable_(js_graph->graph()->NodeCount(), in RedundantStoreFinder()
Dschedule.cc365 for (size_t i = 0; i < block->NodeCount();) { in EliminateNoopPhiNodes()
442 for (size_t i = 0; i < from->NodeCount();) { in MovePhis()
Dgraph-reducer.cc147 NodeId const max_id = static_cast<NodeId>(graph()->NodeCount() - 1); in ReduceTop()
Dschedule.h91 size_t NodeCount() const { return nodes_.size(); } in NON_EXPORTED_BASE()
Dloop-peeling.cc364 ZoneVector<bool> visited(graph->NodeCount(), false, tmp_zone); in EliminateLoopExits()
Dverifier.cc1812 use_pos = static_cast<int>(block->NodeCount()) - 1; in HasDominatingDef()
1838 use_pos = static_cast<int>(use_block->NodeCount()) - 1; in CheckInputsDominate()
2021 static_cast<int>(block->NodeCount()) - 1); in Run()
2024 for (size_t i = 0; i < block->NodeCount(); i++) { in Run()
Dscheduler.cc39 node_data_.resize(graph->NodeCount(), DefaultSchedulerData()); in Scheduler()
49 size_t node_count_hint = node_hint_multiplier * graph->NodeCount(); in ComputeSchedule()
1225 BoolVector visited(graph_->NodeCount(), false, zone_); in PrepareUses()
Dint64-lowering.cc39 replacements_ = zone->NewArray<Replacement>(graph->NodeCount()); in Int64Lowering()
40 memset(replacements_, 0, sizeof(Replacement) * graph->NodeCount()); in Int64Lowering()
Dsimd-scalar-lowering.cc40 replacements_ = zone()->NewArray<Replacement>(graph()->NodeCount()); in SimdScalarLowering()
41 memset(replacements_, 0, sizeof(Replacement) * graph()->NodeCount()); in SimdScalarLowering()
Dgraph-visualizer.cc835 ZoneVector<byte> state(ar.graph.NodeCount(), kUnvisited, &local_zone); in operator <<()
Dpipeline.cc1689 temp_zone, data->graph()->NodeCount(), linkage, data->sequence(), in Run()
Deffect-control-linearizer.cc355 for (; instr < block->NodeCount(); instr++) { in Run()
469 for (; instr < block->NodeCount(); instr++) { in Run()
Dsimplified-lowering.cc295 count_(jsgraph->graph()->NodeCount()), in RepresentationSelector()
Dwasm-compiler.cc5170 node_count = mcgraph->graph()->NodeCount(); in ExecuteCompilation()
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h332 void reserve(unsigned NodeCount) { Nodes.reserve(NodeCount); } in reserve() argument
/external/swiftshader/third_party/subzero/src/
DIceCfg.cpp86 SizeT NodeCount = 0; in getFunctionNameAndSize() local
89 ++NodeCount; in getFunctionNameAndSize()
98 std::to_string(NodeCount) + ")"; in getFunctionNameAndSize()