| /external/llvm/unittests/ADT/ |
| APSIntTest.cpp | 29 const uint64_t *Bits = Wide.getRawData();
32 EXPECT_EQ(Bits, D.getRawData()); // Verify that "Wide" was really moved.
38 Bits = Wide.getRawData();
41 EXPECT_EQ(Bits, A.getRawData()); // Verify that "Wide" was really moved.
|
| /prebuilts/go/darwin-x86/src/go/internal/gccgoimporter/testdata/ |
| conversions.go | 5 const Bits = Units("bits")
|
| /prebuilts/go/linux-x86/src/go/internal/gccgoimporter/testdata/ |
| conversions.go | 5 const Bits = Units("bits")
|
| /dalvik/dx/junit-tests/com/android/dx/util/ |
| BitsTest.java | 23 assertEquals(label(0), 0, Bits.makeBitSet(0).length);
26 assertEquals(label(i), 1, Bits.makeBitSet(i).length);
30 assertEquals(label(i), 2, Bits.makeBitSet(i).length);
38 assertEquals(label(i), expect, Bits.makeBitSet(i).length);
49 Bits.getMax(new int[expect]));
54 int[] bits = Bits.makeBitSet(100); local
57 assertFalse(label(i), Bits.get(bits, i));
62 int[] bits = Bits.makeBitSet(100) local
73 int[] bits = Bits.makeBitSet(100); local
86 int[] bits = Bits.makeBitSet(50); local
103 int[] bits = Bits.makeBitSet(100); local
131 int[] bits = Bits.makeBitSet(100); local
146 int[] bits = Bits.makeBitSet(100); local
171 int[] bits = Bits.makeBitSet(i); local
190 int[] bits = Bits.makeBitSet(i); local
213 int[] bits = new int[100]; local
221 int[] bits = new int[100]; local
229 int[] bits = new int[100]; local
237 int[] bits = new int[100]; local
248 int[] bits = new int[100]; local
259 int[] bits = new int[100]; local
270 int[] bits = new int[100]; local
278 int[] bits = new int[100]; local
289 int[] bits = new int[100]; local
[all...] |
| /external/freetype/src/gzip/ |
| inftrees.h | 22 Byte Exop; /* number of extra bits or operation */
23 Byte Bits; /* number of bits in this code or subcode */
40 uIntf *, /* bits tree desired/actual depth */
41 inflate_huft * FAR *, /* bits tree result */
|
| /prebuilts/go/darwin-x86/src/math/big/ |
| bits_test.go | 5 // This file implements the Bits type used for testing Float operations
17 // A Bits value b represents a finite floating-point number x of the form
22 // used to form fractions. A Bits value is normalized if each b[i] occurs at
23 // most once. For instance Bits{0, 0, 1} is not normalized but represents the
24 // same floating-point number as Bits{2}, which is normalized. The zero (nil)
25 // value of Bits is a ready to use Bits value and represents the value 0.
26 type Bits []int
28 func (x Bits) add(y Bits) Bits
[all...] |
| /prebuilts/go/linux-x86/src/math/big/ |
| bits_test.go | 5 // This file implements the Bits type used for testing Float operations
17 // A Bits value b represents a finite floating-point number x of the form
22 // used to form fractions. A Bits value is normalized if each b[i] occurs at
23 // most once. For instance Bits{0, 0, 1} is not normalized but represents the
24 // same floating-point number as Bits{2}, which is normalized. The zero (nil)
25 // value of Bits is a ready to use Bits value and represents the value 0.
26 type Bits []int
28 func (x Bits) add(y Bits) Bits
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/util/ |
| BitIntSet.java | 27 int[] bits; field in class:BitIntSet
35 bits = Bits.makeBitSet(max);
41 Bits.set(bits, value, true);
50 if (value >= Bits.getMax(bits)) {
51 int[] newBits = Bits.makeBitSet(
52 Math.max(value + 1, 2 * Bits.getMax(bits)));
[all...] |
| /dalvik/dx/src/com/android/dx/util/ |
| BitIntSet.java | 27 int[] bits; field in class:BitIntSet
35 bits = Bits.makeBitSet(max);
42 Bits.set(bits, value, true);
51 if (value >= Bits.getMax(bits)) {
52 int[] newBits = Bits.makeBitSet(
53 Math.max(value + 1, 2 * Bits.getMax(bits)));
[all...] |
| /libcore/ojluni/src/main/java/java/nio/ |
| HeapByteBuffer.java | 197 return Bits.getChar(this, ix(nextGetIndex(2)), bigEndian);
202 return Bits.getChar(this, ix(checkIndex(i, 2)), bigEndian);
207 return Bits.getChar(this, ix(i), bigEndian);
220 Bits.putChar(this, ix(nextPutIndex(2)), x, bigEndian);
229 Bits.putChar(this, ix(checkIndex(i, 2)), x, bigEndian);
235 Bits.putChar(this, ix(i), x, bigEndian);
258 return Bits.getShort(this, ix(nextGetIndex(2)), bigEndian);
263 return Bits.getShort(this, ix(checkIndex(i, 2)), bigEndian);
268 return Bits.getShort(this, ix(i), bigEndian);
281 Bits.putShort(this, ix(nextPutIndex(2)), x, bigEndian)
[all...] |
| /external/swiftshader/third_party/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
57 BitWord Bits[BITWORDS_PER_ELEMENT];
62 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
68 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
76 if (Bits[i] != RHS.Bits[i])
85 // Return the bits that make up word Idx in our element.
88 return Bits[Idx];
97 if (Bits[i]
[all...] |
| /external/swiftshader/third_party/LLVM/lib/TableGen/ |
| TGParser.h | 35 std::vector<unsigned> Bits;
40 : Name(N), Bits(B), Value(V), Loc(L) {
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/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
55 BitWord Bits[BITWORDS_PER_ELEMENT];
59 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
65 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
73 if (Bits[i] != RHS.Bits[i])
82 // Return the bits that make up word Idx in our element.
85 return Bits[Idx];
94 if (Bits[i]
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/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
55 BitWord Bits[BITWORDS_PER_ELEMENT];
59 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
65 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
73 if (Bits[i] != RHS.Bits[i])
82 // Return the bits that make up word Idx in our element.
85 return Bits[Idx];
94 if (Bits[i]
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/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
55 BitWord Bits[BITWORDS_PER_ELEMENT];
59 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
65 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
73 if (Bits[i] != RHS.Bits[i])
82 // Return the bits that make up word Idx in our element.
85 return Bits[Idx];
94 if (Bits[i]
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/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
55 BitWord Bits[BITWORDS_PER_ELEMENT];
59 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
65 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
73 if (Bits[i] != RHS.Bits[i])
82 // Return the bits that make up word Idx in our element.
85 return Bits[Idx];
94 if (Bits[i]
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/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
55 BitWord Bits[BITWORDS_PER_ELEMENT];
59 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
65 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
73 if (Bits[i] != RHS.Bits[i])
82 // Return the bits that make up word Idx in our element.
85 return Bits[Idx];
94 if (Bits[i]
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/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
55 BitWord Bits[BITWORDS_PER_ELEMENT];
59 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
65 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
73 if (Bits[i] != RHS.Bits[i])
82 // Return the bits that make up word Idx in our element.
85 return Bits[Idx];
94 if (Bits[i]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/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
55 BitWord Bits[BITWORDS_PER_ELEMENT];
59 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
65 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
73 if (Bits[i] != RHS.Bits[i])
82 // Return the bits that make up word Idx in our element.
85 return Bits[Idx];
94 if (Bits[i]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/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
55 BitWord Bits[BITWORDS_PER_ELEMENT];
59 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
65 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
73 if (Bits[i] != RHS.Bits[i])
82 // Return the bits that make up word Idx in our element.
85 return Bits[Idx];
94 if (Bits[i]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/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
55 BitWord Bits[BITWORDS_PER_ELEMENT];
59 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
65 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
73 if (Bits[i] != RHS.Bits[i])
82 // Return the bits that make up word Idx in our element.
85 return Bits[Idx];
94 if (Bits[i]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/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
55 BitWord Bits[BITWORDS_PER_ELEMENT];
59 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
65 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
73 if (Bits[i] != RHS.Bits[i])
82 // Return the bits that make up word Idx in our element.
85 return Bits[Idx];
94 if (Bits[i]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/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
55 BitWord Bits[BITWORDS_PER_ELEMENT];
59 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
65 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
73 if (Bits[i] != RHS.Bits[i])
82 // Return the bits that make up word Idx in our element.
85 return Bits[Idx];
94 if (Bits[i]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/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
55 BitWord Bits[BITWORDS_PER_ELEMENT];
59 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
65 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
73 if (Bits[i] != RHS.Bits[i])
82 // Return the bits that make up word Idx in our element.
85 return Bits[Idx];
94 if (Bits[i]
[all...] |
| /device/linaro/bootloader/edk2/ArmPlatformPkg/Drivers/PL011Uart/ |
| PL011Uart.c | 54 @param DataBits The number of data bits in each character.
56 of stop bits per character.
57 If the device does not support stop bits, the
129 // Data Bits
151 // Stop Bits
163 // Only 1 or 2 stop bits are supported
221 // No parity, 1 stop, no fifo, 8 data bits
242 @param[in] Control The following bits are taken into account :
257 @retval RETURN_SUCCESS The new control bits were set on the device.
268 UINT32 Bits;
[all...] |
