85 		evp->evt->ent[i].ref++;  in InitEvP()
92 		evp->evt->ent[i].ref++;  in InitEvP()
100 		evp->evt->ent[i].ref--;  in CleanupEvP()
107 		evp->evt->ent[i].ref--;  in CleanupEvP()
165 			assert((ev & overlap) ? new_evt->ent[i].cb == cb  in RegCbWCpy()
166 								  : new_evt->ent[i].ref == 0);  in RegCbWCpy()
168 				new_evt->ent[i].cb = cb;  in RegCbWCpy()
171 			new_evt->ent[i].cb = cur_evt->ent[i].cb;  in RegCbWCpy()
176 			new_evt->ent[i].ref++;  in RegCbWCpy()
180 				if (--cur_evt->ent[i].ref)  in RegCbWCpy()
192 			assert((ev & overlap) ? new_evt->ent[i].cb == cb  in RegCbWCpy()
193 								  : new_evt->ent[i].ref == 0);  in RegCbWCpy()
195 				new_evt->ent[i].cb = cb;  in RegCbWCpy()
202 			new_evt->ent[i].cb = cur_evt->ent[i].cb;  in RegCbWCpy()
207 			new_evt->ent[i].ref++;  in RegCbWCpy()
211 				if (--cur_evt->ent[i].ref)  in RegCbWCpy()
239 			assert((ev & overlap) ? cur_evt->ent[i].cb == cb  in RegCbWoCpy()
240 								  : cur_evt->ent[i].ref == 0);  in RegCbWoCpy()
242 				cur_evt->ent[i].cb = cb;  in RegCbWoCpy()
247 			cur_evt->ent[i].ref++;  in RegCbWoCpy()
259 			assert((ev & overlap) ? cur_evt->ent[i].cb == cb  in RegCbWoCpy()
260 								  : cur_evt->ent[i].ref == 0);  in RegCbWoCpy()
262 				cur_evt->ent[i].cb = cb;  in RegCbWoCpy()
271 			cur_evt->ent[i].ref++;  in RegCbWoCpy()
318 		if (--evt->ent[i].ref == 0)  in UnregCb()
326 		if (--evt->ent[i].ref == 0)  in UnregCb()
347 				if (walk->ent[i].cb != cb)  in FindReusableEvT()
350 				if (walk->ent[i].cb != cur_evt->ent[i].cb)  in FindReusableEvT()
360 				if (walk->ent[i].cb != cb)  in FindReusableEvT()
363 				if (walk->ent[i].cb != cur_evt->ent[i].cb)  in FindReusableEvT()
688 				evt->ent[ev_idx].cb(mctx, socket->id, side, ev, data);  in HandleCallback()