LegalizeDAG.cpp (195098) | LegalizeDAG.cpp (195340) |
---|---|
1//===-- LegalizeDAG.cpp - Implement SelectionDAG::Legalize ----------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// --- 1886 unchanged lines hidden (view full) --- 1895 } 1896 SDValue Callee = DAG.getExternalSymbol(TLI.getLibcallName(LC), 1897 TLI.getPointerTy()); 1898 1899 // Splice the libcall in wherever FindInputOutputChains tells us to. 1900 const Type *RetTy = Node->getValueType(0).getTypeForMVT(); 1901 std::pair<SDValue, SDValue> CallInfo = 1902 TLI.LowerCallTo(InChain, RetTy, isSigned, !isSigned, false, false, | 1//===-- LegalizeDAG.cpp - Implement SelectionDAG::Legalize ----------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// --- 1886 unchanged lines hidden (view full) --- 1895 } 1896 SDValue Callee = DAG.getExternalSymbol(TLI.getLibcallName(LC), 1897 TLI.getPointerTy()); 1898 1899 // Splice the libcall in wherever FindInputOutputChains tells us to. 1900 const Type *RetTy = Node->getValueType(0).getTypeForMVT(); 1901 std::pair<SDValue, SDValue> CallInfo = 1902 TLI.LowerCallTo(InChain, RetTy, isSigned, !isSigned, false, false, |
1903 CallingConv::C, false, Callee, Args, DAG, | 1903 0, CallingConv::C, false, Callee, Args, DAG, |
1904 Node->getDebugLoc()); 1905 1906 // Legalize the call sequence, starting with the chain. This will advance 1907 // the LastCALLSEQ_END to the legalized version of the CALLSEQ_END node that 1908 // was added by LowerCallTo (guaranteeing proper serialization of calls). 1909 LegalizeOp(CallInfo.second); 1910 return CallInfo.first; 1911} --- 388 unchanged lines hidden (view full) --- 2300 assert(0 && "Unknown value type!"); 2301 break; 2302 } 2303 case ISD::TRAP: { 2304 // If this operation is not supported, lower it to 'abort()' call 2305 TargetLowering::ArgListTy Args; 2306 std::pair<SDValue, SDValue> CallResult = 2307 TLI.LowerCallTo(Node->getOperand(0), Type::VoidTy, | 1904 Node->getDebugLoc()); 1905 1906 // Legalize the call sequence, starting with the chain. This will advance 1907 // the LastCALLSEQ_END to the legalized version of the CALLSEQ_END node that 1908 // was added by LowerCallTo (guaranteeing proper serialization of calls). 1909 LegalizeOp(CallInfo.second); 1910 return CallInfo.first; 1911} --- 388 unchanged lines hidden (view full) --- 2300 assert(0 && "Unknown value type!"); 2301 break; 2302 } 2303 case ISD::TRAP: { 2304 // If this operation is not supported, lower it to 'abort()' call 2305 TargetLowering::ArgListTy Args; 2306 std::pair<SDValue, SDValue> CallResult = 2307 TLI.LowerCallTo(Node->getOperand(0), Type::VoidTy, |
2308 false, false, false, false, CallingConv::C, false, | 2308 false, false, false, false, 0, CallingConv::C, false, |
2309 DAG.getExternalSymbol("abort", TLI.getPointerTy()), 2310 Args, DAG, dl); 2311 Results.push_back(CallResult.second); 2312 break; 2313 } 2314 case ISD::FP_ROUND: 2315 case ISD::BIT_CONVERT: 2316 Tmp1 = EmitStackConvert(Node->getOperand(0), Node->getValueType(0), --- 788 unchanged lines hidden --- | 2309 DAG.getExternalSymbol("abort", TLI.getPointerTy()), 2310 Args, DAG, dl); 2311 Results.push_back(CallResult.second); 2312 break; 2313 } 2314 case ISD::FP_ROUND: 2315 case ISD::BIT_CONVERT: 2316 Tmp1 = EmitStackConvert(Node->getOperand(0), Node->getValueType(0), --- 788 unchanged lines hidden --- |