/external/regex-re2/util/ |
D | strutil.cc | 20 int used = 0; in CEscapeString() local 23 if (dest_len - used < 2) // Need space for two letter escape in CEscapeString() 28 case '\n': dest[used++] = '\\'; dest[used++] = 'n'; break; in CEscapeString() 29 case '\r': dest[used++] = '\\'; dest[used++] = 'r'; break; in CEscapeString() 30 case '\t': dest[used++] = '\\'; dest[used++] = 't'; break; in CEscapeString() 31 case '\"': dest[used++] = '\\'; dest[used++] = '\"'; break; in CEscapeString() 32 case '\'': dest[used++] = '\\'; dest[used++] = '\''; break; in CEscapeString() 33 case '\\': dest[used++] = '\\'; dest[used++] = '\\'; break; in CEscapeString() 39 if (dest_len - used < 4) // need space for 4 letter escape in CEscapeString() 41 sprintf(dest + used, "\\%03o", c); in CEscapeString() [all …]
|
/external/libpng/contrib/pngsuite/ |
D | README | 42 Filter 0 was used 32 times 44 Filter 0 was used 32 times 46 Filter 0 was used 32 times 48 Filter 1 was used 9 times 49 Filter 4 was used 23 times 51 Filter 1 was used 1 times 52 Filter 2 was used 31 times 54 Filter 1 was used 5 times 55 Filter 4 was used 27 times 57 Filter 1 was used 1 times [all …]
|
/external/wpa_supplicant_8/src/tls/ |
D | libtommath.c | 124 int used, alloc, sign; member 130 #define mp_iszero(a) (((a)->used == 0) ? MP_YES : MP_NO) 131 #define mp_iseven(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 0)) ? MP_YES : MP_NO) 132 #define mp_isodd(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 1)) ? MP_YES : MP_NO) 136 #define s_mp_mul(a, b, c) s_mp_mul_digs(a, b, c, (a)->used + (b)->used + 1) 223 if (a->used > b->used) { in s_mp_add() 224 min = b->used; in s_mp_add() 225 max = a->used; in s_mp_add() 228 min = a->used; in s_mp_add() 229 max = b->used; in s_mp_add() [all …]
|
/external/wpa_supplicant_6/wpa_supplicant/src/tls/ |
D | libtommath.c | 116 int used, alloc, sign; member 122 #define mp_iszero(a) (((a)->used == 0) ? MP_YES : MP_NO) 123 #define mp_iseven(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 0)) ? MP_YES : MP_NO) 124 #define mp_isodd(a) (((a)->used > 0 && (((a)->dp[0] & 1) == 1)) ? MP_YES : MP_NO) 128 #define s_mp_mul(a, b, c) s_mp_mul_digs(a, b, c, (a)->used + (b)->used + 1) 215 if (a->used > b->used) { in s_mp_add() 216 min = b->used; in s_mp_add() 217 max = a->used; in s_mp_add() 220 min = a->used; in s_mp_add() 221 max = b->used; in s_mp_add() [all …]
|
/external/sepolicy/ |
D | attributes | 5 # All types used for devices. 8 # All types used for processes. 11 # All types used for filesystems. 14 # All types used for files that can exist on a labeled fs. 18 # All types used for domain entry points. 21 # All types used for /data files. 27 # All types used for nodes/hosts. 30 # All types used for network interfaces. 33 # All types used for network ports. 36 # All types used for property service [all …]
|
/external/dropbear/libtommath/ |
D | bn_mp_div_2.c | 24 if (b->alloc < a->used) { in mp_div_2() 25 if ((res = mp_grow (b, a->used)) != MP_OKAY) { in mp_div_2() 30 oldused = b->used; in mp_div_2() 31 b->used = a->used; in mp_div_2() 36 tmpa = a->dp + b->used - 1; in mp_div_2() 39 tmpb = b->dp + b->used - 1; in mp_div_2() 43 for (x = b->used - 1; x >= 0; x--) { in mp_div_2() 55 tmpb = b->dp + b->used; in mp_div_2() 56 for (x = b->used; x < oldused; x++) { in mp_div_2()
|
D | bn_s_mp_mul_high_digs.c | 32 if (((a->used + b->used + 1) < MP_WARRAY) in s_mp_mul_high_digs() 33 && MIN (a->used, b->used) < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) { in s_mp_mul_high_digs() 38 if ((res = mp_init_size (&t, a->used + b->used + 1)) != MP_OKAY) { in s_mp_mul_high_digs() 41 t.used = a->used + b->used + 1; in s_mp_mul_high_digs() 43 pa = a->used; in s_mp_mul_high_digs() 44 pb = b->used; in s_mp_mul_high_digs()
|
D | bn_fast_mp_montgomery_reduce.c | 32 olduse = x->used; in fast_mp_montgomery_reduce() 35 if (x->alloc < n->used + 1) { in fast_mp_montgomery_reduce() 36 if ((res = mp_grow (x, n->used + 1)) != MP_OKAY) { in fast_mp_montgomery_reduce() 55 for (ix = 0; ix < x->used; ix++) { in fast_mp_montgomery_reduce() 60 for (; ix < n->used * 2 + 1; ix++) { in fast_mp_montgomery_reduce() 68 for (ix = 0; ix < n->used; ix++) { in fast_mp_montgomery_reduce() 104 for (iy = 0; iy < n->used; iy++) { in fast_mp_montgomery_reduce() 129 for (; ix <= n->used * 2 + 1; ix++) { in fast_mp_montgomery_reduce() 144 _W = W + n->used; in fast_mp_montgomery_reduce() 146 for (ix = 0; ix < n->used + 1; ix++) { in fast_mp_montgomery_reduce() [all …]
|
D | bn_mp_sub_d.c | 26 if (c->alloc < a->used + 1) { in mp_sub_d() 27 if ((res = mp_grow(c, a->used + 1)) != MP_OKAY) { in mp_sub_d() 47 oldused = c->used; in mp_sub_d() 52 if ((a->used == 1 && a->dp[0] <= b) || a->used == 0) { in mp_sub_d() 53 if (a->used == 1) { in mp_sub_d() 62 c->used = 1; in mp_sub_d() 66 c->used = a->used; in mp_sub_d() 74 for (ix = 1; ix < a->used; ix++) { in mp_sub_d()
|
D | bn_mp_mul.c | 26 if (MIN (a->used, b->used) >= TOOM_MUL_CUTOFF) { in mp_mul() 32 if (MIN (a->used, b->used) >= KARATSUBA_MUL_CUTOFF) { in mp_mul() 43 int digs = a->used + b->used + 1; in mp_mul() 47 MIN(a->used, b->used) <= in mp_mul() 59 c->sign = (c->used > 0) ? neg : MP_ZPOS; in mp_mul()
|
D | bn_mp_mul_2.c | 24 if (b->alloc < a->used + 1) { in mp_mul_2() 25 if ((res = mp_grow (b, a->used + 1)) != MP_OKAY) { in mp_mul_2() 30 oldused = b->used; in mp_mul_2() 31 b->used = a->used; in mp_mul_2() 44 for (x = 0; x < a->used; x++) { in mp_mul_2() 64 ++(b->used); in mp_mul_2() 70 tmpb = b->dp + b->used; in mp_mul_2() 71 for (x = b->used; x < oldused; x++) { in mp_mul_2()
|
D | bn_mp_add_d.c | 26 if (c->alloc < a->used + 1) { in mp_add_d() 27 if ((res = mp_grow(c, a->used + 1)) != MP_OKAY) { in mp_add_d() 33 if (a->sign == MP_NEG && (a->used > 1 || a->dp[0] >= b)) { in mp_add_d() 50 oldused = c->used; in mp_add_d() 71 for (ix = 1; ix < a->used; ix++) { in mp_add_d() 81 c->used = a->used + 1; in mp_add_d() 84 c->used = 1; in mp_add_d() 87 if (a->used == 1) { in mp_add_d()
|
D | bn_s_mp_add.c | 28 if (a->used > b->used) { in s_mp_add() 29 min = b->used; in s_mp_add() 30 max = a->used; in s_mp_add() 33 min = a->used; in s_mp_add() 34 max = b->used; in s_mp_add() 46 olduse = c->used; in s_mp_add() 47 c->used = max + 1; in s_mp_add() 97 for (i = c->used; i < olduse; i++) { in s_mp_add()
|
D | bn_mp_karatsuba_mul.c | 56 B = MIN (a->used, b->used); in mp_karatsuba_mul() 64 if (mp_init_size (&x1, a->used - B) != MP_OKAY) in mp_karatsuba_mul() 68 if (mp_init_size (&y1, b->used - B) != MP_OKAY) in mp_karatsuba_mul() 80 x0.used = y0.used = B; in mp_karatsuba_mul() 81 x1.used = a->used - B; in mp_karatsuba_mul() 82 y1.used = b->used - B; in mp_karatsuba_mul() 102 for (x = B; x < a->used; x++) { in mp_karatsuba_mul() 107 for (x = B; x < b->used; x++) { in mp_karatsuba_mul()
|
D | bn_mp_cmp_mag.c | 25 if (a->used > b->used) { in mp_cmp_mag() 29 if (a->used < b->used) { in mp_cmp_mag() 34 tmpa = a->dp + (a->used - 1); in mp_cmp_mag() 37 tmpb = b->dp + (a->used - 1); in mp_cmp_mag() 40 for (n = 0; n < a->used; ++n, --tmpa, --tmpb) { in mp_cmp_mag()
|
D | bn_fast_s_mp_mul_high_digs.c | 34 pa = a->used + b->used; in fast_s_mp_mul_high_digs() 42 pa = a->used + b->used; in fast_s_mp_mul_high_digs() 49 ty = MIN(b->used-1, ix); in fast_s_mp_mul_high_digs() 59 iy = MIN(a->used-tx, ty+1); in fast_s_mp_mul_high_digs() 74 olduse = c->used; in fast_s_mp_mul_high_digs() 75 c->used = pa; in fast_s_mp_mul_high_digs()
|
D | bn_mp_karatsuba_sqr.c | 33 B = a->used; in mp_karatsuba_sqr() 41 if (mp_init_size (&x1, a->used - B) != MP_OKAY) in mp_karatsuba_sqr() 45 if (mp_init_size (&t1, a->used * 2) != MP_OKAY) in mp_karatsuba_sqr() 47 if (mp_init_size (&t2, a->used * 2) != MP_OKAY) in mp_karatsuba_sqr() 51 if (mp_init_size (&x1x1, (a->used - B) * 2) != MP_OKAY) in mp_karatsuba_sqr() 67 for (x = B; x < a->used; x++) { in mp_karatsuba_sqr() 72 x0.used = B; in mp_karatsuba_sqr() 73 x1.used = a->used - B; in mp_karatsuba_sqr()
|
/external/dropbear/ |
D | circbuffer.c | 41 cbuf->used = 0; in cbuf_new() 57 return cbuf->used; in cbuf_getused() 63 return cbuf->size - cbuf->used; in cbuf_getavail() 69 dropbear_assert(((2*cbuf->size)+cbuf->writepos-cbuf->readpos)%cbuf->size == cbuf->used%cbuf->size); in cbuf_readlen() 70 …dropbear_assert(((2*cbuf->size)+cbuf->readpos-cbuf->writepos)%cbuf->size == (cbuf->size-cbuf->used… in cbuf_readlen() 72 if (cbuf->used == 0) { in cbuf_readlen() 86 dropbear_assert(cbuf->used <= cbuf->size); in cbuf_writelen() 87 dropbear_assert(((2*cbuf->size)+cbuf->writepos-cbuf->readpos)%cbuf->size == cbuf->used%cbuf->size); in cbuf_writelen() 88 …dropbear_assert(((2*cbuf->size)+cbuf->readpos-cbuf->writepos)%cbuf->size == (cbuf->size-cbuf->used… in cbuf_writelen() 90 if (cbuf->used == cbuf->size) { in cbuf_writelen() [all …]
|
/external/dropbear/libtommath/pre_gen/ |
D | mpi.c | 236 olduse = x->used; in fast_mp_montgomery_reduce() 239 if (x->alloc < n->used + 1) { in fast_mp_montgomery_reduce() 240 if ((res = mp_grow (x, n->used + 1)) != MP_OKAY) { in fast_mp_montgomery_reduce() 259 for (ix = 0; ix < x->used; ix++) { in fast_mp_montgomery_reduce() 264 for (; ix < n->used * 2 + 1; ix++) { in fast_mp_montgomery_reduce() 272 for (ix = 0; ix < n->used; ix++) { in fast_mp_montgomery_reduce() 308 for (iy = 0; iy < n->used; iy++) { in fast_mp_montgomery_reduce() 333 for (; ix <= n->used * 2 + 1; ix++) { in fast_mp_montgomery_reduce() 348 _W = W + n->used; in fast_mp_montgomery_reduce() 350 for (ix = 0; ix < n->used + 1; ix++) { in fast_mp_montgomery_reduce() [all …]
|
/external/clang/test/Sema/ |
D | attr-used.c | 3 extern int l0 __attribute__((used)); // expected-warning {{used attribute ignored}} 4 __private_extern__ int l1 __attribute__((used)); // expected-warning {{used attribute ignored}} 6 struct __attribute__((used)) s { // expected-warning {{'used' attribute only applies to variables a… 10 int a __attribute__((used)); 12 static void __attribute__((used)) f0(void) { in f0() 16 static int a __attribute__((used)); in f1() 17 int b __attribute__((used)); // expected-warning {{used attribute ignored}} in f1()
|
/external/wpa_supplicant_6/wpa_supplicant/src/utils/ |
D | wpabuf.c | 23 buf, (unsigned long) buf->size, (unsigned long) buf->used, in wpabuf_overflow() 36 if (buf->used + add_len > buf->size) { in wpabuf_resize() 39 nbuf = os_realloc(buf->ext_data, buf->used + add_len); in wpabuf_resize() 42 os_memset(nbuf + buf->used, 0, add_len); in wpabuf_resize() 46 buf->used + add_len); in wpabuf_resize() 50 os_memset(nbuf + sizeof(struct wpabuf) + buf->used, 0, in wpabuf_resize() 54 buf->size = buf->used + add_len; in wpabuf_resize() 83 buf->used = len; in wpabuf_alloc_ext_data() 124 buf->used += len; in wpabuf_put() 125 if (buf->used > buf->size) { in wpabuf_put() [all …]
|
/external/dropbear/libtomcrypt/src/pk/asn1/der/choice/ |
D | der_decode_choice.c | 45 list[x].used = 0; in der_decode_choice() 57 list[x].used = 1; in der_decode_choice() 67 list[x].used = 1; in der_decode_choice() 77 list[x].used = 1; in der_decode_choice() 88 list[x].used = 1; in der_decode_choice() 99 list[x].used = 1; in der_decode_choice() 107 list[x].used = 1; in der_decode_choice() 118 list[x].used = 1; in der_decode_choice() 130 list[x].used = 1; in der_decode_choice() 141 list[x].used = 1; in der_decode_choice() [all …]
|
/external/openssl/crypto/bn/ |
D | bn_ctx.c | 104 unsigned used, size; member 146 unsigned int used; member 162 while(bnidx < ctx->used) in ctxdbg() 208 ctx->used = 0; in BN_CTX_init() 225 ret->used = 0; in BN_CTX_new() 262 else if(!BN_STACK_push(&ctx->stack, ctx->used)) in BN_CTX_start() 279 if(fp < ctx->used) in BN_CTX_end() 280 BN_POOL_release(&ctx->pool, ctx->used - fp); in BN_CTX_end() 281 ctx->used = fp; in BN_CTX_end() 303 ctx->used++; in BN_CTX_get() [all …]
|
/external/wpa_supplicant_8/src/utils/ |
D | wpabuf.c | 40 buf, (unsigned long) buf->size, (unsigned long) buf->used, in wpabuf_overflow() 69 if (buf->used + add_len > buf->size) { in wpabuf_resize() 72 nbuf = os_realloc(buf->buf, buf->used + add_len); in wpabuf_resize() 75 os_memset(nbuf + buf->used, 0, add_len); in wpabuf_resize() 81 buf->used + add_len); in wpabuf_resize() 87 sizeof(struct wpabuf) + buf->used, 0, in wpabuf_resize() 91 buf->used + add_len); in wpabuf_resize() 95 os_memset(nbuf + sizeof(struct wpabuf) + buf->used, 0, in wpabuf_resize() 101 buf->size = buf->used + add_len; in wpabuf_resize() 152 buf->used = len; in wpabuf_alloc_ext_data() [all …]
|
/external/clang/test/FixIt/ |
D | format-darwin.m | 32 …printf("%s", getNSInteger()); // expected-warning{{values of type 'NSInteger' should not be used a… 33 …nteger()); // expected-warning{{values of type 'NSUInteger' should not be used as format arguments… 34 …printf("%s", getSInt32()); // expected-warning{{values of type 'SInt32' should not be used as form… 35 …printf("%s", getUInt32()); // expected-warning{{values of type 'UInt32' should not be used as form… 69 …printf("%s", arr[0]); // expected-warning{{values of type 'NSInteger' should not be used as forma… 70 …printf("%s", getNSInteger()); // expected-warning{{values of type 'NSInteger' should not be used … 71 …printf("%s", i); // expected-warning{{values of type 'NSInteger' should not be used as format arg… 72 …printf("%s", obj->_value); // expected-warning{{values of type 'NSInteger' should not be used as … 73 …Integer]); // expected-warning{{values of type 'NSInteger' should not be used as format arguments… 74 …printf("%s", obj.value); // expected-warning{{values of type 'NSInteger' should not be used as fo… [all …]
|