2 * Copyright (c) 2006 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.
31 #ifndef __ARCH_SPARC_TLB_MAP_HH__
32 #define __ARCH_SPARC_TLB_MAP_HH__
34 #include "arch/sparc/pagetable.hh"
43 typedef std::map<TlbRange, TlbEntry*> RangeMap;
47 typedef RangeMap::iterator iterator;
49 iterator find(const TlbRange &r)
53 i = tree.upper_bound(r);
55 if (i == tree.begin()) {
56 if (r.real == i->first.real &&
57 r.partitionId == i->first.partitionId &&
58 i->first.va < r.va + r.size &&
59 i->first.va+i->first.size >= r.va &&
60 (r.real || r.contextId == i->first.contextId))
63 // Nothing could match, so return end()
69 if (r.real != i->first.real)
71 if (!r.real && r.contextId != i->first.contextId)
73 if (r.partitionId != i->first.partitionId)
75 if (i->first.va <= r.va+r.size &&
76 i->first.va+i->first.size >= r.va)
82 bool intersect(const TlbRange &r)
92 iterator insert(TlbRange &r, TlbEntry *d)
97 return tree.insert(std::make_pair<TlbRange,TlbEntry*>(r, d)).first;
100 size_t erase(TlbRange k)
102 return tree.erase(k);
105 void erase(iterator p)
110 void erase(iterator p, iterator q)
117 tree.erase(tree.begin(), tree.end());
144 while (i != tree.end()) {
145 std::cout << std::hex << i->first.va << " " << i->first.size << " " <<
146 i->first.contextId << " " << i->first.partitionId << " " <<
147 i->first.real << " " << i->second << std::endl;
156 #endif // __ARCH_SPARC_TLB_MAP_HH__