Home
last modified time | relevance | path

Searched refs:out_nodes (Results 1 – 6 of 6) sorted by relevance

/third_party/mesa3d/src/gallium/drivers/swr/rasterizer/core/
Dthreads.cpp70 void CalculateProcessorTopology(CPUNumaNodes& out_nodes, uint32_t& out_numThreadsPerProcGroup) in CalculateProcessorTopology() argument
72 out_nodes.clear(); in CalculateProcessorTopology()
142 if (out_nodes.size() <= numaId) in CalculateProcessorTopology()
144 out_nodes.resize(numaId + 1); in CalculateProcessorTopology()
146 auto& numaNode = out_nodes[numaId]; in CalculateProcessorTopology()
199 if (physId + 1 > out_nodes.size()) in CalculateProcessorTopology()
200 out_nodes.resize(physId + 1); in CalculateProcessorTopology()
201 auto& numaNode = out_nodes[physId]; in CalculateProcessorTopology()
213 for (auto& node : out_nodes) in CalculateProcessorTopology()
242 out_nodes.resize(numPhysicalIds); in CalculateProcessorTopology()
[all …]
/third_party/mindspore/mindspore/lite/tools/optimizer/graph/
Ddecrease_transpose_algo.cc32 std::set<CNodePtr> *in_nodes, std::set<CNodePtr> *out_nodes, in FindAreaSurroundedByTranspose() argument
35 MS_ASSERT(in_nodes != nullptr && out_nodes != nullptr && middle_nodes != nullptr); in FindAreaSurroundedByTranspose()
49 out_nodes->insert(cur_node); in FindAreaSurroundedByTranspose()
89 out_nodes->find(cur_node_post) != out_nodes->end()) { in FindAreaSurroundedByTranspose()
96 out_nodes->insert(cur_node); in FindAreaSurroundedByTranspose()
121 …udgeCanOptimizerForMultiOp(const std::set<CNodePtr> &in_nodes, const std::set<CNodePtr> &out_nodes, in JudgeCanOptimizerForMultiOp() argument
128 SetTransType(out_nodes, &trans_info->post_); in JudgeCanOptimizerForMultiOp()
414 std::set<CNodePtr> out_nodes{}; in HandleGraphMultiNode() local
415 …auto status = FindAreaSurroundedByTranspose(func_graph, cnode, &in_nodes, &out_nodes, &middle_node… in HandleGraphMultiNode()
426 if (!JudgeCanOptimizerForMultiOp(in_nodes, out_nodes, middle_nodes, &trans_info)) { in HandleGraphMultiNode()
[all …]
Dtranspose_strategy.cc39 …tNodes(const FuncGraphPtr &func_graph, const CNodePtr &cnode, std::vector<AnfNodePtr> *out_nodes) { in GetPostNodes() argument
40 MS_ASSERT(func_graph != nullptr && cnode != nullptr && out_nodes != nullptr); in GetPostNodes()
54 std::transform(node_users.begin(), node_users.end(), std::back_inserter(*out_nodes), in GetPostNodes()
399 std::vector<AnfNodePtr> out_nodes; in CanFusionIfInsert() local
400 if (GetPostNodes(func_graph, cnode, &out_nodes) != lite::RET_OK) { in CanFusionIfInsert()
403 if (!IsInOutCanFuison(out_nodes, &trans_count, &trans_info->post_)) { in CanFusionIfInsert()
409 auto total_node_count = in_nodes.size() + out_nodes.size(); in CanFusionIfInsert()
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/enhancer/
Dsplit_n_optimizer.cc33 …const FuncGraphPtr &func_graph, const AnfNodePtr &node, std::vector<AnfNodePtr> *const out_nodes) { in GetSplitOutputs() argument
51 GetSplitOutputs(func_graph, output, out_nodes); in GetSplitOutputs()
53 out_nodes->push_back(output); in GetSplitOutputs()
/third_party/mindspore/mindspore/ccsrc/cxx_api/model/acl/acl_vm/
Dacl_multi_graph_session.cc101 auto out_nodes = kernel_graphs_[graph_id]->outputs(); in ConstructOutputRef() local
102 for (auto &out : out_nodes) { in ConstructOutputRef()
/third_party/mindspore/mindspore/lite/src/
Dsub_graph_kernel.h108 std::vector<LiteKernel *> out_nodes() { return this->out_nodes_; } in out_nodes() function