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__
46 std::vector<char *> index;
51 assert (idx >= -past && idx <= future);
58 friend class TimeBuffer;
60 TimeBuffer<T> *buffer;
69 wire(TimeBuffer<T> *buf, int i)
70 : buffer(buf), index(i)
78 : buffer(i.buffer), index(i.index)
81 const wire &operator=(const wire &i)
88 const wire &operator=(int idx)
94 const wire &operator+=(int offset)
100 const wire &operator-=(int offset)
112 wire &operator++(int)
116 return wire(this, i);
125 wire &operator--(int)
129 return wire(this, i);
131 T &operator*() const { return *buffer->access(index); }
132 T *operator->() const { return buffer->access(index); }
137 TimeBuffer(int p, int f)
138 : past(p), future(f), size(past + future + 1),
139 data(new char[size * sizeof(T)]), index(size), base(0)
141 assert(past >= 0 && future >= 0);
143 for (int i = 0; i < size; i++) {
145 memset(ptr, 0, sizeof(T));
158 for (int i = 0; i < size; ++i)
159 (reinterpret_cast<T *>(index[i]))->~T();
169 int ptr = base + future;
172 (reinterpret_cast<T *>(index[ptr]))->~T();
173 memset(index[ptr], 0, sizeof(T));
179 //Need more complex math here to calculate index.
182 int vector_index = idx + base;
183 if (vector_index >= size) {
184 vector_index -= size;
185 } else if (vector_index < 0) {
186 vector_index += size;
189 return reinterpret_cast<T *>(index[vector_index]);
192 T &operator[](int idx)
194 //Need more complex math here to calculate index.
197 int vector_index = idx + base;
198 if (vector_index >= size) {
199 vector_index -= size;
200 } else if (vector_index < 0) {
201 vector_index += size;
204 return reinterpret_cast<T &>(*index[vector_index]);
207 wire getWire(int idx)
211 return wire(this, idx);
216 return wire(this, 0);
220 #endif // __BASE_TIMEBUF_HH__