Lines Matching refs:node
29 bool IsTrivialOp(const NodeDef& node, const GraphRewriter& rewriter) {
32 if (IsStopGradient(node)) {
35 if (IsIdentity(node)) {
36 if (rewriter.FeedsMerge(node) || rewriter.IsDrivenBySwitch(node) ||
37 rewriter.IsDrivenByControlDependency(node) ||
38 rewriter.DrivesControlDependency(node)) {
44 if (IsAddN(node) && NumNonControlInputs(node) <= 1) {
56 // the fanin of a fetch node. If fetch nodes aren't specified, we'll assume
83 for (auto& node : runnable_item.graph.node()) {
84 if (!IsTrivialOp(node, rewriter)) {
89 if (nodes_to_preserve.find(node.name()) != nodes_to_preserve.end()) {
96 // dependency edges by deleting them (for example, removing a node driven
107 if (!rewriter.RemovalIncreasesEdgeCount(node) &&
108 !rewriter.IsConnectedToFunction(node) &&
109 !rewriter.IsDrivenByAnotherDevice(node) &&
110 !rewriter.ReceivesRefValue(node)) {
111 nodes_to_delete.insert(&node);
124 for (auto& node : runnable_item.graph.node()) {
126 nodes_to_delete.find(&node) == nodes_to_delete.end()) {
128 *new_node = node;
130 rewriter.ForwardInputs(node, nodes_to_delete, new_node);
