Bounded FIFO Queue

Given: mutex, condvar, int slots[8], head/tail/count. Implement int qpush(int v) (append FIFO; -1 when full) and int qpop(void) (remove oldest; -1 when empty). Push/pop must maintain the mutex and the invariant count equals live elements.