tyler.durden
/
audk
mirror of https://github.com/acidanthera/audk.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Correctly character in comments of BaseLib BitField. 

Signed-off-by: Liming Gao <liming.gao@intel.com>

git-svn-id: https://svn.code.sf.net/p/edk2/code/trunk/edk2@14497 6f19259b-4bc3-4df7-8a09-765794883524
This commit is contained in:
Liming Gao 2013-07-22 06:41:52 +00:00 committed by lgao4
parent 499ceb8ef0
commit 775180651d
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
MdePkg/Library/BaseLib/BitField.c
View File

@ -71,8 +71,8 @@ InternalBaseLibBitFieldOrUint (
// //
// Higher bits in OrData those are not used must be zero. // Higher bits in OrData those are not used must be zero.
// //
// EndBit – StartBit + 1 might be 32 while the result right shifting 32 on a 32bit integer is undefined, // EndBit - StartBit + 1 might be 32 while the result right shifting 32 on a 32bit integer is undefined,
// So the logic is updated to right shift (EndBit – StartBit) bits and compare the last bit directly. // So the logic is updated to right shift (EndBit - StartBit) bits and compare the last bit directly.
// //
ASSERT ((OrData >> (EndBit - StartBit)) == ((OrData >> (EndBit - StartBit)) & 1)); ASSERT ((OrData >> (EndBit - StartBit)) == ((OrData >> (EndBit - StartBit)) & 1));
@ -113,8 +113,8 @@ InternalBaseLibBitFieldAndUint (
// //
// Higher bits in AndData those are not used must be zero. // Higher bits in AndData those are not used must be zero.
// //
// EndBit – StartBit + 1 might be 32 while the result right shifting 32 on a 32bit integer is undefined, // EndBit - StartBit + 1 might be 32 while the result right shifting 32 on a 32bit integer is undefined,
// So the logic is updated to right shift (EndBit – StartBit) bits and compare the last bit directly. // So the logic is updated to right shift (EndBit - StartBit) bits and compare the last bit directly.
// //
ASSERT ((AndData >> (EndBit - StartBit)) == ((AndData >> (EndBit - StartBit)) & 1)); ASSERT ((AndData >> (EndBit - StartBit)) == ((AndData >> (EndBit - StartBit)) & 1));
@ -811,8 +811,8 @@ BitFieldOr64 (
// //
// Higher bits in OrData those are not used must be zero. // Higher bits in OrData those are not used must be zero.
// //
// EndBit – StartBit + 1 might be 64 while the result right shifting 64 on RShiftU64() API is invalid, // EndBit - StartBit + 1 might be 64 while the result right shifting 64 on RShiftU64() API is invalid,
// So the logic is updated to right shift (EndBit – StartBit) bits and compare the last bit directly. // So the logic is updated to right shift (EndBit - StartBit) bits and compare the last bit directly.
// //
ASSERT (RShiftU64 (OrData, EndBit - StartBit) == (RShiftU64 (OrData, EndBit - StartBit) & 1)); ASSERT (RShiftU64 (OrData, EndBit - StartBit) == (RShiftU64 (OrData, EndBit - StartBit) & 1));
@ -863,8 +863,8 @@ BitFieldAnd64 (
// //
// Higher bits in AndData those are not used must be zero. // Higher bits in AndData those are not used must be zero.
// //
// EndBit – StartBit + 1 might be 64 while the right shifting 64 on RShiftU64() API is invalid, // EndBit - StartBit + 1 might be 64 while the right shifting 64 on RShiftU64() API is invalid,
// So the logic is updated to right shift (EndBit – StartBit) bits and compare the last bit directly. // So the logic is updated to right shift (EndBit - StartBit) bits and compare the last bit directly.
// //
ASSERT (RShiftU64 (AndData, EndBit - StartBit) == (RShiftU64 (AndData, EndBit - StartBit) & 1)); ASSERT (RShiftU64 (AndData, EndBit - StartBit) == (RShiftU64 (AndData, EndBit - StartBit) & 1));