bpf: Fix typo in scalar{,32}_min_max_rsh comments
authorTobias Klauser <tklauser@distanz.ch>
Thu, 21 Jan 2021 17:43:24 +0000 (18:43 +0100)
committerDaniel Borkmann <daniel@iogearbox.net>
Fri, 22 Jan 2021 23:23:23 +0000 (00:23 +0100)
s/bounts/bounds/

Signed-off-by: Tobias Klauser <tklauser@distanz.ch>
Signed-off-by: Daniel Borkmann <daniel@iogearbox.net>
Link: https://lore.kernel.org/bpf/20210121174324.24127-1-tklauser@distanz.ch
kernel/bpf/verifier.c

index 785d25392ead7a411be645e810f43c0307377b2f..d0eae51b31e48317722864bb42af15ddd4f370b9 100644 (file)
@@ -6266,7 +6266,7 @@ static void scalar32_min_max_rsh(struct bpf_reg_state *dst_reg,
         * 3) the signed bounds cross zero, so they tell us nothing
         *    about the result
         * If the value in dst_reg is known nonnegative, then again the
-        * unsigned bounts capture the signed bounds.
+        * unsigned bounds capture the signed bounds.
         * Thus, in all cases it suffices to blow away our signed bounds
         * and rely on inferring new ones from the unsigned bounds and
         * var_off of the result.
@@ -6297,7 +6297,7 @@ static void scalar_min_max_rsh(struct bpf_reg_state *dst_reg,
         * 3) the signed bounds cross zero, so they tell us nothing
         *    about the result
         * If the value in dst_reg is known nonnegative, then again the
-        * unsigned bounts capture the signed bounds.
+        * unsigned bounds capture the signed bounds.
         * Thus, in all cases it suffices to blow away our signed bounds
         * and rely on inferring new ones from the unsigned bounds and
         * var_off of the result.