| /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...] |
| /external/clang/www/ |
| libstdc++4.4-clang0x.patch | 9 diff -ur a/bits/forward_list.h b/bits/forward_list.h
10 --- a/bits/forward_list.h 2011-03-15 14:49:05.000000000 -0700
11 +++ b/bits/forward_list.h 2011-05-02 23:51:33.000000000 -0700
21 diff -ur a/bits/move.h b/bits/move.h
22 --- a/bits/move.h 2011-03-15 14:49:05.000000000 -0700
23 +++ b/bits/move.h 2011-03-29 10:33:39.000000000 -0700
61 diff -ur a/bits/shared_ptr.h b/bits/shared_ptr.
[all...] |
| /external/guava/guava/src/com/google/common/hash/ |
| BloomFilterStrategies.java | 27 * Collections of strategies of generating the k * log(M) bits required for an element to
28 * be mapped to a BloomFilter of M bits and k hash functions. These
46 int numHashFunctions, BitArray bits) {
47 long bitSize = bits.bitSize();
55 // Flip all the bits if it's negative (guaranteed positive number)
59 bitsChanged |= bits.set(combinedHash % bitSize);
65 int numHashFunctions, BitArray bits) {
66 long bitSize = bits.bitSize();
73 // Flip all the bits if it's negative (guaranteed positive number)
77 if (!bits.get(combinedHash % bitSize))
[all...] |
| /external/v8/src/arm64/ |
| instructions-arm64.cc | 100 // An integer is constructed from the n, imm_s and imm_r bits according to
110 // (s bits must not be all set)
112 // A pattern is constructed of size bits, where the least significant S+1
113 // bits are set. The pattern is rotated right by R, and repeated across a
121 uint64_t bits = (1UL << (imm_s + 1)) - 1; local
122 return RotateRight(bits, imm_r, 64);
133 uint64_t bits = (1UL << ((imm_s & mask) + 1)) - 1; local
135 RotateRight(bits, imm_r & mask, width),
146 // ImmFP: abcdefgh (8 bits)
147 // Single: aBbb.bbbc.defg.h000.0000.0000.0000.0000 (32 bits)
149 uint32_t bits = ImmFP(); local
164 uint32_t bits = ImmFP(); local
[all...] |
| /external/llvm/lib/Target/XCore/ |
| XCoreInstrFormats.td | 15 field bits<32> Inst;
23 field bits<32> SoftFail = 0;
36 class _F3R<bits<5> opc, dag outs, dag ins, string asmstr, list<dag> pattern>
45 class _F3RImm<bits<5> opc, dag outs, dag ins, string asmstr, list<dag> pattern>
50 class _FL3R<bits<9> opc, dag outs, dag ins, string asmstr, list<dag> pattern>
61 class _FL3RSrcDst<bits<9> opc, dag outs, dag ins, string asmstr,
66 class _F2RUS<bits<5> opc, dag outs, dag ins, string asmstr, list<dag> pattern>
73 class _F2RUSBitp<bits<5> opc, dag outs, dag ins, string asmstr,
79 class _FL2RUS<bits<9> opc, dag outs, dag ins, string asmstr, list<dag> pattern>
90 class _FL2RUSBitp<bits<9> opc, dag outs, dag ins, string asmstr
[all...] |
| /external/libmpeg2/decoder/ |
| impeg2d_bitstream.c | 113 /* convert the endian ness from Little endian to Big endian so that bits
184 * numBits : No of bits to be read
204 * NoOfBits : No of bits to be read
206 * Values Returned : The bits read (upto 32 bits maximum) starting from the
234 * specified number of bits from the buffer without
236 * check for some specific pattern of bits like start
242 * numBits : No of bits to be read
244 * Values Returned : The bits read (upto 32 bits maximum) starting from th
[all...] |
| /dalvik/dx/tests/003-magic-version-access/ |
| info.txt | 5 The salient bits of parsing tested here are:
|
| /external/iptables/extensions/ |
| libipt_ECN.man | 5 Remove all ECN bits from the TCP header. Of course, it can only be used
|
| libxt_SECMARK.man | 8 table). The mark is 32 bits wide.
|
| /external/libvpx/libvpx/vp9/decoder/ |
| vp9_read_bit_buffer.c | 30 int vp9_rb_read_literal(struct vp9_read_bit_buffer *rb, int bits) {
32 for (bit = bits - 1; bit >= 0; bit--)
38 int bits) {
39 const int value = vp9_rb_read_literal(rb, bits);
|
| /external/llvm/include/llvm/ADT/ |
| SparseBitVector.h | 30 /// storing the elements that have non-zero bits set. In order to make this
37 /// enormous amounts of time with a large amount of bits. Other structures that
58 BitWord Bits[BITWORDS_PER_ELEMENT];
63 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
69 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
77 if (Bits[i] != RHS.Bits[i])
86 // Return the bits that make up word Idx in our element.
89 return Bits[Idx];
98 if (Bits[i]
[all...] |
| /external/llvm/test/Assembler/ |
| 2007-03-19-NegValue.ll | 1 ; Test whether negative values > 64 bits retain their negativeness.
|
| /external/llvm/test/Bitcode/ |
| mdstring-high-bits.ll | 3 ; PR21882: confirm we don't crash when high bits are set in a character in a
|
| /external/llvm/test/CodeGen/AArch64/ |
| arm64-AnInfiniteLoopInDAGCombine.ll | 11 ; an optimization to replace unused bits with undefined bits, we remove
12 ; the (1) optimization (It doesn't make sense to replace undefined bits
13 ; with signed bits).
|
| /external/llvm/test/MC/Disassembler/SystemZ/ |
| trunc-02.txt | 2 # If the top bits are 0b10, the instruction must be 4 bytes long.
|
| /external/llvm/test/TableGen/ |
| ifbit.td | 9 bits<1> d = !if(b, 0, 1);
|
| /external/valgrind/memcheck/tests/vbit-test/ |
| TODO | 2 defined, i.e. all v-bits 0.
|
| /external/vixl/src/vixl/a64/ |
| decoder-a64.cc | 34 if (instr->Bits(28, 27) == 0) {
37 switch (instr->Bits(27, 24)) {
160 VIXL_ASSERT(instr->Bits(27, 24) == 0x0);
169 VIXL_ASSERT((instr->Bits(27, 24) == 0x4) ||
170 (instr->Bits(27, 24) == 0x5) ||
171 (instr->Bits(27, 24) == 0x6) ||
172 (instr->Bits(27, 24) == 0x7) );
174 switch (instr->Bits(31, 29)) {
205 if ((instr->Bits(4, 2) != 0) ||
219 if (instr->Bits(23, 22) == 0)
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/decoder/ |
| vp9_read_bit_buffer.c | 30 int vp9_rb_read_literal(struct vp9_read_bit_buffer *rb, int bits) {
32 for (bit = bits - 1; bit >= 0; bit--)
38 int bits) {
39 const int value = vp9_rb_read_literal(rb, bits);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/bits/ |
| ipctypes.h | 0 /* bits/ipctypes.h -- Define some types used by SysV IPC/MSG/SHM. Generic.
21 * Never include <bits/ipctypes.h> directly.
27 #include <bits/types.h>
37 #endif /* bits/ipctypes.h */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/gnu/ |
| stubs.h | 4 #include <bits/wordsize.h>
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ |
| locale | 38 #include <bits/localefwd.h>
39 #include <bits/locale_classes.h>
40 #include <bits/locale_facets.h>
41 #include <bits/locale_facets_nonio.h>
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| unordered_map | 35 #include <bits/stl_algobase.h>
36 #include <bits/allocator.h>
37 #include <bits/stl_function.h> // equal_to, _Identity, _Select1st
38 #include <bits/stringfwd.h>
|
| unordered_set | 35 #include <bits/stl_algobase.h>
36 #include <bits/allocator.h>
37 #include <bits/stl_function.h> // equal_to, _Identity, _Select1st
38 #include <bits/stringfwd.h>
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/i386-linux-gnu/bits/ |
| ipctypes.h | 0 /* bits/ipctypes.h -- Define some types used by SysV IPC/MSG/SHM. Generic.
21 * Never include <bits/ipctypes.h> directly.
27 #include <bits/types.h>
37 #endif /* bits/ipctypes.h */
|
