| /external/guava/guava/src/com/google/common/hash/ |
| ChecksumHashFunction.java | 33 private final int bits; field in class:ChecksumHashFunction
36 ChecksumHashFunction(Supplier<? extends Checksum> checksumSupplier, int bits, String toString) {
38 checkArgument(bits == 32 || bits == 64, "bits (%s) must be either 32 or 64", bits);
39 this.bits = bits;
44 public int bits() { method in class:ChecksumHashFunction
45 return bits;
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| PatternProps.java | 43 int bits=syntax2000[index2000[(c-0x2000)>>5]]; local
44 return ((bits>>(c&0x1f))&1)!=0;
63 int bits=syntaxOrWhiteSpace2000[index2000[(c-0x2000)>>5]]; local
64 return ((bits>>(c&0x1f))&1)!=0;
249 * Same as syntax2000, but with additional bits set for the
|
| /external/ipsec-tools/src/racoon/ |
| plainrsa-gen.c | 72 fprintf(stderr, " -b bits Generate <bits> long RSA key (default=1024)\n");
119 gen_rsa_key(FILE *fp, size_t bits, unsigned long exp)
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/ |
| libipt_NETMAP.c | 36 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/libvorbis/doc/ |
| 02-bitpacking.tex | 10 bitstream in which bits are coded one-by-one by the encoder and then
12 decoder. Most current binary storage arrangements group bits into a
13 native word size of eight bits (octets), sixteen bits, thirty-two bits
22 'octet', that is, eight bits. This has not always been the case;
26 modern platforms, this is generally assumed to be eight bits (not
33 octet (eight bits) and a word to be a group of two, four or eight
34 bytes (16, 32 or 64 bits). Note however that the Vorbis bitpacking
44 end of the byte. Bits in a byte are numbered from zero at the LSb t
[all...] |
| /external/lldb/source/Plugins/Process/POSIX/ |
| ProcessPOSIXLog.cpp | 84 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/ |
| main.c | 13 struct Bits
28 printf("%lu", sizeof(struct Bits));
30 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:$lin
[all...] |
| /external/lldb/tools/debugserver/source/ |
| PThreadEvent.cpp | 18 PThreadEvent::PThreadEvent(uint32_t bits, uint32_t validBits) :
22 m_bits(bits),
26 // DNBLogThreadedIf(LOG_EVENTS, "%p PThreadEvent::%s (0x%8.8x, 0x%8.8x)", this, __FUNCTION__, bits, validBits);
65 uint32_t bits = m_bits; local
66 return bits;
69 // Replace the event bits with a new bitmask value
71 PThreadEvent::ReplaceEventBits(const uint32_t bits)
73 // DNBLogThreadedIf(LOG_EVENTS, "%p PThreadEvent::%s (0x%8.8x)", this, __FUNCTION__, bits);
75 // Make sure we have some bits and that they aren't already set...
76 if (m_bits != bits)
[all...] |
| /external/messageformat/java/com/ibm/icu/impl/ |
| PatternProps.java | 43 int bits=syntax2000[index2000[(c-0x2000)>>5]]; local
44 return ((bits>>(c&0x1f))&1)!=0;
63 int bits=syntaxOrWhiteSpace2000[index2000[(c-0x2000)>>5]]; local
64 return ((bits>>(c&0x1f))&1)!=0;
249 * Same as syntax2000, but with additional bits set for the
|
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/h264/write/ |
| CAVLCWriter.java | 47 int bits = 0; local
51 bits = i;
56 writeNBit(0, bits);
58 writeNBit(value - cumul, bits);
|
| /external/okhttp/okio/okio/src/main/java/okio/ |
| Base64.java | 48 int bits; local
53 bits = c - 65;
58 bits = c - 71;
63 bits = c + 4;
65 bits = 62;
67 bits = 63;
74 // Append this char's 6 bits to the word.
75 word = (word << 6) | (byte) bits;
77 // For every 4 chars of input, we accumulate 24 bits of output. Emit 3 bytes.
88 // We read 1 char followed by "===". But 6 bits is a truncated byte! Fail
[all...] |
| /external/skia/src/core/ |
| SkMath.cpp | 66 int bits = shift_bias - nbits + dbits; local
68 if (bits < 0) { // answer will underflow
71 if (bits > 31) { // answer will overflow
87 // Now fall into our switch statement if there are more bits to compute
88 if (bits > 0) {
89 // make room for the rest of the answer bits
90 result <<= bits; local
91 switch (bits) {
|
| /external/skia/src/gpu/ |
| GrStencilAttachment.h | 29 int bits() const { return fBits; } function in class:GrStencilAttachment
56 GrStencilAttachment(GrGpu* gpu, LifeCycle lifeCycle, int width, int height, int bits,
61 , fBits(bits)
|
| /external/skia/tests/ |
| PathOpsTightBoundsTest.cpp | 55 SkBitmap& bits = *data->fBitmap; local
56 if (bits.width() == 0) {
57 bits.allocN32Pixels(bitWidth, bitHeight);
59 SkCanvas canvas(bits);
|
| /external/toybox/toys/posix/ |
| du.c | 61 int bits = 10; local
63 if (toys.optflags & FLAG_K) bits = 9;
64 else if (toys.optflags & FLAG_m) bits = 20;
66 printf("%llu", (size>>bits)+!!(size&((1<<bits)-1)));
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/ |
| h264bsd_util.c | 48 /* look-up table for expected values of stuffing bits */
70 length number of bits in the code word
106 Check Raw Byte Stream Payload (RBSP) trailing bits, i.e. stuffing.
109 more '0' bits.
118 HANTRO_OK RBSP trailing bits found
156 -more than 8 bits left or
157 -last bits are not RBSP trailing bits
176 u32 bits; local
183 bits = pStrmData->strmBuffSize * 8 - pStrmData->strmBuffReadBits
[all...] |
| /ndk/sources/android/support/src/stdio/ |
| fpmath.h | 57 } bits; member in union:IEEEf2bits
83 } bits; member in union:IEEEd2bits
|
| /bionic/libc/arch-mips/string/ |
| mips-string-ops.h | 46 Also, this code assumes that there are 8-bits per 'char'. */
49 typedef struct bits struct
54 typedef struct bits struct
85 /* DSP 4-lane (8 unsigned bits per line) subtract and saturate
|
| /bionic/libc/bionic/ |
| fpclassify.cpp | 40 ieee_single bits; member in union:float_u
45 ieee_double bits; member in union:double_u
51 if (u.bits.dbl_exp == 0) {
52 return ((u.bits.dbl_fracl | u.bits.dbl_frach) == 0) ? FP_ZERO : FP_SUBNORMAL;
54 if (u.bits.dbl_exp == DBL_EXP_INFNAN) {
55 return ((u.bits.dbl_fracl | u.bits.dbl_frach) == 0) ? FP_INFINITE : FP_NAN;
64 if (u.bits.sng_exp == 0) {
65 return (u.bits.sng_frac == 0) ? FP_ZERO : FP_SUBNORMAL
121 ieee_ext bits; member in union:long_double_u
[all...] |
| /bionic/libm/ |
| fpmath.h | 33 // - android uses 128 bits long doubles for LP64, so the structure and macros
47 } bits; member in union:IEEEf2bits
60 } bits; member in union:IEEEd2bits
72 } bits; member in union:IEEEl2bits
88 (a)[0] = (uint32_t)(u).bits.manl; \
89 (a)[1] = (uint32_t)((u).bits.manl >> 32); \
90 (a)[2] = (uint32_t)(u).bits.manh; \
91 (a)[3] = (uint32_t)((u).bits.manh >> 32); \
|
| /dalvik/dexgen/src/com/android/dexgen/dex/code/form/ |
| Form21h.java | 88 // Where the high bits are depends on the category of the target.
90 int bits = cb.getIntBits(); local
91 return ((bits & 0xffff) == 0);
93 long bits = cb.getLongBits(); local
94 return ((bits & 0xffffffffffffL) == 0);
109 short bits; local
111 // Where the high bits are depends on the category of the target.
113 bits = (short) (cb.getIntBits() >>> 16);
115 bits = (short) (cb.getLongBits() >>> 48);
118 write(out, opcodeUnit(insn, regs.get(0).getReg()), bits);
[all...] |
| /dalvik/dx/src/com/android/dx/dex/code/form/ |
| Form11n.java | 93 BitSet bits = new BitSet(1); local
95 bits.set(0, unsignedFitsInNibble(regs.get(0).getReg()));
96 return bits;
|
| Form12x.java | 114 BitSet bits = new BitSet(2); local
120 bits.set(0, unsignedFitsInNibble(r0));
121 bits.set(1, unsignedFitsInNibble(r1));
126 bits.set(0, false);
127 bits.set(1, false);
130 bits.set(0, dstRegComp);
131 bits.set(1, dstRegComp);
134 bits.set(2, unsignedFitsInNibble(regs.get(2).getReg()));
142 return bits;
|
| Form21c.java | 123 BitSet bits = new BitSet(sz); local
127 bits.set(0, compat);
130 bits.set(0, compat);
131 bits.set(1, compat);
135 return bits;
|
| Form21h.java | 89 // Where the high bits are depends on the category of the target.
91 int bits = cb.getIntBits(); local
92 return ((bits & 0xffff) == 0);
94 long bits = cb.getLongBits(); local
95 return ((bits & 0xffffffffffffL) == 0);
103 BitSet bits = new BitSet(1); local
105 bits.set(0, unsignedFitsInByte(regs.get(0).getReg()));
106 return bits;
114 short bits; local
116 // Where the high bits are depends on the category of the target
[all...] |
