Home
last modified time | relevance | path

Searched refs:r_len (Results 1 - 25 of 30) sorted by relevance

12

/kernel/linux/linux-5.10/fs/ocfs2/
H A Dreservations.c58 if (resv->r_len) in ocfs2_resv_end()
59 return resv->r_start + resv->r_len - 1; in ocfs2_resv_end()
65 return !!(resv->r_len == 0); in ocfs2_resv_empty()
91 ocfs2_resv_end(resv), resv->r_len, resv->r_last_start, in ocfs2_dump_resv()
104 ocfs2_resv_end(resv), resv->r_len, resv->r_last_start, in ocfs2_dump_resv()
150 if (resv->r_len == 0) { in ocfs2_check_resmap()
229 resv->r_len = 0; in __ocfs2_resv_trunc()
313 trace_ocfs2_resv_insert(new->r_start, new->r_len); in ocfs2_resv_insert()
502 resv->r_len = clen; in __ocfs2_resv_find_window()
536 goal, next_resv->r_start, next_resv->r_len); in __ocfs2_resv_find_window()
[all...]
H A Dreservations.h25 unsigned int r_len; /* Length of the window */ member
H A Docfs2_trace.h1916 unsigned int r_start, unsigned int r_end, unsigned int r_len,
1919 r_len, last_start, last_len),
1926 __field(unsigned int, r_len)
1936 __entry->r_len = r_len;
1942 __entry->r_start, __entry->r_end, __entry->r_len,
H A Drefcounttree.c2232 unsigned int r_count = 0, r_len; in __ocfs2_decrease_refcount() local
2254 r_len = min((u64)(cpos + len), le64_to_cpu(rec.r_cpos) + in __ocfs2_decrease_refcount()
2259 cpos, r_len, in __ocfs2_decrease_refcount()
2269 r_len); in __ocfs2_decrease_refcount()
2276 cpos += r_len; in __ocfs2_decrease_refcount()
2277 len -= r_len; in __ocfs2_decrease_refcount()
3263 * Here we may not allocate r_len once at a time, so continue in ocfs2_make_clusters_writable()
/kernel/linux/linux-6.6/fs/ocfs2/
H A Dreservations.c56 if (resv->r_len) in ocfs2_resv_end()
57 return resv->r_start + resv->r_len - 1; in ocfs2_resv_end()
63 return !!(resv->r_len == 0); in ocfs2_resv_empty()
89 ocfs2_resv_end(resv), resv->r_len, resv->r_last_start, in ocfs2_dump_resv()
102 ocfs2_resv_end(resv), resv->r_len, resv->r_last_start, in ocfs2_dump_resv()
148 if (resv->r_len == 0) { in ocfs2_check_resmap()
225 resv->r_len = 0; in __ocfs2_resv_trunc()
309 trace_ocfs2_resv_insert(new->r_start, new->r_len); in ocfs2_resv_insert()
498 resv->r_len = clen; in __ocfs2_resv_find_window()
532 goal, next_resv->r_start, next_resv->r_len); in __ocfs2_resv_find_window()
[all...]
H A Dreservations.h23 unsigned int r_len; /* Length of the window */ member
H A Docfs2_trace.h1917 unsigned int r_start, unsigned int r_end, unsigned int r_len,
1920 r_len, last_start, last_len),
1927 __field(unsigned int, r_len)
1937 __entry->r_len = r_len;
1943 __entry->r_start, __entry->r_end, __entry->r_len,
H A Drefcounttree.c2230 unsigned int r_count = 0, r_len; in __ocfs2_decrease_refcount() local
2252 r_len = min((u64)(cpos + len), le64_to_cpu(rec.r_cpos) + in __ocfs2_decrease_refcount()
2257 cpos, r_len, in __ocfs2_decrease_refcount()
2267 r_len); in __ocfs2_decrease_refcount()
2274 cpos += r_len; in __ocfs2_decrease_refcount()
2275 len -= r_len; in __ocfs2_decrease_refcount()
3234 * Here we may not allocate r_len once at a time, so continue in ocfs2_make_clusters_writable()
/kernel/linux/linux-5.10/arch/arm/mach-rpc/
H A Decard.h44 unsigned char r_len[3]; member
51 #define c_len(x) ((x)->r_len[0]|((x)->r_len[1]<<8)|((x)->r_len[2]<<16))
/kernel/linux/linux-6.6/arch/arm/mach-rpc/
H A Decard.h44 unsigned char r_len[3]; member
51 #define c_len(x) ((x)->r_len[0]|((x)->r_len[1]<<8)|((x)->r_len[2]<<16))
/kernel/linux/linux-5.10/drivers/infiniband/hw/qib/
H A Dqib_uc.c360 if (unlikely(qp->r_rcv_len > qp->r_len)) in qib_uc_rcv()
385 if (unlikely(wc.byte_len > qp->r_len)) in qib_uc_rcv()
416 qp->r_len = be32_to_cpu(reth->length); in qib_uc_rcv()
419 if (qp->r_len != 0) { in qib_uc_rcv()
425 ok = rvt_rkey_ok(qp, &qp->r_sge.sge, qp->r_len, in qib_uc_rcv()
449 if (unlikely(qp->r_rcv_len > qp->r_len)) in qib_uc_rcv()
468 if (unlikely(tlen + qp->r_rcv_len != qp->r_len)) in qib_uc_rcv()
479 wc.byte_len = qp->r_len; in qib_uc_rcv()
495 if (unlikely(tlen + qp->r_rcv_len != qp->r_len)) in qib_uc_rcv()
H A Dqib_ud.c155 if (unlikely(wc.byte_len > qp->r_len)) { in qib_ud_loopback()
544 if (unlikely(wc.byte_len > qp->r_len)) { in qib_ud_rcv()
H A Dqib_rc.c1532 * the duplicate request. Note that r_sge, r_len, and in qib_rc_rcv_error()
1818 if (unlikely(qp->r_rcv_len > qp->r_len)) in qib_rc_rcv()
1864 if (unlikely(wc.byte_len > qp->r_len)) in qib_rc_rcv()
1899 qp->r_len = be32_to_cpu(reth->length); in qib_rc_rcv()
1902 if (qp->r_len != 0) { in qib_rc_rcv()
1908 ok = rvt_rkey_ok(qp, &qp->r_sge.sge, qp->r_len, vaddr, in qib_rc_rcv()
/kernel/linux/linux-6.6/drivers/infiniband/hw/qib/
H A Dqib_uc.c361 if (unlikely(qp->r_rcv_len > qp->r_len)) in qib_uc_rcv()
386 if (unlikely(wc.byte_len > qp->r_len)) in qib_uc_rcv()
417 qp->r_len = be32_to_cpu(reth->length); in qib_uc_rcv()
420 if (qp->r_len != 0) { in qib_uc_rcv()
426 ok = rvt_rkey_ok(qp, &qp->r_sge.sge, qp->r_len, in qib_uc_rcv()
450 if (unlikely(qp->r_rcv_len > qp->r_len)) in qib_uc_rcv()
469 if (unlikely(tlen + qp->r_rcv_len != qp->r_len)) in qib_uc_rcv()
480 wc.byte_len = qp->r_len; in qib_uc_rcv()
496 if (unlikely(tlen + qp->r_rcv_len != qp->r_len)) in qib_uc_rcv()
H A Dqib_ud.c155 if (unlikely(wc.byte_len > qp->r_len)) { in qib_ud_loopback()
545 if (unlikely(wc.byte_len > qp->r_len)) { in qib_ud_rcv()
H A Dqib_rc.c1535 * the duplicate request. Note that r_sge, r_len, and in qib_rc_rcv_error()
1821 if (unlikely(qp->r_rcv_len > qp->r_len)) in qib_rc_rcv()
1867 if (unlikely(wc.byte_len > qp->r_len)) in qib_rc_rcv()
1902 qp->r_len = be32_to_cpu(reth->length); in qib_rc_rcv()
1905 if (qp->r_len != 0) { in qib_rc_rcv()
1911 ok = rvt_rkey_ok(qp, &qp->r_sge.sge, qp->r_len, vaddr, in qib_rc_rcv()
/kernel/linux/linux-5.10/drivers/infiniband/hw/hfi1/
H A Duc.c428 if (unlikely(qp->r_rcv_len > qp->r_len)) in hfi1_uc_rcv()
450 if (unlikely(wc.byte_len > qp->r_len)) in hfi1_uc_rcv()
491 qp->r_len = be32_to_cpu(reth->length); in hfi1_uc_rcv()
494 if (qp->r_len != 0) { in hfi1_uc_rcv()
500 ok = rvt_rkey_ok(qp, &qp->r_sge.sge, qp->r_len, in hfi1_uc_rcv()
524 if (unlikely(qp->r_rcv_len > qp->r_len)) in hfi1_uc_rcv()
540 if (unlikely(tlen + qp->r_rcv_len != qp->r_len)) in hfi1_uc_rcv()
551 wc.byte_len = qp->r_len; in hfi1_uc_rcv()
565 if (unlikely(tlen + qp->r_rcv_len != qp->r_len)) in hfi1_uc_rcv()
H A Dud.c179 if (unlikely(wc.byte_len > qp->r_len)) { in ud_loopback()
1003 if (unlikely(wc.byte_len > qp->r_len)) { in hfi1_ud_rcv()
H A Drc.c2587 * the duplicate request. Note that r_sge, r_len, and in rc_rcv_error()
2916 if (unlikely(qp->r_rcv_len > qp->r_len)) in hfi1_rc_rcv()
2972 if (unlikely(wc.byte_len > qp->r_len)) in hfi1_rc_rcv()
3019 qp->r_len = be32_to_cpu(reth->length); in hfi1_rc_rcv()
3022 if (qp->r_len != 0) { in hfi1_rc_rcv()
3028 ok = rvt_rkey_ok(qp, &qp->r_sge.sge, qp->r_len, vaddr, in hfi1_rc_rcv()
/kernel/linux/linux-6.6/drivers/infiniband/hw/hfi1/
H A Duc.c382 if (unlikely(qp->r_rcv_len > qp->r_len)) in hfi1_uc_rcv()
404 if (unlikely(wc.byte_len > qp->r_len)) in hfi1_uc_rcv()
445 qp->r_len = be32_to_cpu(reth->length); in hfi1_uc_rcv()
448 if (qp->r_len != 0) { in hfi1_uc_rcv()
454 ok = rvt_rkey_ok(qp, &qp->r_sge.sge, qp->r_len, in hfi1_uc_rcv()
478 if (unlikely(qp->r_rcv_len > qp->r_len)) in hfi1_uc_rcv()
494 if (unlikely(tlen + qp->r_rcv_len != qp->r_len)) in hfi1_uc_rcv()
505 wc.byte_len = qp->r_len; in hfi1_uc_rcv()
519 if (unlikely(tlen + qp->r_rcv_len != qp->r_len)) in hfi1_uc_rcv()
H A Dud.c137 if (unlikely(wc.byte_len > qp->r_len)) { in ud_loopback()
957 if (unlikely(wc.byte_len > qp->r_len)) { in hfi1_ud_rcv()
H A Drc.c2546 * the duplicate request. Note that r_sge, r_len, and in rc_rcv_error()
2875 if (unlikely(qp->r_rcv_len > qp->r_len)) in hfi1_rc_rcv()
2931 if (unlikely(wc.byte_len > qp->r_len)) in hfi1_rc_rcv()
2978 qp->r_len = be32_to_cpu(reth->length); in hfi1_rc_rcv()
2981 if (qp->r_len != 0) { in hfi1_rc_rcv()
2987 ok = rvt_rkey_ok(qp, &qp->r_sge.sge, qp->r_len, vaddr, in hfi1_rc_rcv()
/kernel/linux/linux-5.10/fs/xfs/
H A Dxfs_log_priv.h145 uint r_len; /* region length :4 */ member
/kernel/linux/linux-5.10/include/rdma/
H A Drdmavt_qp.h382 u32 r_len; /* total length of r_sge */ member
/kernel/linux/linux-6.6/include/rdma/
H A Drdmavt_qp.h382 u32 r_len; /* total length of r_sge */ member

Completed in 40 milliseconds

12