cpu/minor/buffers.hh

43  * Classes for buffer, queue and FIFO behaviour.
50 #include <queue>
388 /** Wrapper for a queue type to act as a pipeline stage input queue.
402       std::deque<ElemType> queue;
425      *  just discarded.  It is assummed that any push into a queue with
432             queue.push_back(data);
434             if (queue.size() > capacity) {
435                 warn("%s: No space to push data into queue of capacity"
452     /** Reserve space in the queue for future pushes.  Enquiries about space
453      *  in the queue using unreservedRemainingSpace will only tell about
460             warn("%s: No space is reservable in queue", name());
471     unsigned int occupiedSpace() const { return queue.size(); }
481         int ret = capacity - queue.size();
490         int ret = capacity - (queue.size() + numReservedSlots);
495     /** Head value.  Like std::queue::front */
496     ElemType &front() { return queue.front(); }
498     const ElemType &front() const { return queue.front(); }
500     /** Pop the head item.  Like std::queue::pop */
501     void pop() { queue.pop_front(); }
503     /** Is the queue empty? */
504     bool empty() const { return queue.empty(); }
519         /* Bodge to rotate queue to report elements */
521             ReportTraits::reportData(data, queue[num_printed - 1]);
554  *  which, when the queue is empty, just takes a reference to the pushed
556  *  onto the queue.
570     /** Underlying queue */
571     mutable Queue<ElemType, ReportTraits, BubbleTraits> queue;
579         queue(name, data_name, capacity_),
584     /** Set the tail of the queue, this is like push but needs
586      *  way into the queue proper */
592             if (queue.empty())
595                 queue.push(new_element);
599     /** No single element or queue entries */
600     bool empty() const { return !elementPtr && queue.empty(); }
602     /** Return the element, or the front of the queue */
604     { return (elementPtr ? *elementPtr : queue.front()); }
607     { return (elementPtr ? *elementPtr : queue.front()); }
609     /** Pop either the head, or if none, the head of the queue */
614             /* A popped element was expected to be pushed into queue
617             queue.freeReservation();
619             queue.pop();
623     /** Push the single element (if any) into the queue proper.  If the
630             queue.push(*elementPtr);
639         queue.minorTrace();
642     /** Reservable interface, passed on to queue */
643     bool canReserve() const { return queue.canReserve(); }
644     void reserve() { queue.reserve(); }
645     void freeReservation() { queue.freeReservation(); }
652         return queue.unreservedRemainingSpace();