HomeSort by: relevance | last modified time | path
    Searched defs:step (Results 1 - 25 of 410) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/external/lgpl3/gmp/dist/scanf/
fscanffuns.c 52 step (FILE *fp, int n) function
58 (gmp_doscan_step_t) step,
sscanffuns.c 74 step (const char **sp, int n) function
120 (gmp_doscan_step_t) step,
  /src/external/apache2/llvm/dist/libcxx/utils/ci/
apple-install-libcxx.sh 109 function step() { function
123 step "Building libc++.dylib and libc++abi.dylib for architecture ${arch}"
147 step "Creating a universal dylib ${dylib} from the dylibs for all architectures"
150 step "Installing the (stripped) universal dylib to ${install_dir}/usr/lib"
155 step "Installing the unstripped dylib and the dSYM bundle to ${symbols_dir}"
169 step "Installing the libc++ and libc++abi headers to ${headers_prefix}/usr/include"
178 step "Installing the libc++ and libc++abi licenses"
185 step "Creating a universal libc++abi static archive from the static archives for each architecture"
  /src/games/adventure/
extern.h 33 unsigned step; member in struct:crcstate
  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-address.h 27 tree symbol, base, index, step, offset; member in struct:mem_address
int-vector-builder.h 45 T step (T, T) const;
79 int_vector_builder<T>::step (T elt1, T elt2) const function in class:int_vector_builder
84 /* Return a vector element with the value BASE + FACTOR * STEP. */
88 int_vector_builder<T>::apply_step (T base, unsigned int factor, T step) const
90 return base + factor * step;
tree-ssa-loop.h 28 /* Iv = BASE + STEP * i. */
29 tree base, step; member in struct:affine_iv
61 of NE_EXPR, LT_EXPR, or GT_EXPR, and CONTROL.STEP is positive if CMP is
rtx-vector-builder.h 47 poly_wide_int step (rtx, rtx) const;
119 rtx_vector_builder::step (rtx elt1, rtx elt2) const function in class:rtx_vector_builder
  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-address.h 27 tree symbol, base, index, step, offset; member in struct:mem_address
int-vector-builder.h 45 T step (T, T) const;
79 int_vector_builder<T>::step (T elt1, T elt2) const function in class:int_vector_builder
84 /* Return a vector element with the value BASE + FACTOR * STEP. */
88 int_vector_builder<T>::apply_step (T base, unsigned int factor, T step) const
90 return base + factor * step;
tree-ssa-loop.h 28 /* Iv = BASE + STEP * i. */
29 tree base, step; member in struct:affine_iv
59 LT_EXPR, or GT_EXPR, and step of CONTROL is positive if CMP is
  /src/sys/arch/macppc/dev/
fancontrol.c 52 int temp, i, speed, diff, step; local
76 step = (z->fans[i].max_rpm - z->fans[i].min_rpm) / 100;
77 speed = z->fans[i].min_rpm + diff * step;
  /src/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/
bn_mp_prime_next_prime.c 28 mp_digit res_tab[PRIME_SIZE], step, kstep; local
111 step = 0;
116 /* increase step to next candidate */
117 step += kstep;
121 /* add the step to each residue */
134 } while (y == 1 && step < ((((mp_digit)1)<<DIGIT_BIT) - kstep));
136 /* add the step */
137 if ((err = mp_add_d(a, step, a)) != MP_OKAY) {
141 /* if didn't pass sieve and step == MAX then skip test */
142 if (y == 1 && step >= ((((mp_digit)1)<<DIGIT_BIT) - kstep))
    [all...]
  /src/external/lgpl3/gmp/dist/mpz/
hamdist.c 70 mp_size_t old_vsize, step; variable
125 step = old_vsize - vsize - 1;
126 count += step * GMP_NUMB_BITS;
127 step = MIN (step, usize);
128 if (step != 0)
130 count -= mpn_popcount (up, step);
131 usize -= step;
132 up += step;
149 step = MIN (usize, vsize)
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/asan/
asan_shadow_setup.cc 68 uptr step = GetMmapGranularity(); local
69 while (size > step && addr < kZeroBaseMaxShadowStart) {
70 addr += step;
71 size -= step;
  /src/external/bsd/ipf/dist/lib/
interror.c 531 int l = -1, r = IPF_NUM_ERRORS + 1, step; local
532 step = (r - l) / 2;;
534 while (step != 0) {
535 ie = ipf_errors + l + step;
538 step = l + step;
540 r = step;
542 l = step;
543 step = (r - l) / 2;;
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.fortran/
nested-funcs-2.f90 34 call step() ! pre_step
54 subroutine step() subroutine in program:contains_keyword
55 print '(A)', "step" ! post_step
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.threads/
watchpoint-fork-mt.c 32 /* Non-atomic `var++' should not hurt as we synchronize the threads by the STEP
54 volatile int step; variable
61 if (step >= 3)
64 while (step != 1)
72 step = 2;
73 while (step != 3)
75 if (step == 99)
83 if (step >= 5)
88 step = 4;
89 while (step != 5
    [all...]
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.fortran/
nested-funcs-2.f90 34 call step() ! pre_step
54 subroutine step() subroutine in program:contains_keyword
55 print '(A)', "step" ! post_step
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.threads/
watchpoint-fork-mt.c 33 /* Non-atomic `var++' should not hurt as we synchronize the threads by the STEP
55 volatile int step; variable
62 if (step >= 3)
65 while (step != 1)
73 step = 2;
74 while (step != 3)
76 if (step == 99)
84 if (step >= 5)
89 step = 4;
90 while (step != 5
    [all...]
  /src/external/lgpl3/gmp/dist/printf/
snprntffuns.c 66 size_t step, alloc, avail; local
80 step = MIN (ret, avail-1);
81 d->size -= step;
82 d->buf += step;
  /src/external/lgpl3/gmp/dist/tests/mpz/
t-mfac_uiui.c 41 unsigned long limit = 2222, step = 1; local
82 if (n + step <= limit)
83 for (j = 0; j < step; j++) {
90 else n += step;
  /src/external/mit/libuv/dist/test/
test-mutexes.c 31 static int step; variable
92 step += 1;
103 for (current = step; current == step; uv_cond_wait(&condvar, &mutex));
104 ASSERT_EQ(step, current + 1);
  /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvkm/subdev/bios/
volt.h 21 s16 step; member in struct:nvbios_volt
  /src/crypto/external/apache2/openssl/dist/crypto/ml_dsa/
ml_dsa_ntt.c 131 int step; local
134 /* Step: 1, 2, 4, 8, ..., 128 */
135 for (step = 1; step < ML_DSA_NUM_POLY_COEFFICIENTS; step <<= 1) {
138 for (i = 0; i < step; i++) {
139 const uint32_t z_step_root = zetas_montgomery[step + i];
164 * Step: 128, 64, 32, 16, ..., 1
167 int i, j, k, offset, step = ML_DSA_NUM_POLY_COEFFICIENTS; local
175 step >>= 1
    [all...]

Completed in 38 milliseconds

1 2 3 4 5 6 7 8 91011>>