update comment

nikic · nikic · commit 7dcc4bff8eef · 2024-02-08T09:21:43.000+01:00
diff --git a/llvm/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp b/llvm/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp
@@ -2217,9 +2217,11 @@ foldBitwiseLogicWithIntrinsics(BinaryOperator &I,
   }
 }
 
-// Try to simplify X | Y by replacing occurrences of Y in X with 0.
-// Similarly, simplify X & Y by replacing occurrences of Y in X with -1.
+// Try to simplify V by replacing occurrences of Op with RepOp, but only look
+// through bitwise operations. In particular, for X | Y we try to replace Y with
+// 0 inside X and for X & Y we try to replace Y with -1 inside X.
 // Return the simplified result of X if successful, and nullptr otherwise.
+// If SimplifyOnly is true, no new instructions will be created.
 static Value *simplifyAndOrWithOpReplaced(Value *V, Value *Op, Value *RepOp,
                                           bool SimplifyOnly,
                                           InstCombinerImpl &IC,

Original file line number	Diff line number	Diff line change
`@@ -2217,9 +2217,11 @@ foldBitwiseLogicWithIntrinsics(BinaryOperator &I,`
`2217`	`2217`	`}`
`2218`	`2218`	`}`
`2219`	`2219`
`2220`		`-// Try to simplify X \| Y by replacing occurrences of Y in X with 0.`
`2221`		`-// Similarly, simplify X & Y by replacing occurrences of Y in X with -1.`
	`2220`	`+// Try to simplify V by replacing occurrences of Op with RepOp, but only look`
	`2221`	`+// through bitwise operations. In particular, for X \| Y we try to replace Y with`
	`2222`	`+// 0 inside X and for X & Y we try to replace Y with -1 inside X.`
`2222`	`2223`	`// Return the simplified result of X if successful, and nullptr otherwise.`
	`2224`	`+// If SimplifyOnly is true, no new instructions will be created.`
`2223`	`2225`	`static Value simplifyAndOrWithOpReplaced(Value V, Value Op, Value RepOp,`
`2224`	`2226`	`bool SimplifyOnly,`
`2225`	`2227`	`InstCombinerImpl &IC,`