Searched refs:IsSend (Results 1 – 12 of 12) sorted by relevance
158 if (IsSend(*node)) { in AddNode()201 int a_score = 2 * IsSend(*a.first) + IsRecv(*a.first); in GetCurrNode()202 int b_score = 2 * IsSend(*b.first) + IsRecv(*b.first); in GetCurrNode()223 if (IsSend(*node)) { in RemoveCurrNode()341 if (IsSend(node)) { in Init()471 if ((IsSend(*node) || IsRecv(*node)) && node->attr().count(kAttrInputSrc)) { in MaybeUpdateInputOutput()626 if (IsSend(*node)) { in GetCurrNode()672 if (!IsSend(*node)) { in GetNodeStateOrCreateIt()
154 bool IsSend() const { return class_ == NC_SEND || class_ == NC_HOST_SEND; } in IsSend() function743 inline bool IsSend(const Node* node) { return node->IsSend(); } in IsSend() function749 inline bool IsTransferNode(const Node* n) { return IsSend(n) || IsRecv(n); } in IsTransferNode()
541 cnode->set_is_final(n->IsSend()); in AddToCostGraphDef()
80 if (IsSend(node_)) { in Done()431 if (IsSend(node) || IsRecv(node)) { in CreateNodeExecStats()
234 if (n->IsControlFlow() || n->IsSend() || n->IsRecv()) { in IsConstantFoldable()
813 if (IsSend(dst)) { in InferAllocAttr()
432 bool IsSend(const NodeDef& node) { in IsSend() function646 if (IsSend(node)) { in IsFreeOfSideEffect()
143 bool IsSend(const NodeDef& node);
143 TF_RET_CHECK(!n->IsRecv() && !n->IsSend() && !n->IsSwitch()) in Compile()
79 if (n->IsSend() || n->IsHostSend() || n->IsRecv() || n->IsHostRecv()) { in Initialize()
409 if (n->IsSend() || n->IsRecv() || n->IsControlFlow()) { in Run()
1258 if (IsSend(node)) { in RelaxAllocatorConstraints()1303 (IsSend(*fanout_node) || in RelaxAllocatorConstraints()