mirror of
				https://github.com/c64scene-ar/llvm-6502.git
				synced 2025-11-04 05:17:07 +00:00 
			
		
		
		
	Fix a few -Wdocumentation warnings
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@205116 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
		@@ -222,7 +222,7 @@ static const SetOfMachineInstr *getUses(const InstrToInstrs *sets, unsigned reg,
 | 
			
		||||
/// - its kill set.
 | 
			
		||||
/// - its reachable uses (uses that are exposed to BB's predecessors).
 | 
			
		||||
/// - its the generated definitions.
 | 
			
		||||
/// \param DummyOp, if not NULL, specifies a Dummy Operation to be added to
 | 
			
		||||
/// \param DummyOp if not NULL, specifies a Dummy Operation to be added to
 | 
			
		||||
/// the list of uses of exposed defintions.
 | 
			
		||||
/// \param ADRPMode specifies to only consider ADRP instructions for generated
 | 
			
		||||
/// definition. It also consider definitions of ADRP instructions as uses and
 | 
			
		||||
@@ -417,11 +417,11 @@ static void finitReachingDef(BlockToSetOfInstrsPerColor &In,
 | 
			
		||||
 | 
			
		||||
/// Reaching definiton algorithm.
 | 
			
		||||
/// \param MF function on which the algorithm will operate.
 | 
			
		||||
/// \param ColorOpToReachedUses[out] will contain the result of the reaching
 | 
			
		||||
/// \param[out] ColorOpToReachedUses will contain the result of the reaching
 | 
			
		||||
/// def algorithm.
 | 
			
		||||
/// \param ADRPMode specify whether the reaching def algorithm should be tuned
 | 
			
		||||
/// for ADRP optimization. \see initReachingDef for more details.
 | 
			
		||||
/// \param DummyOp, if not NULL, the algorithm will work at
 | 
			
		||||
/// \param DummyOp if not NULL, the algorithm will work at
 | 
			
		||||
/// basic block scope and will set for every exposed defintion a use to
 | 
			
		||||
/// @p DummyOp.
 | 
			
		||||
/// \pre ColorOpToReachedUses is an array of at least number of registers of
 | 
			
		||||
 
 | 
			
		||||
@@ -1740,9 +1740,9 @@ static SDValue LowerPREFETCH(SDValue Op, SelectionDAG &DAG) {
 | 
			
		||||
  }
 | 
			
		||||
 | 
			
		||||
  // built the mask value encoding the expected behavior.
 | 
			
		||||
  unsigned PrfOp = (IsWrite << 4) |  //< Load/Store bit
 | 
			
		||||
                   (Locality << 1) | //< Cache level bits
 | 
			
		||||
                   IsStream;         //< Stream bit
 | 
			
		||||
  unsigned PrfOp = (IsWrite << 4) |  // Load/Store bit
 | 
			
		||||
                   (Locality << 1) | // Cache level bits
 | 
			
		||||
                   IsStream;         // Stream bit
 | 
			
		||||
  return DAG.getNode(ARM64ISD::PREFETCH, DL, MVT::Other, Op.getOperand(0),
 | 
			
		||||
                     DAG.getConstant(PrfOp, MVT::i32), Op.getOperand(1));
 | 
			
		||||
}
 | 
			
		||||
 
 | 
			
		||||
@@ -132,7 +132,7 @@ private:
 | 
			
		||||
  /// \param UseIt the use to be added into the list of dominated uses
 | 
			
		||||
  /// \param InsertPts existing insertion points
 | 
			
		||||
  /// \pre NewPt and all instruction in InsertPts belong to the same function
 | 
			
		||||
  /// \retun true if one of the insertion point in InsertPts dominates NewPt,
 | 
			
		||||
  /// \return true if one of the insertion point in InsertPts dominates NewPt,
 | 
			
		||||
  ///         false otherwise
 | 
			
		||||
  bool isDominated(Instruction *NewPt, Value::user_iterator &UseIt,
 | 
			
		||||
                   InsertionPoints &InsertPts);
 | 
			
		||||
@@ -146,7 +146,7 @@ private:
 | 
			
		||||
  /// \param InsertPts existing insertion points
 | 
			
		||||
  /// \pre NewPt and all instruction in InsertPts belong to the same function
 | 
			
		||||
  /// \pre isDominated returns false for the exact same parameters.
 | 
			
		||||
  /// \retun true if it exists an insertion point in InsertPts that could
 | 
			
		||||
  /// \return true if it exists an insertion point in InsertPts that could
 | 
			
		||||
  ///         have been merged with NewPt in a common dominator,
 | 
			
		||||
  ///         false otherwise
 | 
			
		||||
  bool tryAndMerge(Instruction *NewPt, Value::user_iterator &UseIt,
 | 
			
		||||
@@ -157,7 +157,7 @@ private:
 | 
			
		||||
  /// Insertion points are group per function and each insertion point
 | 
			
		||||
  /// contains a list of all the uses it dominates within the related function
 | 
			
		||||
  /// \param Val constant to be examined
 | 
			
		||||
  /// \param InsPtsPerFunc[out] output storage of the analysis
 | 
			
		||||
  /// \param[out] InsPtsPerFunc output storage of the analysis
 | 
			
		||||
  void computeInsertionPoints(Constant *Val,
 | 
			
		||||
                              InsertionPointsPerFunc &InsPtsPerFunc);
 | 
			
		||||
 | 
			
		||||
 
 | 
			
		||||
@@ -42,7 +42,7 @@ public:
 | 
			
		||||
  typedef SmallVectorImpl<MCParsedAsmOperand *> OperandVector;
 | 
			
		||||
 | 
			
		||||
private:
 | 
			
		||||
  StringRef Mnemonic; //< Instruction mnemonic.
 | 
			
		||||
  StringRef Mnemonic; ///< Instruction mnemonic.
 | 
			
		||||
  MCSubtargetInfo &STI;
 | 
			
		||||
  MCAsmParser &Parser;
 | 
			
		||||
 | 
			
		||||
 
 | 
			
		||||
		Reference in New Issue
	
	Block a user