35 #define NEWID(id, ev, cb) (id ^ hash64(ev, cb))  argument
36 #define IS_UDE(e) ((e)->ev >= (1 << NUM_BEV))
57 	event_t ev;            /* event id = key */  member
67 dforest_store(event_t ev, tree_node_t* ptr)  in dforest_store()  argument
76 	de->ev = ev;  in dforest_store()
80 	idx = HASHVAL(ev);  in dforest_store()
94 dforest_search(event_t ev)   in dforest_search()  argument
99 	idx = HASHVAL(ev);  in dforest_search()
106 		if (p->ev == ev)  in dforest_search()
154 tree_search(tree_node_t *root, event_t ev)  in tree_search()  argument
160 		if (walk->ev == ev) {  in tree_search()
193 		while (bev->ev >> (idx + 1))  in stree_create()
243 hash64(event_t ev, callback_t cb)  in hash64()  argument
247 		event_t ev;  in hash64()  member
251 	instance.ev = ev;  in hash64()
259 	for (i = 0; i < sizeof(ev); ++i) {  in hash64()
260 		hash += ((uint8_t *)&ev)[i];  in hash64()
294 	ntn->ev  = w->ev;  in create_spine()
305 		ntn->ev = w->ev;  in create_spine()
367 RegCb(kvs_t *store, stree_t **pstree, event_t ev, callback_t cb)  in RegCb()  argument
383 		if (tree_search(stree->root, ev))  in RegCb()
392 	nid = NEWID(id, ev, cb);  in RegCb()
394 	TRACE_DBG("nid: 0x%lX, id: 0x%lx, ev: %ld, cb: %p\n", nid, id, ev, cb);  in RegCb()
414 	w = dforest_search(ev);  in RegCb()
456 					if (sptr && w2->ev == next_sptr->ev) {  in RegCb()
492 				if (sptr && w->ev == sptr->ev) {  in RegCb()
506 				ntn->ev  = w->ev;  in RegCb()
510 					ptn = tree_search(ntree, TREE_PARENT(w, link)->ev);  in RegCb()
559 UnregCb(kvs_t *store, stree_t **pstree, event_t ev)  in UnregCb()  argument
571 	if (!(stree = *pstree) || !(target = tree_search(stree->root, ev)) ||  in UnregCb()
580 	nid = NEWID(id, ev, cb);  in UnregCb()
583 		  nid, id, ev, cb);  in UnregCb()
635 			ntn->ev = w->ev;  in UnregCb()
640 				ptn = tree_search(ntree, TREE_PARENT(w, link)->ev);  in UnregCb()
675 ModCb(kvs_t *store, stree_t **pstree, event_t ev, callback_t cb)  in ModCb()  argument
680 	if (ev == 0)  in ModCb()
684 		return RegCb(store, pstree, ev, cb);  in ModCb()
686 		return UnregCb(store, pstree, ev);  in ModCb()
698 	g_evroot->ev = 0;  in GlobInitEvent()
704 	dforest_store(g_evroot->ev, g_evroot);  in GlobInitEvent()
711 		ntn->ev = 1 << i;  in GlobInitEvent()
719 		dforest_store(ntn->ev, ntn);  in GlobInitEvent()
742 	new->ev = g_evid++;  in mtcp_alloc_event()
753 	return new->ev;  in mtcp_alloc_event()
783 			return walk->ev;  in mtcp_define_event()
789 	new->ev = g_evid++;  in mtcp_define_event()
793 	dforest_store(new->ev, new);  in mtcp_define_event()
807 	TRACE_DBG("parent: %ld\n", parent->ev);  in mtcp_define_event()
811 	return new->ev;  in mtcp_define_event()
825 	tree_node_t *ev = NULL;  in RaiseEv()  local
828 		event_t ev;  in RaiseEv()  member
832 	instance.ev = event;  in RaiseEv()
836 	ev = (tree_node_t *)kvs_search(store, key);  in RaiseEv()
842 		if (walk->ev == event && IS_FLOATING_EVENT(walk)) {  in RaiseEv()
843 			ev = walk;  in RaiseEv()
849 	if (!ev)  in RaiseEv()
852 	if (!ev->is_in_raiseq) {  in RaiseEv()
853 		ev->is_in_raiseq = true;  in RaiseEv()
854 		EVENT_STACK_PUSH(&g_evstack, ev);  in RaiseEv()
873 	       #field, (event), (event)->ev,				\
874 	       (event)->field.tn_older   ? (event)->field.tn_older->ev   : -1, \
875 	       (event)->field.tn_younger ? (event)->field.tn_younger->ev : -1, \
876 	       (event)->field.tn_first   ? (event)->field.tn_first->ev   : -1, \
877 	       (event)->field.tn_last    ? (event)->field.tn_last->ev    : -1, \
878 	       (event)->field.tn_parent  ? (event)->field.tn_parent->ev  : -1, \
886 	tree_node_t *walk, *bev, *ev;  in HandleCb()  local
908 			    walk->ft(mctx, sock, side, walk->ev, &walk->arg) == false) {  in HandleCb()
915 				walk->cb(mctx, sock, side, walk->ev, &walk->arg);  in HandleCb()
924 		while ((ev = EVENT_STACK_POP(&g_evstack))) {  in HandleCb()
925 			ev->is_in_raiseq = false;  in HandleCb()
926 			TREE_DETACH(ev, invk);  in HandleCb()
958 		root_event = (ev_node)->link.tn_parent->ev;  in mtcp_register_callback()