Hi everyone,

Can anyone help me understand how the FIFO queue works
in SchedulerBasicP? It seems different from implementation I have seen
before, in which m_head, m_tail point to head and tail of queue,
respectively. But m_head, m_tail in SchedulerBasicP don't seem to be such
pointers and there is no movement of them through self-increment
(e.g., m_head++). Thanks a lot.

-- 
-Xiaohui Liu
_______________________________________________
Tinyos-help mailing list
[email protected]
https://www.millennium.berkeley.edu/cgi-bin/mailman/listinfo/tinyos-help

Reply via email to