| /kernel/linux/linux-5.10/drivers/gpu/drm/i915/gem/selftests/ |
| H A D | i915_gem_mman.c | 623 struct drm_mm_node *hole, *next; in igt_mmap_offset_exhaustion() local
636 list_for_each_entry_safe(hole, next, &mm->hole_stack, hole_stack) { in igt_mmap_offset_exhaustion()
645 resv->start = drm_mm_hole_node_start(hole) + loop; in igt_mmap_offset_exhaustion()
646 resv->size = hole->hole_size - loop; in igt_mmap_offset_exhaustion()
655 pr_debug("Reserving hole [%llx + %llx]\n", in igt_mmap_offset_exhaustion()
670 pr_err("Unable to insert object into single page hole\n"); in igt_mmap_offset_exhaustion()
677 pr_err("Unexpectedly succeeded in inserting too large object into single page hole\n"); in igt_mmap_offset_exhaustion()
682 /* Fill the hole, further allocation attempts should then fail */ in igt_mmap_offset_exhaustion()
691 pr_err("Unable to insert object into reclaimed hole\n"); in igt_mmap_offset_exhaustion()
725 drm_mm_for_each_node_safe(hole, nex in igt_mmap_offset_exhaustion()
[all...] |
| /kernel/linux/linux-6.6/include/drm/ |
| H A D | drm_suballoc.h | 18 * @hole: Pointer to first hole node.
26 struct list_head *hole; member
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/tests/ |
| H A D | drm_mm_test.c | 48 struct drm_mm_node *hole; in assert_no_holes() local
53 drm_mm_for_each_hole(hole, mm, hole_start, hole_end) in assert_no_holes()
61 drm_mm_for_each_node(hole, mm) { in assert_no_holes()
62 if (drm_mm_hole_follows(hole)) { in assert_no_holes()
73 struct drm_mm_node *hole; in assert_one_hole() local
82 drm_mm_for_each_hole(hole, mm, hole_start, hole_end) { in assert_one_hole()
86 "empty mm has incorrect hole, found (%llx, %llx), expect (%llx, %llx)\n", in assert_one_hole()
93 KUNIT_FAIL(test, "Expected to find one hole, found %lu instead\n", count); in assert_one_hole()
125 KUNIT_FAIL(test, "node[%ld] is followed by a hole!\n", n); in assert_continuous()
217 /* After creation, it should all be one massive hole */ in drm_test_mm_init()
1156 struct drm_mm_node *hole; show_holes() local
[all...] |
| /third_party/node/deps/v8/src/objects/ |
| H A D | ordered-hash-table.cc | 346 Object hole = ReadOnlyRoots(isolate).the_hole_value(); in Delete() local
348 table.set(index + i, hole); in Delete()
501 Object hole = ReadOnlyRoots(isolate).the_hole_value(); in DeleteEntry() local
503 table->SetEntry(entry, hole, hole, details); in DeleteEntry()
889 Object hole = ReadOnlyRoots(isolate).the_hole_value(); in Delete() local
891 table.SetDataEntry(entry.as_int(), j, hole); in Delete()
906 Object hole = ReadOnlyRoots(isolate).the_hole_value(); in DeleteEntry() local
908 table->SetEntry(entry, hole, hole, detail in DeleteEntry()
[all...] |
| /kernel/linux/linux-6.6/drivers/gpu/drm/i915/gem/selftests/ |
| H A D | i915_gem_mman.c | 661 struct drm_mm_node *hole, *next; in igt_mmap_offset_exhaustion() local
675 list_for_each_entry_safe(hole, next, &mm->hole_stack, hole_stack) { in igt_mmap_offset_exhaustion()
684 resv->start = drm_mm_hole_node_start(hole) + loop; in igt_mmap_offset_exhaustion()
685 resv->size = hole->hole_size - loop; in igt_mmap_offset_exhaustion()
694 pr_debug("Reserving hole [%llx + %llx]\n", in igt_mmap_offset_exhaustion()
709 pr_err("Unable to insert object into single page hole\n"); in igt_mmap_offset_exhaustion()
716 pr_err("Unexpectedly succeeded in inserting too large object into single page hole\n"); in igt_mmap_offset_exhaustion()
721 /* Fill the hole, further allocation attempts should then fail */ in igt_mmap_offset_exhaustion()
725 pr_err("Unable to create object for reclaimed hole\n"); in igt_mmap_offset_exhaustion()
731 pr_err("Unable to insert object into reclaimed hole\ in igt_mmap_offset_exhaustion()
[all...] |
| /kernel/linux/linux-5.10/drivers/pcmcia/ |
| H A D | rsrc_nonstatic.c | 189 u_char *b, hole, most; in do_io_probe() local
204 hole = inb(i); in do_io_probe()
206 if (inb(i+j) != hole) in do_io_probe()
209 if ((j == 8) && (++b[hole] > b[most])) in do_io_probe()
210 most = hole; in do_io_probe()
|
| /kernel/linux/linux-5.10/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 */ in read_block()
84 * not the last in the file (e.g., as a result of making a hole and in read_block()
161 /* Not found, so it must be a hole */ in do_readpage()
163 dbg_gen("hole"); in do_readpage()
236 * written to a hole. This corresponds to largest budget. Later the in write_begin_slow()
356 * The page corresponds to a hole and does not in allocate_budget()
365 * Not a hole, the change will not add any new in allocate_budget()
400 * does not exist on the media (a hole), we have to budget for a new
604 int i = 0, nn = *n, offs = bu->zbranch[0].offs, hole in populate_page() local
[all...] |
| /kernel/linux/linux-6.6/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 */ in read_block()
84 * not the last in the file (e.g., as a result of making a hole and in read_block()
161 /* Not found, so it must be a hole */ in do_readpage()
163 dbg_gen("hole"); in do_readpage()
235 * written to a hole. This corresponds to largest budget. Later the in write_begin_slow()
355 * The page corresponds to a hole and does not in allocate_budget()
364 * Not a hole, the change will not add any new in allocate_budget()
399 * does not exist on the media (a hole), we have to budget for a new
603 int i = 0, nn = *n, offs = bu->zbranch[0].offs, hole in populate_page() local
[all...] |
| /kernel/linux/linux-6.6/drivers/pcmcia/ |
| H A D | rsrc_nonstatic.c | 189 u_char *b, hole, most; in do_io_probe() local
204 hole = inb(i); in do_io_probe()
206 if (inb(i+j) != hole) in do_io_probe()
209 if ((j == 8) && (++b[hole] > b[most])) in do_io_probe()
210 most = hole; in do_io_probe()
|
| /third_party/node/deps/openssl/openssl/ssl/statem/ |
| H A D | statem_lib.c | 1762 * (creating a hole between TLSv1.3 and TLSv1.1) can still in check_for_downgrade()
2043 * @real_max: The highest version below the lowest compile time version hole
2044 * where that hole lies above at least one run-time enabled
2064 int hole; in ssl_get_min_max_version() local
2099 * (protocol version client is disabled at compile-time) is also a "hole". in ssl_get_min_max_version()
2101 * Our initial state is hole == 1, version == 0. That is, versions above in ssl_get_min_max_version()
2102 * the first version in the method table are disabled (a "hole" above in ssl_get_min_max_version()
2105 * Whenever "hole == 1", and we hit an enabled method, its version becomes in ssl_get_min_max_version()
2107 * method. We're no longer in a hole, so "hole" become in ssl_get_min_max_version()
[all...] |
| /third_party/openssl/ssl/statem/ |
| H A D | statem_lib.c | 1727 * (creating a hole between TLSv1.3 and TLSv1.1) can still in check_for_downgrade()
2008 * @real_max: The highest version below the lowest compile time version hole
2009 * where that hole lies above at least one run-time enabled
2029 int hole; in ssl_get_min_max_version() local
2064 * (protocol version client is disabled at compile-time) is also a "hole". in ssl_get_min_max_version()
2066 * Our initial state is hole == 1, version == 0. That is, versions above in ssl_get_min_max_version()
2067 * the first version in the method table are disabled (a "hole" above in ssl_get_min_max_version()
2070 * Whenever "hole == 1", and we hit an enabled method, its version becomes in ssl_get_min_max_version()
2072 * method. We're no longer in a hole, so "hole" become in ssl_get_min_max_version()
[all...] |
| /kernel/linux/linux-5.10/arch/x86/mm/ |
| H A D | numa_emulation.c | 201 static u64 uniform_size(u64 max_addr, u64 base, u64 hole, int nr_nodes) in uniform_size() argument
205 unsigned long hole_pfns = PHYS_PFN(hole); in uniform_size()
|
| /kernel/linux/linux-6.6/arch/x86/mm/ |
| H A D | numa_emulation.c | 201 static u64 uniform_size(u64 max_addr, u64 base, u64 hole, int nr_nodes) in uniform_size() argument
205 unsigned long hole_pfns = PHYS_PFN(hole); in uniform_size()
|
| /kernel/linux/linux-6.6/drivers/net/wireless/broadcom/brcm80211/brcmsmac/ |
| H A D | ampdu.c | 850 u8 hole[AMPDU_MAX_MPDU]; in brcms_c_ampdu_dotxstatus_complete() local
851 memset(hole, 0, sizeof(hole)); in brcms_c_ampdu_dotxstatus_complete()
|
| /kernel/linux/linux-6.6/tools/objtool/ |
| H A D | elf.c | 209 * Returns size of hole starting at @offset.
213 struct symbol_hole hole = { in find_symbol_hole_containing() local
223 n = rb_find(&hole, &sec->symbol_tree.rb_root, symbol_hole_by_offset); in find_symbol_hole_containing()
227 return 0; /* not a hole */ in find_symbol_hole_containing()
230 if (!hole.sym) in find_symbol_hole_containing()
231 return 0; /* not a hole */ in find_symbol_hole_containing()
234 n = rb_next(&hole.sym->node); in find_symbol_hole_containing()
238 /* hole until start of next symbol */ in find_symbol_hole_containing()
|
| /kernel/linux/linux-6.6/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. */ in attr_data_get_block()
2113 CLST svcn, evcn1, vcn, len, end, alen, hole, next_svcn; in attr_punch_hole() local
2173 * Enumerate all attribute segments and punch hole where necessary. in attr_punch_hole()
2179 hole = 0; in attr_punch_hole()
2206 CLST vcn1, zero, hole2 = hole; in attr_punch_hole()
2223 /* Check if required range is already hole. */ in attr_punch_hole()
2224 if (hole2 == hole) in attr_punch_hole()
2232 /* Make a hole range (sparse) [vcn1 + zero). */ in attr_punch_hole()
2257 run_deallocate_ex(sbi, &run2, vcn1, zero, &hole, tru in attr_punch_hole()
[all...] |
| /kernel/linux/linux-6.6/drivers/net/wireless/intel/iwlwifi/mvm/ |
| H A D | sta.c | 3639 /* there's a hole at 2/3 in FW format depending on version */ in iwl_mvm_send_sta_key()
3640 int hole = api_ver >= 3 ? 0 : 2; in iwl_mvm_send_sta_key() local
3647 rx_pn[2 + hole] = seq.tkip.iv32; in iwl_mvm_send_sta_key()
3648 rx_pn[3 + hole] = seq.tkip.iv32 >> 8; in iwl_mvm_send_sta_key()
3649 rx_pn[4 + hole] = seq.tkip.iv32 >> 16; in iwl_mvm_send_sta_key()
3650 rx_pn[5 + hole] = seq.tkip.iv32 >> 24; in iwl_mvm_send_sta_key()
3657 rx_pn[2 + hole] = seq.ccmp.pn[2]; in iwl_mvm_send_sta_key()
3658 rx_pn[3 + hole] = seq.ccmp.pn[3]; in iwl_mvm_send_sta_key()
3659 rx_pn[4 + hole] = seq.ccmp.pn[4]; in iwl_mvm_send_sta_key()
3660 rx_pn[5 + hole] in iwl_mvm_send_sta_key()
[all...] |
| /kernel/linux/linux-6.6/kernel/bpf/ |
| H A D | core.c | 836 * Most BPF programs are pretty small. Allocating a hole page for each
1037 u32 size, hole, start; in bpf_jit_binary_alloc() local
1060 hole = min_t(unsigned int, size - (proglen + sizeof(*hdr)), in bpf_jit_binary_alloc()
1062 start = get_random_u32_below(hole) & ~(alignment - 1); in bpf_jit_binary_alloc()
1094 u32 size, hole, start; in bpf_jit_binary_pack_alloc() local
1122 hole = min_t(unsigned int, size - (proglen + sizeof(*ro_header)), in bpf_jit_binary_pack_alloc()
1124 start = get_random_u32_below(hole) & ~(alignment - 1); in bpf_jit_binary_pack_alloc()
|
| /kernel/linux/linux-5.10/drivers/net/wireless/broadcom/brcm80211/brcmsmac/ |
| H A D | ampdu.c | 856 u8 hole[AMPDU_MAX_MPDU]; in brcms_c_ampdu_dotxstatus_complete() local
857 memset(hole, 0, sizeof(hole)); in brcms_c_ampdu_dotxstatus_complete()
|
| /kernel/linux/linux-5.10/fs/ntfs/ |
| H A D | aops.c | 272 /* It is a hole, need to zero it. */ in ntfs_read_block()
291 * hole. This can happen due to concurrent truncate in ntfs_read_block()
722 /* It is a hole, need to instantiate it. */ in ntfs_write_block()
745 // TODO: Instantiate the hole. in ntfs_write_block()
1579 * the initialized size then pretend it is a hole unless the in ntfs_bmap()
1583 goto hole; in ntfs_bmap()
1602 * hole. in ntfs_bmap()
1604 goto hole; in ntfs_bmap()
1619 /* It is a hole. */ in ntfs_bmap()
1620 hole in ntfs_bmap()
[all...] |
| /kernel/linux/linux-6.6/fs/ntfs/ |
| H A D | aops.c | 272 /* It is a hole, need to zero it. */ in ntfs_read_block()
291 * hole. This can happen due to concurrent truncate in ntfs_read_block()
724 /* It is a hole, need to instantiate it. */ in ntfs_write_block()
747 // TODO: Instantiate the hole. in ntfs_write_block()
1582 * the initialized size then pretend it is a hole unless the in ntfs_bmap()
1586 goto hole; in ntfs_bmap()
1605 * hole. in ntfs_bmap()
1607 goto hole; in ntfs_bmap()
1622 /* It is a hole. */ in ntfs_bmap()
1623 hole in ntfs_bmap()
[all...] |
| /kernel/linux/linux-6.6/fs/nfs/ |
| H A D | nfs42xdr.c | 969 } hole; member
980 return seg->type == NFS4_CONTENT_DATA ? seg->data.length : seg->hole.length; in read_plus_segment_length()
1008 xdr_decode_hyper(p, &seg->hole.length); in decode_read_plus_segment()
|
| /kernel/linux/linux-5.10/drivers/net/ |
| H A D | virtio_net.c | 1271 unsigned int len, hole; in add_recvbuf_mergeable() local
1282 buf += headroom; /* advance address leaving hole at front of pkt */ in add_recvbuf_mergeable()
1285 hole = alloc_frag->size - alloc_frag->offset; in add_recvbuf_mergeable()
1286 if (hole < len + room) { in add_recvbuf_mergeable()
1291 len += hole; in add_recvbuf_mergeable()
1292 alloc_frag->offset += hole; in add_recvbuf_mergeable()
|
| /third_party/rust/crates/memchr/bench/data/code/ |
| H A D | rust-library.rs | 22823 // remaining hole. This is a good method. in insert_head()
22828 // hole. This method is very good. Benchmarks demonstrated slightly better in insert_head()
22834 // Intermediate state of the insertion process is always tracked by `hole`, which in insert_head()
22837 // 2. Fills the remaining hole in `v` in the end. in insert_head()
22841 // If `is_less` panics at any point during the process, `hole` will get dropped and in insert_head()
22842 // fill the hole in `v` with `tmp`, thus ensuring that `v` still holds every object it in insert_head()
22844 let mut hole = InsertionHole { src: &mut *tmp, dest: &mut v[1] }; in insert_head() variables
22852 hole.dest = &mut v[i]; in insert_head()
22854 // `hole` gets dropped and thus copies `tmp` into the remaining hole i in insert_head()
22905 let mut hole; merge() variables
44804 let mut hole = unsafe { Hole::new(&mut self.data, pos) }; sift_up() variables
44832 let mut hole = unsafe { Hole::new(&mut self.data, pos) }; sift_down_range() variables
44891 let mut hole = unsafe { Hole::new(&mut self.data, pos) }; sift_down_to_bottom() variables
[all...] |
| /kernel/linux/linux-5.10/kernel/bpf/ |
| H A D | core.c | 873 u32 size, hole, start, pages; in bpf_jit_binary_alloc() local
897 hole = min_t(unsigned int, size - (proglen + sizeof(*hdr)), in bpf_jit_binary_alloc()
899 start = (get_random_int() % hole) & ~(alignment - 1); in bpf_jit_binary_alloc()
|