Lines Matching refs:free_stack
67 struct drm_mm_node, free_stack);
68 list_del(&child->free_stack);
97 list_add_tail(&node->free_stack, &mm->unused_nodes);
120 list_add_tail(&child->free_stack, &mm->free_stack);
135 INIT_LIST_HEAD(&child->free_stack);
142 INIT_LIST_HEAD(&child->free_stack);
170 list_del_init(&node->free_stack);
208 list_del_init(&node->free_stack);
255 list_del(&next_node->free_stack);
258 list_add(&next_node->free_stack,
273 list_add(&cur->free_stack, &mm->free_stack);
278 list_add(&cur->free_stack, &mm->unused_nodes);
322 list_for_each_entry(entry, &mm->free_stack, free_stack) {
356 list_for_each_entry(entry, &mm->free_stack, free_stack) {
430 prev_free = &prev_node->free_stack;
445 next_free = &next_node->free_stack;
449 /* The free_stack list is not used for allocated objects, so these two
452 node->free_stack.prev = prev_free;
453 node->free_stack.next = next_free;
476 * the just freed block (because its at the top of the free_stack list).
492 prev_node = list_entry(node->free_stack.prev, struct drm_mm_node,
493 free_stack);
494 next_node = list_entry(node->free_stack.next, struct drm_mm_node,
495 free_stack);
516 INIT_LIST_HEAD(&node->free_stack);
542 INIT_LIST_HEAD(&mm->free_stack);
554 struct list_head *bnode = mm->free_stack.next;
558 entry = list_entry(bnode, struct drm_mm_node, free_stack);
561 entry->free_stack.next != &mm->free_stack) {
566 list_del(&entry->free_stack);
571 list_for_each_entry_safe(entry, next, &mm->unused_nodes, free_stack) {
572 list_del(&entry->free_stack);