Home
last modified time | relevance | path

Searched refs:a_i (Results 1 – 5 of 5) sorted by relevance

/freebsd/contrib/ntp/include/
H A Dntp_fp.h129 #define M_NEGM(r_i, r_f, a_i, a_f) /* r = -a */ \ argument
132 (r_i) = ~(a_i) + ((r_f) == 0); \
135 #define M_ADD(r_i, r_f, a_i, a_f) /* r += a */ \ argument
139 (r_i) += (a_i) + ((u_int32)(r_f) < add_t); \
142 #define M_ADD3(r_o, r_i, r_f, a_o, a_i, a_f) /* r += a, three word */ \ argument
151 (r_i) += (a_i); \
156 #define M_SUB(r_i, r_f, a_i, a_f) /* r -= a */ \ argument
160 (r_i) -= (a_i) + ((u_int32)(r_f) > sub_t); \
206 #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)) || \
[all …]
H A Dtimepps-Solaris.h183 #define NTPFP_M_ADD(r_i, r_f, a_i, a_f) /* r += a */ \ argument
194 (r_i) += (a_i); \
/freebsd/contrib/ntp/libparse/
H A Dmfp_mul.c60 int32 a_i, in mfp_mul() argument
75 if (a_i < 0) /* examine sign situation */ in mfp_mul()
78 M_NEG(a_i, a_f); in mfp_mul()
89 a[2] = a_i & LOW_MASK; in mfp_mul()
90 a[3] = (a_i & HIGH_MASK) >> (FRACTION_PREC/2); in mfp_mul()
167 mfptoa((u_long)a_i, a_f, 6), in mfp_mul()
/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]$}",