结构体内存对齐问题（Structure memory alignment problem）.doc

结构体内存对齐问题（Structure memory alignment problem） Structure memory alignment problem.Txt occasionally look back, otherwise, always in search of, and do not know what you lost. Men pay for lovers, women pay for relationships, men and women grab money for friends. Men love to see the woman with their eyes, the most vulnerable to beauty, women love to see the man, the most vulnerable to grief torture. When a structure type is defined in C, is its size equal to the sum of the size of each field (field)? How will the compiler place these fields in memory? What does the ANSI C require for the memory layout of the structure? And can we rely on the layout of our programs? These questions may be obscure to many friends, so this article tries to explore the secrets behind them. First of all, at least one thing for sure, it is ANSI C to ensure the field structure in memory occurs with their declaration order increasing, and the first field is equal to the first address of the entire structure, examples of the first address. For example, there is such a structure: Struct, vector{int, x, y, Z;} s; Int, *p, *q, *r; Struct vector *ps; P = s.x; Q = s.y; R = s.z; PS = s; Assert (P Q); Assert (P R); Assert (Q R); Assert ((int*) PS = = P); The above assertion / fail At this point, a friend might ask, does the standard specify adjacent fields to be adjacent to memory?. Well, Im sorry, ANSI C has no guarantee that your program should not rely on this assumption at any time. Does that mean that we can never sketch a clearer and more precise structure memory layout? Oh, of course not. But lets get away from this problem for a moment and focus on another important issue - memory alignment. The computer system has many practical restrictions on the basic types of data stored in the memory location, they will require these data the first address value is a number k (usually it is 4 or 8 times), this is the so-called memory alignment, and this k is called alignment modulus of this data type (a