Lines Matching defs:entry
55 struct drm_mm_node *entry;
58 entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
59 if (!entry->free)
62 return entry->size;
68 struct drm_mm_node *entry;
71 entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
72 if (!entry->free)
75 if (entry->size <= size)
78 entry->size -= size;
153 struct drm_mm_node *entry;
156 entry = list_entry(tail_node, struct drm_mm_node, ml_entry);
157 if (!entry->free) {
158 return drm_mm_create_tail_node(mm, entry->start + entry->size,
161 entry->size += size;
287 struct drm_mm_node *entry;
296 entry = list_entry(list, struct drm_mm_node, fl_entry);
299 if (entry->size < size)
303 register unsigned tmp = entry->start % alignment;
308 if (entry->size >= size + wasted) {
310 return entry;
312 best = entry;
313 best_size = entry->size;
343 struct drm_mm_node *entry;
346 entry = list_entry(bnode, struct drm_mm_node, fl_entry);
348 if (entry->ml_entry.next != &mm->ml_entry ||
349 entry->fl_entry.next != &mm->fl_entry) {
354 list_del(&entry->fl_entry);
355 list_del(&entry->ml_entry);
356 free(entry, DRM_MEM_MM);
359 list_for_each_entry_safe(entry, next, &mm->unused_nodes, fl_entry) {
360 list_del(&entry->fl_entry);
361 free(entry, DRM_MEM_MM);