heap-exploitation
Search…
malloc_chunk
This structure represents a particular chunk of memory. The various fields have different meaning for allocated and unallocated chunks.
1
struct malloc_chunk {
2
INTERNAL_SIZE_T mchunk_prev_size; /* Size of previous chunk, if it is free. */
3
INTERNAL_SIZE_T mchunk_size; /* Size in bytes, including overhead. */
4
struct malloc_chunk* fd; /* double links -- used only if this chunk is free. */
5
struct malloc_chunk* bk;
6
/* Only used for large blocks: pointer to next larger size. */
7
struct malloc_chunk* fd_nextsize; /* double links -- used only if this chunk is free. */
8
struct malloc_chunk* bk_nextsize;
9
};
10
​
11
typedef struct malloc_chunk* mchunkptr;
Copied!
Allocated chunk
1
chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
2
| Size of previous chunk, if unallocated (P clear) |
3
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
4
| Size of chunk, in bytes |A|M|P|
5
mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
6
| User data starts here... .
7
. .
8
. (malloc_usable_size() bytes) .
9
. |
10
nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
11
| (size of chunk, but used for application data) |
12
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
13
| Size of next chunk, in bytes |A|0|1|
14
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Copied!
Notice how the data of an allocated chunk uses the first attribute (
mchunk_prev_size) of the next chunk. mem is the pointer which is returned to the user.Free chunk
1
chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
2
| Size of previous chunk, if unallocated (P clear) |
3
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
4
`head:' | Size of chunk, in bytes |A|0|P|
5
mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
6
| Forward pointer to next chunk in list |
7
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
8
| Back pointer to previous chunk in list |
9
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
10
| Unused space (may be 0 bytes long) .
11
. .
12
. |
13
nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
14
`foot:' | Size of chunk, in bytes |
15
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
16
| Size of next chunk, in bytes |A|0|0|
17
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Copied!
Free chunks maintain themselves in a circular doubly linked list.
P (PREV_INUSE): 0 when previous chunk (not the previous chunk in the linked list, but the one directly before it in memory) is free (and hence the size of previous chunk is stored in the first field). The very first chunk allocated has this bit set. If it is 1, then we cannot determine the size of the previous chunk.
M (IS_MMAPPED): The chunk is obtained through
mmap. The other two bits are ignored. mmapped chunks are neither in an arena, not adjacent to a free chunk.A (NON_MAIN_ARENA): 0 for chunks in the main arena. Each thread spawned receives its own arena and for those chunks, this bit is set.
Note: Chunks in fastbins are treated as allocated chunks in the sense that they are not consolidated with neighboring free chunks.
Last modified 3d ago
Copy link