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__
47 std::vector<char *> index;
52 assert (idx >= -past && idx <= future);
59 friend class TimeBuffer;
61 TimeBuffer<T> *buffer;
70 wire(TimeBuffer<T> *buf, int i)
71 : buffer(buf), index(i)
79 : buffer(i.buffer), index(i.index)
82 const wire &operator=(const wire &i)
89 const wire &operator=(int idx)
95 const wire &operator+=(int offset)
101 const wire &operator-=(int offset)
113 wire &operator++(int)
117 return wire(this, i);
126 wire &operator--(int)
130 return wire(this, i);
132 T &operator*() const { return *buffer->access(index); }
133 T *operator->() const { return buffer->access(index); }
138 TimeBuffer(int p, int f)
139 : past(p), future(f), size(past + future + 1),
140 data(new char[size * sizeof(T)]), index(size), base(0)
142 assert(past >= 0 && future >= 0);
144 for (int i = 0; i < size; i++) {
146 memset(ptr, 0, sizeof(T));
159 for (int i = 0; i < size; ++i)
160 (reinterpret_cast<T *>(index[i]))->~T();
170 int ptr = base + future;
173 (reinterpret_cast<T *>(index[ptr]))->~T();
174 memset(index[ptr], 0, sizeof(T));
180 //Need more complex math here to calculate index.
183 int vector_index = idx + base;
184 if (vector_index >= size) {
185 vector_index -= size;
186 } else if (vector_index < 0) {
187 vector_index += size;
190 return reinterpret_cast<T *>(index[vector_index]);
193 T &operator[](int idx)
195 //Need more complex math here to calculate index.
198 int vector_index = idx + base;
199 if (vector_index >= size) {
200 vector_index -= size;
201 } else if (vector_index < 0) {
202 vector_index += size;
205 return reinterpret_cast<T &>(*index[vector_index]);
208 wire getWire(int idx)
212 return wire(this, idx);
217 return wire(this, 0);
226 #endif // __BASE_TIMEBUF_HH__