Searched refs:holes (Results 1 - 15 of 15) sorted by relevance

/linux-master/arch/powerpc/platforms/powernv/
H A Dpci-sriov.c573 devm_release_resource(&dev->dev, &iov->holes[i]);
574 memset(&iov->holes[i], 0, sizeof(iov->holes[i]));
580 iov->holes[i].start = res2.start;
581 iov->holes[i].end = res2.start + size * offset - 1;
582 iov->holes[i].flags = IORESOURCE_BUS;
583 iov->holes[i].name = "pnv_iov_reserved";
585 &iov->holes[i]);
H A Dpci.h249 * "holes" here is used to reserve the leading portion
252 struct resource holes[PCI_SRIOV_NUM_BARS]; member in struct:pnv_iov_data
/linux-master/fs/xfs/libxfs/
H A Dxfs_attr_leaf.h34 __u8 holes; member in struct:xfs_attr3_icleaf_hdr
H A Dxfs_da_format.h623 __u8 holes; /* != 0 if blk needs compaction */ member in struct:xfs_attr_leaf_hdr
683 __u8 holes; member in struct:xfs_attr3_leaf_hdr
H A Dxfs_attr_leaf.c172 to->holes = hdr3->holes;
186 to->holes = from->hdr.holes;
214 hdr3->holes = from->holes;
229 to->hdr.holes = from->holes;
1363 * If there are no holes in the address space of the block,
1367 if (!ichdr.holes
[all...]
/linux-master/arch/m68k/sun3/
H A Dsun3dvma.c72 static void print_holes(struct list_head *holes) argument
78 pr_info("listing dvma holes\n");
79 list_for_each(cur, holes) {
147 pr_crit("out of dvma holes! (printing hole cache)\n");
/linux-master/drivers/gpu/drm/tests/
H A Ddrm_buddy_test.c322 LIST_HEAD(holes);
369 list_move_tail(&block->link, &holes);
378 drm_buddy_free_list(&mm, &holes);
389 list_splice_tail(&holes, &blocks);
/linux-master/fs/xfs/scrub/
H A Dialloc.c580 uint64_t holes; local
615 holes = ~xfs_inobt_irec_to_allocmask(&irec);
616 if ((holes & irec.ir_free) != holes ||
/linux-master/lib/
H A Dtest_maple_tree.c685 static const unsigned long holes[] = { local
775 for (i = 0; i < ARRAY_SIZE(holes); i += 3) {
778 min, holes[i+1]>>12, holes[i+2]>>12,
779 holes[i] >> 12);
782 holes[i+1] >> 12,
783 holes[i+2] >> 12));
786 pr_debug("gap %lu %lu\n", (holes[i] >> 12),
787 (holes[i+1] >> 12));
789 MT_BUG_ON(mt, mas.last + 1 != (holes[
858 static const unsigned long holes[] = { local
[all...]
/linux-master/drivers/clk/tegra/
H A Dclk-bpmp.c426 unsigned int holes = 0; local
457 holes++;
468 dev_dbg(bpmp->dev, "holes: %u\n", holes);
/linux-master/arch/powerpc/include/asm/
H A Dpci-bridge.h233 struct resource holes[PCI_SRIOV_NUM_BARS]; member in struct:pci_dn
/linux-master/drivers/gpu/drm/i915/selftests/
H A Dintel_memory_region.c186 /* Allow for some really big holes */
242 LIST_HEAD(holes);
316 list = &holes;
328 close_objects(mem, &holes);
363 list_splice_tail(&holes, &objects);
/linux-master/fs/f2fs/
H A Dsegment.c880 block_t holes[2] = {0, 0}; /* DATA and NODE */ local
889 holes[NODE] += f2fs_usable_blks_in_seg(sbi, segno) -
892 holes[DATA] += f2fs_usable_blks_in_seg(sbi, segno) -
897 unusable = max(holes[DATA], holes[NODE]);
/linux-master/net/ipv4/
H A Dtcp_input.c2042 u32 holes; local
2044 holes = max(tp->lost_out, 1U);
2045 holes = min(holes, tp->packets_out);
2047 if ((tp->sacked_out + holes) > tp->packets_out) {
2048 tp->sacked_out = tp->packets_out - holes;
2250 * With reordering, holes may still be in flight, so RFC3517 recovery
2342 * holes, caused by lost packets.
4473 * space. Not before when we get holes.
5475 * 1) Let a chance for holes t
[all...]
/linux-master/drivers/gpu/drm/amd/include/
H A Datombios.h9234 UCHAR ucholesNo; // number of holes that follow
9235 ATOM_HOLE_INFO holes[1]; // array of hole descriptions member in struct:_ATOM_SERVICE_INFO

Completed in 470 milliseconds