HomeSort by: relevance | last modified time | path
    Searched defs:U2 (Results 1 - 18 of 18) sorted by relevancy

  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.cp/
var-tag-4.cc 22 union U2 {int a; char b;} U2;
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.cp/
var-tag-4.cc 22 union U2 {int a; char b;} U2;
  /src/sys/external/bsd/compiler_rt/dist/lib/asan/tests/
asan_test_utils.h 59 typedef uint16_t U2;
  /src/external/lgpl3/gmp/dist/mpf/
sqrt_ui.c 67 #define U2 (GMP_NUMB_BITS < BITS_PER_ULONG)
88 rsize = zeros + 1 + U2;
95 #if U2
  /src/external/gpl3/gcc/dist/libquadmath/math/
tanq_kernel.c 78 U2 = -4.180787672237927475505536849168729386782E6Q,
126 v = U0 + z * (U1 + z * (U2 + z * (U3 + z * (U4 + z))));
  /src/external/gpl3/gcc.old/dist/libquadmath/math/
tanq_kernel.c 78 U2 = -4.180787672237927475505536849168729386782E6Q,
126 v = U0 + z * (U1 + z * (U2 + z * (U3 + z * (U4 + z))));
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
StringExtras.h 186 unsigned U2 = hexDigitValue(LSB);
187 if (U1 == ~0U || U2 == ~0U)
190 Hex = static_cast<uint8_t>((U1 << 4) | U2);
  /src/external/bsd/elftosb/dist/common/
rijndael.cpp 745 static uint8_t U2[256][4]=
1445 *((uint32_t*)w) = *((uint32_t*)U1[w[0]]) ^ *((uint32_t*)U2[w[1]]) ^ *((uint32_t*)U3[w[2]]) ^ *((uint32_t*)U4[w[3]]);
1447 *((uint32_t*)w) = *((uint32_t*)U1[w[0]]) ^ *((uint32_t*)U2[w[1]]) ^ *((uint32_t*)U3[w[2]]) ^ *((uint32_t*)U4[w[3]]);
1449 *((uint32_t*)w) = *((uint32_t*)U1[w[0]]) ^ *((uint32_t*)U2[w[1]]) ^ *((uint32_t*)U3[w[2]]) ^ *((uint32_t*)U4[w[3]]);
1451 *((uint32_t*)w) = *((uint32_t*)U1[w[0]]) ^ *((uint32_t*)U2[w[1]]) ^ *((uint32_t*)U3[w[2]]) ^ *((uint32_t*)U4[w[3]]);
  /src/external/mit/isl/dist/
isl_equalities.c 502 * M [U1 U2] = M U = H = [H1 0]
510 * x = [U1 U2] [ x1' ] = [U1 U2] [Q1] x
524 * x = U1 H1^{-1} C(y) + U2 x2'
535 isl_mat *H = NULL, *C, *H1, *U = NULL, *U1, *U2;
589 U2 = isl_mat_sub_alloc(U, 0, U->n_row, B->n_row, U->n_row - B->n_row);
590 U2 = isl_mat_lin_to_aff(U2);
593 C = isl_mat_aff_direct_sum(C, U2);
  /src/external/mpl/dhcp/bind/dist/lib/isc/
ht.c 129 uint8_t u2 = s2[i]; local
131 int U2 = maptolower[u2];
132 int diff = U1 - U2;
  /src/crypto/external/apache2/openssl/dist/crypto/ec/
ecp_nistz256.c 306 BN_ULONG U2[P256_LIMBS], S2[P256_LIMBS];
354 ecp_nistz256_mul_mont(U2, in2_x, Z1sqr); /* U2 = X2*Z1^2 */
355 ecp_nistz256_sub(H, U2, U1); /* H = U2 - U1 */
368 * intermediate variables U1, U2 and S1, S2 that are derived from
370 * - U1 = X1 * (Z2)^2 ; U2 = X2 * (Z1)^2
373 * It is easy to prove that is_equal(U1, U2) implies that the affine
384 * Therefore since U1 = U2, we know H = 0, and therefore Z3 = H*Z1*Z2
391 if (is_equal(U1, U2) & ~in1infty & ~in2infty & is_equal(S1, S2))
    [all...]
  /src/crypto/external/bsd/openssl/dist/crypto/ec/
ecp_nistz256.c 315 BN_ULONG U2[P256_LIMBS], S2[P256_LIMBS];
363 ecp_nistz256_mul_mont(U2, in2_x, Z1sqr); /* U2 = X2*Z1^2 */
364 ecp_nistz256_sub(H, U2, U1); /* H = U2 - U1 */
377 * intermediate variables U1, U2 and S1, S2 that are derived from
379 * - U1 = X1 * (Z2)^2 ; U2 = X2 * (Z1)^2
382 * It is easy to prove that is_equal(U1, U2) implies that the affine
393 * Therefore since U1 = U2, we know H = 0, and therefore Z3 = H*Z1*Z2
400 if (is_equal(U1, U2) & ~in1infty & ~in2infty & is_equal(S1, S2))
    [all...]
  /src/crypto/external/bsd/openssl.old/dist/crypto/ec/
ecp_nistz256.c 309 BN_ULONG U2[P256_LIMBS], S2[P256_LIMBS];
357 ecp_nistz256_mul_mont(U2, in2_x, Z1sqr); /* U2 = X2*Z1^2 */
358 ecp_nistz256_sub(H, U2, U1); /* H = U2 - U1 */
371 * intermediate variables U1, U2 and S1, S2 that are derived from
373 * - U1 = X1 * (Z2)^2 ; U2 = X2 * (Z1)^2
376 * It is easy to prove that is_equal(U1, U2) implies that the affine
387 * Therefore since U1 = U2, we know H = 0, and therefore Z3 = H*Z1*Z2
394 if (is_equal(U1, U2) & ~in1infty & ~in2infty & is_equal(S1, S2))
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/CodeView/
SymbolRecord.h 164 uint32_t U2 = 0;
318 Result.U2 = GetCompressedAnnotation(Next);
  /src/external/bsd/zstd/dist/lib/dictBuilder/
divsufsort.c 234 const unsigned char *U1, *U2, *U1n, *U2n;
237 U2 = T + depth + *p2,
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2);
241 ++U1, ++U2) {
245 (U2 < U2n ? *U1 - *U2 : 1) :
246 (U2 < U2n ? -1 : 0);
  /src/external/gpl3/gcc/dist/contrib/
paranoia.cc 76 E0 L Milestone U2
988 FLOAT OneUlp, UfThold, U1, U2;
1004 /*U2 gap above 1.0, i.e, 1.0+U2 is next number above 1.0 */
1064 U2 = "0.001";
1145 U2 = Radix * U1;
1152 E9 = U2;
1160 if (X < U2)
1161 X = U2;
1166 U2 = X
    [all...]
  /src/external/gpl3/gcc.old/dist/contrib/
paranoia.cc 76 E0 L Milestone U2
988 FLOAT OneUlp, UfThold, U1, U2;
1004 /*U2 gap above 1.0, i.e, 1.0+U2 is next number above 1.0 */
1064 U2 = "0.001";
1145 U2 = Radix * U1;
1152 E9 = U2;
1160 if (X < U2)
1161 X = U2;
1166 U2 = X
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/msan/tests/
msan_test.cc 135 typedef unsigned short U2; // NOLINT
277 EXPECT_POISONED(*GetPoisoned<U2>());
278 EXPECT_POISONED(*GetPoisoned<U2>());
2984 U2 a2, b2;
3890 U2 y2 = 0;
3945 U2 y = 0;
3968 U2 y = 0;
4055 typedef U2 V8x16 __attribute__((__vector_size__(16)));
4061 typedef U2 V4x16 __attribute__((__vector_size__(8)));
4073 V8x16 v = {Poisoned<U2>(0, 3), Poisoned<U2>(0, 7), 2, 3, 4, 5, 6, 7}
    [all...]

Completed in 35 milliseconds