Make polly -Wdocumentation clean

llvm-svn: 168311
This commit is contained in:
Tobias Grosser 2012-11-19 12:26:25 +00:00
parent 3d3373ceb6
commit c1b6cec0e7
7 changed files with 8 additions and 17 deletions

View File

@ -145,9 +145,6 @@ public:
/// instructions, but e.g. for address calculation instructions we currently /// instructions, but e.g. for address calculation instructions we currently
/// generate scalar instructions for each vector lane. /// generate scalar instructions for each vector lane.
/// ///
/// @param Builder The LLVM-IR Builder used to generate the statement. The
/// code is generated at the location, the builder points
/// to.
/// @param Stmt The statement to code generate. /// @param Stmt The statement to code generate.
/// @param GlobalMaps A vector of maps that define for certain Values /// @param GlobalMaps A vector of maps that define for certain Values
/// referenced from the original code new Values they should /// referenced from the original code new Values they should

View File

@ -169,7 +169,7 @@ class ScopDetection : public FunctionPass {
/// @param Context The context of scop detection. /// @param Context The context of scop detection.
/// ///
/// @return True if the instruction is valid, false otherwise. /// @return True if the instruction is valid, false otherwise.
bool isValidInstruction(Instruction &I, DetectionContext &Context) const; bool isValidInstruction(Instruction &Inst, DetectionContext &Context) const;
/// @brief Check if the BB can be part of a Scop. /// @brief Check if the BB can be part of a Scop.
/// ///

View File

@ -250,12 +250,10 @@ class TempScopInfo : public FunctionPass {
/// @param BB The BasicBlock to build condition constrains /// @param BB The BasicBlock to build condition constrains
/// @param RegionEntry The entry block of the Smallest Region that containing /// @param RegionEntry The entry block of the Smallest Region that containing
/// BB /// BB
/// @param Cond The built condition void buildCondition(BasicBlock *BB, BasicBlock *RegionEntry);
void buildCondition(BasicBlock *BB, BasicBlock *Region, TempScop &Scop);
// Build the affine function of the given condition // Build the affine function of the given condition
void buildAffineCondition(Value &V, bool inverted, Comparison **Comp, void buildAffineCondition(Value &V, bool inverted, Comparison **Comp) const;
TempScop &Scop) const;
// Return the temporary Scop information of Region R, where R must be a valid // Return the temporary Scop information of Region R, where R must be a valid
// part of Scop // part of Scop

View File

@ -146,8 +146,7 @@ void TempScopInfo::buildLoopBounds(TempScop &Scop) {
} }
void TempScopInfo::buildAffineCondition(Value &V, bool inverted, void TempScopInfo::buildAffineCondition(Value &V, bool inverted,
Comparison **Comp, Comparison **Comp) const {
TempScop &Scop) const {
if (ConstantInt *C = dyn_cast<ConstantInt>(&V)) { if (ConstantInt *C = dyn_cast<ConstantInt>(&V)) {
// If this is always true condition, we will create 1 >= 0, // If this is always true condition, we will create 1 >= 0,
// otherwise we will create 1 == 0. // otherwise we will create 1 == 0.
@ -191,8 +190,7 @@ void TempScopInfo::buildAffineCondition(Value &V, bool inverted,
*Comp = new Comparison(LHS, RHS, Pred); *Comp = new Comparison(LHS, RHS, Pred);
} }
void TempScopInfo::buildCondition(BasicBlock *BB, BasicBlock *RegionEntry, void TempScopInfo::buildCondition(BasicBlock *BB, BasicBlock *RegionEntry) {
TempScop &Scop) {
BBCond Cond; BBCond Cond;
DomTreeNode *BBNode = DT->getNode(BB), *EntryNode = DT->getNode(RegionEntry); DomTreeNode *BBNode = DT->getNode(BB), *EntryNode = DT->getNode(RegionEntry);
@ -219,7 +217,7 @@ void TempScopInfo::buildCondition(BasicBlock *BB, BasicBlock *RegionEntry,
bool inverted = DT->dominates(Br->getSuccessor(1), BB); bool inverted = DT->dominates(Br->getSuccessor(1), BB);
Comparison *Cmp; Comparison *Cmp;
buildAffineCondition(*(Br->getCondition()), inverted, &Cmp, Scop); buildAffineCondition(*(Br->getCondition()), inverted, &Cmp);
Cond.push_back(*Cmp); Cond.push_back(*Cmp);
} }
@ -233,7 +231,7 @@ TempScop *TempScopInfo::buildTempScop(Region &R) {
for (Region::block_iterator I = R.block_begin(), E = R.block_end(); for (Region::block_iterator I = R.block_begin(), E = R.block_end();
I != E; ++I) { I != E; ++I) {
buildAccessFunctions(R, **I); buildAccessFunctions(R, **I);
buildCondition(*I, R.getEntry(), *TScop); buildCondition(*I, R.getEntry());
} }
buildLoopBounds(*TScop); buildLoopBounds(*TScop);

View File

@ -321,7 +321,7 @@ private:
/// ///
/// Detect if a clast_for loop can be executed in parallel. /// Detect if a clast_for loop can be executed in parallel.
/// ///
/// @param f The clast for loop to check. /// @param For The clast for loop to check.
/// ///
/// @return bool Returns true if the incoming clast_for statement can /// @return bool Returns true if the incoming clast_for statement can
/// execute in parallel. /// execute in parallel.

View File

@ -44,7 +44,6 @@ namespace Json {
bool collectComments = true ); bool collectComments = true );
/** \brief Read a Value from a <a HREF="http://www.json.org">JSON</a> document. /** \brief Read a Value from a <a HREF="http://www.json.org">JSON</a> document.
* \param document UTF-8 encoded string containing the document to read.
* \param root [out] Contains the root value of the document if it was * \param root [out] Contains the root value of the document if it was
* successfully parsed. * successfully parsed.
* \param collectComments \c true to collect comment and allow writing them back during * \param collectComments \c true to collect comment and allow writing them back during

View File

@ -116,7 +116,6 @@ namespace Json {
* *
* If the Value have comments then they are outputed according to their #CommentPlacement. * If the Value have comments then they are outputed according to their #CommentPlacement.
* *
* \param indentation Each level will be indented by this amount extra.
* \sa Reader, Value, Value::setComment() * \sa Reader, Value, Value::setComment()
*/ */
class JSON_API StyledStreamWriter class JSON_API StyledStreamWriter