81 	byte	*Tail;		/* first free position			*/  member
98 	Q->Base = Q->Head = Q->Tail = Buffer;  in queueInit()
116 	if (Q->Tail == Q->Head) {  in queueAllocMsg()
123 	if (Q->Tail > Q->Head) {  in queueAllocMsg()
124 		if (Q->Tail + need <= Q->High) goto alloc; /* append */  in queueAllocMsg()
129 		Q->Wrap = Q->Tail;  in queueAllocMsg()
130 		Q->Tail = Q->Base;  in queueAllocMsg()
134 	if (Q->Tail + need > Q->Head) {  in queueAllocMsg()
139 	Msg = (MSG_HEAD *)Q->Tail;  in queueAllocMsg()
143 	Q->Tail	 += need;  in queueAllocMsg()
164 	} else if (Q->Head >= Q->Tail) {  in queueFreeMsg()
165 		Q->Head = Q->Tail = Q->Base;  in queueFreeMsg()
176 	if (((byte *)Msg == Q->Tail && !Q->Wrap) ||  in queuePeekMsg()