sys/rpc/replay.c

59     struct replay_cache_entry *rce);
115 	struct replay_cache_entry *rce;
120 	rce = malloc(sizeof(*rce), M_RPC, M_NOWAIT|M_ZERO);
121 	if (!rce)
123 	rce->rce_hash = h;
124 	rce->rce_msg = *msg;
125 	bcopy(addr, &rce->rce_addr, addr->sa_len);
127 	TAILQ_INSERT_HEAD(&rc->rc_cache[h], rce, rce_link);
128 	TAILQ_INSERT_HEAD(&rc->rc_all, rce, rce_alllink);
130 	return (rce);
134 replay_free(struct replay_cache *rc, struct replay_cache_entry *rce)
140 	TAILQ_REMOVE(&rc->rc_cache[rce->rce_hash], rce, rce_link);
141 	TAILQ_REMOVE(&rc->rc_all, rce, rce_alllink);
142 	if (rce->rce_repbody) {
143 		rc->rc_size -= m_length(rce->rce_repbody, NULL);
144 		m_freem(rce->rce_repbody);
146 	free(rce, M_RPC);
152 	struct replay_cache_entry *rce;
163 		TAILQ_FOREACH_REVERSE(rce, &rc->rc_all, replay_cache_list,
165 			if (rce->rce_repmsg.rm_xid)
168 		if (rce)
169 			replay_free(rc, rce);
170 	} while (rce && (rc->rc_count >= REPLAY_MAX
179 	struct replay_cache_entry *rce;
182 	TAILQ_FOREACH(rce, &rc->rc_cache[h], rce_link) {
183 		if (rce->rce_msg.rm_xid == msg->rm_xid
184 		    && rce->rce_msg.rm_call.cb_prog == msg->rm_call.cb_prog
185 		    && rce->rce_msg.rm_call.cb_vers == msg->rm_call.cb_vers
186 		    && rce->rce_msg.rm_call.cb_proc == msg->rm_call.cb_proc
187 		    && rce->rce_addr.ss_len == addr->sa_len
188 		    && bcmp(&rce->rce_addr, addr, addr->sa_len) == 0) {
189 			if (rce->rce_repmsg.rm_xid) {
195 				TAILQ_REMOVE(&rc->rc_all, rce, rce_alllink);
196 				TAILQ_INSERT_HEAD(&rc->rc_all, rce,
198 				*repmsg = rce->rce_repmsg;
199 				if (rce->rce_repbody) {
200 					*mp = m_copym(rce->rce_repbody,
218 	rce = replay_alloc(rc, msg, addr, h);
222 	if (!rce)
233 	struct replay_cache_entry *rce;
242 	TAILQ_FOREACH(rce, &rc->rc_cache[h], rce_link) {
243 		if (rce->rce_msg.rm_xid == repmsg->rm_xid
244 		    && rce->rce_addr.ss_len == addr->sa_len
245 		    && bcmp(&rce->rce_addr, addr, addr->sa_len) == 0) {
249 	if (rce) {
250 		rce->rce_repmsg = *repmsg;
251 		rce->rce_repbody = m;