|
GCC Middle and Back End API Reference
|
Data Fields | |
| size_t | mult |
| unsigned int | shift |
The Ith entry is a pair of numbers (mult, shift) such that ((k * mult) >> shift) mod 2^32 == (k / OBJECT_SIZE(I)) mod 2^32, for all k evenly divisible by OBJECT_SIZE(I).
| size_t [struct].inverse_table mult |
| unsigned int [struct].inverse_table shift |