HomeSort by: relevance | last modified time | path
    Searched refs:j1 (Results 1 - 25 of 34) sorted by relevancy

1 2

  /src/usr.bin/make/unit-tests/
meta-output.exp 6 Test -j1 output
depsrc-meta.mk 29 @${MAKE} -r -f ${MAKEFILE} actual-test -j1
30 @${MAKE} -r -f ${MAKEFILE} check-results -j1
meta-output.mk 11 all: output.-B output.-j1
25 output.-B output.-j1:
varname-dot-make-mode.exp 11 randomize jobs mode (-j1):
deptgt-delete_on_error.mk 29 @-${.MAKE} -f ${MAKEFILE} -k -j1 ${TARGETS}
sh-errctl.mk 12 .MAKEFLAGS: -j1 -dj
shell-ksh.mk 16 .MAKEFLAGS: -j1
varname-dot-make-jobs.mk 13 @${MAKE} -r -f ${MAKEFILE} echo -j1
varname-make_print_var_on_error-jobs.mk 21 .MAKEFLAGS: -j1
opt-query.mk 30 @${MAKE} -r -f ${MAKEFILE} -q ${mode:Mjobs:%=-j1} ${target} PART=commands \
39 @${MAKE} -r -f ${MAKEFILE} -q ${mode:Mjobs:%=-j1} ${target} PART=variants \
opt-debug-errors-jobs.mk 6 .MAKEFLAGS: -de -j1
shell-csh.mk 19 .MAKEFLAGS: -j1
cmd-errors-jobs.mk 8 && ${MAKE} -f ${MAKEFILE} -j1 "$$*" \
opt-jobs-no-action.mk 16 .MAKEFLAGS: -j1 -n
  /src/lib/libm/src/
w_j1.c 19 * wrapper of j1,y1
26 j1(double x) /* wrapper j1 */ function
35 return __kernel_standard(x,x,36); /* j1(|x|>X_TLOSS) */
  /src/usr.sbin/lpr/common_source/
common.c 326 int j1, j2; local
333 j1 = atoi((*q1)->q_name+3);
336 if (j1 == j2)
338 if ((j1 < j2 && j2-j1 < 500) || (j1 > j2 && j1-j2 > 500))
340 if ((j1 < j2 && j2-j1 > 500) || (j1 > j2 && j1-j2 < 500)
    [all...]
  /src/sys/arch/hpc/stand/hpcboot/
hpcboot.cpp 300 uint32_t j, j1; local
306 j1 = 1 << n;
308 for (j = j1, i = n; j > 0; j >>=1, i--) {
322 for (j = j1, i = n; j > 0; j >>=1, i--) {
  /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_core/salsa/ref/
core_salsa_ref.c 17 uint32_t j0, j1, j2, j3, j4, j5, j6, j7, j8, j9, j10, j11, j12, j13, j14, local
31 j1 = x1 = LOAD32_LE(k + 0);
80 STORE32_LE(out + 4, x1 + j1);
  /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_stream/chacha20/ref/
chacha20_ref.c 86 uint32_t j0, j1, j2, j3, j4, j5, j6, j7, j8, j9, j10, j11, j12, j13, j14, local
99 j1 = ctx->input[1];
126 x1 = j1;
152 x1 = PLUS(x1, j1);
  /src/lib/libm/noieee_src/
n_jn.c 77 * for n=1, j1(x) is called,
79 * from values of j0(x) and j1(x).
131 if (n==1) return(j1(x));
165 b = j1(x);
n_j1.c 33 static char sccsid[] = "@(#)j1.c 8.2 (Berkeley) 11/30/93";
67 /* double j1(double x), y1(double x)
69 * Method -- j1(x):
70 * 1. For tiny x, we use j1(x) = x/2 - x^3/16 + x^5/384 - ...
71 * 2. Reduce x to |x| since j1(x)=-j1(-x), and
73 * j1(x) = x/2 + x*z*R0/S0, where z = x*x;
74 * (precision: |j1/x - 1/2 - R0/S0 |<2**-61.51 )
76 * j1(x) = sqrt(2/(pi*x))*(p1(x)*cos(x1)-q1(x)*sin(x1))
89 * j1(nan)= na
147 j1(double x) function
    [all...]
  /src/tests/lib/lua/libm/
h_lualibm.c 64 TEST(j1(M_PI));
lualibm.lua 70 test("j1(M_PI)", lm.j1(lm.M_PI))
  /src/usr.bin/diff/
diffreg.c 866 int i, j, m, i0, i1, j0, j1, nc; local
888 j1 = J[i1 + 1] - 1;
889 J[i1] = j1;
900 for (i = i0, j = j0; i <= i1 && j <= j1; i++, j++)
908 while (j <= j1) {
913 change(file1, f1, file2, f2, i0, i1, j0, j1, &flags);
923 j1 = J[i1 - 1] + 1;
924 J[i1] = j1;
925 change(file1, f1, file2, f2, i1, i0, j1, j0, &flags);
  /src/lib/lua/libm/
libm.c 137 DFUNC_DBL(j1)
275 { "j1", libm_j1 },

Completed in 37 milliseconds

1 2