Home
last modified time | relevance | path

Searched refs:E (Results 1 – 4 of 4) sorted by relevance

/lib/
Derrname.c16 #define E(err) [err + BUILD_BUG_ON_ZERO(err <= 0 || err > 300)] = "-" #err macro
18 E(E2BIG),
19 E(EACCES),
20 E(EADDRINUSE),
21 E(EADDRNOTAVAIL),
22 E(EADV),
23 E(EAFNOSUPPORT),
24 E(EAGAIN), /* EWOULDBLOCK */
25 E(EALREADY),
26 E(EBADE),
[all …]
Dlocking-selftest.c281 static void name(void) { E(); }
301 #define E() \ macro
327 #undef E
527 #define E() \ macro
553 #undef E
559 #define E() \ macro
586 #undef E
592 #define E() \ macro
619 #undef E
625 #define E() \ macro
[all …]
/lib/crypto/
Dsha1.c57 #define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \ argument
59 E += TEMP + rol32(A,5) + (fn) + (constant); \
61 TEMP = E; E = D; D = C; C = B; B = A; A = TEMP; } while (0)
63 #define T_0_15(t, A, B, C, D, E) SHA_ROUND(t, SHA_SRC, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
64 #define T_16_19(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
65 #define T_20_39(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0x6ed9eba1, A, B, C, D, E ) argument
66 #define T_40_59(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, ((B&C)+(D&(B^C))) , 0x8f1bbcdc, A, B, C, D,… argument
67 #define T_60_79(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0xca62c1d6, A, B, C, D, E ) argument
89 __u32 A, B, C, D, E; in sha1_transform() local
96 E = digest[4]; in sha1_transform()
[all …]
/lib/crypto/mpi/
Dec.c857 #define E (ctx->t.scratch[3]) in dup_point_edwards() macro
875 ctx->subm(E, ctx->p, C, ctx); in dup_point_edwards()
877 ctx->mulm(E, ctx->a, C, ctx); in dup_point_edwards()
880 ctx->addm(F, E, D, ctx); in dup_point_edwards()
895 ctx->subm(Y3, E, D, ctx); in dup_point_edwards()
910 #undef E in dup_point_edwards()
1089 #define E (ctx->t.scratch[4]) in add_points_edwards() macro
1111 ctx->mulm(E, ctx->b, C, ctx); in add_points_edwards()
1112 ctx->mulm(E, E, D, ctx); in add_points_edwards()
1115 ctx->subm(F, B, E, ctx); in add_points_edwards()
[all …]