Skip to content
Snippets Groups Projects
Commit 81c1a878 authored by Chris Lattner's avatar Chris Lattner
Browse files

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.

llvm-svn: 8329
parent a3ce8b48
No related branches found
No related tags found
No related merge requests found
......@@ -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.
///
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment