| /linux-6.6.21/tools/memory-model/scripts/ |
| D | judgelitmus.sh | 116 if test "$outcome" = DEADLOCK
122 echo " !!! Unexpected non-$outcome verification" $litmus
125 echo " !!! Unexpected non-$outcome verification" >> $LKMM_DESTDIR/$litmusout 2>&1
131 echo " !!! Unexpected non-$outcome deadlock" $litmus
134 echo " !!! Unexpected non-$outcome deadlock" $litmus >> $LKMM_DESTDIR/$litmusout 2>&1
137 elif grep '^Observation' $LKMM_DESTDIR/$litmusout | grep -q $outcome || test "$outcome" = Maybe
141 if test \( -n "$LKMM_HW_MAP_FILE" -a "$outcome" = Sometimes \) -o -n "$datarace_modeled"
149 echo " $flag non-$outcome verification" $litmus
152 echo " $flag non-$outcome verification" >> $LKMM_DESTDIR/$litmusout 2>&1
|
| /linux-6.6.21/tools/memory-model/litmus-tests/ |
| D | MP+poonceonces.litmus | 6 * Can the counter-intuitive message-passing outcome be prevented with
27 exists (1:r0=1 /\ 1:r1=0) (* Bad outcome. *)
|
| D | LB+poonceonces.litmus | 6 * Can the counter-intuitive outcome for the load-buffering pattern
|
| D | MP+pooncerelease+poacquireonce.litmus | 28 exists (1:r0=1 /\ 1:r1=0) (* Bad outcome. *)
|
| D | MP+fencewmbonceonce+fencermbonceonce.litmus | 30 exists (1:r0=1 /\ 1:r1=0) (* Bad outcome. *)
|
| D | MP+onceassign+derefonce.litmus | 33 exists (1:r0=x /\ 1:r1=0) (* Bad outcome. *)
|
| D | MP+polockonce+poacquiresilsil.litmus | 33 exists (1:r1=1 /\ 1:r2=0 /\ 1:r3=1) (* Bad outcome. *)
|
| D | MP+polockmbonce+poacquiresilsil.litmus | 34 exists (1:r1=1 /\ 1:r2=0 /\ 1:r3=1) (* Bad outcome. *)
|
| D | MP+polocks.litmus | 35 exists (1:r0=1 /\ 1:r1=0) (* Bad outcome. *)
|
| D | MP+porevlocks.litmus | 35 exists (0:r0=1 /\ 0:r1=0) (* Bad outcome. *)
|
| /linux-6.6.21/fs/xfs/scrub/ |
| D | alloc.c | 175 enum xbtree_recpacking outcome; in xchk_xref_is_used_space() local
181 error = xfs_alloc_has_records(sc->sa.bno_cur, agbno, len, &outcome); in xchk_xref_is_used_space()
184 if (outcome != XBTREE_RECPACKING_EMPTY) in xchk_xref_is_used_space()
|
| D | refcount.c | 587 enum xbtree_recpacking outcome; in xchk_xref_is_not_shared() local
594 XFS_REFC_DOMAIN_SHARED, agbno, len, &outcome); in xchk_xref_is_not_shared()
597 if (outcome != XBTREE_RECPACKING_EMPTY) in xchk_xref_is_not_shared()
608 enum xbtree_recpacking outcome; in xchk_xref_is_not_cow_staging() local
615 agbno, len, &outcome); in xchk_xref_is_not_cow_staging()
618 if (outcome != XBTREE_RECPACKING_EMPTY) in xchk_xref_is_not_cow_staging()
|
| D | rmap.c | 628 enum xbtree_recpacking outcome; in xchk_xref_has_no_owner() local
634 error = xfs_rmap_has_records(sc->sa.rmap_cur, bno, len, &outcome); in xchk_xref_has_no_owner()
637 if (outcome != XBTREE_RECPACKING_EMPTY) in xchk_xref_has_no_owner()
|
| D | ialloc.c | 769 enum xbtree_recpacking outcome; in xchk_xref_inode_check() local
775 error = xfs_ialloc_has_inodes_at_extent(*icur, agbno, len, &outcome); in xchk_xref_inode_check()
778 if (outcome != expected) in xchk_xref_inode_check()
|
| /linux-6.6.21/tools/memory-model/Documentation/ |
| D | recipes.txt | 155 value of r1 be 0. The reason for this surprising outcome is that
188 sufficiently to rule out the counter-intuitive outcome.
206 outcome in which the first load sees the value written by the second store
360 One way of avoiding the counter-intuitive outcome is through the use of a
401 the counter-intuitive outcome where the kernel overwrites the data
496 this counter-intuitive outcome.
517 "if (@cond)". The full barriers prevent the undesirable outcome where
550 avoid a counter-intuitive outcome depends on the types of relations
551 linking the memory accesses for the outcome in question:
|
| D | locking.txt | 180 value of r1 be 0. The reason for this surprising outcome is that CPU2()
213 acquisition sufficiently to rule out the counter-intuitive outcome.
|
| /linux-6.6.21/fs/xfs/libxfs/ |
| D | xfs_ialloc.h | 100 enum xbtree_recpacking *outcome);
|
| D | xfs_refcount.h | 116 xfs_extlen_t len, enum xbtree_recpacking *outcome);
|
| D | xfs_alloc.h | 218 xfs_extlen_t len, enum xbtree_recpacking *outcome);
|
| D | xfs_rmap.h | 202 xfs_extlen_t len, enum xbtree_recpacking *outcome);
|
| D | xfs_btree.c | 5039 enum xbtree_recpacking outcome; member
5055 if (info->outcome == XBTREE_RECPACKING_EMPTY) { in xfs_btree_has_records_helper()
5056 info->outcome = XBTREE_RECPACKING_SPARSE; in xfs_btree_has_records_helper()
5115 enum xbtree_recpacking *outcome) in xfs_btree_has_records() argument
5118 .outcome = XBTREE_RECPACKING_EMPTY, in xfs_btree_has_records()
5139 if (info.outcome == XBTREE_RECPACKING_EMPTY) in xfs_btree_has_records()
5149 info.outcome = XBTREE_RECPACKING_FULL; in xfs_btree_has_records()
5152 *outcome = info.outcome; in xfs_btree_has_records()
|
| /linux-6.6.21/Documentation/ABI/obsolete/ |
| D | sysfs-driver-hid-roccat-arvo | 35 windows and application keys, to protect the user from the outcome
|
| /linux-6.6.21/Documentation/filesystems/ |
| D | dax.rst | 124 ------[outcome]------
137 ------[outcome]------
150 ------[outcome]------
|
| /linux-6.6.21/Documentation/dev-tools/kunit/ |
| D | index.rst | 85 - Assert expected outcome: Verify that the result (or resulting state) is as
|
| /linux-6.6.21/Documentation/ |
| D | atomic_t.txt | 113 outcome.
259 (void)atomic_fetch_inc_acquire() for instance -- would allow the outcome,
|