Home
last modified time | relevance | path

Searched refs:NodeCount (Results 1 - 25 of 26) sorted by relevance

12

/third_party/node/deps/v8/src/compiler/
H A 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()
H A Dgraph-trimmer.cc15 live_.reserve(graph->NodeCount()); in GraphTrimmer()
H A Dmachine-graph-verifier.cc28 representation_vector_(graph->NodeCount(), MachineRepresentation::kNone, in MachineRepresentationInferrer()
102 for (size_t i = 0; i <= block->NodeCount(); ++i) { in Run()
104 i < block->NodeCount() ? block->NodeAt(i) : block->control_input(); in Run()
106 DCHECK_EQ(block->NodeCount(), i); in Run()
363 for (size_t i = 0; i <= block->NodeCount(); ++i) { in Run()
365 i < block->NodeCount() ? block->NodeAt(i) : block->control_input(); in Run()
367 DCHECK_EQ(block->NodeCount(), i); in Run()
H A Dadd-type-assertions-reducer.cc17 visited_(jsgraph->graph()->NodeCount(), zone) {} in AddTypeAssertionsReducer()
H A Dgraph.h90 size_t NodeCount() const { return next_node_id_; } in NodeCount() function in v8::internal::compiler::final
H A Dwasm-inlining.h52 initial_graph_size_(mcgraph->graph()->NodeCount()), in WasmInliner()
H A Dcontrol-equivalence.h41 node_data_(graph->NodeCount(), zone) {} in ControlEquivalence()
H A Dbranch-elimination.cc23 node_conditions_(js_graph->graph()->NodeCount(), zone), in BranchElimination()
24 reduced_(js_graph->graph()->NodeCount(), zone), in BranchElimination()
H A Dloop-variable-optimizer.cc31 limits_(graph->NodeCount(), zone), in LoopVariableOptimizer()
32 reduced_(graph->NodeCount(), zone), in LoopVariableOptimizer()
H A Dstore-store-elimination.cc198 // Note that we Initialize unobservable_ with js_graph->graph->NodeCount()
206 in_revisit_(js_graph->graph()->NodeCount(), temp_zone), in RedundantStoreFinder()
207 unobservable_(js_graph->graph()->NodeCount(), in RedundantStoreFinder()
H A Dloop-analysis.cc71 info_(graph->NodeCount(), {nullptr, nullptr, false}, zone), in LoopFinderImpl()
73 loop_num_(graph->NodeCount(), -1, zone),
542 graph->zone()->New<LoopTree>(graph->NodeCount(), graph->zone()); in BuildLoopTree()
H A Dcsa-load-elimination.h35 node_states_(jsgraph->graph()->NodeCount(), zone), in CsaLoadElimination()
H A Dloop-peeling.cc272 ZoneVector<bool> visited(graph->NodeCount(), false, tmp_zone); in EliminateLoopExits()
H A Dschedule.cc363 for (size_t node_pos = 0; node_pos < block->NodeCount(); ++node_pos) { in EliminateRedundantPhiNodes()
399 for (size_t i = 0; i < from->NodeCount();) { in MovePhis()
H A Dwasm-inlining.cc196 size_t subgraph_min_node_id = graph()->NodeCount(); in Finalize()
232 size_t additional_nodes = graph()->NodeCount() - subgraph_min_node_id; in Finalize()
H A Dgraph-reducer.cc175 NodeId const max_id = static_cast<NodeId>(graph()->NodeCount() - 1); in ReduceTop()
H A Dschedule.h94 size_t NodeCount() const { return nodes_.size(); } in NodeCount() function in v8::internal::compiler::final
H A Dverifier.cc1913 use_pos = static_cast<int>(block->NodeCount()) - 1; in HasDominatingDef()
1939 use_pos = static_cast<int>(use_block->NodeCount()) - 1; in CheckInputsDominate()
2121 static_cast<int>(block->NodeCount()) - 1); in Run()
2124 for (size_t i = 0; i < block->NodeCount(); i++) { in Run()
H A Dint64-lowering.cc34 state_(graph->NodeCount(), State::kUnvisited), in Int64Lowering()
42 replacements_ = zone->NewArray<Replacement>(graph->NodeCount()); in Int64Lowering()
43 memset(replacements_, 0, sizeof(Replacement) * graph->NodeCount()); in Int64Lowering()
H A Dscheduler.cc45 node_data_.resize(graph->NodeCount(), DefaultSchedulerData()); in Scheduler()
57 size_t node_count_hint = node_hint_multiplier * graph->NodeCount(); in ComputeSchedule()
1321 visited_(graph_->NodeCount(), false, zone), in PrepareUsesVisitor()
H A Djs-inlining.cc418 subgraph_min_node_id = graph()->NodeCount(); in ReduceJSWasmCall()
H A Dpipeline.cc1625 if (!WasmInliner::graph_size_allows_inlining(data->graph()->NodeCount())) { in Run()
2185 temp_zone, data->graph()->NodeCount(), linkage, data->sequence(), in Run()
2847 ZoneVector<byte> state(graph->NodeCount(), kUnvisited, &local_zone); in HashGraphForPGO()
2848 ZoneVector<NodeId> traversal_numbers(graph->NodeCount(), kUnassigned, in HashGraphForPGO()
H A Dgraph-visualizer.cc845 ZoneVector<byte> state(ar.graph.NodeCount(), kUnvisited, &local_zone); in operator <<()
H A Draw-machine-assembler.cc171 if (block->control() == BasicBlock::kBranch && block->NodeCount() == 1) { in OptimizeControlFlow()
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
H A DIceCfg.cpp77 SizeT NodeCount = 0; in getFunctionNameAndSize()
80 ++NodeCount; in getFunctionNameAndSize()
89 ":b=" + std::to_string(NodeCount) + ")"; in getFunctionNameAndSize()

Completed in 31 milliseconds

12