Lines Matching refs:free
8 * Permission is hereby granted, free of charge, to any person obtaining a
35 * performance gains if a smarter free list is implemented. Currently it is just an
36 * unordered stack of free regions. This could easily be improved if an RB-tree
62 if (!entry->free)
77 if (!entry->free)
97 child->free = 1;
119 child->free = 0;
152 parent->free = 0;
165 * Put a block. Merge with the previous and / or next block if they are free.
166 * Otherwise add to the free stack.
184 if (prev_node->free) {
192 if (next_node->free) {
197 free(next_node);
206 cur->free = 1;
210 free(cur);
288 free(entry);
