Home
last modified time | relevance | path

Searched refs:b_i (Results 1 – 4 of 4) sorted by relevance

/freebsd/contrib/ntp/libparse/
H A Dmfp_mul.c62 int32 b_i, in mfp_mul() argument
81 if (b_i < 0) /* examine sign situation */ in mfp_mul()
84 M_NEG(b_i, b_f); in mfp_mul()
94 b[2] = b_i & LOW_MASK; in mfp_mul()
95 b[3] = (b_i & HIGH_MASK) >> (FRACTION_PREC/2); in mfp_mul()
168 mfptoa((u_long)b_i, b_f, 6), in mfp_mul()
/freebsd/contrib/ntp/include/
H A Dntp_fp.h206 #define M_ISGT(a_i, a_f, b_i, b_f) /* a > b signed */ \ argument
207 (((u_int32)((a_i) ^ 0x80000000) > (u_int32)((b_i) ^ 0x80000000)) || \
208 ((a_i) == (b_i) && ((u_int32)(a_f)) > ((u_int32)(b_f))))
210 #define M_ISGTU(a_i, a_f, b_i, b_f) /* a > b unsigned */ \ argument
211 (((u_int32)(a_i)) > ((u_int32)(b_i)) || \
212 ((a_i) == (b_i) && ((u_int32)(a_f)) > ((u_int32)(b_f))))
214 #define M_ISHIS(a_i, a_f, b_i, b_f) /* a >= b unsigned */ \ argument
215 (((u_int32)(a_i)) > ((u_int32)(b_i)) || \
216 ((a_i) == (b_i) && ((u_int32)(a_f)) >= ((u_int32)(b_f))))
218 #define M_ISGEQ(a_i, a_f, b_i, b_f) /* a >= b signed */ \ argument
[all …]
/freebsd/contrib/one-true-awk/testdir/
H A Dfunstack.ok3066 measure of $\bigcup[a_i,b_i]$ . . . . . 540--544
H A Dfunstack.in23374 title = "On the complexity of computing the measure of {$\bigcup[a_i,b_i]$}",