/linux-master/arch/m68k/sun3/ |
H A D | sun3dvma.c | 29 struct hole { struct 38 static struct hole initholes[64]; 76 struct hole *hole; local 80 hole = list_entry(cur, struct hole, list); 82 if((hole->start == 0) && (hole->end == 0) && (hole->size == 0)) 85 pr_info("hole 96 struct hole *hole; local 143 struct hole *hole; local 194 struct hole *hole; local 238 struct hole *hole; local [all...] |
/linux-master/drivers/gpu/drm/ |
H A D | drm_suballoc.c | 30 * We store the last allocated bo in "hole", we always try to allocate 78 sa_manager->hole = &sa_manager->olist; 101 sa_manager->hole = &sa_manager->olist; 118 if (sa_manager->hole == &sa->olist) 119 sa_manager->hole = sa->olist.prev; 131 if (sa_manager->hole->next == &sa_manager->olist) 134 sa = list_entry(sa_manager->hole->next, struct drm_suballoc, olist); 145 struct list_head *hole = sa_manager->hole; local 147 if (hole ! 155 struct list_head *hole = sa_manager->hole; local [all...] |
H A D | drm_mm.c | 379 * DECLARE_NEXT_HOLE_ADDR - macro to declare next hole functions 384 * This macro declares a function to return the next hole of the addr rb tree. 448 * 0 on success, -ENOSPC if there's no hole where @node is. 452 struct drm_mm_node *hole; local 461 /* Find the relevant hole to add our node to */ 462 hole = find_hole_addr(mm, node->start, 0); 463 if (!hole) 466 adj_start = hole_start = __drm_mm_hole_node_start(hole); 467 adj_end = hole_end = hole_start + hole->hole_size; 470 mm->color_adjust(hole, nod 521 struct drm_mm_node *hole; local 784 struct drm_mm_node *hole; local 915 struct drm_mm_node *hole; local [all...] |
/linux-master/drivers/md/dm-vdo/ |
H A D | int-map.c | 447 * @hole: The empty bucket to fill with an entry that precedes it in one of its enclosing 454 * Return: The bucket that was vacated by moving its entry to the provided hole, or NULL if no 458 struct bucket *hole) 463 * arithmetic since this function is only called when hole is at least NEIGHBORHOOD cells 468 for (bucket = &hole[1 - NEIGHBORHOOD]; bucket < hole; bucket++) { 484 * Skip this bucket if its first entry is actually further away than the hole that 487 if (hole < new_hole) 492 * the hole closer to the hash bucket, if not all the way into its neighborhood. 496 * The entry that will be the new hole i 457 move_empty_bucket(struct int_map *map __always_unused, struct bucket *hole) argument 566 struct bucket *hole = find_empty_bucket(map, neighborhood, MAX_PROBES); local [all...] |
/linux-master/drivers/gpu/drm/i915/gem/selftests/ |
H A D | i915_gem_client_blt.c | 104 u64 hole; member in struct:tiled_blits 534 struct drm_mm_node hole; local 558 memset(&hole, 0, sizeof(hole)); 559 err = drm_mm_insert_node_in_range(&t->ce->vm->mm, &hole, 565 drm_mm_remove_node(&hole); 572 t->hole = hole.start + t->align; 573 pr_info("Using hole at %llx\n", t->hole); [all...] |
H A D | i915_gem_mman.c | 661 struct drm_mm_node *hole, *next; local 675 list_for_each_entry_safe(hole, next, &mm->hole_stack, hole_stack) { 684 resv->start = drm_mm_hole_node_start(hole) + loop; 685 resv->size = hole->hole_size - loop; 694 pr_debug("Reserving hole [%llx + %llx]\n", 709 pr_err("Unable to insert object into single page hole\n"); 716 pr_err("Unexpectedly succeeded in inserting too large object into single page hole\n"); 721 /* Fill the hole, further allocation attempts should then fail */ 725 pr_err("Unable to create object for reclaimed hole\n"); 731 pr_err("Unable to insert object into reclaimed hole\ [all...] |
/linux-master/tools/perf/util/ |
H A D | block-range.c | 97 * Didn't find anything.. there's a hole at @start, however @end might 268 * If there is a hole between @entry and @next, fill it. 271 struct block_range *hole = malloc(sizeof(struct block_range)); local 272 if (!hole) 275 *hole = (struct block_range){ 282 rb_link_left_of_node(&hole->node, &next->node); 283 rb_insert_color(&hole->node, &block_ranges.root);
|
/linux-master/drivers/gpu/drm/tests/ |
H A D | drm_mm_test.c | 40 struct drm_mm_node *hole; local 45 drm_mm_for_each_hole(hole, mm, hole_start, hole_end) 53 drm_mm_for_each_node(hole, mm) { 54 if (drm_mm_hole_follows(hole)) { 65 struct drm_mm_node *hole; local 74 drm_mm_for_each_hole(hole, mm, hole_start, hole_end) { 78 "empty mm has incorrect hole, found (%llx, %llx), expect (%llx, %llx)\n", 85 KUNIT_FAIL(test, "Expected to find one hole, found %lu instead\n", count); 158 /* After creation, it should all be one massive hole */ 160 KUNIT_FAIL(test, "mm not one hole o [all...] |
/linux-master/include/drm/ |
H A D | drm_suballoc.h | 18 * @hole: Pointer to first hole node. 26 struct list_head *hole; member in struct:drm_suballoc_manager
|
/linux-master/drivers/gpu/drm/i915/selftests/ |
H A D | i915_gem_evict.c | 388 struct drm_mm_node hole; local 409 memset(&hole, 0, sizeof(hole)); 411 err = i915_gem_gtt_insert(&ggtt->vm, NULL, &hole, 444 drm_mm_remove_node(&hole); 529 if (drm_mm_node_allocated(&hole)) 530 drm_mm_remove_node(&hole);
|
/linux-master/fs/xfs/scrub/ |
H A D | ialloc.c | 54 * Does the finobt have a record for this inode with the same hole/free state? 61 * - The finobt need not have a record if the inobt record says this is a hole. 70 bool hole) 94 /* There's a finobt record; free and hole status must match. */ 102 if (fhole != hole) 115 /* inobt record says this is a hole */ 116 if (hole) 150 bool free, hole; local 155 hole = irec->ir_holemask & (1U << hole_idx); 157 error = xchk_inobt_xref_finobt(sc, irec, i, free, hole); 65 xchk_inobt_xref_finobt( struct xfs_scrub *sc, struct xfs_inobt_rec_incore *irec, xfs_agino_t agino, bool free, bool hole) argument 177 bool free, hole; local [all...] |
/linux-master/fs/bcachefs/ |
H A D | io_read.h | 42 hole:1, member in struct:bch_read_bio::__anon1636::__anon1637
|
H A D | alloc_background.c | 919 static struct bkey_s_c bch2_get_key_or_hole(struct btree_iter *iter, struct bpos end, struct bkey *hole) argument 953 bkey_init(hole); 954 hole->p = iter->pos; 956 bch2_key_resize(hole, next.offset - iter->pos.offset); 957 return (struct bkey_s_c) { hole, NULL }; 989 static struct bkey_s_c bch2_get_key_or_real_bucket_hole(struct btree_iter *iter, struct bkey *hole) argument 994 k = bch2_get_key_or_hole(iter, POS_MAX, hole); 1012 bch2_key_resize(hole, ca->mi.nbuckets - bucket.offset); 1177 "hole in alloc btree missing in freespace btree\n" 1238 "hole i 1409 struct bkey hole; local 2043 struct bkey hole; local [all...] |
H A D | io_read.c | 398 rbio->hole = true; 824 /* hole or reservation - just zero fill: */ 826 goto hole; 863 goto hole; 970 rbio->hole = 0; 1076 hole: 1083 orig->hole = true;
|
/linux-master/fs/xfs/ |
H A D | xfs_mount.c | 62 int hole, i; local 76 for (i = 0, hole = -1; i < xfs_uuid_table_size; i++) { 78 hole = i; 85 if (hole < 0) { 89 hole = xfs_uuid_table_size++; 91 xfs_uuid_table[hole] = *uuid;
|
/linux-master/drivers/pcmcia/ |
H A D | rsrc_nonstatic.c | 189 u_char *b, hole, most; local 204 hole = inb(i); 206 if (inb(i+j) != hole) 209 if ((j == 8) && (++b[hole] > b[most])) 210 most = hole;
|
/linux-master/arch/x86/mm/ |
H A D | numa_emulation.c | 201 static u64 uniform_size(u64 max_addr, u64 base, u64 hole, int nr_nodes) argument 205 unsigned long hole_pfns = PHYS_PFN(hole);
|
/linux-master/drivers/gpu/drm/xe/ |
H A D | xe_ggtt.c | 205 struct drm_mm_node *hole; local 211 drm_mm_for_each_hole(hole, &ggtt->mm, start, end)
|
/linux-master/fs/ubifs/ |
H A D | file.c | 19 * required for the page e.g., when it corresponds to a file hole or it is 57 /* Not found, so it must be a hole */ 84 * not the last in the file (e.g., as a result of making a hole and 166 /* Not found, so it must be a hole */ 168 dbg_gen("hole"); 231 * written to a hole. This corresponds to largest budget. Later the 353 * The page corresponds to a hole and does not 362 * Not a hole, the change will not add any new 397 * does not exist on the media (a hole), we have to budget for a new 602 int i = 0, nn = *n, offs = bu->zbranch[0].offs, hole local [all...] |
/linux-master/tools/objtool/ |
H A D | elf.c | 207 * Returns size of hole starting at @offset. 211 struct symbol_hole hole = { local 221 n = rb_find(&hole, &sec->symbol_tree.rb_root, symbol_hole_by_offset); 225 return 0; /* not a hole */ 228 if (!hole.sym) 229 return 0; /* not a hole */ 232 n = rb_next(&hole.sym->node); 236 /* hole until start of next symbol */
|
/linux-master/drivers/net/wireless/broadcom/brcm80211/brcmsmac/ |
H A D | ampdu.c | 850 u8 hole[AMPDU_MAX_MPDU]; local 851 memset(hole, 0, sizeof(hole));
|
/linux-master/fs/ntfs3/ |
H A D | attrib.c | 875 * @new != NULL means allocate real cluster if 'vcn' maps to hole 910 /* No cluster in cache or we need to allocate cluster in hole. */ 2113 CLST svcn, evcn1, vcn, len, end, alen, hole, next_svcn; local 2173 * Enumerate all attribute segments and punch hole where necessary. 2179 hole = 0; 2206 CLST vcn1, zero, hole2 = hole; 2223 /* Check if required range is already hole. */ 2224 if (hole2 == hole) 2232 /* Make a hole range (sparse) [vcn1 + zero). */ 2257 run_deallocate_ex(sbi, &run2, vcn1, zero, &hole, tru [all...] |
/linux-master/kernel/bpf/ |
H A D | core.c | 866 * Most BPF programs are pretty small. Allocating a hole page for each 1067 u32 size, hole, start; local 1090 hole = min_t(unsigned int, size - (proglen + sizeof(*hdr)), 1092 start = get_random_u32_below(hole) & ~(alignment - 1); 1124 u32 size, hole, start; local 1151 hole = min_t(unsigned int, size - (proglen + sizeof(*ro_header)), 1153 start = get_random_u32_below(hole) & ~(alignment - 1);
|
/linux-master/drivers/net/wireless/intel/iwlwifi/mvm/ |
H A D | sta.c | 3649 /* there's a hole at 2/3 in FW format depending on version */ 3650 int hole = api_ver >= 3 ? 0 : 2; local 3657 rx_pn[2 + hole] = seq.tkip.iv32; 3658 rx_pn[3 + hole] = seq.tkip.iv32 >> 8; 3659 rx_pn[4 + hole] = seq.tkip.iv32 >> 16; 3660 rx_pn[5 + hole] = seq.tkip.iv32 >> 24; 3667 rx_pn[2 + hole] = seq.ccmp.pn[2]; 3668 rx_pn[3 + hole] = seq.ccmp.pn[3]; 3669 rx_pn[4 + hole] = seq.ccmp.pn[4]; 3670 rx_pn[5 + hole] [all...] |
/linux-master/fs/nfs/ |
H A D | nfs42xdr.c | 969 } hole; member in union:read_plus_segment::__anon535 980 return seg->type == NFS4_CONTENT_DATA ? seg->data.length : seg->hole.length; 1008 xdr_decode_hyper(p, &seg->hole.length);
|