2006-02-03 20:54:37 +01:00
|
|
|
/*
|
2012-04-06 19:46:31 +02:00
|
|
|
* Copyright (c) 2012 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-03 20:54:37 +01:00
|
|
|
*
|
|
|
|
* 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
|
|
|
*
|
2012-04-06 19:46:31 +02:00
|
|
|
* Authors: Andreas Hansson
|
2006-02-03 20:54:37 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __PHYSICAL_MEMORY_HH__
|
|
|
|
#define __PHYSICAL_MEMORY_HH__
|
|
|
|
|
2012-09-19 12:15:44 +02:00
|
|
|
#include "base/addr_range_map.hh"
|
2012-10-15 14:12:32 +02:00
|
|
|
#include "mem/port.hh"
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Forward declaration to avoid header dependencies.
|
|
|
|
*/
|
|
|
|
class AbstractMemory;
|
2006-02-22 23:29:04 +01:00
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
/**
|
|
|
|
* The physical memory encapsulates all memories in the system and
|
|
|
|
* provides basic functionality for accessing those memories without
|
|
|
|
* going through the memory system and interconnect.
|
2012-10-15 14:12:32 +02:00
|
|
|
*
|
|
|
|
* The physical memory is also responsible for providing the host
|
|
|
|
* system backingstore used by the memories in the simulated guest
|
|
|
|
* system. When the system is created, the physical memory allocates
|
|
|
|
* the backing store based on the address ranges that are populated in
|
|
|
|
* the system, and does so indepentent of how those map to actual
|
|
|
|
* memory controllers. Thus, the physical memory completely abstracts
|
|
|
|
* the mapping of the backing store of the host system and the address
|
|
|
|
* mapping in the guest system. This enables us to arbitrarily change
|
|
|
|
* the number of memory controllers, and their address mapping, as
|
|
|
|
* long as the ranges stay the same.
|
2012-04-06 19:46:31 +02:00
|
|
|
*/
|
2012-10-15 14:12:32 +02:00
|
|
|
class PhysicalMemory : public Serializable
|
2012-04-06 19:46:31 +02:00
|
|
|
{
|
2006-02-22 23:29:04 +01:00
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
private:
|
2006-02-22 23:29:04 +01:00
|
|
|
|
2012-10-15 14:12:32 +02:00
|
|
|
// Name for debugging
|
|
|
|
std::string _name;
|
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
// Global address map
|
2012-09-19 12:15:44 +02:00
|
|
|
AddrRangeMap<AbstractMemory*> addrMap;
|
2006-02-22 23:29:04 +01:00
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
// a mutable cache for the last range that matched an address
|
2012-09-19 12:15:44 +02:00
|
|
|
mutable AddrRange rangeCache;
|
2006-02-22 23:29:04 +01:00
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
// All address-mapped memories
|
|
|
|
std::vector<AbstractMemory*> memories;
|
2006-02-22 23:29:04 +01:00
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
// The total memory size
|
|
|
|
uint64_t size;
|
2006-02-23 23:02:34 +01:00
|
|
|
|
2012-10-15 14:12:32 +02:00
|
|
|
// The physical memory used to provide the memory in the simulated
|
|
|
|
// system
|
|
|
|
std::vector<std::pair<AddrRange, uint8_t*> > backingStore;
|
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
// Prevent copying
|
|
|
|
PhysicalMemory(const PhysicalMemory&);
|
2006-02-22 23:29:04 +01:00
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
// Prevent assignment
|
|
|
|
PhysicalMemory& operator=(const PhysicalMemory&);
|
2012-01-25 18:18:25 +01:00
|
|
|
|
2012-10-15 14:12:32 +02:00
|
|
|
/**
|
|
|
|
* Create the memory region providing the backing store for a
|
|
|
|
* given address range that corresponds to a set of memories in
|
|
|
|
* the simulated system.
|
|
|
|
*
|
|
|
|
* @param range The address range covered
|
|
|
|
* @param memories The memories this range maps to
|
|
|
|
*/
|
|
|
|
void createBackingStore(AddrRange range,
|
|
|
|
const std::vector<AbstractMemory*>& _memories);
|
|
|
|
|
2006-02-03 20:54:37 +01:00
|
|
|
public:
|
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
/**
|
|
|
|
* Create a physical memory object, wrapping a number of memories.
|
|
|
|
*/
|
2012-10-15 14:12:32 +02:00
|
|
|
PhysicalMemory(const std::string& _name,
|
|
|
|
const std::vector<AbstractMemory*>& _memories);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Unmap all the backing store we have used.
|
|
|
|
*/
|
|
|
|
~PhysicalMemory();
|
2006-02-03 20:54:37 +01:00
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
/**
|
2012-10-15 14:12:32 +02:00
|
|
|
* Return the name for debugging and for creation of sections for
|
|
|
|
* checkpointing.
|
2012-04-06 19:46:31 +02:00
|
|
|
*/
|
2012-10-15 14:12:32 +02:00
|
|
|
const std::string name() const { return _name; }
|
2012-04-06 19:46:31 +02:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Check if a physical address is within a range of a memory that
|
|
|
|
* is part of the global address map.
|
|
|
|
*
|
|
|
|
* @param addr A physical address
|
|
|
|
* @return Whether the address corresponds to a memory
|
|
|
|
*/
|
|
|
|
bool isMemAddr(Addr addr) const;
|
2012-03-30 15:42:36 +02:00
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
/**
|
|
|
|
* Get the memory ranges for all memories that are to be reported
|
2013-01-07 19:05:38 +01:00
|
|
|
* to the configuration table. The ranges are merged before they
|
|
|
|
* are returned such that any interleaved ranges appear as a
|
|
|
|
* single range.
|
2012-04-06 19:46:31 +02:00
|
|
|
*
|
|
|
|
* @return All configuration table memory ranges
|
|
|
|
*/
|
|
|
|
AddrRangeList getConfAddrRanges() const;
|
2012-03-30 15:42:36 +02:00
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
/**
|
|
|
|
* Get the total physical memory size.
|
|
|
|
*
|
|
|
|
* @return The sum of all memory sizes
|
|
|
|
*/
|
|
|
|
uint64_t totalSize() const { return size; }
|
2006-02-03 20:54:37 +01:00
|
|
|
|
2012-10-15 14:12:32 +02:00
|
|
|
/**
|
|
|
|
* Get the pointers to the backing store for external host
|
|
|
|
* access. Note that memory in the guest should be accessed using
|
|
|
|
* access() or functionalAccess(). This interface is primarily
|
|
|
|
* intended for CPU models using hardware virtualization. Note
|
|
|
|
* that memories that are null are not present, and that the
|
|
|
|
* backing store may also contain memories that are not part of
|
|
|
|
* the OS-visible global address map and thus are allowed to
|
|
|
|
* overlap.
|
|
|
|
*
|
|
|
|
* @return Pointers to the memory backing store
|
|
|
|
*/
|
|
|
|
std::vector<std::pair<AddrRange, uint8_t*> > getBackingStore() const
|
|
|
|
{ return backingStore; }
|
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
/**
|
2012-10-15 14:12:32 +02:00
|
|
|
* Perform an untimed memory access and update all the state
|
|
|
|
* (e.g. locked addresses) and statistics accordingly. The packet
|
|
|
|
* is turned into a response if required.
|
2012-04-06 19:46:31 +02:00
|
|
|
*
|
2012-10-15 14:12:32 +02:00
|
|
|
* @param pkt Packet performing the access
|
2012-01-25 18:18:25 +01:00
|
|
|
*/
|
2012-04-06 19:46:31 +02:00
|
|
|
void access(PacketPtr pkt);
|
2012-10-15 14:12:32 +02:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Perform an untimed memory read or write without changing
|
|
|
|
* anything but the memory itself. No stats are affected by this
|
|
|
|
* access. In addition to normal accesses this also facilitates
|
|
|
|
* print requests.
|
|
|
|
*
|
|
|
|
* @param pkt Packet performing the access
|
|
|
|
*/
|
2012-04-06 19:46:31 +02:00
|
|
|
void functionalAccess(PacketPtr pkt);
|
|
|
|
|
2012-10-15 14:12:32 +02:00
|
|
|
/**
|
|
|
|
* Serialize all the memories in the system. This is independent
|
|
|
|
* of the logical memory layout, and the serialization only sees
|
|
|
|
* the contigous backing store, independent of how this maps to
|
|
|
|
* logical memories in the guest system.
|
|
|
|
*
|
|
|
|
* @param os stream to serialize to
|
|
|
|
*/
|
|
|
|
void serialize(std::ostream& os);
|
2012-01-25 18:18:25 +01:00
|
|
|
|
2012-10-15 14:12:32 +02:00
|
|
|
/**
|
|
|
|
* Serialize a specific store.
|
|
|
|
*
|
|
|
|
* @param store_id Unique identifier of this backing store
|
|
|
|
* @param range The address range of this backing store
|
|
|
|
* @param pmem The host pointer to this backing store
|
|
|
|
*/
|
|
|
|
void serializeStore(std::ostream& os, unsigned int store_id,
|
|
|
|
AddrRange range, uint8_t* pmem);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Unserialize the memories in the system. As with the
|
|
|
|
* serialization, this action is independent of how the address
|
|
|
|
* ranges are mapped to logical memories in the guest system.
|
|
|
|
*/
|
|
|
|
void unserialize(Checkpoint* cp, const std::string& section);
|
2006-03-26 00:31:20 +01:00
|
|
|
|
2012-10-15 14:12:32 +02:00
|
|
|
/**
|
|
|
|
* Unserialize a specific backing store, identified by a section.
|
|
|
|
*/
|
|
|
|
void unserializeStore(Checkpoint* cp, const std::string& section);
|
|
|
|
|
|
|
|
};
|
2006-02-03 20:54:37 +01:00
|
|
|
|
|
|
|
#endif //__PHYSICAL_MEMORY_HH__
|