Searched refs:sgn (Results 1 - 13 of 13) sorted by relevance

/linux-master/arch/m68k/fpsp040/
H A Dsatanh.S27 | sgn := sign(X)
30 | atanh(X) := sgn * (1/2) * logp1(z)
37 | sgn := sign(X)
38 | atan(X) := sgn / (+0).
H A Dstanh.S26 | sgn := sign(X), y := 2|X|, z := expm1(Y), and
27 | tanh(X) = sgn*( z/(2+z) ).
36 | sgn := sign(X), y := 2|X|, z := exp(Y),
37 | tanh(X) = sgn - [ sgn*2/(1+z) ].
42 | sgn := sign(X), Tiny := 2**(-126),
43 | tanh(X) := sgn - sgn*Tiny.
H A Dssinh.S26 | y = |X|, sgn = sign(X), and z = expm1(Y),
27 | sinh(X) = sgn*(1/2)*( z + z/(1+z) ).
37 | sgn := sign(X)
38 | sgnFact := sgn * 2**(16380)
H A Dsasin.S32 | 4. (|X| = 1) sgn := sign(X), return asin(X) := sgn * Pi/2. Exit.
H A Dssin.S40 | 5. (k is odd) Set j := (k-1)/2, sgn := (-1)**j. Return sgn*cos(r)
45 | 6. (k is even) Set j := k/2, sgn := (-1)**j. Return sgn*sin(r)
H A Dsatan.S25 | Step 2. Let X = sgn * 2**k * 1.xxxxxxxx...x. Note that k = -4, -3,..., or 3.
26 | Define F = sgn * 2**k * 1.xxxx1, i.e. the first 5 significant bits
/linux-master/drivers/media/tuners/
H A Dtda18271-fe.c434 int sgn, bcal, count, wait, ret; local
471 sgn = 1;
478 freq = *freq_in + (sgn * count) + 1000000;
502 if (sgn <= 0)
505 sgn = -1 * sgn;
/linux-master/drivers/accel/qaic/
H A Dqaic_data.c176 struct scatterlist *sg, *sgn, *sgf, *sgl; local
223 sgn = sgf;
225 memcpy(sg, sgn, sizeof(*sg));
226 if (sgn == sgf) {
229 sg_set_page(sg, sg_page(sgn), sg_dma_len(sg), offf);
233 if (sgn == sgl) {
235 sg_set_page(sg, sg_page(sgn), offl - offf, offf);
239 sgn = sg_next(sgn);
/linux-master/drivers/media/dvb-frontends/
H A Dlg2160.c560 static int lg216x_get_sgn(struct lg216x_state *state, u8 *sgn) argument
565 *sgn = 0xff; /* invalid value */
571 *sgn = val & 0x0f;
/linux-master/arch/m68k/ifpsp060/src/
H A Dilsp.S201 neg.l %d5 # sgn(rem) = sgn(dividend)
641 ori.b &0x1,%d5 # save multiplier sgn
H A Dfplsp.S4931 # 5. (k is odd) Set j := (k-1)/2, sgn := (-1)**j. #
4932 # Return sgn*cos(r) where cos(r) is approximated by an #
4937 # 6. (k is even) Set j := k/2, sgn := (-1)**j. Return sgn*sin(r) #
6056 # Step 2. Let X = sgn * 2**k * 1.xxxxxxxx...x. #
6058 # Define F = sgn * 2**k * 1.xxxx1, i.e. the first 5 #
6515 # 4. (|X| = 1) sgn := sign(X), return asin(X) := sgn * Pi/2. Exit.#
7701 # y = |X|, sgn = sign(X), and z = expm1(Y), #
7702 # sinh(X) = sgn*(
[all...]
H A Dfpsp.S5037 # 5. (k is odd) Set j := (k-1)/2, sgn := (-1)**j. #
5038 # Return sgn*cos(r) where cos(r) is approximated by an #
5043 # 6. (k is even) Set j := k/2, sgn := (-1)**j. Return sgn*sin(r) #
6162 # Step 2. Let X = sgn * 2**k * 1.xxxxxxxx...x. #
6164 # Define F = sgn * 2**k * 1.xxxx1, i.e. the first 5 #
6621 # 4. (|X| = 1) sgn := sign(X), return asin(X) := sgn * Pi/2. Exit.#
7807 # y = |X|, sgn = sign(X), and z = expm1(Y), #
7808 # sinh(X) = sgn*(
[all...]
/linux-master/lib/
H A Dtest_bpf.c826 static const int sgn[][2] = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}}; local
834 count = (dbits - 1) * (sbits - 1) * block1 * block1 * ARRAY_SIZE(sgn);
835 count += (max(dbits, sbits) - 1) * block2 * block2 * ARRAY_SIZE(sgn);
852 for (k = 0; k < ARRAY_SIZE(sgn); k++) /* Sign combos */
859 dst = value(di, db, sgn[k][0]);
860 src = value(si, sb, sgn[k][1]);
871 for (k = 0; k < ARRAY_SIZE(sgn); k++) /* Sign combos */
877 dst = value(bt % dbits, db, sgn[k][0]);
878 src = value(bt % sbits, sb, sgn[k][1]);

Completed in 229 milliseconds