Home
last modified time | relevance | path

Searched full:holes (Results 1 – 25 of 325) sorted by relevance

12345678910>>...13

/linux-6.12.1/tools/testing/selftests/mm/
Dmadv_populate.c111 "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-6.12.1/fs/cramfs/
DREADME93 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-6.12.1/Documentation/mm/
Dmemory-model.rst10 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-6.12.1/include/drm/
Ddrm_mm.h132 * 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-6.12.1/Documentation/devicetree/bindings/display/panel/
Dsharp,ls037v7dw01.yaml12 configured with external pulls, all the GPIOs are considered optional with holes
40 optional with holes in the array.
/linux-6.12.1/fs/btrfs/
Dextent_map.h37 * This structure represents file extents and holes.
67 * For holes it's EXTENT_MAP_HOLE and for inline extents it's
82 * For holes and inline extents it's 0.
/linux-6.12.1/arch/m68k/sun3/
Dsun3dvma.c72 static void print_holes(struct list_head *holes) in print_holes() argument
78 pr_info("listing dvma holes\n"); in print_holes()
79 list_for_each(cur, holes) { in print_holes()
147 pr_crit("out of dvma holes! (printing hole cache)\n"); in get_baddr()
/linux-6.12.1/Documentation/devicetree/bindings/pinctrl/
Dqcom,pmic-gpio.yaml455 - gpio1-gpio10 for pm8150 (holes on gpio2, gpio5,
457 - gpio1-gpio12 for pm8150b (holes on gpio3, gpio4
486 - gpio1-gpio12 for pmp8074 (holes on gpio1 and gpio12)
490 - gpio1-gpio12 for pms405 (holes on gpio1, gpio9
492 - gpio1-gpio11 for pmx55 (holes on gpio3, gpio7, gpio10
/linux-6.12.1/drivers/gpu/drm/tests/
Ddrm_mm_test.c49 "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-6.12.1/arch/powerpc/platforms/powernv/
Dpci-sriov.c573 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-6.12.1/drivers/pinctrl/qcom/
Dpinctrl-spmi-gpio.c1197 /* pm660 has 13 GPIOs with holes on 1, 5, 6, 7, 8 and 10 */
1199 /* pm660l has 12 GPIOs with holes on 1, 2, 10, 11 and 12 */
1211 /* pm8150 has 10 GPIOs with holes on 2, 5, 7 and 8 */
1214 /* pm8150b has 12 GPIOs with holes on 3, r and 7 */
1216 /* pm8150l has 12 GPIOs with holes on 7 */
1230 /* pm8950 has 8 GPIOs with holes on 3 */
1232 /* pm8953 has 8 GPIOs with holes on 3 and 6 */
1248 /* pmp8074 has 12 GPIOs with holes on 1 and 12 */
1253 /* pms405 has 12 GPIOs with holes on 1, 9, and 10 */
1255 /* pmx55 has 11 GPIOs with holes on 3, 7, 10, 11 */
/linux-6.12.1/kernel/irq/
Dipi.c51 * 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-6.12.1/arch/mips/kernel/
Dvmlinux.lds.S187 * Align to 64K in attempt to eliminate holes before the
199 * no holes after __init_end. */
/linux-6.12.1/net/sched/
Dsch_choke.c74 /* 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-6.12.1/include/linux/
Dgpio-pxa.h10 * Those cases currently cause holes in the GPIO number space, the
/linux-6.12.1/arch/s390/include/asm/
Dvmlinux.lds.h11 * into single .boot.data section. This way big holes cased by page aligned
/linux-6.12.1/drivers/clk/tegra/
Dclk-bpmp.c426 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-6.12.1/net/dccp/
Dtimer.c51 "The one security concern raised by this memo is that ICMP black holes in dccp_write_timeout()
57 be far nicer to have all of the black holes fixed rather than fixing in dccp_write_timeout()
/linux-6.12.1/fs/xfs/libxfs/
Dxfs_attr_leaf.c172 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()
1445 * If there are no holes in the address space of the block, in xfs_attr3_leaf_add()
1449 if (!ichdr.holes && sum < entsize) in xfs_attr3_leaf_add()
1635 ichdr_dst->holes = 0; in xfs_attr3_leaf_compact()
2261 ichdr.holes = 1; /* mark as needing compaction */ in xfs_attr3_leaf_remove()
2306 * Note that we don't check "leaf" for holes because we will in xfs_attr3_leaf_unbalance()
2309 if (savehdr.holes == 0) { in xfs_attr3_leaf_unbalance()
[all …]
/linux-6.12.1/drivers/gpu/drm/xe/compat-i915-headers/
Di915_vma_types.h70 /* Members need to contain no holes/padding */
/linux-6.12.1/tools/testing/selftests/kvm/x86_64/
Dprivate_mem_conversions_test.c181 * also correctly handles holes in private ranges. in guest_test_explicit_conversion()
226 * Test that PUNCH_HOLE actually frees memory by punching holes without doing a
237 * punching holes in guest_memfd, i.e. shared mappings aren't needed. in guest_test_punch_hole()
/linux-6.12.1/drivers/net/plip/
DKconfig19 ports (the connectors at the computers with 25 holes) are connected
/linux-6.12.1/mm/
Dmm_init.c800 * But, there could be struct pages that correspond to holes in
814 * the zone boundary; the pages in such holes will be prepended to the
880 * There can be holes in boot-time mem_map[]s handed to this in memmap_init_range()
1150 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
1151 * then all holes in the requested range will be accounted for.
1170 * absent_pages_in_range - Return number of page frames in holes within a range
1171 * @start_pfn: The start PFN to start searching for holes
1172 * @end_pfn: The end PFN to stop searching for holes
1174 * Return: the number of pages frames in memory holes within a range.
1182 /* Return the number of page frames in holes in a zone on a node */
[all …]
/linux-6.12.1/fs/xfs/scrub/
Dialloc.c580 uint64_t holes; in xchk_iallocbt_rec() local
615 holes = ~xfs_inobt_irec_to_allocmask(&irec); in xchk_iallocbt_rec()
616 if ((holes & irec.ir_free) != holes || in xchk_iallocbt_rec()
/linux-6.12.1/lib/
Dtest_maple_tree.c685 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 …]

12345678910>>...13