sys/rpc/replay.c

58     struct replay_cache_entry *rce);
114 	struct replay_cache_entry *rce;
119 	rce = malloc(sizeof(*rce), M_RPC, M_NOWAIT|M_ZERO);
120 	if (!rce)
122 	rce->rce_hash = h;
123 	rce->rce_msg = *msg;
124 	bcopy(addr, &rce->rce_addr, addr->sa_len);
126 	TAILQ_INSERT_HEAD(&rc->rc_cache[h], rce, rce_link);
127 	TAILQ_INSERT_HEAD(&rc->rc_all, rce, rce_alllink);
129 	return (rce);
133 replay_free(struct replay_cache *rc, struct replay_cache_entry *rce)
139 	TAILQ_REMOVE(&rc->rc_cache[rce->rce_hash], rce, rce_link);
140 	TAILQ_REMOVE(&rc->rc_all, rce, rce_alllink);
141 	if (rce->rce_repbody) {
142 		rc->rc_size -= m_length(rce->rce_repbody, NULL);
143 		m_freem(rce->rce_repbody);
145 	free(rce, M_RPC);
151 	struct replay_cache_entry *rce;
162 		TAILQ_FOREACH_REVERSE(rce, &rc->rc_all, replay_cache_list,
164 			if (rce->rce_repmsg.rm_xid)
167 		if (rce)
168 			replay_free(rc, rce);
169 	} while (rce && (rc->rc_count >= REPLAY_MAX
178 	struct replay_cache_entry *rce;
181 	TAILQ_FOREACH(rce, &rc->rc_cache[h], rce_link) {
182 		if (rce->rce_msg.rm_xid == msg->rm_xid
183 		    && rce->rce_msg.rm_call.cb_prog == msg->rm_call.cb_prog
184 		    && rce->rce_msg.rm_call.cb_vers == msg->rm_call.cb_vers
185 		    && rce->rce_msg.rm_call.cb_proc == msg->rm_call.cb_proc
186 		    && rce->rce_addr.ss_len == addr->sa_len
187 		    && bcmp(&rce->rce_addr, addr, addr->sa_len) == 0) {
188 			if (rce->rce_repmsg.rm_xid) {
194 				TAILQ_REMOVE(&rc->rc_all, rce, rce_alllink);
195 				TAILQ_INSERT_HEAD(&rc->rc_all, rce,
197 				*repmsg = rce->rce_repmsg;
198 				if (rce->rce_repbody) {
199 					*mp = m_copym(rce->rce_repbody,
217 	rce = replay_alloc(rc, msg, addr, h);
221 	if (!rce)
232 	struct replay_cache_entry *rce;
241 	TAILQ_FOREACH(rce, &rc->rc_cache[h], rce_link) {
242 		if (rce->rce_msg.rm_xid == repmsg->rm_xid
243 		    && rce->rce_addr.ss_len == addr->sa_len
244 		    && bcmp(&rce->rce_addr, addr, addr->sa_len) == 0) {
248 	if (rce) {
249 		rce->rce_repmsg = *repmsg;
250 		rce->rce_repbody = m;