Searched defs:bits (Results 151 - 175 of 779) sorted by relevance

1234567891011>>

/external/chromium_org/tools/gn/
H A Dninja_target_writer.cc83 void NinjaTargetWriter::WriteSharedVars(const SubstitutionBits& bits) { argument
87 if (bits.used[SUBSTITUTION_LABEL]) {
96 if (bits.used[SUBSTITUTION_ROOT_GEN_DIR]) {
105 if (bits.used[SUBSTITUTION_ROOT_OUT_DIR]) {
114 if (bits.used[SUBSTITUTION_TARGET_GEN_DIR]) {
123 if (bits.used[SUBSTITUTION_TARGET_OUT_DIR]) {
132 if (bits.used[SUBSTITUTION_TARGET_OUTPUT_NAME]) {
H A Dsubstitution_pattern.cc88 SubstitutionBits bits; local
89 FillRequiredTypes(&bits);
90 bits.FillVector(&required_types_);
113 void SubstitutionPattern::FillRequiredTypes(SubstitutionBits* bits) const {
116 bits->used[static_cast<size_t>(ranges_[i].type)] = true;
/external/chromium_org/v8/src/base/utils/
H A Drandom-number-generator.cc112 int RandomNumberGenerator::Next(int bits) { argument
113 DCHECK_LT(0, bits);
114 DCHECK_GE(32, bits);
123 return static_cast<int>(seed >> (48 - bits));
/external/chromium_org/v8/src/
H A Dsafepoint-table.h22 SafepointEntry(unsigned info, uint8_t* bits) : info_(info), bits_(bits) { argument
67 uint8_t* bits() { function in class:v8::internal::BASE_EMBEDDED
100 uint8_t* bits = &Memory::uint8_at(entries_ + (index * entry_size_));
101 return SafepointEntry(info, bits);
205 // Emit the safepoint table after the body. The number of bits per
/external/clang/test/Analysis/
H A Dfields.c62 struct Bits bits; local
64 if (foo() && bits.b) // expected-warning {{garbage}}
66 if (foo() && bits.inner.e) // expected-warning {{garbage}}
69 bits.c = 1;
70 clang_analyzer_eval(bits.c == 1); // expected-warning {{TRUE}}
72 if (foo() && bits.b) // expected-warning {{garbage}}
74 if (foo() && bits.x) // expected-warning {{garbage}}
77 bits.x = true;
78 clang_analyzer_eval(bits.x == true); // expected-warning{{TRUE}}
79 bits
121 struct Bits bits; local
[all...]
/external/clang/test/CodeGenCXX/
H A D2007-01-06-PtrMethodInit.cpp57 PRUint8 bits; member in struct:EventDispatchData
/external/deqp/framework/opengl/
H A DgluFboRenderContext.cpp40 const tcu::IVec4 bits = tcu::getTextureFormatBitDepth(glu::mapGLInternalFormat(colorFormat)); local
41 return tcu::PixelFormat(bits[0], bits[1], bits[2], bits[3]);
46 const tcu::IVec4 bits = tcu::getTextureFormatBitDepth(glu::mapGLInternalFormat(depthStencilFormat)); local
47 *depthBits = bits[0];
48 *stencilBits = bits[3];
68 const tcu::IVec4 bits = tcu::getTextureFormatBitDepth(glu::mapGLInternalFormat(format)); local
71 config.redBits != bits[
107 const tcu::IVec4 bits = tcu::getTextureFormatBitDepth(glu::mapGLInternalFormat(format)); local
[all...]
/external/dexmaker/src/dx/java/com/android/dx/util/
H A DBits.java31 * Constructs a bit set to contain bits up to the given index (exclusive).
44 * @param bits {@code non-null;} bit set in question
47 public static int getMax(int[] bits) { argument
48 return bits.length * 0x20;
54 * @param bits {@code non-null;} bit set to operate on
58 public static boolean get(int[] bits, int idx) { argument
61 return (bits[arrayIdx] & bit) != 0;
67 * @param bits {@code non-null;} bit set to operate on
71 public static void set(int[] bits, int idx, boolean value) { argument
76 bits[arrayId
88 set(int[] bits, int idx) argument
100 clear(int[] bits, int idx) argument
113 isEmpty(int[] bits) argument
131 bitCount(int[] bits) argument
152 anyInRange(int[] bits, int start, int end) argument
166 findFirst(int[] bits, int idx) argument
215 toHuman(int[] bits) argument
[all...]
/external/fio/
H A Dhash.h38 /* Sigh, gcc can't optimise this alone like it does for 32 bits. */
60 static inline unsigned long hash_long(unsigned long val, unsigned int bits) argument
62 /* High bits are more random, so use them. */
63 return __hash_long(val) >> (BITS_PER_LONG - bits);
71 static inline unsigned long hash_ptr(void *ptr, unsigned int bits) argument
73 return hash_long((uintptr_t)ptr, bits);
118 /* All but the last block: affect some 32 bits of (a,b,c) */
128 /* Last block: affect all 32 bits of (c) */
/external/freetype/src/gzip/
H A Dinfblock.c15 #define bits word.what.Bits macro
27 3. There is an implied maximum of 7 bits for the bit length table and
28 15 bits for the actual data.
36 zero distance codes, which is sent as one code of zero bits in
41 cannot be used though, since there is no length base or extra bits
43 However, static trees define 32 codes (all 5 bits) to fill out the
47 8. The five bits following the block type is really the number of
49 9. Length codes 8,16,16 are interpreted as 13 length codes of 8 bits
126 uInt k; /* bits in bit buffer */
195 b = k = 0; /* dump bits */
[all...]
/external/guava/guava/src/com/google/common/hash/
H A DMurmur3_128HashFunction.java38 @Override public int bits() { method in class:Murmur3_128HashFunction
/external/icu/icu4c/source/i18n/
H A DdecNumber.h41 /* Bit settings for decNumber.bits */
46 /* The remaining bits are reserved; they must be 0 */
85 uint8_t bits; /* Indicator bits (see above) */ member in struct:__anon21895
184 #define decNumberIsFinite(dn) (((dn)->bits&DECSPECIAL)==0)
185 #define decNumberIsInfinite(dn) (((dn)->bits&DECINF)!=0)
186 #define decNumberIsNaN(dn) (((dn)->bits&(DECNAN|DECSNAN))!=0)
187 #define decNumberIsNegative(dn) (((dn)->bits&DECNEG)!=0)
188 #define decNumberIsQNaN(dn) (((dn)->bits&(DECNAN))!=0)
189 #define decNumberIsSNaN(dn) (((dn)->bits
[all...]
/external/ipsec-tools/src/racoon/
H A Dplainrsa-gen.c72 fprintf(stderr, " -b bits Generate <bits> long RSA key (default=1024)\n");
119 gen_rsa_key(FILE *fp, size_t bits, unsigned long exp) argument
124 key = RSA_generate_key(bits, exp, NULL, NULL);
138 fprintf(fp, "\t# RSA %zu bits\n", bits);
159 size_t bits = 1024; local
176 bits = atoi(optarg);
203 gen_rsa_key(fp, bits, pubexp);
/external/iptables/extensions/
H A Dlibipt_NETMAP.c36 int bits; local
39 for (bits = 0, bm = 0x80000000; netmask & bm; netmask <<= 1)
40 bits++;
43 return bits;
71 int bits; local
76 bits = netmask2bits(a.s_addr);
77 if (bits < 0)
80 printf("/%d", bits);
/external/jemalloc/include/jemalloc/internal/
H A Drtree.h39 rtree_t *rtree_new(unsigned bits, rtree_alloc_t *alloc, rtree_dalloc_t *dalloc);
59 /* The least significant bits of the key are ignored. */ \
65 unsigned i, lshift, height, bits; \
71 i++, lshift += bits, node = child) { \
72 bits = rtree->level2bits[i]; \
74 3)) - bits); \
86 bits = rtree->level2bits[i]; \
88 bits); \
134 unsigned i, lshift, height, bits; local
140 i++, lshift += bits, nod
[all...]
/external/libopus/celt/
H A Dmodes.h53 const unsigned char *bits; member in struct:__anon24537
74 const unsigned char *allocVectors; /**< Number of bits in each band for several rates */
H A Drate.h53 static OPUS_INLINE int bits2pulses(const CELTMode *m, int band, int LM, int bits) argument
60 cache = m->cache.bits + m->cache.index[LM*m->nbEBands+band];
64 bits--;
69 if ((int)cache[mid] >= bits)
74 if (bits- (lo == 0 ? -1 : (int)cache[lo]) <= (int)cache[hi]-bits)
85 cache = m->cache.bits + m->cache.index[LM*m->nbEBands+band];
92 @param offsets Requested increase or decrease in the number of bits for
96 @return Total number of bits allocated
/external/libvpx/libvpx/vp8/decoder/
H A Ddboolhuff.h103 static int vp8_decode_value(BOOL_DECODER *br, int bits) argument
108 for (bit = bits - 1; bit >= 0; bit--)
120 * Variable 'count' stores the number of bits in the 'value' buffer, minus
122 * to be shifted into it. So if count == 8, the top 16 bits of 'value' are
132 /* We have tried to decode bits after the end of
/external/libvpx/libvpx/vp9/decoder/
H A Dvp9_reader.h88 static int vp9_read_literal(vp9_reader *r, int bits) { argument
91 for (bit = bits - 1; bit >= 0; bit--)
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_writer.h90 static void vp9_write_literal(vp9_writer *w, int data, int bits) { argument
93 for (bit = bits - 1; bit >= 0; bit--)
/external/lldb/source/Plugins/Process/POSIX/
H A DProcessPOSIXLog.cpp84 uint32_t bits = GetFlagBits(arg); local
86 if (bits)
88 flag_bits &= ~bits;
129 uint32_t bits = GetFlagBits(arg); local
131 if (bits)
133 flag_bits |= bits;
/external/lldb/test/lang/c/bitfields/
H A Dmain.c30 struct Bits bits; local
33 bits.b1 = i; //// break $source:$line
35 bits.b2 = i; //// break $source:$line
37 bits.b3 = i; //// break $source:$line
39 bits.b4 = i; //// break $source:$line
41 bits.b5 = i; //// break $source:$line
43 bits.b6 = i; //// break $source:$line
45 bits.b7 = i; //// break $source:$line
47 bits.four = i; //// break $source:$line
/external/openssl/apps/
H A Ddh.c282 int len,l,bits; local
285 bits=BN_num_bits(dh->p);
293 printf("static unsigned char dh%d_p[]={",bits);
302 printf("static unsigned char dh%d_g[]={",bits);
310 printf("DH *get_dh%d()\n\t{\n",bits);
314 bits,bits);
316 bits,bits);
/external/openssl/crypto/asn1/
H A Da_bitstr.c68 int ret,j,bits,len; local
79 bits=(int)a->flags&0x07;
88 if (j & 0x01) bits=0;
89 else if (j & 0x02) bits=1;
90 else if (j & 0x04) bits=2;
91 else if (j & 0x08) bits=3;
92 else if (j & 0x10) bits=4;
93 else if (j & 0x20) bits=5;
94 else if (j & 0x40) bits=6;
95 else if (j & 0x80) bits
[all...]
/external/openssl/crypto/modes/
H A Dcfb128.c174 it corrupts any extra bits in the last byte of out */
210 size_t bits, const void *key,
220 for(n=0 ; n<bits ; ++n)
209 CRYPTO_cfb128_1_encrypt(const unsigned char *in, unsigned char *out, size_t bits, const void *key, unsigned char ivec[16], int *num, int enc, block128_f block) argument

Completed in 488 milliseconds

1234567891011>>