Home
last modified time | relevance | path

Searched refs:lr (Results 1 – 4 of 4) sorted by relevance

/fs/xfs/libxfs/
Dxfs_btree.c783 int lr, in xfs_btree_readahead_lblock() argument
790 if ((lr & XFS_BTCUR_LEFTRA) && left != NULLFSBLOCK) { in xfs_btree_readahead_lblock()
796 if ((lr & XFS_BTCUR_RIGHTRA) && right != NULLFSBLOCK) { in xfs_btree_readahead_lblock()
808 int lr, in xfs_btree_readahead_sblock() argument
816 if ((lr & XFS_BTCUR_LEFTRA) && left != NULLAGBLOCK) { in xfs_btree_readahead_sblock()
822 if ((lr & XFS_BTCUR_RIGHTRA) && right != NULLAGBLOCK) { in xfs_btree_readahead_sblock()
839 int lr) /* left/right bits */ in xfs_btree_readahead() argument
851 if ((cur->bc_ra[lev] | lr) == cur->bc_ra[lev]) in xfs_btree_readahead()
854 cur->bc_ra[lev] |= lr; in xfs_btree_readahead()
858 return xfs_btree_readahead_lblock(cur, lr, block); in xfs_btree_readahead()
[all …]
/fs/ocfs2/dlm/
Ddlmrecovery.c799 struct dlm_lock_request lr; in dlm_request_all_locks() local
809 memset(&lr, 0, sizeof(lr)); in dlm_request_all_locks()
810 lr.node_idx = dlm->node_num; in dlm_request_all_locks()
811 lr.dead_node = dead_node; in dlm_request_all_locks()
815 &lr, sizeof(lr), request_from, &status); in dlm_request_all_locks()
834 struct dlm_lock_request *lr = (struct dlm_lock_request *)msg->buf; in dlm_request_all_locks_handler() local
841 if (lr->dead_node != dlm->reco.dead_node) { in dlm_request_all_locks_handler()
843 "dead_node is %u\n", dlm->name, lr->node_idx, in dlm_request_all_locks_handler()
844 lr->dead_node, dlm->reco.dead_node); in dlm_request_all_locks_handler()
850 BUG_ON(lr->dead_node != dlm->reco.dead_node); in dlm_request_all_locks_handler()
[all …]
/fs/proc/
Dbase.c544 struct latency_record *lr = &task->latency_record[i]; in lstats_show_proc() local
545 if (lr->backtrace[0]) { in lstats_show_proc()
548 lr->count, lr->time, lr->max); in lstats_show_proc()
550 unsigned long bt = lr->backtrace[q]; in lstats_show_proc()
/fs/afs/
Dvnode.c21 int depth, char lr)
35 depth, depth, "", lr,