paul@6 | 1 | #pragma once |
paul@6 | 2 | |
paul@6 | 3 | #include <list> |
paul@6 | 4 | #include <map> |
paul@6 | 5 | |
paul@6 | 6 | #include "flexpage.h" |
paul@74 | 7 | #include "memory.h" |
paul@6 | 8 | #include "page_owner.h" |
paul@6 | 9 | |
paul@6 | 10 | |
paul@6 | 11 | |
paul@6 | 12 | /* Collection types. */ |
paul@6 | 13 | |
paul@6 | 14 | typedef struct { Flexpage *flexpage; PageOwner *owner; } QueueEntry; |
paul@6 | 15 | typedef std::list<QueueEntry> Queue; |
paul@6 | 16 | |
paul@6 | 17 | typedef std::pair<Flexpage *, Queue::iterator> Position; |
paul@6 | 18 | typedef std::map<Flexpage *, Queue::iterator> Positions; |
paul@6 | 19 | |
paul@6 | 20 | |
paul@6 | 21 | |
paul@70 | 22 | /* A queue of managed pages. */ |
paul@6 | 23 | |
paul@6 | 24 | class PageQueue |
paul@6 | 25 | { |
paul@74 | 26 | protected: |
paul@74 | 27 | |
paul@74 | 28 | /* Helper methods. */ |
paul@74 | 29 | |
paul@74 | 30 | virtual void discard(Queue &queue, Memory *memory); |
paul@74 | 31 | |
paul@74 | 32 | virtual bool remove(Queue &queue, Positions &positions, PageOwner *owner, Flexpage *flexpage); |
paul@74 | 33 | |
paul@70 | 34 | public: |
paul@72 | 35 | virtual ~PageQueue() |
paul@72 | 36 | { |
paul@72 | 37 | } |
paul@72 | 38 | |
paul@74 | 39 | virtual void close(Memory *memory) = 0; |
paul@74 | 40 | |
paul@70 | 41 | virtual void pop(PageOwner **owner, Flexpage **flexpage) = 0; |
paul@6 | 42 | |
paul@70 | 43 | virtual void push(PageOwner *owner, Flexpage *flexpage) = 0; |
paul@6 | 44 | |
paul@70 | 45 | virtual void push_front(PageOwner *owner, Flexpage *flexpage) = 0; |
paul@6 | 46 | |
paul@70 | 47 | virtual bool remove(PageOwner *owner, Flexpage *flexpage) = 0; |
paul@6 | 48 | }; |
paul@6 | 49 | |
paul@6 | 50 | // vim: tabstop=4 expandtab shiftwidth=4 |