6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-08-02 09:29:24 +00:00
Code Issues Projects Releases Wiki Activity

Fix some typos in a comment.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@76249 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman 2009-07-17 22:16:21 +00:00
parent 47e9fab158
commit 8f080f0233
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
lib/Transforms/Scalar/InstructionCombining.cpp
View File

@ -5456,13 +5456,13 @@ static Value *EmitGEPOffset(User *GEP, Instruction &I, InstCombiner &IC) {
} }
/// EvaluateGEPOffsetExpression - Return an value that can be used to compare of /// EvaluateGEPOffsetExpression - Return a value that can be used to compare
/// the *offset* implied by GEP to zero. For example, if we have &A[i], we want /// the *offset* implied by a GEP to zero. For example, if we have &A[i], we
/// to return 'i' for "icmp ne i, 0". Note that, in general, indices can be /// want to return 'i' for "icmp ne i, 0". Note that, in general, indices can
/// complex, and scales are involved. The above expression would also be legal /// be complex, and scales are involved. The above expression would also be
/// to codegen as "icmp ne (i*4), 0" (assuming A is a pointer to i32). This /// legal to codegen as "icmp ne (i*4), 0" (assuming A is a pointer to i32).
/// later form is less amenable to optimization though, and we are allowed to /// This later form is less amenable to optimization though, and we are allowed
/// generate the first by knowing that pointer arithmetic doesn't overflow. /// to generate the first by knowing that pointer arithmetic doesn't overflow.
/// ///
/// If we can't emit an optimized form for this expression, this returns null. /// If we can't emit an optimized form for this expression, this returns null.
/// ///