tofree 2637 fs/ext4/extents.c if (partial->state == tofree) { tofree 2705 fs/ext4/extents.c partial->state = tofree; tofree 2895 fs/ext4/extents.c if (partial->state == tofree && ex >= EXT_FIRST_EXTENT(eh)) { tofree 3163 fs/ext4/extents.c if (partial.state == tofree && err == 0) { tofree 847 fs/file.c struct file *tofree; tofree 865 fs/file.c tofree = fdt->fd[fd]; tofree 866 fs/file.c if (!tofree && fd_is_open(fd, fdt)) tofree 877 fs/file.c if (tofree) tofree 878 fs/file.c filp_close(tofree, files); tofree 218 kernel/cgroup/cgroup-v1.c struct cgroup_pidlist *tofree = NULL; tofree 230 kernel/cgroup/cgroup-v1.c tofree = l; tofree 234 kernel/cgroup/cgroup-v1.c kfree(tofree); tofree 296 lib/debugobjects.c HLIST_HEAD(tofree); tofree 329 lib/debugobjects.c hlist_move_list(&obj_to_free, &tofree); tofree 335 lib/debugobjects.c hlist_for_each_entry_safe(obj, tmp, &tofree, node) { tofree 210 mm/slab.c struct kmem_cache_node *n, int tofree); tofree 2122 mm/slab.c int tofree; tofree 2127 mm/slab.c tofree = free_all ? ac->avail : (ac->limit + 4) / 5; tofree 2128 mm/slab.c if (tofree > ac->avail) tofree 2129 mm/slab.c tofree = (ac->avail + 1) / 2; tofree 2131 mm/slab.c free_block(cachep, ac->entry, tofree, node, list); tofree 2132 mm/slab.c ac->avail -= tofree; tofree 2133 mm/slab.c memmove(ac->entry, &(ac->entry[tofree]), sizeof(void *) * ac->avail); tofree 2182 mm/slab.c struct kmem_cache_node *n, int tofree) tofree 2189 mm/slab.c while (nr_freed < tofree && !list_empty(&n->slabs_free)) { tofree 205 net/sched/sch_fq.c struct fq_flow *f, *tofree[FQ_GC_MAX]; tofree 219 net/sched/sch_fq.c tofree[fcnt++] = f; tofree 234 net/sched/sch_fq.c struct fq_flow *f = tofree[--fcnt];