Lines Matching defs:entry
313 struct drm_mm_node *entry;
322 list_for_each_entry(entry, &mm->free_stack, free_stack) {
323 if (!check_free_hole(entry->start, entry->start + entry->size,
328 return entry;
330 if (entry->size < best_size) {
331 best = entry;
332 best_size = entry->size;
347 struct drm_mm_node *entry;
356 list_for_each_entry(entry, &mm->free_stack, free_stack) {
357 unsigned long adj_start = entry->start < start ?
358 start : entry->start;
359 unsigned long adj_end = entry->start + entry->size > end ?
360 end : entry->start + entry->size;
366 return entry;
368 if (entry->size < best_size) {
369 best = entry;
370 best_size = entry->size;
555 struct drm_mm_node *entry;
558 entry = list_entry(bnode, struct drm_mm_node, free_stack);
560 if (entry->node_list.next != &mm->node_list ||
561 entry->free_stack.next != &mm->free_stack) {
566 list_del(&entry->free_stack);
567 list_del(&entry->node_list);
568 kfree(entry);
571 list_for_each_entry_safe(entry, next, &mm->unused_nodes, free_stack) {
572 list_del(&entry->free_stack);
573 kfree(entry);
584 struct drm_mm_node *entry;
587 list_for_each_entry(entry, &mm->node_list, node_list) {
589 prefix, entry->start, entry->start + entry->size,
590 entry->size, entry->free ? "free" : "used");
591 total += entry->size;
592 if (entry->free)
593 total_free += entry->size;
595 total_used += entry->size;
605 struct drm_mm_node *entry;
608 list_for_each_entry(entry, &mm->node_list, node_list) {
609 seq_printf(m, "0x%08lx-0x%08lx: 0x%08lx: %s\n", entry->start, entry->start + entry->size, entry->size, entry->free ? "free" : "used");
610 total += entry->size;
611 if (entry->free)
612 total_free += entry->size;
614 total_used += entry->size;