Home
last modified time | relevance | path

Searched refs:NodeSubset (Results 1 – 7 of 7) sorted by relevance

/external/tensorflow/tensorflow/lite/
Dgraph_info_test.cc99 std::vector<NodeSubset>* subgraphs) { in PartitionGraph()
109 const std::vector<NodeSubset>& generated_subgraphs, in CheckPartitionSubgraphs()
110 const std::vector<NodeSubset>& expected_subgraphs) { in CheckPartitionSubgraphs()
127 std::vector<NodeSubset> generated_subgraphs; in TEST()
141 std::vector<NodeSubset> generated_subgraphs; in TEST()
155 std::vector<NodeSubset> generated_subgraphs; in TEST()
158 NodeSubset expected_subgraph; in TEST()
159 expected_subgraph.type = NodeSubset::kTfNonPartition; in TEST()
173 std::vector<NodeSubset> generated_subgraphs; in TEST()
176 NodeSubset expected_subgraph; in TEST()
[all …]
Dgraph_info.cc41 std::vector<NodeSubset>* node_subsets) in PartitionGraphIntoIndependentNodeSubsetsImpl()
44 node_type_(info_->num_total_nodes(), NodeSubset::kTfNonPartition) { in PartitionGraphIntoIndependentNodeSubsetsImpl()
47 node_type_[node_index] = NodeSubset::kTfPartition; in PartitionGraphIntoIndependentNodeSubsetsImpl()
88 NodeSubset& output_subset = (*node_subsets_)[output_epoch]; in Partition()
94 for (NodeSubset& node_subset : *node_subsets_) { in Partition()
123 NodeSubset& current_subset = node_subsets_->back(); in UpdateNode()
141 if (current_subset.type == NodeSubset::kTfUnexplored) { in UpdateNode()
170 NodeSubset& input_subset = (*node_subsets_)[input_epoch]; in UpdateNode()
183 node_subsets_->emplace_back(NodeSubset()); in BuildNodeSubset()
200 std::vector<NodeSubset>* node_subsets_;
[all …]
Dgraph_info.h67 struct NodeSubset { struct
91 std::vector<NodeSubset>* node_subsets); argument
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp33 class NodeSubset { class in llvm::Graph
36 NodeSubset(BitVector e) : Elements(e) {} in NodeSubset() function in llvm::Graph::NodeSubset
39 NodeSubset() : Elements(0) { in NodeSubset() function in llvm::Graph::NodeSubset
44 bool operator==(const NodeSubset &other) const { in operator ==()
47 bool operator!=(const NodeSubset &other) const { in operator !=()
75 bool isSubsetOf(const NodeSubset &other) const { in isSubsetOf()
80 NodeSubset Complement() const { in Complement()
85 NodeSubset Join(const NodeSubset &other) const { in Join()
90 NodeSubset Meet(const NodeSubset &other) const { in Meet()
96 typedef std::pair<unsigned, NodeSubset> NodeType;
[all …]
/external/llvm-project/llvm/unittests/ADT/
DTestGraph.h37 class NodeSubset {
40 NodeSubset(BitVector e) : Elements(e) {} in NodeSubset() function
43 NodeSubset() : Elements(0) { in NodeSubset() function
48 bool operator==(const NodeSubset &other) const {
51 bool operator!=(const NodeSubset &other) const {
79 bool isSubsetOf(const NodeSubset &other) const { in isSubsetOf()
84 NodeSubset Complement() const { in Complement()
89 NodeSubset Join(const NodeSubset &other) const { in Join()
94 NodeSubset Meet(const NodeSubset &other) const { in Meet()
100 typedef std::pair<unsigned, NodeSubset> NodeType;
[all …]
DSCCIteratorTest.cpp49 GT::NodeSubset NodesInSomeSCC; in TEST()
55 GT::NodeSubset NodesInThisSCC; in TEST()
76 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i); in TEST()
77 GT::NodeSubset ReachableButNotInSCC = in TEST()
106 GT::NodeSubset NodesReachableFromSCC = G.NodesReachableFrom(i); in TEST()
/external/tensorflow/tensorflow/lite/core/
Dsubgraph.cc309 const NodeSubset& node_subset) { in CreateDelegateParams()
352 void PopulatePreviewDelegateParams(const NodeSubset& node_subset, in PopulatePreviewDelegateParams()
387 std::vector<NodeSubset> node_subsets; in ReplaceNodeSubsetsWithDelegateKernels()
405 case NodeSubset::kTfNonPartition: in ReplaceNodeSubsetsWithDelegateKernels()
411 case NodeSubset::kTfPartition: { in ReplaceNodeSubsetsWithDelegateKernels()
432 case NodeSubset::kTfUnexplored: in ReplaceNodeSubsetsWithDelegateKernels()
512 std::vector<NodeSubset> node_subsets; in PreviewDelegatePartitioning()
518 if (node_subset.type != NodeSubset::kTfPartition) { in PreviewDelegatePartitioning()