Searched full:neighbouring (Results 1 – 20 of 20) sorted by relevance
35 routes to neighbouring switches
44 * writes to neighbouring locations within a cacheline do not interfere
75 outside its home node, on a neighbouring chip.
80 * neighbouring mft records residing in the same page.
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()
288 /* 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.
88 * neighbouring nodes if the colors do not match (to ensure guard pages between
338 /* Expand search to cover neighbouring guard pages (or lack!) */ in i915_gem_evict_for_node()
23 * presence or absence of neighbouring conditional instructions.
679 * If the neighbouring nodes are completely full, or have different in xfs_iext_rebalance_node()796 * If the neighbouring nodes are completely full we might never be able in xfs_iext_rebalance_leaf()
4168 * the neighbouring ones. in xfs_bmapi_allocate()4246 * of the neighbouring ones. in xfs_bmapi_convert_unwritten()
624 * sfp_bus_add_upstream() - parse and register the neighbouring device
218 chunks are striped onto neighbouring devices.
418 // Remove duplicate states, note duplicate states are always neighbouring since table is sorted. in build_synthetic_soc_states()
571 * existing regions. @type is guaranteed to be minimal (all neighbouring
3405 * (for that entry and for its neighbouring PAGE_SIZE swap entries). Called
1134 * neighbouring vmas for a suitable anon_vma, before it goes off
1459 * neighbouring rq clock updates.
2266 // Remove duplicate states, note duplicate states are always neighbouring since table is sorted. in build_synthetic_soc_states()
