struct TypeGraph {
typedef const ::Type NodeType;
- typedef ::Type::contype_iterator ChildIteratorType;
+ typedef ::Type::subtype_iterator ChildIteratorType;
static inline ChildIteratorType child_begin(NodeType *N) {
- return N->contype_begin();
+ return N->subtype_begin();
}
static inline ChildIteratorType child_end(NodeType *N) {
- return N->contype_end();
+ return N->subtype_end();
}
};
// Type Iteration support
//
class TypeIterator;
- typedef TypeIterator contype_iterator;
- inline contype_iterator contype_begin() const; // DEFINED BELOW
- inline contype_iterator contype_end() const; // DEFINED BELOW
+ typedef TypeIterator subtype_iterator;
+ inline subtype_iterator subtype_begin() const; // DEFINED BELOW
+ inline subtype_iterator subtype_end() const; // DEFINED BELOW
// getContainedType - This method is used to implement the type iterator
// (defined a the end of the file). For derived types, this returns the types
};
};
-inline Type::TypeIterator Type::contype_begin() const {
+inline Type::TypeIterator Type::subtype_begin() const {
return TypeIterator(this, 0);
}
-inline Type::TypeIterator Type::contype_end() const {
+inline Type::TypeIterator Type::subtype_end() const {
return TypeIterator(this, getNumContainedTypes());
}
}
// Iterate over the types and make sure the the contents are equivalent...
- Type::contype_iterator I = Ty ->contype_begin(), IE = Ty ->contype_end();
- Type::contype_iterator I2 = Ty2->contype_begin(), IE2 = Ty2->contype_end();
+ Type::subtype_iterator I = Ty ->subtype_begin(), IE = Ty ->subtype_end();
+ Type::subtype_iterator I2 = Ty2->subtype_begin(), IE2 = Ty2->subtype_end();
for (; I != IE && I2 != IE2; ++I, ++I2)
if (!TypesEqual(*I, *I2, EqTypes)) return false;