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

1 2 3 4 5 6 7

  /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)
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) {
a_int.c 69 int neg, ret; local
71 neg = x->type & V_ASN1_NEG;
72 if (neg != (y->type & V_ASN1_NEG))
74 if (neg)
82 if (neg)
116 int pad=0,ret,i,neg; local
120 neg=a->type & V_ASN1_NEG;
127 if (!neg && (i > 127)) {
130 } else if(neg) {
153 else if (!neg) memcpy(p,a->data,(unsigned int)a->length)
378 int neg=0,i; local
    [all...]
  /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_kron.c 132 if (B->neg)
134 B->neg = 0;
135 if (A->neg)
169 if ((A->neg ? ~BN_lsw(A) : BN_lsw(A)) & BN_lsw(B) & 2)
176 tmp->neg = 0;
bn_print.c 81 if (a->neg) *(p++)='-';
176 int neg=0,h,m,i,j,k,c; local
181 if (*a == '-') { neg=1; a++; }
186 num=i+neg;
229 ret->neg=neg;
243 int neg=0,i,j; local
247 if (*a == '-') { neg=1; a++; }
252 num=i+neg;
286 ret->neg=neg
    [all...]
bn_shift.c 73 r->neg=a->neg;
116 r->neg=a->neg;
141 r->neg=a->neg;
187 r->neg=a->neg;
bn_word.c 139 if (a->neg)
141 a->neg=0;
144 a->neg=!(a->neg);
189 if (a->neg)
191 a->neg=0;
193 a->neg=1;
200 a->neg=1;
bn_recp.c 182 d->neg=0;
186 r->neg=0;
202 r->neg=BN_is_zero(r)?0:m->neg;
203 d->neg=m->neg^recp->N.neg;
bn_div.c 120 rem->neg=BN_is_zero(rem)?0:m->neg;
121 dv->neg=m->neg^d->neg;
175 * dv->neg == num->neg ^ divisor->neg (unless the result is zero)
176 * rm->neg == num->neg (unless the remainder is zero
408 int neg = num->neg; local
635 int neg = num->neg; local
    [all...]
  /external/dropbear/libtommath/
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_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_n_root.c 31 int res, neg; local
51 neg = a->sign;
113 a->sign = neg;
119 c->sign = 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)
  /cts/tools/vm-tests/src/dot/junit/opcodes/neg_float/d/
T_neg_float_5.d 16 neg-float v0, v3
  /cts/tools/vm-tests/src/dot/junit/opcodes/neg_int/d/
T_neg_int_6.d 16 neg-int v0, v3
  /external/e2fsprogs/lib/e2p/
mntopts.c 99 int neg; local
109 neg = 0;
119 neg++;
134 if (neg)
  /external/ppp/pppd/
lcp.c 653 #define LENCIVOID(neg) ((neg) ? CILEN_VOID : 0)
654 #define LENCICHAP(neg) ((neg) ? CILEN_CHAP : 0)
655 #define LENCISHORT(neg) ((neg) ? CILEN_SHORT : 0)
656 #define LENCILONG(neg) ((neg) ? CILEN_LONG : 0)
657 #define LENCILQR(neg) ((neg) ? CILEN_LQR: 0
    [all...]
  /bionic/libc/string/
strerror_r.c 61 int neg; local
65 neg = 1;
69 neg = 0;
73 if (neg)
86 if (neg)
  /libcore/luni/src/main/java/java/math/
NativeBN.java 45 public static native boolean putULongInt(int a, long dw, boolean neg);
53 public static native boolean BN_bin2bn(byte[] s, int len, boolean neg, int ret);
57 // Additional parameter: neg.
59 public static native boolean litEndInts2bn(int[] ints, int len, boolean neg, int ret);
81 // #define BN_is_negative(a) ((a)->neg != 0)

Completed in 280 milliseconds

1 2 3 4 5 6 7