Rely on the recursive check for pointer types rather than adding an

explicit check before recursing. A simplification requested by Duncan
during review.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@163896 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/lib/Transforms/Scalar/SROA.cpp b/lib/Transforms/Scalar/SROA.cpp
index 27808ea8c8b88b538f8a3cdabf924fc67d0bebf2..a0fcf2123137adcf0ce27d38f7912c70e2b83625 100644 (file)
--- a/lib/Transforms/Scalar/SROA.cpp
+++ b/lib/Transforms/Scalar/SROA.cpp
@@ -2368,9 +2368,6 @@ static Type *getTypePartition(const TargetData &TD, Type *Ty,
   if (Offset > 0 || Size < ElementSize) {
     if ((Offset + Size) > ElementSize)
       return 0;
-    // Bail if this is a poniter element, we can't recurse through them.
-    if (ElementTy->isPointerTy())
-      return 0;
     return getTypePartition(TD, ElementTy, Offset, Size);
   }
   assert(Offset == 0);