Fix the segfault reported in PR 11990.

The sefault occurs due to an infinite loop when the verifier tries to
determine the size of a type of the form "%rt = type { %rt }" while
checking an alloca of the type.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@196626 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Kaelyn Uhrain 2013-12-07 00:13:34 +00:00
parent 46af5e8efa
commit b95d0907fc
7 changed files with 53 additions and 11 deletions

View File

@ -249,7 +249,7 @@ public:
bool isOpaque() const { return (getSubclassData() & SCDB_HasBody) == 0; } bool isOpaque() const { return (getSubclassData() & SCDB_HasBody) == 0; }
/// isSized - Return true if this is a sized type. /// isSized - Return true if this is a sized type.
bool isSized() const; bool isSized(SmallPtrSet<const Type*, 4> *Visited = 0) const;
/// hasName - Return true if this is a named struct that has a non-empty name. /// hasName - Return true if this is a named struct that has a non-empty name.
bool hasName() const { return SymbolTableEntry != 0; } bool hasName() const { return SymbolTableEntry != 0; }

View File

@ -16,6 +16,7 @@
#define LLVM_IR_TYPE_H #define LLVM_IR_TYPE_H
#include "llvm/ADT/APFloat.h" #include "llvm/ADT/APFloat.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/Support/Casting.h" #include "llvm/Support/Casting.h"
#include "llvm/Support/CBindingWrapping.h" #include "llvm/Support/CBindingWrapping.h"
#include "llvm/Support/DataTypes.h" #include "llvm/Support/DataTypes.h"
@ -275,7 +276,7 @@ public:
/// get the actual size for a particular target, it is reasonable to use the /// get the actual size for a particular target, it is reasonable to use the
/// DataLayout subsystem to do this. /// DataLayout subsystem to do this.
/// ///
bool isSized() const { bool isSized(SmallPtrSet<const Type*, 4> *Visited = 0) const {
// If it's a primitive, it is always sized. // If it's a primitive, it is always sized.
if (getTypeID() == IntegerTyID || isFloatingPointTy() || if (getTypeID() == IntegerTyID || isFloatingPointTy() ||
getTypeID() == PointerTyID || getTypeID() == PointerTyID ||
@ -287,7 +288,7 @@ public:
getTypeID() != VectorTyID) getTypeID() != VectorTyID)
return false; return false;
// Otherwise we have to try harder to decide. // Otherwise we have to try harder to decide.
return isSizedDerivedType(); return isSizedDerivedType(Visited);
} }
/// getPrimitiveSizeInBits - Return the basic size of this type if it is a /// getPrimitiveSizeInBits - Return the basic size of this type if it is a
@ -429,7 +430,7 @@ private:
/// isSizedDerivedType - Derived types like structures and arrays are sized /// isSizedDerivedType - Derived types like structures and arrays are sized
/// iff all of the members of the type are sized as well. Since asking for /// iff all of the members of the type are sized as well. Since asking for
/// their size is relatively uncommon, move this operation out of line. /// their size is relatively uncommon, move this operation out of line.
bool isSizedDerivedType() const; bool isSizedDerivedType(SmallPtrSet<const Type*, 4> *Visited = 0) const;
}; };
// Printing of types. // Printing of types.

View File

@ -155,14 +155,14 @@ int Type::getFPMantissaWidth() const {
/// isSizedDerivedType - Derived types like structures and arrays are sized /// isSizedDerivedType - Derived types like structures and arrays are sized
/// iff all of the members of the type are sized as well. Since asking for /// iff all of the members of the type are sized as well. Since asking for
/// their size is relatively uncommon, move this operation out of line. /// their size is relatively uncommon, move this operation out of line.
bool Type::isSizedDerivedType() const { bool Type::isSizedDerivedType(SmallPtrSet<const Type*, 4> *Visited) const {
if (const ArrayType *ATy = dyn_cast<ArrayType>(this)) if (const ArrayType *ATy = dyn_cast<ArrayType>(this))
return ATy->getElementType()->isSized(); return ATy->getElementType()->isSized(Visited);
if (const VectorType *VTy = dyn_cast<VectorType>(this)) if (const VectorType *VTy = dyn_cast<VectorType>(this))
return VTy->getElementType()->isSized(); return VTy->getElementType()->isSized(Visited);
return cast<StructType>(this)->isSized(); return cast<StructType>(this)->isSized(Visited);
} }
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
@ -550,17 +550,20 @@ StructType *StructType::create(StringRef Name, Type *type, ...) {
return llvm::StructType::create(Ctx, StructFields, Name); return llvm::StructType::create(Ctx, StructFields, Name);
} }
bool StructType::isSized() const { bool StructType::isSized(SmallPtrSet<const Type*, 4> *Visited) const {
if ((getSubclassData() & SCDB_IsSized) != 0) if ((getSubclassData() & SCDB_IsSized) != 0)
return true; return true;
if (isOpaque()) if (isOpaque())
return false; return false;
if (Visited && !Visited->insert(this))
return false;
// Okay, our struct is sized if all of the elements are, but if one of the // Okay, our struct is sized if all of the elements are, but if one of the
// elements is opaque, the struct isn't sized *yet*, but may become sized in // elements is opaque, the struct isn't sized *yet*, but may become sized in
// the future, so just bail out without caching. // the future, so just bail out without caching.
for (element_iterator I = element_begin(), E = element_end(); I != E; ++I) for (element_iterator I = element_begin(), E = element_end(); I != E; ++I)
if (!(*I)->isSized()) if (!(*I)->isSized(Visited))
return false; return false;
// Here we cheat a bit and cast away const-ness. The goal is to memoize when // Here we cheat a bit and cast away const-ness. The goal is to memoize when

View File

@ -1861,11 +1861,12 @@ void Verifier::visitStoreInst(StoreInst &SI) {
} }
void Verifier::visitAllocaInst(AllocaInst &AI) { void Verifier::visitAllocaInst(AllocaInst &AI) {
SmallPtrSet<const Type*, 4> Visited;
PointerType *PTy = AI.getType(); PointerType *PTy = AI.getType();
Assert1(PTy->getAddressSpace() == 0, Assert1(PTy->getAddressSpace() == 0,
"Allocation instruction pointer not in the generic address space!", "Allocation instruction pointer not in the generic address space!",
&AI); &AI);
Assert1(PTy->getElementType()->isSized(), "Cannot allocate unsized type", Assert1(PTy->getElementType()->isSized(&Visited), "Cannot allocate unsized type",
&AI); &AI);
Assert1(AI.getArraySize()->getType()->isIntegerTy(), Assert1(AI.getArraySize()->getType()->isIntegerTy(),
"Alloca array size must have integer type", &AI); "Alloca array size must have integer type", &AI);

View File

@ -0,0 +1,12 @@
; RUN: not llvm-as %s -o /dev/null 2>&1 | FileCheck %s
%rt2 = type { i32, { i8, %rt2, i8 }, i32 }
define i32 @main() nounwind {
entry:
; Check that recursive types trigger an error instead of segfaulting, when
; the recursion isn't through a pointer to the type.
; CHECK: Cannot allocate unsized type
%0 = alloca %rt2
ret i32 0
}

View File

@ -0,0 +1,14 @@
; RUN: not llvm-as %s -o /dev/null 2>&1 | FileCheck %s
%rt1 = type { i32, { i8, %rt2, i8 }, i32 }
%rt2 = type { i64, { i6, %rt3 } }
%rt3 = type { %rt1 }
define i32 @main() nounwind {
entry:
; Check that mutually recursive types trigger an error instead of segfaulting,
; when the recursion isn't through a pointer to the type.
; CHECK: Cannot allocate unsized type
%0 = alloca %rt2
ret i32 0
}

View File

@ -0,0 +1,11 @@
; RUN: llvm-as %s -o /dev/null 2>&1
%rt2 = type { i32, { i8, %rt2*, i8 }, i32 }
define i32 @main() nounwind {
entry:
; Check that linked-list-style recursive types where the recursion is through
; a pointer of the type is valid for an alloca.
%0 = alloca %rt2
ret i32 0
}