1/*
2 * Copyright (c) 2012 ARM Limited
3 * All rights reserved
4 *
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software
9 * licensed hereunder. You may use the software subject to the license
10 * terms below provided that you ensure that this notice is replicated
11 * unmodified and in its entirety in all distributions of the software,
12 * modified or unmodified, in source code or in binary form.
13 *
14 * Copyright (c) 2006 The Regents of The University of Michigan
15 * All rights reserved.
16 *
17 * Redistribution and use in source and binary forms, with or without
18 * modification, are permitted provided that the following conditions are
19 * met: redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer;
21 * redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution;
24 * neither the name of the copyright holders nor the names of its
25 * contributors may be used to endorse or promote products derived from
26 * this software without specific prior written permission.
27 *
28 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
29 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
30 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
31 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
32 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
33 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
34 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
35 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
36 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
37 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
38 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39 *
40 * Authors: Kevin Lim
41 */
42
43#include <sstream>
44
45#include "cpu/o3/fu_pool.hh"
46#include "cpu/func_unit.hh"
47
48using namespace std;
49
50////////////////////////////////////////////////////////////////////////////
51//
52// A pool of function units
53//
54
55inline void
56FUPool::FUIdxQueue::addFU(int fu_idx)
57{
58 funcUnitsIdx.push_back(fu_idx);
59 ++size;
60}
61
62inline int
63FUPool::FUIdxQueue::getFU()
64{
65 int retval = funcUnitsIdx[idx++];
66
67 if (idx == size)
68 idx = 0;
69
70 return retval;
71}
72
73FUPool::~FUPool()
74{
75 fuListIterator i = funcUnits.begin();
76 fuListIterator end = funcUnits.end();
77 for (; i != end; ++i)
78 delete *i;
79}
80
81
82// Constructor
83FUPool::FUPool(const Params *p)
84 : SimObject(p)
85{
86 numFU = 0;
87
88 funcUnits.clear();
89
90 for (int i = 0; i < Num_OpClasses; ++i) {
91 maxOpLatencies[i] = Cycles(0);
92 maxIssueLatencies[i] = Cycles(0);
93 }
94
95 //
96 // Iterate through the list of FUDescData structures
97 //
98 const vector<FUDesc *> &paramList = p->FUList;
99 for (FUDDiterator i = paramList.begin(); i != paramList.end(); ++i) {
100
101 //
102 // Don't bother with this if we're not going to create any FU's
103 //
104 if ((*i)->number) {
105 //
106 // Create the FuncUnit object from this structure
107 // - add the capabilities listed in the FU's operation
108 // description
109 //
110 // We create the first unit, then duplicate it as needed
111 //
112 FuncUnit *fu = new FuncUnit;
113
114 OPDDiterator j = (*i)->opDescList.begin();
115 OPDDiterator end = (*i)->opDescList.end();
116 for (; j != end; ++j) {
117 // indicate that this pool has this capability
118 capabilityList.set((*j)->opClass);
119
120 // Add each of the FU's that will have this capability to the
121 // appropriate queue.
122 for (int k = 0; k < (*i)->number; ++k)
123 fuPerCapList[(*j)->opClass].addFU(numFU + k);
124
125 // indicate that this FU has the capability
126 fu->addCapability((*j)->opClass, (*j)->opLat, (*j)->issueLat);
127
128 if ((*j)->opLat > maxOpLatencies[(*j)->opClass])
129 maxOpLatencies[(*j)->opClass] = (*j)->opLat;
130
131 if ((*j)->issueLat > maxIssueLatencies[(*j)->opClass])
132 maxIssueLatencies[(*j)->opClass] = (*j)->issueLat;
133 }
134
135 numFU++;
136
137 // Add the appropriate number of copies of this FU to the list
138 ostringstream s;
139
140 s << (*i)->name() << "(0)";
141 fu->name = s.str();
142 funcUnits.push_back(fu);
143
144 for (int c = 1; c < (*i)->number; ++c) {
145 ostringstream s;
146 numFU++;
147 FuncUnit *fu2 = new FuncUnit(*fu);
148
149 s << (*i)->name() << "(" << c << ")";
150 fu2->name = s.str();
151 funcUnits.push_back(fu2);
152 }
153 }
154 }
155
156 unitBusy.resize(numFU);
157
158 for (int i = 0; i < numFU; i++) {
159 unitBusy[i] = false;
160 }
161}
162
163void
164FUPool::annotateMemoryUnits(Cycles hit_latency)
165{
166 maxOpLatencies[MemReadOp] = hit_latency;
167
168 fuListIterator i = funcUnits.begin();
169 fuListIterator iend = funcUnits.end();
170 for (; i != iend; ++i) {
171 if ((*i)->provides(MemReadOp))
172 (*i)->opLatency(MemReadOp) = hit_latency;
173
174 if ((*i)->provides(MemWriteOp))
175 (*i)->opLatency(MemWriteOp) = hit_latency;
176 }
177}
178
179int
180FUPool::getUnit(OpClass capability)
181{
182 // If this pool doesn't have the specified capability,
183 // return this information to the caller
184 if (!capabilityList[capability])
185 return -2;
186
187 int fu_idx = fuPerCapList[capability].getFU();
188 int start_idx = fu_idx;
189
190 // Iterate through the circular queue if needed, stopping if we've reached
191 // the first element again.
192 while (unitBusy[fu_idx]) {
193 fu_idx = fuPerCapList[capability].getFU();
194 if (fu_idx == start_idx) {
195 // No FU available
196 return -1;
197 }
198 }
199
200 assert(fu_idx < numFU);
201
202 unitBusy[fu_idx] = true;
203
204 return fu_idx;
205}
206
207void
208FUPool::freeUnitNextCycle(int fu_idx)
209{
210 assert(unitBusy[fu_idx]);
211 unitsToBeFreed.push_back(fu_idx);
212}
213
214void
215FUPool::processFreeUnits()
216{
217 while (!unitsToBeFreed.empty()) {
218 int fu_idx = unitsToBeFreed.back();
219 unitsToBeFreed.pop_back();
220
221 assert(unitBusy[fu_idx]);
222
223 unitBusy[fu_idx] = false;
224 }
225}
226
227void
228FUPool::dump()
229{
230 cout << "Function Unit Pool (" << name() << ")\n";
231 cout << "======================================\n";
232 cout << "Free List:\n";
233
234 for (int i = 0; i < numFU; ++i) {
235 if (unitBusy[i]) {
236 continue;
237 }
238
239 cout << " [" << i << "] : ";
240
241 cout << funcUnits[i]->name << " ";
242
243 cout << "\n";
244 }
245
246 cout << "======================================\n";
247 cout << "Busy List:\n";
248 for (int i = 0; i < numFU; ++i) {
249 if (!unitBusy[i]) {
250 continue;
251 }
252
253 cout << " [" << i << "] : ";
254
255 cout << funcUnits[i]->name << " ";
256
257 cout << "\n";
258 }
259}
260
261void
262FUPool::drainSanityCheck() const
263{
264 assert(unitsToBeFreed.empty());
265 for (int i = 0; i < numFU; i++)
266 assert(!unitBusy[i]);
267}
268
269//
270
271////////////////////////////////////////////////////////////////////////////
272//
273// The SimObjects we use to get the FU information into the simulator
274//
275////////////////////////////////////////////////////////////////////////////
276
277//
278// FUPool - Contails a list of FUDesc objects to make available
279//
280
281//
282// The FuPool object
283//
284FUPool *
285FUPoolParams::create()
286{
287 return new FUPool(this);
288}