| /linux/tools/testing/selftests/mm/ |
| H A D | madv_populate.c | 111 "MADV_POPULATE_READ with holes in the middle\n"); in test_holes()
114 "MADV_POPULATE_WRITE with holes in the middle\n"); in test_holes()
119 "MADV_POPULATE_READ with holes at the end\n"); in test_holes()
122 "MADV_POPULATE_WRITE with holes at the end\n"); in test_holes()
127 "MADV_POPULATE_READ with holes at the beginning\n"); in test_holes()
130 "MADV_POPULATE_WRITE with holes at the beginning\n"); in test_holes()
|
| /linux/fs/cramfs/ |
| H A D | README | 93 Holes
96 This kernel supports cramfs holes (i.e. [efficient representation of]
98 default mkcramfs doesn't test for & create holes, since cramfs in
99 kernels up to at least 2.3.39 didn't support holes. Run mkcramfs
100 with -z if you want it to create files that can have holes in them.
|
| /linux/Documentation/mm/ |
| H A D | memory-model.rst | 10 however, that this range contains small holes that are not accessible
39 maps the entire physical memory. For most architectures, the holes
41 corresponding to the holes are never fully initialized.
50 :c:func:`pfn_valid` implementation should take the holes in the
|
| /linux/include/drm/ |
| H A D | drm_mm.h | 132 * Does not search all holes.
143 * Does not search all holes.
285 * Holes are embedded into the drm_mm using the tail of a drm_mm_node.
308 * not inspect holes themselves. Drivers must check first whether a hole indeed
330 * not inspect holes themselves. Drivers must check first whether a hole indeed
379 * drm_mm_for_each_hole - iterator to walk over all holes
385 * This iterator walks over all holes in the range allocator. It is implemented
|
| /linux/Documentation/devicetree/bindings/display/panel/ |
| H A D | sharp,ls037v7dw01.yaml | 12 configured with external pulls, all the GPIOs are considered optional with holes
40 optional with holes in the array.
|
| /linux/Documentation/devicetree/bindings/pinctrl/ |
| H A D | qcom,pmic-gpio.yaml | 461 - gpio1-gpio10 for pm8150 (holes on gpio2, gpio5,
463 - gpio1-gpio12 for pm8150b (holes on gpio3, gpio4
493 - gpio1-gpio12 for pmp8074 (holes on gpio1 and gpio12)
497 - gpio1-gpio12 for pms405 (holes on gpio1, gpio9
499 - gpio1-gpio11 for pmx55 (holes on gpio3, gpio7, gpio10
|
| /linux/arch/powerpc/platforms/powernv/ |
| H A D | pci-sriov.c | 573 devm_release_resource(&dev->dev, &iov->holes[i]); in pnv_pci_vf_resource_shift()
574 memset(&iov->holes[i], 0, sizeof(iov->holes[i])); in pnv_pci_vf_resource_shift()
580 iov->holes[i].start = res2.start; in pnv_pci_vf_resource_shift()
581 iov->holes[i].end = res2.start + size * offset - 1; in pnv_pci_vf_resource_shift()
582 iov->holes[i].flags = IORESOURCE_BUS; in pnv_pci_vf_resource_shift()
583 iov->holes[i].name = "pnv_iov_reserved"; in pnv_pci_vf_resource_shift()
585 &iov->holes[i]); in pnv_pci_vf_resource_shift()
|
| /linux/drivers/gpu/drm/tests/ |
| H A D | drm_mm_test.c | 49 "Expected to find no holes (after reserve), found %lu instead\n", count); in assert_no_holes()
172 /* After filling the range entirely, there should be no holes */ in drm_test_mm_init()
174 KUNIT_FAIL(test, "mm has holes when filled"); in drm_test_mm_init()
195 /* Create a small drm_mm with a couple of nodes and a few holes, and in drm_test_mm_debug()
|
| /linux/kernel/irq/ |
| H A D | ipi.c | 51 * underlying implementation can deal with holes nicely. in irq_reserve_ipi()
61 * implementation needs to support holes, it can reserve in irq_reserve_ipi()
73 pr_warn("Destination mask has holes\n"); in irq_reserve_ipi()
|
| /linux/net/sched/ |
| H A D | sch_choke.c | 74 /* number of elements in queue including holes */
92 /* Move head pointer forward to skip over holes */
102 /* Move tail pointer backwards to reuse holes */
175 * HACK: since queue can have holes from previous deletion; retry several
|
| /linux/arch/mips/kernel/ |
| H A D | vmlinux.lds.S | 188 * Align to 64K in attempt to eliminate holes before the
200 * no holes after __init_end. */
|
| /linux/include/linux/ |
| H A D | crash_dump.h | 109 * ("2nd") kernel. Indicated RAM ranges may contain holes to reduce the
110 * total number of ranges; such holes can be detected using the pfn_is_ram
|
| H A D | gpio-pxa.h | 10 * Those cases currently cause holes in the GPIO number space, the
|
| /linux/drivers/clk/tegra/ |
| H A D | clk-bpmp.c | 426 unsigned int holes = 0; in tegra_bpmp_probe_clocks() local
457 holes++; in tegra_bpmp_probe_clocks()
468 dev_dbg(bpmp->dev, "holes: %u\n", holes); in tegra_bpmp_probe_clocks()
|
| /linux/tools/testing/selftests/perf_events/ |
| H A D | mmap.c | 217 // Try to poke holes into the mappings in TEST_F()
227 // Try to poke holes into the mappings by mapping anonymous memory over it in TEST_F()
|
| /linux/mm/ |
| H A D | mm_init.c | 830 * But, there could be struct pages that correspond to holes in
844 * the zone boundary; the pages in such holes will be prepended to the
907 * There can be holes in boot-time mem_map[]s handed to this in memmap_init_range()
1191 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
1192 * then all holes in the requested range will be accounted for.
1211 * absent_pages_in_range - Return number of page frames in holes within a range
1212 * @start_pfn: The start PFN to start searching for holes
1213 * @end_pfn: The end PFN to stop searching for holes
1215 * Return: the number of pages frames in memory holes within a range.
1223 /* Return the number of page frames in holes in a zone on a node */
[all …]
|
| H A D | cma.h | 18 * single physical memory range because of memory holes.
|
| /linux/fs/xfs/libxfs/ |
| H A D | xfs_attr_leaf.c | 172 to->holes = hdr3->holes; in xfs_attr3_leaf_hdr_from_disk()
186 to->holes = from->hdr.holes; in xfs_attr3_leaf_hdr_from_disk()
214 hdr3->holes = from->holes; in xfs_attr3_leaf_hdr_to_disk()
229 to->hdr.holes = from->holes; in xfs_attr3_leaf_hdr_to_disk()
1432 * If there are no holes in the address space of the block, in xfs_attr3_leaf_add()
1436 if (!ichdr.holes && sum < entsize) in xfs_attr3_leaf_add()
1622 ichdr_dst->holes = 0; in xfs_attr3_leaf_compact()
2248 ichdr.holes = 1; /* mark as needing compaction */ in xfs_attr3_leaf_remove()
2293 * Note that we don't check "leaf" for holes because we will in xfs_attr3_leaf_unbalance()
2296 if (savehdr.holes == 0) { in xfs_attr3_leaf_unbalance()
[all …]
|
| /linux/arch/s390/include/asm/ |
| H A D | vmlinux.lds.h | 11 * into single .boot.data section. This way big holes cased by page aligned
|
| /linux/net/dccp/ |
| H A D | timer.c | |
| /linux/tools/testing/selftests/bpf/map_tests/ |
| H A D | map_in_map_batch_ops.c | 267 printf("%s:PASS with inner ARRAY map with holes\n", __func__); in test_map_in_map_batch_ops_array()
269 printf("%s:PASS with inner HASH map with holes\n", __func__); in test_map_in_map_batch_ops_array()
|
| /linux/fs/xfs/scrub/ |
| H A D | ialloc.c | 578 uint64_t holes; in xchk_iallocbt_rec() local
613 holes = ~xfs_inobt_irec_to_allocmask(&irec); in xchk_iallocbt_rec()
614 if ((holes & irec.ir_free) != holes || in xchk_iallocbt_rec()
|
| /linux/lib/ |
| H A D | test_maple_tree.c | 685 static const unsigned long holes[] = { in check_alloc_rev_range() local
775 for (i = 0; i < ARRAY_SIZE(holes); i += 3) { in check_alloc_rev_range()
778 min, holes[i+1]>>12, holes[i+2]>>12, in check_alloc_rev_range()
779 holes[i] >> 12); in check_alloc_rev_range()
782 holes[i+1] >> 12, in check_alloc_rev_range()
783 holes[i+2] >> 12)); in check_alloc_rev_range()
786 pr_debug("gap %lu %lu\n", (holes[i] >> 12), in check_alloc_rev_range()
787 (holes[i+1] >> 12)); in check_alloc_rev_range()
789 MT_BUG_ON(mt, mas.last + 1 != (holes[i+1] >> 12)); in check_alloc_rev_range()
790 MT_BUG_ON(mt, mas.index != (holes[i+1] >> 12) - (holes[i+2] >> 12)); in check_alloc_rev_range()
[all …]
|
| /linux/drivers/net/plip/ |
| H A D | Kconfig | 19 ports (the connectors at the computers with 25 holes) are connected
|
| /linux/arch/x86/lib/ |
| H A D | bhi.S | 15 * big alignment holes for this to not stagger the array.
|