1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-22 20:43:44 +02:00

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
This commit is contained in:
Chris Lattner 2003-09-02 21:40:33 +00:00
parent cdcee99ee6
commit 4636773d5b

View File

@ -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.
///