WARNING: line length of 84 exceeds 80 columns
#99: FILE: kernel/bpf/verifier.c:24065:
+	 * - 'stack' accumulates vertices in DFS order, see invariant comment below;

WARNING: line length of 95 exceeds 80 columns
#101: FILE: kernel/bpf/verifier.c:24067:
+	 * - 'low[t] == n' => smallest preorder number of the vertex reachable from 't' is 'n';

WARNING: line length of 99 exceeds 80 columns
#115: FILE: kernel/bpf/verifier.c:24081:
+	 * [2] D. J. Pearce "A Space-Efficient Algorithm for Finding Strongly Connected Components"

WARNING: line length of 86 exceeds 80 columns
#128: FILE: kernel/bpf/verifier.c:24094:
+	 * Here is a pseudo-code for an explicitly recursive version of the algorithm:

WARNING: line length of 83 exceeds 80 columns
#148: FILE: kernel/bpf/verifier.c:24114:
+	 *            # Note: for classic algorithm the block below should look as:

WARNING: line length of 97 exceeds 80 columns
#156: FILE: kernel/bpf/verifier.c:24122:
+	 *            # But replacing both 'min' instructions with 'low[w] = min(low[w], low[s])'

WARNING: line length of 96 exceeds 80 columns
#157: FILE: kernel/bpf/verifier.c:24123:
+	 *            # does not break the invariant and makes itartive version of the algorithm

WARNING: line length of 90 exceeds 80 columns
#163: FILE: kernel/bpf/verifier.c:24129:
+	 *            # if 's' is on stack, pick lowest reachable preorder number from it;

WARNING: line length of 81 exceeds 80 columns
#164: FILE: kernel/bpf/verifier.c:24130:
+	 *            # if 's' is not on stack 'low[s] == NOT_ON_STACK > low[w]',

WARNING: line length of 84 exceeds 80 columns
#211: FILE: kernel/bpf/verifier.c:24177:
+			 * Preserve the invariant: if some vertex above in the stack

WARNING: line length of 88 exceeds 80 columns
#219: FILE: kernel/bpf/verifier.c:24185:
+			 * Assign SCC number only if component has two or more elements,

total: 0 errors, 11 warnings, 0 checks, 211 lines checked

NOTE: For some of the reported defects, checkpatch may be able to
      mechanically convert to the typical style using --fix or --fix-inplace.

Commit 2bf73338d870 ("bpf: compute SCCs in program control flow graph") has style problems, please review.

NOTE: Ignored message types: ALLOC_SIZEOF_STRUCT BAD_REPORTED_BY_LINK CAMELCASE COMMIT_LOG_LONG_LINE GIT_COMMIT_ID MACRO_ARG_REUSE NO_AUTHOR_SIGN_OFF

NOTE: If any of the errors are false positives, please report
      them to the maintainer, see CHECKPATCH in MAINTAINERS.
total: 0 errors, 11 warnings, 0 checks, 211 lines checked