arch/powerpc/platforms/ps3/setup.c
133
#define prealloc_ps3fb_videomemory() prealloc(&ps3fb_videomemory)
arch/powerpc/platforms/ps3/setup.c
156
#define prealloc_ps3flash_bounce_buffer() prealloc(&ps3flash_bounce_buffer)
drivers/gpu/drm/i915/display/intel_fbdev.c
275
bool prealloc = false;
drivers/gpu/drm/i915/display/intel_fbdev.c
307
prealloc = true;
drivers/gpu/drm/i915/display/intel_fbdev.c
345
if (!intel_bo_is_shmem(obj) && !prealloc)
drivers/gpu/drm/msm/msm_gem_vma.c
1158
mmu->funcs->prealloc_count(mmu, &job->prealloc, start_iova, end_iova - start_iova);
drivers/gpu/drm/msm/msm_gem_vma.c
118
struct msm_mmu_prealloc prealloc;
drivers/gpu/drm/msm/msm_gem_vma.c
1226
atomic_add(job->prealloc.count, &vm->prealloc_throttle.in_flight);
drivers/gpu/drm/msm/msm_gem_vma.c
1354
ret = mmu->funcs->prealloc_allocate(mmu, &job->prealloc);
drivers/gpu/drm/msm/msm_gem_vma.c
713
vm->mmu->prealloc = &job->prealloc;
drivers/gpu/drm/msm/msm_gem_vma.c
738
vm->mmu->prealloc = NULL;
drivers/gpu/drm/msm/msm_gem_vma.c
767
vm->mmu->funcs->prealloc_cleanup(vm->mmu, &job->prealloc);
drivers/gpu/drm/msm/msm_gem_vma.c
769
atomic_sub(job->prealloc.count, &vm->prealloc_throttle.in_flight);
drivers/gpu/drm/msm/msm_iommu.c
387
struct msm_mmu_prealloc *p = pagetable->base.prealloc;
drivers/gpu/drm/msm/msm_mmu.h
66
struct msm_mmu_prealloc *prealloc;
drivers/md/dm-cache-target.c
1403
struct dm_bio_prison_cell_v2 *prealloc;
drivers/md/dm-cache-target.c
1405
prealloc = alloc_prison_cell(cache);
drivers/md/dm-cache-target.c
1415
prealloc, &mg->cell);
drivers/md/dm-cache-target.c
1417
free_prison_cell(cache, prealloc);
drivers/md/dm-cache-target.c
1422
if (mg->cell != prealloc)
drivers/md/dm-cache-target.c
1423
free_prison_cell(cache, prealloc);
drivers/md/dm-cache-target.c
1557
struct dm_bio_prison_cell_v2 *prealloc;
drivers/md/dm-cache-target.c
1559
prealloc = alloc_prison_cell(cache);
drivers/md/dm-cache-target.c
1563
READ_WRITE_LOCK_LEVEL, prealloc, &mg->cell);
drivers/md/dm-cache-target.c
1565
free_prison_cell(cache, prealloc);
drivers/md/dm-cache-target.c
1579
if (mg->cell != prealloc)
drivers/md/dm-cache-target.c
1580
free_prison_cell(cache, prealloc);
drivers/media/platform/renesas/vsp1/vsp1_dl.c
1091
unsigned int prealloc)
drivers/media/platform/renesas/vsp1/vsp1_dl.c
1126
dlm->pool = vsp1_dl_body_pool_create(vsp1, prealloc + 1,
drivers/media/platform/renesas/vsp1/vsp1_dl.c
1131
for (i = 0; i < prealloc; ++i) {
drivers/media/platform/renesas/vsp1/vsp1_dl.c
1148
dlm->list_count = prealloc;
drivers/media/platform/renesas/vsp1/vsp1_dl.c
1152
VSP1_EXTCMD_AUTOFLD, prealloc);
drivers/media/platform/renesas/vsp1/vsp1_dl.h
56
unsigned int prealloc);
drivers/usb/gadget/function/u_ether.c
360
status = prealloc(&dev->tx_reqs, link->in_ep, n);
drivers/usb/gadget/function/u_ether.c
363
status = prealloc(&dev->rx_reqs, link->out_ep, n);
fs/btrfs/extent-io-tree.c
1144
struct extent_state *prealloc = NULL;
fs/btrfs/extent-io-tree.c
1162
if (!prealloc) {
fs/btrfs/extent-io-tree.c
1170
prealloc = alloc_extent_state(mask);
fs/btrfs/extent-io-tree.c
1189
prealloc = alloc_extent_state_atomic(prealloc);
fs/btrfs/extent-io-tree.c
1190
if (!prealloc)
fs/btrfs/extent-io-tree.c
1192
prealloc->start = start;
fs/btrfs/extent-io-tree.c
1193
prealloc->end = end;
fs/btrfs/extent-io-tree.c
1194
insert_state_fast(tree, prealloc, p, parent, bits, changeset);
fs/btrfs/extent-io-tree.c
1195
cache_state(prealloc, cached_state);
fs/btrfs/extent-io-tree.c
1196
prealloc = NULL;
fs/btrfs/extent-io-tree.c
1262
prealloc = alloc_extent_state_atomic(prealloc);
fs/btrfs/extent-io-tree.c
1263
if (!prealloc)
fs/btrfs/extent-io-tree.c
1265
ret = split_state(tree, state, prealloc, start);
fs/btrfs/extent-io-tree.c
1269
prealloc = NULL;
fs/btrfs/extent-io-tree.c
1295
prealloc = alloc_extent_state_atomic(prealloc);
fs/btrfs/extent-io-tree.c
1296
if (!prealloc)
fs/btrfs/extent-io-tree.c
1303
prealloc->start = start;
fs/btrfs/extent-io-tree.c
1305
prealloc->end = end;
fs/btrfs/extent-io-tree.c
1307
prealloc->end = last_start - 1;
fs/btrfs/extent-io-tree.c
1309
inserted_state = insert_state(tree, prealloc, bits, changeset);
fs/btrfs/extent-io-tree.c
1312
extent_io_tree_panic(tree, prealloc, "insert", ret);
fs/btrfs/extent-io-tree.c
1317
if (inserted_state == prealloc)
fs/btrfs/extent-io-tree.c
1318
prealloc = NULL;
fs/btrfs/extent-io-tree.c
1352
prealloc = alloc_extent_state_atomic(prealloc);
fs/btrfs/extent-io-tree.c
1353
if (!prealloc)
fs/btrfs/extent-io-tree.c
1355
ret = split_state(tree, state, prealloc, end + 1);
fs/btrfs/extent-io-tree.c
1358
prealloc = NULL;
fs/btrfs/extent-io-tree.c
1362
set_state_bits(tree, prealloc, bits, changeset);
fs/btrfs/extent-io-tree.c
1363
cache_state(prealloc, cached_state);
fs/btrfs/extent-io-tree.c
1364
merge_state(tree, prealloc);
fs/btrfs/extent-io-tree.c
1365
prealloc = NULL;
fs/btrfs/extent-io-tree.c
1379
btrfs_free_extent_state(prealloc);
fs/btrfs/extent-io-tree.c
1414
struct extent_state *prealloc = NULL;
fs/btrfs/extent-io-tree.c
1427
if (!prealloc) {
fs/btrfs/extent-io-tree.c
1435
prealloc = alloc_extent_state(GFP_NOFS);
fs/btrfs/extent-io-tree.c
1436
if (!prealloc && !first_iteration)
fs/btrfs/extent-io-tree.c
1454
prealloc = alloc_extent_state_atomic(prealloc);
fs/btrfs/extent-io-tree.c
1455
if (!prealloc) {
fs/btrfs/extent-io-tree.c
1459
prealloc->start = start;
fs/btrfs/extent-io-tree.c
1460
prealloc->end = end;
fs/btrfs/extent-io-tree.c
1461
insert_state_fast(tree, prealloc, p, parent, bits, NULL);
fs/btrfs/extent-io-tree.c
1462
cache_state(prealloc, cached_state);
fs/btrfs/extent-io-tree.c
1463
prealloc = NULL;
fs/btrfs/extent-io-tree.c
1504
prealloc = alloc_extent_state_atomic(prealloc);
fs/btrfs/extent-io-tree.c
1505
if (!prealloc) {
fs/btrfs/extent-io-tree.c
1509
ret = split_state(tree, state, prealloc, start);
fs/btrfs/extent-io-tree.c
1510
prealloc = NULL;
fs/btrfs/extent-io-tree.c
1537
prealloc = alloc_extent_state_atomic(prealloc);
fs/btrfs/extent-io-tree.c
1538
if (!prealloc) {
fs/btrfs/extent-io-tree.c
1547
prealloc->start = start;
fs/btrfs/extent-io-tree.c
1549
prealloc->end = end;
fs/btrfs/extent-io-tree.c
1551
prealloc->end = last_start - 1;
fs/btrfs/extent-io-tree.c
1553
inserted_state = insert_state(tree, prealloc, bits, NULL);
fs/btrfs/extent-io-tree.c
1556
extent_io_tree_panic(tree, prealloc, "insert", ret);
fs/btrfs/extent-io-tree.c
1560
if (inserted_state == prealloc)
fs/btrfs/extent-io-tree.c
1561
prealloc = NULL;
fs/btrfs/extent-io-tree.c
1588
prealloc = alloc_extent_state_atomic(prealloc);
fs/btrfs/extent-io-tree.c
1589
if (!prealloc) {
fs/btrfs/extent-io-tree.c
1594
ret = split_state(tree, state, prealloc, end + 1);
fs/btrfs/extent-io-tree.c
1597
prealloc = NULL;
fs/btrfs/extent-io-tree.c
1601
set_state_bits(tree, prealloc, bits, NULL);
fs/btrfs/extent-io-tree.c
1602
cache_state(prealloc, cached_state);
fs/btrfs/extent-io-tree.c
1603
clear_state_bit(tree, prealloc, clear_bits, end, NULL);
fs/btrfs/extent-io-tree.c
1604
prealloc = NULL;
fs/btrfs/extent-io-tree.c
1618
btrfs_free_extent_state(prealloc);
fs/btrfs/extent-io-tree.c
166
static struct extent_state *alloc_extent_state_atomic(struct extent_state *prealloc)
fs/btrfs/extent-io-tree.c
168
if (!prealloc)
fs/btrfs/extent-io-tree.c
169
prealloc = alloc_extent_state(GFP_ATOMIC);
fs/btrfs/extent-io-tree.c
171
return prealloc;
fs/btrfs/extent-io-tree.c
505
struct extent_state *prealloc, u64 split)
fs/btrfs/extent-io-tree.c
513
prealloc->start = orig->start;
fs/btrfs/extent-io-tree.c
514
prealloc->end = split - 1;
fs/btrfs/extent-io-tree.c
515
prealloc->state = orig->state;
fs/btrfs/extent-io-tree.c
526
if (prealloc->end < entry->start) {
fs/btrfs/extent-io-tree.c
528
} else if (prealloc->end > entry->end) {
fs/btrfs/extent-io-tree.c
531
btrfs_free_extent_state(prealloc);
fs/btrfs/extent-io-tree.c
536
rb_link_node(&prealloc->rb_node, parent, node);
fs/btrfs/extent-io-tree.c
537
rb_insert_color(&prealloc->rb_node, &tree->state);
fs/btrfs/extent-io-tree.c
636
struct extent_state *prealloc = NULL;
fs/btrfs/extent-io-tree.c
656
if (!prealloc) {
fs/btrfs/extent-io-tree.c
664
prealloc = alloc_extent_state(mask);
fs/btrfs/extent-io-tree.c
760
prealloc = alloc_extent_state_atomic(prealloc);
fs/btrfs/extent-io-tree.c
761
if (!prealloc)
fs/btrfs/extent-io-tree.c
763
ret = split_state(tree, state, prealloc, start);
fs/btrfs/extent-io-tree.c
764
prealloc = NULL;
fs/btrfs/extent-io-tree.c
822
prealloc = alloc_extent_state_atomic(prealloc);
fs/btrfs/extent-io-tree.c
823
if (!prealloc)
fs/btrfs/extent-io-tree.c
825
ret = split_state(tree, state, prealloc, end + 1);
fs/btrfs/extent-io-tree.c
828
prealloc = NULL;
fs/btrfs/extent-io-tree.c
834
clear_state_bit(tree, prealloc, bits, end, changeset);
fs/btrfs/extent-io-tree.c
836
prealloc = NULL;
fs/btrfs/extent-io-tree.c
856
btrfs_free_extent_state(prealloc);
fs/btrfs/extent_io.c
3361
struct btrfs_folio_state *prealloc,
fs/btrfs/extent_io.c
3422
ret = attach_extent_buffer_folio(eb, eb->folios[i], prealloc);
fs/btrfs/extent_io.c
3444
struct btrfs_folio_state *prealloc = NULL;
fs/btrfs/extent_io.c
3489
prealloc = btrfs_alloc_folio_state(fs_info, PAGE_SIZE, BTRFS_SUBPAGE_METADATA);
fs/btrfs/extent_io.c
3490
if (IS_ERR(prealloc)) {
fs/btrfs/extent_io.c
3491
ret = PTR_ERR(prealloc);
fs/btrfs/extent_io.c
3504
btrfs_free_folio_state(prealloc);
fs/btrfs/extent_io.c
3512
ret = attach_eb_folio_to_filemap(eb, i, prealloc, &existing_eb);
fs/btrfs/extent_io.c
894
struct btrfs_folio_state *prealloc)
fs/btrfs/extent_io.c
918
btrfs_free_folio_state(prealloc);
fs/btrfs/extent_io.c
922
if (prealloc)
fs/btrfs/extent_io.c
924
folio_attach_private(folio, prealloc);
fs/btrfs/extent_io.h
211
changeset->range_changed.prealloc = EXTENT_CHANGESET_BYTES_ONLY;
fs/btrfs/extent_io.h
216
return changeset->range_changed.prealloc != EXTENT_CHANGESET_BYTES_ONLY;
fs/btrfs/inode.c
3832
static int btrfs_add_inode_to_root(struct btrfs_inode *inode, bool prealloc)
fs/btrfs/inode.c
3842
if (prealloc) {
fs/btrfs/ioctl.c
3618
struct btrfs_qgroup_list AUTO_KFREE(prealloc);
fs/btrfs/ioctl.c
3640
prealloc = kzalloc_obj(*prealloc);
fs/btrfs/ioctl.c
3641
if (!prealloc) {
fs/btrfs/ioctl.c
3659
ret = btrfs_add_qgroup_relation(trans, sa->src, sa->dst, prealloc);
fs/btrfs/ioctl.c
3660
prealloc = NULL;
fs/btrfs/qgroup.c
1008
struct btrfs_qgroup *prealloc = NULL;
fs/btrfs/qgroup.c
1146
ASSERT(prealloc == NULL);
fs/btrfs/qgroup.c
1147
prealloc = kzalloc_obj(*prealloc, GFP_NOFS);
fs/btrfs/qgroup.c
1148
if (unlikely(!prealloc)) {
fs/btrfs/qgroup.c
1161
qgroup = add_qgroup_rb(fs_info, prealloc, found_key.offset);
fs/btrfs/qgroup.c
1162
prealloc = NULL;
fs/btrfs/qgroup.c
1203
ASSERT(prealloc == NULL);
fs/btrfs/qgroup.c
1204
prealloc = kzalloc_obj(*prealloc, GFP_NOFS);
fs/btrfs/qgroup.c
1205
if (!prealloc) {
fs/btrfs/qgroup.c
1209
qgroup = add_qgroup_rb(fs_info, prealloc, BTRFS_FS_TREE_OBJECTID);
fs/btrfs/qgroup.c
1210
prealloc = NULL;
fs/btrfs/qgroup.c
1301
kfree(prealloc);
fs/btrfs/qgroup.c
1566
struct btrfs_qgroup_list *prealloc)
fs/btrfs/qgroup.c
1574
ASSERT(prealloc);
fs/btrfs/qgroup.c
1578
kfree(prealloc);
fs/btrfs/qgroup.c
1613
ret = __add_relation_rb(prealloc, member, parent);
fs/btrfs/qgroup.c
1614
prealloc = NULL;
fs/btrfs/qgroup.c
1623
kfree(prealloc);
fs/btrfs/qgroup.c
1701
struct btrfs_qgroup *prealloc = NULL;
fs/btrfs/qgroup.c
1716
prealloc = kzalloc_obj(*prealloc, GFP_NOFS);
fs/btrfs/qgroup.c
1717
if (!prealloc) {
fs/btrfs/qgroup.c
1727
qgroup = add_qgroup_rb(fs_info, prealloc, qgroupid);
fs/btrfs/qgroup.c
1729
prealloc = NULL;
fs/btrfs/qgroup.c
1734
kfree(prealloc);
fs/btrfs/qgroup.c
202
struct btrfs_qgroup *prealloc,
fs/btrfs/qgroup.c
208
ASSERT(prealloc);
fs/btrfs/qgroup.c
210
prealloc->qgroupid = qgroupid;
fs/btrfs/qgroup.c
211
node = rb_find_add(&prealloc->node, &fs_info->qgroup_tree, btrfs_qgroup_qgroupid_cmp);
fs/btrfs/qgroup.c
213
kfree(prealloc);
fs/btrfs/qgroup.c
217
INIT_LIST_HEAD(&prealloc->groups);
fs/btrfs/qgroup.c
218
INIT_LIST_HEAD(&prealloc->members);
fs/btrfs/qgroup.c
219
INIT_LIST_HEAD(&prealloc->dirty);
fs/btrfs/qgroup.c
220
INIT_LIST_HEAD(&prealloc->iterator);
fs/btrfs/qgroup.c
221
INIT_LIST_HEAD(&prealloc->nested_iterator);
fs/btrfs/qgroup.c
223
return prealloc;
fs/btrfs/qgroup.c
271
static int __add_relation_rb(struct btrfs_qgroup_list *prealloc,
fs/btrfs/qgroup.c
276
kfree(prealloc);
fs/btrfs/qgroup.c
280
prealloc->group = parent;
fs/btrfs/qgroup.c
281
prealloc->member = member;
fs/btrfs/qgroup.c
282
list_add_tail(&prealloc->next_group, &member->groups);
fs/btrfs/qgroup.c
283
list_add_tail(&prealloc->next_member, &parent->members);
fs/btrfs/qgroup.c
298
struct btrfs_qgroup_list *prealloc,
fs/btrfs/qgroup.c
307
return __add_relation_rb(prealloc, member, parent);
fs/btrfs/qgroup.c
3355
struct btrfs_qgroup *prealloc;
fs/btrfs/qgroup.c
3365
prealloc = kzalloc_obj(*prealloc, GFP_NOFS);
fs/btrfs/qgroup.c
3366
if (!prealloc)
fs/btrfs/qgroup.c
3465
dstgroup = add_qgroup_rb(fs_info, prealloc, objectid);
fs/btrfs/qgroup.c
3466
prealloc = NULL;
fs/btrfs/qgroup.c
3595
kfree(prealloc);
fs/btrfs/qgroup.c
494
struct btrfs_qgroup *prealloc;
fs/btrfs/qgroup.c
497
prealloc = kzalloc_obj(*prealloc);
fs/btrfs/qgroup.c
498
if (!prealloc) {
fs/btrfs/qgroup.c
502
qgroup = add_qgroup_rb(fs_info, prealloc, found_key.offset);
fs/btrfs/qgroup.h
342
struct btrfs_qgroup_list *prealloc);
fs/btrfs/ulist.c
113
if (!ulist->prealloc)
fs/btrfs/ulist.c
114
ulist->prealloc = kzalloc_obj(*ulist->prealloc, gfp_mask);
fs/btrfs/ulist.c
218
if (ulist->prealloc) {
fs/btrfs/ulist.c
219
node = ulist->prealloc;
fs/btrfs/ulist.c
220
ulist->prealloc = NULL;
fs/btrfs/ulist.c
53
ulist->prealloc = NULL;
fs/btrfs/ulist.c
72
kfree(ulist->prealloc);
fs/btrfs/ulist.c
73
ulist->prealloc = NULL;
fs/btrfs/ulist.h
44
struct ulist_node *prealloc;
fs/ext4/extents_status.c
1484
struct extent_status *prealloc)
fs/ext4/extents_status.c
1537
err = __es_insert_extent(inode, &newes, prealloc);
fs/ext4/extents_status.c
180
struct extent_status *prealloc);
fs/ext4/extents_status.c
184
struct extent_status *prealloc);
fs/ext4/extents_status.c
190
struct pending_reservation **prealloc);
fs/ext4/extents_status.c
2076
struct pending_reservation **prealloc)
fs/ext4/extents_status.c
2102
if (likely(*prealloc == NULL)) {
fs/ext4/extents_status.c
2109
pr = *prealloc;
fs/ext4/extents_status.c
2110
*prealloc = NULL;
fs/ext4/extents_status.c
2315
struct pending_reservation **prealloc)
fs/ext4/extents_status.c
2346
ret = __insert_pending(inode, first, prealloc);
fs/ext4/extents_status.c
2358
ret = __insert_pending(inode, last, prealloc);
fs/ext4/extents_status.c
2371
ret = __insert_pending(inode, first, prealloc);
fs/ext4/extents_status.c
2383
ret = __insert_pending(inode, last, prealloc);
fs/ext4/extents_status.c
843
struct extent_status *prealloc)
fs/ext4/extents_status.c
883
if (prealloc)
fs/ext4/extents_status.c
884
es = prealloc;
fs/f2fs/data.c
1672
blkcnt_t prealloc;
fs/f2fs/data.c
1740
prealloc = 0;
fs/f2fs/data.c
1765
prealloc++;
fs/f2fs/data.c
1862
err = f2fs_reserve_new_blocks(&dn, prealloc);
fs/f2fs/data.c
1867
if (prealloc && dn.ofs_in_node != last_ofs_in_node + 1) {
fs/kernfs/file.c
680
if (ops->prealloc && ops->seq_show)
fs/kernfs/file.c
682
if (ops->prealloc) {
fs/namespace.c
2254
struct path *prealloc, unsigned count)
fs/namespace.c
2258
struct path *res = prealloc, *to_free = NULL;
fs/namespace.c
2287
void drop_collected_paths(const struct path *paths, const struct path *prealloc)
fs/namespace.c
2291
if (paths != prealloc)
fs/ntfs3/attrib.c
601
sbi->options->prealloc) {
fs/ntfs3/file.c
1418
if (ni->mi.sbi->options->prealloc) {
fs/ntfs3/ntfs_fs.h
110
unsigned prealloc : 1; /* Preallocate space when file is growing. */
fs/ntfs3/super.c
1871
opts->prealloc = 1;
fs/ntfs3/super.c
409
opts->prealloc = 1;
fs/ntfs3/super.c
412
opts->prealloc = result.boolean;
fs/ntfs3/super.c
788
if (opts->prealloc)
fs/pipe.c
134
static void anon_pipe_get_page_prealloc(struct anon_pipe_prealloc *prealloc,
fs/pipe.c
140
prealloc->count = 0;
fs/pipe.c
151
prealloc->pages[prealloc->count++] = page;
fs/pipe.c
155
static struct page *anon_pipe_prealloc_pop(struct anon_pipe_prealloc *prealloc)
fs/pipe.c
157
if (!prealloc->count)
fs/pipe.c
160
prealloc->count--;
fs/pipe.c
162
return prealloc->pages[prealloc->count];
fs/pipe.c
166
struct anon_pipe_prealloc *prealloc)
fs/pipe.c
171
page = anon_pipe_prealloc_pop(prealloc);
fs/pipe.c
207
struct anon_pipe_prealloc *prealloc)
fs/pipe.c
211
if (!prealloc->count)
fs/pipe.c
217
if (!prealloc->count)
fs/pipe.c
219
idx = --prealloc->count;
fs/pipe.c
220
pipe->tmp_page[i] = prealloc->pages[idx];
fs/pipe.c
221
prealloc->pages[idx] = NULL;
fs/pipe.c
226
static void anon_pipe_free_pages(struct anon_pipe_prealloc *prealloc)
fs/pipe.c
228
while (prealloc->count) {
fs/pipe.c
229
prealloc->count--;
fs/pipe.c
230
put_page(prealloc->pages[prealloc->count]);
fs/pipe.c
527
struct anon_pipe_prealloc prealloc;
fs/pipe.c
551
anon_pipe_get_page_prealloc(&prealloc, total_len);
fs/pipe.c
610
page = anon_pipe_get_page(pipe, &prealloc);
fs/pipe.c
674
anon_pipe_refill_tmp_pages(pipe, &prealloc);
fs/pipe.c
678
anon_pipe_free_pages(&prealloc);
fs/sysfs/file.c
241
.prealloc = true,
fs/sysfs/file.c
246
.prealloc = true,
fs/sysfs/file.c
252
.prealloc = true,
fs/xfs/xfs_dquot.c
125
int prealloc = 0;
fs/xfs/xfs_dquot.c
132
prealloc = 1;
fs/xfs/xfs_dquot.c
136
prealloc = 1;
fs/xfs/xfs_dquot.c
147
if (prealloc)
fs/xfs/xfs_iomap.c
1465
xfs_filblks_t prealloc,
fs/xfs/xfs_iomap.c
1478
whichfork == XFS_COW_FORK && !prealloc;
fs/xfs/xfs_iomap.c
1486
alen = XFS_FILBLKS_MIN(len + prealloc, XFS_MAX_BMBT_EXTLEN);
fs/xfs/xfs_iomap.c
1489
if (prealloc && alen >= len)
fs/xfs/xfs_iomap.c
1490
prealloc = alen - len;
fs/xfs/xfs_iomap.c
1558
if (whichfork == XFS_DATA_FORK && prealloc)
fs/xfs/xfs_iomap.c
1560
if (whichfork == XFS_COW_FORK && (prealloc || aoff < off || alen > len))
fs/xfs/xfs_iomap.c
1575
if (prealloc || use_cowextszhint) {
fs/xfs/xfs_iomap.c
1578
prealloc = 0;
include/linux/kernfs.h
322
bool prealloc;
kernel/bpf/hashtab.c
1082
bool prealloc = htab_is_prealloc(htab);
kernel/bpf/hashtab.c
1086
if (prealloc) {
kernel/bpf/hashtab.c
1122
if (prealloc) {
kernel/bpf/hashtab.c
1139
if (!prealloc)
kernel/bpf/hashtab.c
2323
bool prealloc = htab_is_prealloc(htab);
kernel/bpf/hashtab.c
2331
if (prealloc) {
kernel/bpf/hashtab.c
424
bool prealloc = !(attr->map_flags & BPF_F_NO_PREALLOC);
kernel/bpf/hashtab.c
442
if (lru && !prealloc)
kernel/bpf/hashtab.c
555
bool prealloc = !(attr->map_flags & BPF_F_NO_PREALLOC);
kernel/bpf/hashtab.c
638
if (prealloc) {
lib/stackdepot.c
293
static bool depot_init_pool(void **prealloc)
lib/stackdepot.c
306
if (!new_pool && *prealloc) {
lib/stackdepot.c
308
WRITE_ONCE(new_pool, *prealloc);
lib/stackdepot.c
309
*prealloc = NULL;
lib/stackdepot.c
341
static void depot_keep_new_pool(void **prealloc)
lib/stackdepot.c
353
WRITE_ONCE(new_pool, *prealloc);
lib/stackdepot.c
354
*prealloc = NULL;
lib/stackdepot.c
361
static struct stack_record *depot_pop_free_pool(void **prealloc, size_t size)
lib/stackdepot.c
371
if (!depot_init_pool(prealloc))
lib/stackdepot.c
434
depot_alloc_stack(unsigned long *entries, unsigned int nr_entries, u32 hash, depot_flags_t flags, void **prealloc)
lib/stackdepot.c
462
stack = depot_pop_free_pool(prealloc, record_size);
lib/stackdepot.c
650
void *prealloc = NULL;
lib/stackdepot.c
688
prealloc = page_address(page);
lib/stackdepot.c
706
depot_alloc_stack(entries, nr_entries, hash, depot_flags, &prealloc);
lib/stackdepot.c
718
if (prealloc) {
lib/stackdepot.c
724
depot_keep_new_pool(&prealloc);
lib/stackdepot.c
730
if (prealloc) {
lib/stackdepot.c
733
free_pages_nolock(virt_to_page(prealloc), DEPOT_POOL_ORDER);
lib/stackdepot.c
735
free_pages((unsigned long)prealloc, DEPOT_POOL_ORDER);
mm/memory.c
1065
struct folio **prealloc, struct page *page)
mm/memory.c
1070
new_folio = *prealloc;
mm/memory.c
1082
*prealloc = NULL;
mm/memory.c
1131
int max_nr, int *rss, struct folio **prealloc)
mm/memory.c
1149
if (unlikely(!*prealloc && folio_test_large(folio) && max_nr != 1)) {
mm/memory.c
1186
addr, rss, prealloc, page);
mm/memory.c
1238
struct folio *prealloc = NULL;
mm/memory.c
1321
ptent, addr, max_nr, rss, &prealloc);
mm/memory.c
1329
if (unlikely(prealloc)) {
mm/memory.c
1336
folio_put(prealloc);
mm/memory.c
1337
prealloc = NULL;
mm/memory.c
1360
prealloc = folio_prealloc(src_mm, src_vma, addr, false);
mm/memory.c
1361
if (!prealloc)
mm/memory.c
1373
if (unlikely(prealloc))
mm/memory.c
1374
folio_put(prealloc);
net/sched/sch_gred.c
484
struct gred_sched_data **prealloc,
net/sched/sch_gred.c
496
table->tab[dp] = q = *prealloc;
net/sched/sch_gred.c
497
*prealloc = NULL;
net/sched/sch_gred.c
651
struct gred_sched_data *prealloc;
net/sched/sch_gred.c
703
prealloc = kzalloc_obj(*prealloc);
net/sched/sch_gred.c
706
err = gred_change_vq(sch, ctl->DP, ctl, prio, stab, max_P, &prealloc,
net/sched/sch_gred.c
721
kfree(prealloc);
net/sched/sch_gred.c
728
kfree(prealloc);