00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032 #include <pch.h>
00033
00034 #include "Sim/Memory/MemOrderManager/MemOrderOperations.h"
00035
00036 #include "SysDeps/Endian.h"
00037 #include "Utility/RuntimeError.h"
00038
00039 using namespace std;
00040 using namespace Onikiri;
00041
00042 MemOrderOperations::MemOrderOperations() :
00043 m_targetIsLittleEndian(false),
00044 m_memoryAlignment(1),
00045 m_memoryAlignmentMask(~((u64)0))
00046 {
00047 }
00048
00049 void MemOrderOperations::SetAlignment( int alignment )
00050 {
00051 ASSERT( alignment > 0 );
00052 m_memoryAlignment = alignment;
00053
00054 int bits = 0;
00055 for( u64 a = alignment; a != 0; a >>= 1 ){
00056 bits++;
00057 }
00058 bits--;
00059 m_memoryAlignmentMask = shttl::mask( bits, 64-bits );
00060 }
00061
00062
00063
00064
00065
00066
00067 u64 MemOrderOperations::ReadPreviousAccess(
00068 const MemAccess& load, const MemAccess& store )
00069 {
00070
00071
00072
00073
00074
00075
00076
00077
00078
00079
00080
00081
00082
00083
00084
00085
00086 u64 storeRegValue = store.value;
00087 u64 storeMemValue = CorrectEndian( storeRegValue, store.size );
00088
00089 u64 sh = 8 * (load.address.address - store.address.address);
00090 u64 mask = shttl::mask(0, load.size * 8);
00091
00092 u64 loadMemValue = (storeMemValue >> sh) & mask;
00093 u64 loadRegValue = CorrectEndian( loadMemValue, load.size );
00094
00095 return loadRegValue;
00096 }
00097
00098 u64 MemOrderOperations::MergePartialAccess( const MemAccess& base, const MemAccess& store )
00099 {
00100 u64 baseAddr = base.address.address;
00101 u64 storeAddr = store.address.address;
00102 u64 storeValue = CorrectEndian( store.value, store.sign );
00103 s64 storeSize = store.size;
00104
00105 u64 merged = base.value;
00106
00107 if( baseAddr < storeAddr ){
00108
00109
00110
00111 s64 start = storeAddr - baseAddr;
00112 for( int i = 0; i < storeSize; ++i ){
00113 s64 baseOffset = i + start;
00114 if( baseOffset >= base.size )
00115 break;
00116 merged =
00117 shttl::deposit( merged, baseOffset*8, 8, (storeValue >> (i*8)) & 0xff );
00118 }
00119 }
00120 else{
00121
00122
00123
00124 s64 start = baseAddr - storeAddr;
00125 for( int i = 0; i < storeSize; ++i ){
00126 s64 baseOffset = i - start;
00127 if( baseOffset < 0 )
00128 continue;
00129 if( baseOffset >= base.size )
00130 break;
00131 merged =
00132 shttl::deposit( merged, baseOffset*8, 8, (storeValue >> (i*8)) & 0xff );
00133 }
00134
00135 }
00136
00137 return merged;
00138 }
00139
00140
00141 u64 MemOrderOperations::CorrectEndian( u64 src, int size )
00142 {
00143 if( m_targetIsLittleEndian )
00144 return src;
00145
00146 switch( size ){
00147 case 1:
00148 return (u64)ConvertEndian((u8)src);
00149 case 2:
00150 return (u64)ConvertEndian((u16)src);
00151 case 4:
00152 return (u64)ConvertEndian((u32)src);
00153 case 8:
00154 return (u64)ConvertEndian((u64)src);
00155 default:
00156 THROW_RUNTIME_ERROR( "Invalid size." );
00157 return 0;
00158 }
00159
00160 }
00161
00162
00163 bool MemOrderOperations::IsOverlapped(const MemAccess& access1, const MemAccess& access2) const
00164 {
00165 return IsOverlapped(access1.address.address, access1.size, access2.address.address, access2.size);
00166 }
00167
00168 bool MemOrderOperations::IsOverlapped(u64 addr1, int size1, u64 addr2, int size2) const
00169 {
00170 return
00171 (addr1 <= addr2 && addr2 < addr1+size1) ||
00172 (addr2 <= addr1 && addr1 < addr2+size2);
00173 }
00174
00175 bool MemOrderOperations::IsOverlappedInAligned( const MemAccess& access1, const MemAccess& access2 ) const
00176 {
00177 return IsOverlappedInAligned(access1.address.address, access1.size, access2.address.address, access2.size);
00178 }
00179
00180 bool MemOrderOperations::IsOverlappedInAligned( u64 addr1, int size1, u64 addr2, int size2 ) const
00181 {
00182 return (addr1 & m_memoryAlignmentMask) == (addr2 & m_memoryAlignmentMask);
00183 }
00184
00185
00186 bool MemOrderOperations::IsInnerAccess( const MemAccess& inner, const MemAccess& outer ) const
00187 {
00188 return IsInnerAccess(inner.address.address, inner.size, outer.address.address, outer.size);
00189 }
00190
00191 bool MemOrderOperations::IsInnerAccess( u64 inner, int innerSize, u64 outer, int outerSize ) const
00192 {
00193
00194
00195
00196
00197 return (outer <= inner) && ((inner + innerSize) <= (outer + outerSize));
00198 }