Commit f11dfe01 authored by Tobias Grosser's avatar Tobias Grosser
Browse files

Make polly -Wdocumentation clean 

Merged from: https://llvm.org/svn/llvm-project/polly/trunk@168311

llvm-svn: 170733
parent 8b149dd1

polly/include/polly/CodeGen/BlockGenerators.h

+0 −3
Original line number Diff line number Diff line
@@ -145,9 +145,6 @@ public: 
  /// instructions, but e.g. for address calculation instructions we currently

  /// 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 GlobalMaps A vector of maps that define for certain Values

  ///                   referenced from the original code new Values they should

polly/include/polly/ScopDetection.h

+1 −1
Original line number Diff line number Diff line
@@ -169,7 +169,7 @@ class ScopDetection : public FunctionPass { 
  /// @param Context The context of scop detection.

  ///

  /// @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.

  ///

polly/include/polly/TempScopInfo.h

+2 −4
Original line number Diff line number Diff line
@@ -250,12 +250,10 @@ class TempScopInfo : public FunctionPass { 
  /// @param BB           The BasicBlock to build condition constrains

  /// @param RegionEntry  The entry block of the Smallest Region that containing

  ///                     BB

  /// @param Cond         The built condition

  void buildCondition(BasicBlock *BB, BasicBlock *Region, TempScop &Scop);

  void buildCondition(BasicBlock *BB, BasicBlock *RegionEntry);



  // Build the affine function of the given condition

  void buildAffineCondition(Value &V, bool inverted, Comparison **Comp,

                            TempScop &Scop) const;

  void buildAffineCondition(Value &V, bool inverted, Comparison **Comp) const;



  // Return the temporary Scop information of Region R, where R must be a valid

  // part of Scop

polly/lib/Analysis/TempScopInfo.cpp

+4 −6
Original line number Diff line number Diff line
@@ -146,8 +146,7 @@ void TempScopInfo::buildLoopBounds(TempScop &Scop) { 
}



void TempScopInfo::buildAffineCondition(Value &V, bool inverted,

                                         Comparison **Comp,

                                         TempScop &Scop) const {

                                         Comparison **Comp) const {

  if (ConstantInt *C = dyn_cast<ConstantInt>(&V)) {

    // If this is always true condition, 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);

}



void TempScopInfo::buildCondition(BasicBlock *BB, BasicBlock *RegionEntry,

                                  TempScop &Scop) {

void TempScopInfo::buildCondition(BasicBlock *BB, BasicBlock *RegionEntry) {

  BBCond Cond;



  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);



    Comparison *Cmp;

    buildAffineCondition(*(Br->getCondition()), inverted, &Cmp, Scop);

    buildAffineCondition(*(Br->getCondition()), inverted, &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();

       I != E; ++I) {

    buildAccessFunctions(R, **I);

    buildCondition(*I, R.getEntry(), *TScop);

    buildCondition(*I, R.getEntry());

  }



  buildLoopBounds(*TScop);

polly/lib/CodeGen/CodeGeneration.cpp

+1 −1
Original line number Diff line number Diff line
@@ -321,7 +321,7 @@ private: 
  ///

  /// 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

  ///              execute in parallel.