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__
48 std::vector<char *> index;
53 assert (idx >= -past && idx <= future);
60 friend class TimeBuffer;
62 TimeBuffer<T> *buffer;
71 wire(TimeBuffer<T> *buf, int i)
72 : buffer(buf), index(i)
80 : buffer(i.buffer), index(i.index)
83 const wire &operator=(const wire &i)
90 const wire &operator=(int idx)
96 const wire &operator+=(int offset)
102 const wire &operator-=(int offset)
114 wire &operator++(int)
118 return wire(this, i);
127 wire &operator--(int)
131 return wire(this, i);
133 T &operator*() const { return *buffer->access(index); }
134 T *operator->() const { return buffer->access(index); }
139 TimeBuffer(int p, int f)
140 : past(p), future(f), size(past + future + 1),
141 data(new char[size * sizeof(T)]), index(size), base(0)
143 assert(past >= 0 && future >= 0);
145 for (int i = 0; i < size; i++) {
147 std::memset(ptr, 0, sizeof(T));
160 for (int i = 0; i < size; ++i)
161 (reinterpret_cast<T *>(index[i]))->~T();
171 int ptr = base + future;
174 (reinterpret_cast<T *>(index[ptr]))->~T();
175 std::memset(index[ptr], 0, sizeof(T));
181 //Need more complex math here to calculate index.
184 int vector_index = idx + base;
185 if (vector_index >= size) {
186 vector_index -= size;
187 } else if (vector_index < 0) {
188 vector_index += size;
191 return reinterpret_cast<T *>(index[vector_index]);
194 T &operator[](int idx)
196 //Need more complex math here to calculate index.
199 int vector_index = idx + base;
200 if (vector_index >= size) {
201 vector_index -= size;
202 } else if (vector_index < 0) {
203 vector_index += size;
206 return reinterpret_cast<T &>(*index[vector_index]);
209 wire getWire(int idx)
213 return wire(this, idx);
218 return wire(this, 0);
227 #endif // __BASE_TIMEBUF_HH__