2 * Copyright (c) 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.
32 #include "arch/isa_traits.hh"
33 #include "cpu/inst_seq.hh"
34 #include "cpu/ooo_cpu/ea_list.hh"
37 EAList::addAddr(const InstSeqNum
&new_sn
, const Addr
&new_ea
)
39 instEA
newEA(new_sn
, new_ea
);
41 eaList
.push_back(newEA
);
45 EAList::clearAddr(const InstSeqNum
&sn_to_clear
, const Addr
&ea_to_clear
)
47 eaListIt list_it
= eaList
.begin();
49 while (list_it
!= eaList
.end() && (*list_it
).first
!= sn_to_clear
) {
50 assert((*list_it
).second
== ea_to_clear
);
55 EAList::checkConflict(const InstSeqNum
&check_sn
, const Addr
&check_ea
) const
57 const constEAListIt list_it
= eaList
.begin();
59 while (list_it
!= eaList
.end() && (*list_it
).first
< check_sn
) {
60 if ((*list_it
).second
== check_ea
) {
75 EAList::commit(const InstSeqNum
&commit_sn
)
77 while (!eaList
.empty() && eaList
.front().first
<= commit_sn
) {