21 (1 << (B_TOTAL_EXP - 2 * B_BLOCK_EXP + 1)) +
23 (1 << (B_TOTAL_EXP - B_BLOCK_EXP))
27 uint8_t
longest[(1U << (B_TOTAL_EXP - B_BLOCK_EXP + 1))];
36 "longest and base_mem are not contiguous, this will break incremental checkpointing");
unsigned char block_bitmap
The type of a generic bitmap.
Definition: bitmap.h:22
#define bitmap_required_size(requested_bits)
Computes the required size of a bitmap.
Definition: bitmap.h:63
A Buddy System implementation.
A restorable checkpoint of the memory context of a single buddy system.
Definition: ckpt.h:14
uint8_t longest[(1U<<(B_TOTAL_EXP - B_BLOCK_EXP+1))]
The checkpointed binary tree representing the buddy system.
Definition: ckpt.h:27
unsigned char base_mem[]
The checkpointed memory buffer assigned to the model.
Definition: ckpt.h:29
const struct buddy_state * orig
The buddy system to which this checkpoint applies. TODO: reengineer the multi-checkpointing approach.
Definition: ckpt.h:16
block_bitmap dirty[bitmap_required_size((1<<(B_TOTAL_EXP - 2 *B_BLOCK_EXP+1))+(1<<(B_TOTAL_EXP - B_BLOCK_EXP)))]
The checkpoint of the dirty bitmap.
Definition: ckpt.h:25
The checkpointable memory context of a single buddy system.
Definition: buddy.h:30
uint8_t longest[(1U<<(B_TOTAL_EXP - B_BLOCK_EXP+1))]
The checkpointed binary tree representing the buddy system.
Definition: buddy.h:33
unsigned char base_mem[1U<< B_TOTAL_EXP]
The memory buffer served to the model.
Definition: buddy.h:35