Lines Matching defs:entry
57 struct drm_mm_node *entry;
60 entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
61 if (!entry->free)
64 return (entry->size);
71 struct drm_mm_node *entry;
74 entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
75 if (!entry->free)
78 if (entry->size <= size)
81 entry->size -= size;
114 struct drm_mm_node *entry;
117 entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
118 if (!entry->free) {
120 entry->start + entry->size, size));
122 entry->size += size;
244 struct drm_mm_node *entry;
253 entry = list_entry(list, struct drm_mm_node, fl_entry);
256 if (entry->size < size)
260 register unsigned tmp = entry->start % alignment;
266 if (entry->size >= size + wasted) {
268 return (entry);
270 best = entry;
271 best_size = entry->size;
301 struct drm_mm_node *entry;
303 entry = list_entry(bnode, struct drm_mm_node, fl_entry);
305 if (entry->ml_entry.next != &mm->ml_entry ||
306 entry->fl_entry.next != &mm->fl_entry) {
311 list_del(&entry->fl_entry);
312 list_del(&entry->ml_entry);
314 drm_free(entry, sizeof (*entry), DRM_MEM_MM);
322 struct drm_mm_node *entry;
328 entry = list_entry(list, struct drm_mm_node, ml_entry);
330 entry, entry->size, entry->start);
332 list_del(&entry->fl_entry);
333 list_del(&entry->ml_entry);
334 drm_free(entry, sizeof (*entry), DRM_MEM_MM);