HomeSort by relevance Sort by last modified time
    Searched defs:bits (Results 76 - 100 of 1014) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/dexmaker/src/dx/java/com/android/dx/rop/cst/
CstLiteralBits.java 36 * Gets the value as {@code int} bits. If this instance contains
37 * more bits than fit in an {@code int}, then this returns only
38 * the low-order bits.
40 * @return the bits
45 * Gets the value as {@code long} bits. If this instance contains
46 * fewer bits than fit in a {@code long}, then the result of this
49 * @return the bits
54 * Returns true if this value can fit in 16 bits with sign-extension.
56 * @return true if the sign-extended lower 16 bits are the same as
64 int bits = getIntBits() local
79 int bits = getIntBits(); local
    [all...]
  /external/elfutils/0.153/libebl/
libebl.h 171 /* Check whether only valid bits are set on the st_other symbol flag. */
253 int *bits, int *type);
369 uint8_t bits; /* Bits of data for one register. */ member in struct:__anon25025
  /external/icu/icu4c/source/common/
patternprops.cpp 100 * Same as syntax2000, but with additional bits set for the
125 uint32_t bits=syntax2000[index2000[(c-0x2000)>>5]]; local
126 return (UBool)((bits>>(c&0x1f))&1);
143 uint32_t bits=syntaxOrWhiteSpace2000[index2000[(c-0x2000)>>5]]; local
144 return (UBool)((bits>>(c&0x1f))&1);
  /external/icu/icu4c/source/layout/
DeviceTables.cpp 29 le_uint16 bits = fieldBits[format]; local
30 le_uint16 count = 16 / bits;
33 le_uint16 shift = 16 - (bits * (fieldIndex + 1));
  /external/iptables/extensions/
libip6t_NETMAP.c 58 int bits; local
64 bits = xtables_ip6mask_to_cidr(&a);
65 if (bits < 0)
68 printf("/%d", bits);
  /external/openssl/apps/
prime.c 66 int bits=0; local
85 else if(!strcmp(*argv,"-bits"))
89 bits=atoi(*++argv);
127 if(!bits)
129 BIO_printf(bio_err,"Specifiy the number of bits.\n");
133 BN_generate_prime_ex(bn,bits,safe,NULL,NULL,NULL);
  /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
inftrees.h 14 table that indexes more bits of the code. op indicates whether
17 pointer, the low four bits of op is the number of index bits of
18 that table. For a length or distance, the low four bits of op
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
25 unsigned char op; /* operation, extra bits, table bits */
26 unsigned char bits; /* bits in this part of the code * member in struct:__anon32313
    [all...]
  /external/qemu/distrib/sdl-1.2.15/src/video/bwindow/
SDL_sysmouse.cc 33 /* Convert bits to padded bytes */
34 #define PADDED_BITS(bits) ((bits+7)/8)
38 char *bits; member in struct:WMcursor
65 cursor->bits = (char *)SDL_malloc(4+2*((allowed_x/8)*allowed_y));
66 if ( cursor->bits == NULL ) {
71 cursor->bits[0] = allowed_y; /* Size of the cursor */
72 cursor->bits[1] = 1; /* Bit depth of cursor */
73 cursor->bits[2] = hot_y;
74 cursor->bits[3] = hot_x
    [all...]
  /external/qemu/distrib/zlib-1.2.8/
inftrees.h 14 table that indexes more bits of the code. op indicates whether
17 pointer, the low four bits of op is the number of index bits of
18 that table. For a length or distance, the low four bits of op
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
25 unsigned char op; /* operation, extra bits, table bits */
26 unsigned char bits; /* bits in this part of the code * member in struct:__anon33352
    [all...]
  /external/skia/bench/
PathUtilsBench.cpp 20 static void fillRandomBits( int chars, char* bits ){
24 bits[i] = rand.nextU();
28 static void path_proc(char* bits, SkPath* path) {
29 SkPathUtils::BitsToPath_Path(path, bits, H, W, STRIDE);
32 static void region_proc(char* bits, SkPath* path) {
33 SkPathUtils::BitsToPath_Region(path, bits, H, W, STRIDE);
42 char* bits[H * STRIDE]; member in class:PathUtilsBench
59 fillRandomBits(H * STRIDE, (char*) &bits);
63 fProc( (char*) &bits, &path);
  /external/valgrind/main/memcheck/tests/vbit-test/
vbits.h 12 /* A type to represent V-bits */
22 } bits; member in struct:__anon36795
  /external/vixl/src/
utils-vixl.cc 33 uint32_t bits = 0; local
34 memcpy(&bits, &value, 4);
35 return bits;
40 uint64_t bits = 0; local
41 memcpy(&bits, &value, 8);
42 return bits;
46 float rawbits_to_float(uint32_t bits) {
48 memcpy(&value, &bits, 4);
53 double rawbits_to_double(uint64_t bits) {
55 memcpy(&value, &bits, 8)
    [all...]
  /external/webp/src/utils/
bit_reader_inl.h 37 #if (BITS > 32)
39 #elif (BITS > 16)
41 #elif (BITS > 8)
56 // makes sure br->value_ has at least BITS bits worth of data
59 // Read 'BITS' bits at a time if possible.
62 bit_t bits; local
83 br->buf_ += BITS >> 3;
85 #if (BITS > 32
    [all...]
  /external/webrtc/src/common_audio/signal_processing/include/
spl_inl.h 82 int bits; local
85 bits = 16;
87 bits = 0;
89 if (0x0000FF00 & (n >> bits)) bits += 8;
90 if (0x000000F0 & (n >> bits)) bits += 4;
91 if (0x0000000C & (n >> bits)) bits += 2;
92 if (0x00000002 & (n >> bits)) bits += 1
    [all...]
  /external/wpa_supplicant_8/src/utils/
bitfield.c 16 u8 *bits; member in struct:bitfield
28 bf->bits = (u8 *) (bf + 1);
44 bf->bits[bit / 8] |= BIT(bit % 8);
52 bf->bits[bit / 8] &= ~BIT(bit % 8);
60 return !!(bf->bits[bit / 8] & BIT(bit % 8));
80 if (bf->bits[i] != 0xff)
85 i = i * 8 + first_zero(bf->bits[i]);
  /external/zlib/src/contrib/infback9/
inftree9.h 14 table that indexes more bits of the code. op indicates whether
17 pointer, the low four bits of op is the number of index bits of
18 that table. For a length or distance, the low four bits of op
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
25 unsigned char op; /* operation, extra bits, table bits */
26 unsigned char bits; /* bits in this part of the code * member in struct:__anon37534
    [all...]
  /external/zlib/src/
inftrees.h 14 table that indexes more bits of the code. op indicates whether
17 pointer, the low four bits of op is the number of index bits of
18 that table. For a length or distance, the low four bits of op
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
25 unsigned char op; /* operation, extra bits, table bits */
26 unsigned char bits; /* bits in this part of the code * member in struct:__anon37550
    [all...]
  /external/zopfli/src/zopfli/
tree.c 34 unsigned bits, i; local
43 for (bits = 0; bits <= maxbits; bits++) {
44 bl_count[bits] = 0;
53 for (bits = 1; bits <= maxbits; bits++) {
54 code = (code + bl_count[bits-1]) << 1;
55 next_code[bits] = code
    [all...]
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/
h264bsd_stream.c 57 Read and remove bits from the stream buffer.
61 numBits number of bits to read
67 bits read from stream
68 END_OF_STREAM if not enough bits left
98 Read 32 bits from the stream buffer. Buffer is left as it is, i.e.
99 no bits are removed. First bit read from the stream is the MSB of
100 the return value. If there is not enough bits in the buffer ->
101 bits beyong the end of the stream are set to '0' in the return
111 bits read from stream
118 i32 bits, shift local
    [all...]
h264bsd_vlc.c 84 of 65, i.e. 32 '0' bits, a '1' bit, and either 0 or 1 represented
85 by 32 bits.
108 u32 bits, numZeros; local
115 bits = h264bsdShowBits32(pStrmData);
118 if (bits >= 0x80000000)
125 else if (bits >= 0x40000000)
129 *codeNum = 1 + ((bits >> 29) & 0x1);
133 else if (bits >= 0x20000000)
137 *codeNum = 3 + ((bits >> 27) & 0x3);
141 else if (bits >= 0x10000000
    [all...]
  /frameworks/native/include/android/
native_window.h 52 // The actual bits.
53 void* bits; member in struct:ANativeWindow_Buffer
  /frameworks/rs/
spec.h 16 int bits; member in struct:__anon39100
  /libcore/luni/src/main/java/libcore/io/
Base64.java 71 int bits = 0; local
85 bits = chr - 65;
90 bits = chr - 71;
95 bits = chr + 4;
97 bits = 62;
99 bits = 63;
104 quantum = (quantum << 6) | (byte) bits;
  /ndk/sources/android/support/src/msun/
s_nan.c 58 * the same as gcc's __builtin_nan(), namely, discard the high order bits.
70 int bitpos; /* index into words (in bits) */
82 /* Scan backwards, filling in the bits in words[] as we go. */
99 uint32_t bits[2]; member in union:__anon42812
102 _scan_nan(u.bits, 2, s);
104 u.bits[1] |= 0x7ff80000;
106 u.bits[0] |= 0x7ff80000;
116 uint32_t bits[1]; member in union:__anon42813
119 _scan_nan(u.bits, 1, s);
120 u.bits[0] |= 0x7fc00000
    [all...]
  /ndk/sources/android/support/src/stdio/amd64/
_fpmath.h 30 // Android uses 128 bits long doubles for LP64, so the structure and macros
40 } bits; member in union:IEEEl2bits
56 (a)[0] = (uint32_t)(u).bits.manl; \
57 (a)[1] = (uint32_t)((u).bits.manl >> 32); \
58 (a)[2] = (uint32_t)(u).bits.manh; \
59 (a)[3] = (uint32_t)((u).bits.manh >> 32); \

Completed in 1966 milliseconds

1 2 34 5 6 7 8 91011>>