HomeSort by relevance Sort by last modified time
    Searched full:bits (Results 951 - 975 of 15847) sorted by null

<<31323334353637383940>>

  /bionic/libm/upstream-freebsd/lib/msun/src/
s_copysignl.c 40 ux.bits.sign = uy.bits.sign;
  /dalvik/tools/dmtracedump/
Profile.h 24 * Enumeration for the two "action" bits.
38 #define METHOD_ACTION_MASK 0x03 /* two bits */
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/
ActionScriptTarget.java 69 * bits followed by \xll where ll is the lower order bits of a 16-bit number.
91 buf.append(Integer.toHexString((v >> 8) | 0x100).substring(1, 3)); // high - order bits
93 buf.append(Integer.toHexString((v & 0xff) | 0x100).substring(1, 3)); // low -order bits
102 * Note that the low order bits are first, followed by the high order bits.
103 * This is to match how the BitSet constructor works, where the bits are
104 * passed in in 32-bit chunks with low-order bits coming first.
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/macs/
CBCBlockCipherMac.java 53 * MAC been given in bits. This class uses CBC mode as the basis for the
56 * Note: the size of the MAC must be at least 24 bits (FIPS Publication 81),
57 * or 16 bits if being used as a data authenticator (FIPS Publication 113),
62 * @param macSizeInBits the size of the MAC in bits, must be a multiple of 8.
73 * MAC been given in bits. This class uses CBC mode as the basis for the
76 * Note: the size of the MAC must be at least 24 bits (FIPS Publication 81),
77 * or 16 bits if being used as a data authenticator (FIPS Publication 113),
82 * @param macSizeInBits the size of the MAC in bits, must be a multiple of 8.
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
FixedPointUtil.java 35 int bits = getCombSize(c); local
36 int d = (bits + minWidth - 1) / minWidth;
  /external/clang/include/clang/Basic/
LangOptions.h 33 #define LANGOPT(Name, Bits, Default, Description) unsigned Name : Bits;
34 #define ENUM_LANGOPT(Name, Type, Bits, Default, Description)
40 #define LANGOPT(Name, Bits, Default, Description)
41 #define ENUM_LANGOPT(Name, Type, Bits, Default, Description) \
42 unsigned Name : Bits;
106 #define LANGOPT(Name, Bits, Default, Description)
107 #define ENUM_LANGOPT(Name, Type, Bits, Default, Description) \
  /external/clang/lib/Frontend/
CodeGenOptions.cpp 16 #define CODEGENOPT(Name, Bits, Default) Name = Default;
17 #define ENUM_CODEGENOPT(Name, Type, Bits, Default) set##Name(Default);
  /external/clang/test/SemaObjC/
class-bitfield.m 8 int b : 33; // expected-error{{size of bit-field 'b' (33 bits) exceeds size of its type (32 bits)}}
  /external/compiler-rt/lib/builtins/i386/
floatundixf.S 31 movss 8(%esp), %xmm0 // hi 32 bits of input
32 movss 4(%esp), %xmm1 // lo 32 bits of input
  /external/compiler-rt/lib/builtins/ppc/
floatunditf.c 21 high.x |= a >> 32; /* 0x1.0p84 + high 32 bits of a */
22 low.x |= a & UINT64_C(0x00000000ffffffff); /* 0x1.0p52 + low 32 bits of a */
  /external/compiler-rt/lib/builtins/x86_64/
floatundixf.S 54 movl %edi, %esi // low 32 bits of input
55 shrq $32, %rdi // hi 32 bits of input
  /external/compiler-rt/test/asan/TestCases/
intra-object-overflow.cc 5 // FIXME: fix 32-bits.
6 // REQUIRES: asan-64-bits
  /external/e2fsprogs/lib/et/
error_table.h 23 #define ERRCODE_RANGE 8 /* # of bits to shift table number */
24 #define BITS_PER_CHAR 6 /* # bits to shift per character in name */
  /external/elfutils/src/backends/
i386_corenote.c 46 { .offset = at * 4, .regno = dwreg, .count = n, .bits = 32 }
48 { .offset = at * 4, .regno = dwreg, .count = n, .bits = 16, .pad = 2 }
93 { .offset = 0, .regno = 37, .count = 2, .bits = 32 }, /* fctrl-fstat */
94 { .offset = 7 * 4, .regno = 11, .count = 8, .bits = 80 }, /* stN */
100 { .offset = 0, .regno = 37, .count = 2, .bits = 16 }, /* fctrl-fstat */
101 { .offset = 24, .regno = 39, .count = 1, .bits = 32 }, /* mxcsr */
102 { .offset = 32, .regno = 11, .count = 8, .bits = 80, .pad = 6 }, /* stN */
103 { .offset = 32 + 128, .regno = 21, .count = 8, .bits = 128 }, /* xmm */
  /external/fio/
hash.h 38 /* 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)
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)
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/iproute2/man/man8/
tc-pfifo_fast.8 23 based on their Type of Service bits or assigned priority.
37 for complete details on how TOS bits are translated into bands.
  /external/jemalloc/include/jemalloc/internal/
rtree.h 52 * Suppose keys comprise 48 bits, and LG_RTREE_BITS_PER_LEVEL is 4.
65 * lower 47 bits of virtual address space in userland, thus leaving
72 /* Number of key bits distinguished by this level. */
73 unsigned bits; member in struct:rtree_level_s
75 * Cumulative number of key bits distinguished by traversing to
87 * bits to which subtree level to start at.
97 bool rtree_new(rtree_t *rtree, unsigned bits, rtree_node_alloc_t *alloc,
149 rtree->levels[level].bits) - 1));
  /external/jemalloc/include/jemalloc/
jemalloc_macros.h 23 * Bias tcache index bits so that 0 encodes "automatic tcache management", and 1
29 * Bias arena index bits so that 0 encodes "use an automatically chosen arena".
jemalloc_macros.h.in 23 * Bias tcache index bits so that 0 encodes "automatic tcache management", and 1
29 * Bias arena index bits so that 0 encodes "use an automatically chosen arena".
  /external/libopus/silk/
Inlines.h 47 /* Search in the lower 32 bits */
50 /* Search in the upper 32 bits */
55 /* get number of leading zeros and fractional part (the bits right after the leading one */
59 opus_int32 *frac_Q7 /* O the 7 bits right after the leading one */
109 /* Compute number of bits head room and normalize inputs */
115 /* Inverse of b32, with 14 bits of precision */
154 /* Compute number of bits head room and normalize input */
158 /* Inverse of b32, with 14 bits of precision */
  /external/libvpx/libvpx/vp8/common/
entropymv.c 36 128, 129, 132, 75, 145, 178, 206, 239, 254, 254 /* long bits */
46 128, 130, 130, 74, 148, 180, 203, 236, 254, 254 /* long bits */
  /external/libvpx/libvpx/vp9/encoder/
vp9_cost.h 35 int bits, int len) {
40 const int bit = (bits >> --len) & 1;
vp9_treewriter.h 32 const vp9_prob *probs, int bits, int len,
35 const int bit = (bits >> --len) & 1;
vp9_write_bit_buffer.c 31 void vp9_wb_write_literal(struct vp9_write_bit_buffer *wb, int data, int bits) {
33 for (bit = bits - 1; bit >= 0; bit--)
  /external/llvm/docs/HistoricalNotes/
2000-12-06-EncodingIdea.txt 7 size down (less than 32 bits ideally):
24 almost all of the time, and 5-6 bits worth of register number would be

Completed in 429 milliseconds

<<31323334353637383940>>