Searched refs:outcome (Results 1 - 24 of 24) sorted by relevance

/linux-master/tools/memory-model/scripts/
H A Djudgelitmus.sh62 outcome=`grep -m 1 '^[( ]\* Result: ' $litmus | awk '{ print $3 }'`
79 outcome=`grep -m 1 '^Observation ' $LKMM_DESTDIR/$lkmmout | awk '{ print $3 }'`
81 outcome=specified
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"
[all...]
/linux-master/fs/xfs/scrub/
H A Dalloc.c183 enum xbtree_recpacking outcome; local
189 error = xfs_alloc_has_records(sc->sa.bno_cur, agbno, len, &outcome);
192 if (outcome != XBTREE_RECPACKING_EMPTY)
H A Ddirtree.c249 path->outcome = XCHK_DIRPATH_SCANNING;
343 /* Set and log the outcome of a path walk. */
348 enum xchk_dirpath_outcome outcome)
351 outcome);
353 path->outcome = outcome;
562 while (!error && path->outcome == XCHK_DIRPATH_SCANNING)
626 path->outcome == XREP_DIRPATH_ADOPTING) {
632 path->outcome == XREP_DIRPATH_DELETING) {
860 path->nr_steps, path->outcome);
345 xchk_dirpath_set_outcome( struct xchk_dirtree *dl, struct xchk_dirpath *path, enum xchk_dirpath_outcome outcome) argument
[all...]
H A Ddirtree_repair.c53 /* Change the outcome of this path. */
58 enum xchk_dirpath_outcome outcome)
61 outcome);
63 path->outcome = outcome;
75 switch (path->outcome) {
122 switch (path->outcome) {
151 switch (path->outcome) {
187 switch (path->outcome) {
577 path->outcome
55 xrep_dirpath_set_outcome( struct xchk_dirtree *dl, struct xchk_dirpath *path, enum xchk_dirpath_outcome outcome) argument
[all...]
H A Drefcount.c599 enum xbtree_recpacking outcome; local
606 XFS_REFC_DOMAIN_SHARED, agbno, len, &outcome);
609 if (outcome != XBTREE_RECPACKING_EMPTY)
620 enum xbtree_recpacking outcome; local
627 agbno, len, &outcome);
630 if (outcome != XBTREE_RECPACKING_EMPTY)
H A Ddirtree.h60 enum xchk_dirpath_outcome outcome; member in struct:xchk_dirpath
H A Drefcount_repair.c141 enum xbtree_recpacking outcome; local
149 rec->rc_blockcount, &outcome);
152 if (outcome != XBTREE_RECPACKING_EMPTY)
157 rec->rc_startblock, rec->rc_blockcount, &outcome);
160 if (outcome != XBTREE_RECPACKING_EMPTY)
H A Dalloc_repair.c154 enum xbtree_recpacking outcome; local
162 rec->ar_startblock, rec->ar_blockcount, &outcome);
165 if (outcome != XBTREE_RECPACKING_EMPTY)
172 rec->ar_blockcount, &outcome);
175 if (outcome != XBTREE_RECPACKING_EMPTY)
180 rec->ar_blockcount, &outcome);
183 if (outcome != XBTREE_RECPACKING_EMPTY)
H A Dbmap_repair.c187 enum xbtree_recpacking outcome; local
215 rec->rm_blockcount, &outcome);
218 if (outcome != XBTREE_RECPACKING_EMPTY)
223 rec->rm_startblock, rec->rm_blockcount, &outcome);
226 if (outcome != XBTREE_RECPACKING_EMPTY)
H A Drmap.c637 enum xbtree_recpacking outcome; local
643 error = xfs_rmap_has_records(sc->sa.rmap_cur, bno, len, &outcome);
646 if (outcome != XBTREE_RECPACKING_EMPTY)
H A Dialloc.c762 enum xbtree_recpacking outcome; local
768 error = xfs_ialloc_has_inodes_at_extent(*icur, agbno, len, &outcome);
771 if (outcome != expected)
H A Dialloc_repair.c347 enum xbtree_recpacking outcome; local
387 error = xfs_alloc_has_records(sc->sa.bno_cur, agbno, len, &outcome);
390 if (outcome != XBTREE_RECPACKING_EMPTY)
H A Drmap_repair.c190 enum xbtree_recpacking outcome; local
198 rec->rm_blockcount, &outcome);
201 if (outcome != XBTREE_RECPACKING_EMPTY)
H A Dtrace.h1784 unsigned int outcome),
1785 TP_ARGS(sc, path_nr, nr_steps, outcome),
1790 __field(unsigned int, outcome)
1796 __entry->outcome = outcome;
1798 TP_printk("dev %d:%d path %llu steps %u outcome %s",
1802 __print_symbolic(__entry->outcome, XCHK_DIRPATH_OUTCOME_STRINGS))
1808 unsigned int outcome), \
1809 TP_ARGS(sc, path_nr, nr_steps, outcome))
/linux-master/fs/xfs/libxfs/
H A Dxfs_refcount.h116 xfs_extlen_t len, enum xbtree_recpacking *outcome);
H A Dxfs_ialloc.h102 enum xbtree_recpacking *outcome);
H A Dxfs_alloc.h218 xfs_extlen_t len, enum xbtree_recpacking *outcome);
H A Dxfs_rmap.h206 xfs_extlen_t len, enum xbtree_recpacking *outcome);
H A Dxfs_btree.c5250 enum xbtree_recpacking outcome; member in struct:xfs_btree_has_records
5266 if (info->outcome == XBTREE_RECPACKING_EMPTY) {
5267 info->outcome = XBTREE_RECPACKING_SPARSE;
5326 enum xbtree_recpacking *outcome)
5329 .outcome = XBTREE_RECPACKING_EMPTY,
5350 if (info.outcome == XBTREE_RECPACKING_EMPTY)
5360 info.outcome = XBTREE_RECPACKING_FULL;
5363 *outcome = info.outcome;
5321 xfs_btree_has_records( struct xfs_btree_cur *cur, const union xfs_btree_irec *low, const union xfs_btree_irec *high, const union xfs_btree_key *mask, enum xbtree_recpacking *outcome) argument
H A Dxfs_btree.h536 enum xbtree_recpacking *outcome);
H A Dxfs_ialloc.c2835 enum xbtree_recpacking *outcome)
2850 *outcome = XBTREE_RECPACKING_EMPTY;
2852 *outcome = XBTREE_RECPACKING_FULL;
2854 *outcome = XBTREE_RECPACKING_SPARSE;
2831 xfs_ialloc_has_inodes_at_extent( struct xfs_btree_cur *cur, xfs_agblock_t bno, xfs_extlen_t len, enum xbtree_recpacking *outcome) argument
H A Dxfs_refcount.c2059 enum xbtree_recpacking *outcome)
2070 return xfs_btree_has_records(cur, &low, &high, NULL, outcome);
2054 xfs_refcount_has_records( struct xfs_btree_cur *cur, enum xfs_refc_domain domain, xfs_agblock_t bno, xfs_extlen_t len, enum xbtree_recpacking *outcome) argument
H A Dxfs_rmap.c2890 enum xbtree_recpacking *outcome)
2903 return xfs_btree_has_records(cur, &low, &high, &mask, outcome);
2886 xfs_rmap_has_records( struct xfs_btree_cur *cur, xfs_agblock_t bno, xfs_extlen_t len, enum xbtree_recpacking *outcome) argument
H A Dxfs_alloc.c4058 enum xbtree_recpacking *outcome)
4068 return xfs_btree_has_records(cur, &low, &high, NULL, outcome);
4054 xfs_alloc_has_records( struct xfs_btree_cur *cur, xfs_agblock_t bno, xfs_extlen_t len, enum xbtree_recpacking *outcome) argument

Completed in 232 milliseconds