Searched refs:LegalizeOp (Results 1 – 6 of 6) sorted by relevance
107 ``LegalizeOp`` which calls LegalizeOp on the node's operands, and returns a111 node's case statement in ``LegalizeOp`` to Expand your node into simpler,118 will also need to add code to your node's case statement in ``LegalizeOp``147 code you wrote in ``LegalizeOp`` above to decompose your new node into other
67 switch in SelectionDAGLegalize::LegalizeOp().::
72 SDValue LegalizeOp(SDValue Op);205 LegalizeOp(SDValue(&*I, 0)); in Run()236 Results[i] = LegalizeOp(Results[i]); in RecursivelyLegalizeResults()243 SDValue VectorLegalizer::LegalizeOp(SDValue Op) { in LegalizeOp() function in VectorLegalizer252 Ops.push_back(LegalizeOp(Oper)); in LegalizeOp()
111 void LegalizeOp(SDNode *Node);958 void SelectionDAGLegalize::LegalizeOp(SDNode *Node) { in LegalizeOp() function in SelectionDAGLegalize1123 LegalizeOp(NewVal.getNode()); in LegalizeOp()1135 LegalizeOp(NewVal.getNode()); in LegalizeOp()2518 LegalizeOp(Load.getNode()); in ExpandLegalINT_TO_FP()5091 Legalizer.LegalizeOp(N); in Legalize()5108 bool SelectionDAG::LegalizeOp(SDNode *N, in LegalizeOp() function in SelectionDAG5116 Legalizer.LegalizeOp(N); in LegalizeOp()
1601 bool NIsValid = DAG.LegalizeOp(N, UpdatedNodes); in Run()
594 bool LegalizeOp(SDNode *N, SmallSetVector<SDNode *, 16> &UpdatedNodes);