[llvm-commits] [llvm] r74059 - /llvm/trunk/include/llvm/Analysis/ScalarEvolution.h
Dan Gohman
gohman at apple.com
Tue Jun 23 21:47:54 PDT 2009
Author: djg
Date: Tue Jun 23 23:47:54 2009
New Revision: 74059
URL: http://llvm.org/viewvc/llvm-project?rev=74059&view=rev
Log:
Remove an obsolete comment and fix some 80-column violations.
Modified:
llvm/trunk/include/llvm/Analysis/ScalarEvolution.h
Modified: llvm/trunk/include/llvm/Analysis/ScalarEvolution.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Analysis/ScalarEvolution.h?rev=74059&r1=74058&r2=74059&view=diff
==============================================================================
--- llvm/trunk/include/llvm/Analysis/ScalarEvolution.h (original)
+++ llvm/trunk/include/llvm/Analysis/ScalarEvolution.h Tue Jun 23 23:47:54 2009
@@ -44,8 +44,8 @@
class SCEVUnknown;
/// SCEV - This class represents an analyzed expression in the program. These
- /// are reference-counted opaque objects that the client is not allowed to
- /// do much with directly.
+ /// are opaque objects that the client is not allowed to do much with
+ /// directly.
///
class SCEV {
const unsigned SCEVType; // The SCEV baseclass this node corresponds to
@@ -305,8 +305,9 @@
/// 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
/// evaluate the trip count of the loop, return CouldNotCompute.
- const SCEV* ComputeBackedgeTakenCountExhaustively(const Loop *L, Value *Cond,
- bool ExitWhen);
+ const SCEV* ComputeBackedgeTakenCountExhaustively(const Loop *L,
+ Value *Cond,
+ bool ExitWhen);
/// HowFarToZero - Return the number of times a backedge comparing the
/// specified value to zero will execute. If not computable, return
@@ -542,10 +543,11 @@
/// is deleted.
void forgetLoopBackedgeTakenCount(const Loop *L);
- /// GetMinTrailingZeros - Determine the minimum number of zero bits that S is
- /// guaranteed to end in (at every loop iteration). It is, at the same time,
- /// the minimum number of times S is divisible by 2. For example, given {4,+,8}
- /// it returns 2. If S is guaranteed to be 0, it returns the bitwidth of S.
+ /// GetMinTrailingZeros - Determine the minimum number of zero bits that S
+ /// is guaranteed to end in (at every loop iteration). It is, at the same
+ /// time, the minimum number of times S is divisible by 2. For example,
+ /// 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);
/// GetMinLeadingZeros - Determine the minimum number of zero bits that S is
More information about the llvm-commits
mailing list