tlb_map.hh revision 3804:fa7a01dddc7a 
1/*
2 * Copyright (c) 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;
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 * Authors: Ali Saidi
29 */
30
31#ifndef __ARCH_SPARC_TLB_MAP_HH__
32#define __ARCH_SPARC_TLB_MAP_HH__
33
34#include "arch/sparc/pagetable.hh"
35#include <map>
36
37namespace SparcISA
38{
39
40class TlbMap
41{
42  private:
43    typedef std::map<TlbRange, TlbEntry*> RangeMap;
44    RangeMap tree;
45
46  public:
47    typedef RangeMap::iterator iterator;
48
49    iterator find(const TlbRange &r)
50    {
51        iterator i;
52
53        i = tree.upper_bound(r);
54
55        if (i == tree.begin())
56            // Nothing could match, so return end()
57            return tree.end();
58
59        i--;
60
61        if (r.real != i->first.real)
62            return tree.end();
63        if (!r.real && r.contextId != i->first.contextId)
64            return tree.end();
65        if (r.partitionId != i->first.partitionId)
66            return tree.end();
67        if (i->first.va <= r.va+r.size &&
68            i->first.va+i->first.size >= r.va)
69            return i;
70
71        return tree.end();
72    }
73
74    bool intersect(const TlbRange &r)
75    {
76        iterator i;
77        i = find(r);
78        if (i != tree.end())
79            return true;
80        return false;
81    }
82
83
84    iterator insert(TlbRange &r, TlbEntry *d)
85    {
86        if (intersect(r))
87            return tree.end();
88
89        return tree.insert(std::make_pair<TlbRange,TlbEntry*>(r, d)).first;
90    }
91
92    size_t erase(TlbRange k)
93    {
94        return tree.erase(k);
95    }
96
97    void erase(iterator p)
98    {
99        tree.erase(p);
100    }
101
102    void erase(iterator p, iterator q)
103    {
104        tree.erase(p,q);
105    }
106
107    void clear()
108    {
109        tree.erase(tree.begin(), tree.end());
110    }
111
112    iterator begin()
113    {
114        return tree.begin();
115    }
116
117    iterator end()
118    {
119        return tree.end();
120    }
121
122    size_t size()
123    {
124        return tree.size();
125    }
126
127    bool empty()
128    {
129        return tree.empty();
130    }
131};
132
133};
134
135#endif // __ARCH_SPARC_TLB_MAP_HH__
136