Home
last modified time | relevance | path

Searched refs:NodeDef (Results 1 – 25 of 532) sorted by relevance

12345678910>>...22

/external/tensorflow/tensorflow/core/grappler/
Dop_types.h25 bool IsAdd(const NodeDef& node);
26 bool IsAddN(const NodeDef& node);
27 bool IsAll(const NodeDef& node);
28 bool IsAngle(const NodeDef& node);
29 bool IsAny(const NodeDef& node);
30 bool IsAnyDiv(const NodeDef& node);
31 bool IsAnyBatchMatMul(const NodeDef& node);
32 bool IsAnyMatMul(const NodeDef& node);
33 bool IsAnyMax(const NodeDef& node);
34 bool IsAnyMaxPool(const NodeDef& node);
[all …]
Dop_types.cc30 bool IsAdd(const NodeDef& node) { in IsAdd()
41 bool IsAddN(const NodeDef& node) { return node.op() == "AddN"; } in IsAddN()
43 bool IsAll(const NodeDef& node) { return node.op() == "All"; } in IsAll()
45 bool IsAngle(const NodeDef& node) { return node.op() == "Angle"; } in IsAngle()
47 bool IsAny(const NodeDef& node) { return node.op() == "Any"; } in IsAny()
49 bool IsAnyDiv(const NodeDef& node) { in IsAnyDiv()
54 bool IsAnyBatchMatMul(const NodeDef& node) { in IsAnyBatchMatMul()
58 bool IsAnyMatMul(const NodeDef& node) { in IsAnyMatMul()
63 bool IsAnyMax(const NodeDef& node) { in IsAnyMax()
68 bool IsAnyMaxPool(const NodeDef& node) { in IsAnyMaxPool()
[all …]
Dmutable_graph_view.h43 class MutableGraphView : public internal::GraphViewInternal<GraphDef, NodeDef> {
46 for (NodeDef& node : *graph->mutable_node()) AddUniqueNodeOrDie(&node); in MutableGraphView()
47 for (NodeDef& node : *graph->mutable_node()) AddAndDedupFanouts(&node); in MutableGraphView()
64 NodeDef* AddNode(NodeDef&& node);
255 void AddAndDedupFanouts(NodeDef* node);
284 Status UpdateFanoutsInternal(NodeDef* from_node, NodeDef* to_node);
289 bool AddFaninInternal(NodeDef* node, const OutputPort& fanin);
298 NodeDef* GetControllingFaninToAdd(absl::string_view node_name,
304 NodeDef* GetOrCreateIdentityConsumingSwitch(const OutputPort& fanin);
307 bool RemoveRegularFaninInternal(NodeDef* node, const OutputPort& fanin);
[all …]
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dconstant_folding.h44 NodeDef* node, size_t original_size = 0);
68 bool ForwardInputs(NodeDef* node, absl::Span<const int> inputs_to_forward);
69 string OptimizedNodeName(const NodeDef& node, StringPiece suffix) const;
70 bool OptimizedNodeExists(const NodeDef& node, StringPiece suffix) const;
72 bool IsReallyConstant(const NodeDef& node) const;
78 Status MaterializeBroadcastGradientArgs(const NodeDef& node,
80 Status MaterializeReductionIndices(NodeDef* node,
82 Status MaterializeConstantValuedNode(NodeDef* node,
84 Status MaterializeOutputValues(NodeDef* node,
88 bool IsFoldable(const NodeDef& node, const GraphProperties* properties);
[all …]
Dmemory_optimizer.cc90 std::unordered_set<const NodeDef*> FindCandidateRecomputeNodes( in FindCandidateRecomputeNodes()
92 const std::function<bool(const NodeDef&)>& is_candidate, in FindCandidateRecomputeNodes()
93 const std::function<bool(const NodeDef&)>& is_target) { in FindCandidateRecomputeNodes()
94 std::unordered_set<const NodeDef*> candidate_recompute_nodes; in FindCandidateRecomputeNodes()
100 for (const NodeDef* output : node_map.GetOutputs(node.name())) { in FindCandidateRecomputeNodes()
114 const NodeDef* input_node = node_map.GetNode(input_name); in FindCandidateRecomputeNodes()
130 const std::function<bool(const NodeDef&)>& is_candidate, in connected_subgraph()
131 std::unordered_set<const NodeDef*>* expanded_nodes) { in connected_subgraph()
132 std::queue<const NodeDef*> to_visit; in connected_subgraph()
133 for (const NodeDef* starting_node : *expanded_nodes) { in connected_subgraph()
[all …]
Dauto_parallel_test.cc57 const NodeDef& node_assign = output.node(0); in TEST_F()
61 const NodeDef& node_constant_b = output.node(1); in TEST_F()
64 const NodeDef& node_fifo_queue = output.node(2); in TEST_F()
67 const NodeDef& node_identity = output.node(3); in TEST_F()
71 const NodeDef& node_var = output.node(4); in TEST_F()
74 const NodeDef& node_div_const0 = output.node(5); in TEST_F()
78 const NodeDef& node_div0 = output.node(6); in TEST_F()
81 const NodeDef& node_add0 = output.node(7); in TEST_F()
84 const NodeDef& node_gradient0 = output.node(8); in TEST_F()
87 const NodeDef& node_constant_a0 = output.node(9); in TEST_F()
[all …]
Dstatic_schedule.cc34 const VirtualPlacer& placer, const NodeDef& node) { in PredictExecutionTime()
63 std::unordered_map<const NodeDef*, Costs::NanoSeconds>* completion_times) { in EstimateEarliestExecutionTimes() argument
64 std::unordered_map<string, const NodeDef*> name_map; in EstimateEarliestExecutionTimes()
65 std::unordered_map<const NodeDef*, int> pending_inputs; in EstimateEarliestExecutionTimes()
66 std::deque<const NodeDef*> ready_nodes; in EstimateEarliestExecutionTimes()
67 for (const NodeDef& node : item.graph.node()) { in EstimateEarliestExecutionTimes()
81 std::unordered_map<const NodeDef*, std::vector<const NodeDef*>> fanouts; in EstimateEarliestExecutionTimes()
82 for (const NodeDef& node : item.graph.node()) { in EstimateEarliestExecutionTimes()
90 const NodeDef* fanin = it->second; in EstimateEarliestExecutionTimes()
105 const NodeDef* node = ready_nodes.front(); in EstimateEarliestExecutionTimes()
[all …]
Dcommon_subgraph_elimination.cc59 NodeDef* FindOrAddRepresentative(NodeDef* node) { in FindOrAddRepresentative()
61 std::vector<NodeDef*>& candidates = rep_[sig]; in FindOrAddRepresentative()
71 void RemoveRepresentative(NodeDef* node) { in RemoveRepresentative()
75 std::vector<NodeDef*>& candidates = rep_[it->second]; in RemoveRepresentative()
87 uint64 ComputeSignature(const NodeDef& node);
88 bool SameNode(const NodeDef& node1, const NodeDef& node2) const;
90 absl::flat_hash_map<uint64, std::vector<NodeDef*>> rep_;
91 absl::flat_hash_map<const NodeDef*, uint64> memoized_signatures_;
94 uint64 UniqueNodes::ComputeSignature(const NodeDef& node) { in ComputeSignature()
120 bool UniqueNodes::SameNode(const NodeDef& node1, const NodeDef& node2) const { in SameNode()
[all …]
Darithmetic_optimizer.cc72 bool ValuesFromConstNode(const NodeDef& node, std::vector<T>* values) { in ValuesFromConstNode()
114 bool MaybeAddControlInput(const string& new_input, NodeDef* node, in MaybeAddControlInput()
132 void SetDataTypeToAttr(DataType dtype, const string& attr_name, NodeDef* node) { in SetDataTypeToAttr()
136 NodeDef* GetTailOfValuePreservingChain( in GetTailOfValuePreservingChain()
137 const NodeDef& node, const NodeMap& node_map, in GetTailOfValuePreservingChain()
139 auto is_value_preserving_non_branching = [&](const NodeDef& node) { in GetTailOfValuePreservingChain()
147 NodeDef* GetTailOfIdempotentChain( in GetTailOfIdempotentChain()
148 const NodeDef& node, const NodeMap& node_map, in GetTailOfIdempotentChain()
150 auto is_idempotent_non_branching = [&](const NodeDef& node) { in GetTailOfIdempotentChain()
194 bool NodeIsOnCpu(const NodeDef& node) { in NodeIsOnCpu()
[all …]
/external/tensorflow/tensorflow/core/grappler/costs/
Dvirtual_scheduler.h47 std::vector<std::pair<const NodeDef*, int>> inputs; // Input, port pairs.
50 std::unordered_map<int, std::vector<const NodeDef*>> outputs;
104 std::vector<const NodeDef*> nodes_executed;
109 const std::pair<const NodeDef*, int>& element) const { in operator()
110 return std::hash<const NodeDef*>()(element.first); in operator()
116 std::unordered_set<std::pair<const NodeDef*, int>, NodePairHash>
120 std::unordered_set<std::pair<const NodeDef*, int>, NodePairHash>
125 std::unordered_set<std::pair<const NodeDef*, int>, NodePairHash>
166 const std::unordered_map<const NodeDef*, NodeState>* node_map) { in Init() argument
169 virtual void AddNode(const NodeDef* node) = 0;
[all …]
/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Dgraph_utils.h52 NodeDef* AddNode(StringPiece name, StringPiece op,
58 NodeDef* AddScalarPlaceholder(DataType dtype, MutableGraphView* graph);
62 NodeDef* AddScalarConstNode(T v, MutableGraphView* graph) { in AddScalarConstNode()
71 NodeDef* AddScalarConstNode(bool v, MutableGraphView* graph);
73 NodeDef* AddScalarConstNode(double v, MutableGraphView* graph);
75 NodeDef* AddScalarConstNode(float v, MutableGraphView* graph);
77 NodeDef* AddScalarConstNode(int v, MutableGraphView* graph);
79 NodeDef* AddScalarConstNode(int64 v, MutableGraphView* graph);
81 NodeDef* AddScalarConstNode(StringPiece v, MutableGraphView* graph);
86 Status GetScalarConstNodeValue(const NodeDef& node, T* value) { in GetScalarConstNodeValue()
[all …]
Dmap_and_batch_fusion_test.cc32 NodeDef *start_node = graph_utils::AddScalarConstNode<int64>(0, &graph); in TEST()
33 NodeDef *stop_node = graph_utils::AddScalarConstNode<int64>(10, &graph); in TEST()
34 NodeDef *step_node = graph_utils::AddScalarConstNode<int64>(1, &graph); in TEST()
41 NodeDef *range_node = graph_utils::AddNode("", "RangeDataset", range_inputs, in TEST()
43 NodeDef *captured_input_node = in TEST()
46 NodeDef *map_node; in TEST()
62 NodeDef *batch_size_node = graph_utils::AddScalarConstNode<int64>(5, &graph); in TEST()
63 NodeDef *batch_node; in TEST()
88 NodeDef map_and_batch_node = output.node( in TEST()
94 NodeDef num_parallel_calls_node = output.node( in TEST()
[all …]
Dmap_vectorization.cc62 FunctionDef* CreateMapDefunWrapper(const NodeDef& map_node, in CreateMapDefunWrapper()
73 NodeDef* map_defun_node = vectorized_func->mutable_node_def()->Add(); in CreateMapDefunWrapper()
116 FunctionDef* AddVectorizedFunction(const NodeDef& map_node, in AddVectorizedFunction()
123 const NodeDef& map_defun_node = vectorized_func->node_def(0); in AddVectorizedFunction()
139 bool IsOutputShapesFullyDefined(const NodeDef& node) { in IsOutputShapesFullyDefined()
157 Status GetInputMap(const NodeDef& node, NameRangeMap* result) { in GetInputMap()
166 const NodeDef& from, NodeDef* to) { in CopyInputs()
181 const NodeDef& node, string* result) { in GetInputNodeName()
195 Status AddNewBatchNode(const NodeDef& old_batch_node, const NodeDef& input_node, in AddNewBatchNode()
197 MutableGraphView* graph, NodeDef** new_batch_node) { in AddNewBatchNode()
[all …]
Dshuffle_and_repeat_fusion_test.cc44 NodeDef *start_node = graph_utils::AddScalarConstNode<int64>(0, &graph); in TEST()
45 NodeDef *stop_node = graph_utils::AddScalarConstNode<int64>(10, &graph); in TEST()
46 NodeDef *step_node = graph_utils::AddScalarConstNode<int64>(1, &graph); in TEST()
52 NodeDef *range_node = graph_utils::AddNode("", "RangeDataset", range_inputs, in TEST()
55 NodeDef *buffer_size_node = in TEST()
57 NodeDef *seed_node = graph_utils::AddScalarConstNode<int64>(-1, &graph); in TEST()
58 NodeDef *seed2_node = graph_utils::AddScalarConstNode<int64>(-1, &graph); in TEST()
64 NodeDef *shuffle_node = graph_utils::AddNode( in TEST()
68 NodeDef *count_node = graph_utils::AddScalarConstNode<int64>(-1, &graph); in TEST()
72 NodeDef *repeat_node = graph_utils::AddNode( in TEST()
[all …]
Dgraph_test_utils.h27 NodeDef MakeBatchV2Node(StringPiece name, StringPiece input_node_name,
32 NodeDef MakeCacheV2Node(StringPiece name, StringPiece input_node_name,
37 NodeDef MakeFilterNode(StringPiece name, StringPiece input_node_name,
41 NodeDef MakeMapNode(StringPiece name, StringPiece input_node_name,
45 NodeDef MakeMapAndBatchNode(StringPiece name, StringPiece input_node_name,
52 NodeDef MakeParallelInterleaveV2Node(StringPiece name,
60 NodeDef MakeParallelMapNode(StringPiece name, StringPiece input_node_name,
65 NodeDef MakeParseExampleNode(StringPiece name, StringPiece input_node_name,
70 NodeDef MakeShuffleV2Node(StringPiece name, StringPiece input_node_name,
75 NodeDef MakeTakeNode(StringPiece name, StringPiece input_node_name,
[all …]
/external/tensorflow/tensorflow/core/grappler/utils/
Dtraversal.h37 DfsCallbacks(std::function<void(const NodeDef*)> pre, in DfsCallbacks()
38 std::function<void(const NodeDef*)> post, in DfsCallbacks()
39 std::function<void(const NodeDef*, const NodeDef*)> back_edge) in DfsCallbacks()
44 static DfsCallbacks PreOrder(std::function<void(const NodeDef*)> pre) { in PreOrder()
48 static DfsCallbacks PostOrder(std::function<void(const NodeDef*)> post) { in PostOrder()
52 std::function<void(const NodeDef*)> pre_order;
53 std::function<void(const NodeDef*)> post_order;
54 std::function<void(const NodeDef*, const NodeDef*)> on_back_edge;
67 DfsPredicates(std::function<bool(const NodeDef*)> enter, in DfsPredicates()
68 std::function<bool(const NodeDef*)> advance) in DfsPredicates()
[all …]
Dtransitive_fanin.cc30 std::unordered_map<string, const NodeDef*>* name_to_fanin_node, in ComputeTransitiveFanin()
31 std::vector<const NodeDef*>* fanin_nodes) { in ComputeTransitiveFanin()
32 std::unordered_map<string, const NodeDef*> name_to_node; in ComputeTransitiveFanin()
33 std::unordered_map<string, const NodeDef*> name_to_send; in ComputeTransitiveFanin()
42 std::vector<const NodeDef*> queue; in ComputeTransitiveFanin()
44 const NodeDef* node = name_to_node[NodeName(root)]; in ComputeTransitiveFanin()
52 std::unordered_set<const NodeDef*> visited; in ComputeTransitiveFanin()
55 const NodeDef* node = queue.back(); in ComputeTransitiveFanin()
64 std::pair<string, const NodeDef*>(node->name(), node)); in ComputeTransitiveFanin()
67 const NodeDef* in = name_to_node[NodeName(input)]; in ComputeTransitiveFanin()
[all …]
/external/tensorflow/tensorflow/tools/graph_transforms/
Dstrip_unused_nodes_test.cc41 NodeDef* add_node = graph_def.add_node(); in TestSimpleAdd()
47 NodeDef* a_node = graph_def.add_node(); in TestSimpleAdd()
51 NodeDef* b_node = graph_def.add_node(); in TestSimpleAdd()
55 NodeDef* c_node = graph_def.add_node(); in TestSimpleAdd()
62 std::map<string, const NodeDef*> node_lookup; in TestSimpleAdd()
73 NodeDef* add_node1 = graph_def.add_node(); in TestCommonAncestor()
79 NodeDef* add_node2 = graph_def.add_node(); in TestCommonAncestor()
85 NodeDef* add_node3 = graph_def.add_node(); in TestCommonAncestor()
91 NodeDef* const_node1 = graph_def.add_node(); in TestCommonAncestor()
95 NodeDef* const_node2 = graph_def.add_node(); in TestCommonAncestor()
[all …]
Dremove_nodes_test.cc41 NodeDef* add_node1 = graph_def.add_node(); in TestRemoveNodes()
47 NodeDef* add_node2 = graph_def.add_node(); in TestRemoveNodes()
53 NodeDef* add_node3 = graph_def.add_node(); in TestRemoveNodes()
59 NodeDef* identity_node1 = graph_def.add_node(); in TestRemoveNodes()
64 NodeDef* identity_node2 = graph_def.add_node(); in TestRemoveNodes()
69 NodeDef* identity_node3 = graph_def.add_node(); in TestRemoveNodes()
74 NodeDef* const_node1 = graph_def.add_node(); in TestRemoveNodes()
78 NodeDef* const_node2 = graph_def.add_node(); in TestRemoveNodes()
82 NodeDef* const_node3 = graph_def.add_node(); in TestRemoveNodes()
86 NodeDef* add_node4 = graph_def.add_node(); in TestRemoveNodes()
[all …]
Dsort_by_execution_order_test.cc35 const NodeDef& node = graph_def.node(i); in GetOrder()
42 NodeDef* add_node = graph_def.add_node(); in TestSimpleAdd()
48 NodeDef* b_node = graph_def.add_node(); in TestSimpleAdd()
52 NodeDef* a_node = graph_def.add_node(); in TestSimpleAdd()
69 NodeDef* negative_node = graph_def.add_node(); in TestSimpleLinear()
74 NodeDef* relu_node = graph_def.add_node(); in TestSimpleLinear()
79 NodeDef* sqrt_node = graph_def.add_node(); in TestSimpleLinear()
84 NodeDef* const_node = graph_def.add_node(); in TestSimpleLinear()
102 NodeDef* add_node1 = graph_def.add_node(); in TestSimpleTree()
108 NodeDef* add_node2 = graph_def.add_node(); in TestSimpleTree()
[all …]
Dfuse_convolutions.cc47 std::vector<NodeDef>* new_nodes) { in FuseResizePadAndConv()
49 const NodeDef& conv_node = match.node; in FuseResizePadAndConv()
50 const NodeDef& mirror_pad_node = match.inputs[0].node; in FuseResizePadAndConv()
51 const NodeDef& weights_node = match.inputs[1].node; in FuseResizePadAndConv()
52 const NodeDef& resize_node = match.inputs[0].inputs[0].node; in FuseResizePadAndConv()
53 const NodeDef& pad_dims_node = match.inputs[0].inputs[1].node; in FuseResizePadAndConv()
60 NodeDef fused_conv; in FuseResizePadAndConv()
96 std::vector<NodeDef>* new_nodes) { in FuseResizeAndConv()
98 const NodeDef& conv_node = match.node; in FuseResizeAndConv()
99 const NodeDef& resize_node = match.inputs[0].node; in FuseResizeAndConv()
[all …]
Dbackports_test.cc45 NodeDef* mul_node1 = graph_def.add_node(); in TestBackportConcatV2()
51 NodeDef* add_node2 = graph_def.add_node(); in TestBackportConcatV2()
57 NodeDef* add_node3 = graph_def.add_node(); in TestBackportConcatV2()
63 NodeDef* const_node1 = graph_def.add_node(); in TestBackportConcatV2()
67 NodeDef* const_node2 = graph_def.add_node(); in TestBackportConcatV2()
71 NodeDef* const_node3 = graph_def.add_node(); in TestBackportConcatV2()
75 NodeDef* concat_node = graph_def.add_node(); in TestBackportConcatV2()
89 std::map<string, const NodeDef*> node_lookup; in TestBackportConcatV2()
111 NodeDef* size_node = graph_def.add_node(); in TEST()
118 NodeDef* tensor_array_node = graph_def.add_node(); in TEST()
[all …]
/external/tensorflow/tensorflow/core/framework/
Dnode_def_util.h66 std::string SummarizeNodeDef(const NodeDef& node_def,
68 std::string SummarizeAttrs(const NodeDef& node_def);
74 std::string FormatNodeDefForError(const NodeDef& node_def);
83 void AddNodeAttr(StringPiece name, const AttrValue& value, NodeDef* node_def);
84 void AddNodeAttr(StringPiece name, AttrValue&& value, NodeDef* node_def);
85 void AddNodeAttr(StringPiece name, StringPiece value, NodeDef* node_def);
86 void AddNodeAttr(StringPiece name, const char* value, NodeDef* node_def);
87 void AddNodeAttr(StringPiece name, int32 value, NodeDef* node_def);
88 void AddNodeAttr(StringPiece name, int64 value, NodeDef* node_def);
89 void AddNodeAttr(StringPiece name, float value, NodeDef* node_def);
[all …]
Dnode_def_util_test.cc40 NodeDef ToNodeDef(const string& text) { in ToNodeDef()
41 NodeDef node_def; in ToNodeDef()
46 NodeDef ToNodeDef(NodeDefBuilder&& builder) { in ToNodeDef()
47 NodeDef node_def; in ToNodeDef()
52 void ExpectSuccess(const NodeDef& good, const OpDef& op_def) { in ExpectSuccess()
58 void ExpectFailure(const NodeDef& bad, const OpDef& op_def, in ExpectFailure()
79 const NodeDef node_def = ToNodeDef(R"proto( in TEST()
87 NodeDef bad = node_def; in TEST()
124 NodeDef good = node_def; in TEST()
144 const NodeDef node_def = ToNodeDef(R"proto( in TEST()
[all …]
/external/tensorflow/tensorflow/core/kernels/data/
Dhash_utils_test.cc41 NodeDef* node = graph_def.add_node(); in GetHash()
57 NodeDef* node1 = graph_def.add_node(); in CheckEqual()
63 NodeDef* node2 = graph_def.add_node(); in CheckEqual()
72 uint64 GetHash(const GraphDef& graph, const NodeDef& node) { in GetHash()
161 NodeDef* output_node = g.add_node(); in TEST_F()
194 NodeDef* n1 = gd.add_node(); in TEST_F()
200 NodeDef* n2 = gd.add_node(); in TEST_F()
206 NodeDef* n3 = gd.add_node(); in TEST_F()
213 NodeDef* n4 = gd.add_node(); in TEST_F()
219 NodeDef* n5 = gd.add_node(); in TEST_F()
[all …]

12345678910>>...22