Searched refs:head_node (Results 1 – 9 of 9) sorted by relevance
172 list_for_each_entry(node, &mm->head_node.node_list, node_list) { in INTERVAL_TREE_DEFINE()176 return &mm->head_node; in INTERVAL_TREE_DEFINE()179 start, last) ?: (struct drm_mm_node *)&mm->head_node; in INTERVAL_TREE_DEFINE()1075 INIT_LIST_HEAD(&mm->head_node.node_list); in drm_mm_init()1076 mm->head_node.flags = 0; in drm_mm_init()1077 mm->head_node.mm = mm; in drm_mm_init()1078 mm->head_node.start = start + size; in drm_mm_init()1079 mm->head_node.size = -size; in drm_mm_init()1080 add_hole(&mm->head_node); in drm_mm_init()1124 total_free += drm_mm_dump_hole(p, &mm->head_node); in drm_mm_print()
62 head_node enumerator141 _Head() : base_type(head_node) { } in _Head()602 if (m_p_nd->m_type == head_node) in inc()609 while (p_y->m_type != head_node && get_larger_sibling(m_p_nd) == 0) in inc()615 if (p_y->m_type == head_node) in inc()630 if (m_p_nd->m_type == head_node) in dec()637 while (p_y->m_type != head_node && get_smaller_sibling(m_p_nd) == 0) in dec()643 if (p_y->m_type == head_node) in dec()
106 if (p_nd->m_p_parent->m_type == head_node) in erase_fixup()274 if (p_l->m_p_parent->m_type == head_node) in erase_leaf()
121 while (p_nd->m_type != head_node) in split_prep()
210 struct drm_mm_node head_node; member356 #define drm_mm_nodes(mm) (&(mm)->head_node.node_list)
255 vm->mm.head_node.color = I915_COLOR_UNEVICTABLE; in i915_address_space_init()