kris/pqc
1
1
Fork 0
Code Issues Pull Requests Releases Wiki Activity

astyle

Browse Source
This commit is contained in:
John M. Schanck 2020-09-15 17:23:57 -04:00 committed by Kris Kwiatkowski
parent 82ae2d3e34
commit 6154c0d7d3
28 changed files with 112 additions and 56 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
crypto_kem/frodokem1344aes/clean/util.c
View File

@ -12,7 +12,9 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
if (x < y) {
return x;
}
return y;
}

4
crypto_kem/frodokem1344aes/opt/util.c
View File

@ -12,7 +12,9 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
if (x < y) {
return x;
}
return y;
}

4
crypto_kem/frodokem1344shake/clean/util.c
View File

@ -12,7 +12,9 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
if (x < y) {
return x;
}
return y;
}

4
crypto_kem/frodokem1344shake/opt/util.c
View File

@ -12,7 +12,9 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
if (x < y) {
return x;
}
return y;
}

4
crypto_kem/frodokem640aes/clean/util.c
View File

@ -12,7 +12,9 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
if (x < y) {
return x;
}
return y;
}

4
crypto_kem/frodokem640aes/opt/util.c
View File

@ -12,7 +12,9 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
if (x < y) {
return x;
}
return y;
}

4
crypto_kem/frodokem640shake/clean/util.c
View File

@ -12,7 +12,9 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
if (x < y) {
return x;
}
return y;
}

4
crypto_kem/frodokem640shake/opt/util.c
View File

@ -12,7 +12,9 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
if (x < y) {
return x;
}
return y;
}

4
crypto_kem/frodokem976aes/clean/util.c
View File

@ -12,7 +12,9 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
if (x < y) {
return x;
}
return y;
}

4
crypto_kem/frodokem976aes/opt/util.c
View File

@ -12,7 +12,9 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
if (x < y) {
return x;
}
return y;
}

4
crypto_kem/frodokem976shake/clean/util.c
View File

@ -12,7 +12,9 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
if (x < y) {
return x;
}
return y;
}

4
crypto_kem/frodokem976shake/opt/util.c
View File

@ -12,7 +12,9 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
if (x < y) {
return x;
}
return y;
}

4
crypto_kem/mceliece348864/avx/int32_sort.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/mceliece348864f/avx/int32_sort.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/mceliece460896/avx/int32_sort.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/mceliece460896f/avx/int32_sort.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/mceliece6688128/avx/int32_sort.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/mceliece6688128f/avx/int32_sort.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/mceliece6960119/avx/int32_sort.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/mceliece6960119f/avx/int32_sort.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/mceliece8192128/avx/int32_sort.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/mceliece8192128f/avx/int32_sort.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/ntrulpr653/avx2/crypto_sort_int32.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, long long n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/ntrulpr761/avx2/crypto_sort_int32.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, long long n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/ntrulpr857/avx2/crypto_sort_int32.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, long long n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/sntrup653/avx2/crypto_sort_int32.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, long long n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/sntrup761/avx2/crypto_sort_int32.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, long long n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {

4
crypto_kem/sntrup857/avx2/crypto_sort_int32.c
View File

@ -463,7 +463,9 @@ static void int32_sort_2power(int32 *x, long long n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {