Lines Matching defs:mm
54 drm_mm_tail_space(struct drm_mm *mm)
59 tail_node = mm->ml_entry.prev;
68 drm_mm_remove_space_from_tail(struct drm_mm *mm, unsigned long size)
73 tail_node = mm->ml_entry.prev;
87 drm_mm_create_tail_node(struct drm_mm *mm,
101 child->mm = mm;
103 list_add_tail(&child->ml_entry, &mm->ml_entry, (caddr_t)child);
104 list_add_tail(&child->fl_entry, &mm->fl_entry, (caddr_t)child);
111 drm_mm_add_space_to_tail(struct drm_mm *mm, unsigned long size)
116 tail_node = mm->ml_entry.prev;
119 return (drm_mm_create_tail_node(mm,
142 child->mm = parent->mm;
161 struct drm_mm *mm = cur->mm;
163 struct list_head *root_head = &mm->ml_entry;
196 list_add(&cur->fl_entry, &mm->fl_entry, (caddr_t)cur);
237 drm_mm_search_free(const struct drm_mm *mm,
243 const struct list_head *free_stack = &mm->fl_entry;
280 drm_mm_clean(struct drm_mm *mm)
282 struct list_head *head = &mm->ml_entry;
288 drm_mm_init(struct drm_mm *mm, unsigned long start, unsigned long size)
290 INIT_LIST_HEAD(&mm->ml_entry);
291 INIT_LIST_HEAD(&mm->fl_entry);
293 return (drm_mm_create_tail_node(mm, start, size));
298 drm_mm_takedown(struct drm_mm *mm)
300 struct list_head *bnode = mm->fl_entry.next;
305 if (entry->ml_entry.next != &mm->ml_entry ||
306 entry->fl_entry.next != &mm->fl_entry) {
318 drm_mm_clean_ml(const struct drm_mm *mm)
320 const struct list_head *mlstack = &mm->ml_entry;