Lines Matching refs:m_head
21 m_head = m_tail = 0;
29 return m_tail-m_head;
34 return (m_head==MaxSize());
39 m_head = m_tail = 0;
53 if (m_tail==m_head)
56 outByte=buf[m_head];
62 size_t len = STDMIN(copyMax, m_tail-m_head);
63 memcpy(target, buf+m_head, len);
69 size_t len = m_tail-m_head;
70 target.ChannelPut(channel, buf+m_head, len);
76 size_t len = STDMIN(copyMax, m_tail-m_head);
77 target.ChannelPut(channel, buf+m_head, len);
84 m_head += len;
91 m_head += len;
97 size_t len = m_tail-m_head;
98 target.ChannelPutModifiable(channel, buf+m_head, len);
99 m_head = m_tail;
105 size_t len = UnsignedMin(m_tail-m_head, transferMax);
106 target.ChannelPutModifiable(channel, buf+m_head, len);
107 m_head += len;
113 size_t len = STDMIN(skipMax, m_tail-m_head);
114 m_head += len;
120 return buf[m_head+i];
126 size_t m_head, m_tail;
135 m_head = m_tail = new ByteQueueNode(m_nodeSize);
154 m_head = m_tail = new ByteQueueNode(*copy.m_head);
156 for (ByteQueueNode *current=copy.m_head->next; current; current=current->next)
174 for (ByteQueueNode *next, *current=m_head; current; current=next)
191 for (ByteQueueNode *current=m_head; current; current=current->next)
199 return m_head==m_tail && m_head->CurrentSize()==0 && m_lazyLength==0;
204 for (ByteQueueNode *next, *current=m_head->next; current; current=next)
210 m_tail = m_head;
211 m_head->Clear();
212 m_head->next = NULL;
241 while (m_head != m_tail && m_head->UsedUp())
243 ByteQueueNode *temp=m_head;
244 m_head=m_head->next;
248 if (m_head->CurrentSize() == 0)
249 m_head->Clear();
294 if (m_head->Get(outByte))
296 if (m_head->UsedUp())
318 if (m_head->Peek(outByte))
340 for (ByteQueueNode *current=m_head; bytesLeft && current; current=current->next)
384 size_t len = STDMIN(length, m_head->m_head);
386 m_head->m_head -= len;
387 memcpy(m_head->buf + m_head->m_head, inString + length, len);
392 newHead->next = m_head;
393 m_head = newHead;
394 m_head->Put(inString, length);
400 contiguousSize = m_head->m_tail - m_head->m_head;
407 return m_head->buf + m_head->m_head;
451 for (ByteQueueNode *current=m_head; current; current=current->next)
467 std::swap(m_head, rhs.m_head);
478 m_node = m_queue.m_head;
517 blockedBytes = target.ChannelPut2(channel, m_node->buf+m_node->m_head+m_offset, len, 0, blocking);