/* Memory allocator `malloc'. */
-/* Copyright (c) 2010-2022. The SimGrid Team. All rights reserved. */
+/* Copyright (c) 2010-2023. The SimGrid Team. All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
void* result = mmalloc_aligned(mdp, size); // Never returns NULL
/* Check if we need to grow the info table (in a multiplicative manner) */
- if ((size_t) BLOCK((char *) result + size) > mdp->heapsize) {
+ if (BLOCK((char*)result + size) > mdp->heapsize) {
size_t newsize = mdp->heapsize;
- while ((size_t) BLOCK((char *) result + size) > newsize)
+ while (BLOCK((char*)result + size) > newsize)
newsize *= 2;
/* Copy old info into new location */
/* Update the swag of busy blocks containing free fragments by applying the offset to all swag_hooks. Yeah. My hand is right in the fan and I still type */
size_t offset=((char*)newinfo)-((char*)oldinfo);
- for (int i = 1 /*first element of heapinfo describes the mdesc area*/; i < mdp->heaplimit; i++) {
+ for (size_t i = 1 /*first element of heapinfo describes the mdesc area*/; i < mdp->heaplimit; i++) {
update_hook(&newinfo[i].freehook.next, offset);
update_hook(&newinfo[i].freehook.prev, offset);
}
/* mark the space previously occupied by the block info as free by first marking it
* as occupied in the regular way, and then freing it */
- for (int it = 0; it < BLOCKIFY(mdp->heapsize * sizeof(malloc_info)); it++) {
+ for (size_t it = 0; it < BLOCKIFY(mdp->heapsize * sizeof(malloc_info)); it++) {
newinfo[BLOCK(oldinfo)+it].type = MMALLOC_TYPE_UNFRAGMENTED;
newinfo[BLOCK(oldinfo)+it].busy_block.ignore = 0;
}
static void mmalloc_mark_used(xbt_mheap_t mdp, size_t block, size_t nblocks, size_t requested_size)
{
- for (int it = 0; it < nblocks; it++) {
+ for (size_t it = 0; it < nblocks; it++) {
mdp->heapinfo[block + it].type = MMALLOC_TYPE_UNFRAGMENTED;
mdp->heapinfo[block + it].busy_block.busy_size = 0;
mdp->heapinfo[block + it].busy_block.ignore = 0;