RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-04-02 15:51:54 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Tweak comments to make it clear that we are working in a namespace.

Browse Source 
llvm-svn: 120256
This commit is contained in:
Jakob Stoklund Olesen 2010-11-28 18:58:30 +00:00
parent 9705544e7c
commit 69dce6e4b9
1 changed files with 18 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

36
include/llvm/ADT/IntervalMap.h
View File

@ -167,7 +167,7 @@ typedef std::pair<unsigned,unsigned> IdxPair;
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
//--- Node Storage ---// //--- IntervalMapImpl::NodeBase ---//
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
// //
// Both leaf and branch nodes store vectors of pairs. // Both leaf and branch nodes store vectors of pairs.
@ -301,7 +301,7 @@ public:
} }
}; };
/// adjustSiblingSizes - Move elements between sibling nodes. /// IntervalMapImpl::adjustSiblingSizes - Move elements between sibling nodes.
/// @param Node Array of pointers to sibling nodes. /// @param Node Array of pointers to sibling nodes.
/// @param Nodes Number of nodes. /// @param Nodes Number of nodes.
/// @param CurSize Array of current node sizes, will be overwritten. /// @param CurSize Array of current node sizes, will be overwritten.
@ -348,9 +348,10 @@ void adjustSiblingSizes(NodeT *Node[], unsigned Nodes,
#endif #endif
} }
/// distribute - Compute a new distribution of node elements after an overflow /// IntervalMapImpl::distribute - Compute a new distribution of node elements
/// or underflow. Reserve space for a new element at Position, and compute the /// after an overflow or underflow. Reserve space for a new element at Position,
/// node that will hold Position after redistributing node elements. /// and compute the node that will hold Position after redistributing node
/// elements.
/// ///
/// It is required that /// It is required that
/// ///
@ -386,7 +387,7 @@ IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
//--- NodeSizer ---// //--- IntervalMapImpl::NodeSizer ---//
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
// //
// Compute node sizes from key and value types. // Compute node sizes from key and value types.
@ -442,7 +443,7 @@ struct NodeSizer {
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
//--- NodeRef ---// //--- IntervalMapImpl::NodeRef ---//
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
// //
// B+-tree nodes can be leaves or branches, so we need a polymorphic node // B+-tree nodes can be leaves or branches, so we need a polymorphic node
@ -462,13 +463,12 @@ struct NodeSizer {
// //
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
struct CacheAlignedPointerTraits {
static inline void *getAsVoidPointer(void *P) { return P; }
static inline void *getFromVoidPointer(void *P) { return P; }
enum { NumLowBitsAvailable = Log2CacheLine };
};
class NodeRef { class NodeRef {
struct CacheAlignedPointerTraits {
static inline void *getAsVoidPointer(void *P) { return P; }
static inline void *getFromVoidPointer(void *P) { return P; }
enum { NumLowBitsAvailable = Log2CacheLine };
};
PointerIntPair<void*, Log2CacheLine, unsigned, CacheAlignedPointerTraits> pip; PointerIntPair<void*, Log2CacheLine, unsigned, CacheAlignedPointerTraits> pip;
public: public:
@ -516,7 +516,7 @@ public:
}; };
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
//--- Leaf nodes ---// //--- IntervalMapImpl::LeafNode ---//
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
// //
// Leaf nodes store up to N disjoint intervals with corresponding values. // Leaf nodes store up to N disjoint intervals with corresponding values.
@ -699,7 +699,7 @@ extendStop(unsigned i, unsigned Size, KeyT b) {
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
//--- Branch nodes ---// //--- IntervalMapImpl::BranchNode ---//
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
// //
// A branch node stores references to 1--N subtrees all of the same height. // A branch node stores references to 1--N subtrees all of the same height.
@ -790,7 +790,7 @@ public:
}; };
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
//--- Path ---// //--- IntervalMapImpl::Path ---//
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
// //
// A Path is used by iterators to represent a position in a B+-tree, and the // A Path is used by iterators to represent a position in a B+-tree, and the
@ -1362,7 +1362,7 @@ dump() {
#endif #endif
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
//--- const_iterator ----// //--- IntervalMap::const_iterator ----//
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
template <typename KeyT, typename ValT, unsigned N, typename Traits> template <typename KeyT, typename ValT, unsigned N, typename Traits>
@ -1569,7 +1569,7 @@ const_iterator::treeAdvanceTo(KeyT x) {
} }
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
//--- iterator ----// //--- IntervalMap::iterator ----//
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
template <typename KeyT, typename ValT, unsigned N, typename Traits> template <typename KeyT, typename ValT, unsigned N, typename Traits>