P - syntax, references, description

References

Code

Location

#define P(a,b,c,d,e,f,g,h,x,K) \

sha256.c:193

#define P(a,b,c,d,e,f,g,h,x,K) \

sha512.c:239

P( A[0], A[1], A[2], A[3], A[4], A[5], A[6], A[7], W[i+0], K[i+0] );

sha256.c:233

P( A[7], A[0], A[1], A[2], A[3], A[4], A[5], A[6], W[i+1], K[i+1] );

sha256.c:234

P( A[6], A[7], A[0], A[1], A[2], A[3], A[4], A[5], W[i+2], K[i+2] );

sha256.c:235

P( A[5], A[6], A[7], A[0], A[1], A[2], A[3], A[4], W[i+3], K[i+3] );

sha256.c:236

P( A[4], A[5], A[6], A[7], A[0], A[1], A[2], A[3], W[i+4], K[i+4] );

sha256.c:237

P( A[3], A[4], A[5], A[6], A[7], A[0], A[1], A[2], W[i+5], K[i+5] );

sha256.c:238

P( A[2], A[3], A[4], A[5], A[6], A[7], A[0], A[1], W[i+6], K[i+6] );

sha256.c:239

P( A[1], A[2], A[3], A[4], A[5], A[6], A[7], A[0], W[i+7], K[i+7] );

sha256.c:240

P( A[0], A[1], A[2], A[3], A[4], A[5], A[6], A[7], R(i+0), K[i+0] );

sha256.c:245

P( A[7], A[0], A[1], A[2], A[3], A[4], A[5], A[6], R(i+1), K[i+1] );

sha256.c:246

P( A[6], A[7], A[0], A[1], A[2], A[3], A[4], A[5], R(i+2), K[i+2] );

sha256.c:247

P( A[5], A[6], A[7], A[0], A[1], A[2], A[3], A[4], R(i+3), K[i+3] );

sha256.c:248

P( A[4], A[5], A[6], A[7], A[0], A[1], A[2], A[3], R(i+4), K[i+4] );

sha256.c:249

P( A[3], A[4], A[5], A[6], A[7], A[0], A[1], A[2], R(i+5), K[i+5] );

sha256.c:250

P( A[2], A[3], A[4], A[5], A[6], A[7], A[0], A[1], R(i+6), K[i+6] );

sha256.c:251

P( A[1], A[2], A[3], A[4], A[5], A[6], A[7], A[0], R(i+7), K[i+7] );

sha256.c:252

P( A, B, C, D, E, F, G, H, W[i], K[i] ); i++;

sha512.c:270

P( H, A, B, C, D, E, F, G, W[i], K[i] ); i++;

sha512.c:271

P( G, H, A, B, C, D, E, F, W[i], K[i] ); i++;

sha512.c:272

P( F, G, H, A, B, C, D, E, W[i], K[i] ); i++;

sha512.c:273

P( E, F, G, H, A, B, C, D, W[i], K[i] ); i++;

sha512.c:274

P( D, E, F, G, H, A, B, C, W[i], K[i] ); i++;

sha512.c:275

P( C, D, E, F, G, H, A, B, W[i], K[i] ); i++;

sha512.c:276

P( B, C, D, E, F, G, H, A, W[i], K[i] ); i++;

sha512.c:277

P macro

Syntax

Arguments

Examples

References

Call Tree

Data Use

Class Tree

Override Tree

Implementations

Instances

Lifecycle