81 	byte	*Head;		/* first message in queue (if any)	*/  member
99 	Q->Base = Q->Head = Q->Tail = Buffer;  in queueInit()
117 	if (Q->Tail == Q->Head) {  in queueAllocMsg()
124 	if (Q->Tail > Q->Head) {  in queueAllocMsg()
126 		if (Q->Base + need > Q->Head) {  in queueAllocMsg()
135 	if (Q->Tail + need > Q->Head) {  in queueAllocMsg()
155 	word size = ((MSG_HEAD *)Q->Head)->Size & ~MSG_INCOMPLETE;  in queueFreeMsg()
157 	Q->Head  += MSG_NEED(size);  in queueFreeMsg()
161 		if (Q->Head >= Q->Wrap) {  in queueFreeMsg()
162 			Q->Head = Q->Base;  in queueFreeMsg()
165 	} else if (Q->Head >= Q->Tail) {  in queueFreeMsg()
166 		Q->Head = Q->Tail = Q->Base;  in queueFreeMsg()
175 	MSG_HEAD *Msg = (MSG_HEAD *)Q->Head;  in queuePeekMsg()