1/*
2 * Copyright (c) 2004-2006 The Regents of The University of Michigan
3 * All rights reserved.
4 *
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;

--- 17 unchanged lines hidden (view full) ---

26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Authors: Kevin Lim
29 */
30
31#ifndef __CPU_O3_IEW_HH__
32#define __CPU_O3_IEW_HH__
33
34#include <queue>
35
36#include "base/statistics.hh"
37#include "base/timebuf.hh"
38#include "config/full_system.hh"
39#include "cpu/o3/comm.hh"
40#include "cpu/o3/scoreboard.hh"
41#include "cpu/o3/lsq.hh"
42
43class FUPool;
44
45/**
46 * DefaultIEW handles both single threaded and SMT IEW

--- 163 unchanged lines hidden (view full) ---

210 /** Returns if the LSQ has any stores to writeback. */
211 bool hasStoresToWB() { return ldstQueue.hasStoresToWB(); }
212
213 void incrWb(InstSeqNum &sn)
214 {
215 if (++wbOutstanding == wbMax)
216 ableToIssue = false;
217 DPRINTF(IEW, "wbOutstanding: %i\n", wbOutstanding);
218#if DEBUG
219 wbList.insert(sn);
220#endif
221 }
222
223 void decrWb(InstSeqNum &sn)
224 {
225 if (wbOutstanding-- == wbMax)
226 ableToIssue = true;
227 DPRINTF(IEW, "wbOutstanding: %i\n", wbOutstanding);
228#if DEBUG
229 assert(wbList.find(sn) != wbList.end());
230 wbList.erase(sn);
231#endif
232 }
233
234#if DEBUG
235 std::set<InstSeqNum> wbList;
236
237 void dumpWb()
238 {
239 std::set<InstSeqNum>::iterator wb_it = wbList.begin();
240 while (wb_it != wbList.end()) {
241 cprintf("[sn:%lli]\n",
242 (*wb_it));

--- 299 unchanged lines hidden ---