Lines Matching refs:np
43 struct drm_gem_name *np);
58 struct drm_gem_name *np; in drm_gem_names_fini() local
63 while ((np = LIST_FIRST(&names->names_hash[i])) != NULL) { in drm_gem_names_fini()
64 drm_gem_names_delete_name(names, np); in drm_gem_names_fini()
150 struct drm_gem_name *np; in drm_gem_name_create() local
156 np = malloc(sizeof(struct drm_gem_name), M_GEM_NAMES, M_WAITOK); in drm_gem_name_create()
158 np->name = alloc_unr(names->unr); in drm_gem_name_create()
159 if (np->name == -1) { in drm_gem_name_create()
161 free(np, M_GEM_NAMES); in drm_gem_name_create()
164 *name = np->name; in drm_gem_name_create()
165 np->ptr = p; in drm_gem_name_create()
166 LIST_INSERT_HEAD(gem_name_hash_index(names, np->name), np, link); in drm_gem_name_create()
172 drm_gem_names_delete_name(struct drm_gem_names *names, struct drm_gem_name *np) in drm_gem_names_delete_name() argument
176 LIST_REMOVE(np, link); in drm_gem_names_delete_name()
178 free_unr(names->unr, np->name); in drm_gem_names_delete_name()
179 free(np, M_GEM_NAMES); in drm_gem_names_delete_name()
204 struct drm_gem_name *np; in drm_gem_names_foreach() local
212 for (np = LIST_FIRST(&names->names_hash[i]); np != NULL; ) { in drm_gem_names_foreach()
213 if (np->name == -1) { in drm_gem_names_foreach()
214 np = LIST_NEXT(np, link); in drm_gem_names_foreach()
217 LIST_INSERT_AFTER(np, &marker, link); in drm_gem_names_foreach()
219 fres = f(np->name, np->ptr, arg); in drm_gem_names_foreach()
221 np = LIST_NEXT(&marker, link); in drm_gem_names_foreach()