HomeSort by relevance Sort by last modified time
    Searched defs:bits (Results 301 - 325 of 935) sorted by null

<<11121314151617181920>>

  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/
BitSet.java 37 protected final static int BITS = 64; // number of bits / long
45 protected final static int MOD_MASK = BITS - 1;
47 /** The actual data bits */
48 protected long bits[]; field in class:BitSet
50 /** Construct a bitset of size one word (64 bits) */
52 this(BITS);
57 bits = bits_;
70 * @param nbits The size of the bitset in bits
73 bits = new long[((nbits - 1) >> LOG_BITS) + 1]
    [all...]
  /external/apache-xml/src/main/java/org/apache/xpath/axes/
UnionPathIterator.java 228 * Get the analysis bits for this walker, as defined in the WalkerFactory.
233 int bits = 0; local
242 bits |= bit;
246 return bits;
WalkingIterator.java 83 * Get the analysis bits for this walker, as defined in the WalkerFactory.
88 int bits = 0; local
96 bits |= bit;
100 return bits;
  /external/boringssl/src/crypto/bn/
bn_test.cc 901 int bits = (200 * (i + 1)) / num2; local
903 if (bits == 0) {
906 if (!BN_rand(n.get(), bits, 0, 1) ||
    [all...]
  /external/boringssl/src/crypto/cipher/
tls_cbc.c 112 * one or more of the lower eight bits of |good| will be cleared. */
289 unsigned int bits; /* at most 18 bits */ local
384 * length, in bits. */
386 /* bits is the hash-length in bits. It includes the additional hash
394 bits = 8 * mac_end_offset;
397 bits += 8 * md_block_size;
408 length_bytes[md_length_size - 4] = (uint8_t)(bits >> 24);
409 length_bytes[md_length_size - 3] = (uint8_t)(bits >> 16)
    [all...]
  /external/boringssl/src/crypto/ec/
wnaf.c 216 * no new bits will be added into window_val,
402 size_t bits; local
404 bits = i < num ? BN_num_bits(scalars[i]) : BN_num_bits(scalar);
405 wsize[i] = EC_window_bits_for_scalar_size(bits);
687 size_t i, bits, w, pre_points_per_block, blocksize, numblocks, num; local
728 bits = BN_num_bits(order);
732 * TBD: The combination 8, 4 is perfect for 160 bits; for other
738 if (EC_window_bits_for_scalar_size(bits) > w) {
740 w = EC_window_bits_for_scalar_size(bits);
743 numblocks = (bits + blocksize - 1)
    [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/modes/gcm/
GCMUtil.java 116 int bits = y[i]; local
119 int m1 = bits >> 31; bits <<= 1;
145 long bits = y[i]; local
148 long m1 = bits >> 63; bits <<= 1;
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/ec/
BCECPublicKey.java 246 DERBitString bits = info.getPublicKeyData(); local
247 byte[] data = bits.getBytes();
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/
JCEECPublicKey.java 196 // DERBitString bits = info.getPublicKeyData();
202 // key = (ASN1OctetString) ASN1Primitive.fromByteArray(bits.getBytes());
286 DERBitString bits = info.getPublicKeyData(); local
287 byte[] data = bits.getBytes();
  /external/deqp/framework/common/
tcuFloat.hpp 75 * \param mantissa Mantissa bits with implicit leading bit explicitly set
94 * \param mantissa Mantissa bits
105 StorageType bits (void) const { return m_value; } function in class:tcu::Float
169 deUint32 u32 = Float32::convert(*this).bits();
178 deUint64 u64 = Float64::convert(*this).bits();
  /external/deqp/framework/opengl/
gluRenderContext.hpp 91 ApiType (deUint32 bits) : m_bits(bits) {}
92 static ApiType fromBits (deUint32 bits) { return ApiType(bits); }
113 deUint32 bits = 0; local
119 bits |= deUint32(major) << MAJOR_SHIFT;
120 bits |= deUint32(minor) << MINOR_SHIFT;
121 bits |= deUint32(profile) << PROFILE_SHIFT;
123 return bits;
177 deUint32 bits = apiBits local
    [all...]
  /external/deqp/modules/egl/
teglRenderCase.cpp 418 EGLint bits; member in struct:deqp::egl::__anon7468
432 RenderFilterList filters (name.c_str(), "", s_surfaceRules[surfaceNdx].bits);
  /external/deqp/modules/gles31/functional/
es31fFboTestUtil.cpp 604 const tcu::IVec4 bits = tcu::getTextureFormatBitDepth(format); local
606 return tcu::RGBA(calculateU8ConversionError(bits.x()),
607 calculateU8ConversionError(bits.y()),
608 calculateU8ConversionError(bits.z()),
609 calculateU8ConversionError(bits.w()));
  /external/drm_hwcomposer/
seperate_rects.cpp 66 int bits = IdSet<TUInt>::max_elements; local
67 TUInt mask = ((TUInt)0x1) << (bits - 1);
68 for (int i = 0; i < bits; i++)
  /external/fio/crc/
sha256.c 274 uint64_t bits; local
279 /* Save number of bits */
280 bits = (uint64_t) sctx->count << 3;
288 fio_sha256_update(sctx, (const uint8_t *)&bits, sizeof(bits));
  /external/flac/libFLAC/
bitwriter.c 49 /* WATCHOUT: there are a few places where the code will not work unless uint32_t is >= 32 bits wide */
71 #define FLAC__TOTAL_BITS(bw) (FLAC__WORDS_TO_BITS((bw)->words) + (bw)->bits)
75 uint32_t accum; /* accumulator; bits are right-justified; when full, accum is appended to buffer */
78 unsigned bits; /* # of used bits in accum */ member in struct:FLAC__BitWriter
93 /* calculate total words needed to store 'bits_to_add' additional bits */
94 new_capacity = bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD);
108 FLAC__ASSERT(new_capacity >= bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD));
150 bw->words = bw->bits = 0;
167 bw->words = bw->bits = 0
    [all...]
lpc.c 1336 FLAC__double bits, best_bits, error_scale; local
    [all...]
  /external/freetype/src/gzip/
infcodes.c 14 #define bits word.what.Bits macro
40 uInt need; /* bits needed */
44 uInt get; /* bits to get for extra */
50 Byte lbits; /* ltree bits decoded per branch */
51 Byte dbits; /* dtree bits decoder per branch */
87 uInt e; /* extra bits or operation */
89 uInt k; /* bits in bit buffer */
124 DUMPBITS(t->bits)
171 DUMPBITS(t->bits)
    [all...]
inftrees.c 27 #define bits word.what.Bits macro
31 uIntf *, /* code lengths in bits */
35 const uIntf *, /* list of extra bits for non-simple codes */
37 uIntf *, /* maximum lookup bits (returns actual) */
47 local const uInt cplext[31] = { /* Extra bits for literal codes 257..285 */
54 local const uInt cpdext[30] = { /* Extra bits for distance codes */
72 below. lbits is the number of bits the first level table for literal/
77 bits is used, or when the shortest code is *longer* than the requested
78 table size, in which case the length of the shortest code in bits i
    [all...]
  /external/guava/guava/src/com/google/common/hash/
BloomFilter.java 63 * Sets {@code numHashFunctions} bits of the given bit array, by hashing a user element.
65 * <p>Returns whether any bits changed as a result of this operation.
67 <T> boolean put(T object, Funnel<? super T> funnel, int numHashFunctions, BitArray bits);
70 * Queries {@code numHashFunctions} bits of the given bit array, by hashing a user element;
71 * returns {@code true} if and only if all selected bits are set.
74 T object, Funnel<? super T> funnel, int numHashFunctions, BitArray bits);
87 private final BitArray bits; field in class:BloomFilter
103 private BloomFilter(BitArray bits, int numHashFunctions, Funnel<T> funnel,
109 this.bits = checkNotNull(bits);
    [all...]
HashCode.java 43 * Returns the number of bits in this hash code; a positive multiple of 8.
45 public abstract int bits(); method in class:HashCode
51 * @throws IllegalStateException if {@code bits() < 32}
59 * @throws IllegalStateException if {@code bits() < 64}
64 * If this hashcode has enough bits, returns {@code asLong()}, otherwise returns a {@code long}
90 maxLength = Ints.min(maxLength, bits() / 8);
125 public int bits() { method in class:HashCode.IntHashCode
145 throw new IllegalStateException("this HashCode only has 32 bits; cannot create a long");
181 public int bits() { method in class:HashCode.LongHashCode
250 public int bits() { method in class:HashCode.BytesHashCode
    [all...]
  /external/guava/guava/src/com/google/common/math/
BigIntegerMath.java 111 * The maximum number of bits in a square root for which we'll precompute an explicit half power
337 int bits = LongMath.log2(startingNumber, FLOOR) + 1; local
339 int nextPowerOfTwo = 1 << (bits - 1);
346 bits++;
353 int normalizedBits = bits - tz;
416 int bits = LongMath.log2(n, RoundingMode.CEILING); local
418 int numeratorBits = bits;
424 // log2(p) >= bits - 1, because p >= n/2
426 if (numeratorBits + bits >= Long.SIZE - 1) {
434 numeratorBits = bits;
    [all...]
  /external/icu/icu4c/source/common/
ucnv_u7.c 169 * 15..0 bits (up to 14 bits incoming base64)
175 * 7..0 bits (6 bits outgoing base64)
220 uint16_t bits; local
242 bits=(uint16_t)status;
286 bits=0;
336 } else if(bits!=0) {
337 /* bits are illegally left over, a UChar is incomplete */
361 bits=base64Value
469 uint8_t bits; local
902 uint16_t bits; local
1168 uint8_t bits; local
    [all...]
  /external/icu/icu4j/main/classes/charset/src/com/ibm/icu/charset/
CharsetUTF7.java 189 char bits; local
205 bits=(char)status;
255 bits=0;
306 } else if(bits!=0) {
307 /* bits are illegally left over, a UChar is incomplete */
331 bits=(char)base64Value;
338 bits=(char)((bits<<6) | base64Value);
342 c=(char)((bits<<4) | (base64Value>>2));
357 bits=(char)(base64Value&3)
498 char bits; local
    [all...]
  /external/kernel-headers/original/uapi/linux/
hdlcdrv.h 58 unsigned char bits; member in union:hdlcdrv_ioctl::__anon11144

Completed in 1337 milliseconds

<<11121314151617181920>>