Home
last modified time | relevance | path

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

/Linux-v5.4/fs/
Dfile.c847 struct file *tofree; in do_dup2() local
865 tofree = fdt->fd[fd]; in do_dup2()
866 if (!tofree && fd_is_open(fd, fdt)) in do_dup2()
877 if (tofree) in do_dup2()
878 filp_close(tofree, files); in do_dup2()
/Linux-v5.4/fs/ext4/
Dext4_extents.h132 enum {initial, tofree, nofree} state; enumerator
Dextents.c2630 if (partial->state == tofree) { in ext4_remove_blocks()
2698 partial->state = tofree; in ext4_remove_blocks()
2888 if (partial->state == tofree && ex >= EXT_FIRST_EXTENT(eh)) { in ext4_ext_rm_leaf()
3156 if (partial.state == tofree && err == 0) { in ext4_ext_remove_space()
/Linux-v5.4/mm/
Dslab.c210 struct kmem_cache_node *n, int tofree);
2122 int tofree; in drain_array_locked() local
2127 tofree = free_all ? ac->avail : (ac->limit + 4) / 5; in drain_array_locked()
2128 if (tofree > ac->avail) in drain_array_locked()
2129 tofree = (ac->avail + 1) / 2; in drain_array_locked()
2131 free_block(cachep, ac->entry, tofree, node, list); in drain_array_locked()
2132 ac->avail -= tofree; in drain_array_locked()
2133 memmove(ac->entry, &(ac->entry[tofree]), sizeof(void *) * ac->avail); in drain_array_locked()
2182 struct kmem_cache_node *n, int tofree) in drain_freelist() argument
2189 while (nr_freed < tofree && !list_empty(&n->slabs_free)) { in drain_freelist()
/Linux-v5.4/kernel/cgroup/
Dcgroup-v1.c218 struct cgroup_pidlist *tofree = NULL; in cgroup_pidlist_destroy_work_fn() local
230 tofree = l; in cgroup_pidlist_destroy_work_fn()
234 kfree(tofree); in cgroup_pidlist_destroy_work_fn()
/Linux-v5.4/net/sched/
Dsch_fq.c205 struct fq_flow *f, *tofree[FQ_GC_MAX]; in fq_gc() local
219 tofree[fcnt++] = f; in fq_gc()
234 struct fq_flow *f = tofree[--fcnt]; in fq_gc()
/Linux-v5.4/lib/
Ddebugobjects.c292 HLIST_HEAD(tofree); in free_obj_work()
325 hlist_move_list(&obj_to_free, &tofree); in free_obj_work()
331 hlist_for_each_entry_safe(obj, tmp, &tofree, node) { in free_obj_work()