1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
==============================================================================*/
#include "tensorflow/compiler/tf2xla/functionalize_control_flow_util.h"
#include "tensorflow/core/framework/node_def.pb.h"
namespace tensorflow {
bool NodeCmpByNameResourcesLast::operator()(const Node* lhs,
const Node* rhs) const {
bool lhs_is_resource =
lhs->num_inputs() > 0 ? (lhs->input_type(0) == DT_RESOURCE) : false;
bool rhs_is_resource =
rhs->num_inputs() > 0 ? (rhs->input_type(0) == DT_RESOURCE) : false;
return std::tie(lhs_is_resource, lhs->name()) <
std::tie(rhs_is_resource, rhs->name());
}
xla::StatusOr<Node*> AddNodeDefToGraph(const NodeDef& node_def, Graph* graph) {
Status status;
Node* inserted_node = graph->AddNode(node_def, &status);
if (!status.ok()) {
return status;
}
return inserted_node;
}
xla::StatusOr<Node*> BuildRetvalNode(Graph* graph, DataType type, int index) {
const char* const kRetValOp = "_Retval";
NodeDef ret_def;
ret_def.set_op(kRetValOp);
ret_def.set_name(absl::StrCat(kRetValOp, index));
AddNodeAttr("T", type, &ret_def);
AddNodeAttr("index", index, &ret_def);
return AddNodeDefToGraph(ret_def, graph);
}
// Check that the graph has no cycle containing the given node.
Status CheckNodeNotInCycle(const Node* node, const int num_nodes) {
std::vector<const Node*> ready;
ready.push_back(node);
std::vector<bool> visited(num_nodes);
while (!ready.empty()) {
const Node* current_node = ready.back();
ready.pop_back();
visited[current_node->id()] = true;
for (const Edge* out : current_node->out_edges()) {
if (out->dst() == node) {
return errors::Internal("Detected a cycle: ", FormatNodeForError(*node),
" (", node->def().op(), ") feeds into itself.");
} else if (!visited[out->dst()->id()]) {
ready.push_back(out->dst());
}
}
}
return Status::OK();
}
} // namespace tensorflow
|
