| /external/v8/src/compiler/ |
| all-nodes.cc | 15 is_reachable_(graph->NodeCount(), false, local_zone),
23 is_reachable_(graph->NodeCount(), false, local_zone),
29 DCHECK_LT(end->id(), graph->NodeCount());
46 if (use == nullptr || use->id() >= graph->NodeCount()) {
|
| graph-trimmer.cc | 15 live_.reserve(graph->NodeCount());
|
| graph.h | 84 size_t NodeCount() const { return next_node_id_; }
|
| branch-elimination.cc | 19 node_conditions_(js_graph->graph()->NodeCount(), zone),
20 reduced_(js_graph->graph()->NodeCount(), zone),
|
| machine-graph-verifier.cc | 28 representation_vector_(graph->NodeCount(), MachineRepresentation::kNone,
89 for (size_t i = 0; i <= block->NodeCount(); ++i) {
91 i < block->NodeCount() ? block->NodeAt(i) : block->control_input();
93 DCHECK_EQ(block->NodeCount(), i);
314 for (size_t i = 0; i <= block->NodeCount(); ++i) {
316 i < block->NodeCount() ? block->NodeAt(i) : block->control_input();
318 DCHECK_EQ(block->NodeCount(), i);
[all...] |
| control-equivalence.h | 41 node_data_(graph->NodeCount(), zone) {}
|
| loop-analysis.cc | 59 info_(graph->NodeCount(), {nullptr, nullptr}, zone),
61 loop_num_(graph->NodeCount(), -1, zone),
518 new (graph->zone()) LoopTree(graph->NodeCount(), graph->zone());
|
| loop-variable-optimizer.cc | 31 limits_(graph->NodeCount(), zone),
32 reduced_(graph->NodeCount(), zone),
|
| store-store-elimination.cc | 338 // Initialize unobservable_ with js_graph->graph->NodeCount() empty sets.
343 in_revisit_(js_graph->graph()->NodeCount(), temp_zone),
344 unobservable_(js_graph->graph()->NodeCount(),
|
| graph-reducer.cc | 147 NodeId const max_id = static_cast<NodeId>(graph()->NodeCount() - 1);
|
| schedule.cc | 365 for (size_t i = 0; i < block->NodeCount();) {
442 for (size_t i = 0; i < from->NodeCount();) {
|
| loop-peeling.cc | 364 ZoneVector<bool> visited(graph->NodeCount(), false, tmp_zone);
|
| schedule.h | 91 size_t NodeCount() const { return nodes_.size(); }
|
| scheduler.cc | 39 node_data_.resize(graph->NodeCount(), DefaultSchedulerData());
49 size_t node_count_hint = node_hint_multiplier * graph->NodeCount();
[all...] |
| verifier.cc | [all...] |
| int64-lowering.cc | 39 replacements_ = zone->NewArray<Replacement>(graph->NodeCount());
40 memset(replacements_, 0, sizeof(Replacement) * graph->NodeCount());
[all...] |
| graph-visualizer.cc | 835 ZoneVector<byte> state(ar.graph.NodeCount(), kUnvisited, &local_zone);
|
| simd-scalar-lowering.cc | 40 replacements_ = zone()->NewArray<Replacement>(graph()->NodeCount());
41 memset(replacements_, 0, sizeof(Replacement) * graph()->NodeCount());
[all...] |
| effect-control-linearizer.cc | 355 for (; instr < block->NodeCount(); instr++) {
469 for (; instr < block->NodeCount(); instr++) {
[all...] |
| pipeline.cc | [all...] |
| simplified-lowering.cc | 295 count_(jsgraph->graph()->NodeCount()),
[all...] |
| wasm-compiler.cc | [all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 332 void reserve(unsigned NodeCount) { Nodes.reserve(NodeCount); }
|
| /external/swiftshader/third_party/subzero/src/ |
| IceCfg.cpp | 86 SizeT NodeCount = 0;
89 ++NodeCount;
98 std::to_string(NodeCount) + ")";
[all...] |
