Searched full:adjacent (Results 1 – 25 of 295) sorted by relevance
12345678910>>...12
/Linux-v6.1/Documentation/devicetree/bindings/interrupt-controller/ |
D | socionext,synquacer-exiu.txt | 4 that forwards a block of 32 configurable input lines to 32 adjacent 15 - socionext,spi-base : The SPI number of the first SPI of the 32 adjacent
|
/Linux-v6.1/arch/arm64/kernel/ |
D | efi.c | 42 * with the permissions that are needed by the adjacent in create_mapping_protection() 85 * frame with an adjacent runtime memory region. Given that the page in efi_create_mapping() 87 * adjacent region gets mapped, we must avoid block mappings here so we in efi_create_mapping()
|
/Linux-v6.1/include/linux/mfd/ |
D | si476x-reports.h | 62 * @hassi: Low/High side Adjacent(100 kHz) Channel Strength Indicator 66 * @assi: Adjacent Channel(+/- 200kHz) Strength Indicator
|
/Linux-v6.1/tools/testing/selftests/kvm/lib/ |
D | sparsebit.c | 553 /* 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() 684 * adjacent index. in node_reduce() 697 * Is node adjacent to previous node and the node in node_reduce() 756 * Is next node index adjacent to current node in node_reduce() 1135 * If it is not adjacent to the first node, then there is a gap in sparsebit_first_clear() 1143 * Second node is adjacent to the first node. in sparsebit_first_clear() [all …]
|
/Linux-v6.1/net/tipc/ |
D | subscr.h | 57 * @service_list: adjacent subscriptions in name sequence's subscription list 58 * @sub_list: adjacent subscriptions in subscriber's subscription list
|
/Linux-v6.1/drivers/staging/media/atomisp/pci/ |
D | atomisp-regs.h | 56 * Enables the combining of adjacent 32-byte read requests to the same 72 * Enables the combining of adjacent 32-byte write requests to the same
|
/Linux-v6.1/fs/btrfs/ |
D | locking.h | 34 * Oftentimes we need to lock adjacent nodes on the same level while 55 * the subsequent nodes in our path, keeping our locks on those adjacent
|
D | extent_map.h | 28 /* This em is merged from two or more physically adjacent ems */
|
/Linux-v6.1/scripts/coccinelle/misc/ |
D | add_namespace.cocci | 18 // Add missing imports, but only adjacent to a MODULE_LICENSE statement.
|
/Linux-v6.1/drivers/staging/media/atomisp/pci/isp/kernels/sc/sc_1.0/ |
D | ia_css_sc_param.h | 31 * vec_slice is used for 2 adjacent vectors of shading gains.
|
/Linux-v6.1/tools/testing/selftests/vm/ |
D | map_fixed_noreplace.c | 181 * Adjacent to start of existing mapping: in main() 201 * Adjacent to end of existing mapping: in main()
|
/Linux-v6.1/Documentation/admin-guide/media/ |
D | rcar-fdp1.rst | 26 - The current field is scaled vertically by averaging adjacent lines to
|
D | si476x.rst | 143 0x18 lassi Signed Low side adjacent Channel 148 0x24 assi Adjacent channel SSI
|
/Linux-v6.1/Documentation/mm/damon/ |
D | design.rst | 132 To avoid the unbounded increase of the overhead, DAMON groups adjacent pages 156 adjacent regions and merges those if the frequency difference is small. Then,
|
/Linux-v6.1/Documentation/devicetree/bindings/gpio/ |
D | gpio-vf610.yaml | 13 The Freescale PORT/GPIO modules are two adjacent modules providing GPIO
|
/Linux-v6.1/drivers/net/ethernet/stmicro/stmmac/ |
D | stmmac.h | 58 /* Frequently used values are kept adjacent for cache effect */ 204 /* Frequently used values are kept adjacent for cache effect */
|
/Linux-v6.1/Documentation/filesystems/ |
D | fiemap.rst | 98 FIEMAP_EXTENT_MERGED, adjacent extents will not be merged. 176 adjacent blocks into 'extents'.
|
/Linux-v6.1/Documentation/admin-guide/ |
D | iostats.rst | 69 Reads and writes which are adjacent to each other may be merged for 184 typical workload usually contains a lot of successive and adjacent requests,
|
/Linux-v6.1/lib/ |
D | Kconfig.kfence | 45 pages are required; with one containing the object and two adjacent
|
/Linux-v6.1/arch/arm64/mm/ |
D | mmap.c | 47 * if the range is covered by distinct but adjacent memory regions in valid_phys_addr_range()
|
/Linux-v6.1/kernel/kcsan/ |
D | kcsan.h | 16 /* The number of adjacent watchpoints to check. */
|
/Linux-v6.1/drivers/net/wireless/ath/ath9k/ |
D | dfs.c | 151 * a) delta of adjacent max_bins is within range in ath9k_check_chirping() 152 * b) delta of adjacent deltas are within tolerance in ath9k_check_chirping()
|
/Linux-v6.1/Documentation/driver-api/ |
D | vme.rst | 252 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
|
/Linux-v6.1/drivers/net/wireless/intel/iwlegacy/ |
D | 3945-rs.c | 531 /* 802.11A walks to the next literal adjacent rate in in il3945_get_adjacent_rate() 697 /* Collect Measured throughputs of adjacent rates */ in il3945_rs_get_rate() 712 /* No throughput measured yet for adjacent rates, in il3945_rs_get_rate() 722 /* Both adjacent throughputs are measured, but neither one has in il3945_rs_get_rate()
|
/Linux-v6.1/arch/alpha/kernel/ |
D | pci_iommu.c | 472 0 : Followers all physically adjacent. 473 1 : Followers all virtually adjacent. 474 -1 : Not leader, physically adjacent to previous. 475 -2 : Not leader, virtually adjacent to previous.
|
12345678910>>...12