Home
last modified time | relevance | path

Searched full:gaps (Results 1 – 25 of 153) sorted by relevance

1234567

/linux/tools/testing/selftests/bpf/progs/
H A Dverifier_arena_large.c175 * on the first pass and then fills in all gaps on the second pass.
194 /* Allocator must fill into gaps */ in alloc_pages()
231 /* Allocate into freed gaps */ in big_alloc2()
247 /* Allocate 2 pages at a time into freed gaps */ in big_alloc2()
/linux/fs/ubifs/
H A Dtnc_commit.c17 * make_idx_node - make an index node for fill-the-gaps method of TNC commit.
97 * fill_gap - make index nodes in gaps in dirty index LEBs.
213 * layout_leb_in_gaps - layout index nodes using in-the-gaps method.
217 * This function lays out new index nodes for dirty znodes using in-the-gaps
221 * This function returns the number of index nodes written into the gaps, or a
270 * The obsolete index nodes form gaps that can be in layout_leb_in_gaps()
347 * layout_in_gaps - in-the-gaps method of committing TNC.
351 * This function lays out new index nodes for dirty znodes using in-the-gaps
381 * option which forces in-the-gaps is enabled. in layout_in_gaps()
563 * into the gaps created by obsolete index nodes in non-empty index LEBs. For
[all …]
H A Dbudget.c178 * The index head is not available for the in-the-gaps method, so add an in ubifs_calc_min_idx_lebs()
274 * that the "in-the-gaps" commit method always succeeds and UBIFS will always
314 * before they can be used. And the in-the-gaps method will grab these in do_budget_space()
/linux/Documentation/userspace-api/media/dvb/
H A Ddvbapi.rst61 - Ported document to Docbook XML, addition of DVBv5 API, documentation gaps fix.
73 Most gaps between the uAPI document and the Kernel implementation
/linux/Documentation/arch/s390/
H A Dmm.rst15 - Unused gaps in the virtual memory layout could be present
17 No page tables are created for the unused gaps.
/linux/tools/testing/selftests/x86/
H A Dtest_shadow_stack.c553 * direction, filling any gaps until it encounters the shadow stack's
556 * of the above gaps are filled. The search down algorithm will have
557 * looked at the shadow stack gaps.
597 printf("[OK]\tGuard gap test, other mapping's gaps\n"); in test_guard_gap_other_gaps()
650 printf("[OK]\tGuard gap test, placement mapping's gaps\n"); in test_guard_gap_new_mappings_gaps()
1047 printf("[FAIL]\tGuard gap test, other mappings' gaps\n"); in main()
1053 printf("[FAIL]\tGuard gap test, placement mapping's gaps\n"); in main()
/linux/mm/
H A Dmseal.c25 * of ranges in the remaining gaps later, meaning that the user might then
62 /* We know there are no gaps so this will be non-NULL. */ in mseal_apply()
/linux/mm/damon/
H A Dvaddr.c129 * Find the two biggest gaps so that first_gap > second_gap > others. in __damon_va_three_regions()
131 * tree gaps. in __damon_va_three_regions()
159 /* Sort the two biggest gaps by address */ in __damon_va_three_regions()
215 * that cover every mapped area of the address space. Also the two gaps
228 * gaps are exceptionally huge areas in usual address space, excluding these
/linux/include/linux/mfd/
H A Drohm-bd96802.h7 * while this header only holds the IRQ definitions - mainly to avoid gaps in
/linux/lib/
H A Dmaple_tree.c679 * ma_gaps() - Get a pointer to the maple node gaps.
683 * Return: A pointer to the maple node gaps
1551 /* There cannot be two gaps in a row. */ in mas_leaf_max_gap()
1560 * @gaps: The pointer to the gaps
1564 * Uses the metadata data end to scan backwards across set gaps.
1569 ma_max_gap(struct maple_node *node, unsigned long *gaps, enum maple_type mt, in ma_max_gap() argument
1577 if (gaps[i] > max_gap) { in ma_max_gap()
1578 max_gap = gaps[i]; in ma_max_gap()
1595 unsigned long *gaps; in mas_max_gap() local
1607 gaps = ma_gaps(node, mt); in mas_max_gap()
[all …]
/linux/fs/xfs/scrub/
H A Dalloc_repair.c49 * for gaps in the physical extents recorded in the rmapbt. These records are
50 * staged in @free_records. Identifying the gaps is more difficult on a
222 /* Record extents that aren't in use from gaps in the rmap records. */
355 * Iterate all reverse mappings to find (1) the gaps between rmap records (all
376 * Iterate all the reverse mappings to find gaps in the physical in xrep_abt_find_freespace()
H A Drtbitmap_repair.c323 * Walk the rtrmapbt to find all the gaps between records, and mark the gaps
/linux/arch/sh/boards/mach-dreamcast/
H A Dsetup.c33 /* GAPS PCI bridge assumes P2 area relative addresses. */ in dreamcast_setup()
/linux/sound/hda/codecs/hdmi/
H A DKconfig50 any connected external receiver. This allows to avoid gaps
/linux/Documentation/devicetree/bindings/net/
H A Dqca,qca7000.yaml44 between each data word. In burst mode these gaps aren't
/linux/arch/arm64/lib/
H A Dkasan_sw_tags.S33 * store in the gaps), and create a frame record (for which we can use
/linux/drivers/soc/ti/
H A Dti_sci_inta_msi.c111 /* Use alloc ALL as it's unclear whether there are gaps in the indices */ in ti_sci_inta_msi_domain_alloc_irqs()
/linux/include/linux/
H A Dnfs_fs.h236 * might fill in the gaps, or possibly a gap is caused
239 * is not empty, then we assume the gaps were due to
242 * We can only track a limited number of concurrent gaps.
/linux/include/trace/events/
H A Dnetfs.h23 EM(netfs_read_trace_read_gaps, "READ-GAPS") \
194 EM(netfs_folio_trace_filled_gaps, "filled-gaps") \
206 EM(netfs_folio_trace_read_gaps, "read-gaps") \
/linux/Documentation/trace/
H A Dhwlat_detector.rst26 for some period, then looking for gaps in the TSC data. Any gap indicates a
/linux/arch/loongarch/kernel/
H A Dunwind_orc.c72 * "weak" entries for ensuring there are no gaps. They should be in __orc_find()
235 * These terminator entries exist to handle any gaps created by in orc_sort_cmp()
/linux/tools/thermal/tmon/
H A Dtmon.h91 /* keep track of instance ids since there might be gaps */
/linux/include/net/sctp/
H A Dtsnmap.h31 * Last Rcvd TSN). If no gaps exist, i.e. no out of
/linux/arch/x86/kernel/
H A Dftrace_32.S109 subl $3*4, %esp # RET-IP + 3 gaps
/linux/Documentation/virt/kvm/
H A Dreview-checklist.rst95 as that can help identify gaps in existing test suites.

1234567