/linux-6.12.1/fs/ubifs/ |
D | tnc_commit.c | 17 * 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 …]
|
D | budget.c | 178 * 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-6.12.1/Documentation/userspace-api/media/dvb/ |
D | dvbapi.rst | 61 - Ported document to Docbook XML, addition of DVBv5 API, documentation gaps fix. 73 Most gaps between the uAPI document and the Kernel implementation
|
/linux-6.12.1/Documentation/arch/s390/ |
D | mm.rst | 15 - Unused gaps in the virtual memory layout could be present 17 No page tables are created for the unused gaps.
|
/linux-6.12.1/tools/testing/selftests/x86/ |
D | test_shadow_stack.c | 553 * 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-6.12.1/mm/damon/ |
D | vaddr.c | 125 * Find the two biggest gaps so that first_gap > second_gap > others. in __damon_va_three_regions() 127 * tree gaps. in __damon_va_three_regions() 155 /* Sort the two biggest gaps by address */ in __damon_va_three_regions() 211 * that cover every mapped area of the address space. Also the two gaps 224 * gaps are exceptionally huge areas in usual address space, excluding these
|
/linux-6.12.1/tools/lib/perf/include/internal/ |
D | cpumap.h | 13 * gaps if CPU numbers were used. For events associated with a pid, rather than
|
/linux-6.12.1/drivers/iommu/iommufd/ |
D | Kconfig | 28 undiscovered gaps. This option is currently intended for the
|
/linux-6.12.1/arch/sh/boards/mach-dreamcast/ |
D | setup.c | 33 /* GAPS PCI bridge assumes P2 area relative addresses. */ in dreamcast_setup()
|
/linux-6.12.1/lib/ |
D | maple_tree.c | 668 * ma_gaps() - Get a pointer to the maple node gaps. 672 * Return: A pointer to the maple node gaps 1535 /* There cannot be two gaps in a row. */ in mas_leaf_max_gap() 1544 * @gaps: The pointer to the gaps 1548 * Uses the metadata data end to scan backwards across set gaps. 1553 ma_max_gap(struct maple_node *node, unsigned long *gaps, enum maple_type mt, in ma_max_gap() argument 1561 if (gaps[i] > max_gap) { in ma_max_gap() 1562 max_gap = gaps[i]; in ma_max_gap() 1579 unsigned long *gaps; in mas_max_gap() local 1591 gaps = ma_gaps(node, mt); in mas_max_gap() [all …]
|
/linux-6.12.1/fs/xfs/scrub/ |
D | alloc_repair.c | 49 * 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 223 /* Record extents that aren't in use from gaps in the rmap records. */ 356 * Iterate all reverse mappings to find (1) the gaps between rmap records (all 377 * Iterate all the reverse mappings to find gaps in the physical in xrep_abt_find_freespace()
|
/linux-6.12.1/Documentation/devicetree/bindings/net/ |
D | qca,qca7000.txt | 28 between each data word. In burst mode these gaps aren't
|
/linux-6.12.1/arch/arm64/lib/ |
D | kasan_sw_tags.S | 33 * store in the gaps), and create a frame record (for which we can use
|
/linux-6.12.1/drivers/soc/ti/ |
D | ti_sci_inta_msi.c | 113 /* Use alloc ALL as it's unclear whether there are gaps in the indices */ in ti_sci_inta_msi_domain_alloc_irqs()
|
/linux-6.12.1/include/linux/ |
D | nfs_fs.h | 212 * might fill in the gaps, or possibly a gap is caused 215 * is not empty, then we assume the gaps were due to 218 * We can only track a limited number of concurrent gaps.
|
/linux-6.12.1/Documentation/devicetree/bindings/display/bridge/ |
D | sil,sii9022.yaml | 67 connected to any FIFO, but there can be no gaps. E.g. an I2S pin must be
|
/linux-6.12.1/Documentation/trace/ |
D | hwlat_detector.rst | 26 for some period, then looking for gaps in the TSC data. Any gap indicates a
|
D | stm.rst | 80 will help programmers and sysadmins identify gaps in configuration
|
/linux-6.12.1/include/trace/events/ |
D | netfs.h | 23 EM(netfs_read_trace_read_gaps, "READ-GAPS") \ 163 EM(netfs_folio_trace_filled_gaps, "filled-gaps") \ 174 EM(netfs_folio_trace_read_gaps, "read-gaps") \
|
/linux-6.12.1/arch/x86/kernel/ |
D | ftrace_32.S | 109 subl $3*4, %esp # RET-IP + 3 gaps
|
/linux-6.12.1/tools/thermal/tmon/ |
D | tmon.h | 91 /* keep track of instance ids since there might be gaps */
|
/linux-6.12.1/drivers/gpu/drm/imagination/ |
D | pvr_gem.h | 40 * To avoid potentially confusing gaps in the UAPI options, these kernel-only
|
/linux-6.12.1/include/net/sctp/ |
D | tsnmap.h | 31 * Last Rcvd TSN). If no gaps exist, i.e. no out of
|
/linux-6.12.1/arch/loongarch/kernel/ |
D | unwind_orc.c | 71 * "weak" entries for ensuring there are no gaps. They should be in __orc_find() 234 * These terminator entries exist to handle any gaps created by in orc_sort_cmp()
|
/linux-6.12.1/tools/testing/selftests/mm/ |
D | virtual_address_range.c | 129 /* /proc/self/maps must have gaps less than MAP_CHUNK_SIZE */ in validate_complete_va_space()
|