Lines Matching refs:fl
102 struct free_list *fl; member
108 #define HEADER_FREE(h) ((h)->u.fl)
117 struct free_list *fl; member
122 #define HEADER_FREE(h) ((h)->fl)
167 more_memory(int size, free_list_t fl) in more_memory() argument
189 HEADER_NEXT (h) = fl->head; in more_memory()
193 fl->head = h; in more_memory()
203 free_list_t fl; in malloc() local
220 fl = &malloc_free_list[i]; in malloc()
221 spin_lock(&fl->lock); in malloc()
222 h = fl->head; in malloc()
228 more_memory(n, fl); in malloc()
229 h = fl->head; in malloc()
234 spin_unlock(&fl->lock); in malloc()
241 fl->head = HEADER_NEXT (h); in malloc()
249 fl->in_use += 1; in malloc()
251 spin_unlock(&fl->lock); in malloc()
257 HEADER_FREE (h) = fl; in malloc()
269 free_list_t fl; in free() local
283 fl = HEADER_FREE (h); in free()
284 i = fl - malloc_free_list; in free()
292 if (fl != &malloc_free_list[i]) { in free()
293 assert(fl == &malloc_free_list[i]); in free()
299 spin_lock(&fl->lock); in free()
300 HEADER_NEXT (h) = fl->head; in free()
304 fl->head = h; in free()
306 fl->in_use -= 1; in free()
308 spin_unlock(&fl->lock); in free()
317 free_list_t fl; in realloc() local
332 fl = HEADER_FREE (h); in realloc()
333 i = fl - malloc_free_list; in realloc()
341 if (fl != &malloc_free_list[i]) { in realloc()
342 assert(fl == &malloc_free_list[i]); in realloc()
377 free_list_t fl; in print_malloc_free_list() local
384 for (i = 0, size = MIN_SIZE, fl = malloc_free_list; in print_malloc_free_list()
386 i += 1, size <<= 1, fl += 1) { in print_malloc_free_list()
387 spin_lock(&fl->lock); in print_malloc_free_list()
388 if (fl->in_use != 0 || fl->head != 0) { in print_malloc_free_list()
389 total_used += fl->in_use * size; in print_malloc_free_list()
390 for (n = 0, h = fl->head; h != 0; h = HEADER_NEXT (h), n += 1) in print_malloc_free_list()
394 size, fl->in_use, n, fl->in_use + n); in print_malloc_free_list()
396 spin_unlock(&fl->lock); in print_malloc_free_list()