// Insert a new element
void heap_insert(heap *h, void* key, void* value) {
// Check if this heap is not destoyed
assert(h->table != NULL);
// Check if we have room
int max_entries = h->allocated_pages * ENTRIES_PER_PAGE;
if (h->active_entries + 1 > max_entries) {
// Get the new number of entries we need
int new_size = h->allocated_pages * 2;
// Map in a new table
heap_entry* new_table = map_in_pages(new_size);
// Copy the old entries, copy the entire pages
memcpy(new_table, h->table, h->allocated_pages*PAGE_SIZE);
// Cleanup the old table
map_out_pages(h->table, h->allocated_pages);
// Switch to the new table
h->table = new_table;
h->allocated_pages = new_size;
}
// Store the comparison function
int (*cmp_func)(void*,void*) = h->compare_func;
// Store the table address
heap_entry* table = h->table;
// Get the current index
int current_index = h->active_entries;
heap_entry* current = GET_ENTRY(current_index, table);
// Loop variables
int parent_index;
heap_entry *parent;
// While we can, keep swapping with our parent
while (current_index > 0) {
// Get the parent index
parent_index = PARENT_ENTRY(current_index);
// Get the parent entry
parent = GET_ENTRY(parent_index, table);
// Compare the keys, and swap if we need to
if (cmp_func(key, parent->key) < 0) {
// Move the parent down
current->key = parent->key;
current->value = parent->value;
// Move our reference
current_index = parent_index;
current = parent;
// We are done swapping
} else
break;
}
// Insert at the current index
current->key = key;
current->value = value;
// Increase the number of active entries
h->active_entries++;
}
// Insert a new element
void heap_insert(heap *h, void* key, void* value) {
// Check if this heap is not destoyed
assert(h->mapping_table != NULL);
// Check if we have room
int max_entries = h->allocated_pages * ENTRIES_PER_PAGE;
if (h->active_entries + 1 > max_entries) {
// Get the number of map pages
int map_pages = h->map_pages;
// We need a new page, do we have room?
int mapable_pages = map_pages * PAGE_SIZE / sizeof(void*);
// Check if we need to grow the map table
if (h->allocated_pages + 1 > mapable_pages) {
// Allocate a new table, slightly bigger
void *new_table = map_in_pages(map_pages + 1);
// Get the old table
void *old_table = (void*)h->mapping_table;
// Copy the old entries to the new table
memcpy(new_table, old_table, map_pages * PAGE_SIZE);
// Delete the old table
map_out_pages(old_table, map_pages);
// Swap to the new table
h->mapping_table = (void**)new_table;
// Update the number of map pages
h->map_pages = map_pages + 1;
}
// Allocate a new page
void* addr = map_in_pages(1);
// Add this to the map
*(h->mapping_table+h->allocated_pages) = addr;
// Update the number of allocated pages
h->allocated_pages++;
}
// Store the comparison function
int (*cmp_func)(void*,void*) = h->compare_func;
// Store the map table address
void** map_table = h->mapping_table;
// Get the current index
int current_index = h->active_entries;
heap_entry* current = GET_ENTRY(current_index, map_table);
// Loop variables
int parent_index;
heap_entry *parent;
// While we can, keep swapping with our parent
while (current_index > 0) {
// Get the parent index
parent_index = PARENT_ENTRY(current_index);
// Get the parent entry
parent = GET_ENTRY(parent_index, map_table);
// Compare the keys, and swap if we need to
if (cmp_func(key, parent->key) < 0) {
// Move the parent down
current->key = parent->key;
current->value = parent->value;
// Move our reference
current_index = parent_index;
current = parent;
// We are done swapping
} else
break;
}
// Insert at the current index
current->key = key;
current->value = value;
// Increase the number of active entries
h->active_entries++;
}
