protocols/tcp/BufferQueue.cpp

60 BufferQueue::SetInitialSequence(tcp_sequence sequence)
63 		sequence.Number()));
65 	fFirstSequence = fLastSequence = sequence;
78 BufferQueue::Add(net_buffer *buffer, tcp_sequence sequence)
80 	TRACE(("BufferQueue@%p::Add(buffer %p, size %lu, sequence %lu)\n",
81 		this, buffer, buffer->size, sequence.Number()));
87 	if (tcp_sequence(sequence + buffer->size) <= fFirstSequence
93 	if (sequence < fFirstSequence) {
96 			(fFirstSequence - sequence).Number());
97 		sequence = fFirstSequence;
100 	if (fList.IsEmpty() || sequence >= fLastSequence) {
103 		buffer->sequence = sequence.Number();
105 		if (sequence == fLastSequence
112 		fLastSequence = sequence + buffer->size;
122 	if (fLastSequence < sequence + buffer->size)
123 		fLastSequence = sequence + buffer->size;
131 		if (sequence >= previous->sequence) {
141 		if (sequence == previous->sequence) {
153 		} else if (tcp_sequence(previous->sequence + previous->size)
154 				>= sequence + buffer->size) {
158 		} else if (tcp_sequence(previous->sequence + previous->size)
159 				> sequence) {
162 				(previous->sequence + previous->size - sequence).Number());
163 			sequence = previous->sequence + previous->size;
167 	// "next" always starts at or after the buffer sequence
168 	ASSERT(next == NULL || buffer == NULL || next->sequence >= sequence);
171 		&& tcp_sequence(sequence + buffer->size) > next->sequence) {
173 		if (tcp_sequence(next->sequence + next->size)
174 				<= sequence + buffer->size) {
181 		} else if (tcp_sequence(next->sequence) > sequence) {
184 				(sequence + buffer->size - next->sequence).Number());
201 	buffer->sequence = sequence.Number();
208 	else if (fFirstSequence + fContiguousBytes == sequence) {
217 			&& fFirstSequence + fContiguousBytes == buffer->sequence);
227 /*!	Removes all data in the queue up to the \a sequence number as specified.
233 BufferQueue::RemoveUntil(tcp_sequence sequence)
235 	TRACE(("BufferQueue@%p::RemoveUntil(sequence %lu)\n", this,
236 		sequence.Number()));
239 	if (sequence < fFirstSequence)
245 	while ((buffer = iterator.Next()) != NULL && buffer->sequence < sequence) {
246 		ASSERT(lastRemoved == buffer->sequence);
250 		if (sequence >= buffer->sequence + buffer->size) {
256 			lastRemoved = buffer->sequence + buffer->size;
260 			size_t size = (sequence - buffer->sequence).Number();
263 			buffer->sequence += size;
273 		fFirstSequence = fList.Head()->sequence;
283 BufferQueue::Get(net_buffer *buffer, tcp_sequence sequence, size_t bytes)
285 	TRACE(("BufferQueue@%p::Get(sequence %lu, bytes %lu)\n", this,
286 		sequence.Number(), bytes));
292 	if (sequence >= fLastSequence || sequence < fFirstSequence) {
296 	if (tcp_sequence(sequence + bytes) > fLastSequence)
297 		bytes = (fLastSequence - sequence).Number();
301 	// find first buffer matching the sequence
306 		if (sequence < source->sequence + source->size)
312 	if (tcp_sequence(source->sequence) > sequence) {
313 		panic("source %p, sequence = %" B_PRIu32 " (%" B_PRIu32 ")\n", source,
314 			source->sequence, sequence.Number());
319 	uint32 offset = (sequence - source->sequence).Number();
396 			source->sequence += size;
421 BufferQueue::Available(tcp_sequence sequence) const
423 	if (sequence > (fFirstSequence + fContiguousBytes).Number())
426 	return (fContiguousBytes + fFirstSequence - sequence).Number();
436 		fPushPointer = fList.Tail()->sequence + fList.Tail()->size;
460 		if (contiguous && buffer->sequence == last)
465 		ASSERT(last <= buffer->sequence);
469 		last = buffer->sequence + buffer->size;
484 		kprintf("      %" B_PRId32 ". buffer %p, sequence %" B_PRIu32 ", size %"
485 			B_PRIu32 "\n", ++number, buffer, buffer->sequence, buffer->size);