8561c8366c
Only allow writing/reading of 32 bits of Y Only allow writing/reading 32 bits of pc when pstate.am Put any loaded data on the first half of a micro-op in uReg0 so it can't overwrite the register we are using for address calculation only erase a entry from the lookup table if it's valid Put in a temporary check to make sure that lookup table and tlb array stay in sync if we are interrupted in the middle of a mico-op, reset the micropc/nexpc so we start on the first part of it when we come back src/arch/sparc/isa/decoder.isa: fix smul and sdiv to sign extend, and handle overflow/underflow corretly Only allow writing/reading of 32 bits of Y Only allow writing/reading 32 bits of pc when pstate.am Put any loaded data on the first half of a micro-op in uReg0 so it can't overwrite the register we are using for address calculation src/arch/sparc/isa/formats/mem/blockmem.isa: Put any loaded data on the first half of a micro-op in uReg0 so it can't overwrite the register we are using for address calculation src/arch/sparc/isa/includes.isa: Use limits for 32bit underflow/overflow detection src/arch/sparc/tlb.cc: only erase a entry from the lookup table if it's valid Put in a temporary check to make sure that lookup table and tlb array stay in sync src/arch/sparc/tlb_map.hh: add a print function to dump the tlb lookup table src/cpu/simple/base.cc: if we are interrupted in the middle of a mico-op, reset the micropc/nexpc so we start on the first part of it when we come back --HG-- extra : convert_revision : 50a23837fd888393a5c2aa35cbd1abeebb7f55d4
155 lines
4 KiB
C++
155 lines
4 KiB
C++
/*
|
|
* Copyright (c) 2006 The Regents of The University of Michigan
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met: redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer;
|
|
* redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution;
|
|
* neither the name of the copyright holders nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
* Authors: Ali Saidi
|
|
*/
|
|
|
|
#ifndef __ARCH_SPARC_TLB_MAP_HH__
|
|
#define __ARCH_SPARC_TLB_MAP_HH__
|
|
|
|
#include "arch/sparc/pagetable.hh"
|
|
#include <map>
|
|
|
|
namespace SparcISA
|
|
{
|
|
|
|
class TlbMap
|
|
{
|
|
private:
|
|
typedef std::map<TlbRange, TlbEntry*> RangeMap;
|
|
RangeMap tree;
|
|
|
|
public:
|
|
typedef RangeMap::iterator iterator;
|
|
|
|
iterator find(const TlbRange &r)
|
|
{
|
|
iterator i;
|
|
|
|
i = tree.upper_bound(r);
|
|
|
|
if (i == tree.begin())
|
|
if (r.real == i->first.real &&
|
|
r.partitionId == i->first.partitionId &&
|
|
i->first.va < r.va + r.size &&
|
|
i->first.va+i->first.size >= r.va &&
|
|
(r.real || r.contextId == i->first.contextId))
|
|
return i;
|
|
else
|
|
// Nothing could match, so return end()
|
|
return tree.end();
|
|
|
|
i--;
|
|
|
|
if (r.real != i->first.real)
|
|
return tree.end();
|
|
if (!r.real && r.contextId != i->first.contextId)
|
|
return tree.end();
|
|
if (r.partitionId != i->first.partitionId)
|
|
return tree.end();
|
|
if (i->first.va <= r.va+r.size &&
|
|
i->first.va+i->first.size >= r.va)
|
|
return i;
|
|
|
|
return tree.end();
|
|
}
|
|
|
|
bool intersect(const TlbRange &r)
|
|
{
|
|
iterator i;
|
|
i = find(r);
|
|
if (i != tree.end())
|
|
return true;
|
|
return false;
|
|
}
|
|
|
|
|
|
iterator insert(TlbRange &r, TlbEntry *d)
|
|
{
|
|
if (intersect(r))
|
|
return tree.end();
|
|
|
|
return tree.insert(std::make_pair<TlbRange,TlbEntry*>(r, d)).first;
|
|
}
|
|
|
|
size_t erase(TlbRange k)
|
|
{
|
|
return tree.erase(k);
|
|
}
|
|
|
|
void erase(iterator p)
|
|
{
|
|
tree.erase(p);
|
|
}
|
|
|
|
void erase(iterator p, iterator q)
|
|
{
|
|
tree.erase(p,q);
|
|
}
|
|
|
|
void clear()
|
|
{
|
|
tree.erase(tree.begin(), tree.end());
|
|
}
|
|
|
|
iterator begin()
|
|
{
|
|
return tree.begin();
|
|
}
|
|
|
|
iterator end()
|
|
{
|
|
return tree.end();
|
|
}
|
|
|
|
size_t size()
|
|
{
|
|
return tree.size();
|
|
}
|
|
|
|
bool empty()
|
|
{
|
|
return tree.empty();
|
|
}
|
|
|
|
void print()
|
|
{
|
|
iterator i;
|
|
i = tree.begin();
|
|
while (i != tree.end()) {
|
|
std::cout << std::hex << i->first.va << " " << i->first.size << " " <<
|
|
i->first.contextId << " " << i->first.partitionId << " " <<
|
|
i->first.real << " " << i->second << std::endl;
|
|
i++;
|
|
}
|
|
}
|
|
|
|
};
|
|
|
|
};
|
|
|
|
#endif // __ARCH_SPARC_TLB_MAP_HH__
|