Searched refs:kTransDataOpName (Results 1 – 15 of 15) sorted by relevance
42 op_name == prim::kPrimReshape->name() || op_name == kTransDataOpName) { in ParamTransRoad()98 node_name == prim::kPrimReshape->name() || node_name == kTransDataOpName) { in Run()108 AnfAlgo::GetCNodeName(trans_road[kIndex0]) == kTransDataOpName && in Run()110 AnfAlgo::GetCNodeName(trans_road[kIndex2]) == kTransDataOpName) { in Run()
56 auto new_fusion_transdata = std::make_shared<Primitive>(kTransDataOpName); in Process()
138 …kTransDataOpName, std::pair<std::string, ConditionFunc>(kTransDataOpName, TransDataOpEliminateCond… in Init()
39 if (AnfAlgo::GetCNodeName(node) != kTransDataOpName) { in CheckIgnoreCase()
100 if (op_name != kTransDataOpName && op_name != prim::kPrimCast->name()) { in GetReplaceNode()
35 if (op_name == kTransDataOpName) { in Process()
97 if (node_name == kTransDataOpName) { in HasFraczGroupAttrAndSet()165 if (node_name == kUpdateStateName || node_name == kTransDataOpName) { in GetNeighborFraczNodes()
44 auto prim = std::make_shared<Primitive>(kTransDataOpName); in DefinePattern()
55 … op_name == prim::kPrimReshape->name() || op_name == kTransDataOpName || opt::IsNopNode(cnode)) { in FindRefOriginNode()
32 if (node != nullptr && node->isa<CNode>() && AnfAlgo::GetCNodeName(node) == kTransDataOpName) { in Process()
88 kTransDataOpName, input_dtypes, input_shapes, output_dtypes, output_shapes); in ObtainTransDataKernelGraph()
60 if (trans_opname == kTransDataOpName || trans_opname == kTransDataRNNOpName) { in SetTransNodeAttr()64 …input_format = AnfAlgo::GetCNodeName(trans_node) == kTransDataOpName ? kOpFormat_NCHW : kOpFormat_… in SetTransNodeAttr()67 …output_format = AnfAlgo::GetCNodeName(trans_node) == kTransDataOpName ? kOpFormat_NCHW : kOpFormat… in SetTransNodeAttr()
76 if (AnfAlgo::GetCNodeName(cnode) == kTransDataOpName) { in SelectKernel()
109 …if (in_node_name == kTransDataOpName && (trans_input->isa<Parameter>() || trans_input->isa<ValueNo… in InputCheck()
122 constexpr auto kTransDataOpName = "TransData"; variable