Default Load/Store Unit (LS Unit) for simulated processors. More...

#include "llvm/MCA/HardwareUnits/LSUnit.h"

Inheritance diagram for llvm::mca::LSUnit:

Classes
class	MemoryGroup
	A node of a memory dependency graph. More...

Public Member Functions
	LSUnit (const MCSchedModel &SM)

	LSUnit (const MCSchedModel &SM, unsigned LQ, unsigned SQ)

	LSUnit (const MCSchedModel &SM, unsigned LQ, unsigned SQ, bool AssumeNoAlias)

Status	isAvailable (const InstRef &IR) const override
	Returns LSU_AVAILABLE if there are enough load/store queue entries to accomodate instruction IR.

bool	isReady (const InstRef &IR) const override
	Check if a peviously dispatched instruction IR is now ready for execution.

bool	isPending (const InstRef &IR) const override
	Check if instruction IR only depends on memory instructions that are currently executing.

bool	isWaiting (const InstRef &IR) const override
	Check if instruction IR is still waiting on memory operations, and the wait time is still unknown.

bool	hasDependentUsers (const InstRef &IR) const override

const CriticalDependency	getCriticalPredecessor (unsigned GroupId) override

unsigned	dispatch (const InstRef &IR) override
	Allocates LS resources for instruction IR.

virtual void	onInstructionIssued (const InstRef &IR) override

virtual void	onInstructionRetired (const InstRef &IR) override

virtual void	onInstructionExecuted (const InstRef &IR) override

virtual void	cycleEvent () override

virtual void	dump () const override

Public Member Functions inherited from llvm::mca::LSUnitBase
	LSUnitBase (const MCSchedModel &SM, unsigned LoadQueueSize, unsigned StoreQueueSize, bool AssumeNoAlias)

virtual	~LSUnitBase ()

unsigned	getLoadQueueSize () const
	Returns the total number of entries in the load queue.

unsigned	getStoreQueueSize () const
	Returns the total number of entries in the store queue.

unsigned	getUsedLQEntries () const

unsigned	getUsedSQEntries () const

void	acquireLQSlot ()

void	acquireSQSlot ()

void	releaseLQSlot ()

void	releaseSQSlot ()

bool	assumeNoAlias () const

virtual Status	isAvailable (const InstRef &IR) const =0
	This method checks the availability of the load/store buffers.

virtual unsigned	dispatch (const InstRef &IR)=0
	Allocates LS resources for instruction IR.

bool	isSQEmpty () const

bool	isLQEmpty () const

bool	isSQFull () const

bool	isLQFull () const

virtual bool	isReady (const InstRef &IR) const =0
	Check if a peviously dispatched instruction IR is now ready for execution.

virtual bool	isPending (const InstRef &IR) const =0
	Check if instruction IR only depends on memory instructions that are currently executing.

virtual bool	isWaiting (const InstRef &IR) const =0
	Check if instruction IR is still waiting on memory operations, and the wait time is still unknown.

virtual bool	hasDependentUsers (const InstRef &IR) const =0

virtual const CriticalDependency	getCriticalPredecessor (unsigned GroupId)=0

virtual void	onInstructionExecuted (const InstRef &IR)=0

virtual void	onInstructionRetired (const InstRef &IR)=0

virtual void	onInstructionIssued (const InstRef &IR)=0

virtual void	cycleEvent ()=0

virtual void	dump () const =0

Public Member Functions inherited from llvm::mca::HardwareUnit
	HardwareUnit ()=default

virtual	~HardwareUnit ()

Protected Attributes
DenseMap< unsigned, std::unique_ptr< MemoryGroup > >	Groups
	Used to map group identifiers to MemoryGroups.

unsigned	NextGroupID = 1

unsigned	CurrentLoadGroupID

unsigned	CurrentLoadBarrierGroupID

unsigned	CurrentStoreGroupID

unsigned	CurrentStoreBarrierGroupID

Additional Inherited Members
Public Types inherited from llvm::mca::LSUnitBase
enum	Status { LSU_AVAILABLE = 0 , LSU_LQUEUE_FULL , LSU_SQUEUE_FULL }

Detailed Description

Default Load/Store Unit (LS Unit) for simulated processors.

Each load (or store) consumes one entry in the load (or store) queue.

Rules are: 1) A younger load is allowed to pass an older load only if there are no stores nor barriers in between the two loads. 2) An younger store is not allowed to pass an older store. 3) A younger store is not allowed to pass an older load. 4) A younger load is allowed to pass an older store only if the load does not alias with the store.

This class optimistically assumes that loads don't alias store operations. Under this assumption, younger loads are always allowed to pass older stores (this would only affects rule 4). Essentially, this class doesn't perform any sort alias analysis to identify aliasing loads and stores.

To enforce aliasing between loads and stores, flag AssumeNoAlias must be set to false by the constructor of LSUnit.

Note that this class doesn't know about the existence of different memory types for memory operations (example: write-through, write-combining, etc.). Derived classes are responsible for implementing that extra knowledge, and provide different sets of rules for loads and stores by overriding method isReady(). To emulate a write-combining memory type, rule 2. must be relaxed in a derived class to enable the reordering of non-aliasing store operations.

No assumptions are made by this class on the size of the store buffer. This class doesn't know how to identify cases where store-to-load forwarding may occur.

LSUnit doesn't attempt to predict whether a load or store hits or misses the L1 cache. To be more specific, LSUnit doesn't know anything about cache hierarchy and memory types. It only knows if an instruction "mayLoad" and/or "mayStore". For loads, the scheduling model provides an "optimistic" load-to-use latency (which usually matches the load-to-use latency for when there is a hit in the L1D). Derived classes may expand this knowledge.

Class MCInstrDesc in LLVM doesn't know about serializing operations, nor memory-barrier like instructions. LSUnit conservatively assumes that an instruction which mayLoad and has unmodeled side effects behave like a "soft" load-barrier. That means, it serializes loads without forcing a flush of the load queue. Similarly, instructions that both mayStore and have unmodeled side effects are treated like store barriers. A full memory barrier is a 'mayLoad' and 'mayStore' instruction with unmodeled side effects. This is obviously inaccurate, but this is the best that we can do at the moment.

Each load/store barrier consumes one entry in the load/store queue. A load/store barrier enforces ordering of loads/stores:

A younger load cannot pass a load barrier.
A younger store cannot pass a store barrier.

A younger load has to wait for the memory load barrier to execute. A load/store barrier is "executed" when it becomes the oldest entry in the load/store queue(s). That also means, all the older loads/stores have already been executed.

Definition at line 195 of file LSUnit.h.