| /linux-6.15/fs/xfs/libxfs/ |
| H A D | xfs_dir2_leaf.c | 48 to->stale = be16_to_cpu(from3->hdr.stale); in xfs_dir2_leaf_hdr_from_disk() 58 to->stale = be16_to_cpu(from->hdr.stale); in xfs_dir2_leaf_hdr_from_disk() 82 to3->hdr.stale = cpu_to_be16(from->stale); in xfs_dir2_leaf_hdr_to_disk() 91 to->hdr.stale = cpu_to_be16(from->stale); in xfs_dir2_leaf_hdr_to_disk() 148 int stale; in xfs_dir3_leaf_check_int() local 179 stale++; in xfs_dir3_leaf_check_int() 185 if (hdr->stale != stale) in xfs_dir3_leaf_check_int() 488 leafhdr.stale = be32_to_cpu(btp->stale); in xfs_dir2_block_to_leaf() 637 leafhdr->stale--; in xfs_dir3_leaf_find_entry() 657 leafhdr->stale--; in xfs_dir3_leaf_find_entry() [all …]
|
| H A D | xfs_dir2_block.c | 216 if (btp->stale) { in xfs_dir2_block_need_space() 337 *lfloglow = toidx + 1 - (be32_to_cpu(btp->stale) - 1); in xfs_dir2_block_compact() 338 *lfloghigh -= be32_to_cpu(btp->stale) - 1; in xfs_dir2_block_compact() 339 be32_add_cpu(&btp->count, -(be32_to_cpu(btp->stale) - 1)); in xfs_dir2_block_compact() 344 btp->stale = cpu_to_be32(1); in xfs_dir2_block_compact() 447 } else if (btp->stale) { in xfs_dir2_block_addname() 474 if (!btp->stale) { in xfs_dir2_block_addname() 553 be32_add_cpu(&btp->stale, -1); in xfs_dir2_block_addname() 833 be32_add_cpu(&btp->stale, 1); in xfs_dir2_block_removename() 1034 btp->stale = 0; in xfs_dir2_leaf_to_block() [all …]
|
| H A D | xfs_dir2_node.c | 539 if (!leafhdr.stale) in xfs_dir2_leafn_add() 996 if (shdr->stale) { in xfs_dir3_leafn_moveents() 1002 stale++; in xfs_dir3_leafn_moveents() 1005 stale = 0; in xfs_dir3_leafn_moveents() 1028 shdr->stale -= stale; in xfs_dir3_leafn_moveents() 1030 dhdr->stale += stale; in xfs_dir3_leafn_moveents() 1110 oldstale = hdr1.stale + hdr2.stale; in xfs_dir2_leafn_rebalance() 1149 ASSERT(hdr1.stale + hdr2.stale == oldstale); in xfs_dir2_leafn_rebalance() 1318 leafhdr.stale++; in xfs_dir2_leafn_remove() 1654 if (drophdr.stale) in xfs_dir2_leafn_unbalance() [all …]
|
| H A D | xfs_da_format.h | 426 __be16 stale; /* count of stale entries */ member 432 __be16 stale; /* count of stale entries */ member 542 __be32 stale; /* count of stale lf entries */ member
|
| H A D | xfs_dir2_data.c | 115 int stale; /* count of stale leaves */ in __xfs_dir3_data_check() local 278 for (i = stale = 0; i < be32_to_cpu(btp->count); i++) { in __xfs_dir3_data_check() 281 stale++; in __xfs_dir3_data_check() 286 if (count != be32_to_cpu(btp->count) - be32_to_cpu(btp->stale)) in __xfs_dir3_data_check() 288 if (stale != be32_to_cpu(btp->stale)) in __xfs_dir3_data_check()
|
| /linux-6.15/drivers/gpu/drm/i915/gt/ |
| H A D | intel_gt_buffer_pool.c | 39 struct intel_gt_buffer_pool_node *node, *stale = NULL; in pool_free_older_than() local 67 node->free = stale; in pool_free_older_than() 68 stale = node; in pool_free_older_than() 79 while ((node = stale)) { in pool_free_older_than() 80 stale = stale->free; in pool_free_older_than()
|
| /linux-6.15/Documentation/admin-guide/hw-vuln/ |
| H A D | processor_mmio_stale_data.rst | 12 stale data into core fill buffers where the data can subsequently be inferred 21 Propagators are operations that result in stale data being copied or moved from 23 Vulnerabilities are operations that may result in stale data being directly 31 does not make stale data architecturally visible. Stale data must be propagated 36 The sideband stale data propagator (SSDP) is limited to the client (including 40 both requested data and unrequested stale data, from a transaction buffer and 41 the sideband response buffer. As a result, stale data from the sideband 46 The primary stale data propagator (PSDP) is limited to the client (including 50 buffer including both requested data and unrequested stale data. This is 51 similar to the sideband stale data propagator. [all …]
|
| H A D | gather_data_sampling.rst | 13 instruction that is transiently executed encounters a fault, stale data from 16 infer stale data using typical side channel techniques like cache timing 19 The attacker uses gather instructions to infer the stale vector register data. 29 Without mitigation, GDS can infer stale data across virtually all
|
| /linux-6.15/fs/xfs/scrub/ |
| H A D | dirtree.c | 295 dl->stale = true; in xchk_dirpath_revalidate() 382 if (dl->stale) { in xchk_dirpath_step_up() 482 if (dl->stale) { in xchk_dirpath_step_up() 583 if (!error && dl->stale) in xchk_dirpath_walk_upwards() 711 if (dl->stale || dl->aborted) in xchk_dirtree_live_update() 721 dl->stale = true; in xchk_dirtree_live_update() 751 dl->stale = false; in xchk_dirtree_reset() 841 ASSERT(dl->stale); in xchk_dirtree_find_paths_to_root() 849 } while (dl->stale); in xchk_dirtree_find_paths_to_root() 865 ASSERT(!dl->stale); in xchk_dirtree_evaluate()
|
| H A D | dirtree_repair.c | 413 if (dl->stale) { in xrep_dirtree_unlink() 543 if (!error && dl->stale) in xrep_dirtree_delete_path() 684 if (dl->stale) { in xrep_dirtree_adopt() 747 if (!error && dl->stale) in xrep_dirtree_move_to_orphanage() 805 if (!dl->stale) { in xrep_dirtree()
|
| H A D | dir.c | 636 unsigned int stale = 0; in xchk_directory_leaf1_bestfree() local 692 stale++; in xchk_directory_leaf1_bestfree() 694 if (leafhdr.stale != stale) in xchk_directory_leaf1_bestfree() 742 unsigned int stale = 0; in xchk_directory_free_bestfree() local 764 stale++; in xchk_directory_free_bestfree() 777 if (freehdr.nused + stale != freehdr.nvalid) in xchk_directory_free_bestfree()
|
| H A D | dirtree.h | 147 bool stale:1; member
|
| /linux-6.15/drivers/md/bcache/ |
| H A D | extents.c | 547 unsigned int i, stale; in bch_extent_bad() local 559 stale = ptr_stale(b->c, k, i); in bch_extent_bad() 561 if (stale && KEY_DIRTY(k)) { in bch_extent_bad() 564 stale, buf); in bch_extent_bad() 567 btree_bug_on(stale > BUCKET_GC_GEN_MAX, b, in bch_extent_bad() 569 stale, b->c->need_gc); in bch_extent_bad() 571 if (stale) in bch_extent_bad()
|
| /linux-6.15/Documentation/RCU/ |
| H A D | listRCU.rst | 84 of the computer, it will at times contain stale data. Therefore, once 228 So, when readers can tolerate stale data and when entries are either added or 312 The auditing example above tolerates stale data, as do most algorithms 318 However, there are many examples where stale data cannot be tolerated. 397 stale objects during read-side list traversal, where stale objects 454 the ``cancel_list``, the ``might_cancel`` flag is consulted to skip stale 487 Read-mostly list-based data structures that can tolerate stale data are 492 If stale data cannot be tolerated, then a *deleted* flag may be used 503 then the caller will be processing stale data in any case. If it 504 is really OK to be processing stale data, then you don't need a [all …]
|
| /linux-6.15/fs/iomap/ |
| H A D | iter.c | 62 bool stale = iter->iomap.flags & IOMAP_F_STALE; in iomap_iter() local 100 else if (iter->len == 0 || (!advanced && !stale)) in iomap_iter()
|
| /linux-6.15/fs/xfs/ |
| H A D | xfs_buf_item.c | 400 int stale = bip->bli_flags & XFS_BLI_STALE; in xfs_buf_item_unpin() local 421 if (stale) { in xfs_buf_item_unpin() 593 bool stale = bip->bli_flags & XFS_BLI_STALE; in xfs_buf_item_release() local 609 ASSERT(!stale || (bip->__bli_format.blf_flags & XFS_BLF_CANCEL)); in xfs_buf_item_release() 625 if (hold || (stale && !released)) in xfs_buf_item_release() 627 ASSERT(!stale || aborted); in xfs_buf_item_release()
|
| /linux-6.15/drivers/gpu/drm/i915/gem/selftests/ |
| H A D | mock_context.c | 31 spin_lock_init(&ctx->stale.lock); in mock_context() 32 INIT_LIST_HEAD(&ctx->stale.engines); in mock_context()
|
| /linux-6.15/drivers/net/ethernet/intel/ice/ |
| H A D | ice_ptp.c | 582 if (test_and_clear_bit(idx, tx->stale)) in ice_ptp_complete_tx_single_tstamp() 736 if (test_and_clear_bit(idx, tx->stale)) in ice_ptp_process_tx_tstamp() 837 unsigned long *in_use, *stale; in ice_ptp_alloc_tx_tracker() local 844 if (!tstamps || !in_use || !stale) { in ice_ptp_alloc_tx_tracker() 847 bitmap_free(stale); in ice_ptp_alloc_tx_tracker() 854 tx->stale = stale; in ice_ptp_alloc_tx_tracker() 902 clear_bit(idx, tx->stale); in ice_ptp_flush_tx_tracker() 930 bitmap_or(tx->stale, tx->stale, tx->in_use, tx->len); in ice_ptp_mark_tx_tracker_stale() 977 bitmap_free(tx->stale); in ice_ptp_release_tx_tracker() 978 tx->stale = NULL; in ice_ptp_release_tx_tracker() [all …]
|
| /linux-6.15/drivers/gpu/drm/i915/gem/ |
| H A D | i915_gem_context.c | 1086 spin_lock_irqsave(&ctx->stale.lock, flags); in engines_notify() 1088 spin_unlock_irqrestore(&ctx->stale.lock, flags); in engines_notify() 1437 spin_lock_irq(&ctx->stale.lock); in kill_context() 1445 spin_unlock_irq(&ctx->stale.lock); in kill_context() 1450 spin_lock_irq(&ctx->stale.lock); in kill_context() 1457 spin_unlock_irq(&ctx->stale.lock); in kill_context() 1487 spin_lock_irq(&ctx->stale.lock); in engines_idle_release() 1489 list_add_tail(&engines->link, &ctx->stale.engines); in engines_idle_release() 1490 spin_unlock_irq(&ctx->stale.lock); in engines_idle_release() 1625 spin_lock_init(&ctx->stale.lock); in i915_gem_create_context() [all …]
|
| H A D | i915_gem_context_types.h | 420 } stale; member
|
| /linux-6.15/drivers/gpu/drm/msm/disp/mdp4/ |
| H A D | mdp4_crtc.c | 30 bool stale; member 364 if (mdp4_crtc->cursor.stale) { in update_cursor() 393 mdp4_crtc->cursor.stale = false; in update_cursor() 443 mdp4_crtc->cursor.stale = true; in mdp4_crtc_cursor_set()
|
| /linux-6.15/Documentation/networking/ |
| H A D | mptcp-sysctl.rst | 125 pending outstanding data on a given subflow required to declare it stale. 126 The packet scheduler ignores stale subflows.
|
| /linux-6.15/drivers/md/ |
| H A D | dm-ps-historical-service-time.c | 346 u64 *out, u64 *stale) in hst_fill_compare() argument 353 *stale = pi->stale_after; in hst_fill_compare()
|
| /linux-6.15/tools/testing/selftests/net/ |
| H A D | ndisc_unsolicited_na_test.sh | 145 to ${HOST_ADDR} dev ${ROUTER_INTF} nud stale)
|
| /linux-6.15/Documentation/scsi/ |
| H A D | hpsa.rst | 80 and not be disrupted in any way by stale commands or other stale state
|