Home
last modified time | relevance | path

Searched refs:tofree (Results 1 – 5 of 5) sorted by relevance

/Linux-v4.19/fs/
Dfile.c812 struct file *tofree; in do_dup2() local
830 tofree = fdt->fd[fd]; in do_dup2()
831 if (!tofree && fd_is_open(fd, fdt)) in do_dup2()
842 if (tofree) in do_dup2()
843 filp_close(tofree, files); in do_dup2()
/Linux-v4.19/lib/
Ddebugobjects.c211 HLIST_HEAD(tofree); in free_obj_work()
235 hlist_move_list(&obj_to_free, &tofree); in free_obj_work()
241 hlist_for_each_entry_safe(obj, tmp, &tofree, node) { in free_obj_work()
/Linux-v4.19/mm/
Dslab.c210 struct kmem_cache_node *n, int tofree);
2199 int tofree; in drain_array_locked() local
2204 tofree = free_all ? ac->avail : (ac->limit + 4) / 5; in drain_array_locked()
2205 if (tofree > ac->avail) in drain_array_locked()
2206 tofree = (ac->avail + 1) / 2; in drain_array_locked()
2208 free_block(cachep, ac->entry, tofree, node, list); in drain_array_locked()
2209 ac->avail -= tofree; in drain_array_locked()
2210 memmove(ac->entry, &(ac->entry[tofree]), sizeof(void *) * ac->avail); in drain_array_locked()
2259 struct kmem_cache_node *n, int tofree) in drain_freelist() argument
2266 while (nr_freed < tofree && !list_empty(&n->slabs_free)) { in drain_freelist()
/Linux-v4.19/net/sched/
Dsch_fq.c195 struct fq_flow *f, *tofree[FQ_GC_MAX]; in fq_gc() local
209 tofree[fcnt++] = f; in fq_gc()
224 struct fq_flow *f = tofree[--fcnt]; in fq_gc()
/Linux-v4.19/kernel/cgroup/
Dcgroup-v1.c230 struct cgroup_pidlist *tofree = NULL; in cgroup_pidlist_destroy_work_fn() local
242 tofree = l; in cgroup_pidlist_destroy_work_fn()
246 kfree(tofree); in cgroup_pidlist_destroy_work_fn()