| /external/v8/src/compiler/ |
| all-nodes.cc | 14 : live(local_zone), is_live(graph->NodeCount(), false, local_zone) {
25 if (input->id() >= graph->NodeCount()) {
|
| graph-trimmer.cc | 15 live_.reserve(graph->NodeCount());
|
| control-equivalence.h | 38 node_data_(graph->NodeCount(), EmptyData(), zone) {}
|
| loop-analysis.cc | 58 info_(graph->NodeCount(), {nullptr, nullptr}, zone),
60 loop_num_(graph->NodeCount(), -1, zone),
452 new (graph->zone()) LoopTree(graph->NodeCount(), graph->zone());
|
| escape-analysis.cc | 607 if (status_.size() <= graph()->NodeCount()) {
608 status_.resize(graph()->NodeCount() * 1.1, kUnknown);
862 replacements_.resize(graph()->NodeCount());
866 replacements_.resize(graph()->NodeCount());
877 std::min(std::max(graph()->NodeCount() / 5, min_size), max_size);
881 CHECK_LT(graph()->NodeCount(), kUntrackable);
882 aliases_.resize(graph()->NodeCount(), kNotReachable);
940 virtual_states_.resize(graph()->NodeCount());
[all...] |
| graph-reducer.cc | 130 NodeId const max_id = static_cast<NodeId>(graph()->NodeCount() - 1);
|
| graph.h | 116 size_t NodeCount() const { return next_node_id_; }
|
| schedule.h | 82 size_t NodeCount() const { return nodes_.size(); }
|
| branch-elimination.cc | 19 node_conditions_(zone, js_graph->graph()->NodeCount()),
|
| escape-analysis-reducer.cc | 31 fully_reduced_(static_cast<int>(jsgraph->graph()->NodeCount() * 2), zone),
|
| osr.cc | 50 const size_t original_count = graph->NodeCount();
|
| verifier.cc | [all...] |
| int64-lowering.cc | 37 replacements_ = zone->NewArray<Replacement>(graph->NodeCount());
38 memset(replacements_, 0, sizeof(Replacement) * graph->NodeCount());
[all...] |
| scheduler.cc | 36 node_data_(graph_->NodeCount(), DefaultSchedulerData(), zone) {}
41 Schedule(graph->zone(), static_cast<size_t>(graph->NodeCount()));
[all...] |
| graph-visualizer.cc | 658 ZoneVector<byte> state(ar.graph.NodeCount(), kUnvisited, &local_zone);
|
| effect-control-linearizer.cc | 147 for (; instr < block->NodeCount(); instr++) {
247 for (; instr < block->NodeCount(); instr++) {
[all...] |
| pipeline.cc | [all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| wct.h | 66 typedef VOID (CALLBACK *PWAITCHAINCALLBACK)(HWCT WctHandle,DWORD_PTR Context,DWORD CallbackStatus,LPDWORD NodeCount,PWAITCHAIN_NODE_INFO NodeInfoArray,LPBOOL IsCycle);
70 WINBOOL WINAPI GetThreadWaitChain(HWCT WctHandle,DWORD_PTR Context,DWORD Flags,DWORD ThreadId,LPDWORD NodeCount,PWAITCHAIN_NODE_INFO NodeInfoArray,LPBOOL IsCycle);
|
| clusapi.h | 216 DWORD WINAPI SetClusterGroupNodeList(HGROUP hGroup,DWORD NodeCount,HNODE NodeList[]);
[all...] |
| /external/v8/test/unittests/compiler/ |
| graph-reducer-unittest.cc | 529 size_t before = graph()->NodeCount();
531 EXPECT_EQ(before, graph()->NodeCount());
549 size_t before = graph()->NodeCount();
551 EXPECT_EQ(before, graph()->NodeCount());
574 size_t before = graph()->NodeCount();
577 EXPECT_NE(before, graph()->NodeCount());
579 EXPECT_EQ(before, graph()->NodeCount());
601 EXPECT_EQ(1U, graph()->NodeCount());
606 EXPECT_EQ(2U, graph()->NodeCount());
619 EXPECT_EQ(1U, graph()->NodeCount());
[all...] |
| control-equivalence-unittest.cc | 39 classes_.resize(graph()->NodeCount());
46 BitVector in_class(static_cast<int>(graph()->NodeCount()), zone());
|
| instruction-selector-unittest.cc | 34 size_t const node_count = graph()->NodeCount();
|
| scheduler-unittest.cc | 55 node_count += block->NodeCount();
|
| /external/v8/test/cctest/compiler/ |
| test-js-constant-cache.cc | 338 size_t count_before = T.graph()->NodeCount();
360 size_t count_before = T.graph()->NodeCount();
382 size_t count_before = T.graph()->NodeCount();
404 size_t count_before = T.graph()->NodeCount();
431 size_t count_before = T.graph()->NodeCount();
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
| portcls.h | 384 ULONG NodeCount;
[all...] |
