/linux-4.1.27/arch/m68k/sun3/ |
H A D | sun3dvma.c | 41 struct hole { struct 50 static struct hole initholes[64]; 89 struct hole *hole; print_holes() local 93 hole = list_entry(cur, struct hole, list); list_for_each() 95 if((hole->start == 0) && (hole->end == 0) && (hole->size == 0)) list_for_each() 98 printk("hole: start %08lx end %08lx size %08lx\n", hole->start, hole->end, hole->size); list_for_each() 101 printk("end of hole listing...\n"); 109 struct hole *hole; refill() local 110 struct hole *prev = NULL; refill() 115 hole = list_entry(cur, struct hole, list); refill() 118 prev = hole; refill() 122 if(hole->end == prev->start) { refill() 123 hole->size += prev->size; refill() 124 hole->end = prev->end; refill() 134 static inline struct hole *rmcache(void) rmcache() 136 struct hole *ret; rmcache() 140 printk("out of dvma hole cache!\n"); rmcache() 145 ret = list_entry(hole_cache.next, struct hole, list); rmcache() 156 struct hole *hole; get_baddr() local 160 printk("out of dvma holes! (printing hole cache)\n"); get_baddr() 170 hole = list_entry(cur, struct hole, list); get_baddr() 173 newlen = len + ((hole->end - len) & (align-1)); get_baddr() 177 if(hole->size > newlen) { get_baddr() 178 hole->end -= newlen; get_baddr() 179 hole->size -= newlen; get_baddr() 180 dvma_entry_use(hole->end) = newlen; get_baddr() 185 return hole->end; get_baddr() 186 } else if(hole->size == newlen) { get_baddr() 187 list_move(&(hole->list), &hole_cache); get_baddr() 188 dvma_entry_use(hole->start) = newlen; get_baddr() 193 return hole->start; get_baddr() 198 printk("unable to find dvma hole!\n"); get_baddr() 207 struct hole *hole; free_baddr() local 223 hole = list_entry(cur, struct hole, list); free_baddr() 225 if(hole->end == baddr) { free_baddr() 226 hole->end += len; free_baddr() 227 hole->size += len; free_baddr() 229 } else if(hole->start == (baddr + len)) { free_baddr() 230 hole->start = baddr; free_baddr() 231 hole->size += len; free_baddr() 237 hole = rmcache(); free_baddr() 239 hole->start = baddr; free_baddr() 240 hole->end = baddr + len; free_baddr() 241 hole->size = len; free_baddr() 243 // list_add_tail(&(hole->list), cur); free_baddr() 244 list_add(&(hole->list), cur); free_baddr() 253 struct hole *hole; dvma_init() local 259 /* prepare the hole cache */ dvma_init() 263 hole = rmcache(); dvma_init() 264 hole->start = DVMA_START; dvma_init() 265 hole->end = DVMA_END; dvma_init() 266 hole->size = DVMA_SIZE; dvma_init() 268 list_add(&(hole->list), &hole_list); dvma_init()
|
/linux-4.1.27/drivers/gpu/drm/radeon/ |
H A D | radeon_sa.c | 32 * We store the last allocated bo in "hole", we always try to allocate 61 sa_manager->hole = &sa_manager->olist; radeon_sa_bo_manager_init() 83 sa_manager->hole = &sa_manager->olist, radeon_sa_bo_manager_fini() 145 if (sa_manager->hole == &sa_bo->olist) { radeon_sa_bo_remove_locked() 146 sa_manager->hole = sa_bo->olist.prev; radeon_sa_bo_remove_locked() 158 if (sa_manager->hole->next == &sa_manager->olist) radeon_sa_bo_try_free() 161 sa_bo = list_entry(sa_manager->hole->next, struct radeon_sa_bo, olist); radeon_sa_bo_try_free() 172 struct list_head *hole = sa_manager->hole; radeon_sa_bo_hole_soffset() local 174 if (hole != &sa_manager->olist) { radeon_sa_bo_hole_soffset() 175 return list_entry(hole, struct radeon_sa_bo, olist)->eoffset; radeon_sa_bo_hole_soffset() 182 struct list_head *hole = sa_manager->hole; radeon_sa_bo_hole_eoffset() local 184 if (hole->next != &sa_manager->olist) { radeon_sa_bo_hole_eoffset() 185 return list_entry(hole->next, struct radeon_sa_bo, olist)->soffset; radeon_sa_bo_hole_eoffset() 206 list_add(&sa_bo->olist, sa_manager->hole); radeon_sa_bo_try_alloc() 208 sa_manager->hole = &sa_bo->olist; radeon_sa_bo_try_alloc() 254 /* if hole points to the end of the buffer */ radeon_sa_bo_next_hole() 255 if (sa_manager->hole->next == &sa_manager->olist) { radeon_sa_bo_next_hole() 257 sa_manager->hole = &sa_manager->olist; radeon_sa_bo_next_hole() 302 sa_manager->hole = best_bo->olist.prev; radeon_sa_bo_next_hole() 409 if (&i->olist == sa_manager->hole) { radeon_sa_bo_dump_debug_info()
|
/linux-4.1.27/fs/ext3/ |
H A D | namei.h | 22 "Directory hole detected on inode %lu\n", ext3_dir_bread()
|
H A D | dir.c | 141 "contains a hole at offset %lld", ext3_readdir()
|
/linux-4.1.27/arch/blackfin/kernel/cplb-nompu/ |
H A D | cplbinit.c | 150 /* Addressing hole up to the async bank. */ generate_cplb_tables_all() 156 /* Addressing hole up to BootROM. */ generate_cplb_tables_all() 163 /* Addressing hole up to L2 SRAM. */ generate_cplb_tables_all() 180 /* Normally this hole is caught by the async below. */ generate_cplb_tables_all() 189 /* Addressing hole up to the async bank. */ generate_cplb_tables_all() 195 /* Addressing hole up to BootROM. */ generate_cplb_tables_all() 203 /* Addressing hole up to L2 SRAM. */ generate_cplb_tables_all()
|
/linux-4.1.27/include/drm/ |
H A D | drm_mm.h | 77 /* List of all memory nodes that immediately precede a free hole. */ 133 * drm_mm_hole_node_start - computes the start of the hole following @node 134 * @hole_node: drm_mm_node which implicitly tracks the following hole 137 * inspect holes themselves. Drivers must check first whether a hole indeed 141 * Start of the subsequent hole. 156 * drm_mm_hole_node_end - computes the end of the hole following @node 157 * @hole_node: drm_mm_node which implicitly tracks the following hole 160 * inspect holes themselves. Drivers must check first whether a hole indeed 164 * End of the subsequent hole. 187 * @hole_start: ulong variable to assign the hole start to on each iteration 188 * @hole_end: ulong variable to assign the hole end to on each iteration 192 * internally and will not reflect a real drm_mm_node for the very first hole. 244 * 0 on success, -ENOSPC if there's no suitable hole. 281 * 0 on success, -ENOSPC if there's no suitable hole.
|
/linux-4.1.27/arch/x86/include/asm/ |
H A D | pgtable_32_types.h | 21 * current 8MB value just means that there will be a 8MB "hole" after the 24 * The vmalloc() routines leaves a hole of 4kB between each vmalloced
|
H A D | timer.h | 31 /* u32 hole */
|
/linux-4.1.27/drivers/pinctrl/nomadik/ |
H A D | pinctrl-ab8505.c | 23 /* hole */ 26 /* hole */ 29 /* hole */ 34 /* hole */ 36 /* hole */ 39 /* hole */ 41 /* hole */ 58 /* hole */ 61 /* hole */ 64 /* hole */ 69 /* hole */ 71 /* hole */ 74 /* hole */ 76 /* hole */
|
H A D | pinctrl-ab8540.c | 24 /* hole */ 32 /* hole */ 39 /* hole */ 47 /* hole */ 69 /* hole */ 77 /* hole */ 84 /* hole */ 92 /* hole */
|
H A D | pinctrl-ab9540.c | 24 /* hole */ 27 /* hole */ 41 /* hole */ 48 /* hole */ 50 /* hole */ 74 /* hole */ 77 /* hole */ 91 /* hole */ 98 /* hole */ 100 /* hole */
|
H A D | pinctrl-ab8500.c | 24 /* hole */ 52 /* hole */ 77 /* hole */ 105 /* hole */
|
/linux-4.1.27/include/uapi/linux/ |
H A D | falloc.h | 10 * without leaving a hole in the file. The contents of the file beyond 12 * being removed (i.e. the hole that was punched is "collapsed"), 47 * shifted towards right by len bytes to create a hole. As such, this
|
H A D | fs.h | 35 #define SEEK_HOLE 4 /* seek to the next hole */
|
/linux-4.1.27/net/sched/ |
H A D | sch_blackhole.c | 2 * net/sched/sch_blackhole.c Black hole queue
|
H A D | sch_choke.c | 117 /* Drop packet from queue array by creating a "hole" */ choke_drop_by_idx()
|
/linux-4.1.27/arch/x86/mm/ |
H A D | pgtable_32.c | 75 /* Add VMALLOC_OFFSET to the parsed value due to vm area guard hole*/ parse_vmalloc() 82 * reservetop=size reserves a hole at the top of the kernel address space which
|
H A D | mmap.c | 52 * Leave an at least ~128 MB hole with possible stack randomization.
|
H A D | pgtable.c | 529 * reserve_top_address - reserves a hole in the top of kernel address space 530 * @reserve - size of hole to reserve 532 * Can be used to relocate the fixmap area and poke a hole in the top
|
H A D | mpx.c | 625 * will be a hole in the bounds table. This -EINVAL return will zap_bt_entries() 775 * is guaranteed to be in a hole. This gets us the first VMA unmap_edge_bts() 776 * before the hole in to 'prev' and the next VMA after the hole unmap_edge_bts()
|
H A D | init.c | 426 * That range would have hole in the middle or ends, and only ram parts
|
/linux-4.1.27/arch/tile/include/asm/ |
H A D | fixmap.h | 49 * TILEPro has unmapped memory above so the hole isn't needed, 50 * and in any case the hole pushes us over a single 16MB pmd.
|
H A D | pci.h | 126 * This design lets us avoid the "PCI hole" problem where the host bridge pci_iounmap()
|
/linux-4.1.27/fs/btrfs/tests/ |
H A D | inode-tests.c | 89 * [hole ][inline][ hole ][ regular ][regular1 split][ hole ] 95 * [ compressed1 ][ regular ][compressed1][ regular ][ hole but no extent] 106 /* First we want a hole */ setup_file_extents() 123 /* Now another hole */ setup_file_extents() 137 * Now for 3 extents that were split from a hole punch so we test setup_file_extents() 168 * the hole punch example above. Ram_bytes never changes when you mark setup_file_extents() 208 /* Now extents that have a hole but no hole extent */ setup_file_extents() 282 test_msg("Expected a hole, got %llu\n", em->block_start); test_btrfs_get_extent() 305 test_msg("Expected a hole, got %llu\n", em->block_start); test_btrfs_get_extent() 352 test_msg("Expected a hole, got %llu\n", em->block_start); test_btrfs_get_extent() 429 test_msg("Expected a hole, got %llu\n", em->block_start); test_btrfs_get_extent() 726 /* A hole between regular extents but no hole extent */ test_btrfs_get_extent() 759 test_msg("Expected a hole extent, got %llu\n", em->block_start); test_btrfs_get_extent() 764 * length of the actual hole, if this changes we'll have to change this test_btrfs_get_extent() 871 test_msg("Expected a hole, got %llu\n", em->block_start); test_hole_first() 1061 * Refill the hole again just for good measure, because I thought it test_extent_accounting() 1117 test_msg("Running hole first btrfs_get_extent test\n"); btrfs_test_inodes()
|
/linux-4.1.27/drivers/gpu/drm/ |
H A D | drm_mm.c | 177 * 0 on success, -ENOSPC if there's no hole where @node is. 181 struct drm_mm_node *hole; drm_mm_reserve_node() local 188 /* Find the relevant hole to add our node to */ drm_mm_for_each_hole() 189 drm_mm_for_each_hole(hole, mm, hole_start, hole_end) { drm_mm_for_each_hole() 197 list_add(&node->node_list, &hole->node_list); drm_mm_for_each_hole() 200 hole->hole_follows = 0; drm_mm_for_each_hole() 201 list_del_init(&hole->hole_stack); drm_mm_for_each_hole() 230 * 0 on success, -ENOSPC if there's no suitable hole. 330 * 0 on success, -ENOSPC if there's no suitable hole. 534 * until there's a suitable hole: Especially for big objects or nodes that 542 * freely implemented) until a suitable hole is found or there's no further 564 * hole. Note that there's no need to specify allocation flags, since they only 565 * change the place a node is allocated from within a suitable hole. 597 * hole. Note that there's no need to specify allocation flags, since they only 598 * change the place a node is allocated from within a suitable hole. 629 * hole. 632 * True if a hole has been found, false otherwise. 695 * return false when no hole has been found. 747 /* Clever trick to avoid a special case in the free hole tracking. */ drm_mm_init()
|
/linux-4.1.27/drivers/net/wireless/ath/ath6kl/ |
H A D | debug.h | 26 /* hole */ 33 /* hole */ 34 /* hole */
|
H A D | hif.c | 423 * + sizeof(hole) + sizeof(rx_lkahd) + proc_pending_irqs()
|
/linux-4.1.27/arch/powerpc/platforms/embedded6xx/ |
H A D | wii.c | 75 * single range, then create a reservation for the "hole" wii_memory_fixups() 86 /* determine hole, add & reserve them */ wii_memory_fixups() 95 /* allow ioremapping the address space in the hole */ wii_memory_fixups()
|
/linux-4.1.27/arch/x86/boot/ |
H A D | memory.c | 98 * hole there. If someone actually finds a machine detect_memory_e801() 99 * with a memory hole at 16MB and no support for detect_memory_e801()
|
/linux-4.1.27/arch/mips/include/asm/mach-cavium-octeon/ |
H A D | cpu-feature-overrides.h | 85 * BAR1 hole.
|
/linux-4.1.27/arch/mips/include/asm/mach-malta/ |
H A D | spaces.h | 29 * 2GB of memory (0x80000000 - 0xffffffff) so we can avoid the I/O hole in
|
/linux-4.1.27/fs/ext4/ |
H A D | readpage.c | 21 * - encountering a page which has a non-hole after a hole 234 goto confused; /* hole -> non-hole */ ext4_mpage_readpages()
|
H A D | file.c | 68 * Ext4 utilizes unwritten extents when hole-filling during direct IO, and they 324 * we determine this extent as a data or a hole according to whether the 365 * hole at this offset ext4_find_unwritten_pgoff() 375 * hole at this offset. ext4_find_unwritten_pgoff() 389 * range, it will be a hole. ext4_find_unwritten_pgoff() 439 * hole in there. ext4_find_unwritten_pgoff() 506 * it will be as a data or a hole according to page ext4_seek_data() 579 * it will be as a data or a hole according to page ext4_seek_hole() 593 /* find a hole */ ext4_seek_hole()
|
H A D | extents_status.c | 51 * hole extents in the tree will be reclaimed by this shrinker when we 53 * reclimed because fiemap, bigalloc, and seek_data/hole need it. 119 * memory. Hence, we will reclaim written/unwritten/hole extents from 490 * a delayed/hole extent. ext4_es_insert_extent_ext_check() 497 "want to add a delayed/hole extent " ext4_es_insert_extent_ext_check() 569 * We want to add a delayed/hole extent but this ext4_es_insert_extent_ind_check() 574 "delayed/hole extent [%d/%d/%llu/%x]\n", ext4_es_insert_extent_ind_check() 1265 * fiemap, bigallic, and seek_data/hole need to use it. es_do_reclaim_extents()
|
H A D | move_extent.c | 632 /* Check hole before the start pos */ ext4_move_extents() 642 /* Check hole after the start pos */ ext4_move_extents() 644 /* Skip hole */ ext4_move_extents()
|
H A D | extents.c | 2548 * delete if we determine that the truncate or punch hole ext4_remove_blocks() 2644 /* If this extent is beyond the end of the hole, skip it */ ext4_ext_rm_leaf() 2721 * For hole punching, we need to scoot all the ext4_ext_rm_leaf() 2819 * is the case, we are going to punch a hole inside the extent tree ext4_ext_remove_space() 3345 EXT4_ERROR_INODE(inode, "unexpected hole at %lu", ext4_split_extent() 3970 EXT4_ERROR_INODE(inode, "unexpected hole at %lu", convert_initialized_extent() 5080 * then the block may stay in 1)a hole or 2)delayed-extent. ext4_find_delayed_extent() 5083 /* A hole found. */ ext4_find_delayed_extent() 5087 /* A hole found. */ ext4_find_delayed_extent() 5331 /* Nothing to shift, if hole is at the end of file */ ext4_ext_shift_extents() 5336 * Don't start shifting extents until we make sure the hole is big ext4_ext_shift_extents() 5365 EXT4_ERROR_INODE(inode, "unexpected hole at %lu", ext4_ext_shift_extents() 5607 /* if hole after extent, then go to next extent */ ext4_swap_extents() 5610 /* If hole before extent, then shift to that extent */ ext4_swap_extents()
|
H A D | page-io.c | 470 /* A hole? We can safely clear the dirty bit */ ext4_bio_write_page()
|
H A D | inode.c | 861 * To preserve ordering, it is essential that the hole instantiation and 3140 * Allocated blocks to fill the hole are marked as ext4_ext_direct_IO() 3401 /* unmapped? It's a hole - nothing to do */ __ext4_block_zero_page_range() 3549 * page cache due to hole punching or zero range. Otherwise i_disksize update 3577 * ext4_punch_hole: punches a hole in a file by releaseing the blocks 3581 * @offset: The offset where the hole will begin 3582 * @len: The length of the hole 3615 /* No need to punch hole beyond i_size */ ext4_punch_hole() 3620 * If the hole extends beyond i_size, set the hole ext4_punch_hole() 5336 /* OK, we need to fill the hole... */ ext4_page_mkwrite()
|
/linux-4.1.27/fs/ntfs/ |
H A D | runlist.c | 203 * the new runlist, if necessary. Adjust the size of the hole before the 251 /* Adjust the size of the preceding hole. */ ntfs_rl_append() 270 * left end of the new runlist, if necessary. Adjust the size of the hole 447 * ntfs_rl_split - insert a runlist into the centre of a hole 476 /* Space required: @dst size + @src size + one new hole. */ ntfs_rl_split() 504 * runlist @drl or completely within a hole (or unmapped region) in @drl. 510 * 2. When new clusters are allocated to fill a hole or extend a file. 513 * - be inserted at the beginning of a hole, 514 * - split the hole in two and be inserted between the two fragments, 515 * - be appended at the end of a hole, or it can 516 * - replace the whole hole. 629 (drl[dins].vcn == srl[sstart].vcn)); /* Start of hole */ ntfs_runlists_merge() 631 ((drl[dins].vcn + drl[dins].length) <= /* End of hole */ ntfs_runlists_merge() 873 * indicate a hole. But we haven't verified ourselves ntfs_mapping_pairs_decompress() 1177 * If the logical cluster number (lcn) denotes a hole and we ntfs_get_size_for_mapping_pairs() 1212 * If the logical cluster number (lcn) denotes a hole and we ntfs_get_size_for_mapping_pairs() 1382 * If the logical cluster number (lcn) denotes a hole and we ntfs_mapping_pairs_build() 1433 * If the logical cluster number (lcn) denotes a hole and we ntfs_mapping_pairs_build() 1624 * ntfs_rl_punch_nolock - punch a hole into a runlist 1626 * @runlist: runlist to punch a hole into 1627 * @start: starting VCN of the hole to be created 1628 * @length: size of the hole to be created in units of clusters 1630 * Punch a hole into the runlist @runlist starting at VCN @start and of size 1691 /* If @start is in a hole simply extend the hole. */ ntfs_rl_punch_nolock() 1698 ntfs_debug("Done (requested hole is already sparse)."); ntfs_rl_punch_nolock() 1702 /* Extend the hole. */ ntfs_rl_punch_nolock() 1704 /* If @end is in a hole, merge it with the current one. */ ntfs_rl_punch_nolock() 1709 /* We have done the hole. Now deal with the remaining tail. */ ntfs_rl_punch_nolock() 1738 ntfs_debug("Done (extend hole)."); ntfs_rl_punch_nolock() 1749 * If the previous run is sparse, extend its hole. ntfs_rl_punch_nolock() 1752 * and extend the newly created hole. ntfs_rl_punch_nolock() 1755 * case of "@start is in a hole". ntfs_rl_punch_nolock() 1798 * @start is neither in a hole nor at the beginning of a run. ntfs_rl_punch_nolock() 1800 * If @end is in a hole, things are easier as simply truncating the run ntfs_rl_punch_nolock() 1819 * If @end is not in a hole there are still two cases to distinguish. ntfs_rl_punch_nolock() 1827 * problem to the already covered case of "@start is in a hole". ntfs_rl_punch_nolock() 1832 * case of "@start is in a hole". ntfs_rl_punch_nolock()
|
H A D | runlist.h | 40 * physically allocated (i.e. this is a hole / data is sparse).
|
H A D | aops.c | 292 /* It is a hole, need to zero it. */ ntfs_read_block() 311 * hole. This can happen due to concurrent truncate ntfs_read_block() 742 /* It is a hole, need to instantiate it. */ ntfs_write_block() 765 // TODO: Instantiate the hole. ntfs_write_block() 1596 * the initialized size then pretend it is a hole unless the ntfs_bmap() 1600 goto hole; ntfs_bmap() 1619 * hole. ntfs_bmap() 1621 goto hole; ntfs_bmap() 1636 /* It is a hole. */ ntfs_bmap() 1637 hole: ntfs_bmap() 1638 ntfs_debug("Done (returning hole)."); ntfs_bmap()
|
H A D | file.c | 577 * the cluster is sparse, i.e. we need to allocate a cluster to fill the hole. 884 * If it is not a hole and not out of bounds, the runlist is ntfs_prepare_pages_for_non_resident_write() 938 * The buffer is in a hole or out of bounds. We need to fill ntfs_prepare_pages_for_non_resident_write() 939 * the hole, unless the buffer is in a cluster which is not ntfs_prepare_pages_for_non_resident_write() 1072 * extent, i.e. the old extent with the hole filled. ntfs_prepare_pages_for_non_resident_write() 1120 ntfs_error(vol->sb, "Cannot fill hole in inode 0x%lx, " ntfs_prepare_pages_for_non_resident_write() 1167 /* Successfully filled the hole. */ ntfs_prepare_pages_for_non_resident_write() 1268 * hole into it and we then need to deallocate the on-disk cluster as ntfs_prepare_pages_for_non_resident_write() 1277 ntfs_error(vol->sb, "Failed to punch hole into " ntfs_prepare_pages_for_non_resident_write() 1808 * it is a hole, need to lock down all pages in ntfs_perform_write()
|
/linux-4.1.27/fs/ |
H A D | dax.c | 90 * When ext4 encounters a hole, it returns without modifying the buffer_head 93 * b_size. Unfortunate, really, since ext4 knows precisely how long a hole is 110 bool hole = false; dax_io() local 140 hole = iov_iter_rw(iter) != WRITE && !buffer_written(bh); dax_io() 141 if (hole) { dax_io() 159 else if (!hole) dax_io() 229 * The user has performed a load from a hole in the file. Allocating 353 * We have a struct page covering a hole in the file do_dax_fault() 499 * page in a DAX file. This is intended for hole-punch operations. If
|
H A D | mpage.c | 230 goto confused; /* hole -> non-hole */ do_mpage_readpage() 328 * - encountering a page which has a non-hole after a hole 507 goto confused; /* hole -> non-hole */ __mpage_writepage() 529 * created by pagein or read over a hole which was handled by __mpage_writepage()
|
H A D | ioctl.c | 240 * go past the end of the file and hit a hole. 242 * If it is possible to have data blocks beyond a hole past @inode->i_size, then 314 * First hole after going past the EOF, this is our __generic_block_fiemap() 339 * the last block is a hole, making the second to last __generic_block_fiemap() 341 * see if there is a hole after the second to last block __generic_block_fiemap() 375 * soon as we find a hole that the last extent we found __generic_block_fiemap()
|
H A D | open.c | 237 /* Punch hole and zero range are mutually exclusive */ vfs_fallocate() 242 /* Punch hole must have keep size set */ vfs_fallocate()
|
H A D | read_write.c | 120 * There is a virtual hole at the end of the file, so as long as generic_file_llseek_size() 226 * There is a virtual hole at the end of the file, so default_llseek()
|
/linux-4.1.27/drivers/gpu/drm/amd/amdkfd/ |
H A D | kfd_flat_memory.c | 85 * so the actual VA carried to translation is 48b. There is a “hole” in 92 * to map the full 40b GPUVM address space into the hole of the 64b address 158 * the hole (cannot be in the hole). 180 * A memory violation results when an op falls into the hole, 216 * options in the hole of the 64b address space. For HSA32 mode, the 224 * in the hole w/ a limited selection of possible locations. The requests 243 * to HSA64 mode where they are always in the hole at a limited selection
|
/linux-4.1.27/fs/jffs2/ |
H A D | nodelist.c | 166 * Called when there is no overlapping fragment exist. Inserts a hole before the new 174 /* put a hole in before the new fragment */ no_overlapping_node() 186 So that's where we want to put the hole */ no_overlapping_node() 187 dbg_fragtree2("add hole frag %#04x-%#04x on the right of the new frag.\n", no_overlapping_node() 191 dbg_fragtree2("Add hole frag %#04x-%#04x to the root of the tree.\n", no_overlapping_node() 254 dbg_fragtree2("dealing with hole frag %u-%u.\n", jffs2_add_frag_to_fragtree() 277 dbg_fragtree2("split old hole frag 0x%04x-0x%04x\n", jffs2_add_frag_to_fragtree() 572 /* Not a hole, and it's the final remaining frag rbtree_postorder_for_each_entry_safe()
|
H A D | read.c | 63 /* There was a bug where we wrote hole nodes out with csize/dsize jffs2_read_dnode() 185 jffs2_dbg(1, "Filling non-frag hole from %d-%d\n", jffs2_read_inode_range() 193 jffs2_dbg(1, "Filling frag hole from %d-%d (frag 0x%x 0x%x)\n", jffs2_read_inode_range()
|
H A D | debug.c | 93 /* A hole node which isn't multi-page should be garbage-collected __jffs2_dbg_fragtree_paranoia_check_nolock() 97 to tell a hole node. */ __jffs2_dbg_fragtree_paranoia_check_nolock() 100 JFFS2_ERROR("REF_PRISTINE node at 0x%08x had a previous non-hole frag in the same page. Tell dwmw2.\n", __jffs2_dbg_fragtree_paranoia_check_nolock() 107 JFFS2_ERROR("REF_PRISTINE node at 0x%08x (%08x-%08x) had a following non-hole frag in the same page. Tell dwmw2.\n", __jffs2_dbg_fragtree_paranoia_check_nolock() 717 printk(JFFS2_DBG "frag %#04x-%#04x: hole (*%p). left (%p), right (%p), parent (%p)\n", __jffs2_dbg_dump_fragtree_nolock() 730 JFFS2_ERROR("frag tree got a hole in it.\n"); __jffs2_dbg_dump_fragtree_nolock()
|
H A D | file.c | 152 /* Make new hole frag from old EOF to new page */ jffs2_write_begin() 158 jffs2_dbg(1, "Writing new hole frag 0x%x-0x%x between current EOF and new page\n", jffs2_write_begin()
|
H A D | gc.c | 536 /* It crosses a page boundary. Therefore, it must be a hole. */ jffs2_garbage_collect_live() 539 /* It could still be a hole. But we GC the page this way anyway */ jffs2_garbage_collect_live() 1003 jffs2_dbg(1, "Writing replacement hole node for ino #%u from offset 0x%x to 0x%x\n", jffs2_garbage_collect_hole() 1015 pr_warn("Node read failed in jffs2_garbage_collect_hole. Ret %d, retlen %zd. Data will be lost by writing new hole node\n", jffs2_garbage_collect_hole() 1042 pr_warn("%s(): Node 0x%08x wasn't a hole node!\n", jffs2_garbage_collect_hole() 1091 pr_warn("Error writing new hole node: %ld\n", PTR_ERR(new_fn)); jffs2_garbage_collect_hole() 1116 /* This is a partially-overlapped hole node. Mark it REF_NORMAL not REF_PRISTINE */ jffs2_garbage_collect_hole() 1197 jffs2_dbg(1, "First frag in page is hole (0x%x-0x%x). Not expanding down.\n", jffs2_garbage_collect_dnode() 1253 jffs2_dbg(1, "Last frag in page is hole (0x%x-0x%x). Not expanding up.\n", jffs2_garbage_collect_dnode()
|
H A D | fs.c | 122 /* It's an extension. Make it a hole node */ jffs2_do_setattr()
|
H A D | write.c | 173 it's a hole node, mark it REF_PRISTINE, else REF_NORMAL. jffs2_write_dnode()
|
/linux-4.1.27/arch/m68k/include/asm/ |
H A D | pgtable_mm.h | 94 * current 8MB value just means that there will be a 8MB "hole" after the 97 * The vmalloc() routines leaves a hole of 4kB between each vmalloced
|
/linux-4.1.27/arch/sh/lib64/ |
H A D | sdivsi3.S | 18 shari r25, 58, r21 /* extract 5(6) bit index (s2.4 with hole -1..1) */
|
/linux-4.1.27/arch/tile/mm/ |
H A D | mmap.c | 27 * Leave an at least ~128 MB hole.
|
/linux-4.1.27/include/net/ |
H A D | fib_rules.h | 20 /* 3 bytes hole, try to use */
|
H A D | inet_timewait_sock.h | 86 tw_pad : 2, /* 2 bits hole */
|
H A D | request_sock.h | 132 /* 2 bytes hole, try to use */
|
H A D | inet_hashtables.h | 135 /* 4 bytes hole on 64 bit */
|
/linux-4.1.27/arch/s390/kernel/ |
H A D | compat_ptrace.h | 25 /* nb: there's a 4-byte hole here */
|
H A D | ptrace.c | 236 * prevent reads of padding hole between __peek_user() 378 * prevent writes of padding hole between __poke_user() 615 * prevent reads of padding hole between __peek_user_compat() 738 * prevent writess of padding hole between __poke_user_compat()
|
/linux-4.1.27/arch/ia64/include/asm/ |
H A D | meminit.h | 62 # define LARGE_GAP 0x40000000 /* Use virtual mem map if hole is > than this */
|
/linux-4.1.27/fs/xfs/ |
H A D | xfs_file.c | 419 * If the block underlying isize is just a hole, then there xfs_zero_last_block() 982 * Perform hole insertion now that the file size has been xfs_file_fallocate() 1134 * This routine is called to find out and return a data or hole offset 1179 * that the given offset is landed in a hole, return it. xfs_find_get_desired_pgoff() 1185 * that means there should be a hole between them. xfs_find_get_desired_pgoff() 1203 * greater than the given search offset, a hole was found. xfs_find_get_desired_pgoff() 1224 * the specified search range, there should be a hole xfs_find_get_desired_pgoff() 1265 * searching hole but found a data buffer. In either xfs_find_get_desired_pgoff() 1276 * but we found a hole behind the last offset. xfs_find_get_desired_pgoff() 1349 /* Landed in the hole we wanted? */ xfs_seek_hole_data() 1363 * for hole or data from page cache. xfs_seek_hole_data() 1379 * If we were looking for a hole, set offset to xfs_seek_hole_data() 1381 * hole at the end of any file). xfs_seek_hole_data() 1416 * If at this point we have found the hole we wanted, the returned xfs_seek_hole_data()
|
H A D | xfs_bmap_util.h | 57 /* preallocation and hole punch interface */
|
H A D | xfs_bmap_util.c | 462 /* Came to hole at EOF. Trim it. */ xfs_getbmapx_fix_eof_hole() 681 * In case we don't want to return the hole, xfs_getbmap() 747 * transaction) or a hole, which is probably a bad idea... xfs_bmap_punch_delalloc_range() 831 * punching a hole to EOF. 1357 * Punch a hole and prealloc the range. We use hole punch rather than xfs_zero_file_space() 1363 * by virtue of the hole punch. xfs_zero_file_space() 1459 * hole we found that adjacent extents can be merged which xfs_shift_file_space() 1511 * is working. And Shift extent records to the left to cover a hole. 1537 * This routine create hole space by shifting extents for the given file. 1542 * last allocated extent] to the right to reserve hole range.
|
H A D | xfs_iomap.c | 314 * If the extent is a hole, then preallocation is essentially disabled. 346 * start of a page and hence point to a hole at EOF. i.e. if the size is xfs_iomap_eof_prealloc_initial_size() 349 * point to the block prior to the EOF block and not the hole that maps xfs_iomap_eof_prealloc_initial_size() 704 * while. We have to be careful about truncates or hole xfs_iomap_write_allocate() 715 * a hole while we have excess blocks in the map, we xfs_iomap_write_allocate() 716 * will fill the hole incorrectly and overrun the xfs_iomap_write_allocate()
|
H A D | xfs_mount.c | 59 int hole, i; xfs_uuid_mount() local 70 for (i = 0, hole = -1; i < xfs_uuid_table_size; i++) { xfs_uuid_mount() 72 hole = i; xfs_uuid_mount() 79 if (hole < 0) { xfs_uuid_mount() 84 hole = xfs_uuid_table_size++; xfs_uuid_mount() 86 xfs_uuid_table[hole] = *uuid; xfs_uuid_mount()
|
H A D | xfs_attr_inactive.c | 82 * If it's a hole, these are already unmapped xfs_attr3_leaf_freextent()
|
/linux-4.1.27/arch/avr32/include/asm/ |
H A D | pgtable.h | 48 * current 8 MiB value just means that there will be a 8 MiB "hole" 55 * A "hole" of the same size is added to the end of the P3 segment as 59 * The vmalloc() routines leave a hole of 4 KiB between each vmalloced
|
/linux-4.1.27/arch/x86/kernel/ |
H A D | aperture_64.c | 80 pr_err("Cannot allocate aperture memory hole [mem %#010lx-%#010lx] (%uKB)\n", allocate_aperture() 252 * or second kernel have different position for GART hole. and new early_gart_iommu_check() 253 * kernel could use hole as RAM that is still used by GART set by early_gart_iommu_check() 455 pr_info("Your BIOS doesn't leave a aperture memory hole\n"); gart_iommu_hole_init()
|
H A D | head_64.S | 507 /* 8MB reserved for vsyscalls + a 2MB hole = 4 + 1 entries */
|
/linux-4.1.27/arch/sparc/include/asm/ |
H A D | page_64.h | 109 * enforce, wherein we use a 4GB red zone on each side of the VA hole.
|
/linux-4.1.27/arch/powerpc/mm/ |
H A D | mmap.c | 33 * Leave at least a ~128 MB hole on 32bit applications.
|
H A D | mem.c | 306 printk(KERN_DEBUG "Memory hole size: %ldMB\n", paging_init()
|
/linux-4.1.27/net/dccp/ccids/lib/ |
H A D | packet_history.c | 196 /* hole is filled: S0, S2, and S1 are consecutive */ __one_after_loss() 246 /* hole between S0 and S1 filled by S3 */ __two_after_loss() 250 /* entire hole filled by S0, S3, S1, S2 */ __two_after_loss() 295 /* no gap between S2 and S3: entire hole is filled */ __three_after_loss()
|
/linux-4.1.27/mm/ |
H A D | truncate.c | 343 /* All gone out of hole to be punched, we're done */ truncate_inode_pages_range() 740 /* Page straddling @from will not have any hole block created? */ pagecache_isize_extended() 762 * truncate_pagecache_range - unmap and remove pagecache that is hole-punched 764 * @lstart: offset of beginning of hole 765 * @lend: offset of last byte of hole 781 * expands its hole outwards, whereas we want it to contract the hole truncate_pagecache_range() 790 * hole-punching should not remove private COWed pages from the hole. truncate_pagecache_range()
|
H A D | filemap.c | 869 * page_cache_next_hole - find the next hole (not-present entry) 875 * lowest indexed hole. 877 * Returns: the index of the hole if found, otherwise returns an index 885 * hole is created at index 5, then subsequently a hole is created at 910 * page_cache_prev_hole - find the prev hole (not-present entry) 916 * the first hole. 918 * Returns: the index of the hole if found, otherwise returns an index 926 * hole is created at index 10, then subsequently a hole is created at 1301 /* The hole, there no reason to continue */ find_get_pages_contig()
|
H A D | shmem.c | 91 wait_queue_head_t *waitq; /* faults into hole wait for punch to end */ 227 * undirtied hole pages behind our back. 392 * If !unfalloc, truncate or punch hole; if unfalloc, undo failed fallocate. 487 /* If all gone or hole-punch or unfalloc, we're done */ shmem_undo_range() 1131 * "repeat": reading a hole and writing should succeed. shmem_getpage_gfp() 1280 * Trinity finds that probing a hole which tmpfs is punching can shmem_fault() 1281 * prevent the hole-punch from ever completing: which in turn shmem_fault() 1283 * faulting pages into the hole while it's being punched. Although shmem_fault() 1289 * hole-punch begins, so that one fault then races with the punch: shmem_fault() 1324 * stack of the hole-punching task: shmem_falloc_waitq shmem_fault() 2087 /* No need to unmap again: hole-punching leaves COWed pages */ shmem_fallocate()
|
H A D | pagewalk.c | 180 * Some callers are interested in handling hole range and they don't walk_page_test()
|
H A D | memory_hotplug.c | 614 * only creates a hole in the zone. So in this case, we need not shrink_zone_span() 615 * change the zone. But perhaps, the zone has only hole data. Thus shrink_zone_span() 616 * it check the zone has only hole or not. shrink_zone_span() 681 * it only creates a hole in the pgdat. So in this case, we need not shrink_pgdat_span() 683 * But perhaps, the pgdat has only hole data. Thus it check the pgdat shrink_pgdat_span() 684 * has only hole or not. shrink_pgdat_span()
|
H A D | vmalloc.c | 379 * cached_hole_size notes the largest hole noticed _below_ alloc_vmap_area() 381 * into that hole, we want to scan from vstart to reuse alloc_vmap_area() 382 * the hole instead of allocating above free_vmap_cache. alloc_vmap_area() 431 /* from the starting point, walk areas until a suitable hole is found */ alloc_vmap_area() 1987 * IOREMAP area is treated as memory hole and no copy is done. 2036 else /* IOREMAP area is treated as memory hole */ vread() 2068 * proper area of @buf. If there are memory holes, no copy to hole. 2069 * IOREMAP area is treated as memory hole and no copy is done.
|
H A D | gup.c | 26 * then get_dump_page() will return NULL to leave a hole in the dump. no_page_table() 27 * But we can only make this optimization where a hole would surely no_page_table() 946 * Returns NULL on any kind of failure - a hole must then be inserted into 949 * allowing a hole to be left in the corefile to save diskspace.
|
H A D | madvise.c | 290 * This is effectively punching a hole into the middle of a file.
|
/linux-4.1.27/fs/ubifs/ |
H A D | file.c | 31 * required for the page e.g., when it corresponds to a file hole or it is 69 /* Not found, so it must be a hole */ read_block() 89 * not the last in the file (e.g., as a result of making a hole and read_block() 165 /* Not found, so it must be a hole */ do_readpage() 167 dbg_gen("hole"); do_readpage() 240 * written to a hole. This corresponds to largest budget. Later the write_begin_slow() 363 * The page corresponds to a hole and does not allocate_budget() 372 * Not a hole, the change will not add any new allocate_budget() 407 * does not exist on the media (a hole), we have to budget for a new 613 int i = 0, nn = *n, offs = bu->zbranch[0].offs, hole = 0, read = 0; populate_page() local 627 hole = 1; populate_page() 637 hole = 1; populate_page() 667 hole = 1; populate_page() 684 if (hole) { populate_page() 686 dbg_gen("hole"); populate_page()
|
/linux-4.1.27/arch/mips/cavium-octeon/ |
H A D | dma-octeon.c | 79 /* Anything in the BAR1 hole or above goes via BAR2 */ octeon_big_phys_to_dma() 304 * memory past the BAR1 hole. plat_swiotlb_setup()
|
/linux-4.1.27/include/xen/interface/ |
H A D | elfnote.h | 143 * The lowest address the hypervisor hole can begin at (numeric). 147 * hole starting at a higher address.
|
/linux-4.1.27/arch/s390/include/uapi/asm/ |
H A D | vtoc.h | 205 __u32 map_block; /* Allocation Map Block with next hole */ 206 __u32 hblk_disp; /* Displacement into HBLK data of next hole */
|
/linux-4.1.27/arch/m32r/include/asm/ |
H A D | pgtable.h | 60 * current 8MB value just means that there will be a 8MB "hole" after the 63 * The vmalloc() routines leaves a hole of 4kB between each vmalloced
|
/linux-4.1.27/include/linux/ |
H A D | ipv6.h | 200 /* 2 bits hole */ 210 padding:1, /* 1 bit hole */
|
H A D | nfs4.h | 242 NFS4ERR_PNFS_IO_HOLE = 10075, /* IO to _SPARSE file hole */
|
H A D | kexec.h | 197 bool top_down; /* allocate from top of memory hole */
|
/linux-4.1.27/fs/adfs/ |
H A D | dir_fplus.c | 31 adfs_error(sb, "dir object %X has a hole at offset 0", id); adfs_fplus_read() 77 adfs_error(sb, "dir object %X has a hole at offset %d", id, blk); adfs_fplus_read()
|
H A D | dir_f.c | 166 adfs_error(sb, "dir object %lX has a hole at offset %d", adfs_dir_read()
|
/linux-4.1.27/drivers/staging/rtl8192u/ |
H A D | r8192U_wx.c | 895 NULL, /* -- hole -- */ 896 NULL, /* -- hole -- */ 911 NULL, /*---hole---*/ 912 NULL, /*---hole---*/ 921 NULL, /*---hole---*/
|
/linux-4.1.27/arch/x86/kernel/cpu/mtrr/ |
H A D | cleanup.c | 327 /* Try to append some small hole: */ range_to_mtrr_with_hole() 357 /* One hole in the middle: */ range_to_mtrr_with_hole() 363 /* One hole in middle or at the end: */ range_to_mtrr_with_hole() 399 Dprintk("hole: %016lx - %016lx\n", range_to_mtrr_with_hole() 438 /* Mininum size of mtrr block that can take hole: */
|
/linux-4.1.27/fs/ocfs2/ |
H A D | extent_map.c | 347 * Figure out the size of a hole which starts at v_cluster within the given 643 * A hole was found. Return some canned values that ocfs2_get_clusters() 645 * be populated with the size of the hole. ocfs2_get_clusters() 689 * p_cluster == 0 indicates a hole. ocfs2_extent_map_get_blocks() 959 "Inode #%llu contains a hole at offset %llu\n", ocfs2_read_virt_blocks()
|
H A D | aops.c | 180 * ignore it as a hole. ocfs2_get_block() 188 /* Treat the unwritten extent as a hole for zeroing purposes. */ ocfs2_get_block() 560 /* fill hole, allocate blocks can't be larger than the size ocfs2_direct_IO_get_blocks() 561 * of the hole */ ocfs2_direct_IO_get_blocks() 585 * get_more_blocks() expects us to describe a hole by clearing ocfs2_direct_IO_get_blocks() 588 * Consider an unwritten extent as a hole. ocfs2_direct_IO_get_blocks() 1393 /* treat the write as new if the a hole/lseek spanned across ocfs2_prepare_page_for_write() 1448 * been zero'd from being read in as a hole. ocfs2_prepare_page_for_write() 1796 * a hole. ocfs2_populate_write_desc() 1964 * What we want to do here is fill in any hole between the current end 2375 * a hole-filling write in which case we want ocfs2_write_end_nolock()
|
H A D | move_extents.c | 835 * XXX: how to deal with a hole: __ocfs2_move_extents_range() 837 * - skip the hole of course __ocfs2_move_extents_range()
|
H A D | file.c | 1614 * - no record needs to be removed (hole-punching completed) 1648 * skip hole if any. ocfs2_calc_trunc_pos() 1662 * - trunc_start was within a hole ocfs2_calc_trunc_pos() 1664 * both two cases mean the completion of hole punching. ocfs2_calc_trunc_pos() 1720 * partially zero'd later, if hole's start and end offset were ocfs2_remove_inode_range()
|
/linux-4.1.27/arch/microblaze/pci/ |
H A D | pci-common.c | 541 * order to give access to the ISA memory hole. 544 * have a different offset and the previous was set by an ISA hole. 580 * at exposing the VGA memory hole) pci_process_bridge_OF_ranges() 633 /* Handles ISA memory hole space here */ pci_process_bridge_OF_ranges() 645 * hole. If they don't match, bugger. pci_process_bridge_OF_ranges() 672 /* If there's an ISA hole and the pci_mem_offset is -not- matching pci_process_bridge_OF_ranges() 673 * the ISA hole offset, then we need to remove the ISA hole from pci_process_bridge_OF_ranges() 678 pr_info(" Removing ISA hole at 0x%016llx\n", isa_mb); pci_process_bridge_OF_ranges()
|
/linux-4.1.27/fs/nilfs2/ |
H A D | mdt.c | 238 * %-ENOENT - the specified block does not exist (hole block) 318 * nilfs_mdt_delete_block - make a hole on the meta data file. 402 * %-ENOENT - the specified block does not exist (hole block)
|
H A D | file.c | 104 * fill hole blocks nilfs_page_mkwrite()
|
H A D | sufile.c | 161 * %-ENOENT - Given segment usage is in hole block (may be returned if 681 /* hole */ nilfs_sufile_truncate_range() 713 /* make hole */ nilfs_sufile_truncate_range() 843 /* hole */ nilfs_sufile_get_suinfo() 1068 /* hole */ nilfs_sufile_trim_fs()
|
H A D | cpfile.c | 357 /* skip hole */ nilfs_cpfile_delete_checkpoints() 383 /* make hole */ nilfs_cpfile_delete_checkpoints() 522 ret = 0; /* No snapshots (started from a hole block) */ nilfs_cpfile_do_get_ssinfo()
|
H A D | inode.c | 139 /* not found is not error (e.g. hole); must return without nilfs_get_block() 241 /* Do not mark hole blocks dirty */ nilfs_set_page_dirty()
|
/linux-4.1.27/drivers/net/wireless/mwifiex/ |
H A D | 11n_rxreorder.c | 128 * a hole is found. 130 * The start window is adjusted automatically when a hole is located. 540 * table is dispatched until a hole is found. 640 * hole is found and adjust the start_win appropriately mwifiex_11n_rx_reorder_pkt()
|
/linux-4.1.27/fs/proc/ |
H A D | page.c | 88 * it differentiates a memory hole from a page with no flags stable_page_flags()
|
H A D | kcore.c | 140 * because memory hole is not as big as !HIGHMEM case.
|
/linux-4.1.27/fs/nfs/blocklayout/ |
H A D | blocklayout.h | 124 PNFS_BLOCK_NONE_DATA = 3 /* unmapped, it's a hole */
|
H A D | blocklayout.c | 282 /* Fill hole w/ zeroes w/o accessing device */ bl_read_pagelist() 283 dprintk("%s Zeroing page for hole\n", __func__); bl_read_pagelist()
|
/linux-4.1.27/arch/mn10300/kernel/ |
H A D | mn10300-serial-low.S | 152 and __UART_XMIT_SIZE-1,d2 # see if we just made a hole
|
/linux-4.1.27/arch/arm/mm/ |
H A D | init.c | 111 static void __init arm_adjust_dma_zone(unsigned long *size, unsigned long *hole, arm_adjust_dma_zone() argument 119 hole[ZONE_NORMAL] = hole[0]; arm_adjust_dma_zone() 120 hole[ZONE_DMA] = 0; arm_adjust_dma_zone()
|
/linux-4.1.27/net/ipv4/ |
H A D | tcp_timer.c | 106 /* Black hole detection */ tcp_mtu_probing() 179 /* Some middle-boxes may black-hole Fast Open _after_ tcp_write_timeout() 191 /* Black hole detection */ tcp_write_timeout() 483 * linear-timeout retransmissions into a black hole tcp_retransmit_timer()
|
H A D | tcp_output.c | 2726 struct sk_buff *hole = NULL; tcp_xmit_retransmit_queue() local 2753 if (!hole) tcp_for_write_queue_from() 2777 if (hole) { tcp_for_write_queue_from() 2778 skb = hole; tcp_for_write_queue_from() 2779 hole = NULL; tcp_for_write_queue_from() 2785 if (!hole && !(sacked & (TCPCB_SACKED_RETRANS|TCPCB_SACKED_ACKED))) tcp_for_write_queue_from() 2786 hole = skb; tcp_for_write_queue_from()
|
/linux-4.1.27/arch/um/include/asm/ |
H A D | pgtable.h | 38 * current 8MB value just means that there will be a 8MB "hole" after the 41 * The vmalloc() routines leaves a hole of 4kB between each vmalloced
|
/linux-4.1.27/arch/unicore32/include/asm/ |
H A D | pgtable.h | 23 * current 8MB value just means that there will be a 8MB "hole" after the 26 * The vmalloc() routines leaves a hole of 4kB between each vmalloced
|
/linux-4.1.27/arch/powerpc/include/asm/ |
H A D | pgtable-ppc32.h | 80 * current 16MB value just means that there will be a 64MB "hole" after the 83 * The vmalloc() routines leaves a hole of 4kB between each vmalloced
|
/linux-4.1.27/arch/arm/include/asm/ |
H A D | pgtable.h | 38 * current 8MB value just means that there will be a 8MB "hole" after the 41 * The vmalloc() routines leaves a hole of 4kB between each vmalloced
|
H A D | uaccess.h | 492 else /* security hole - plug it */ copy_from_user()
|
/linux-4.1.27/fs/fat/ |
H A D | file.c | 295 * trying to write into the hole. fat_truncate_blocks() 402 * hole before it. XXX: this is no longer true with new truncate fat_setattr()
|
/linux-4.1.27/drivers/pcmcia/ |
H A D | rsrc_nonstatic.c | 192 u_char *b, hole, most; do_io_probe() local 209 hole = inb(i); do_io_probe() 211 if (inb(i+j) != hole) do_io_probe() 214 if ((j == 8) && (++b[hole] > b[most])) do_io_probe() 215 most = hole; do_io_probe()
|
/linux-4.1.27/fs/xfs/libxfs/ |
H A D | xfs_bmap.c | 1376 * If bno lies in a hole, point to the next entry. If bno lies 1423 * If bno lies in a hole, point to the next entry. If bno lies past eof, 1467 * This is the lowest-address hole if the file has holes, else the first block 1475 xfs_extlen_t len, /* size of hole to find */ xfs_bmap_first_unused() 1505 * See if the hole before this extent will work. xfs_bmap_first_unused() 2782 * Convert a hole to a delayed allocation. 2815 * If it doesn't exist, we're converting the hole at end-of-file. xfs_bmap_add_extent_hole_delay() 2926 * Convert a hole to a real allocation. 2970 * Not true if we're inserting into the "hole" at eof. xfs_bmap_add_extent_hole_real() 3280 * means we can't fit an extsz piece in this hole. Just move xfs_bmap_extsize_align() 4056 /* Reading past eof, act as though there's a hole up to end. */ xfs_bmapi_read() 4060 /* Reading in a hole. */ xfs_bmapi_read() 4482 char inhole; /* current location is hole in file */ xfs_bmapi_write() 4557 * First, deal with the hole before the allocated space xfs_bmapi_write() 5105 * Is the found extent after a hole in which bno lives? xfs_bunmapi() 5381 * extent that precedes the target hole of the shift. 5408 * hole in the file. If an extent shift would result in the extent being fully 5409 * adjacent to the extent that currently precedes the hole, we can merge with 5533 * enough hole. xfs_bmse_shift_one() 5564 * Unlike a left shift (which involves a hole punch), xfs_bmse_shift_one() 5601 * Shift extent records to the left/right to cover/create a hole. 5606 * is the length by which each extent is shifted. If there is no hole to shift 5706 * *next_fsb lies in a hole beyond which there are no extents. Either xfs_bmap_shift_extents() 5765 * If split_fsb lies in a hole or the first block of extents, just return 0. 5810 * or 2) split_fsb lies in a hole beyond which there are xfs_bmap_split_extent_at() 5820 * Check split_fsb lies in a hole or the start boundary offset xfs_bmap_split_extent_at()
|
H A D | xfs_da_btree.c | 786 * Move elements in node2 up to make a hole. xfs_da3_node_rebalance() 822 * Move elements in node2 down to fill the hole. xfs_da3_node_rebalance() 1390 * elements in the remaining block up to make a hole. xfs_da3_node_unbalance() 2442 * -1 - will be returned if we land in a hole and mappedbno == -2 so the 2473 * if we land in a hole. xfs_dabuf_map() 2550 /* mapping a hole is not an error, but we don't continue */ xfs_da_get_buf() 2599 /* mapping a hole is not an error, but we don't continue */ xfs_da_read_buf() 2644 /* mapping a hole is not an error, but we don't continue */ xfs_da_reada_buf()
|
H A D | xfs_dir2_sf.c | 432 * Find a hole that the new entry will fit into, and copy 538 int holefit; /* found hole it will fit in */ xfs_dir2_sf_addname_pick() 585 * If it won't fit at the end then do it the hard way (use the hole). xfs_dir2_sf_addname_pick()
|
H A D | xfs_attr_leaf.c | 627 * Fix up the attribute fork data, covering the hole xfs_attr_shortform_remove() 1985 * then we don't have a "hole" in our block resulting from xfs_attr3_leaf_remove() 2362 * Move the entries in the destination leaf up to make a hole? xfs_attr3_leaf_moveents() 2433 * Move the remaining entries down to fill the hole, xfs_attr3_leaf_moveents()
|
H A D | xfs_attr_remote.c | 432 * Find a "hole" in the attribute address space large enough for xfs_attr_rmtval_set()
|
H A D | xfs_dir2_node.c | 168 /* try read returns without an error or *bpp if it lands in a hole */ __xfs_dir3_free_read() 857 * destination leaf entries, open up a hole in the destination xfs_dir3_leafn_moveents() 1729 * indicating a hole in the data blocks, remember that. xfs_dir2_node_addname_int() 2242 * There can be holes in freespace. If fo is a hole, there's xfs_dir2_node_trim_free()
|
/linux-4.1.27/drivers/edac/ |
H A D | amd64_edac.c | 485 * | memory | DRAM hole | relocated | amd64_get_dram_hole_info() 487 * | | | DRAM hole | amd64_get_dram_hole_info() 493 * Above is a diagram of physical memory showing the DRAM hole and the amd64_get_dram_hole_info() 494 * relocated addresses from the DRAM hole. As shown, the DRAM hole amd64_get_dram_hole_info() 497 * addresses in the hole so that they start at 0x100000000. amd64_get_dram_hole_info() 535 * hole. If not, skip to step 3 below. Else get the value of the 1450 * remove hole offset from sys_addr f1x_get_norm_dct_addr() 1464 * we have a valid hole && f1x_get_norm_dct_addr() 1467 * remove hole f1x_get_norm_dct_addr() 1607 amd64_warn("Huh? Address is in the MMIO hole: 0x%016llx\n", f1x_match_to_this_node() 1699 amd64_warn("Huh? Address is in the MMIO hole: 0x%016llx\n", f15_m30h_match_to_this_node()
|
H A D | amd64_edac.h | 19 * - Added support for memory hoisting using DRAM hole address
|
/linux-4.1.27/fs/jfs/ |
H A D | jfs_extent.c | 445 * a file hole. 449 * cp - cbuf of the file page represent the hole. 466 /* allocate an extent to fill the hole */ extFill()
|
H A D | inode.c | 221 * this as a hole jfs_get_block()
|
/linux-4.1.27/kernel/bpf/ |
H A D | core.c | 139 unsigned int size, hole, start; bpf_jit_binary_alloc() local 154 hole = min_t(unsigned int, size - (proglen + sizeof(*hdr)), bpf_jit_binary_alloc() 156 start = (prandom_u32() % hole) & ~(alignment - 1); bpf_jit_binary_alloc()
|
/linux-4.1.27/arch/parisc/mm/ |
H A D | init.c | 564 * Just an arbitrary offset to serve as a "hole" between mapping areas 568 * The current 32K value just means that there will be a 32K "hole" 571 * a hole of 4kB between each vmalloced area for the same reason.
|
/linux-4.1.27/arch/sparc/kernel/ |
H A D | sys_sparc_64.c | 44 /* Does addr --> addr+len fall within 4GB of the VA-space hole or 74 * the spitfire/niagara VA-hole.
|
H A D | pci_psycho.c | 44 #define PSYCHO_PCICTRL_SBH_ERR 0x0000000800000000UL /* Streaming byte hole error */ 50 #define PSYCHO_PCICTRL_SBH_INT 0x0000000000000400UL /* Streaming byte hole int enab */
|
H A D | psycho_common.c | 265 printk(KERN_ERR "%s: PCI streaming byte hole " psycho_pcierr_intr_other()
|
/linux-4.1.27/arch/powerpc/sysdev/ |
H A D | ppc4xx_pci.c | 284 * ISA memory hole ppc4xx_configure_pci_PMMs() 291 /* Handle ISA memory hole if not already covered */ ppc4xx_configure_pci_PMMs() 485 * ISA memory hole ppc4xx_configure_pcix_POMs() 492 /* Handle ISA memory hole if not already covered */ ppc4xx_configure_pcix_POMs() 557 /* Check if we should enable MSIs inbound hole */ ppc4xx_probe_pcix_bridge() 558 if (of_get_property(np, "enable-msi-hole", NULL)) ppc4xx_probe_pcix_bridge() 1825 * ISA memory hole ppc4xx_configure_pciex_POMs() 1832 /* Handle ISA memory hole if not already covered */ ppc4xx_configure_pciex_POMs()
|
/linux-4.1.27/arch/mn10300/include/asm/ |
H A D | pgtable.h | 89 * (leaving a hole at the very bottom to catch addressing errors), and 92 * The vmalloc() routines also leaves a hole of 4kB between each vmalloced
|
/linux-4.1.27/fs/ecryptfs/ |
H A D | mmap.c | 274 * This function must zero any hole we create 371 /* Writing to a new page, and creating a small hole from start ecryptfs_write_begin()
|
/linux-4.1.27/sound/ |
H A D | sound_core.c | 170 * Low level list operator. Scan the ordered list, find a hole and 185 /* Found a hole ? */ __sound_insert_unit()
|
/linux-4.1.27/fs/btrfs/ |
H A D | file.c | 1789 /* Expand hole size to cover write data, preventing empty gap */ btrfs_file_write_iter() 2227 * Find a hole extent on given inode and change start/len to the end of hole 2228 * extent.(hole/vacuum extent whose em->start <= start && 2230 * When a hole extent is found, return 1 and modify start/len. 2246 /* Hole or vacuum extent(only exists in no-hole mode) */ find_first_non_hole() 2291 /* Already in a large hole */ btrfs_punch_hole() 2335 /* after truncate page, check hole again */ btrfs_punch_hole() 2348 /* Check the tail unaligned part is in a hole */ btrfs_punch_hole() 2423 * 1 - adding the hole extent if no_holes isn't set btrfs_punch_hole() 2496 * Don't insert file hole extent item if it's for a range beyond eof btrfs_punch_hole()
|
H A D | tree-log.c | 609 * hole. replay_one_extent() 3585 /* ds == 0 is a hole */ copy_items() 4207 * If the no holes feature is enabled we need to make sure any hole between the 4220 * file correspond to a hole. The presence of explicit holes in a log tree is 4227 * lookup the list of modified extent maps and if any represents a hole, we 4228 * insert a corresponding extent representing a hole in the log tree. 4270 * If there's an extent beyond i_size, an explicit hole was btrfs_log_trailing_hole() 4289 /* Last extent goes beyond i_size, no need to log a hole. */ btrfs_log_trailing_hole() 4537 * we get a 8Kb file, with the last 4Kb extent as a hole btrfs_log_inode()
|
/linux-4.1.27/drivers/staging/lustre/lustre/include/linux/ |
H A D | lustre_compat25.h | 170 #define SEEK_HOLE 4 /* seek to the next hole */
|
/linux-4.1.27/arch/x86/pci/ |
H A D | amd_bus.c | 258 /* we got a hole */ early_root_info_init()
|
H A D | pcbios.c | 38 * So we let's an rw and x hole when pcibios is used. This shouldn't
|
/linux-4.1.27/arch/x86/vdso/ |
H A D | vma.c | 46 * offset. This way there is no hole in the middle of address space.
|
/linux-4.1.27/arch/x86/ia32/ |
H A D | sys_ia32.c | 17 * This file assumes that there is a hole at the end of user address space.
|
/linux-4.1.27/arch/s390/mm/ |
H A D | mmap.c | 49 * Leave at least a ~32 MB hole.
|
/linux-4.1.27/arch/mips/sgi-ip22/ |
H A D | ip22-mc.c | 93 /* There is either hole or overlapping memory */ probe_memory()
|
/linux-4.1.27/arch/arm64/include/asm/ |
H A D | uaccess.h | 248 else /* security hole - plug it */ copy_from_user()
|
/linux-4.1.27/arch/m32r/kernel/ |
H A D | setup.c | 193 * reserve memory hole setup_memory()
|
/linux-4.1.27/arch/alpha/lib/ |
H A D | ev6-clear_user.S | 43 * want to leave a hole (and we also want to avoid repeating lots of work)
|
/linux-4.1.27/net/dccp/ |
H A D | timer.c | 48 black hole detection. :-( dccp_write_timeout()
|
H A D | dccp.h | 154 * @s1: last known sequence number before the loss ('hole') 155 * @s2: first sequence number seen after the 'hole'
|
/linux-4.1.27/drivers/net/wireless/ |
H A D | zd1201.c | 1578 (iw_handler) NULL, /* -- hole -- */ 1579 (iw_handler) NULL, /* -- hole -- */ 1582 (iw_handler) NULL, /* -- hole -- */ 1590 (iw_handler) NULL, /* -- hole -- */ 1591 (iw_handler) NULL, /* -- hole -- */
|
H A D | atmel.c | 2556 (iw_handler) NULL, /* -- hole -- */ 2557 (iw_handler) NULL, /* -- hole -- */ 2560 (iw_handler) NULL, /* -- hole -- */ 2568 (iw_handler) NULL, /* -- hole -- */ 2569 (iw_handler) NULL, /* -- hole -- */ 2584 (iw_handler) NULL, /* -- hole -- */ 2585 (iw_handler) NULL, /* -- hole -- */
|
/linux-4.1.27/arch/mips/pci/ |
H A D | pci-octeon.c | 398 /* BAR1 hole */ octeon_pci_initialize() 629 * BAR 1 hole). octeon_pci_setup()
|
/linux-4.1.27/drivers/media/usb/dvb-usb/ |
H A D | dvb-usb-remote.c | 30 /* See if there is an unused hole in the map */ legacy_dvb_usb_get_keymap_index()
|
/linux-4.1.27/drivers/scsi/fnic/ |
H A D | fnic.h | 251 u32 _reserved; /* fill hole */
|
/linux-4.1.27/drivers/gpu/drm/i915/ |
H A D | i915_gem_evict.c | 61 * requirements is found. Callers must check first whether any such hole exists
|
/linux-4.1.27/arch/x86/boot/compressed/ |
H A D | misc.c | 403 * The memory hole needed for the kernel is the larger of either decompress_kernel()
|
/linux-4.1.27/drivers/bus/ |
H A D | omap_l3_noc.c | 49 * - Address hole error:
|
/linux-4.1.27/fs/ufs/ |
H A D | truncate.c | 416 * if it maped to hole, it already contains zeroes ufs_alloc_lastblock()
|
/linux-4.1.27/arch/mips/sgi-ip27/ |
H A D | ip27-memory.c | 432 * Currently, the intranode memory hole support assumes that each slot
|
/linux-4.1.27/drivers/net/wireless/brcm80211/brcmsmac/ |
H A D | ampdu.c | 860 u8 hole[AMPDU_MAX_MPDU]; brcms_c_ampdu_dotxstatus_complete() local 861 memset(hole, 0, sizeof(hole)); brcms_c_ampdu_dotxstatus_complete()
|
/linux-4.1.27/fs/reiserfs/ |
H A D | inode.c | 211 * done already or non-hole position has been found in the indirect item 312 * We do not return -ENOENT if there is a hole but page is _get_block_create_0() 343 * We do not return -ENOENT if there is a hole but _get_block_create_0() 487 * block past the end of the file (or a block from a hole) it returns 566 * helper function for when reiserfs_get_block is called for a hole 568 * bh_result is the buffer head for the hole 801 * zero unformatted node pointer (hole) reiserfs_get_block() 805 /* use allocated block to plug the hole */ reiserfs_get_block() 1065 /* paste hole to the indirect item */ reiserfs_get_block() 1117 * inserting indirect pointers for a hole can take a reiserfs_get_block() 2419 /* crap, we are writing to a hole */ map_block_for_writepage() 3339 /* fill in hole pointers in the expanding truncate case. */ reiserfs_setattr()
|
/linux-4.1.27/drivers/net/ |
H A D | virtio_net.c | 619 unsigned int len, hole; add_recvbuf_mergeable() local 629 hole = alloc_frag->size - alloc_frag->offset; add_recvbuf_mergeable() 630 if (hole < len) { add_recvbuf_mergeable() 636 len += hole; add_recvbuf_mergeable() 637 alloc_frag->offset += hole; add_recvbuf_mergeable()
|
/linux-4.1.27/drivers/staging/rtl8712/ |
H A D | rtl871x_ioctl_linux.c | 2255 NULL, /* -- hole -- */ 2256 NULL, /* -- hole -- */ 2271 NULL, /*---hole---*/ 2272 NULL, /*---hole---*/ 2280 NULL, /*---hole---*/
|
/linux-4.1.27/drivers/scsi/ |
H A D | storvsc_drv.c | 584 /* make sure 1st one does not have hole */ do_bounce_buffer() 588 /* make sure last one does not have hole */ do_bounce_buffer() 592 /* make sure no hole in the middle */ do_bounce_buffer()
|
/linux-4.1.27/drivers/net/wireless/libertas_tf/ |
H A D | main.c | 579 /* Marvell rate index has a hole at value 4 */ lbtf_rx()
|
/linux-4.1.27/drivers/staging/lustre/lustre/fld/ |
H A D | fld_cache.c | 256 * punch hole in existing range. divide this range and add new
|
/linux-4.1.27/drivers/staging/lustre/lustre/llite/ |
H A D | xattr_cache.c | 448 CERROR("a hole in xattr data\n"); ll_xattr_cache_refill()
|
/linux-4.1.27/drivers/gpio/ |
H A D | gpio-msm-v2.c | 211 * The do-loop tries to sledge-hammer closed the timing hole between
|
/linux-4.1.27/drivers/bluetooth/ |
H A D | hci_ldisc.c | 333 hole */ hci_uart_tty_open()
|
/linux-4.1.27/fs/hfs/ |
H A D | brec.c | 219 /* fill hole */ hfs_brec_remove()
|
/linux-4.1.27/fs/hfsplus/ |
H A D | brec.c | 223 /* fill hole */ hfs_brec_remove()
|
/linux-4.1.27/fs/cramfs/ |
H A D | inode.c | 517 ; /* hole */ cramfs_readpage()
|
/linux-4.1.27/sound/pci/emu10k1/ |
H A D | memory.c | 121 /* we look for the maximum empty hole */ search_empty_map_area()
|
/linux-4.1.27/drivers/iommu/ |
H A D | exynos-iommu.c | 981 * Any two consecutive I/O virtual address regions must have a hole of 128KiB 991 * - Any two consecutive I/O virtual regions must have a hole of size larger
|
/linux-4.1.27/drivers/net/wireless/iwlwifi/dvm/ |
H A D | tx.c | 1179 * hole in the bitmap of the BA we received, this Tx iwlagn_rx_reply_tx() 1180 * response may allow to reclaim the hole and all the iwlagn_rx_reply_tx()
|
/linux-4.1.27/drivers/net/wireless/iwlwifi/mvm/ |
H A D | tx.c | 708 * this Tx response relates. But if there is a hole in the iwl_mvm_rx_tx_cmd_single() 710 * reclaim the hole and all the subsequent packets that were iwl_mvm_rx_tx_cmd_single()
|
/linux-4.1.27/drivers/net/wireless/brcm80211/brcmfmac/ |
H A D | core.c | 421 brcmf_dbg(DATA, "flow-%d: new hole %d (%d), pending %d\n", brcmf_rxreorder_process_info() 428 /* still in the current hole */ brcmf_rxreorder_process_info()
|
/linux-4.1.27/fs/ceph/ |
H A D | file.c | 906 /* hit EOF or hole? */ ceph_read_iter() 909 dout("sync_read hit hole, ppos %lld < size %lld" ceph_read_iter()
|
/linux-4.1.27/fs/f2fs/ |
H A D | file.c | 358 /* find data/hole in dnode block */ f2fs_seek_block() 721 /* skip punching hole beyond i_size */ punch_hole()
|
/linux-4.1.27/security/keys/ |
H A D | key.c | 142 /* propose a random serial number and look for a hole for it in the key_alloc_serial() 168 /* we've found a suitable hole - arrange for this key to occupy it */ key_alloc_serial()
|
/linux-4.1.27/sound/soc/codecs/ |
H A D | pcm512x.c | 504 /* No hole when the frame size is 32. */ pcm512x_hw_rule_rate() 508 /* There is only one hole in the range of supported pcm512x_hw_rule_rate()
|
/linux-4.1.27/drivers/net/wireless/prism54/ |
H A D | isl_ioctl.c | 2707 (iw_handler) NULL, /* -- hole -- */ 2715 (iw_handler) NULL, /* -- hole -- */ 2716 (iw_handler) NULL, /* -- hole -- */ 2731 NULL, /* -- hole -- */ 2732 NULL, /* -- hole -- */
|
/linux-4.1.27/drivers/staging/rtl8188eu/os_dep/ |
H A D | ioctl_linux.c | 3043 NULL, /* -- hole -- */ 3044 NULL, /* -- hole -- */ 3059 NULL, /*---hole---*/ 3060 NULL, /*---hole---*/ 3068 NULL, /*---hole---*/
|
/linux-4.1.27/drivers/net/wireless/hostap/ |
H A D | hostap_ioctl.c | 3916 (iw_handler) NULL, /* -- hole -- */ 3917 (iw_handler) NULL, /* -- hole -- */ 3932 (iw_handler) NULL, /* -- hole -- */ 3933 (iw_handler) NULL, /* -- hole -- */ 3941 (iw_handler) NULL, /* -- hole -- */
|
/linux-4.1.27/fs/udf/ |
H A D | inode.c | 519 /* Mark the extent as a hole */ udf_do_extend_file() 557 /* Create enough extents to cover the whole hole */ udf_do_extend_file() 765 /* Create extents for the hole between EOF and offset */ inode_getblk()
|
/linux-4.1.27/fs/logfs/ |
H A D | readwrite.c | 11 * seek_hole find next hole 880 * logfs_seek_hole - find next hole starting at a given block index 884 * Returns next hole. If the file doesn't contain any further holes, the
|
/linux-4.1.27/drivers/net/ethernet/dec/tulip/ |
H A D | interrupt.c | 272 * is not scheduled. It is major hole in design. tulip_poll()
|
/linux-4.1.27/drivers/spi/ |
H A D | spi-fsl-spi.c | 484 /* When spi->cs_gpio == -ENOENT, a hole in the phandle list fsl_spi_setup()
|
/linux-4.1.27/drivers/staging/lustre/lustre/osc/ |
H A D | osc_io.c | 227 * new page, if one were missing (i.e., if there were a hole at that place in
|
/linux-4.1.27/arch/x86/kernel/cpu/ |
H A D | perf_event_intel_lbr.c | 659 * executing up next to a memory hole, but branch_type()
|
/linux-4.1.27/arch/x86/xen/ |
H A D | mmu.c | 606 * For 64-bit, we must skip the Xen hole in the middle of the address 607 * space, just after the big x86-64 virtual hole. 627 * 64-bit has a great big hole in the middle of the address __xen_pgd_walk() 629 * will end up making a zero-sized hole and so is a no-op. __xen_pgd_walk()
|
/linux-4.1.27/drivers/gpu/drm/via/ |
H A D | via_dmablit.c | 616 * DOS security hole. via_build_sg_info()
|