e7922902aba971efa8509dbdb0e08ecd683ee33a
[gem5.git] / cpu / ozone / ea_list.cc
1 /*
2 * Copyright (c) 2005 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;
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.
15 *
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.
27 */
28
29 #include "targetarch/isa_traits.hh"
30 #include "cpu/inst_seq.hh"
31 #include "cpu/ooo_cpu/ea_list.hh"
32
33 void
34 EAList::addAddr(const InstSeqNum &new_sn, const Addr &new_ea)
35 {
36 instEA newEA(new_sn, new_ea);
37
38 eaList.push_back(newEA);
39 }
40
41 void
42 EAList::clearAddr(const InstSeqNum &sn_to_clear, const Addr &ea_to_clear)
43 {
44 eaListIt list_it = eaList.begin();
45
46 while (list_it != eaList.end() && (*list_it).first != sn_to_clear) {
47 assert((*list_it).second == ea_to_clear);
48 }
49 }
50
51 bool
52 EAList::checkConflict(const InstSeqNum &check_sn, const Addr &check_ea) const
53 {
54 const constEAListIt list_it = eaList.begin();
55
56 while (list_it != eaList.end() && (*list_it).first < check_sn) {
57 if ((*list_it).second == check_ea) {
58 return true;
59 }
60 }
61
62 return false;
63 }
64
65 void
66 EAList::clear()
67 {
68 eaList.clear();
69 }
70
71 void
72 EAList::commit(const InstSeqNum &commit_sn)
73 {
74 while (!eaList.empty() && eaList.front().first <= commit_sn) {
75 eaList.pop_front();
76 }
77 }