6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-02 07:32:52 +00:00
Code Issues Projects Releases Wiki Activity

Fix -Wdocumentation warnings.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@187336 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Rafael Espindola 2013-07-28 23:43:28 +00:00
parent 064a68682d
commit 15658b2908
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -612,7 +612,7 @@ public:
/// insertFrom - Add mapping of [a;b] to y if possible, coalescing as much as /// insertFrom - Add mapping of [a;b] to y if possible, coalescing as much as
/// possible. This may cause the node to grow by 1, or it may cause the node /// possible. This may cause the node to grow by 1, or it may cause the node
/// to shrink because of coalescing. /// to shrink because of coalescing.
/// @param i Starting index = insertFrom(0, size, a) /// @param Pos Starting index = insertFrom(0, size, a)
/// @param Size Number of elements in node. /// @param Size Number of elements in node.
/// @param a Interval start. /// @param a Interval start.
/// @param b Interval stop. /// @param b Interval stop.
@ -1956,7 +1956,7 @@ iterator::eraseNode(unsigned Level) {
/// overflow - Distribute entries of the current node evenly among /// overflow - Distribute entries of the current node evenly among
/// its siblings and ensure that the current node is not full. /// its siblings and ensure that the current node is not full.
/// This may require allocating a new node. /// This may require allocating a new node.
/// @param NodeT The type of node at Level (Leaf or Branch). /// @tparam NodeT The type of node at Level (Leaf or Branch).
/// @param Level path index of the overflowing node. /// @param Level path index of the overflowing node.
/// @return True when the tree height was changed. /// @return True when the tree height was changed.
template <typename KeyT, typename ValT, unsigned N, typename Traits> template <typename KeyT, typename ValT, unsigned N, typename Traits>

8
lib/Transforms/Utils/SimplifyCFG.cpp
View File

@ -120,10 +120,10 @@ class SimplifyCFGOpt {
/// the if-region with an adjacent if-region upstream if two if-regions /// the if-region with an adjacent if-region upstream if two if-regions
/// contain identical instructions. /// contain identical instructions.
bool MergeIfRegion(BasicBlock *BB, IRBuilder<> &Builder, Pass *P = 0); bool MergeIfRegion(BasicBlock *BB, IRBuilder<> &Builder, Pass *P = 0);
/// \brief Compare a pair of blocks: \param Block1 and \param Block2, which /// \brief Compare a pair of blocks: \p Block1 and \p Block2, which
/// are from two if-regions whose entry blocks are \param Head1 and \param /// are from two if-regions whose entry blocks are \p Head1 and \p
/// Head2. \returns true if \param Block1 and \param Block2 contain identical /// Head2. \returns true if \p Block1 and \p Block2 contain identical
/// instructions, and have no memory reference alias with \param Head2. /// instructions, and have no memory reference alias with \p Head2.
/// This is used as a legality check for merging if-regions. /// This is used as a legality check for merging if-regions.
bool CompareIfRegionBlock(BasicBlock *Head1, BasicBlock *Head2, bool CompareIfRegionBlock(BasicBlock *Head1, BasicBlock *Head2,
BasicBlock *Block1, BasicBlock *Block2); BasicBlock *Block1, BasicBlock *Block2);