| /external/llvm/include/llvm/ADT/ |
| PackedVector.h | 30 static T getValue(const BitVectorTy &Bits, unsigned Idx) {
33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
37 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) {
40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i);
47 static T getValue(const BitVectorTy &Bits, unsigned Idx) {
50 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
51 if (Bits[(Idx << (BitNum-1)) + BitNum-1])
56 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) {
59 Bits.set((Idx << (BitNum-1)) + BitNum-1);
63 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i)
[all...] |
| /hardware/intel/common/libva/va/egl/ |
| va_egl.h | 13 * (lower 16bits is buffer index, upper 16bits
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/bits/ |
| a.out.h | 2 # error "Never use <bits/a.out.h> directly; include <a.out.h> instead."
5 #include <bits/wordsize.h>
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/x86_64-linux-gnu/bits/ |
| a.out.h | 2 # error "Never use <bits/a.out.h> directly; include <a.out.h> instead."
5 #include <bits/wordsize.h>
|
| /system/extras/perfprofd/quipper/original-kernel-headers/tools/perf/util/include/linux/ |
| types.h | 14 #define DECLARE_BITMAP(name,bits) \
15 unsigned long name[BITS_TO_LONGS(bits)]
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/endo/ |
| GLVTypeBParameters.java | 11 protected final int bits; field in class:GLVTypeBParameters
14 BigInteger g2, int bits)
22 this.bits = bits;
57 return bits;
|
| /external/llvm/lib/Target/Sparc/ |
| SparcInstrFormats.td | 12 field bits<32> Inst;
17 bits<2> op;
18 let Inst{31-30} = op; // Top two bits are the 'op' field
26 field bits<32> SoftFail = 0;
36 bits<3> op2;
37 bits<22> imm22;
45 class F2_1<bits<3> op2Val, dag outs, dag ins, string asmstr, list<dag> pattern>
47 bits<5> rd;
54 class F2_2<bits<3> op2Val, bit annul, dag outs, dag ins, string asmstr,
56 bits<4> cond
[all...] |
| /external/llvm/lib/Target/Mips/ |
| Mips32r6InstrFormats.td | 26 class OPGROUP<bits<6> Val> {
27 bits<6> Value = Val;
47 class OPCODE2<bits<2> Val> {
48 bits<2> Value = Val;
54 class OPCODE3<bits<3> Val> {
55 bits<3> Value = Val;
59 class OPCODE5<bits<5> Val> {
60 bits<5> Value = Val;
78 class OPCODE6<bits<6> Val> {
79 bits<6> Value = Val
[all...] |
| /external/compiler-rt/lib/builtins/ |
| popcountsi2.c | 17 /* Returns: count of 1 bits */
24 /* Every 2 bits holds the sum of every pair of bits */
26 /* Every 4 bits holds the sum of every 4-set of bits (3 significant bits) */
28 /* Every 8 bits holds the sum of every 8-set of bits (4 significant bits) */
30 /* The lower 16 bits hold two 8 bit sums (5 significant bits).*
[all...] |
| /external/linux-tools-perf/src/include/linux/ |
| hash.h | 27 #define hash_long(val, bits) hash_32(val, bits)
29 #define hash_long(val, bits) hash_64(val, bits)
35 static __always_inline u64 hash_64(u64 val, unsigned int bits)
39 /* Sigh, gcc can't optimise this alone like it does for 32 bits. */
54 /* High bits are more random, so use them. */
55 return hash >> (64 - bits);
58 static inline u32 hash_32(u32 val, unsigned int bits)
63 /* High bits are more random, so use them. *
[all...] |
| /external/webp/src/utils/ |
| bit_reader_inl.h | 38 #if (BITS > 32)
40 #elif (BITS > 16)
42 #elif (BITS > 8)
57 // makes sure br->value_ has at least BITS bits worth of data
60 // Read 'BITS' bits at a time if possible.
63 bit_t bits; local
84 br->buf_ += BITS >> 3;
86 #if (BITS > 32
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| MiniEnumSet.java | 31 private long bits; field in class:MiniEnumSet
48 * The bits yet to be returned for bits. As values from the current index are returned,
49 * their bits are zeroed out.
51 private long currentBits = bits;
103 bits = 0;
110 long oldBits = bits;
113 bits = newBits;
130 long oldBits = bits;
131 long newBits = oldBits | miniSet.bits;
[all...] |
| HugeEnumSet.java | 30 private long[] bits; field in class:HugeEnumSet
44 bits = new long[(enums.length + BIT_IN_LONG - 1) / BIT_IN_LONG];
50 * The bits yet to be returned for the long in bits[index]. As values from the current index
51 * are returned, their bits are zeroed out. When this reaches zero, the index must be
54 private long currentBits = bits[0];
57 * The index into HugeEnumSet.bits of the next value to return.
83 } else if (++index < bits.length) {
84 currentBits = bits[index];
126 long oldBits = bits[index]
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/sets/ |
| ANTLRBitSetTest.m | 23 STAssertEquals(actual, expected, @"There should be three bits set in bitvector. But I have %d", actual);
29 AMutableArray *bits = [AMutableArray arrayWithCapacity:10];
30 [bits addObject:[NSNumber numberWithBool:YES]];
31 [bits addObject:[NSNumber numberWithBool:YES]];
32 [bits addObject:[NSNumber numberWithBool:NO]];
33 [bits addObject:[NSNumber numberWithBool:YES]];
34 [bits addObject:[NSNumber numberWithBool:NO]];
35 [bits addObject:[NSNumber numberWithBool:YES]];
36 STAssertTrue([[bits objectAtIndex:0] boolValue], @"Value at index 0 was not true");
37 STAssertTrue([[bits objectAtIndex:1] boolValue], @"Value at index 1 was not true")
[all...] |
| /external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/ |
| BitSet.pm | 14 # number of bits / long
15 Readonly my $BITS => 64;
16 sub BITS { return $BITS }
26 Readonly my $MOD_MASK => BITS - 1;
30 has 'bits' => (
46 my $bits;
48 # Construct a bitset of size one word (64 bits)
49 $bits = '0' x BITS;
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ |
| regex | 35 # include <bits/c++0x_warning.h>
55 #include <bits/range_access.h>
56 #include <bits/regex_constants.h>
57 #include <bits/regex_error.h>
58 #include <bits/regex_cursor.h>
59 #include <bits/regex_nfa.h>
60 #include <bits/regex_compiler.h>
61 #include <bits/regex_grep_matcher.h>
62 #include <bits/regex.h>
|
| unordered_map | 35 # include <bits/c++0x_warning.h>
42 #include <bits/stl_algobase.h>
43 #include <bits/allocator.h>
44 #include <bits/alloc_traits.h>
45 #include <bits/stl_function.h> // equal_to, _Identity, _Select1st
46 #include <bits/functional_hash.h>
47 #include <bits/hashtable.h>
48 #include <bits/unordered_map.h>
49 #include <bits/range_access.h>
|
| unordered_set | 35 # include <bits/c++0x_warning.h>
42 #include <bits/stl_algobase.h>
43 #include <bits/allocator.h>
44 #include <bits/alloc_traits.h>
45 #include <bits/stl_function.h> // equal_to, _Identity, _Select1st
46 #include <bits/functional_hash.h>
47 #include <bits/hashtable.h>
48 #include <bits/unordered_set.h>
49 #include <bits/range_access.h>
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ |
| regex | 35 # include <bits/c++0x_warning.h>
55 #include <bits/range_access.h>
56 #include <bits/regex_constants.h>
57 #include <bits/regex_error.h>
58 #include <bits/regex_cursor.h>
59 #include <bits/regex_nfa.h>
60 #include <bits/regex_compiler.h>
61 #include <bits/regex_grep_matcher.h>
62 #include <bits/regex.h>
|
| unordered_map | 35 # include <bits/c++0x_warning.h>
42 #include <bits/stl_algobase.h>
43 #include <bits/allocator.h>
44 #include <bits/alloc_traits.h>
45 #include <bits/stl_function.h> // equal_to, _Identity, _Select1st
46 #include <bits/functional_hash.h>
47 #include <bits/hashtable.h>
48 #include <bits/unordered_map.h>
49 #include <bits/range_access.h>
|
| unordered_set | 35 # include <bits/c++0x_warning.h>
42 #include <bits/stl_algobase.h>
43 #include <bits/allocator.h>
44 #include <bits/alloc_traits.h>
45 #include <bits/stl_function.h> // equal_to, _Identity, _Select1st
46 #include <bits/functional_hash.h>
47 #include <bits/hashtable.h>
48 #include <bits/unordered_set.h>
49 #include <bits/range_access.h>
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ |
| regex | 35 # include <bits/c++0x_warning.h>
55 #include <bits/range_access.h>
56 #include <bits/regex_constants.h>
57 #include <bits/regex_error.h>
58 #include <bits/regex_cursor.h>
59 #include <bits/regex_nfa.h>
60 #include <bits/regex_compiler.h>
61 #include <bits/regex_grep_matcher.h>
62 #include <bits/regex.h>
|
| unordered_map | 35 # include <bits/c++0x_warning.h>
42 #include <bits/stl_algobase.h>
43 #include <bits/allocator.h>
44 #include <bits/alloc_traits.h>
45 #include <bits/stl_function.h> // equal_to, _Identity, _Select1st
46 #include <bits/functional_hash.h>
47 #include <bits/hashtable.h>
48 #include <bits/unordered_map.h>
49 #include <bits/range_access.h>
|
| unordered_set | 35 # include <bits/c++0x_warning.h>
42 #include <bits/stl_algobase.h>
43 #include <bits/allocator.h>
44 #include <bits/alloc_traits.h>
45 #include <bits/stl_function.h> // equal_to, _Identity, _Select1st
46 #include <bits/functional_hash.h>
47 #include <bits/hashtable.h>
48 #include <bits/unordered_set.h>
49 #include <bits/range_access.h>
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ |
| regex | 35 # include <bits/c++0x_warning.h>
55 #include <bits/range_access.h>
56 #include <bits/regex_constants.h>
57 #include <bits/regex_error.h>
58 #include <bits/regex_cursor.h>
59 #include <bits/regex_nfa.h>
60 #include <bits/regex_compiler.h>
61 #include <bits/regex_grep_matcher.h>
62 #include <bits/regex.h>
|
