Home
last modified time | relevance | path

Searched full:neighbouring (Results 1 – 24 of 24) sorted by relevance

/linux/Documentation/devicetree/bindings/net/dsa/
H A Ddsa-port.yaml37 routes to neighbouring switches
/linux/drivers/gpu/drm/i915/selftests/
H A Di915_syncmap.c409 * neighbouring ids, they all fit into the same leaf. in igt_syncmap_neighbours()
433 …pr_err("Inserting neighbouring context=0x%llx+%d, did not fit into the same leaf bitmap=%x (%d), e… in igt_syncmap_neighbours()
458 * If we construct a tree with ids that are neighbouring at a non-zero in igt_syncmap_compact()
H A Di915_gem_evict.c289 /* Neighbouring; same colour - should fit */ in igt_evict_for_cache_color()
/linux/arch/arm/common/
H A Dvlock.S46 * writes to neighbouring locations within a cacheline do not interfere
/linux/Documentation/arch/powerpc/
H A Dvcpudispatch_stats.rst75 outside its home node, on a neighbouring chip.
/linux/drivers/gpu/drm/i915/
H A Di915_syncmap.c41 * and most reuse to be on the same i915_gem_context but on neighbouring
44 * expect it to be on the neighbouring branch.
H A Di915_gem_gtt.c87 * neighbouring nodes if the colors do not match (to ensure guard pages between
H A Di915_gem_evict.c363 /* Expand search to cover neighbouring guard pages (or lack!) */ in i915_gem_evict_for_node()
/linux/arch/arm/include/asm/
H A Dspinlock.h23 * presence or absence of neighbouring conditional instructions.
/linux/include/uapi/linux/media/raspberrypi/
H A Dpisp_be_config.h124 * @coeff_level: Coefficient for the darkest neighbouring pixel value
442 * @distance: Distance of neighbouring pixels, either 1 or 2
/linux/fs/xfs/libxfs/
H A Dxfs_iext_tree.c696 * If the neighbouring nodes are completely full, or have different in xfs_iext_rebalance_node()
813 * If the neighbouring nodes are completely full we might never be able in xfs_iext_rebalance_leaf()
H A Dxfs_bmap.c4237 * the neighbouring ones. in xfs_bmapi_allocate()
4315 * of the neighbouring ones. in xfs_bmapi_convert_unwritten()
/linux/arch/arm64/mm/
H A Dcontpte.c191 * and we can't read all of those neighbouring ptes atomically, so any in contpte_ptep_get_lockless()
/linux/drivers/gpu/drm/amd/display/dc/dml2/
H A Ddml2_policy.c264 // Remove duplicate states, note duplicate states are always neighbouring since table is sorted. in dml2_policy_build_synthetic_soc_states()
/linux/Documentation/admin-guide/
H A Dmd.rst218 chunks are striped onto neighbouring devices.
/linux/drivers/net/phy/
H A Dsfp-bus.c655 * sfp_bus_add_upstream() - parse and register the neighbouring device
/linux/mm/
H A Dswap_state.c653 * are used for every page of the readahead: neighbouring pages on swap
H A Dvma.c1761 * neighbouring vmas for a suitable anon_vma, before it goes off
H A Dmemblock.c578 * existing regions. @type is guaranteed to be minimal (all neighbouring
H A Dswapfile.c3770 * (for that entry and for its neighbouring PAGE_SIZE swap entries). Called
/linux/drivers/gpu/drm/amd/display/dc/dml/dcn321/
H A Ddcn321_fpu.c558 // Remove duplicate states, note duplicate states are always neighbouring since table is sorted. in build_synthetic_soc_states()
/linux/drivers/net/ethernet/sfc/
H A Dtc.c2323 * so it can prod neighbouring whenever in efx_tc_flower_replace()
/linux/kernel/sched/
H A Dsched.h1611 * neighbouring rq clock updates.
/linux/drivers/gpu/drm/amd/display/dc/dml/dcn32/
H A Ddcn32_fpu.c3008 // Remove duplicate states, note duplicate states are always neighbouring since table is sorted. in build_synthetic_soc_states()