| /libcore/luni/src/main/java/java/util/ |
| MiniEnumSet.java | 111 long newBits = oldBits | (1L << element.ordinal());
112 if (oldBits != newBits) {
113 bits = newBits;
131 long newBits = oldBits | miniSet.bits;
132 bits = newBits;
133 size = Long.bitCount(newBits);
134 return (oldBits != newBits);
177 long newBits = oldBits & ~miniSet.bits;
178 if (oldBits != newBits) {
179 bits = newBits;
[all...] |
| HugeEnumSet.java | 127 long newBits = oldBits | (1L << inBits);
128 if (oldBits != newBits) {
129 bits[index] = newBits;
150 long newBits = oldBits | hugeSet.bits[i];
151 if (oldBits != newBits) {
152 bits[i] = newBits;
153 size += Long.bitCount(newBits) - Long.bitCount(oldBits);
256 long newBits = oldBits & ~(1L << inBits);
257 if (oldBits != newBits) {
258 bits[index] = newBits;
[all...] |
| BitSet.java | 142 long[] newBits = new long[newLength];
143 System.arraycopy(bits, 0, newBits, 0, longCount);
144 this.bits = newBits;
271 long[] newBits = new long[lastArrayIndex - firstArrayIndex + 1];
274 newBits[0] = bits[firstArrayIndex] & lowMask;
275 newBits[newBits.length - 1] = bits[lastArrayIndex] & highMask;
279 newBits[i] = bits[firstArrayIndex + i];
284 int actualLen = newBits.length;
286 for (int i = 0; i < newBits.length; i++)
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/util/ |
| BitIntSet.java | 51 int[] newBits = Bits.makeBitSet(
53 System.arraycopy(bits, 0, newBits, 0, bits.length);
54 bits = newBits;
|
| /dalvik/dx/src/com/android/dx/util/ |
| BitIntSet.java | 51 int[] newBits = Bits.makeBitSet(
53 System.arraycopy(bits, 0, newBits, 0, bits.length);
54 bits = newBits;
|
| /external/antlr/src/org/antlr/runtime/ |
| BitSet.java | 131 long newbits[] = new long[newSize]; local
132 System.arraycopy(bits, 0, newbits, 0, bits.length);
133 bits = newbits;
155 long newbits[] = new long[nwords]; local
157 System.arraycopy(bits, 0, newbits, 0, n);
158 bits = newbits;
|
| /external/llvm/utils/TableGen/ |
| CodeEmitterGen.cpp | 45 SmallVector<Init *, 16> NewBits(numBits);
51 NewBits[bit] = BitSwap;
52 NewBits[bitSwapIdx] = OrigBit;
56 NewBits[middle] = BI->getBit(middle);
59 BitsInit *NewBI = BitsInit::get(NewBits);
|
| /external/llvm/include/llvm/ADT/ |
| SmallBitVector.h | 129 void setSmallBits(uintptr_t NewBits) {
130 setSmallRawBits((NewBits & ~(~uintptr_t(0) << getSmallSize())) |
250 uintptr_t NewBits = t ? ~uintptr_t(0) << getSmallSize() : 0;
252 setSmallBits(NewBits | getSmallBits());
|
| BitVector.h | 352 BitWord *NewBits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
353 std::memcpy(NewBits, RHS.Bits, Capacity * sizeof(BitWord));
357 Bits = NewBits;
|
| /external/llvm/lib/TableGen/ |
| Record.cpp | 129 SmallVector<Init *, 16> NewBits(Size);
132 NewBits[i] = UnsetInit::get();
134 return BitsInit::get(NewBits);
159 SmallVector<Init *, 16> NewBits(Size);
162 NewBits[i] = BitInit::get(Value & (1LL << i));
164 return BitsInit::get(NewBits);
177 SmallVector<Init *, 16> NewBits(Size);
180 NewBits[i] = VarBitInit::get(VI, i);
181 return BitsInit::get(NewBits);
201 SmallVector<Init *, 16> NewBits(Size)
[all...] |
| TGParser.cpp | 121 SmallVector<Init *, 16> NewBits(CurVal->getNumBits());
126 if (NewBits[Bit])
129 NewBits[Bit] = BInit->getBit(i);
133 if (NewBits[i] == 0)
134 NewBits[i] = CurVal->getBit(i);
136 V = BitsInit::get(NewBits);
[all...] |
| /external/dropbear/libtomcrypt/notes/ |
| tech0004.txt | 19 pool = hash(pool || newbits)
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineSimplifyDemanded.cpp | 447 APInt NewBits(APInt::getHighBitsSet(BitWidth, BitWidth - SrcBitWidth));
450 if ((NewBits & DemandedMask) != 0)
467 // If the input sign bit is known zero, or if the NewBits are not demanded
469 if (KnownZero[SrcBitWidth-1] || (NewBits & ~DemandedMask) == NewBits) {
474 KnownOne |= NewBits;
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| TargetLowering.cpp | [all...] |
| SelectionDAG.cpp | [all...] |
| DAGCombiner.cpp | [all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExprEngine.cpp | [all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolution.cpp | [all...] |
