RGBCube/serenity
1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-07-27 11:07:45 +00:00
Code Issues Activity Actions

LibCrypto: Fix grammar in a couple of comments

Browse source
This commit is contained in:
Linus Groh 2022-03-22 11:26:14 +00:00
parent bd110be367
commit f36f9c106b
1 changed files with 3 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

6
Userland/Libraries/LibCrypto/Hash/SHA2.cpp
View file

@ -128,7 +128,7 @@ SHA256::DigestType SHA256::peek()
// SHA uses big-endian and we assume little-endian // SHA uses big-endian and we assume little-endian
// FIXME: looks like a thing for AK::NetworkOrdered, // FIXME: looks like a thing for AK::NetworkOrdered,
// but he doesn't support shifting operations // but that doesn't support shifting operations
for (size_t i = 0; i < 4; ++i) { for (size_t i = 0; i < 4; ++i) {
digest.data[i + 0] = (m_state[0] >> (24 - i * 8)) & 0x000000ff; digest.data[i + 0] = (m_state[0] >> (24 - i * 8)) & 0x000000ff;
digest.data[i + 4] = (m_state[1] >> (24 - i * 8)) & 0x000000ff; digest.data[i + 4] = (m_state[1] >> (24 - i * 8)) & 0x000000ff;
@ -246,7 +246,7 @@ SHA384::DigestType SHA384::peek()
// SHA uses big-endian and we assume little-endian // SHA uses big-endian and we assume little-endian
// FIXME: looks like a thing for AK::NetworkOrdered, // FIXME: looks like a thing for AK::NetworkOrdered,
// but he doesn't support shifting operations // but that doesn't support shifting operations
for (size_t i = 0; i < 8; ++i) { for (size_t i = 0; i < 8; ++i) {
digest.data[i + 0] = (m_state[0] >> (56 - i * 8)) & 0x000000ff; digest.data[i + 0] = (m_state[0] >> (56 - i * 8)) & 0x000000ff;
digest.data[i + 8] = (m_state[1] >> (56 - i * 8)) & 0x000000ff; digest.data[i + 8] = (m_state[1] >> (56 - i * 8)) & 0x000000ff;
@ -361,7 +361,7 @@ SHA512::DigestType SHA512::peek()
// SHA uses big-endian and we assume little-endian // SHA uses big-endian and we assume little-endian
// FIXME: looks like a thing for AK::NetworkOrdered, // FIXME: looks like a thing for AK::NetworkOrdered,
// but he doesn't support shifting operations // but that doesn't support shifting operations
for (size_t i = 0; i < 8; ++i) { for (size_t i = 0; i < 8; ++i) {
digest.data[i + 0] = (m_state[0] >> (56 - i * 8)) & 0x000000ff; digest.data[i + 0] = (m_state[0] >> (56 - i * 8)) & 0x000000ff;
digest.data[i + 8] = (m_state[1] >> (56 - i * 8)) & 0x000000ff; digest.data[i + 8] = (m_state[1] >> (56 - i * 8)) & 0x000000ff;