65 				       struct drm_mm_node, node_list);  in drm_mm_kmalloc()
66 			list_del(&child->node_list);  in drm_mm_kmalloc()
95 		list_add_tail(&node->node_list, &mm->unused_nodes);  in drm_mm_pre_get()
110 		list_entry(hole_node->node_list.next, struct drm_mm_node,  in drm_mm_hole_node_end()
111 			   node_list);  in drm_mm_hole_node_end()
150 	list_add(&node->node_list, &hole_node->node_list);  in drm_mm_insert_helper()
247 	list_add(&node->node_list, &hole_node->node_list);  in drm_mm_insert_helper_range()
324 	    list_entry(node->node_list.prev, struct drm_mm_node, node_list);  in drm_mm_remove_node()
340 	list_del(&node->node_list);  in drm_mm_remove_node()
359 		list_add(&node->node_list, &mm->unused_nodes);  in drm_mm_put_block()
476 	list_replace(&old->node_list, &new->node_list);  in drm_mm_replace_node()
561 	prev_node = list_entry(node->node_list.prev, struct drm_mm_node,  in drm_mm_scan_add_block()
562 			       node_list);  in drm_mm_scan_add_block()
566 	list_del(&node->node_list);  in drm_mm_scan_add_block()
567 	node->node_list.prev = &prev_node->node_list;  in drm_mm_scan_add_block()
568 	node->node_list.next = &mm->prev_scanned_node->node_list;  in drm_mm_scan_add_block()
620 	prev_node = list_entry(node->node_list.prev, struct drm_mm_node,  in drm_mm_scan_remove_block()
621 			       node_list);  in drm_mm_scan_remove_block()
624 	list_add(&node->node_list, &prev_node->node_list);  in drm_mm_scan_remove_block()
633 	struct list_head *head = &mm->head_node.node_list;  in drm_mm_clean()
648 	INIT_LIST_HEAD(&mm->head_node.node_list);  in drm_mm_init()
669 	if (!list_empty(&mm->head_node.node_list)) {  in drm_mm_takedown()
675 	list_for_each_entry_safe(entry, next, &mm->unused_nodes, node_list) {  in drm_mm_takedown()
676 		list_del(&entry->node_list);  in drm_mm_takedown()