47 	struct drmres_node		node;  member
60 	kfree_const(dr->node.name);  in free_dr()
69 	list_for_each_entry_safe(dr, tmp, &dev->managed.resources, node.entry) {  in drm_managed_release()
71 			       dr, dr->node.name, dr->node.size);  in drm_managed_release()
73 		if (dr->node.release)  in drm_managed_release()
74 			dr->node.release(dev, dr->node.size ? *(void **)&dr->data : NULL);  in drm_managed_release()
76 		list_del(&dr->node.entry);  in drm_managed_release()
102 	INIT_LIST_HEAD(&dr->node.entry);  in alloc_dr()
103 	dr->node.release = release;  in alloc_dr()
104 	dr->node.size = size;  in alloc_dr()
111 	list_del_init(&dr->node.entry);  in del_dr()
114 		       dr, dr->node.name, (unsigned long) dr->node.size);  in del_dr()
122 	list_add(&dr->node.entry, &dev->managed.resources);  in add_dr()
126 		       dr, dr->node.name, (unsigned long) dr->node.size);  in add_dr()
153 	dr->node.name = kstrdup_const(name, GFP_KERNEL);  in __drmm_add_action()
198 	list_for_each_entry_reverse(dr, &dev->managed.resources, node.entry) {  in drmm_release_action()
199 		if (dr->node.release == action) {  in drmm_release_action()
238 	dr->node.name = kstrdup_const("kmalloc", gfp);  in drmm_kmalloc()
290 	list_for_each_entry(dr, &dev->managed.resources, node.entry) {  in drmm_kfree()