问题
In ANSI C, offsetof is defined as below.
#define offsetof(st, m) \\
((size_t) ( (char *)&((st *)(0))->m - (char *)0 ))
Why won\'t this throw a segmentation fault since we are dereferencing a NULL pointer? Or is this some sort of compiler hack where it sees that only address of the offset is taken out, so it statically calculates the address without actually dereferencing it? Also is this code portable?
回答1:
At no point in the above code is anything dereferenced. A dereference occurs when the *
or ->
is used on an address value to find referenced value. The only use of *
above is in a type declaration for the purpose of casting.
The ->
operator is used above but it's not used to access the value. Instead it's used to grab the address of the value. Here is a non-macro code sample that should make it a bit clearer
SomeType *pSomeType = GetTheValue();
int* pMember = &(pSomeType->SomeIntMember);
The second line does not actually cause a dereference (implementation dependent). It simply returns the address of SomeIntMember
within the pSomeType
value.
What you see is a lot of casting between arbitrary types and char pointers. The reason for char is that it's one of the only type (perhaps the only) type in the C89 standard which has an explicit size. The size is 1. By ensuring the size is one, the above code can do the evil magic of calculating the true offset of the value.
回答2:
In ANSI C, offsetof
is NOT defined like that. One of the reasons it's not defined like that is that some environments will indeed throw null pointer exceptions, or crash in other ways. Hence, ANSI C leaves the implementation of offsetof( )
open to compiler builders.
The code shown above is typical for compilers/environments that do not actively check for NULL pointers, but fail only when bytes are read from a NULL pointer.
回答3:
Although that is a typical implementation of offsetof
, it is not mandated by the standard, which just says:
The following types and macros are defined in the standard header
<stddef.h>
[...]
offsetof(
type
,
member-designator
)
which expands to an integer constant expression that has type
size_t
, the value of which is the offset in bytes, to the structure member (designated bymember-designator
), from the beginning of its structure (designated bytype
). The type and member designator shall be such that given
static
type
t;
then the expression
&(t.
member-designator
)
evaluates to an address constant. (If the specified member is a bit-field, the behavior is undefined.)
Read P J Plauger's "The Standard C Library" for a discussion of it and the other items in <stddef.h>
which are all border-line features that could (should?) be in the language proper, and which might require special compiler support.
It's of historic interest only, but I used an early ANSI C compiler on 386/IX (see, I told you of historic interest, circa 1990) that crashed on that version of offsetof
but worked when I revised it to:
#define offsetof(st, m) ((size_t)((char *)&((st *)(1024))->m - (char *)1024))
That was a compiler bug of sorts, not least because the header was distributed with the compiler and didn't work.
回答4:
To answer the last part of the question, the code is not portable.
The result of subtracting two pointers is defined and portable only if the two pointers point to objects in the same array or point to one past the last object of the array (7.6.2 Additive Operators, H&S Fifth Edition)
回答5:
It doesn't segfault because you're not dereferencing it. The pointer address is being used as a number that's subtracted from another number, not used to address memory operations.
回答6:
It calculates the offset of the member m
relative to the start address of the representation of an object of type st
.
((st *)(0))
refers to a NULL
pointer of type st *
.
&((st *)(0))->m
refers to the address of member m in this object. Since the start address of this object is 0 (NULL)
, the address of member m is exactly the offset.
char *
conversion and the difference calculates the offset in bytes. According to pointer operations, when you make a difference between two pointers of type T *
, the result is the number of objects of type T
represented between the two addresses contained by the operands.
回答7:
Listing 1: A representative set of offsetof()
macro definitions
// Keil 8051 compiler
#define offsetof(s,m) (size_t)&(((s *)0)->m)
// Microsoft x86 compiler (version 7)
#define offsetof(s,m) (size_t)(unsigned long)&(((s *)0)->m)
// Diab Coldfire compiler
#define offsetof(s,memb) ((size_t)((char *)&((s *)0)->memb-(char *)0))
typedef struct
{
int i;
float f;
char c;
} SFOO;
int main(void)
{
printf("Offset of 'f' is %zu\n", offsetof(SFOO, f));
}
The various operators within the macro are evaluated in an order such that the following steps are performed:
((s *)0)
takes the integer zero and casts it as a pointer tos
.((s *)0)->m
dereferences that pointer to point to structure memberm
.&(((s *)0)->m)
computes the address ofm
.(size_t)&(((s *)0)->m)
casts the result to an appropriate data type.
By definition, the structure itself resides at address 0. It follows that the address of the field pointed to (Step 3 above) must be the offset, in bytes, from the start of the structure.
来源:https://stackoverflow.com/questions/713963/why-does-this-implementation-of-offsetof-work