typo and unary negation
Šī revīzija ir iekļauta:
vecāks
42473fab3b
revīzija
5cddb24de4
@ -167,7 +167,7 @@ uint8_t PQCLEAN_HQC128_AVX2_vect_compare(const uint8_t *v1, const uint8_t *v2, u
|
||||
for (size_t i = 0; i < size; i++) {
|
||||
r |= v1[i] ^ v2[i];
|
||||
}
|
||||
r = (-r) >> 63;
|
||||
r = (~r + 1) >> 63;
|
||||
return (uint8_t) r;
|
||||
}
|
||||
|
||||
|
@ -183,7 +183,7 @@ uint8_t PQCLEAN_HQC128_CLEAN_vect_compare(const uint8_t *v1, const uint8_t *v2,
|
||||
for (size_t i = 0; i < size; i++) {
|
||||
r |= v1[i] ^ v2[i];
|
||||
}
|
||||
r = (-r) >> 63;
|
||||
r = (~r + 1) >> 63;
|
||||
return (uint8_t) r;
|
||||
}
|
||||
|
||||
|
@ -167,7 +167,7 @@ uint8_t PQCLEAN_HQC192_AVX2_vect_compare(const uint8_t *v1, const uint8_t *v2, u
|
||||
for (size_t i = 0; i < size; i++) {
|
||||
r |= v1[i] ^ v2[i];
|
||||
}
|
||||
r = (-r) >> 63;
|
||||
r = (~r + 1) >> 63;
|
||||
return (uint8_t) r;
|
||||
}
|
||||
|
||||
|
@ -183,7 +183,7 @@ uint8_t PQCLEAN_HQC192_CLEAN_vect_compare(const uint8_t *v1, const uint8_t *v2,
|
||||
for (size_t i = 0; i < size; i++) {
|
||||
r |= v1[i] ^ v2[i];
|
||||
}
|
||||
r = (-r) >> 63;
|
||||
r = (~r + 1) >> 63;
|
||||
return (uint8_t) r;
|
||||
}
|
||||
|
||||
|
@ -167,7 +167,7 @@ uint8_t PQCLEAN_HQC256_AVX2_vect_compare(const uint8_t *v1, const uint8_t *v2, u
|
||||
for (size_t i = 0; i < size; i++) {
|
||||
r |= v1[i] ^ v2[i];
|
||||
}
|
||||
r = (-r) >> 63;
|
||||
r = (~r + 1) >> 63;
|
||||
return (uint8_t) r;
|
||||
}
|
||||
|
||||
|
@ -183,7 +183,7 @@ uint8_t PQCLEAN_HQC256_CLEAN_vect_compare(const uint8_t *v1, const uint8_t *v2,
|
||||
for (size_t i = 0; i < size; i++) {
|
||||
r |= v1[i] ^ v2[i];
|
||||
}
|
||||
r = (-r) >> 63;
|
||||
r = (~r + 1) >> 63;
|
||||
return (uint8_t) r;
|
||||
}
|
||||
|
||||
|
@ -53,7 +53,7 @@ void PQCLEAN_HQCRMRS128_AVX2_reed_solomon_encode(uint8_t *cdw, const uint8_t *ms
|
||||
prev = 0;
|
||||
for (k = 0; k < PARAM_N1 - PARAM_K; k++) {
|
||||
x = cdw[k];
|
||||
cdw[k] = (uint8_t) prev ^ tmp[k];
|
||||
cdw[k] = (uint8_t) (prev ^ tmp[k]);
|
||||
prev = x;
|
||||
}
|
||||
}
|
||||
|
@ -151,7 +151,7 @@ uint8_t PQCLEAN_HQCRMRS128_AVX2_vect_compare(const uint8_t *v1, const uint8_t *v
|
||||
for (size_t i = 0; i < size; i++) {
|
||||
r |= v1[i] ^ v2[i];
|
||||
}
|
||||
r = (-r) >> 63;
|
||||
r = (~r + 1) >> 63;
|
||||
return (uint8_t) r;
|
||||
}
|
||||
|
||||
|
@ -53,7 +53,7 @@ void PQCLEAN_HQCRMRS128_CLEAN_reed_solomon_encode(uint8_t *cdw, const uint8_t *m
|
||||
prev = 0;
|
||||
for (k = 0; k < PARAM_N1 - PARAM_K; k++) {
|
||||
x = cdw[k];
|
||||
cdw[k] = (uint8_t) prev ^ tmp[k];
|
||||
cdw[k] = (uint8_t) (prev ^ tmp[k]);
|
||||
prev = x;
|
||||
}
|
||||
}
|
||||
|
@ -183,7 +183,7 @@ uint8_t PQCLEAN_HQCRMRS128_CLEAN_vect_compare(const uint8_t *v1, const uint8_t *
|
||||
for (size_t i = 0; i < size; i++) {
|
||||
r |= v1[i] ^ v2[i];
|
||||
}
|
||||
r = (-r) >> 63;
|
||||
r = (~r + 1) >> 63;
|
||||
return (uint8_t) r;
|
||||
}
|
||||
|
||||
|
@ -53,7 +53,7 @@ void PQCLEAN_HQCRMRS192_AVX2_reed_solomon_encode(uint8_t *cdw, const uint8_t *ms
|
||||
prev = 0;
|
||||
for (k = 0; k < PARAM_N1 - PARAM_K; k++) {
|
||||
x = cdw[k];
|
||||
cdw[k] = (uint8_t) prev ^ tmp[k];
|
||||
cdw[k] = (uint8_t) (prev ^ tmp[k]);
|
||||
prev = x;
|
||||
}
|
||||
}
|
||||
|
@ -151,7 +151,7 @@ uint8_t PQCLEAN_HQCRMRS192_AVX2_vect_compare(const uint8_t *v1, const uint8_t *v
|
||||
for (size_t i = 0; i < size; i++) {
|
||||
r |= v1[i] ^ v2[i];
|
||||
}
|
||||
r = (-r) >> 63;
|
||||
r = (~r + 1) >> 63;
|
||||
return (uint8_t) r;
|
||||
}
|
||||
|
||||
|
@ -53,7 +53,7 @@ void PQCLEAN_HQCRMRS192_CLEAN_reed_solomon_encode(uint8_t *cdw, const uint8_t *m
|
||||
prev = 0;
|
||||
for (k = 0; k < PARAM_N1 - PARAM_K; k++) {
|
||||
x = cdw[k];
|
||||
cdw[k] = (uint8_t) prev ^ tmp[k];
|
||||
cdw[k] = (uint8_t) (prev ^ tmp[k]);
|
||||
prev = x;
|
||||
}
|
||||
}
|
||||
|
@ -183,7 +183,7 @@ uint8_t PQCLEAN_HQCRMRS192_CLEAN_vect_compare(const uint8_t *v1, const uint8_t *
|
||||
for (size_t i = 0; i < size; i++) {
|
||||
r |= v1[i] ^ v2[i];
|
||||
}
|
||||
r = (-r) >> 63;
|
||||
r = (~r + 1) >> 63;
|
||||
return (uint8_t) r;
|
||||
}
|
||||
|
||||
|
@ -53,7 +53,7 @@ void PQCLEAN_HQCRMRS256_AVX2_reed_solomon_encode(uint8_t *cdw, const uint8_t *ms
|
||||
prev = 0;
|
||||
for (k = 0; k < PARAM_N1 - PARAM_K; k++) {
|
||||
x = cdw[k];
|
||||
cdw[k] = (uint8_t) prev ^ tmp[k];
|
||||
cdw[k] = (uint8_t) (prev ^ tmp[k]);
|
||||
prev = x;
|
||||
}
|
||||
}
|
||||
|
@ -151,7 +151,7 @@ uint8_t PQCLEAN_HQCRMRS256_AVX2_vect_compare(const uint8_t *v1, const uint8_t *v
|
||||
for (size_t i = 0; i < size; i++) {
|
||||
r |= v1[i] ^ v2[i];
|
||||
}
|
||||
r = (-r) >> 63;
|
||||
r = (~r + 1) >> 63;
|
||||
return (uint8_t) r;
|
||||
}
|
||||
|
||||
|
@ -53,7 +53,7 @@ void PQCLEAN_HQCRMRS256_CLEAN_reed_solomon_encode(uint8_t *cdw, const uint8_t *m
|
||||
prev = 0;
|
||||
for (k = 0; k < PARAM_N1 - PARAM_K; k++) {
|
||||
x = cdw[k];
|
||||
cdw[k] = (uint8_t) prev ^ tmp[k];
|
||||
cdw[k] = (uint8_t) (prev ^ tmp[k]);
|
||||
prev = x;
|
||||
}
|
||||
}
|
||||
|
@ -183,7 +183,7 @@ uint8_t PQCLEAN_HQCRMRS256_CLEAN_vect_compare(const uint8_t *v1, const uint8_t *
|
||||
for (size_t i = 0; i < size; i++) {
|
||||
r |= v1[i] ^ v2[i];
|
||||
}
|
||||
r = (-r) >> 63;
|
||||
r = (~r + 1) >> 63;
|
||||
return (uint8_t) r;
|
||||
}
|
||||
|
||||
|
Notiek ielāde…
Atsaukties uz šo jaunā problēmā
Block a user