Searched refs:INF (Results 1 - 7 of 7) sorted by relevance

/freebsd-10-stable/contrib/tcsh/
H A Dsh.init.c44 #define INF INT_MAX macro
47 { ":", dozip, 0, INF },
48 { "@", dolet, 0, INF },
49 { "alias", doalias, 0, INF },
52 { "att", doatt, 0, INF },
54 { "bg", dobg, 0, INF },
59 { "bs2cmd", dobs2cmd, 1, INF },
66 { "cd", dochngd, 0, INF },
67 { "chdir", dochngd, 0, INF },
68 { "complete", docomplete, 0, INF },
[all...]
H A Dtc.printf.c44 #define INF INT_MAX /* should be bigger than any field to print */ macro
70 int flush_left = 0, f_width = 0, prec = INF, hash = 0;
348 flush_left = 0, f_width = 0, prec = INF, hash = 0;
/freebsd-10-stable/contrib/gcc/config/arm/
H A Dieee754-sf.S72 1: @ Look for zeroes, equal values, INF, or NAN.
242 @ Overflow: return INF.
248 @ At least one of r0/r1 is INF/NAN.
249 @ if r0 != INF/NAN: return r1 (which is INF/NAN)
250 @ if r1 != INF/NAN: return r0 (which is INF/NAN)
253 @ otherwise return r0 (which is INF or -INF)
408 @ Mask out exponents, trap any zero/denormal/INF/NA
[all...]
H A Dieee754-df.S93 @ Look for zeroes, equal values, INF, or NAN.
353 @ Overflow: return INF.
360 @ At least one of x or y is INF/NAN.
361 @ if xh-xl != INF/NAN: return yh-yl (which is INF/NAN)
362 @ if yh-yl != INF/NAN: return xh-xl (which is INF/NAN)
365 @ otherwise return xh-xl (which is INF or -INF)
431 teqne r3, #0xff000000 @ if not 0, check if INF o
[all...]
/freebsd-10-stable/contrib/llvm/lib/Support/
H A Dregcomp.c982 # define INF 3 macro
984 # define MAP(n) (((n) <= 1) ? (n) : ((n) == INFINITY) ? INF : N)
998 case REP(0, INF): /* as x{1,}? */
1023 case REP(1, INF): /* as x+ */
1031 case REP(N, INF): /* as xx{n-1,INF} */
/freebsd-10-stable/contrib/nvi/regex/
H A Dregcomp.c1042 # define INF 3 macro
1044 # define MAP(n) (((n) <= 1) ? (n) : ((n) == INFINITY) ? INF : N)
1062 case REP(0, INF): /* as x{1,}? */
1087 case REP(1, INF): /* as x+ */
1095 case REP(N, INF): /* as xx{n-1,INF} */
/freebsd-10-stable/lib/libc/regex/
H A Dregcomp.c1044 # define INF 3 macro
1046 # define MAP(n) (((n) <= 1) ? (n) : ((n) == INFINITY) ? INF : N)
1060 case REP(0, INF): /* as x{1,}? */
1085 case REP(1, INF): /* as x+ */
1093 case REP(N, INF): /* as xx{n-1,INF} */

Completed in 92 milliseconds