Home
last modified time | relevance | path

Searched refs:NUM_BEV (Results 1 – 4 of 4) sorted by relevance

/mOS-networking-stack/core/src/include/
H A Dscalable_event.h36 #ifdef NUM_BEV
37 #undef NUM_BEV
39 #define NUM_BEV 12 macro
59 tree_node_t *bevs[NUM_BEV];
H A Devent_callback.h23 #define NUM_BEV 12 macro
/mOS-networking-stack/core/src/
H A Devent_callback.c45 static const event_t g_bev_map = (~(((event_t)-1) << NUM_BEV)) << BEV_OFFSET;
84 EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, map) { in InitEvP()
99 EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, evp->cb_map) { in CleanupEvP()
163 EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, ev_total) { in RegCbWCpy()
237 EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, events) { in RegCbWoCpy()
317 EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, events) { in UnregCb()
345 EVENT_FOREACH_START(ev, i, BEV_OFFSET, BEV_OFFSET + NUM_BEV, ev_total) { in FindReusableEvT()
673 EVENT_FOREACH_START(bev, bidx, BEV_OFFSET, BEV_OFFSET + NUM_BEV, bev_map) { in HandleCallback()
H A Dscalable_event.c36 #define IS_UDE(e) ((e)->ev >= (1 << NUM_BEV))
705 for (i = 0; i < NUM_BEV; i++) { in GlobInitEvent()
721 g_evid = 1 << NUM_BEV; in GlobInitEvent()
892 for (i = 0; i < NUM_BEV; i++) { in HandleCb()
951 (event < (1L << NUM_BEV) && !POWER_OF_TWO(event))) in mtcp_register_callback()
955 if (root_event >= (1L << NUM_BEV)) { in mtcp_register_callback()