| /external/v8/src/compiler/ |
| D | all-nodes.cc | 15 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()
|
| D | machine-graph-verifier.cc | 28 representation_vector_(graph->NodeCount(), MachineRepresentation::kNone, in MachineRepresentationInferrer()
88 for (size_t i = 0; i <= block->NodeCount(); ++i) { in Run()
90 i < block->NodeCount() ? block->NodeAt(i) : block->control_input(); in Run()
92 DCHECK_EQ(block->NodeCount(), i); in Run()
290 for (size_t i = 0; i <= block->NodeCount(); ++i) { in Run()
292 i < block->NodeCount() ? block->NodeAt(i) : block->control_input(); in Run()
294 DCHECK_EQ(block->NodeCount(), i); in Run()
|
| D | graph-trimmer.cc | 15 live_.reserve(graph->NodeCount()); in GraphTrimmer()
|
| D | loop-analysis.cc | 59 info_(graph->NodeCount(), {nullptr, nullptr}, zone), in LoopFinderImpl()
61 loop_num_(graph->NodeCount(), -1, zone),
509 new (graph->zone()) LoopTree(graph->NodeCount(), graph->zone()); in BuildLoopTree()
|
| D | escape-analysis.cc | 630 if (status_.size() <= graph()->NodeCount()) { in ResizeStatusVector()
631 status_.resize(graph()->NodeCount() * 1.1, kUnknown); in ResizeStatusVector()
912 replacements_.resize(graph()->NodeCount()); in Run()
916 replacements_.resize(graph()->NodeCount()); in Run()
930 std::min(std::max(graph()->NodeCount() / 5, min_size), max_size); in AssignAliases()
934 CHECK_LT(graph()->NodeCount(), kUntrackable); in AssignAliases()
935 aliases_.resize(graph()->NodeCount(), kNotReachable); in AssignAliases()
993 virtual_states_.resize(graph()->NodeCount()); in RunObjectAnalysis()
|
| D | control-equivalence.h | 41 node_data_(graph->NodeCount(), EmptyData(), zone) {} in NON_EXPORTED_BASE()
|
| D | store-store-elimination.cc | 352 in_revisit_(js_graph->graph()->NodeCount(), temp_zone), in RedundantStoreFinder()
353 unobservable_(js_graph->graph()->NodeCount(), in RedundantStoreFinder()
|
| D | simd-scalar-lowering.cc | 36 replacements_ = zone->NewArray<Replacement>(graph->NodeCount()); in SimdScalarLowering()
37 memset(replacements_, 0, sizeof(Replacement) * graph->NodeCount()); in SimdScalarLowering()
|
| D | graph-reducer.cc | 138 NodeId const max_id = static_cast<NodeId>(graph()->NodeCount() - 1); in ReduceTop()
|
| D | branch-elimination.cc | 19 node_conditions_(zone, js_graph->graph()->NodeCount()), in BranchElimination()
|
| D | schedule.h | 85 size_t NodeCount() const { return nodes_.size(); } in NON_EXPORTED_BASE()
|
| D | verifier.cc | 1437 use_pos = static_cast<int>(block->NodeCount()) - 1; in HasDominatingDef()
1463 use_pos = static_cast<int>(use_block->NodeCount()) - 1; in CheckInputsDominate()
1649 static_cast<int>(block->NodeCount()) - 1); in Run()
1652 for (size_t i = 0; i < block->NodeCount(); i++) { in Run()
|
| D | loop-peeling.cc | 364 ZoneVector<bool> visited(graph->NodeCount(), false, temp_zone); in EliminateLoopExits()
|
| D | osr.cc | 58 const size_t original_count = graph->NodeCount(); in PeelOuterLoopsForOsr()
|
| D | escape-analysis-reducer.cc | 31 fully_reduced_(static_cast<int>(jsgraph->graph()->NodeCount() * 2), zone), in EscapeAnalysisReducer()
|
| D | graph.h | 171 size_t NodeCount() const { return next_node_id_; } in NON_EXPORTED_BASE()
|
| D | loop-variable-optimizer.cc | 31 limits_(graph->NodeCount(), zone), in LoopVariableOptimizer()
|
| D | int64-lowering.cc | 38 replacements_ = zone->NewArray<Replacement>(graph->NodeCount()); in Int64Lowering()
39 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 | 684 ZoneVector<byte> state(ar.graph.NodeCount(), kUnvisited, &local_zone); in operator <<()
|
| D | effect-control-linearizer.cc | 334 for (; instr < block->NodeCount(); instr++) { in Run()
438 for (; instr < block->NodeCount(); instr++) { in Run()
|
| D | pipeline.cc | 1236 temp_zone, data->graph()->NodeCount(), linkage, data->sequence(), in Run()
|
| D | simplified-lowering.cc | 291 count_(jsgraph->graph()->NodeCount()), in RepresentationSelector()
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| D | ExplodedGraph.h | 332 void reserve(unsigned NodeCount) { Nodes.reserve(NodeCount); } in reserve() argument
|
| /external/swiftshader/third_party/subzero/src/ |
| D | IceCfg.cpp | 86 SizeT NodeCount = 0; in getFunctionNameAndSize() local
89 ++NodeCount; in getFunctionNameAndSize()
98 std::to_string(NodeCount) + ")"; in getFunctionNameAndSize()
|