00001 /* 00002 * CircularQueueList.h : part of the Mace toolkit for building distributed systems 00003 * 00004 * Copyright (c) 2007, Charles Killian, Dejan Kostic, Ryan Braud, James W. Anderson, John Fisher-Ogden, Calvin Hubble, Duy Nguyen, Justin Burke, David Oppenheimer, Amin Vahdat, Adolfo Rodriguez, Sooraj Bhat 00005 * All rights reserved. 00006 * 00007 * Redistribution and use in source and binary forms, with or without 00008 * modification, are permitted provided that the following conditions are met: 00009 * 00010 * * Redistributions of source code must retain the above copyright 00011 * notice, this list of conditions and the following disclaimer. 00012 * * Redistributions in binary form must reproduce the above copyright 00013 * notice, this list of conditions and the following disclaimer in 00014 * the documentation and/or other materials provided with the 00015 * distribution. 00016 * * Neither the names of Duke University nor The University of 00017 * California, San Diego, nor the names of the authors or contributors 00018 * may be used to endorse or promote products derived from 00019 * this software without specific prior written permission. 00020 * 00021 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 00022 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00023 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 00024 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE 00025 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00026 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 00027 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 00028 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 00029 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE 00030 * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00031 * 00032 * ----END-OF-LEGAL-STUFF---- */ 00033 #ifndef CIRCULAR_QUEUE_LIST_H 00034 #define CIRCULAR_QUEUE_LIST_H 00035 00036 #include <boost/shared_ptr.hpp> 00037 #include "FIFOLinkedList.h" 00038 #include "CircularQueue.h" 00039 00061 template <class T> 00062 class CircularQueueList { 00063 typedef CircularQueue<T> CQ; 00064 typedef boost::shared_ptr<CQ> CQPtr; 00065 00066 00067 public: 00068 CircularQueueList(size_t len = CQ::DEFAULT_MAX_SIZE) : 00069 MAX_SIZE(len), l(CQPtr(new CQ(len))), first(0), last(0), pushc(0), popc(0) { 00070 00071 } // CircularQueueList 00072 00073 virtual ~CircularQueueList() { 00074 00075 } // ~CircularQueueList 00076 00078 virtual uint64_t size() const { 00079 // uint64_t r = l.front()->size(); 00080 // std::cout << "l.size()=" << l.size() << " r=" << r << " "; 00081 // if (l.canPop()) { 00082 // r += l.back()->size(); 00083 // std::cout << "r=" << r << " "; 00084 // r += (l.size() - 2) * (MAX_SIZE - 1); 00085 // std::cout << "r=" << r << std::endl; 00086 // } 00087 // return r; 00088 return pushc - popc; 00089 } // size 00090 00092 virtual bool empty() const { 00093 return (!l.canPop() && l.front()->empty()); 00094 } // empty 00095 00097 virtual T& front() const { 00098 assert(!empty()); 00099 return l.front()->front(); 00100 } // front 00101 00103 virtual void pop() { 00104 assert(!empty()); 00105 l.front()->pop(); 00106 if (l.front()->empty() && l.canPop()) { 00107 l.pop(); 00108 } 00109 popc++; 00110 } // pop 00111 00113 virtual void push(const T& v) { 00114 if (l.back()->isFull()) { 00115 l.push(CQPtr(new CQ(MAX_SIZE))); 00116 } 00117 l.back()->push(v); 00118 pushc++; 00119 } // push 00120 00122 virtual void clear() { 00123 while (!empty()) { 00124 pop(); 00125 } 00126 } // clear 00127 00128 public: 00129 const size_t MAX_SIZE; 00130 00131 private: 00132 FIFOLinkedList<CQPtr> l; 00133 uint64_t first; 00134 uint64_t last; 00135 uint64_t pushc; 00136 uint64_t popc; 00137 00138 }; // CircularQueueList 00139 00142 #endif // CIRCULAR_QUEUE_LIST_H