/external/chromium_org/third_party/skia/src/core/ |
H A D | SkScalerContext.cpp | 359 unsigned bits = 0; local 361 bits <<= 1; 362 bits |= convert_8_to_1(alpha[i]); 364 return SkToU8(bits); 387 unsigned bits = 0; local 390 bits |= convert_8_to_1(*src++) << shift; 392 *dst++ = bits;
|
/external/skia/src/core/ |
H A D | SkScalerContext.cpp | 270 // check for overflow of 16bits, since our glyphID cannot exceed that 533 unsigned bits = 0; local 535 bits <<= 1; 536 bits |= convert_8_to_1(alpha[i]); 538 return SkToU8(bits); 561 unsigned bits = 0; local 564 bits |= convert_8_to_1(*src++) << shift; 566 *dst++ = bits;
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
H A D | RC2Engine.java | 63 int bits) 90 // Phase 2 - reduce effective key size to "bits" 91 len = (bits + 7) >> 3; 92 x = piTable[xKey[128 - len] & (255 >> (7 & -bits))] & 0xff; 61 generateWorkingKey( byte[] key, int bits) argument
|
/external/chromium_org/third_party/boringssl/src/include/openssl/ |
H A D | bn.h | 136 * although the largest integer supported by the compiler might be 64 bits, BN 191 /* BN_num_bits returns the minimum number of bits needed to represent the 461 /* BN_mask_bits truncates |a| so that it is only |n| bits long. It returns one 537 /* BN_rand sets |rnd| to a random number of length |bits|. If |top| is zero, 539 * significant bits will be set. 542 * not equal |bits| if the most significant bits randomly ended up as zeros. 546 OPENSSL_EXPORT int BN_rand(BIGNUM *rnd, int bits, int top, int bottom); 549 OPENSSL_EXPORT int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom); 606 /* BN_generate_prime_ex sets |ret| to a prime number of |bits| lengt [all...] |
/external/chromium_org/third_party/libwebp/dec/ |
H A D | vp8l.c | 153 // to ReadSymbol, in order to pre-fetch enough bits. 157 uint32_t bits = VP8LPrefetchBits(br); local 160 const int lut_ix = bits & (HUFF_LUT - 1); 168 bits >>= HUFF_LUT_BITS; 173 node = HuffmanTreeNextNode(node, bits & 1); 174 bits >>= 1; 617 const uint32_t* const image, int xsize, int bits, int x, int y) { 618 if (bits == 0) return 0; 619 return image[xsize * (y >> bits) + (x >> bits)]; 616 GetMetaIndex( const uint32_t* const image, int xsize, int bits, int x, int y) argument 1006 const int bits = (num_colors > 16) ? 0 local [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/ |
H A D | cso_hash.c | 59 int bits = hint; local 61 while (bits > 1) { 62 bits >>= 1;
|
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkMD5.cpp | 64 // Get the number of bits before padding. 65 uint8_t bits[8]; local 66 encode(bits, this->byteCount << 3); 80 this->update(bits, 8); 109 /** Rotates x left n bits. */
|
/external/chromium_org/third_party/webrtc/base/ |
H A D | sha1.cc | 109 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) 231 // Update number of bits. 233 // count[0] has low 29 bits for byte count + 3 pad 0's making 32 bits for
|
/external/clang/test/SemaCXX/ |
H A D | overload-call.cpp | 124 void test_bitfield(Bits bits, int x) { argument 125 int* ip = bitfields(bits.int_bitfield, 0); 126 float* fp = bitfields(bits.uint_bitfield, 0u);
|
/external/mesa3d/src/gallium/auxiliary/cso_cache/ |
H A D | cso_hash.c | 59 int bits = hint; local 61 while (bits > 1) { 62 bits >>= 1;
|
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/spdy/ |
H A D | HpackDraft05.java | 346 // This is a multibyte value. Read 7 bits at a time. 423 void writeInt(int value, int prefixMask, int bits) throws IOException { argument 426 out.writeByte(bits | value); 431 out.writeByte(bits | prefixMask); 434 // Write 7 bits at a time 'til we're done.
|
/external/openssl/crypto/bn/asm/ |
H A D | ppc64-mont.pl | 530 insrdi $t0,$t3,16,0 ; 0..63 bits 555 insrdi $t4,$t7,16,0 ; 64..127 bits 556 srdi $carry,$t7,16 ; upper 33 bits 595 insrdi $t0,$t3,16,0 ; 0..63 bits 605 insrdi $t4,$t7,16,0 ; 64..127 bits 606 srdi $carry,$t7,16 ; upper 33 bits 817 insrdi $t0,$t3,16,0 ; 0..63 bits 849 insrdi $t4,$t7,16,0 ; 64..127 bits 850 srdi $carry,$t7,16 ; upper 33 bits 894 insrdi $t0,$t3,16,0 ; 0..63 bits [all...] |
/external/ppp/pppd/ |
H A D | sha1.c | 26 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
|
/external/qemu/distrib/sdl-1.2.15/src/video/maccommon/ |
H A D | SDL_macwm.c | 285 static Ptr CreateEmptyGammaTable (short channels, short entries, short bits) argument 290 dataWidth = (bits + 7) / 8; /* number of bytes per entry */ 301 pTableGammaOut->gDataWidth = bits;
|
/external/qemu/distrib/zlib-1.2.8/ |
H A D | zlib.h | 287 that is three bits plus filler bits to the next byte, followed by four bytes 294 codes block that is 10 bits long. This assures that enough bytes are output 300 seven bits of the current block are held to be written as the next byte after 302 be provided enough bits at this point in order to complete decompression of 432 number of unused bits in the last byte taken from strm->next_in, plus 64 if 438 unused bits may in general be greater than seven, except when bit 7 of 439 data_type is set, in which case the number of unused bits will be less than 442 consumed input in bits. 715 int *bits)); [all...] |
/external/skia/src/utils/ |
H A D | SkMD5.cpp | 64 // Get the number of bits before padding. 65 uint8_t bits[8]; local 66 encode(bits, this->byteCount << 3); 80 this->update(bits, 8); 109 /** Rotates x left n bits. */
|
/external/valgrind/main/none/tests/ |
H A D | sha1_test.c | 77 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
|
/external/webp/src/dec/ |
H A D | vp8l.c | 153 // to ReadSymbol, in order to pre-fetch enough bits. 157 uint32_t bits = VP8LPrefetchBits(br); local 160 const int lut_ix = bits & (HUFF_LUT - 1); 168 bits >>= HUFF_LUT_BITS; 173 node = HuffmanTreeNextNode(node, bits & 1); 174 bits >>= 1; 617 const uint32_t* const image, int xsize, int bits, int x, int y) { 618 if (bits == 0) return 0; 619 return image[xsize * (y >> bits) + (x >> bits)]; 616 GetMetaIndex( const uint32_t* const image, int xsize, int bits, int x, int y) argument 1006 const int bits = (num_colors > 16) ? 0 local [all...] |
/external/wpa_supplicant_8/hostapd/src/crypto/ |
H A D | sha1-internal.c | 127 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
|
/external/wpa_supplicant_8/src/crypto/ |
H A D | sha1-internal.c | 127 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
|
/external/wpa_supplicant_8/wpa_supplicant/src/crypto/ |
H A D | sha1-internal.c | 127 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
|
/external/zlib/src/as400/ |
H A D | zlib.inc | 343 D bits 10I 0 Pending bits 347 D bits 10I 0 value # of bits to insert 382 D inflatePrime PR 10I 0 extproc('inflatePrime') Insert bits 384 D bits 10I 0 value Bit count
|
/external/zlib/src/ |
H A D | zlib.h | 287 that is three bits plus filler bits to the next byte, followed by four bytes 294 codes block that is 10 bits long. This assures that enough bytes are output 300 seven bits of the current block are held to be written as the next byte after 302 be provided enough bits at this point in order to complete decompression of 432 number of unused bits in the last byte taken from strm->next_in, plus 64 if 438 unused bits may in general be greater than seven, except when bit 7 of 439 data_type is set, in which case the number of unused bits will be less than 442 consumed input in bits. 715 int *bits)); [all...] |
/external/zlib/ |
H A D | zlib.h | 287 that is three bits plus filler bits to the next byte, followed by four bytes 294 codes block that is 10 bits long. This assures that enough bytes are output 300 seven bits of the current block are held to be written as the next byte after 302 be provided enough bits at this point in order to complete decompression of 432 number of unused bits in the last byte taken from strm->next_in, plus 64 if 438 unused bits may in general be greater than seven, except when bit 7 of 439 data_type is set, in which case the number of unused bits will be less than 442 consumed input in bits. 715 int *bits)); [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ppc/ |
H A D | loopfilter_filters_altivec.asm | 32 ;# when we think of them as permutations of address bits: Concatenate a 34 ;# memory beginning at address zero. The low four bits 0...3 of the 36 ;# address bits select the register. 40 ;# still if the low-order bits of the register number correspond to 41 ;# conceptual address bits. We do this whenever reasonable. 44 ;# a 256-element block of memory. It takes 8 bits 0...7 to address this 47 ;# column, which is interchanged with the row addressed by bits 4..7. 83 ;# Except for bits s and d, the other relationships between register 84 ;# number (= high-order part of address) bits are at the disposal of 162 ;# We begin by reading the data 32 bits a [all...] |