mirror of
				https://github.com/PabloMK7/citra.git
				synced 2025-10-30 21:30:04 +00:00 
			
		
		
		
	Merge pull request #4132 from FearlessTobi/port-966
Port #966 and #414 from yuzu (Cleanups in common and file_util) & Make bitfield assignment operator public
This commit is contained in:
		
						commit
						22e172946b
					
				
					 6 changed files with 17 additions and 25 deletions
				
			
		|  | @ -9,13 +9,13 @@ namespace Common { | ||||||
| 
 | 
 | ||||||
| template <typename T> | template <typename T> | ||||||
| constexpr T AlignUp(T value, size_t size) { | constexpr T AlignUp(T value, size_t size) { | ||||||
|     static_assert(std::is_unsigned<T>::value, "T must be an unsigned value."); |     static_assert(std::is_unsigned_v<T>, "T must be an unsigned value."); | ||||||
|     return static_cast<T>(value + (size - value % size) % size); |     return static_cast<T>(value + (size - value % size) % size); | ||||||
| } | } | ||||||
| 
 | 
 | ||||||
| template <typename T> | template <typename T> | ||||||
| constexpr T AlignDown(T value, size_t size) { | constexpr T AlignDown(T value, size_t size) { | ||||||
|     static_assert(std::is_unsigned<T>::value, "T must be an unsigned value."); |     static_assert(std::is_unsigned_v<T>, "T must be an unsigned value."); | ||||||
|     return static_cast<T>(value - value % size); |     return static_cast<T>(value - value % size); | ||||||
| } | } | ||||||
| 
 | 
 | ||||||
|  |  | ||||||
|  | @ -111,12 +111,6 @@ | ||||||
| template <std::size_t Position, std::size_t Bits, typename T> | template <std::size_t Position, std::size_t Bits, typename T> | ||||||
| struct BitField { | struct BitField { | ||||||
| private: | private: | ||||||
|     // We hide the copy assigment operator here, because the default copy
 |  | ||||||
|     // assignment would copy the full storage value, rather than just the bits
 |  | ||||||
|     // relevant to this particular bit field.
 |  | ||||||
|     // We don't delete it because we want BitField to be trivially copyable.
 |  | ||||||
|     BitField& operator=(const BitField&) = default; |  | ||||||
| 
 |  | ||||||
|     // StorageType is T for non-enum types and the underlying type of T if
 |     // StorageType is T for non-enum types and the underlying type of T if
 | ||||||
|     // T is an enumeration. Note that T is wrapped within an enable_if in the
 |     // T is an enumeration. Note that T is wrapped within an enable_if in the
 | ||||||
|     // former case to workaround compile errors which arise when using
 |     // former case to workaround compile errors which arise when using
 | ||||||
|  | @ -128,6 +122,8 @@ private: | ||||||
|     using StorageTypeU = std::make_unsigned_t<StorageType>; |     using StorageTypeU = std::make_unsigned_t<StorageType>; | ||||||
| 
 | 
 | ||||||
| public: | public: | ||||||
|  |     BitField& operator=(const BitField&) = default; | ||||||
|  | 
 | ||||||
|     /// Constants to allow limited introspection of fields if needed
 |     /// Constants to allow limited introspection of fields if needed
 | ||||||
|     static constexpr size_t position = Position; |     static constexpr size_t position = Position; | ||||||
|     static constexpr size_t bits = Bits; |     static constexpr size_t bits = Bits; | ||||||
|  |  | ||||||
|  | @ -96,7 +96,7 @@ static inline int LeastSignificantSetBit(u64 val) { | ||||||
| 
 | 
 | ||||||
| template <typename IntTy> | template <typename IntTy> | ||||||
| class BitSet { | class BitSet { | ||||||
|     static_assert(!std::is_signed<IntTy>::value, "BitSet should not be used with signed types"); |     static_assert(!std::is_signed_v<IntTy>, "BitSet should not be used with signed types"); | ||||||
| 
 | 
 | ||||||
| public: | public: | ||||||
|     // A reference to a particular bit, returned from operator[].
 |     // A reference to a particular bit, returned from operator[].
 | ||||||
|  |  | ||||||
|  | @ -175,12 +175,8 @@ public: | ||||||
| 
 | 
 | ||||||
|     template <typename T> |     template <typename T> | ||||||
|     size_t ReadArray(T* data, size_t length) { |     size_t ReadArray(T* data, size_t length) { | ||||||
|         static_assert(std::is_standard_layout<T>(), |         static_assert(std::is_trivially_copyable_v<T>, | ||||||
|                       "Given array does not consist of standard layout objects"); |  | ||||||
| #if (__GNUC__ >= 5) || defined(__clang__) || defined(_MSC_VER) |  | ||||||
|         static_assert(std::is_trivially_copyable<T>(), |  | ||||||
|                       "Given array does not consist of trivially copyable objects"); |                       "Given array does not consist of trivially copyable objects"); | ||||||
| #endif |  | ||||||
| 
 | 
 | ||||||
|         if (!IsOpen()) { |         if (!IsOpen()) { | ||||||
|             m_good = false; |             m_good = false; | ||||||
|  | @ -196,12 +192,8 @@ public: | ||||||
| 
 | 
 | ||||||
|     template <typename T> |     template <typename T> | ||||||
|     size_t WriteArray(const T* data, size_t length) { |     size_t WriteArray(const T* data, size_t length) { | ||||||
|         static_assert(std::is_standard_layout<T>(), |         static_assert(std::is_trivially_copyable_v<T>, | ||||||
|                       "Given array does not consist of standard layout objects"); |  | ||||||
| #if (__GNUC__ >= 5) || defined(__clang__) || defined(_MSC_VER) |  | ||||||
|         static_assert(std::is_trivially_copyable<T>(), |  | ||||||
|                       "Given array does not consist of trivially copyable objects"); |                       "Given array does not consist of trivially copyable objects"); | ||||||
| #endif |  | ||||||
| 
 | 
 | ||||||
|         if (!IsOpen()) { |         if (!IsOpen()) { | ||||||
|             m_good = false; |             m_good = false; | ||||||
|  | @ -215,17 +207,21 @@ public: | ||||||
|         return items_written; |         return items_written; | ||||||
|     } |     } | ||||||
| 
 | 
 | ||||||
|     size_t ReadBytes(void* data, size_t length) { |     template <typename T> | ||||||
|  |     size_t ReadBytes(T* data, size_t length) { | ||||||
|  |         static_assert(std::is_trivially_copyable_v<T>, "T must be trivially copyable"); | ||||||
|         return ReadArray(reinterpret_cast<char*>(data), length); |         return ReadArray(reinterpret_cast<char*>(data), length); | ||||||
|     } |     } | ||||||
| 
 | 
 | ||||||
|     size_t WriteBytes(const void* data, size_t length) { |     template <typename T> | ||||||
|  |     size_t WriteBytes(const T* data, size_t length) { | ||||||
|  |         static_assert(std::is_trivially_copyable_v<T>, "T must be trivially copyable"); | ||||||
|         return WriteArray(reinterpret_cast<const char*>(data), length); |         return WriteArray(reinterpret_cast<const char*>(data), length); | ||||||
|     } |     } | ||||||
| 
 | 
 | ||||||
|     template <typename T> |     template <typename T> | ||||||
|     size_t WriteObject(const T& object) { |     size_t WriteObject(const T& object) { | ||||||
|         static_assert(!std::is_pointer<T>::value, "Given object is a pointer"); |         static_assert(!std::is_pointer_v<T>, "WriteObject arguments must not be a pointer"); | ||||||
|         return WriteArray(&object, 1); |         return WriteArray(&object, 1); | ||||||
|     } |     } | ||||||
| 
 | 
 | ||||||
|  |  | ||||||
|  | @ -28,7 +28,7 @@ static inline u64 ComputeHash64(const void* data, size_t len) { | ||||||
|  */ |  */ | ||||||
| template <typename T> | template <typename T> | ||||||
| static inline u64 ComputeStructHash64(const T& data) { | static inline u64 ComputeStructHash64(const T& data) { | ||||||
|     static_assert(std::is_trivially_copyable<T>(), |     static_assert(std::is_trivially_copyable_v<T>, | ||||||
|                   "Type passed to ComputeStructHash64 must be trivially copyable"); |                   "Type passed to ComputeStructHash64 must be trivially copyable"); | ||||||
|     return ComputeHash64(&data, sizeof(data)); |     return ComputeHash64(&data, sizeof(data)); | ||||||
| } | } | ||||||
|  | @ -38,7 +38,7 @@ template <typename T> | ||||||
| struct HashableStruct { | struct HashableStruct { | ||||||
|     // In addition to being trivially copyable, T must also have a trivial default constructor,
 |     // In addition to being trivially copyable, T must also have a trivial default constructor,
 | ||||||
|     // because any member initialization would be overridden by memset
 |     // because any member initialization would be overridden by memset
 | ||||||
|     static_assert(std::is_trivial<T>(), "Type passed to HashableStruct must be trivial"); |     static_assert(std::is_trivial_v<T>, "Type passed to HashableStruct must be trivial"); | ||||||
|     /*
 |     /*
 | ||||||
|      * We use a union because "implicitly-defined copy/move constructor for a union X copies the |      * We use a union because "implicitly-defined copy/move constructor for a union X copies the | ||||||
|      * object representation of X." and "implicitly-defined copy assignment operator for a union X |      * object representation of X." and "implicitly-defined copy assignment operator for a union X | ||||||
|  |  | ||||||
|  | @ -33,7 +33,7 @@ inline bool IsWithin2G(const Xbyak::CodeGenerator& code, uintptr_t target) { | ||||||
| 
 | 
 | ||||||
| template <typename T> | template <typename T> | ||||||
| inline void CallFarFunction(Xbyak::CodeGenerator& code, const T f) { | inline void CallFarFunction(Xbyak::CodeGenerator& code, const T f) { | ||||||
|     static_assert(std::is_pointer<T>(), "Argument must be a (function) pointer."); |     static_assert(std::is_pointer_v<T>, "Argument must be a (function) pointer."); | ||||||
|     size_t addr = reinterpret_cast<size_t>(f); |     size_t addr = reinterpret_cast<size_t>(f); | ||||||
|     if (IsWithin2G(code, addr)) { |     if (IsWithin2G(code, addr)) { | ||||||
|         code.call(f); |         code.call(f); | ||||||
|  |  | ||||||
		Loading…
	
	Add table
		Add a link
		
	
		Reference in a new issue