Update cpp/ql/lib/semmle/code/cpp/security/InvalidPointerDereference/InvalidPointerToDereference.qll

MathiasVP · jketema · web-flow · commit 99f6e685c7b2 · 2023-07-25T11:18:46.000+02:00
Co-authored-by: Jeroen Ketema &lt;93738568+jketema@users.noreply.github.com&gt;
diff --git a/cpp/ql/lib/semmle/code/cpp/security/InvalidPointerDereference/InvalidPointerToDereference.qll b/cpp/ql/lib/semmle/code/cpp/security/InvalidPointerDereference/InvalidPointerToDereference.qll
@@ -19,7 +19,7 @@
  * Merely _constructing_ a pointer that's out-of-bounds is fine if the pointer is never dereferenced (in reality, the
  * standard only guarantees that it is safe to move the pointer one element past the last element, but we ignore that
  * here). So this step is about identifying which of the out-of-bounds pointers found by `pointerAddInstructionHasBounds`
- * in `AllocationToInvalidPointer.qll` that are actually being dereferenced. We do this using a regular dataflow
+ * in `AllocationToInvalidPointer.qll` are actually being dereferenced. We do this using a regular dataflow
  * configuration (see `InvalidPointerToDerefConfig`).
  *
  * This dataflow traversal defines the set of sources as any dataflow node `n` such that there exists a pointer-arithmetic

Original file line number	Diff line number	Diff line change
`@@ -19,7 +19,7 @@`
`19`	`19`	`* Merely _constructing_ a pointer that's out-of-bounds is fine if the pointer is never dereferenced (in reality, the`
`20`	`20`	`* standard only guarantees that it is safe to move the pointer one element past the last element, but we ignore that`
`21`	`21`	* here). So this step is about identifying which of the out-of-bounds pointers found by `pointerAddInstructionHasBounds`
`22`		- * in `AllocationToInvalidPointer.qll` that are actually being dereferenced. We do this using a regular dataflow
	`22`	+ * in `AllocationToInvalidPointer.qll` are actually being dereferenced. We do this using a regular dataflow
`23`	`23`	* configuration (see `InvalidPointerToDerefConfig`).
`24`	`24`	`*`
`25`	`25`	* This dataflow traversal defines the set of sources as any dataflow node `n` such that there exists a pointer-arithmetic