Lines Matching refs:node_list
119 list_add_tail(&child->node_list, &mm->node_list);
141 list_add_tail(&child->node_list, &parent->node_list);
230 struct list_head *cur_head = &cur->node_list;
231 struct list_head *root_head = &mm->node_list;
242 list_entry(cur_head->prev, struct drm_mm_node, node_list);
250 list_entry(cur_head->next, struct drm_mm_node, node_list);
254 list_del(&next_node->node_list);
275 list_del(&cur->node_list);
418 if (node->node_list.prev != &mm->node_list) {
419 prev_node = list_entry(node->node_list.prev, struct drm_mm_node,
420 node_list);
423 list_del(&prev_node->node_list);
434 if (node->node_list.next != &mm->node_list) {
435 next_node = list_entry(node->node_list.next, struct drm_mm_node,
436 node_list);
439 list_del(&next_node->node_list);
501 list_add_tail(&prev_node->node_list, &node->node_list);
511 list_add(&next_node->node_list, &node->node_list);
533 struct list_head *head = &mm->node_list;
541 INIT_LIST_HEAD(&mm->node_list);
560 if (entry->node_list.next != &mm->node_list ||
567 list_del(&entry->node_list);
587 list_for_each_entry(entry, &mm->node_list, node_list) {
608 list_for_each_entry(entry, &mm->node_list, node_list) {