BTF-to-C dumper fixes and improvements
Subsystems (4)
Andrii Nakryiko
maintainercover BTF-to-C dumper fixes and improvements
Fix few tricky issues in libbpf's BTF-to-C converter, discovered thanks to Per's reports and his randomized testing script.
Most notably there is a much improved and correct padding handling. But also it turned out that some corner cases with enums weren't handled correctly (mode(byte) attribute was a new discovery for me). See respective patches for more details.
Andrii Nakryiko (6):
libbpf: fix single-line struct definition output in btf_dump
libbpf: handle non-standardly sized enums better in BTF-to-C dumper selftests/bpf: add non-standardly sized enum tests for btf_dump
libbpf: fix btf__align_of() by taking into account field offsets
libbpf: fix BTF-to-C converter's padding logic selftests/bpf: add few corner cases to test padding handling of
btf_dump
tools/lib/bpf/btf.c | 13 ++ tools/lib/bpf/btf_dump.c | 214 ++++++++++++++---- .../bpf/progs/btf_dump_test_case_bitfields.c | 2 +- .../bpf/progs/btf_dump_test_case_packing.c | 61 ++++- .../bpf/progs/btf_dump_test_case_padding.c | 146 ++++++++++-- .../bpf/progs/btf_dump_test_case_syntax.c | 36 +++ 6 files changed, 404 insertions(+), 68 deletions(-)
Signature · 1 line
2.30.2
Andrii Nakryiko
maintainerPATCH 1/6 libbpf: fix single-line struct definition output in btf_dump
btf_dump APIs emit unnecessary tabs when emitting struct/union definition that fits on the single line. Before this patch we'd get:
struct blah {<tab>};
This patch fixes this and makes sure that we get more natural:
struct blah {};
--- tools/lib/bpf/btf_dump.c | 7 +++++-- 1 file changed, 5 insertions(+), 2 deletions(-)
tools/lib/bpf/btf_dump.c +5 -2
@@ -959,9 +959,12 @@ static void btf_dump_emit_struct_def(struct btf_dump *d,* Keep `struct empty {}` on a single line, * only print newline when there are regular or padding fields. */ -if (vlen || t->size) +if (vlen || t->size) {btf_dump_printf (d,"\n" ); -btf_dump_printf (d,"%s}" ,pfx (lvl)); +btf_dump_printf (d,"%s}" ,pfx (lvl)); + }else { +btf_dump_printf (d,"}" ); + }if (packed)btf_dump_printf (d," __attribute__((packed))" ); }
Signature · 1 line
2.30.2
Andrii Nakryiko
maintainerPATCH 2/6 libbpf: handle non-standardly sized enums better in BTF-to-C dumper
In reply to Andrii NakryikoTurns out C allows to force enum to be 1-byte or 8-byte explicitly using mode(byte) or mode(word), respecticely. Linux sources are using this in some cases. This is imporant to handle correctly, as enum size determines corresponding fields in a struct that use that enum type. And if enum size is incorrect, this will lead to invalid struct layout. So add mode(byte) and mode(word) attribute support to btf_dump APIs.
--- tools/lib/bpf/btf_dump.c | 38 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+)
tools/lib/bpf/btf_dump.c +38 -0
@@ -13,6 +13,7 @@#include <ctype.h> #include <endian.h> #include <errno.h> +#include <limits.h> #include <linux/err.h> #include <linux/btf.h> #include <linux/kernel.h>
@@ -1076,6 +1077,43 @@ static void btf_dump_emit_enum_def(struct btf_dump *d, __u32 id,else btf_dump_emit_enum64_val (d, t, lvl, vlen);btf_dump_printf (d,"\n%s}" ,pfx (lvl)); + +/* special case enums with special sizes */ +if (t->size ==1 ) { +/* one-byte enums can be forced with mode(byte) attribute */ +btf_dump_printf (d," __attribute__((mode(byte)))" ); + }else if (t->size ==8 && d->ptr_sz ==8 ) { +/* enum can be 8-byte sized if one of the enumerator values +* doesn't fit in 32-bit integer, or by adding mode(word) +* attribute (but probably only on 64-bit architectures); do +* our best here to try to satisfy the contract without adding +* unnecessary attributes +*/ +bool needs_word_mode; + +if (btf_is_enum (t)) { +/* enum can't represent 64-bit values, so we need word mode */ + needs_word_mode = true; + }else { +/* enum64 needs mode(word) if none of its values has +* non-zero upper 32-bits (which means that all values +* fit in 32-bit integers and won't cause compiler to +* bump enum to be 64-bit naturally +*/ +int i; + + needs_word_mode = true; +for (i =0 ; i < vlen; i++) { +if (btf_enum64 (t)[i].val_hi32 !=0 ) { + needs_word_mode = false; +break ; + } + } + } +if (needs_word_mode) +btf_dump_printf (d," __attribute__((mode(word)))" ); + } + } static void btf_dump_emit_fwd_def(struct btf_dump *d, __u32 id,
Signature · 1 line
2.30.2
Andrii Nakryiko
maintainerPATCH 3/6 selftests/bpf: add non-standardly sized enum tests for btf_dump
In reply to Andrii NakryikoAdd few custom enum definitions testing mode(byte) and mode(word) attributes.
--- .../bpf/progs/btf_dump_test_case_syntax.c | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+)
tools/testing/selftests/bpf/progs/btf_dump_test_case_syntax.c +36 -0
@@ -25,6 +25,39 @@ typedef enum {H =2 , } e3_t; +/* ----- START-EXPECTED-OUTPUT ----- */ +/* +*enum e_byte { +* EBYTE_1 = 0, +* EBYTE_2 = 1, +*} __attribute__((mode(byte))); +* +*/ +/* ----- END-EXPECTED-OUTPUT ----- */ +enum e_byte { +EBYTE_1 , +EBYTE_2 , +} __attribute__((mode (byte))); + +/* ----- START-EXPECTED-OUTPUT ----- */ +/* +*enum e_word { +* EWORD_1 = 0LL, +* EWORD_2 = 1LL, +*} __attribute__((mode(word))); +* +*/ +/* ----- END-EXPECTED-OUTPUT ----- */ +enum e_word { +EWORD_1 , +EWORD_2 , +} __attribute__((mode (word)));/* force to use 8-byte backing for this enum */ + +/* ----- START-EXPECTED-OUTPUT ----- */ +enum e_big { +EBIG_1 =1000000000000ULL , +}; +typedef int int_t ;typedef volatile const int *volatile const crazy_ptr_t ;
@@ -224,6 +257,9 @@ struct root_struct {enum e2 _2;e2_t _2_1;e3_t _2_2; +enum e_byte _100; +enum e_word _101; +enum e_big _102;struct struct_w_typedefs _3;anon_struct_t _7;struct struct_fwd *_8;
Signature · 1 line
2.30.2
Eduard Zingerman
maintainerRe: [PATCH bpf-next 3/6] selftests/bpf: add non-standardly sized enum tests for btf_dump
Quoted 41 lines · Andrii Nakryiko
Add few custom enum definitions testing mode(byte) and mode(word) attributes.
Signed-off-by Andrii Nakryiko <[email protected]>--- .../bpf/progs/btf_dump_test_case_syntax.c | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+)tools/testing/selftests/bpf/progs/btf_dump_test_case_syntax.c +25
-0@@ -25,6 +25,39 @@ typedef enum {H =2 , } e3_t; +/* ----- START-EXPECTED-OUTPUT ----- */ +/* +*enum e_byte { +* EBYTE_1 = 0, +* EBYTE_2 = 1, +*} __attribute__((mode(byte))); +* +*/ +/* ----- END-EXPECTED-OUTPUT ----- */ +enum e_byte { +EBYTE_1 , +EBYTE_2 , +} __attribute__((mode (byte))); + +/* ----- START-EXPECTED-OUTPUT ----- */ +/* +*enum e_word { +* EWORD_1 = 0LL, +* EWORD_2 = 1LL, +*} __attribute__((mode(word))); +* +*/ +/* ----- END-EXPECTED-OUTPUT ----- */ +enum e_word { + EWORD_1,
tools/testing/selftests/bpf/progs/btf_dump_test_case_syntax.c typedef enum { · line 62
Quoted 10 lines
tools/testing/selftests/bpf/progs/btf_dump_test_case_syntax.c +8
-0+ EWORD_2, +} __attribute__((mode(word))); /* force to use 8-byte backing for this enum */ + +/* ----- START-EXPECTED-OUTPUT ----- */ +enum e_big { +EBIG_1 =1000000000000ULL , +}; +typedef int int_t ;
Something is off with this test, when executed on my little-endian machine the output looks as follows:
# ./test_progs -n 23/1 --- - 2022-12-09 17:22:03.412602033 +0000 +++ /tmp/btf_dump_test_case_syntax.output.Z28uhX 2022-12-09 17:22:03.403945082 +0000 @@ -23,13 +23,13 @@ } __attribute__((mode(byte)));
enum e_word {
- EWORD_1 = 0LL,
- EWORD_2 = 1LL,
+ EWORD_1 = 0,
+ EWORD_2 = 1,
} __attribute__((mode(word)));
enum e_big {
- EBIG_1 = 1000000000000ULL,
-};
+ EBIG_1 = 3567587328,
+} __attribute__((mode(word)));
But this is not related to your changes, here is a raw dump:
$ bpftool btf dump file ./btf_dump_test_case_syntax.bpf.o
[10] ENUM 'e_big' encoding=UNSIGNED size=8 vlen=1
'EBIG_1' val=3567587328
Quoted 11 lines
tools/testing/selftests/bpf/progs/btf_dump_test_case_syntax.c +3
-0typedef volatile const int *volatile const crazy_ptr_t ;@@ -224,6 +257,9 @@ struct root_struct {enum e2 _2;e2_t _2_1;e3_t _2_2; +enum e_byte _100; +enum e_word _101; +enum e_big _102;struct struct_w_typedefs _3;anon_struct_t _7;struct struct_fwd *_8;
Re: [PATCH bpf-next 3/6] selftests/bpf: add non-standardly sized enum tests for btf_dump
Quoted 66 lines · Eduard Zingerman
Quoted 41 lines · Andrii Nakryiko
Add few custom enum definitions testing mode(byte) and mode(word) attributes.
Signed-off-by Andrii Nakryiko <[email protected]>--- .../bpf/progs/btf_dump_test_case_syntax.c | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+)tools/testing/selftests/bpf/progs/btf_dump_test_case_syntax.c +25
-0@@ -25,6 +25,39 @@ typedef enum {H =2 , } e3_t; +/* ----- START-EXPECTED-OUTPUT ----- */ +/* +*enum e_byte { +* EBYTE_1 = 0, +* EBYTE_2 = 1, +*} __attribute__((mode(byte))); +* +*/ +/* ----- END-EXPECTED-OUTPUT ----- */ +enum e_byte { +EBYTE_1 , +EBYTE_2 , +} __attribute__((mode (byte))); + +/* ----- START-EXPECTED-OUTPUT ----- */ +/* +*enum e_word { +* EWORD_1 = 0LL, +* EWORD_2 = 1LL, +*} __attribute__((mode(word))); +* +*/ +/* ----- END-EXPECTED-OUTPUT ----- */ +enum e_word { + EWORD_1,tools/testing/selftests/bpf/progs/btf_dump_test_case_syntax.c typedef enum { · line 62
Quoted 10 lines
tools/testing/selftests/bpf/progs/btf_dump_test_case_syntax.c +8
-0+ EWORD_2, +} __attribute__((mode(word))); /* force to use 8-byte backing for this enum */ + +/* ----- START-EXPECTED-OUTPUT ----- */ +enum e_big { +EBIG_1 =1000000000000ULL , +}; +typedef int int_t ;Something is off with this test, when executed on my little-endian machine the output looks as follows:
# ./test_progs -n 23/1tmp/btf_dump_test_case_syntax.output.Z28uhX 2022-12-09 17:22:03.403945082 +0000 renamed from - 2022-12-09 17:22:03.412602033 +0000 +0
-2@@ -23,13 +23,13 @@ } __attribute__((mode(byte))); enum e_word { - EWORD_1 = 0LL, - EWORD_2 = 1LL,
tmp/btf_dump_test_case_syntax.output.Z28uhX 2022-12-09 17:22:03.403945082 +0000 line 33
Quoted 10 lines
tmp/btf_dump_test_case_syntax.output.Z28uhX 2022-12-09 17:22:03.403945082 +0000 renamed from - 2022-12-09 17:22:03.412602033 +0000 +4
-2+ EWORD_1 = 0, + EWORD_2 = 1, } __attribute__((mode(word))); enum e_big { - EBIG_1 = 1000000000000ULL, -}; + EBIG_1 = 3567587328, +} __attribute__((mode(word)));
You seem to have too old Clang which doesn't emit ENUM64 types, try upgrading?
Quoted 19 lines
But this is not related to your changes, here is a raw dump:
$ bpftool btf dump file ./btf_dump_test_case_syntax.bpf.o[10] ENUM '
e_big' encoding=UNSIGNED size=8 vlen=1'EBIG_1' val=3567587328Quoted 11 lines
tools/testing/selftests/bpf/progs/btf_dump_test_case_syntax.c +3
-0typedef volatile const int *volatile const crazy_ptr_t ;@@ -224,6 +257,9 @@ struct root_struct {enum e2 _2;e2_t _2_1;e3_t _2_2; +enum e_byte _100; +enum e_word _101; +enum e_big _102;struct struct_w_typedefs _3;anon_struct_t _7;struct struct_fwd *_8;
Eduard Zingerman
maintainerRe: [PATCH bpf-next 3/6] selftests/bpf: add non-standardly sized enum tests for btf_dump
Quoted 71 lines · Andrii Nakryiko
Quoted 70 lines · Eduard Zingerman
Quoted 41 lines · Andrii Nakryiko
Add few custom enum definitions testing mode(byte) and mode(word) attributes.
Signed-off-by Andrii Nakryiko <[email protected]>--- .../bpf/progs/btf_dump_test_case_syntax.c | 36 +++++++++++++++++++ 1 file changed, 36 insertions(+)tools/testing/selftests/bpf/progs/btf_dump_test_case_syntax.c +25
-0@@ -25,6 +25,39 @@ typedef enum {H =2 , } e3_t; +/* ----- START-EXPECTED-OUTPUT ----- */ +/* +*enum e_byte { +* EBYTE_1 = 0, +* EBYTE_2 = 1, +*} __attribute__((mode(byte))); +* +*/ +/* ----- END-EXPECTED-OUTPUT ----- */ +enum e_byte { +EBYTE_1 , +EBYTE_2 , +} __attribute__((mode (byte))); + +/* ----- START-EXPECTED-OUTPUT ----- */ +/* +*enum e_word { +* EWORD_1 = 0LL, +* EWORD_2 = 1LL, +*} __attribute__((mode(word))); +* +*/ +/* ----- END-EXPECTED-OUTPUT ----- */ +enum e_word { + EWORD_1,tools/testing/selftests/bpf/progs/btf_dump_test_case_syntax.c typedef enum { · line 62
Quoted 10 lines
tools/testing/selftests/bpf/progs/btf_dump_test_case_syntax.c +8
-0+ EWORD_2, +} __attribute__((mode(word))); /* force to use 8-byte backing for this enum */ + +/* ----- START-EXPECTED-OUTPUT ----- */ +enum e_big { +EBIG_1 =1000000000000ULL , +}; +typedef int int_t ;Something is off with this test, when executed on my little-endian machine the output looks as follows:
# ./test_progs -n 23/1tmp/btf_dump_test_case_syntax.output.Z28uhX 2022-12-09 17:22:03.403945082 +0000 renamed from - 2022-12-09 17:22:03.412602033 +0000 +2
-2@@ -23,13 +23,13 @@ } __attribute__((mode(byte))); enum e_word { - EWORD_1 = 0LL, - EWORD_2 = 1LL, + EWORD_1 = 0, + EWORD_2 = 1, } __attribute__((mode(word)));
Quoted 8 lines
tmp/btf_dump_test_case_syntax.output.Z28uhX 2022-12-09 17:22:03.403945082 +0000 line 33
Quoted 6 lines
tmp/btf_dump_test_case_syntax.output.Z28uhX 2022-12-09 17:22:03.403945082 +0000 renamed from - 2022-12-09 17:22:03.412602033 +0000 +2
-2enum e_big { - EBIG_1 = 1000000000000ULL, -}; + EBIG_1 = 3567587328, +} __attribute__((mode(word)));You seem to have too old Clang which doesn't emit ENUM64 types, try upgrading?
My apologies, you are correct.
Quoted 21 lines
Quoted 21 lines
But this is not related to your changes, here is a raw dump:
$ bpftool btf dump file ./btf_dump_test_case_syntax.bpf.o[10] ENUM '
e_big' encoding=UNSIGNED size=8 vlen=1'EBIG_1' val=3567587328Quoted 11 lines
tools/testing/selftests/bpf/progs/btf_dump_test_case_syntax.c +3
-0typedef volatile const int *volatile const crazy_ptr_t ;@@ -224,6 +257,9 @@ struct root_struct {enum e2 _2;e2_t _2_1;e3_t _2_2; +enum e_byte _100; +enum e_word _101; +enum e_big _102;struct struct_w_typedefs _3;anon_struct_t _7;struct struct_fwd *_8;
Andrii Nakryiko
maintainerPATCH 4/6 libbpf: fix btf__align_of() by taking into account field offsets
In reply to Andrii Nakryikobtf__align_of() is supposed to be return alignment requirement of a requested BTF type. For STRUCT/UNION it doesn't always return correct value, because it calculates alignment only based on field types. But for packed structs this is not enough, we need to also check field offsets and struct size. If field offset isn't aligned according to field type's natural alignment, then struct must be packed. Similarly, if struct size is not a multiple of struct's natural alignment, then struct must be packed as well.
This patch fixes this issue precisely by additionally checking these conditions.
--- tools/lib/bpf/btf.c | 13 +++++++++++++ 1 file changed, 13 insertions(+)
tools/lib/bpf/btf.c +13 -0
@@ -688,8 +688,21 @@ int btf__align_of(const struct btf *btf, __u32 id)if (align <=0 )return libbpf_err (align); max_align =max (max_align, align); + +/* if field offset isn't aligned according to field +* type's alignment, then struct must be packed +*/ +if (btf_member_bitfield_size (t, i) ==0 && + (m->offset % (8 * align)) !=0 ) +return 1 ; } +/* if struct/union size isn't a multiple of its alignment, +* then struct must be packed +*/ +if ((t->size % max_align) !=0 ) +return 1 ; +return max_align; }default :
Signature · 1 line
2.30.2
Andrii Nakryiko
maintainerPATCH 5/6 libbpf: fix BTF-to-C converter's padding logic
In reply to Andrii NakryikoTurns out that btf_dump API doesn't handle a bunch of tricky corner cases, as reported by Per, and further discovered using his testing Python script ([0]).
This patch revamps btf_dump's padding logic significantly, making it more correct and also avoiding unnecessary explicit padding, where compiler would pad naturally. This overall topic turned out to be very tricky and subtle, there are lots of subtle corner cases. The comments in the code tries to give some clues, but comments themselves are supposed to be paired with good understanding of C alignment and padding rules. Plus some experimentation to figure out subtle things like whether long :0; means that struct is now forced to be long-aligned (no, it's not, turns out).
Anyways, Per's script, while not completely correct in some known situations, doesn't show any obvious cases where this logic breaks, so this is a nice improvement over the previous state of this logic.
Some selftests had to be adjusted to accommodate better use of natural alignment rules, eliminating some unnecessary padding, or changing it to type: 0; alignment markers.
Note also that for when we are in between bitfields, we emit explicit bit size, while otherwise we use : 0, this feels much more natural in practice.
Next patch will add few more test cases, found through randomized Per's script.
[0] https://lore.kernel.org/bpf/[email protected]/
--- tools/lib/bpf/btf_dump.c | 169 +++++++++++++----- .../bpf/progs/btf_dump_test_case_bitfields.c | 2 +- .../bpf/progs/btf_dump_test_case_padding.c | 58 ++++-- 3 files changed, 164 insertions(+), 65 deletions(-)
tools/lib/bpf/btf_dump.c +123 -46
@@ -830,6 +830,25 @@ static void btf_dump_emit_type(struct btf_dump *d, __u32 id, __u32 cont_id) } } +static int btf_natural_align_of (const struct btf *btf,__u32 id) +{ +const struct btf_type *t =btf__type_by_id (btf, id); +int i, align, vlen; +const struct btf_member *m; + +if (!btf_is_composite (t)) +return btf__align_of (btf, id); + + align =1 ; + m =btf_members (t); + vlen =btf_vlen (t); +for (i =0 ; i < vlen; i++, m++) { + align =max (align,btf_natural_align_of (btf, m->type)); + } + +return align; +} +static bool btf_is_struct_packed (const struct btf *btf,__u32 id,const struct btf_type *t) {
@@ -837,16 +856,16 @@ static bool btf_is_struct_packed(const struct btf *btf, __u32 id,int align, i, bit_sz;__u16 vlen; - align =btf__align_of (btf, id); -/* size of a non-packed struct has to be a multiple of its alignment*/ -if (align && t->size % align) + align =btf_natural_align_of (btf, id); +/* size of a non-packed struct has to be a multiple of its alignment */ +if (align && (t->size % align) !=0 )return true; m =btf_members (t); vlen =btf_vlen (t);/* all non-bitfield fields have to be naturally aligned */ for (i =0 ; i < vlen; i++, m++) { - align =btf__align_of (btf, m->type); + align =btf_natural_align_of (btf, m->type); bit_sz =btf_member_bitfield_size (t, i);if (align && bit_sz ==0 && m->offset % (8 * align) !=0 )return true;
@@ -859,44 +878,97 @@ static bool btf_is_struct_packed(const struct btf *btf, __u32 id,return false; } -static int chip_away_bits (int total,int at_most) -{ -return total % at_most ? : at_most; -} -static void btf_dump_emit_bit_padding (const struct btf_dump *d, -int cur_off,int m_off,int m_bit_sz, -int align,int lvl) +int cur_off,int next_off,int next_align, +bool in_bitfield,int lvl) { -int off_diff = m_off - cur_off; -int ptr_bits = d->ptr_sz *8 ; +const struct { +const char *name; +int bits; + } pads[] = { + {"long" , d->ptr_sz *8 }, {"int" ,32 }, {"short" ,16 }, {"char" ,8 } + }; +int new_off, pad_bits, bits, i; +const char *pad_type; + +if (cur_off >= next_off) +return ;/* no gap */ + +/* For filling out padding we want to take advantage of +* natural alignment rules to minimize unnecessary explicit +* padding. First, we find the largest type (among long, int, +* short, or char) that can be used to force naturally aligned +* boundary. Once determined, we'll use such type to fill in +* the remaining padding gap. In some cases we can rely on +* compiler filling some gaps, but sometimes we need to force +* alignment to close natural alignment with markers like +* `long: 0` (this is always the case for bitfields). Note +* that even if struct itself has, let's say 4-byte alignment +* (i.e., it only uses up to int-aligned types), using `long: +* X;` explicit padding doesn't actually change struct's +* overall alignment requirements, but compiler does take into +* account that type's (long, in this example) natural +* alignment requirements when adding implicit padding. We use +* this fact heavily and don't worry about ruining correct +* struct alignment requirement. +*/ +for (i =0 ; i <ARRAY_SIZE (pads); i++) { + pad_bits = pads[i].bits; + pad_type = pads[i].name; -if (off_diff <=0 ) -/* no gap */ -return ; -if (m_bit_sz ==0 && off_diff < align *8 ) -/* natural padding will take care of a gap */ -return ; + new_off =roundup (cur_off, pad_bits); +if (new_off <= next_off) +break ; + } -while (off_diff >0 ) { -const char *pad_type; -int pad_bits; - -if (ptr_bits >32 && off_diff >32 ) { - pad_type ="long" ; - pad_bits =chip_away_bits (off_diff, ptr_bits); - }else if (off_diff >16 ) { - pad_type ="int" ; - pad_bits =chip_away_bits (off_diff,32 ); - }else if (off_diff >8 ) { - pad_type ="short" ; - pad_bits =chip_away_bits (off_diff,16 ); - }else { - pad_type ="char" ; - pad_bits =chip_away_bits (off_diff,8 ); +if (new_off > cur_off && new_off <= next_off) { +/* We need explicit `<type>: 0` aligning mark if next +* field is right on alignment offset and its +* alignment requirement is less strict than <type>'s +* alignment (so compiler won't naturally align to the +* offset we expect), or if subsequent `<type>: X`, +* will actually completely fit in the remaining hole, +* making compiler basically ignore `<type>: X` +* completely. +*/ +if (in_bitfield || + (new_off == next_off &&roundup (cur_off, next_align *8 ) != new_off) || + (new_off != next_off && next_off - new_off <= new_off - cur_off)) +/* but for bitfields we'll emit explicit bit count */ +btf_dump_printf (d,"\n%s%s: %d;" ,pfx (lvl), pad_type, + in_bitfield ? new_off - cur_off :0 ); + cur_off = new_off; + } + +/* Now we know we start at naturally aligned offset for a chosen +* padding type (long, int, short, or char), and so the rest is just +* a straightforward filling of remaining padding gap with full +* `<type>: sizeof(<type>);` markers, except for the last one, which +* might need smaller than sizeof(<type>) padding. +*/ +while (cur_off != next_off) { + bits =min (next_off - cur_off, pad_bits); +if (bits == pad_bits) { +btf_dump_printf (d,"\n%s%s: %d;" ,pfx (lvl), pad_type, pad_bits); + cur_off += bits; +continue ; + } +/* For the remainder padding that doesn't cover entire +* pad_type bit length, we pick the smallest necessary type. +* This is pure aesthetics, we could have just used `long`, +* but having smallest necessary one communicates better the +* scale of the padding gap. +*/ +for (i =ARRAY_SIZE (pads) -1 ; i >=0 ; i--) { + pad_type = pads[i].name; + pad_bits = pads[i].bits; +if (pad_bits < bits) +continue ; + +btf_dump_printf (d,"\n%s%s: %d;" ,pfx (lvl), pad_type, bits); + cur_off += bits; +break ; } -btf_dump_printf (d,"\n%s%s: %d;" ,pfx (lvl), pad_type, pad_bits); - off_diff -= pad_bits; } }
@@ -916,9 +988,11 @@ static void btf_dump_emit_struct_def(struct btf_dump *d, {const struct btf_member *m =btf_members (t);bool is_struct =btf_is_struct (t); -int align, i, packed, off =0 ; +bool packed, prev_bitfield = false; +int align, i, off =0 ;__u16 vlen =btf_vlen (t); + align =btf__align_of (d->btf, id); packed = is_struct ?btf_is_struct_packed (d->btf, id, t) :0 ; btf_dump_printf(d, "%s%s%s {",
@@ -928,33 +1002,36 @@ static void btf_dump_emit_struct_def(struct btf_dump *d,for (i =0 ; i < vlen; i++, m++) {const char *fname; -int m_off, m_sz; +int m_off, m_sz, m_align; +bool in_bitfield; fname =btf_name_of (d, m->name_off); m_sz =btf_member_bitfield_size (t, i); m_off =btf_member_bit_offset (t, i); - align = packed ?1 :btf__align_of (d->btf, m->type); + m_align = packed ?1 :btf__align_of (d->btf, m->type); + + in_bitfield = prev_bitfield && m_sz !=0 ; -btf_dump_emit_bit_padding (d, off, m_off, m_sz, align, lvl +1 ); +btf_dump_emit_bit_padding (d, off, m_off, m_align, in_bitfield, lvl +1 );btf_dump_printf (d,"\n%s" ,pfx (lvl +1 ));btf_dump_emit_type_decl (d, m->type, fname, lvl +1 );if (m_sz) {btf_dump_printf (d,": %d" , m_sz); off = m_off + m_sz; + prev_bitfield = true; }else { m_sz =max ((__s64 )0 ,btf__resolve_size (d->btf, m->type)); off = m_off + m_sz *8 ; + prev_bitfield = false; } +btf_dump_printf (d,";" ); }/* pad at the end, if necessary */ -if (is_struct) { - align = packed ?1 :btf__align_of (d->btf, id); -btf_dump_emit_bit_padding (d, off, t->size *8 ,0 , align, - lvl +1 ); - } +if (is_struct) +btf_dump_emit_bit_padding (d, off, t->size *8 , align, false, lvl +1 );/* * Keep `struct empty {}` on a single line,
tools/testing/selftests/bpf/progs/btf_dump_test_case_bitfields.c +1 -1
@@ -53,7 +53,7 @@ struct bitfields_only_mixed_types {*/ /* ------ END-EXPECTED-OUTPUT ------ */ struct bitfield_mixed_with_others { - long: 4; /* char is enough as a backing field */ + char: 4; /* char is enough as a backing field */int a:4 ;/* 8-bit implicit padding */ short b;/* combined with previous bitfield */
tools/testing/selftests/bpf/progs/btf_dump_test_case_padding.c +40 -18
107 lines not on this page · raw message
Signature · 1 line
2.30.2
Eduard Zingerman
maintainerRe: [PATCH bpf-next 5/6] libbpf: fix BTF-to-C converter's padding logic
Quoted 56 lines · Andrii Nakryiko
Turns out that
btf_dumpAPI doesn't handle a bunch of tricky corner cases, as reported by Per, and further discovered using his testing Python script ([0]).This patch revamps btf_dump's padding logic significantly, making it more correct and also avoiding unnecessary explicit padding, where compiler would pad naturally. This overall topic turned out to be very tricky and subtle, there are lots of subtle corner cases. The comments in the code tries to give some clues, but comments themselves are supposed to be paired with good understanding of C alignment and padding rules. Plus some experimentation to figure out subtle things like whether
long :0;means that struct is now forced to be long-aligned (no, it's not, turns out).Anyways, Per's script, while not completely correct in some known situations, doesn't show any obvious cases where this logic breaks, so this is a nice improvement over the previous state of this logic.
Some selftests had to be adjusted to accommodate better use of natural alignment rules, eliminating some unnecessary padding, or changing it to
type: 0;alignment markers.Note also that for when we are in between bitfields, we emit explicit bit size, while otherwise we use
: 0, this feels much more natural in practice.Next patch will add few more test cases, found through randomized Per's script.
[0] https://lore.kernel.org/bpf/[email protected]/
Reported-by Per Sundström XP <[email protected]>Signed-off-by Andrii Nakryiko <[email protected]>--- tools/lib/bpf/btf_dump.c | 169 +++++++++++++----- .../bpf/progs/btf_dump_test_case_bitfields.c | 2 +- .../bpf/progs/btf_dump_test_case_padding.c | 58 ++++-- 3 files changed, 164 insertions(+), 65 deletions(-)tools/lib/bpf/btf_dump.c +9
-0@@ -830,6 +830,25 @@ static void btf_dump_emit_type(struct btf_dump *d, __u32 id, __u32 cont_id) } } +static int btf_natural_align_of (const struct btf *btf,__u32 id) +{ +const struct btf_type *t =btf__type_by_id (btf, id); +int i, align, vlen; +const struct btf_member *m; + +if (!btf_is_composite (t)) +return btf__align_of (btf, id); +
tools/lib/bpf/btf_dump.c static void btf_dump_emit_type(struct btf_dump *d, __u32 id, __u32 cont_id) · line 851
Quoted 10 lines
tools/lib/bpf/btf_dump.c +10
-0+ align =1 ; + m =btf_members (t); + vlen =btf_vlen (t); +for (i =0 ; i < vlen; i++, m++) { + align =max (align,btf_natural_align_of (btf, m->type)); + } + +return align; +} +
The btf_natural_align_of() recursively visits nested structures. However, the "packed" relation is non-recursive (see entry for "packed" in [1]). Such mismatch leads to the following example being printed incorrectly:
struct a {
int x;
};
struct b {
struct a a;
char c;
} __attribute__((packed));
struct c {
struct b b1;
short a1;
struct b b2;
};The bpftool output looks as follows:
struct a {
int x;
};
struct b {
struct a a;
char c;
} __attribute__((packed));
struct c {
struct b b1;
short: 0;
short a1;
struct b b2;
} __attribute__((packed));While offsets are correct the resulting structure size is wrong, as could be seen using the following program:
#include <stddef.h>
#include <stdio.h>
struct a {
int x;
};
struct b {
struct a a;
char c;
} __attribute__((packed));
struct c {
struct b b1;
short a1;
struct b b2;
};
struct c1 {
struct b b1;
short: 0;
short a1;
struct b b2;
} __attribute__((packed));
int main() {
printf("sizeof(struct c): %ld\n", sizeof(struct c));
printf("a1 offset: %ld\n", offsetof(struct c, a1));
printf("b2 offset: %ld\n", offsetof(struct c, b2));
printf("sizeof(struct c1): %ld\n", sizeof(struct c1));
printf("a1 offset: %ld\n", offsetof(struct c1, a1));
printf("b2 offset: %ld\n", offsetof(struct c1, b2));
return 0;
}The output is:
$ gcc -Wall test.c $ ./a.out sizeof(struct c): 14 a1 offset: 6 b2 offset: 8 sizeof(struct c1): 13 a1 offset: 6 b2 offset: 8
Also the following comment in [2] is interesting:
tools/lib/bpf/btf_dump.c static void btf_dump_emit_type(struct btf_dump *d, __u32 id, __u32 cont_id) · line 854
Quoted 3 lines
tools/lib/bpf/btf_dump.c +0
-0If the member is a structure, then the structure has an alignment of 1-byte, but the members of that structure continue to have their natural alignment.
Which leads to unaligned access in the following case:
int foo(struct a *p) { return p->x; }
int main() {
struct b b[2] = {{ {1}, 2 }, { {3}, 4 }};
printf("%i, %i\n", foo(&b[0].a), foo(&b[1].a));
}
$ gcc -Wall test.c
test.c: In function ‘main’:
test.c:38:26: warning: taking address of packed member of ‘struct b’ may result
in an unaligned pointer value [-Waddress-of-packed-member]
38 | printf("%i, %i\n", foo(&b[0].a), foo(&b[1].a));(This works fine on my x86 machine, but would be an issue on arm as
far as I understand).
[1] https://gcc.gnu.org/onlinedocs/gcc-12.2.0/gcc/Common-Type-Attributes.html#Common-Type-Attributes
[2] https://developer.arm.com/documentation/100748/0607/writing-optimized-code/packing-data-structures
Quoted 342 lines
static bool btf_is_struct_packed(const struct btf *btf,
__u32id,tools/lib/bpf/btf_dump.c +104
-46const struct btf_type *t) {@@ -837,16 +856,16 @@ static bool btf_is_struct_packed(const struct btf *btf, __u32 id,int align, i, bit_sz;__u16 vlen; - align =btf__align_of (btf, id); -/* size of a non-packed struct has to be a multiple of its alignment*/ -if (align && t->size % align) + align =btf_natural_align_of (btf, id); +/* size of a non-packed struct has to be a multiple of its alignment */ +if (align && (t->size % align) !=0 )return true; m =btf_members (t); vlen =btf_vlen (t);/* all non-bitfield fields have to be naturally aligned */ for (i =0 ; i < vlen; i++, m++) { - align =btf__align_of (btf, m->type); + align =btf_natural_align_of (btf, m->type); bit_sz =btf_member_bitfield_size (t, i);if (align && bit_sz ==0 && m->offset % (8 * align) !=0 )return true;@@ -859,44 +878,97 @@ static bool btf_is_struct_packed(const struct btf *btf, __u32 id,return false; } -static int chip_away_bits (int total,int at_most) -{ -return total % at_most ? : at_most; -} -static void btf_dump_emit_bit_padding (const struct btf_dump *d, -int cur_off,int m_off,int m_bit_sz, -int align,int lvl) +int cur_off,int next_off,int next_align, +bool in_bitfield,int lvl) { -int off_diff = m_off - cur_off; -int ptr_bits = d->ptr_sz *8 ; +const struct { +const char *name; +int bits; + } pads[] = { + {"long" , d->ptr_sz *8 }, {"int" ,32 }, {"short" ,16 }, {"char" ,8 } + }; +int new_off, pad_bits, bits, i; +const char *pad_type; + +if (cur_off >= next_off) +return ;/* no gap */ + +/* For filling out padding we want to take advantage of +* natural alignment rules to minimize unnecessary explicit +* padding. First, we find the largest type (among long, int, +* short, or char) that can be used to force naturally aligned +* boundary. Once determined, we'll use such type to fill in +* the remaining padding gap. In some cases we can rely on +* compiler filling some gaps, but sometimes we need to force +* alignment to close natural alignment with markers like +* `long: 0` (this is always the case for bitfields). Note +* that even if struct itself has, let's say 4-byte alignment +* (i.e., it only uses up to int-aligned types), using `long: +* X;` explicit padding doesn't actually change struct's +* overall alignment requirements, but compiler does take into +* account that type's (long, in this example) natural +* alignment requirements when adding implicit padding. We use +* this fact heavily and don't worry about ruining correct +* struct alignment requirement. +*/ +for (i =0 ; i <ARRAY_SIZE (pads); i++) { + pad_bits = pads[i].bits; + pad_type = pads[i].name; -if (off_diff <=0 ) -/* no gap */ -return ; -if (m_bit_sz ==0 && off_diff < align *8 ) -/* natural padding will take care of a gap */ -return ; + new_off =roundup (cur_off, pad_bits); +if (new_off <= next_off) +break ; + } -while (off_diff >0 ) { -const char *pad_type; -int pad_bits; - -if (ptr_bits >32 && off_diff >32 ) { - pad_type ="long" ; - pad_bits =chip_away_bits (off_diff, ptr_bits); - }else if (off_diff >16 ) { - pad_type ="int" ; - pad_bits =chip_away_bits (off_diff,32 ); - }else if (off_diff >8 ) { - pad_type ="short" ; - pad_bits =chip_away_bits (off_diff,16 ); - }else { - pad_type ="char" ; - pad_bits =chip_away_bits (off_diff,8 ); +if (new_off > cur_off && new_off <= next_off) { +/* We need explicit `<type>: 0` aligning mark if next +* field is right on alignment offset and its +* alignment requirement is less strict than <type>'s +* alignment (so compiler won't naturally align to the +* offset we expect), or if subsequent `<type>: X`, +* will actually completely fit in the remaining hole, +* making compiler basically ignore `<type>: X` +* completely. +*/ +if (in_bitfield || + (new_off == next_off &&roundup (cur_off, next_align *8 ) != new_off) || + (new_off != next_off && next_off - new_off <= new_off - cur_off)) +/* but for bitfields we'll emit explicit bit count */ +btf_dump_printf (d,"\n%s%s: %d;" ,pfx (lvl), pad_type, + in_bitfield ? new_off - cur_off :0 ); + cur_off = new_off; + } + +/* Now we know we start at naturally aligned offset for a chosen +* padding type (long, int, short, or char), and so the rest is just +* a straightforward filling of remaining padding gap with full +* `<type>: sizeof(<type>);` markers, except for the last one, which +* might need smaller than sizeof(<type>) padding. +*/ +while (cur_off != next_off) { + bits =min (next_off - cur_off, pad_bits); +if (bits == pad_bits) { +btf_dump_printf (d,"\n%s%s: %d;" ,pfx (lvl), pad_type, pad_bits); + cur_off += bits; +continue ; + } +/* For the remainder padding that doesn't cover entire +* pad_type bit length, we pick the smallest necessary type. +* This is pure aesthetics, we could have just used `long`, +* but having smallest necessary one communicates better the +* scale of the padding gap. +*/ +for (i =ARRAY_SIZE (pads) -1 ; i >=0 ; i--) { + pad_type = pads[i].name; + pad_bits = pads[i].bits; +if (pad_bits < bits) +continue ; + +btf_dump_printf (d,"\n%s%s: %d;" ,pfx (lvl), pad_type, bits); + cur_off += bits; +break ; } -btf_dump_printf (d,"\n%s%s: %d;" ,pfx (lvl), pad_type, pad_bits); - off_diff -= pad_bits; } }@@ -916,9 +988,11 @@ static void btf_dump_emit_struct_def(struct btf_dump *d, {const struct btf_member *m =btf_members (t);bool is_struct =btf_is_struct (t); -int align, i, packed, off =0 ; +bool packed, prev_bitfield = false; +int align, i, off =0 ;__u16 vlen =btf_vlen (t); + align =btf__align_of (d->btf, id); packed = is_struct ?btf_is_struct_packed (d->btf, id, t) :0 ; btf_dump_printf(d, "%s%s%s {",@@ -928,33 +1002,36 @@ static void btf_dump_emit_struct_def(struct btf_dump *d,for (i =0 ; i < vlen; i++, m++) {const char *fname; -int m_off, m_sz; +int m_off, m_sz, m_align; +bool in_bitfield; fname =btf_name_of (d, m->name_off); m_sz =btf_member_bitfield_size (t, i); m_off =btf_member_bit_offset (t, i); - align = packed ?1 :btf__align_of (d->btf, m->type); + m_align = packed ?1 :btf__align_of (d->btf, m->type); + + in_bitfield = prev_bitfield && m_sz !=0 ; -btf_dump_emit_bit_padding (d, off, m_off, m_sz, align, lvl +1 ); +btf_dump_emit_bit_padding (d, off, m_off, m_align, in_bitfield, lvl +1 );btf_dump_printf (d,"\n%s" ,pfx (lvl +1 ));btf_dump_emit_type_decl (d, m->type, fname, lvl +1 );if (m_sz) {btf_dump_printf (d,": %d" , m_sz); off = m_off + m_sz; + prev_bitfield = true; }else { m_sz =max ((__s64 )0 ,btf__resolve_size (d->btf, m->type)); off = m_off + m_sz *8 ; + prev_bitfield = false; } +btf_dump_printf (d,";" ); }/* pad at the end, if necessary */ -if (is_struct) { - align = packed ?1 :btf__align_of (d->btf, id); -btf_dump_emit_bit_padding (d, off, t->size *8 ,0 , align, - lvl +1 ); - } +if (is_struct) +btf_dump_emit_bit_padding (d, off, t->size *8 , align, false, lvl +1 );/* * Keep `struct empty {}` on a single line, tools/testing/selftests/bpf/progs/btf_dump_test_case_bitfields.c +1
-1@@ -53,7 +53,7 @@ struct bitfields_only_mixed_types {*/ /* ------ END-EXPECTED-OUTPUT ------ */ struct bitfield_mixed_with_others { - long: 4; /* char is enough as a backing field */ + char: 4; /* char is enough as a backing field */int a:4 ;/* 8-bit implicit padding */ short b;/* combined with previous bitfield */ tools/testing/selftests/bpf/progs/btf_dump_test_case_padding.c +40
-18@@ -19,7 +19,7 @@ struct padded_implicitly {/* *struct padded_explicitly { * int a; -* int: 32; +* long: 0; * int b; *}; * @@ -28,41 +28,28 @@ struct padded_implicitly {struct padded_explicitly {int a; - int: 1; /* algo will explicitly pad with full 32 bits here */ + int: 1; /* algo will emit aligning `long: 0;` here */int b; };/* ----- START-EXPECTED-OUTPUT ----- */ -/* -*struct padded_a_lot { -* int a; -* long: 32; -* long: 64; -* long: 64; -* int b; -*}; -* -*/ -/* ------ END-EXPECTED-OUTPUT ------ */ -struct padded_a_lot {int a; -/* 32 bit of implicit padding here, which algo will make explicit */ long: 64; long: 64;int b; }; +/* ------ END-EXPECTED-OUTPUT ------ */ +/* ----- START-EXPECTED-OUTPUT ----- */ /* *struct padded_cache_line { * int a; -* long: 32; * long: 64; * long: 64; * long: 64; * int b; -* long: 32; * long: 64; * long: 64; * long: 64; @@ -85,7 +72,7 @@ struct padded_cache_line { *struct zone { * int a; * short b; - * short: 16; + * long: 0; * struct zone_padding __pad__; *}; *@@ -108,6 +95,39 @@ struct padding_wo_named_members { long: 64; }; +struct padding_weird_1 { +int a; + long: 64; + short: 16; +short b; +}; + +/* ------ END-EXPECTED-OUTPUT ------ */ + +/* ----- START-EXPECTED-OUTPUT ----- */ +/* +*struct padding_weird_2 { +* long: 56; +* char a; +* long: 56; +* char b; +* char: 8; +*}; +* +*/ +/* ------ END-EXPECTED-OUTPUT ------ */ +struct padding_weird_2 { + int: 32; /* these paddings will be collapsed into `long: 56;` */ + short: 16; + char: 8; +char a; + int: 32; /* these paddings will be collapsed into `long: 56;` */ + short: 16; + char: 8; +char b; + char: 8; +}; +/* ------ END-EXPECTED-OUTPUT ------ */ int f(struct {@@ -117,6 +137,8 @@ int f(struct {struct padded_cache_line _4;struct zone _5;struct padding_wo_named_members _6; +struct padding_weird_1 _7; +struct padding_weird_2 _8; } *_) {return 0 ;
Re: [PATCH bpf-next 5/6] libbpf: fix BTF-to-C converter's padding logic
Quoted 91 lines · Eduard Zingerman
Quoted 56 lines · Andrii Nakryiko
Turns out that
btf_dumpAPI doesn't handle a bunch of tricky corner cases, as reported by Per, and further discovered using his testing Python script ([0]).This patch revamps btf_dump's padding logic significantly, making it more correct and also avoiding unnecessary explicit padding, where compiler would pad naturally. This overall topic turned out to be very tricky and subtle, there are lots of subtle corner cases. The comments in the code tries to give some clues, but comments themselves are supposed to be paired with good understanding of C alignment and padding rules. Plus some experimentation to figure out subtle things like whether
long :0;means that struct is now forced to be long-aligned (no, it's not, turns out).Anyways, Per's script, while not completely correct in some known situations, doesn't show any obvious cases where this logic breaks, so this is a nice improvement over the previous state of this logic.
Some selftests had to be adjusted to accommodate better use of natural alignment rules, eliminating some unnecessary padding, or changing it to
type: 0;alignment markers.Note also that for when we are in between bitfields, we emit explicit bit size, while otherwise we use
: 0, this feels much more natural in practice.Next patch will add few more test cases, found through randomized Per's script.
[0] https://lore.kernel.org/bpf/[email protected]/
Reported-by Per Sundström XP <[email protected]>Signed-off-by Andrii Nakryiko <[email protected]>--- tools/lib/bpf/btf_dump.c | 169 +++++++++++++----- .../bpf/progs/btf_dump_test_case_bitfields.c | 2 +- .../bpf/progs/btf_dump_test_case_padding.c | 58 ++++-- 3 files changed, 164 insertions(+), 65 deletions(-)tools/lib/bpf/btf_dump.c +9
-0@@ -830,6 +830,25 @@ static void btf_dump_emit_type(struct btf_dump *d, __u32 id, __u32 cont_id) } } +static int btf_natural_align_of (const struct btf *btf,__u32 id) +{ +const struct btf_type *t =btf__type_by_id (btf, id); +int i, align, vlen; +const struct btf_member *m; + +if (!btf_is_composite (t)) +return btf__align_of (btf, id); +tools/lib/bpf/btf_dump.c static void btf_dump_emit_type(struct btf_dump *d, __u32 id, __u32 cont_id) · line 851
Quoted 10 lines
tools/lib/bpf/btf_dump.c +10
-0+ align =1 ; + m =btf_members (t); + vlen =btf_vlen (t); +for (i =0 ; i < vlen; i++, m++) { + align =max (align,btf_natural_align_of (btf, m->type)); + } + +return align; +} +The
btf_natural_align_of()recursively visits nested structures. However, the "packed" relation is non-recursive (see entry for "packed" in [1]). Such mismatch leads to the following example being printed incorrectly:struct a { int x; }; struct b { struct a a; char c; } __attribute__((packed)); struct c { struct b b1; short a1; struct b b2; };The bpftool output looks as follows:
Quoted 15 lines
struct a {
int x;
};
struct b {
struct a a;
char c;
} __attribute__((packed));
struct c {
struct b b1;
short: 0;
short a1;
struct b b2;
} __attribute__((packed));Nice find, thank you! The fix is very simple:
tools/lib/bpf/btf_dump.c +0 -0
@@ -843,7 +843,7 @@ static int btf_natural_align_of(const struct btf
*btf, __u32 id)
m = btf_members(t);
vlen = btf_vlen(t);
for (i = 0; i < vlen; i++, m++) {
- align = max(align, btf_natural_align_of(btf, m->type));
+ align = max(align, btf__align_of(btf, m->type));
}I'll also add your example to selftests to make sure.
[...]
Quoted 7 lines
Also the following comment in [2] is interesting:
Quoted 3 lines
tools/lib/bpf/btf_dump.c +0
-0If the member is a structure, then the structure has an alignment of 1-byte, but the members of that structure continue to have their natural alignment.
If I read it correctly, it just means that within that nested struct all the members are aligned naturally (unless nested struct itself is packed), which makes sense and is already handled correctly. Or did I miss some subtle point you are making?
Quoted 21 lines
Which leads to unaligned access in the following case:
int foo(struct a *p) { return p->x; } int main() { struct b b[2] = {{ {1}, 2 }, { {3}, 4 }}; printf("%i, %i\n", foo(&b[0].a), foo(&b[1].a)); } $ gcc -Wall test.c test.c: In function ‘main’: test.c:38:26: warning: taking address of packed member of ‘struct b’ may result in an unaligned pointer value [-Waddress-of-packed-member] 38 | printf("%i, %i\n", foo(&b[0].a), foo(&b[1].a));(This works fine on my x86 machine, but would be an issue on arm as
far as I understand).[1] https://gcc.gnu.org/onlinedocs/gcc-12.2.0/gcc/Common-Type-Attributes.html#Common-Type-Attributes
[2] https://developer.arm.com/documentation/100748/0607/writing-optimized-code/packing-data-structures
[...]
Eduard Zingerman
maintainerRe: [PATCH bpf-next 5/6] libbpf: fix BTF-to-C converter's padding logic
Quoted 135 lines · Andrii Nakryiko
Quoted 91 lines · Eduard Zingerman
Quoted 56 lines · Andrii Nakryiko
Turns out that
btf_dumpAPI doesn't handle a bunch of tricky corner cases, as reported by Per, and further discovered using his testing Python script ([0]).This patch revamps btf_dump's padding logic significantly, making it more correct and also avoiding unnecessary explicit padding, where compiler would pad naturally. This overall topic turned out to be very tricky and subtle, there are lots of subtle corner cases. The comments in the code tries to give some clues, but comments themselves are supposed to be paired with good understanding of C alignment and padding rules. Plus some experimentation to figure out subtle things like whether
long :0;means that struct is now forced to be long-aligned (no, it's not, turns out).Anyways, Per's script, while not completely correct in some known situations, doesn't show any obvious cases where this logic breaks, so this is a nice improvement over the previous state of this logic.
Some selftests had to be adjusted to accommodate better use of natural alignment rules, eliminating some unnecessary padding, or changing it to
type: 0;alignment markers.Note also that for when we are in between bitfields, we emit explicit bit size, while otherwise we use
: 0, this feels much more natural in practice.Next patch will add few more test cases, found through randomized Per's script.
[0] https://lore.kernel.org/bpf/[email protected]/
Reported-by Per Sundström XP <[email protected]>Signed-off-by Andrii Nakryiko <[email protected]>--- tools/lib/bpf/btf_dump.c | 169 +++++++++++++----- .../bpf/progs/btf_dump_test_case_bitfields.c | 2 +- .../bpf/progs/btf_dump_test_case_padding.c | 58 ++++-- 3 files changed, 164 insertions(+), 65 deletions(-)tools/lib/bpf/btf_dump.c +9
-0@@ -830,6 +830,25 @@ static void btf_dump_emit_type(struct btf_dump *d, __u32 id, __u32 cont_id) } } +static int btf_natural_align_of (const struct btf *btf,__u32 id) +{ +const struct btf_type *t =btf__type_by_id (btf, id); +int i, align, vlen; +const struct btf_member *m; + +if (!btf_is_composite (t)) +return btf__align_of (btf, id); +tools/lib/bpf/btf_dump.c static void btf_dump_emit_type(struct btf_dump *d, __u32 id, __u32 cont_id) · line 851
Quoted 10 lines
tools/lib/bpf/btf_dump.c +10
-0+ align =1 ; + m =btf_members (t); + vlen =btf_vlen (t); +for (i =0 ; i < vlen; i++, m++) { + align =max (align,btf_natural_align_of (btf, m->type)); + } + +return align; +} +The
btf_natural_align_of()recursively visits nested structures. However, the "packed" relation is non-recursive (see entry for "packed" in [1]). Such mismatch leads to the following example being printed incorrectly:struct a { int x; }; struct b { struct a a; char c; } __attribute__((packed)); struct c { struct b b1; short a1; struct b b2; };The bpftool output looks as follows:
Quoted 15 lines
struct a { int x; }; struct b { struct a a; char c; } __attribute__((packed)); struct c { struct b b1; short: 0; short a1; struct b b2; } __attribute__((packed));Nice find, thank you! The fix is very simple:
tools/lib/bpf/btf_dump.c +1
-1@@ -843,7 +843,7 @@ static int btf_natural_align_of(const struct btf *btf, __u32 id) m =btf_members (t); vlen =btf_vlen (t);for (i =0 ; i < vlen; i++, m++) { - align =max (align,btf_natural_align_of (btf, m->type)); + align =max (align,btf__align_of (btf, m->type)); }I'll also add your example to selftests to make sure.
[...]
Quoted 7 lines
Also the following comment in [2] is interesting:
Quoted 3 lines
tools/lib/bpf/btf_dump.c +0
-0If the member is a structure, then the structure has an alignment of 1-byte, but the members of that structure continue to have their natural alignment.
Quoted 4 lines
If I read it correctly, it just means that within that nested struct all the members are aligned naturally (unless nested struct itself is packed), which makes sense and is already handled correctly. Or did I miss some subtle point you are making?
No additional subtle points.
It's a consequence of the non-recursiveness of "packed" and I wanted to find a direct confirmation of such behaviour in the doc as it seemed odd.
Quoted 24 lines
Quoted 22 lines
Which leads to unaligned access in the following case:
int foo(struct a *p) { return p->x; } int main() { struct b b[2] = {{ {1}, 2 }, { {3}, 4 }}; printf("%i, %i\n", foo(&b[0].a), foo(&b[1].a)); } $ gcc -Wall test.c test.c: In function ‘main’: test.c:38:26: warning: taking address of packed member of ‘struct b’ may result in an unaligned pointer value [-Waddress-of-packed-member] 38 | printf("%i, %i\n", foo(&b[0].a), foo(&b[1].a));(This works fine on my x86 machine, but would be an issue on arm as
far as I understand).[1] https://gcc.gnu.org/onlinedocs/gcc-12.2.0/gcc/Common-Type-Attributes.html#Common-Type-Attributes
[2] https://developer.arm.com/documentation/100748/0607/writing-optimized-code/packing-data-structures[...]
Andrii Nakryiko
maintainerPATCH 6/6 selftests/bpf: add few corner cases to test padding handling of btf_dump
In reply to Andrii NakryikoAdd few hand-crafted cases and few randomized cases found using script from [0] that tests btf_dump's padding logic.
[0] https://lore.kernel.org/bpf/[email protected]/
--- .../bpf/progs/btf_dump_test_case_packing.c | 61 ++++++++++++- .../bpf/progs/btf_dump_test_case_padding.c | 88 +++++++++++++++++++ 2 files changed, 148 insertions(+), 1 deletion(-)
tools/testing/selftests/bpf/progs/btf_dump_test_case_packing.c +60 -1
@@ -58,7 +58,64 @@ union jump_code_union { } __attribute__((packed)); }; -/*------ END-EXPECTED-OUTPUT ------ */ +/* ----- START-EXPECTED-OUTPUT ----- */ +/* +*struct nested_packed_but_aligned_struct { +* int x1; +* int x2; +*}; +* +*struct outer_implicitly_packed_struct { +* char y1; +* struct nested_packed_but_aligned_struct y2; +*} __attribute__((packed)); +* +*/ +/* ------ END-EXPECTED-OUTPUT ------ */ + +struct nested_packed_but_aligned_struct { +int x1; +int x2; +} __attribute__((packed)); + +struct outer_implicitly_packed_struct { +char y1; +struct nested_packed_but_aligned_struct y2; +}; +/* ----- START-EXPECTED-OUTPUT ----- */ +/* +*struct usb_ss_ep_comp_descriptor { +* char: 8; +* char bDescriptorType; +* char bMaxBurst; +* short wBytesPerInterval; +*}; +* +*struct usb_host_endpoint { +* long: 64; +* char: 8; +* struct usb_ss_ep_comp_descriptor ss_ep_comp; +* long: 0; +*} __attribute__((packed)); +* +*/ +/* ------ END-EXPECTED-OUTPUT ------ */ + +struct usb_ss_ep_comp_descriptor { + char: 8; +char bDescriptorType; +char bMaxBurst; + int: 0; +short wBytesPerInterval; +} __attribute__((packed)); + +struct usb_host_endpoint { + long: 64; + char: 8; +struct usb_ss_ep_comp_descriptor ss_ep_comp; + long: 0; +}; + int f(struct { struct packed_trailing_space _1;
@@ -69,6 +126,8 @@ int f(struct {union union_is_never_packed _6;union union_does_not_need_packing _7;union jump_code_union _8; +struct outer_implicitly_packed_struct _9; +struct usb_host_endpoint _10; } *_) {return 0 ;
tools/testing/selftests/bpf/progs/btf_dump_test_case_padding.c +88 -0
100 lines not on this page · raw message
Signature · 1 line
2.30.2