| package fragmentation |
| |
| // List is an intrusive list. Entries can be added to or removed from the list |
| // in O(1) time and with no additional memory allocations. |
| // |
| // The zero value for List is an empty list ready to use. |
| // |
| // To iterate over a list (where l is a List): |
| // for e := l.Front(); e != nil; e = e.Next() { |
| // // do something with e. |
| // } |
| type reassemblerList struct { |
| head *reassembler |
| tail *reassembler |
| } |
| |
| // Reset resets list l to the empty state. |
| func (l *reassemblerList) Reset() { |
| l.head = nil |
| l.tail = nil |
| } |
| |
| // Empty returns true iff the list is empty. |
| func (l *reassemblerList) Empty() bool { |
| return l.head == nil |
| } |
| |
| // Front returns the first element of list l or nil. |
| func (l *reassemblerList) Front() *reassembler { |
| return l.head |
| } |
| |
| // Back returns the last element of list l or nil. |
| func (l *reassemblerList) Back() *reassembler { |
| return l.tail |
| } |
| |
| // PushFront inserts the element e at the front of list l. |
| func (l *reassemblerList) PushFront(e *reassembler) { |
| e.SetNext(l.head) |
| e.SetPrev(nil) |
| |
| if l.head != nil { |
| l.head.SetPrev(e) |
| } else { |
| l.tail = e |
| } |
| |
| l.head = e |
| } |
| |
| // PushBack inserts the element e at the back of list l. |
| func (l *reassemblerList) PushBack(e *reassembler) { |
| e.SetNext(nil) |
| e.SetPrev(l.tail) |
| |
| if l.tail != nil { |
| l.tail.SetNext(e) |
| } else { |
| l.head = e |
| } |
| |
| l.tail = e |
| } |
| |
| // PushBackList inserts list m at the end of list l, emptying m. |
| func (l *reassemblerList) PushBackList(m *reassemblerList) { |
| if l.head == nil { |
| l.head = m.head |
| l.tail = m.tail |
| } else if m.head != nil { |
| l.tail.SetNext(m.head) |
| m.head.SetPrev(l.tail) |
| |
| l.tail = m.tail |
| } |
| |
| m.head = nil |
| m.tail = nil |
| } |
| |
| // InsertAfter inserts e after b. |
| func (l *reassemblerList) InsertAfter(b, e *reassembler) { |
| a := b.Next() |
| e.SetNext(a) |
| e.SetPrev(b) |
| b.SetNext(e) |
| |
| if a != nil { |
| a.SetPrev(e) |
| } else { |
| l.tail = e |
| } |
| } |
| |
| // InsertBefore inserts e before a. |
| func (l *reassemblerList) InsertBefore(a, e *reassembler) { |
| b := a.Prev() |
| e.SetNext(a) |
| e.SetPrev(b) |
| a.SetPrev(e) |
| |
| if b != nil { |
| b.SetNext(e) |
| } else { |
| l.head = e |
| } |
| } |
| |
| // Remove removes e from l. |
| func (l *reassemblerList) Remove(e *reassembler) { |
| prev := e.Prev() |
| next := e.Next() |
| |
| if prev != nil { |
| prev.SetNext(next) |
| } else { |
| l.head = next |
| } |
| |
| if next != nil { |
| next.SetPrev(prev) |
| } else { |
| l.tail = prev |
| } |
| } |
| |
| // Entry is a default implementation of Linker. Users can add anonymous fields |
| // of this type to their structs to make them automatically implement the |
| // methods needed by List. |
| type reassemblerEntry struct { |
| next *reassembler |
| prev *reassembler |
| } |
| |
| // Next returns the entry that follows e in the list. |
| func (e *reassemblerEntry) Next() *reassembler { |
| return e.next |
| } |
| |
| // Prev returns the entry that precedes e in the list. |
| func (e *reassemblerEntry) Prev() *reassembler { |
| return e.prev |
| } |
| |
| // SetNext assigns 'entry' as the entry that follows e in the list. |
| func (e *reassemblerEntry) SetNext(entry *reassembler) { |
| e.next = entry |
| } |
| |
| // SetPrev assigns 'entry' as the entry that precedes e in the list. |
| func (e *reassemblerEntry) SetPrev(entry *reassembler) { |
| e.prev = entry |
| } |