HomeSort by: relevance | last modified time | path
    Searched refs:sgn (Results 1 - 24 of 24) sorted by relevancy

  /src/sys/lib/libkern/arch/m68k/
divsi3.S 64 bpl 3f | branch if sgn(divisor) == sgn(dividend)
  /src/games/hack/
hack.wizard.c 174 buzz(-1, mtmp->mx, mtmp->my, sgn(tx), sgn(ty));
249 buzz(-rnd(3), mtmp->mx, mtmp->my, sgn(tx), sgn(ty));
extern.h 58 int sgn(int);
hack.c 711 sdx = sgn(dx);
714 sdy = sgn(dy);
761 sgn(int a) function in typeref:typename:int
  /src/lib/libm/src/
e_jnf.c 36 int32_t i,hx,ix, sgn; local in function:__ieee754_jnf
54 sgn = (n&1)&(hx>>31); /* even n -- 0, odd n -- sign(x) */
168 if(sgn==1) return -b; else return b;
b_tgamma.c 278 int sgn = 1; local in function:neg_gam
290 sgn = -1;
298 return ((double)sgn*tiny*tiny);
307 if (sgn < 0) y = -y;
315 if (sgn < 0) y = -y;
e_jn.c 58 int32_t i,hx,ix,lx, sgn; local in function:__ieee754_jn
77 sgn = (n&1)&(hx>>31); /* even n -- 0, odd n -- sign(x) */
214 if(sgn==1) return -b; else return b;
  /src/usr.sbin/bta2dpd/cosdata-gen/
cosdata.c 93 cosprint(int lim, int sgn)
98 int dk = sgn * lim * 2;
103 sgn == -1 ? "" : "dec", mi, mi, mk);
  /src/sys/arch/sparc/sparc/
emul.c 151 unsigned sgn:1; /* sign bit */ member in struct:muldiv::__anonaea60d7c010a::__anonaea60d7c0208
160 "us"[op.bits.sgn], op.bits.div ? "div" : "mul",
195 if (op.bits.sgn && *rd < 0)
232 unsigned sgn:1; /* 1 bit sign */ member in struct:fixalign::__anonaea60d7c030a::__anonaea60d7c0408
295 op.bits.st ? "st" : "ld", "us"[op.bits.sgn],
346 if (op.bits.sgn && (data.s[1] & 0x8000) != 0)
  /src/sys/arch/sparc64/sparc64/
emul.c 150 unsigned sgn:1; /* sign bit */ member in struct:muldiv::__anon42a2d1d0010a::__anon42a2d1d00208
159 "us"[op.bits.sgn], op.bits.div ? "div" : "mul",
194 if (op.bits.sgn && *rd < 0)
229 unsigned sgn:1; /* 1 bit sign */ member in struct:fixalign::__anon42a2d1d0030a::__anon42a2d1d00408
286 op.bits.st ? "st" : "ld", "us"[op.bits.sgn],
337 if (op.bits.sgn && (data.s[1] & 0x8000) != 0)
  /src/lib/libm/noieee_src/
n_gamma.c 292 int sgn = 1; local in function:neg_gam
306 sgn = -1;
314 return ((double)sgn*tiny*tiny);
323 if (sgn < 0) y = -y;
331 if (sgn < 0) y = -y;
n_jn.c 115 int i, sgn; local in function:jn
132 sgn = (n&1)&(x < zero); /* even n -- 0, odd n -- sign(x) */
261 return ((sgn == 1) ? -b : b);
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_libc.cc 233 int sgn = 1; local in function:__sanitizer::internal_simple_strtoll
238 sgn = 1;
241 sgn = -1;
254 if (sgn > 0) {
  /src/lib/libm/ld80/
b_tgammal.c 332 int sgn = 1; local in function:neg_gam
345 sgn = -1;
356 return (sgn * tiny * tiny);
359 return (sgn < 0 ? -y : y);
369 if (sgn < 0) y = -y;
  /src/sys/arch/ia64/include/
dig64.h 132 uint8_t sgn; /* PCI Segment Group Number */ member in struct:dig64_pci_spec
  /src/usr.bin/make/
suff.c 1142 GNode *sgn; /* Source GNode */ local in function:FindCmds
1153 sgn = gln->datum;
1155 if (sgn->type & OP_OPTIONAL && Lst_IsEmpty(&tgn->commands)) {
1166 base = str_basename(sgn->name);
1190 ret = Candidate_New(bmake_strdup(sgn->name), targ->prefix, suff, targ,
1191 sgn);
1199 DEBUG1(SUFF, "\tusing existing source %s\n", sgn->name);
1450 ApplyTransform(GNode *tgn, GNode *sgn, Suffix *tsuff, Suffix *ssuff)
1457 Lst_Append(&tgn->children, sgn);
1458 Lst_Append(&sgn->parents, tgn)
    [all...]
  /src/games/warp/
warp.h 150 #define sgn(x) ((x) < 0 ? -1 : (x) > 0) macro
move.c 43 y = (obj->posy - sgn(obj->vely) + YSIZE00) % YSIZE;
44 x = (obj->posx - sgn(obj->velx) + XSIZE00) % XSIZE;
  /src/sys/external/bsd/compiler_rt/dist/lib/msan/tests/
msan_test.cc 1967 int sgn; local in function:TEST
1968 double res = lgamma_r(1.1, &sgn);
1970 EXPECT_NOT_POISONED(sgn);
1974 int sgn; local in function:TEST
1975 float res = lgammaf_r(1.1, &sgn);
1977 EXPECT_NOT_POISONED(sgn);
1982 int sgn; local in function:TEST
1983 long double res = lgammal_r(1.1, &sgn);
1985 EXPECT_NOT_POISONED(sgn);
  /src/sys/arch/ia64/stand/ia64/efi/
main.c 602 printf(" Seg GrpNum= %u\n", pci->sgn);
  /src/sys/arch/m68k/060sp/dist/
ilsp.s 211 neg.l %d5 # sgn(rem) = sgn(dividend)
651 ori.b &0x1,%d5 # save multiplier sgn
fpsp.s 5046 # 5. (k is odd) Set j := (k-1)/2, sgn := (-1)**j. #
5047 # Return sgn*cos(r) where cos(r) is approximated by an #
5052 # 6. (k is even) Set j := k/2, sgn := (-1)**j. Return sgn*sin(r) #
5189 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J.
5190 #--THEN WE RETURN SGN*SIN(R). SGN*SIN(R) IS COMPUTED BY
5192 #--R' = SGN*R, S=R*R. THIS CAN BE REWRITTEN AS
5212 eor.l %d1,X(%a6) # X IS NOW R'= SGN*R
5242 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J
    [all...]
pfpsp.s 5465 or.w %d1,%d0 # concat {sgn,new exp}
5501 or.w %d1,%d0 # concat {sgn,new exp}
5541 mov.w FP_SCR0_EX(%a6),%d1 # extract operand's {sgn,exp}
5546 andi.w &0x8000,%d0 # extract operand's sgn
5598 mov.w FP_SCR0_EX(%a6),%d1 # extract operand's {sgn,exp}
5601 andi.w &0x8000,FP_SCR0_EX(%a6) # extract operand's sgn
5668 mov.w FP_SCR1_EX(%a6),%d1 # extract operand's {sgn,exp}
5673 andi.w &0x8000,%d0 # extract operand's sgn
6531 and.w &0x7fff, %d1 # strip off sgn
6542 or.w %d0, %d1 # {sgn,new exp
    [all...]
fplsp.s 4940 # 5. (k is odd) Set j := (k-1)/2, sgn := (-1)**j. #
4941 # Return sgn*cos(r) where cos(r) is approximated by an #
4946 # 6. (k is even) Set j := k/2, sgn := (-1)**j. Return sgn*sin(r) #
5083 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J.
5084 #--THEN WE RETURN SGN*SIN(R). SGN*SIN(R) IS COMPUTED BY
5086 #--R' = SGN*R, S=R*R. THIS CAN BE REWRITTEN AS
5106 eor.l %d1,X(%a6) # X IS NOW R'= SGN*R
5136 #--LET J BE THE LEAST SIG. BIT OF D0, LET SGN := (-1)**J
    [all...]

Completed in 123 milliseconds