HomeSort by relevance Sort by last modified time
    Searched defs:neg (Results 1 - 25 of 105) sorted by null

1 2 3 4 5

  /external/dropbear/libtommath/
bn_mp_mul.c 21 int res, neg; local
22 neg = (a->sign == b->sign) ? MP_ZPOS : MP_NEG;
59 c->sign = (c->used > 0) ? neg : MP_ZPOS;
bn_mp_fread.c 21 int err, ch, neg, y; local
29 neg = MP_NEG;
32 neg = MP_ZPOS;
57 a->sign = neg;
bn_mp_read_radix.c 21 int y, res, neg; local
37 neg = MP_NEG;
39 neg = MP_ZPOS;
77 a->sign = neg;
bn_mp_n_root.c 31 int res, neg; local
51 neg = a->sign;
113 a->sign = neg;
119 c->sign = neg;
bn_fast_mp_invmod.c 27 int res, neg; local
131 neg = a->sign;
138 c->sign = neg;
bn_mp_div.c 106 int res, n, t, i, norm, neg; local
148 neg = (a->sign == b->sign) ? MP_ZPOS : MP_NEG;
268 c->sign = neg;
  /external/openssl/crypto/asn1/
t_pkey.c 69 const char *neg; local
72 neg = (BN_is_negative(num))?"-":"";
84 if (BIO_printf(bp,"%s %s%lu (%s0x%lx)\n",number,neg,
85 (unsigned long)num->d[0],neg,(unsigned long)num->d[0])
92 (neg[0] == '-')?" (Negative)":"") <= 0)
a_enum.c 111 int neg=0,i; local
117 neg=1;
134 if (neg) r= -r;
x_long.c 145 int neg, i; local
154 if(len && (cont[0] & 0x80)) neg = 1;
155 else neg = 0;
159 if(neg) utmp |= cont[i] ^ 0xff;
163 if(neg) {
t_req.c 95 const char *neg; local
120 neg=(ri->version->type == V_ASN1_NEG_INTEGER)?"-":"";
124 if(BIO_printf(bp,"%8sVersion: %s%lu (%s0x%lx)\n","",neg,l,neg,
  /bionic/libc/stdlib/
strtoimax.c 48 int neg, any, cutlim; local
60 neg = 1;
63 neg = 0;
86 * either 7 (neg==0) or 8 (neg==1), meaning that if we have
98 if (neg) { \
109 if (neg) {
122 cutoff = neg ? INTMAX_MIN : INTMAX_MAX;
128 if (neg) {
146 if (neg) {
    [all...]
strtol.c 49 int neg, any, cutlim; local
61 neg = 1;
64 neg = 0;
87 * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
94 cutoff = neg ? LONG_MIN : LONG_MAX;
97 if (neg) {
115 if (neg) {
strtoul.c 48 int neg, any, cutlim; local
58 neg = 1;
61 neg = 0;
97 if (neg && any > 0)
strtoumax.c 48 int neg, any, cutlim; local
58 neg = 1;
61 neg = 0;
110 if (neg && any > 0)
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
FpNafMultiplier.java 21 ECPoint neg = p.negate(); local
33 R = R.add(hBit ? p : neg);
  /external/openssh/openbsd-compat/
strtoll.c 55 int neg, any, cutlim; local
67 neg = 1;
70 neg = 0;
93 * either 7 (neg==0) or 8 (neg==1), meaning that if we have
101 cutoff = neg ? LLONG_MIN : LLONG_MAX;
104 if (neg) {
122 if (neg) {
strtoul.c 53 int neg, any, cutlim; local
63 neg = 1;
66 neg = 0;
102 if (neg && any > 0)
  /external/openssl/crypto/bn/
bn_mpi.c 86 if (a->neg)
94 int neg=0; local
113 a->neg=0;
119 neg=1;
122 a->neg=neg;
123 if (neg)
bn_add.c 67 int a_neg = a->neg, ret;
77 if (a_neg ^ b->neg)
88 r->neg=1;
93 r->neg=0;
99 r->neg = a_neg;
160 r->neg = 0;
258 r->neg=0;
266 int add=0,neg=0; local
277 if (a->neg)
279 if (b->neg)
    [all...]
bn_div.c 120 rem->neg=BN_is_zero(rem)?0:m->neg;
121 dv->neg=m->neg^d->neg;
177 * dv->neg == num->neg ^ divisor->neg (unless the result is zero)
178 * rm->neg == num->neg (unless the remainder is zero
434 int neg = num->neg; local
    [all...]
  /external/e2fsprogs/lib/e2p/
mntopts.c 104 int neg; local
114 neg = 0;
124 neg++;
139 if (neg)
feature.c 263 int neg; local
281 neg = 0;
301 neg++;
310 if (neg) {
  /external/quake/quake/src/WinQuake/
cl_demo.cpp 272 qboolean neg = false; local
313 neg = true;
317 if (neg)
  /libcore/luni/src/test/java/tests/api/javax/net/ssl/
SSLEngineResultTest.java 49 int[] neg = { -1, -10, -1000, Integer.MIN_VALUE, local
63 for (int i = 0; i < neg.length; i++) {
66 SSLEngineResult.HandshakeStatus.FINISHED, neg[i], 1);
71 for (int i = 0; i < neg.length; i++) {
74 SSLEngineResult.HandshakeStatus.FINISHED, 1, neg[i]);
  /external/apache-harmony/x-net/src/test/api/java/org/apache/harmony/xnet/tests/javax/net/ssl/
SSLEngineResultTest.java 49 int[] neg = { -1, -10, -1000, Integer.MIN_VALUE, local
64 for (int i = 0; i < neg.length; i++) {
67 SSLEngineResult.HandshakeStatus.FINISHED, neg[i], 1);
72 for (int i = 0; i < neg.length; i++) {
75 SSLEngineResult.HandshakeStatus.FINISHED, 1, neg[i]);

Completed in 1399 milliseconds

1 2 3 4 5