haveright        1706 fs/xfs/libxfs/xfs_alloc.c 	int				haveright; /* have a right neighbor */
haveright        1755 fs/xfs/libxfs/xfs_alloc.c 	if ((error = xfs_btree_increment(bno_cur, 0, &haveright)))
haveright        1757 fs/xfs/libxfs/xfs_alloc.c 	if (haveright) {
haveright        1768 fs/xfs/libxfs/xfs_alloc.c 			haveright = 0;
haveright        1786 fs/xfs/libxfs/xfs_alloc.c 	if (haveleft && haveright) {
haveright        1872 fs/xfs/libxfs/xfs_alloc.c 	else if (haveright) {
haveright        1929 fs/xfs/libxfs/xfs_alloc.c 	trace_xfs_free_extent(mp, agno, bno, len, type, haveleft, haveright);
haveright        1534 fs/xfs/xfs_trace.h 		 int haveright),
haveright        1535 fs/xfs/xfs_trace.h 	TP_ARGS(mp, agno, agbno, len, resv, haveleft, haveright),
haveright        1543 fs/xfs/xfs_trace.h 		__field(int, haveright)
haveright        1552 fs/xfs/xfs_trace.h 		__entry->haveright = haveright;
haveright        1561 fs/xfs/xfs_trace.h 			(__entry->haveright ? "both" : "left") :
haveright        1562 fs/xfs/xfs_trace.h 			(__entry->haveright ? "right" : "none"))