summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
7a90895)
Fix various typos in CryptoPkg.
Contributed-under: TianoCore Contribution Agreement 1.1
Signed-off-by: Coeur <coeur@gmx.fr>
Reviewed-by: Ye Ting <ting.ye@intel.com>
Reviewed-by: Jian J Wang <jian.j.wang@intel.com>
@param[in] Asn1Time Pointer to the ASN.1 GeneralizedTime to be converted.\r
@param[out] SigningTime Return the corresponding EFI Time.\r
\r
@param[in] Asn1Time Pointer to the ASN.1 GeneralizedTime to be converted.\r
@param[out] SigningTime Return the corresponding EFI Time.\r
\r
- @retval TRUE The time convertion succeeds.\r
+ @retval TRUE The time conversion succeeds.\r
@retval FALSE Invalid parameters.\r
\r
**/\r
@retval FALSE Invalid parameters.\r
\r
**/\r
- // Swap pivot to it's final position (NextSwapLocaiton)\r
+ // Swap pivot to its final position (NextSwapLocation)\r
//\r
CopyMem (Buffer, Pivot, ElementSize);\r
CopyMem (Pivot, (UINT8 *)BufferToSort + (NextSwapLocation * ElementSize), ElementSize);\r
CopyMem ((UINT8 *)BufferToSort + (NextSwapLocation * ElementSize), Buffer, ElementSize);\r
\r
//\r
//\r
CopyMem (Buffer, Pivot, ElementSize);\r
CopyMem (Pivot, (UINT8 *)BufferToSort + (NextSwapLocation * ElementSize), ElementSize);\r
CopyMem ((UINT8 *)BufferToSort + (NextSwapLocation * ElementSize), Buffer, ElementSize);\r
\r
//\r
- // Now recurse on 2 paritial lists. Neither of these will have the 'pivot' element.\r
+ // Now recurse on 2 partial lists. Neither of these will have the 'pivot' element.\r
// IE list is sorted left half, pivot element, sorted right half...\r
//\r
QuickSortWorker (\r
// IE list is sorted left half, pivot element, sorted right half...\r
//\r
QuickSortWorker (\r