2 * Copyright (c) 2004-2005 The Regents of The University of Michigan
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 * Authors: Nathan Binkert
32 #ifndef __BASE_TIMEBUF_HH__
33 #define __BASE_TIMEBUF_HH__
49 std::vector<char *> index;
52 void valid(int idx) const
54 assert (idx >= -past && idx <= future);
61 friend class TimeBuffer;
63 TimeBuffer<T> *buffer;
72 wire(TimeBuffer<T> *buf, int i)
73 : buffer(buf), index(i)
81 : buffer(i.buffer), index(i.index)
84 const wire &operator=(const wire &i)
91 const wire &operator=(int idx)
97 const wire &operator+=(int offset)
103 const wire &operator-=(int offset)
115 wire &operator++(int)
119 return wire(this, i);
128 wire &operator--(int)
132 return wire(this, i);
134 T &operator*() const { return *buffer->access(index); }
135 T *operator->() const { return buffer->access(index); }
140 TimeBuffer(int p, int f)
141 : past(p), future(f), size(past + future + 1),
142 data(new char[size * sizeof(T)]), index(size), base(0)
144 assert(past >= 0 && future >= 0);
146 for (unsigned i = 0; i < size; i++) {
148 std::memset(ptr, 0, sizeof(T));
163 for (unsigned i = 0; i < size; ++i)
164 (reinterpret_cast<T *>(index[i]))->~T();
184 int ptr = base + future;
185 if (ptr >= (int)size)
187 (reinterpret_cast<T *>(index[ptr]))->~T();
188 std::memset(index[ptr], 0, sizeof(T));
193 //Calculate the index into this->index for element at position idx
195 inline int calculateVectorIndex(int idx) const
197 //Need more complex math here to calculate index.
200 int vector_index = idx + base;
201 if (vector_index >= (int)size) {
202 vector_index -= size;
203 } else if (vector_index < 0) {
204 vector_index += size;
213 int vector_index = calculateVectorIndex(idx);
215 return reinterpret_cast<T *>(index[vector_index]);
218 T &operator[](int idx)
220 int vector_index = calculateVectorIndex(idx);
222 return reinterpret_cast<T &>(*index[vector_index]);
225 const T &operator[] (int idx) const
227 int vector_index = calculateVectorIndex(idx);
229 return reinterpret_cast<const T &>(*index[vector_index]);
232 wire getWire(int idx)
236 return wire(this, idx);
241 return wire(this, 0);
250 #endif // __BASE_TIMEBUF_HH__