Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- $ spatch --recursive-includes -I ofed/include -I . --verbose-parsing -parse-h ofed/include/linux/bitops.h
- init_defs_builtins: /usr/local/share/coccinelle/standard.h
- PARSING: ofed/include/linux/bitops.h
- ERROR-RECOV: found sync end of #define, line 510
- parsing pass2: try again
- ERROR-RECOV: found sync end of #define, line 510
- parse error
- = File "ofed/include/linux/bitops.h", line 511, column 0, charpos = 12939
- around = '', whole content =
- badcount: 6
- bad: }
- bad:
- bad:
- bad: #define for_each_set_bit(bit, addr, size) \
- bad: for ((bit) = find_first_bit((addr), (size)); \
- bad: (bit) < (size); \
- BAD:!!!!! (bit) = find_next_bit((addr), (size), (bit) + 1))
- -----------------------------------------------------------------------
- maybe 10 most problematic tokens
- -----------------------------------------------------------------------
- bit: present in 4 parsing errors
- example:
- for ((bit) = find_first_bit((addr), (size)); \
- (bit) < (size); \
- (bit) = find_next_bit((addr), (size), (bit) + 1))
- size: present in 3 parsing errors
- example:
- for ((bit) = find_first_bit((addr), (size)); \
- (bit) < (size); \
- (bit) = find_next_bit((addr), (size), (bit) + 1))
- addr: present in 2 parsing errors
- example:
- for ((bit) = find_first_bit((addr), (size)); \
- (bit) < (size); \
- (bit) = find_next_bit((addr), (size), (bit) + 1))
- find_first_bit: present in 1 parsing errors
- example:
- for ((bit) = find_first_bit((addr), (size)); \
- (bit) < (size); \
- (bit) = find_next_bit((addr), (size), (bit) + 1))
- find_next_bit: present in 1 parsing errors
- example:
- for ((bit) = find_first_bit((addr), (size)); \
- (bit) < (size); \
- (bit) = find_next_bit((addr), (size), (bit) + 1))
- -----------------------------------------------------------------------
- NB total files = 1; perfect = 0; pbs = 1; timeout = 0; =========> 0%
- nb good = 505, nb passed = 0 =========> 0.000000% passed
- nb good = 505, nb bad = 6 =========> 98.825832% good
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement