maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Remove an obsolete comment and fix some 80-column violations. 

llvm-svn: 74059
This commit is contained in:
Dan Gohman 2009-06-24 04:47:54 +00:00
parent bedf6c2995
commit c08937720b
1 changed files with 10 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
llvm/include/llvm/Analysis/ScalarEvolution.h
View File

@ -44,8 +44,8 @@ namespace llvm {
class SCEVUnknown; class SCEVUnknown;
/// SCEV - This class represents an analyzed expression in the program. These /// SCEV - This class represents an analyzed expression in the program. These
/// are reference-counted opaque objects that the client is not allowed to /// are opaque objects that the client is not allowed to do much with
/// do much with directly. /// directly.
/// ///
class SCEV { class SCEV {
const unsigned SCEVType; // The SCEV baseclass this node corresponds to const unsigned SCEVType; // The SCEV baseclass this node corresponds to
@ -305,7 +305,8 @@ namespace llvm {
/// try to evaluate a few iterations of the loop until we get the exit /// try to evaluate a few iterations of the loop until we get the exit
/// condition gets a value of ExitWhen (true or false). If we cannot /// condition gets a value of ExitWhen (true or false). If we cannot
/// evaluate the trip count of the loop, return CouldNotCompute. /// evaluate the trip count of the loop, return CouldNotCompute.
const SCEV* ComputeBackedgeTakenCountExhaustively(const Loop *L, Value *Cond, const SCEV* ComputeBackedgeTakenCountExhaustively(const Loop *L,
Value *Cond,
bool ExitWhen); bool ExitWhen);
/// HowFarToZero - Return the number of times a backedge comparing the /// HowFarToZero - Return the number of times a backedge comparing the
@ -542,10 +543,11 @@ namespace llvm {
/// is deleted. /// is deleted.
void forgetLoopBackedgeTakenCount(const Loop *L); void forgetLoopBackedgeTakenCount(const Loop *L);
/// GetMinTrailingZeros - Determine the minimum number of zero bits that S is /// GetMinTrailingZeros - Determine the minimum number of zero bits that S
/// guaranteed to end in (at every loop iteration). It is, at the same time, /// is guaranteed to end in (at every loop iteration). It is, at the same
/// the minimum number of times S is divisible by 2. For example, given {4,+,8} /// time, the minimum number of times S is divisible by 2. For example,
/// it returns 2. If S is guaranteed to be 0, it returns the bitwidth of S. /// given {4,+,8} it returns 2. If S is guaranteed to be 0, it returns the
/// bitwidth of S.
uint32_t GetMinTrailingZeros(const SCEV* S); uint32_t GetMinTrailingZeros(const SCEV* S);
/// GetMinLeadingZeros - Determine the minimum number of zero bits that S is /// GetMinLeadingZeros - Determine the minimum number of zero bits that S is