Home
last modified time | relevance | path

Searched defs:node_iter (Results 1 – 17 of 17) sorted by relevance

/third_party/boost/libs/iterator/example/
Dnode_iterator3.hpp16 class node_iter class
32 node_iter() in node_iter() function in node_iter
35 explicit node_iter(Value* p) in node_iter() function in node_iter
39 node_iter( in node_iter() function in node_iter
Dnode_iterator2.hpp16 class node_iter class
27 node_iter() in node_iter() function in node_iter
30 explicit node_iter(Value* p) in node_iter() function in node_iter
34 node_iter( in node_iter() function in node_iter
/third_party/mindspore/mindspore/lite/tools/converter/parser/onnx/
Donnx_conv_parser.cc32 auto node_iter = in GetConvChannel() local
58 auto node_iter = in GetConvChannel() local
Donnx_expand_parser.cc40 auto node_iter = in Parse() local
Donnx_conv_transpose_parser.cc89 auto node_iter = in Parse() local
Donnx_activation_parser.cc56 auto node_iter = std::find_if(onnx_graph.initializer().begin(), onnx_graph.initializer().end(), in Parse() local
/third_party/skia/third_party/externals/spirv-tools/source/opt/
Ddominator_tree.h256 DominatorTreeNodeMap::iterator node_iter = nodes_.find(id); in GetTreeNode() local
265 DominatorTreeNodeMap::const_iterator node_iter = nodes_.find(id); in GetTreeNode() local
Ddominator_tree.cpp280 std::map<uint32_t, DominatorTreeNode>::iterator node_iter = in GetOrInsertNode() local
/third_party/spirv-tools/source/opt/
Ddominator_tree.h256 DominatorTreeNodeMap::iterator node_iter = nodes_.find(id); in GetTreeNode() local
265 DominatorTreeNodeMap::const_iterator node_iter = nodes_.find(id); in GetTreeNode() local
Ddominator_tree.cpp280 std::map<uint32_t, DominatorTreeNode>::iterator node_iter = in GetOrInsertNode() local
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
Ddominator_tree.h256 DominatorTreeNodeMap::iterator node_iter = nodes_.find(id); in GetTreeNode() local
265 DominatorTreeNodeMap::const_iterator node_iter = nodes_.find(id); in GetTreeNode() local
Ddominator_tree.cpp280 std::map<uint32_t, DominatorTreeNode>::iterator node_iter = in GetOrInsertNode() local
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/trt_pass/
Dtrt_converter_context.cc194 auto node_iter = output_map_.find(item.first); in LoadLayerInput() local
/third_party/mindspore/mindspore/lite/tools/common/
Dgraph_util.cc344 for (auto node_iter = graphT->nodes.begin(); node_iter != graphT->nodes.end(); node_iter++) { in RemoveTensor() local
475 auto node_iter = graphT->nodes.begin() + existNodeIdx; in InsertNode() local
/third_party/mindspore/mindspore/ccsrc/vm/
Dgraph_partition.cc428 auto node_iter = node_to_segment.find(node); in AddSegmentDependency() local
/third_party/mindspore/mindspore/ccsrc/backend/session/
Dascend_auto_monad.cc941 auto node_iter = std::find(nodes.begin(), nodes.end(), jump_node); in InsertStackPush() local
951 auto node_iter = std::find(nodes.cbegin(), nodes.cend(), jump_node); in KeepOrderForStackPop() local
Dkernel_graph.cc347 AnfNodePtr node_iter = node; in GetLoopNodesByDFS() local