93 lines
3.2 KiB
C++
93 lines
3.2 KiB
C++
|
|
||
|
/*
|
||
|
* Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
|
||
|
* 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.
|
||
|
*/
|
||
|
|
||
|
#ifndef PersistentTable_H
|
||
|
#define PersistentTable_H
|
||
|
|
||
|
#include "Global.h"
|
||
|
#include "MachineID.h"
|
||
|
#include "AccessType.h"
|
||
|
|
||
|
class AbstractChip;
|
||
|
|
||
|
template <class KEY_TYPE, class VALUE_TYPE> class Map;
|
||
|
class Address;
|
||
|
class PersistentTableEntry;
|
||
|
|
||
|
class PersistentTable {
|
||
|
public:
|
||
|
// Constructors
|
||
|
PersistentTable(AbstractChip* chip_ptr, int version);
|
||
|
|
||
|
// Destructor
|
||
|
~PersistentTable();
|
||
|
|
||
|
// Public Methods
|
||
|
void persistentRequestLock(const Address& address, MachineID locker, AccessType type);
|
||
|
void persistentRequestUnlock(const Address& address, MachineID unlocker);
|
||
|
bool okToIssueStarving(const Address& address) const;
|
||
|
MachineID findSmallest(const Address& address) const;
|
||
|
AccessType typeOfSmallest(const Address& address) const;
|
||
|
void markEntries(const Address& address);
|
||
|
bool isLocked(const Address& addr) const;
|
||
|
int countStarvingForAddress(const Address& addr) const;
|
||
|
int countReadStarvingForAddress(const Address& addr) const;
|
||
|
|
||
|
static void printConfig(ostream& out) {}
|
||
|
|
||
|
void print(ostream& out) const;
|
||
|
private:
|
||
|
// Private Methods
|
||
|
|
||
|
// Private copy constructor and assignment operator
|
||
|
PersistentTable(const PersistentTable& obj);
|
||
|
PersistentTable& operator=(const PersistentTable& obj);
|
||
|
|
||
|
// Data Members (m_prefix)
|
||
|
Map<Address, PersistentTableEntry>* m_map_ptr;
|
||
|
AbstractChip* m_chip_ptr;
|
||
|
int m_version;
|
||
|
};
|
||
|
|
||
|
// Output operator declaration
|
||
|
ostream& operator<<(ostream& out, const PersistentTable& obj);
|
||
|
|
||
|
// ******************* Definitions *******************
|
||
|
|
||
|
// Output operator definition
|
||
|
extern inline
|
||
|
ostream& operator<<(ostream& out, const PersistentTable& obj)
|
||
|
{
|
||
|
obj.print(out);
|
||
|
out << flush;
|
||
|
return out;
|
||
|
}
|
||
|
|
||
|
#endif //PersistentTable_H
|