Remove the "recursive bit", not only is it unused by anyone, it was also

not correctly calculated, and calculating it wrong for fun seems rather
pointless.

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

diff --git a/include/llvm/Type.h b/include/llvm/Type.h
index 2c92e7411b4781b2f01dcfcea9486e584fd467e9..e2ee9545bdaafac2a1bf02e6340f6628b96cc97c 100644 (file)
--- a/include/llvm/Type.h
+++ b/include/llvm/Type.h
@@ -73,7 +73,6 @@ private:
   PrimitiveID ID;        // The current base type of this type...
   unsigned    UID;       // The unique ID number for this class
   bool        Abstract;  // True if type contains an OpaqueType
-  bool        Recursive; // True if the type is recursive
 
 protected:
   /// ctor is protected, so only subclasses can create Type objects...
@@ -89,10 +88,6 @@ protected:
   ///
   inline void setAbstract(bool Val) { Abstract = Val; }
 
-  /// Types can become recursive later, if they are refined.
-  ///
-  inline void setRecursive(bool Val) { Recursive = Val; }
-
 public:
   virtual void print(std::ostream &O) const;
 
@@ -148,10 +143,6 @@ public:
   ///
   inline bool isAbstract() const { return Abstract; }
 
-  /// isRecursive - True if the type graph contains a cycle.
-  ///
-  inline bool isRecursive() const { return Recursive; }
-
   /// isLosslesslyConvertibleTo - Return true if this type can be converted to
   /// 'Ty' without any reinterpretation of bits.  For example, uint to int.
   ///