|
@@ -287,7 +287,8 @@ CGFunctionInfo::CGFunctionInfo(unsigned _CallingConvention,
|
|
|
/***/
|
|
|
|
|
|
void CodeGenTypes::GetExpandedTypes(QualType Ty,
|
|
|
- std::vector<const llvm::Type*> &ArgTys) {
|
|
|
+ std::vector<const llvm::Type*> &ArgTys,
|
|
|
+ bool IsRecursive) {
|
|
|
const RecordType *RT = Ty->getAsStructureType();
|
|
|
assert(RT && "Can only expand structure types.");
|
|
|
const RecordDecl *RD = RT->getDecl();
|
|
@@ -302,9 +303,9 @@ void CodeGenTypes::GetExpandedTypes(QualType Ty,
|
|
|
|
|
|
QualType FT = FD->getType();
|
|
|
if (CodeGenFunction::hasAggregateLLVMType(FT)) {
|
|
|
- GetExpandedTypes(FT, ArgTys);
|
|
|
+ GetExpandedTypes(FT, ArgTys, IsRecursive);
|
|
|
} else {
|
|
|
- ArgTys.push_back(ConvertType(FT));
|
|
|
+ ArgTys.push_back(ConvertType(FT, IsRecursive));
|
|
|
}
|
|
|
}
|
|
|
}
|
|
@@ -567,11 +568,12 @@ const llvm::FunctionType *CodeGenTypes::GetFunctionType(GlobalDecl GD) {
|
|
|
cast<FunctionDecl>(GD.getDecl())->getType()->getAs<FunctionProtoType>())
|
|
|
Variadic = FPT->isVariadic();
|
|
|
|
|
|
- return GetFunctionType(FI, Variadic);
|
|
|
+ return GetFunctionType(FI, Variadic, false);
|
|
|
}
|
|
|
|
|
|
const llvm::FunctionType *
|
|
|
-CodeGenTypes::GetFunctionType(const CGFunctionInfo &FI, bool IsVariadic) {
|
|
|
+CodeGenTypes::GetFunctionType(const CGFunctionInfo &FI, bool IsVariadic,
|
|
|
+ bool IsRecursive) {
|
|
|
std::vector<const llvm::Type*> ArgTys;
|
|
|
|
|
|
const llvm::Type *ResultType = 0;
|
|
@@ -584,13 +586,13 @@ CodeGenTypes::GetFunctionType(const CGFunctionInfo &FI, bool IsVariadic) {
|
|
|
|
|
|
case ABIArgInfo::Extend:
|
|
|
case ABIArgInfo::Direct:
|
|
|
- ResultType = ConvertType(RetTy);
|
|
|
+ ResultType = ConvertType(RetTy, IsRecursive);
|
|
|
break;
|
|
|
|
|
|
case ABIArgInfo::Indirect: {
|
|
|
assert(!RetAI.getIndirectAlign() && "Align unused on indirect return.");
|
|
|
ResultType = llvm::Type::getVoidTy(getLLVMContext());
|
|
|
- const llvm::Type *STy = ConvertType(RetTy);
|
|
|
+ const llvm::Type *STy = ConvertType(RetTy, IsRecursive);
|
|
|
ArgTys.push_back(llvm::PointerType::get(STy, RetTy.getAddressSpace()));
|
|
|
break;
|
|
|
}
|
|
@@ -635,11 +637,11 @@ CodeGenTypes::GetFunctionType(const CGFunctionInfo &FI, bool IsVariadic) {
|
|
|
|
|
|
case ABIArgInfo::Extend:
|
|
|
case ABIArgInfo::Direct:
|
|
|
- ArgTys.push_back(ConvertType(it->type));
|
|
|
+ ArgTys.push_back(ConvertType(it->type, IsRecursive));
|
|
|
break;
|
|
|
|
|
|
case ABIArgInfo::Expand:
|
|
|
- GetExpandedTypes(it->type, ArgTys);
|
|
|
+ GetExpandedTypes(it->type, ArgTys, IsRecursive);
|
|
|
break;
|
|
|
}
|
|
|
}
|
|
@@ -652,7 +654,7 @@ CodeGenTypes::GetFunctionTypeForVTable(const CXXMethodDecl *MD) {
|
|
|
const FunctionProtoType *FPT = MD->getType()->getAs<FunctionProtoType>();
|
|
|
|
|
|
if (!VerifyFuncTypeComplete(FPT))
|
|
|
- return GetFunctionType(getFunctionInfo(MD), FPT->isVariadic());
|
|
|
+ return GetFunctionType(getFunctionInfo(MD), FPT->isVariadic(), false);
|
|
|
|
|
|
return llvm::OpaqueType::get(getLLVMContext());
|
|
|
}
|
|
@@ -787,7 +789,7 @@ void CodeGenModule::ConstructAttributeList(const CGFunctionInfo &FI,
|
|
|
// FIXME: This is rather inefficient. Do we ever actually need to do
|
|
|
// anything here? The result should be just reconstructed on the other
|
|
|
// side, so extension should be a non-issue.
|
|
|
- getTypes().GetExpandedTypes(ParamType, Tys);
|
|
|
+ getTypes().GetExpandedTypes(ParamType, Tys, false);
|
|
|
Index += Tys.size();
|
|
|
continue;
|
|
|
}
|