Home
last modified time | relevance | path

Searched refs:c_key (Results 1 – 3 of 3) sorted by relevance

/fs/nfsd/
Dnfscache.c106 memset(&rp->c_key, 0, sizeof(rp->c_key)); in nfsd_reply_cache_alloc()
107 rp->c_key.k_xid = rqstp->rq_xid; in nfsd_reply_cache_alloc()
108 rp->c_key.k_proc = rqstp->rq_proc; in nfsd_reply_cache_alloc()
109 rpc_copy_addr((struct sockaddr *)&rp->c_key.k_addr, svc_addr(rqstp)); in nfsd_reply_cache_alloc()
110 rpc_set_port((struct sockaddr *)&rp->c_key.k_addr, rpc_get_port(svc_addr(rqstp))); in nfsd_reply_cache_alloc()
111 rp->c_key.k_prot = rqstp->rq_prot; in nfsd_reply_cache_alloc()
112 rp->c_key.k_vers = rqstp->rq_vers; in nfsd_reply_cache_alloc()
113 rp->c_key.k_len = rqstp->rq_arg.len; in nfsd_reply_cache_alloc()
114 rp->c_key.k_csum = csum; in nfsd_reply_cache_alloc()
325 if (key->c_key.k_xid == rp->c_key.k_xid && in nfsd_cache_key_cmp()
[all …]
Dcache.h32 } c_key; member
Dtrace.h589 __entry->xid = be32_to_cpu(key->c_key.k_xid);
590 __entry->cached = (__force u32)key->c_key.k_csum;
591 __entry->ingress = (__force u32)rp->c_key.k_csum;