Searched refs:IsSend (Results 1 – 13 of 13) sorted by relevance
10 struct IsSend<T: Send>(T); struct14 IsSend(b.wait()); in barrier_future_is_send()
281 if (IsSend(*node)) { in AddNode()324 int a_score = 2 * IsSend(*a.first) + IsRecv(*a.first); in GetCurrNode()325 int b_score = 2 * IsSend(*b.first) + IsRecv(*b.first); in GetCurrNode()346 if (IsSend(*node)) { in RemoveCurrNode()457 if (IsSend(node)) { in Init()593 if ((IsSend(*node) || IsRecv(*node)) && node->attr().count(kAttrInputSrc)) { in MaybeUpdateInputOutput()751 if (IsSend(*node)) { in CreateOpContext()799 if (!IsSend(*node)) { in GetNodeStateOrCreateIt()
164 bool IsSend() const { return class_ == NC_SEND || class_ == NC_HOST_SEND; } in IsSend() function819 inline bool IsSend(const Node* node) { return node->IsSend(); } in IsSend() function825 inline bool IsTransferNode(const Node* n) { return IsSend(n) || IsRecv(n); } in IsTransferNode()
544 cnode->set_is_final(n->IsSend()); in AddToCostGraphDef()
47 bool IsSend(const NodeDef* node) { in IsSend() function89 if (IsSend(node_)) { in Done()429 if (IsSend(node) || IsRecv(node)) { in CreateNodeExecStats()
368 if (IsSend(dst)) { in InferAllocAttr()
251 if (n->IsControlFlow() || n->IsSend() || n->IsRecv()) { in IsConstantFoldable()
164 bool IsSend(const NodeDef& node);
511 bool IsSend(const NodeDef& node) { in IsSend() function735 if (IsSend(node)) { in IsFreeOfSideEffect()
149 TF_RET_CHECK(!n->IsRecv() && !n->IsSend() && !n->IsSwitch()) in Compile()
87 if (n->IsSend() || n->IsHostSend() || n->IsRecv() || n->IsHostRecv()) { in Initialize()
580 if (n->IsSend() || n->IsRecv() || n->IsControlFlow()) { in Run()
1309 if (IsSend(node)) { in FindAssignNodesToRelax()1349 (IsSend(*fanout_node) || in FindAssignNodesToRelax()