Lines Matching refs:op

19 #include "tensorflow/core/framework/op.h"
29 if (node.op() == "AddV2" || node.op() == "Add") {
36 bool IsAddN(const NodeDef& node) { return node.op() == "AddN"; }
38 bool IsAll(const NodeDef& node) { return node.op() == "All"; }
40 bool IsAngle(const NodeDef& node) { return node.op() == "Angle"; }
42 bool IsAny(const NodeDef& node) { return node.op() == "Any"; }
45 return node.op() == "RealDiv" || node.op() == "Div" ||
46 node.op() == "FloorDiv" || node.op() == "TruncateDiv";
50 return node.op() == "ApproximateEqual";
53 bool IsAvgPoolGrad(const NodeDef& node) { return node.op() == "AvgPoolGrad"; }
55 bool IsAssert(const NodeDef& node) { return node.op() == "Assert"; }
57 bool IsAtan2(const NodeDef& node) { return node.op() == "Atan2"; }
59 bool IsBetainc(const NodeDef& node) { return node.op() == "Betainc"; }
62 return node.op() == "BiasAdd" || node.op() == "BiasAddV1";
65 bool IsBiasAddGrad(const NodeDef& node) { return node.op() == "BiasAddGrad"; }
67 bool IsBitcast(const NodeDef& node) { return node.op() == "Bitcast"; }
69 bool IsCast(const NodeDef& node) { return node.op() == "Cast"; }
71 bool IsComplex(const NodeDef& node) { return node.op() == "Complex"; }
73 bool IsComplexAbs(const NodeDef& node) { return node.op() == "ComplexAbs"; }
75 bool IsConcatOffset(const NodeDef& node) { return node.op() == "ConcatOffset"; }
77 bool IsConstant(const NodeDef& node) { return node.op() == "Const"; }
79 bool IsConj(const NodeDef& node) { return node.op() == "Conj"; }
81 bool IsConv2D(const NodeDef& node) { return node.op() == "Conv2D"; }
84 return node.op() == "Conv2DBackpropFilter";
88 return node.op() == "Conv2DBackpropInput";
92 return node.op() == "DepthwiseConv2dNative";
96 return node.op() == "DepthwiseConv2dNativeBackpropFilter";
100 return node.op() == "DepthwiseConv2dNativeBackpropInput";
104 const auto& op = node.op();
105 return op == "QueueDequeueManyV2" || op == "QueueDequeueMany" ||
106 op == "QueueDequeueV2" || op == "QueueDequeue" ||
107 op == "QueueDequeueUpToV2" || op == "QueueDequeueUpTo";
110 bool IsDiv(const NodeDef& node) { return node.op() == "Div"; }
112 bool IsEluGrad(const NodeDef& node) { return node.op() == "EluGrad"; }
115 const auto& op = node.op();
116 return op == "Enter" || op == "RefEnter";
119 bool IsEqual(const NodeDef& node) { return node.op() == "Equal"; }
122 const auto& op = node.op();
123 return op == "Exit" || op == "RefExit";
126 bool IsFill(const NodeDef& node) { return node.op() == "Fill"; }
128 bool IsFloorDiv(const NodeDef& node) { return node.op() == "FloorDiv"; }
130 bool IsFloorMod(const NodeDef& node) { return node.op() == "FloorMod"; }
133 const auto& op = node.op();
134 return op == "FusedBatchNormGrad" || op == "FusedBatchNormGradV2";
137 bool IsGreater(const NodeDef& node) { return node.op() == "Greater"; }
139 bool IsGreaterEqual(const NodeDef& node) { return node.op() == "GreaterEqual"; }
142 return node.op() == "HistogramSummary";
146 const auto& op = node.op();
147 return op == "Identity" || op == "RefIdentity";
151 const auto& op = node.op();
152 return op == "IdentityN";
155 bool IsIgamma(const NodeDef& node) { return node.op() == "Igamma"; }
157 bool IsIgammac(const NodeDef& node) { return node.op() == "Igammac"; }
159 bool IsImag(const NodeDef& node) { return node.op() == "Imag"; }
161 bool IsInvGrad(const NodeDef& node) { return node.op() == "InvGrad"; }
163 bool IsLess(const NodeDef& node) { return node.op() == "Less"; }
165 bool IsLessEqual(const NodeDef& node) { return node.op() == "LessEqual"; }
167 bool IsLogicalAnd(const NodeDef& node) { return node.op() == "LogicalAnd"; }
169 bool IsLogicalNot(const NodeDef& node) { return node.op() == "LogicalNot"; }
171 bool IsLogicalOr(const NodeDef& node) { return node.op() == "LogicalOr"; }
174 const auto& op = node.op();
175 return op == "MatMul" || op == "BatchMatMul" || op == "QuantizedMatMul" ||
176 op == "SparseMatMul";
179 bool IsMax(const NodeDef& node) { return node.op() == "Max"; }
181 bool IsMaximum(const NodeDef& node) { return node.op() == "Maximum"; }
183 bool IsMean(const NodeDef& node) { return node.op() == "Mean"; }
186 const auto& op = node.op();
187 return op == "Merge" || op == "RefMerge";
190 bool IsMin(const NodeDef& node) { return node.op() == "Min"; }
192 bool IsMinimum(const NodeDef& node) { return node.op() == "Minimum"; }
194 bool IsMirrorPad(const NodeDef& node) { return node.op() == "MirrorPad"; }
197 return node.op() == "MirrorPadGrad";
200 bool IsMod(const NodeDef& node) { return node.op() == "Mod"; }
202 bool IsMul(const NodeDef& node) { return node.op() == "Mul"; }
204 bool IsNoOp(const NodeDef& node) { return node.op() == "NoOp"; }
206 bool IsNotEqual(const NodeDef& node) { return node.op() == "NotEqual"; }
209 const auto& op = node.op();
210 return op == "NextIteration" || op == "RefNextIteration";
214 const auto& op = node.op();
215 return op == "Pad" || op == "PadV2";
219 const auto& op = node.op();
220 return op == "Placeholder" || op == "PlaceholderV2" ||
221 op == "PlaceholderWithDefault";
224 bool IsPolygamma(const NodeDef& node) { return node.op() == "Polygamma"; }
226 bool IsPow(const NodeDef& node) { return node.op() == "Pow"; }
228 bool IsProd(const NodeDef& node) { return node.op() == "Prod"; }
230 bool IsReal(const NodeDef& node) { return node.op() == "Real"; }
232 bool IsRealDiv(const NodeDef& node) { return node.op() == "RealDiv"; }
235 return node.op() == "ReciprocalGrad";
239 return node.op() == "_Recv" || node.op() == "_HostRecv";
243 const auto& op = node.op();
244 return op == "Sum" || op == "Prod" || op == "Min" || op == "Max" ||
245 op == "Mean" || op == "Any" || op == "All";
248 bool IsReluGrad(const NodeDef& node) { return node.op() == "ReluGrad"; }
250 bool IsRelu6Grad(const NodeDef& node) { return node.op() == "Relu6Grad"; }
252 bool IsReshape(const NodeDef& node) { return (node.op() == "Reshape"); }
255 return (node.op() == "Restore" || node.op() == "RestoreV2" ||
256 node.op() == "RestoreSlice");
259 bool IsReverseV2(const NodeDef& node) { return node.op() == "ReverseV2"; }
261 bool IsRsqrtGrad(const NodeDef& node) { return node.op() == "RsqrtGrad"; }
263 bool IsSelect(const NodeDef& node) { return node.op() == "Select"; }
265 bool IsSeluGrad(const NodeDef& node) { return node.op() == "SeluGrad"; }
268 return node.op() == "_Send" || node.op() == "_HostSend";
271 bool IsShape(const NodeDef& node) { return node.op() == "Shape"; }
273 bool IsShapeN(const NodeDef& node) { return node.op() == "ShapeN"; }
275 bool IsSigmoidGrad(const NodeDef& node) { return node.op() == "SigmoidGrad"; }
277 bool IsSlice(const NodeDef& node) { return node.op() == "Slice"; }
279 bool IsSoftplusGrad(const NodeDef& node) { return node.op() == "SoftplusGrad"; }
281 bool IsSoftsignGrad(const NodeDef& node) { return node.op() == "SoftsignGrad"; }
283 bool IsSplit(const NodeDef& node) { return node.op() == "Split"; }
285 bool IsSplitV(const NodeDef& node) { return node.op() == "SplitV"; }
287 bool IsSqrtGrad(const NodeDef& node) { return node.op() == "SqrtGrad"; }
290 return node.op() == "SquaredDifference";
293 bool IsSqueeze(const NodeDef& node) { return node.op() == "Squeeze"; }
296 const auto& op = node.op();
297 return op == "StopGradient" || op == "PreventGradient";
300 bool IsStridedSlice(const NodeDef& node) { return node.op() == "StridedSlice"; }
303 return node.op() == "StridedSliceGrad";
306 bool IsSub(const NodeDef& node) { return node.op() == "Sub"; }
308 bool IsSum(const NodeDef& node) { return node.op() == "Sum"; }
311 const auto& op = node.op();
312 return op == "Switch" || op == "RefSwitch";
315 bool IsTanhGrad(const NodeDef& node) { return node.op() == "TanhGrad"; }
317 bool IsTile(const NodeDef& node) { return node.op() == "Tile"; }
319 bool IsTranspose(const NodeDef& node) { return node.op() == "Transpose"; }
321 bool IsTruncateDiv(const NodeDef& node) { return node.op() == "TruncateDiv"; }
323 bool IsTruncateMod(const NodeDef& node) { return node.op() == "TruncateMod"; }
326 const auto& op = node.op();
327 return op == "Variable" || op == "VariableV2" || op == "AutoReloadVariable" ||
328 op == "VarHandleOp" || op == "ReadVariableOp";
331 bool IsZeta(const NodeDef& node) { return node.op() == "Zeta"; }
349 Status status = OpRegistry::Global()->LookUpOpDef(node.op(), &op_def);
375 if (node.op() == "Add") { \
382 Status status = OpRegistry::Global()->LookUpOpDef(node.op(), &op_def); \
392 return involution_ops.count(node.op()) > 0;
403 return value_preserving_ops.count(node.op()) > 0;
408 return OpRegistry::Global()->LookUpOpDef(node.op(), &op_def).ok();