| 238 | } |
| 239 | |
| 240 | void myfree(void *p){ |
| 241 | struct mempage **prevpage, *page; |
| 242 | int i; |
| 243 | unsigned pagesize; |
| 244 | unsigned size, j, k; |
| 245 | |
| 246 | alloced--; |
| 247 | #if DEBUGLEVEL == 2 |
| 248 | fprintf(stderr, "free %p\n", p); |
| 249 | fflush(stderr); |
| 250 | #endif |
| 251 | pthread_mutex_lock(&mem_mutex); |
| 252 | i = myfindsize(p, &prevpage, &page); |
| 253 | if (i == nomem) { |
| 254 | #if DEBUGLEVEL > 2 |
| 255 | fprintf(stderr, "Page does not exists, trying free()\n"); |
| 256 | fflush(stderr); |
| 257 | #endif |
| 258 | pthread_mutex_unlock(&mem_mutex); |
| 259 | free(p); |
| 260 | return; |
| 261 | } |
| 262 | pagesize = memsizes[i]; |
| 263 | #if DEBUGLEVEL > 2 |
| 264 | fprintf(stderr, "Calculated pagesize: %u\n", pagesize); |
| 265 | fflush(stderr); |
| 266 | #endif |
| 267 | size = (unsigned)((unsigned char*)p - page->data); |
| 268 | if(size%pagesize) { |
| 269 | #if DEBUGLEVEL > 0 |
| 270 | write(2, p, 4); |
| 271 | fprintf(stderr, "\nGiven address is not block aligned, ignoring\n"); |
| 272 | fflush(stderr); |
| 273 | #endif |
| 274 | pthread_mutex_unlock(&mem_mutex); |
| 275 | return; /* Hmmmmm */ |
| 276 | } |
| 277 | *prevpage = page->next; |
| 278 | page->usable += pagesize; |
| 279 | #if DEBUGLEVEL > 2 |
| 280 | fprintf(stderr, "New usable space: %u\n", page->usable); |
| 281 | fflush(stderr); |
| 282 | #endif |
| 283 | if(page->usable >= MEM64K && ((pagesize == MEM64K) || (pages[i] && pages[i]->usable))) { |
| 284 | #if DEBUGLEVEL > 2 |
| 285 | fprintf(stderr, "Free this page\n"); |
| 286 | fflush(stderr); |
| 287 | #endif |
| 288 | free(page); |
| 289 | } |
| 290 | else { |
| 291 | j = (size>>11); |
| 292 | k = ((size & 0x000007FF) >> 8); |
| 293 | k = ('\01'<<k); |
| 294 | if(page->bitmap[j] & k) { |
| 295 | #if DEBUGLEVEL > 0 |
| 296 | fprintf(stderr, "Error: double free() %d/%d/%d\n", j, k, page->bitmap[j]); |
| 297 | fflush(stderr); |
no test coverage detected