Home
last modified time | relevance | path

Searched refs:outcome (Results 1 – 25 of 70) sorted by relevance

123

/linux-6.15/tools/memory-model/scripts/
H A Djudgelitmus.sh116 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.15/fs/xfs/scrub/
H A Ddirtree_repair.c58 enum xchk_dirpath_outcome outcome) in xrep_dirpath_set_outcome() argument
61 outcome); in xrep_dirpath_set_outcome()
63 path->outcome = outcome; in xrep_dirpath_set_outcome()
75 switch (path->outcome) { in xrep_dirtree_delete_all_paths()
122 switch (path->outcome) { in xrep_dirtree_find_surviving_path()
151 switch (path->outcome) { in xrep_dirtree_keep_one_good_path()
187 switch (path->outcome) { in xrep_dirtree_keep_one_suspect_path()
577 path->outcome = XREP_DIRPATH_ADOPTING; in xrep_dirtree_create_adoption_path()
766 if (path->outcome != XCHK_DIRPATH_DELETE) in xrep_dirtree_fix_problems()
H A Drtrmap.c267 enum xbtree_recpacking outcome; in xchk_xref_has_no_rt_owner() local
273 error = xfs_rmap_has_records(sc->sr.rmap_cur, bno, len, &outcome); in xchk_xref_has_no_rt_owner()
276 if (outcome != XBTREE_RECPACKING_EMPTY) in xchk_xref_has_no_rt_owner()
287 enum xbtree_recpacking outcome; in xchk_xref_has_rt_owner() local
293 error = xfs_rmap_has_records(sc->sr.rmap_cur, bno, len, &outcome); in xchk_xref_has_rt_owner()
296 if (outcome != XBTREE_RECPACKING_FULL) in xchk_xref_has_rt_owner()
H A Ddirtree.c249 path->outcome = XCHK_DIRPATH_SCANNING; in xchk_dirtree_create_path()
348 enum xchk_dirpath_outcome outcome) in xchk_dirpath_set_outcome() argument
351 outcome); in xchk_dirpath_set_outcome()
353 path->outcome = outcome; in xchk_dirpath_set_outcome()
573 while (!error && path->outcome == XCHK_DIRPATH_SCANNING) in xchk_dirpath_walk_upwards()
637 path->outcome == XREP_DIRPATH_ADOPTING) { in xchk_dirpath_step_is_stale()
643 path->outcome == XREP_DIRPATH_DELETING) { in xchk_dirpath_step_is_stale()
871 path->nr_steps, path->outcome); in xchk_dirtree_evaluate()
873 switch (path->outcome) { in xchk_dirtree_evaluate()
H A Dalloc.c183 enum xbtree_recpacking outcome; in xchk_xref_is_used_space() local
189 error = xfs_alloc_has_records(sc->sa.bno_cur, agbno, len, &outcome); in xchk_xref_is_used_space()
192 if (outcome != XBTREE_RECPACKING_EMPTY) in xchk_xref_is_used_space()
H A Drefcount.c600 enum xbtree_recpacking outcome; in xchk_xref_is_not_shared() local
607 XFS_REFC_DOMAIN_SHARED, agbno, len, &outcome); in xchk_xref_is_not_shared()
610 if (outcome != XBTREE_RECPACKING_EMPTY) in xchk_xref_is_not_shared()
621 enum xbtree_recpacking outcome; in xchk_xref_is_not_cow_staging() local
628 agbno, len, &outcome); in xchk_xref_is_not_cow_staging()
631 if (outcome != XBTREE_RECPACKING_EMPTY) in xchk_xref_is_not_cow_staging()
H A Dalloc_repair.c153 enum xbtree_recpacking outcome; in xrep_abt_check_free_ext() local
161 rec->ar_startblock, rec->ar_blockcount, &outcome); in xrep_abt_check_free_ext()
164 if (outcome != XBTREE_RECPACKING_EMPTY) in xrep_abt_check_free_ext()
171 rec->ar_blockcount, &outcome); in xrep_abt_check_free_ext()
174 if (outcome != XBTREE_RECPACKING_EMPTY) in xrep_abt_check_free_ext()
179 rec->ar_blockcount, &outcome); in xrep_abt_check_free_ext()
182 if (outcome != XBTREE_RECPACKING_EMPTY) in xrep_abt_check_free_ext()
H A Drtrefcount.c628 enum xbtree_recpacking outcome; in xchk_xref_is_not_rt_shared() local
635 XFS_REFC_DOMAIN_SHARED, bno, len, &outcome); in xchk_xref_is_not_rt_shared()
638 if (outcome != XBTREE_RECPACKING_EMPTY) in xchk_xref_is_not_rt_shared()
649 enum xbtree_recpacking outcome; in xchk_xref_is_not_rt_cow_staging() local
656 bno, len, &outcome); in xchk_xref_is_not_rt_cow_staging()
659 if (outcome != XBTREE_RECPACKING_EMPTY) in xchk_xref_is_not_rt_cow_staging()
H A Drefcount_repair.c141 enum xbtree_recpacking outcome; in xrep_refc_check_ext() local
149 rec->rc_blockcount, &outcome); in xrep_refc_check_ext()
152 if (outcome != XBTREE_RECPACKING_EMPTY) in xrep_refc_check_ext()
157 rec->rc_startblock, rec->rc_blockcount, &outcome); in xrep_refc_check_ext()
160 if (outcome != XBTREE_RECPACKING_EMPTY) in xrep_refc_check_ext()
H A Drtbitmap_repair.c196 enum xbtree_recpacking outcome; in xrep_rtbitmap_mark_free() local
220 rgbno - rtb->next_rgbno, &outcome); in xrep_rtbitmap_mark_free()
223 if (outcome != XBTREE_RECPACKING_EMPTY) in xrep_rtbitmap_mark_free()
228 rgbno - rtb->next_rgbno, &outcome); in xrep_rtbitmap_mark_free()
231 if (outcome != XBTREE_RECPACKING_EMPTY) in xrep_rtbitmap_mark_free()
H A Dbmap_repair.c196 enum xbtree_recpacking outcome; in xrep_bmap_check_fork_rmap() local
224 rec->rm_blockcount, &outcome); in xrep_bmap_check_fork_rmap()
227 if (outcome != XBTREE_RECPACKING_EMPTY) in xrep_bmap_check_fork_rmap()
232 rec->rm_startblock, rec->rm_blockcount, &outcome); in xrep_bmap_check_fork_rmap()
235 if (outcome != XBTREE_RECPACKING_EMPTY) in xrep_bmap_check_fork_rmap()
H A Ddirtree.h60 enum xchk_dirpath_outcome outcome; member
H A Drmap.c637 enum xbtree_recpacking outcome; in xchk_xref_has_no_owner() local
643 error = xfs_rmap_has_records(sc->sa.rmap_cur, bno, len, &outcome); in xchk_xref_has_no_owner()
646 if (outcome != XBTREE_RECPACKING_EMPTY) in xchk_xref_has_no_owner()
/linux-6.15/tools/memory-model/litmus-tests/
H A DMP+poonceonces.litmus6 * Can the counter-intuitive message-passing outcome be prevented with
27 exists (1:r0=1 /\ 1:r1=0) (* Bad outcome. *)
H A DLB+poonceonces.litmus6 * Can the counter-intuitive outcome for the load-buffering pattern
H A DMP+pooncerelease+poacquireonce.litmus28 exists (1:r0=1 /\ 1:r1=0) (* Bad outcome. *)
H A DMP+fencewmbonceonce+fencermbonceonce.litmus30 exists (1:r0=1 /\ 1:r1=0) (* Bad outcome. *)
H A DMP+onceassign+derefonce.litmus33 exists (1:r0=x /\ 1:r1=0) (* Bad outcome. *)
H A DMP+polockmbonce+poacquiresilsil.litmus34 exists (1:r1=1 /\ 1:r2=0 /\ 1:r3=1) (* Bad outcome. *)
H A DMP+polockonce+poacquiresilsil.litmus33 exists (1:r1=1 /\ 1:r2=0 /\ 1:r3=1) (* Bad outcome. *)
H A DMP+porevlocks.litmus35 exists (0:r0=1 /\ 0:r1=0) (* Bad outcome. *)
H A DMP+polocks.litmus35 exists (1:r0=1 /\ 1:r1=0) (* Bad outcome. *)
/linux-6.15/tools/memory-model/Documentation/
H A Drecipes.txt155 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:
/linux-6.15/fs/xfs/libxfs/
H A Dxfs_ialloc.h104 enum xbtree_recpacking *outcome);
/linux-6.15/tools/testing/selftests/net/netfilter/packetdrill/
H A Dconntrack_syn_challenge_ack.pkt13 // Expected outcome: established connection.

123