Home
last modified time | relevance | path

Searched refs:subgraph_nodes (Results 1 – 25 of 43) sorted by relevance

12

/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/operator/subgraph/
H A Dbuild_subgraph.cc99 for (auto n : *subgraph_nodes) { in ResetNodeLabels()
103 subgraph_nodes->clear(); in ResetNodeLabels()
167 subgraph_nodes->push_back(cur_node); in LabelSubgraph()
283 std::sort(subgraph_nodes->begin(), subgraph_nodes->end(), sim_node_cmp); in LabelSubgraph()
338 CHECK(subgraph_nodes->empty()); in PreSelectSubgraphNodes()
446 for (auto subgraph_node : subgraph_nodes) { in FindInputEntries()
485 if (subgraph_nodes.empty()) return; in FindOutputEntries()
488 for (auto subgraph_node : subgraph_nodes) { in FindOutputEntries()
705 for (auto node : subgraph_nodes) { in AdjustSubgraphNode()
800 std::set<BiDirectedNode*> simple_node_set(subgraph_nodes[i].begin(), subgraph_nodes[i].end()); in BuildSubgraph()
[all …]
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/operator/subgraph/
H A Dbuild_subgraph.cc99 for (auto n : *subgraph_nodes) { in ResetNodeLabels()
103 subgraph_nodes->clear(); in ResetNodeLabels()
167 subgraph_nodes->push_back(cur_node); in LabelSubgraph()
283 std::sort(subgraph_nodes->begin(), subgraph_nodes->end(), sim_node_cmp); in LabelSubgraph()
338 CHECK(subgraph_nodes->empty()); in PreSelectSubgraphNodes()
446 for (auto subgraph_node : subgraph_nodes) { in FindInputEntries()
485 if (subgraph_nodes.empty()) return; in FindOutputEntries()
488 for (auto subgraph_node : subgraph_nodes) { in FindOutputEntries()
705 for (auto node : subgraph_nodes) { in AdjustSubgraphNode()
800 std::set<BiDirectedNode*> simple_node_set(subgraph_nodes[i].begin(), subgraph_nodes[i].end()); in BuildSubgraph()
[all …]
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/operator/subgraph/mkldnn/
H A Dmkldnn_post_quantize_align_scale_property.h144 void AdjustSubgraphNode(const std::vector<nnvm::Node *> &subgraph_nodes,
149 for (size_t i = 0; i < subgraph_nodes.size(); ++i) {
150 auto this_min_calib = dmlc::stof(subgraph_nodes[i]->attrs.dict["min_calib_range"]);
151 auto this_max_calib = dmlc::stof(subgraph_nodes[i]->attrs.dict["max_calib_range"]);
155 for (size_t i = 0; i < subgraph_nodes.size(); ++i) {
156 auto &n = *subgraph_nodes[i];
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/operator/subgraph/mkldnn/
H A Dmkldnn_post_quantize_align_scale_property.h144 void AdjustSubgraphNode(const std::vector<nnvm::Node *> &subgraph_nodes,
149 for (size_t i = 0; i < subgraph_nodes.size(); ++i) {
150 auto this_min_calib = dmlc::stof(subgraph_nodes[i]->attrs.dict["min_calib_range"]);
151 auto this_max_calib = dmlc::stof(subgraph_nodes[i]->attrs.dict["max_calib_range"]);
155 for (size_t i = 0; i < subgraph_nodes.size(); ++i) {
156 auto &n = *subgraph_nodes[i];
/dports/biology/lamarc/lamarc-2.1.8/boost/graph/detail/
H A Dread_graphviz_spirit.hpp253 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
259 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
263 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
508 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/devel/boost-docs/boost_1_72_0/boost/graph/detail/
H A Dread_graphviz_spirit.hpp259 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
265 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
269 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
533 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/devel/hyperscan/boost_1_75_0/boost/graph/detail/
H A Dread_graphviz_spirit.hpp257 = (var(subgraph_nodes))[arg1]), in definition()
262 [(var(subgraph_nodes))[subgraph.name] in definition()
269 = (var(subgraph_nodes))[arg1]), in definition()
590 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/detail/
H A Dread_graphviz_spirit.hpp257 = (var(subgraph_nodes))[arg1]), in definition()
262 [(var(subgraph_nodes))[subgraph.name] in definition()
269 = (var(subgraph_nodes))[arg1]), in definition()
590 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/detail/
H A Dread_graphviz_spirit.hpp259 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
265 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
269 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
533 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/detail/
H A Dread_graphviz_spirit.hpp259 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
265 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
269 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
533 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/detail/
H A Dread_graphviz_spirit.hpp257 = (var(subgraph_nodes))[arg1]), in definition()
262 [(var(subgraph_nodes))[subgraph.name] in definition()
269 = (var(subgraph_nodes))[arg1]), in definition()
590 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/detail/
H A Dread_graphviz_spirit.hpp257 = (var(subgraph_nodes))[arg1]), in definition()
262 [(var(subgraph_nodes))[subgraph.name] in definition()
269 = (var(subgraph_nodes))[arg1]), in definition()
590 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/databases/xtrabackup/boost_1_59_0/boost/graph/detail/
H A Dread_graphviz_spirit.hpp259 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
265 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
269 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
533 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/databases/percona57-server/boost_1_59_0/boost/graph/detail/
H A Dread_graphviz_spirit.hpp259 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
265 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
269 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
533 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/detail/
H A Dread_graphviz_spirit.hpp259 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
265 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
269 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
533 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/databases/percona57-client/boost_1_59_0/boost/graph/detail/
H A Dread_graphviz_spirit.hpp259 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
265 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
269 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
533 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/detail/
H A Dread_graphviz_spirit.hpp259 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
265 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
269 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
533 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/devel/boost-libs/boost_1_72_0/boost/graph/detail/
H A Dread_graphviz_spirit.hpp259 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
265 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
269 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
533 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/devel/boost-python-libs/boost_1_72_0/boost/graph/detail/
H A Dread_graphviz_spirit.hpp259 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
265 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
269 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
533 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/detail/
H A Dread_graphviz_spirit.hpp259 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
265 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
269 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
533 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/detail/
H A Dread_graphviz_spirit.hpp259 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
265 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
269 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
533 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/detail/
H A Dread_graphviz_spirit.hpp259 (subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
265 [(var(subgraph_nodes))[subgraph.name] = subgraph.nodes] in definition()
269 >> ID[(subgraph.nodes = (var(subgraph_nodes))[arg1]), in definition()
533 subgraph_nodes_t subgraph_nodes; // per-subgraph lists of nodes member
/dports/lang/v8/v8-9.6.180.12/src/compiler/
H A Dwasm-inlining.cc139 AllNodes subgraph_nodes(zone(), callee_end, graph()); in InlineCall() local
140 for (Node* node : subgraph_nodes.reachable) { in InlineCall()
/dports/cad/yosys/yosys-yosys-0.12/passes/techmap/
H A Dflowmap.cc479 …pool<RTLIL::SigBit> subgraph_nodes = {}, dict<RTLIL::SigBit, pool<RTLIL::SigBit>> subgraph_edges =… in dump_dot_graph()
483 if (subgraph_nodes.empty())
484 subgraph_nodes = nodes;
524 …::dump_dot_graph(filename, subgraph_nodes, subgraph_edges, inputs, outputs, node_style, edge_style…
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dtree-cfg.c10159 auto_vec <basic_block> subgraph_nodes; in test_fully_connected() local
10171 make_edge (subgraph_nodes[i], subgraph_nodes[j], 0); in test_fully_connected()
10177 ASSERT_EQ (n + 1, subgraph_nodes[0]->preds->length ()); in test_fully_connected()
10178 ASSERT_EQ (n + 1, subgraph_nodes[0]->succs->length ()); in test_fully_connected()
10183 ASSERT_EQ (n, subgraph_nodes[i]->preds->length ()); in test_fully_connected()
10192 subgraph_nodes[0])); in test_fully_connected()
10196 ASSERT_EQ (subgraph_nodes[0], in test_fully_connected()
10198 subgraph_nodes[i])); in test_fully_connected()
10206 subgraph_nodes[0])); in test_fully_connected()
10210 ASSERT_EQ (subgraph_nodes[0], in test_fully_connected()
[all …]

12