reformat comment

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33675 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2007-01-30 23:16:22 +00:00
parent 0a19ffaf58
commit 3cab071f6f

View File

@ -125,8 +125,8 @@ bool FoldingSetImpl::NodeID::operator==(const FoldingSetImpl::NodeID &RHS)const{
/// singly-linked-list. In order to make deletion more efficient, we make /// singly-linked-list. In order to make deletion more efficient, we make
/// the list circular, so we can delete a node without computing its hash. /// the list circular, so we can delete a node without computing its hash.
/// The problem with this is that the start of the hash buckets are not /// The problem with this is that the start of the hash buckets are not
/// Nodes. If NextInBucketPtr is a bucket pointer, this method returns null /// Nodes. If NextInBucketPtr is a bucket pointer, this method returns null:
/// : use GetBucketPtr when this happens. /// use GetBucketPtr when this happens.
static FoldingSetImpl::Node *GetNextPtr(void *NextInBucketPtr, static FoldingSetImpl::Node *GetNextPtr(void *NextInBucketPtr,
void **Buckets, unsigned NumBuckets) { void **Buckets, unsigned NumBuckets) {
if (NextInBucketPtr >= Buckets && NextInBucketPtr < Buckets + NumBuckets) if (NextInBucketPtr >= Buckets && NextInBucketPtr < Buckets + NumBuckets)