2006-02-21 05:26:39 +01:00
|
|
|
/*
|
2012-01-17 19:55:08 +01:00
|
|
|
* Copyright (c) 2011 ARM Limited
|
|
|
|
* All rights reserved
|
|
|
|
*
|
|
|
|
* The license below extends only to copyright in the software and shall
|
|
|
|
* not be construed as granting a license to any other intellectual
|
|
|
|
* property including but not limited to intellectual property relating
|
|
|
|
* to a hardware implementation of the functionality of the software
|
|
|
|
* licensed hereunder. You may use the software subject to the license
|
|
|
|
* terms below provided that you ensure that this notice is replicated
|
|
|
|
* unmodified and in its entirety in all distributions of the software,
|
|
|
|
* modified or unmodified, in source code or in binary form.
|
|
|
|
*
|
2006-02-21 05:26:39 +01:00
|
|
|
* Copyright (c) 2001-2005 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.
|
2006-06-01 01:26:56 +02:00
|
|
|
*
|
|
|
|
* Authors: Ron Dreslinski
|
|
|
|
* Steve Reinhardt
|
2012-01-17 19:55:08 +01:00
|
|
|
* Andreas Hansson
|
2006-02-21 05:26:39 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <string>
|
2009-09-23 17:34:21 +02:00
|
|
|
|
2011-10-16 14:06:40 +02:00
|
|
|
#include "arch/isa_traits.hh"
|
2006-02-21 09:32:42 +01:00
|
|
|
#include "base/chunk_generator.hh"
|
2009-09-23 17:34:21 +02:00
|
|
|
#include "config/the_isa.hh"
|
2011-04-15 19:44:06 +02:00
|
|
|
#include "mem/page_table.hh"
|
2012-01-17 19:55:08 +01:00
|
|
|
#include "mem/se_translating_port_proxy.hh"
|
2007-05-09 21:37:46 +02:00
|
|
|
#include "sim/process.hh"
|
2013-07-18 14:31:16 +02:00
|
|
|
#include "sim/system.hh"
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2006-03-10 01:21:35 +01:00
|
|
|
using namespace TheISA;
|
|
|
|
|
MEM: Introduce the master/slave port sub-classes in C++
This patch introduces the notion of a master and slave port in the C++
code, thus bringing the previous classification from the Python
classes into the corresponding simulation objects and memory objects.
The patch enables us to classify behaviours into the two bins and add
assumptions and enfore compliance, also simplifying the two
interfaces. As a starting point, isSnooping is confined to a master
port, and getAddrRanges to slave ports. More of these specilisations
are to come in later patches.
The getPort function is not getMasterPort and getSlavePort, and
returns a port reference rather than a pointer as NULL would never be
a valid return value. The default implementation of these two
functions is placed in MemObject, and calls fatal.
The one drawback with this specific patch is that it requires some
code duplication, e.g. QueuedPort becomes QueuedMasterPort and
QueuedSlavePort, and BusPort becomes BusMasterPort and BusSlavePort
(avoiding multiple inheritance). With the later introduction of the
port interfaces, moving the functionality outside the port itself, a
lot of the duplicated code will disappear again.
2012-03-30 15:40:11 +02:00
|
|
|
SETranslatingPortProxy::SETranslatingPortProxy(MasterPort& port, Process *p,
|
2012-01-17 19:55:08 +01:00
|
|
|
AllocType alloc)
|
2013-07-18 14:31:16 +02:00
|
|
|
: PortProxy(port, p->system->cacheLineSize()), pTable(p->pTable),
|
|
|
|
process(p), allocating(alloc)
|
2006-02-21 05:26:39 +01:00
|
|
|
{ }
|
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
SETranslatingPortProxy::~SETranslatingPortProxy()
|
2006-02-21 05:26:39 +01:00
|
|
|
{ }
|
|
|
|
|
2006-03-12 06:40:29 +01:00
|
|
|
bool
|
2012-02-29 10:47:51 +01:00
|
|
|
SETranslatingPortProxy::tryReadBlob(Addr addr, uint8_t *p, int size) const
|
2006-02-21 05:26:39 +01:00
|
|
|
{
|
2006-02-21 09:32:42 +01:00
|
|
|
int prevSize = 0;
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2014-09-03 13:42:21 +02:00
|
|
|
for (ChunkGenerator gen(addr, size, PageBytes); !gen.done(); gen.next()) {
|
2011-10-16 14:06:40 +02:00
|
|
|
Addr paddr;
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2006-03-02 07:01:03 +01:00
|
|
|
if (!pTable->translate(gen.addr(),paddr))
|
2006-03-12 06:40:29 +01:00
|
|
|
return false;
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
PortProxy::readBlob(paddr, p + prevSize, gen.size());
|
2006-03-02 07:01:03 +01:00
|
|
|
prevSize += gen.size();
|
2006-02-21 09:32:42 +01:00
|
|
|
}
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2006-03-12 06:40:29 +01:00
|
|
|
return true;
|
2006-02-21 05:26:39 +01:00
|
|
|
}
|
|
|
|
|
2006-03-12 06:40:29 +01:00
|
|
|
void
|
2012-02-29 10:47:51 +01:00
|
|
|
SETranslatingPortProxy::readBlob(Addr addr, uint8_t *p, int size) const
|
2006-03-12 06:40:29 +01:00
|
|
|
{
|
2006-03-12 22:38:16 +01:00
|
|
|
if (!tryReadBlob(addr, p, size))
|
|
|
|
fatal("readBlob(0x%x, ...) failed", addr);
|
2006-03-12 06:40:29 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
bool
|
2012-02-29 10:47:51 +01:00
|
|
|
SETranslatingPortProxy::tryWriteBlob(Addr addr, uint8_t *p, int size) const
|
2006-02-21 05:26:39 +01:00
|
|
|
{
|
2006-02-21 09:32:42 +01:00
|
|
|
int prevSize = 0;
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2014-09-03 13:42:21 +02:00
|
|
|
for (ChunkGenerator gen(addr, size, PageBytes); !gen.done(); gen.next()) {
|
2011-10-16 14:06:40 +02:00
|
|
|
Addr paddr;
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2006-03-02 07:01:03 +01:00
|
|
|
if (!pTable->translate(gen.addr(), paddr)) {
|
2007-05-09 21:37:46 +02:00
|
|
|
if (allocating == Always) {
|
2014-09-03 13:42:21 +02:00
|
|
|
process->allocateMem(roundDown(gen.addr(), PageBytes),
|
|
|
|
PageBytes);
|
2007-05-09 21:37:46 +02:00
|
|
|
} else if (allocating == NextPage) {
|
|
|
|
// check if we've accessed the next page on the stack
|
2011-09-09 10:01:43 +02:00
|
|
|
if (!process->fixupStackFault(gen.addr()))
|
2007-05-09 21:37:46 +02:00
|
|
|
panic("Page table fault when accessing virtual address %#x "
|
|
|
|
"during functional write\n", gen.addr());
|
2006-03-02 07:01:03 +01:00
|
|
|
} else {
|
2006-03-12 06:40:29 +01:00
|
|
|
return false;
|
2006-03-02 07:01:03 +01:00
|
|
|
}
|
2007-05-09 21:37:46 +02:00
|
|
|
pTable->translate(gen.addr(), paddr);
|
2006-03-02 07:01:03 +01:00
|
|
|
}
|
2006-02-21 09:32:42 +01:00
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
PortProxy::writeBlob(paddr, p + prevSize, gen.size());
|
2006-03-02 07:01:03 +01:00
|
|
|
prevSize += gen.size();
|
2006-02-21 09:32:42 +01:00
|
|
|
}
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2006-03-12 06:40:29 +01:00
|
|
|
return true;
|
2006-02-21 05:26:39 +01:00
|
|
|
}
|
|
|
|
|
2006-03-02 16:31:48 +01:00
|
|
|
|
2006-03-12 06:40:29 +01:00
|
|
|
void
|
2012-02-29 10:47:51 +01:00
|
|
|
SETranslatingPortProxy::writeBlob(Addr addr, uint8_t *p, int size) const
|
2006-03-12 06:40:29 +01:00
|
|
|
{
|
2006-03-30 22:59:49 +02:00
|
|
|
if (!tryWriteBlob(addr, p, size))
|
2006-03-12 22:38:16 +01:00
|
|
|
fatal("writeBlob(0x%x, ...) failed", addr);
|
2006-03-12 06:40:29 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
2012-02-29 10:47:51 +01:00
|
|
|
SETranslatingPortProxy::tryMemsetBlob(Addr addr, uint8_t val, int size) const
|
2006-02-21 05:26:39 +01:00
|
|
|
{
|
2014-09-03 13:42:21 +02:00
|
|
|
for (ChunkGenerator gen(addr, size, PageBytes); !gen.done(); gen.next()) {
|
2011-10-16 14:06:40 +02:00
|
|
|
Addr paddr;
|
2006-02-21 09:32:42 +01:00
|
|
|
|
2006-03-02 16:31:48 +01:00
|
|
|
if (!pTable->translate(gen.addr(), paddr)) {
|
2007-05-09 21:37:46 +02:00
|
|
|
if (allocating == Always) {
|
2014-09-03 13:42:21 +02:00
|
|
|
process->allocateMem(roundDown(gen.addr(), PageBytes),
|
|
|
|
PageBytes);
|
2006-03-02 16:31:48 +01:00
|
|
|
pTable->translate(gen.addr(), paddr);
|
|
|
|
} else {
|
2006-03-12 06:40:29 +01:00
|
|
|
return false;
|
2006-03-02 16:31:48 +01:00
|
|
|
}
|
|
|
|
}
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
PortProxy::memsetBlob(paddr, val, gen.size());
|
2006-02-21 09:32:42 +01:00
|
|
|
}
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2006-03-12 06:40:29 +01:00
|
|
|
return true;
|
2006-02-21 05:26:39 +01:00
|
|
|
}
|
2006-03-02 16:31:48 +01:00
|
|
|
|
2006-03-12 06:40:29 +01:00
|
|
|
void
|
2012-02-29 10:47:51 +01:00
|
|
|
SETranslatingPortProxy::memsetBlob(Addr addr, uint8_t val, int size) const
|
2006-03-12 06:40:29 +01:00
|
|
|
{
|
2006-03-30 22:59:49 +02:00
|
|
|
if (!tryMemsetBlob(addr, val, size))
|
2006-03-12 22:38:16 +01:00
|
|
|
fatal("memsetBlob(0x%x, ...) failed", addr);
|
2006-03-12 06:40:29 +01:00
|
|
|
}
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2006-03-12 06:40:29 +01:00
|
|
|
|
|
|
|
bool
|
2012-02-29 10:47:51 +01:00
|
|
|
SETranslatingPortProxy::tryWriteString(Addr addr, const char *str) const
|
2006-02-21 05:26:39 +01:00
|
|
|
{
|
2006-02-21 08:15:02 +01:00
|
|
|
uint8_t c;
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2011-10-16 14:06:40 +02:00
|
|
|
Addr vaddr = addr;
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2006-02-21 08:15:02 +01:00
|
|
|
do {
|
|
|
|
c = *str++;
|
2011-10-16 14:06:40 +02:00
|
|
|
Addr paddr;
|
|
|
|
|
|
|
|
if (!pTable->translate(vaddr++, paddr))
|
2006-03-12 06:40:29 +01:00
|
|
|
return false;
|
2006-02-21 08:15:02 +01:00
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
PortProxy::writeBlob(paddr, &c, 1);
|
2006-02-21 08:15:02 +01:00
|
|
|
} while (c);
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2006-03-12 06:40:29 +01:00
|
|
|
return true;
|
2006-02-21 05:26:39 +01:00
|
|
|
}
|
|
|
|
|
2006-03-12 06:40:29 +01:00
|
|
|
void
|
2012-02-29 10:47:51 +01:00
|
|
|
SETranslatingPortProxy::writeString(Addr addr, const char *str) const
|
2006-03-12 06:40:29 +01:00
|
|
|
{
|
2006-03-12 22:38:16 +01:00
|
|
|
if (!tryWriteString(addr, str))
|
|
|
|
fatal("writeString(0x%x, ...) failed", addr);
|
2006-03-12 06:40:29 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
2012-02-29 10:47:51 +01:00
|
|
|
SETranslatingPortProxy::tryReadString(std::string &str, Addr addr) const
|
2006-02-21 05:26:39 +01:00
|
|
|
{
|
2006-02-21 08:15:02 +01:00
|
|
|
uint8_t c;
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2011-10-16 14:06:40 +02:00
|
|
|
Addr vaddr = addr;
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2012-08-07 01:57:11 +02:00
|
|
|
while (true) {
|
2011-10-16 14:06:40 +02:00
|
|
|
Addr paddr;
|
|
|
|
|
|
|
|
if (!pTable->translate(vaddr++, paddr))
|
2006-03-12 06:40:29 +01:00
|
|
|
return false;
|
2006-02-21 08:15:02 +01:00
|
|
|
|
2012-01-17 19:55:08 +01:00
|
|
|
PortProxy::readBlob(paddr, &c, 1);
|
2012-08-07 01:57:11 +02:00
|
|
|
if (c == '\0')
|
|
|
|
break;
|
|
|
|
|
2006-02-21 08:15:02 +01:00
|
|
|
str += c;
|
2012-08-07 01:57:11 +02:00
|
|
|
}
|
2006-02-21 05:26:39 +01:00
|
|
|
|
2006-03-12 06:40:29 +01:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2012-02-29 10:47:51 +01:00
|
|
|
SETranslatingPortProxy::readString(std::string &str, Addr addr) const
|
2006-03-12 06:40:29 +01:00
|
|
|
{
|
2006-03-12 22:38:16 +01:00
|
|
|
if (!tryReadString(str, addr))
|
|
|
|
fatal("readString(0x%x, ...) failed", addr);
|
2006-02-21 05:26:39 +01:00
|
|
|
}
|
|
|
|
|