Lines Matching refs:b
218 struct rt_slab_page *b, *n; in rt_slab_page_alloc() local
225 for (prev = &slab->page_list; (b = *prev) != RT_NULL; prev = &(b->next)) in rt_slab_page_alloc()
227 if (b->page > npages) in rt_slab_page_alloc()
230 n = b + npages; in rt_slab_page_alloc()
231 n->next = b->next; in rt_slab_page_alloc()
232 n->page = b->page - npages; in rt_slab_page_alloc()
237 if (b->page == npages) in rt_slab_page_alloc()
240 *prev = b->next; in rt_slab_page_alloc()
245 return b; in rt_slab_page_alloc()
259 struct rt_slab_page *b, *n; in rt_slab_page_free() local
269 for (prev = &slab->page_list; (b = *prev) != RT_NULL; prev = &(b->next)) in rt_slab_page_free()
271 RT_ASSERT(b->page > 0); in rt_slab_page_free()
272 RT_ASSERT(b > n || b + b->page <= n); in rt_slab_page_free()
274 if (b + b->page == n) in rt_slab_page_free()
276 if (b + (b->page += npages) == b->next) in rt_slab_page_free()
278 b->page += b->next->page; in rt_slab_page_free()
279 b->next = b->next->next; in rt_slab_page_free()
284 if (b == n + npages) in rt_slab_page_free()
286 n->page = b->page + npages; in rt_slab_page_free()
287 n->next = b->next; in rt_slab_page_free()
292 if (b > n + npages) in rt_slab_page_free()
297 n->next = b; in rt_slab_page_free()