| /openbsd/lib/libcrypto/ec/ |
| H A D | ecp_smpl.c | 1032 size_t pow2 = 0; in ec_GFp_simple_points_make_affine() local
1054 pow2 = 1; in ec_GFp_simple_points_make_affine()
1055 while (num > pow2) in ec_GFp_simple_points_make_affine()
1056 pow2 <<= 1; in ec_GFp_simple_points_make_affine()
1061 pow2 <<= 1; in ec_GFp_simple_points_make_affine()
1081 for (i = pow2 / 2 - 1; i > 0; i--) in ec_GFp_simple_points_make_affine()
1084 heap[pow2 / 2 + i] = &points[i]->Z; in ec_GFp_simple_points_make_affine()
1085 for (i = pow2 / 2 + num; i < pow2; i++) in ec_GFp_simple_points_make_affine()
1089 for (i = pow2 / 2 - 1; i > 0; i--) { in ec_GFp_simple_points_make_affine()
1131 for (i = 2; i < pow2 / 2 + num; i += 2) { in ec_GFp_simple_points_make_affine()
[all …]
|
| /openbsd/gnu/lib/libiberty/src/ |
| H A D | hashtab.c | 108 int pow, pow2;
113 pow2 = n + lgup - precision;
115 nx = ldexp (1.0, pow) + ldexp (1.0, pow2);
|
| /openbsd/gnu/llvm/llvm/lib/Target/AArch64/ |
| H A D | SVEIntrinsicOpts.cpp | 267 if (PTruePattern == AArch64SVEPredPattern::pow2) in optimizePTrueIntrinsicCalls()
|
| H A D | AArch64SystemOperands.td | 341 def : SVEPREDPAT<"pow2", 0x00>;
|
| /openbsd/gnu/usr.bin/perl/cpan/Math-BigInt/lib/Math/BigInt/ |
| H A D | Lib.pm | 558 my $pow2 = $class -> _one();
565 $pow2 = $class -> _mul($pow2, $x) if substr($y_bin, $len, 1) eq '1';
569 $x = $class -> _mul($x, $pow2);
|
| H A D | Calc.pm | 1349 my $pow2 = $c->_one();
1355 $c->_mul($pow2, $cx) if substr($y_bin, $len, 1) eq '1'; # is odd?
1359 $c->_mul($cx, $pow2);
|
| /openbsd/gnu/gcc/gcc/ |
| H A D | expmed.c | 135 rtx pow2[MAX_BITS_PER_WORD]; in init_expmed() local
144 pow2[m] = GEN_INT ((HOST_WIDE_INT) 1 << m); in init_expmed()
256 XEXP (&all.shift_mult, 1) = pow2[m]; in init_expmed()
3270 int pow, pow2; in choose_multiplier() local
3280 pow2 = n + lgup - precision; in choose_multiplier()
3302 if (pow2 >= HOST_BITS_PER_WIDE_INT) in choose_multiplier()
3303 nh |= (HOST_WIDE_INT) 1 << (pow2 - HOST_BITS_PER_WIDE_INT); in choose_multiplier()
3305 nl |= (unsigned HOST_WIDE_INT) 1 << pow2; in choose_multiplier()
|
| H A D | emit-rtl.c | 1917 offset_address (rtx memref, rtx offset, unsigned HOST_WIDE_INT pow2) in offset_address() argument
1949 MIN (MEM_ALIGN (memref), pow2 * BITS_PER_UNIT), in offset_address()
|
| H A D | fold-const.c | 10033 unsigned long pow2 = exact_log2 (TREE_INT_CST_LOW (sval)); in fold_binary() local
10041 sh_cnt, build_int_cst (NULL_TREE, pow2)); in fold_binary()
|
| /openbsd/sys/dev/pci/drm/i915/ |
| H A D | i915_request.c | 1764 bool pow2 = is_power_of_2(READ_ONCE(prev->engine)->mask | in __i915_request_ensure_ordering() local
1778 if ((same_context && uses_guc) || (!uses_guc && pow2)) in __i915_request_ensure_ordering()
|
| /openbsd/gnu/usr.bin/perl/ |
| H A D | dump.c | 2169 U32 pow2 = 2; in Perl_do_sv_dump() local
2211 pow2 = pow2 << 1; in Perl_do_sv_dump()
2213 theoret += theoret * (theoret-1)/pow2; in Perl_do_sv_dump()
|
| /openbsd/gnu/usr.bin/gcc/gcc/ |
| H A D | expmed.c | 2607 int pow, pow2; local
2618 pow2 = n + lgup - precision;
2642 if (pow2 >= HOST_BITS_PER_WIDE_INT)
2643 nh |= (HOST_WIDE_INT) 1 << (pow2 - HOST_BITS_PER_WIDE_INT);
2645 nl |= (unsigned HOST_WIDE_INT) 1 << pow2;
|
| H A D | emit-rtl.c | 2147 offset_address (memref, offset, pow2) in offset_address() argument
2150 HOST_WIDE_INT pow2;
2179 (unsigned HOST_WIDE_INT) pow2 * BITS_PER_UNIT),
|
| H A D | ChangeLog.2 | 957 REGHASH_FN): New custom pow2 hash mechanism.
960 use a pow2 hash table.
|
| H A D | FSFChangeLog.11 | 9232 * tree.c (integer_{zero,one,all_ones,pow2}p, real_{zero,one,two}p):
|
| H A D | ChangeLog.6 | 17636 * combine.c (try_combine): Ensure const_int pow2 is positive.
|
| /openbsd/gnu/gcc/gcc/config/pa/ |
| H A D | milli64.S | 318 LSYM(pow2)
348 b LREF(pow2)
757 LSYM(pow2)
|
| /openbsd/gnu/usr.bin/gcc/gcc/config/pa/ |
| H A D | milli64.S | 299 LSYM(pow2)
329 b LREF(pow2)
738 LSYM(pow2)
|