Searched full:neighbouring (Results 1 – 19 of 19) sorted by relevance
37 routes to neighbouring switches
46 * writes to neighbouring locations within a cacheline do not interfere
75 outside its home node, on a neighbouring chip.
409 * 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()
289 /* Neighbouring; same colour - should fit */ in igt_evict_for_cache_color()
41 * and most reuse to be on the same i915_gem_context but on neighbouring44 * expect it to be on the neighbouring branch.
87 * neighbouring nodes if the colors do not match (to ensure guard pages between
363 /* Expand search to cover neighbouring guard pages (or lack!) */ in i915_gem_evict_for_node()
23 * presence or absence of neighbouring conditional instructions.
125 * @coeff_level: Coefficient for the darkest neighbouring pixel value443 * @distance: Distance of neighbouring pixels, either 1 or 2
696 * 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()
3986 * the neighbouring ones. in xfs_bmapi_allocate()4064 * of the neighbouring ones. in xfs_bmapi_convert_unwritten()
357 * and we can't read all of those neighbouring ptes atomically, so any in contpte_ptep_get_lockless()
619 * are used for every page of the readahead: neighbouring pages on swap
602 * existing regions. @type is guaranteed to be minimal (all neighbouring
1961 * neighbouring vmas for a suitable anon_vma, before it goes off
3830 * (for that entry and for its neighbouring PAGE_SIZE swap entries). Called
2323 * so it can prod neighbouring whenever in efx_tc_flower_replace()
1652 * neighbouring rq clock updates.