Home
last modified time | relevance | path

Searched full:adjacent (Results 1 – 25 of 281) sorted by relevance

12345678910>>...12

/linux/tools/perf/pmu-events/arch/x86/amdzen4/
H A Dmemory.json46 …TLB hits for coalesced pages. A coalesced page is a 16k page created from four adjacent 4k pages.",
70 …quested) for coalesced pages. A coalesced page is a 16k page created from four adjacent 4k pages.",
141 …quested) for coalesced pages. A coalesced page is a 16k page created from four adjacent 4k pages.",
153 …LB for 4k or coalesced pages. A coalesced page is a 16k page created from four adjacent 4k pages.",
/linux/drivers/dma/xilinx/
H A Dxdma-regs.h41 #define XDMA_DESC_CONTROL(adjacent, flag) \ argument
43 FIELD_PREP(XDMA_DESC_ADJACENT_BITS, (adjacent) - 1) | \
54 * extra adjacent number gives the amount of extra contiguous descriptors.
/linux/Documentation/devicetree/bindings/interrupt-controller/
H A Dsocionext,synquacer-exiu.yaml14 that forwards a block of 32 configurable input lines to 32 adjacent
31 description: The SPI number of the first SPI of the 32 adjacent ones the
/linux/kernel/bpf/
H A Drange_tree.c18 * adjacent ranges are merged or split at the same time.
214 /* Do we have a left-adjacent range ? */ in range_tree_set()
219 /* Do we have a right-adjacent range ? */ in range_tree_set()
225 /* Combine left and right adjacent ranges */ in range_tree_set()
/linux/arch/arm64/kernel/
H A Defi.c55 * with the permissions that are needed by the adjacent in create_mapping_protection()
94 * frame with an adjacent runtime memory region. Given that the page in efi_create_mapping()
96 * adjacent region gets mapped, we must avoid block mappings here so we in efi_create_mapping()
/linux/tools/testing/selftests/kvm/lib/
H A Dsparsebit.c553 /* Iteratively reduces the node pointed to by nodep and its adjacent
555 * all bits set adjacent to a previous node, will get combined into a
562 * and the adjacent nodes that are reduced are not discovered. It is the
582 * adjacent node that the bit settings could be merged into.
623 * both prev and next both check for an adjacent in node_reduce()
683 * adjacent index. in node_reduce()
696 * Is node adjacent to previous node and the node in node_reduce()
755 * Is next node index adjacent to current node in node_reduce()
1134 * If it is not adjacent to the first node, then there is a gap in sparsebit_first_clear()
1142 * Second node is adjacent to the first node. in sparsebit_first_clear()
[all …]
/linux/include/linux/mfd/
H A Dsi476x-reports.h62 * @hassi: Low/High side Adjacent(100 kHz) Channel Strength Indicator
66 * @assi: Adjacent Channel(+/- 200kHz) Strength Indicator
/linux/net/tipc/
H A Dsubscr.h57 * @service_list: adjacent subscriptions in name sequence's subscription list
58 * @sub_list: adjacent subscriptions in subscriber's subscription list
/linux/drivers/gpu/drm/amd/amdgpu/
H A Dta_xgmi_if.h43 /* Gets the total links between adjacent peer dies in hive */
45 /* Gets the total links and connected port numbers between adjacent peer dies in hive */
/linux/tools/perf/util/
H A Dcacheline.h11 * Some architectures have 'Adjacent Cacheline Prefetch' feature,
/linux/scripts/coccinelle/misc/
H A Dadd_namespace.cocci18 // Add missing imports, but only adjacent to a MODULE_LICENSE statement.
/linux/tools/testing/selftests/mm/
H A Dmap_fixed_noreplace.c157 * Adjacent to start of existing mapping: in main()
175 * Adjacent to end of existing mapping: in main()
/linux/fs/btrfs/
H A Dlocking.h39 * Oftentimes we need to lock adjacent nodes on the same level while
60 * the subsequent nodes in our path, keeping our locks on those adjacent
/linux/Documentation/admin-guide/media/
H A Dsi476x.rst143 0x18 lassi Signed Low side adjacent Channel
148 0x24 assi Adjacent channel SSI
H A Drcar-fdp1.rst26 - The current field is scaled vertically by averaging adjacent lines to
/linux/Documentation/filesystems/
H A Dfiemap.rst81 FIEMAP_EXTENT_MERGED, adjacent extents will not be merged.
159 adjacent blocks into 'extents'.
/linux/Documentation/devicetree/bindings/reserved-memory/
H A Dqcom,rmtfs-mem.yaml33 memory protection of this region when placed adjacent to other protected
/linux/tools/testing/selftests/bpf/progs/
H A Dverifier_bitfield_write.c60 __description("adjacent CO-RE bitfield roundtrip")
/linux/Documentation/devicetree/bindings/gpio/
H A Dgpio-vf610.yaml13 The Freescale PORT/GPIO modules are two adjacent modules providing GPIO
/linux/include/linux/
H A Dexport.h28 * LLVM integrated assembler cam merge adjacent string literals (like
/linux/lib/
H A DKconfig.kfence45 pages are required; with one containing the object and two adjacent
/linux/arch/alpha/kernel/
H A Dpci_iommu.c469 0 : Followers all physically adjacent.
470 1 : Followers all virtually adjacent.
471 -1 : Not leader, physically adjacent to previous.
472 -2 : Not leader, virtually adjacent to previous.
/linux/drivers/net/wireless/intel/iwlegacy/
H A D3945-rs.c532 /* 802.11A walks to the next literal adjacent rate in in il3945_get_adjacent_rate()
698 /* Collect Measured throughputs of adjacent rates */ in il3945_rs_get_rate()
713 /* No throughput measured yet for adjacent rates, in il3945_rs_get_rate()
723 /* Both adjacent throughputs are measured, but neither one has in il3945_rs_get_rate()
/linux/Documentation/mm/
H A Dmultigen_lru.rst124 the aging scans the adjacent PTEs. For both, on finding a young PTE,
190 trips into the rmap. It scans the adjacent PTEs of a young PTE and
/linux/Documentation/driver-api/
H A Dvme.rst252 monitoring adjacent locations. The function :c:func:`vme_lm_count` can be used
270 location. Each location monitor can monitor a number of adjacent locations. The

12345678910>>...12