/external/llvm/test/MC/Mips/ |
H A D | micromips-diagnostic-fixup.s | 8 nop # This instr makes the branch too long to fit into a 17-bit offset
|
H A D | mips-diagnostic-fixup.s | 8 nop # This instr makes the branch too long to fit into a 18-bit offset
|
/external/chromium_org/third_party/icu/source/test/letest/ |
H A D | cmaps.cpp | 19 // Finds the high bit by binary searching 24 le_uint8 bit = 0; local 28 bit += 16; 33 bit += 8; 38 bit += 4; 43 bit += 2; 48 bit += 1; 51 return bit; 214 le_uint8 bit = highBit(nGroups); local 215 fPower = 1 << bit; [all...] |
/external/chromium_org/third_party/icu/source/test/perf/leperf/ |
H A D | cmaps.cpp | 19 // Finds the high bit by binary searching 24 le_uint8 bit = 0; local 28 bit += 16; 33 bit += 8; 38 bit += 4; 43 bit += 2; 48 bit += 1; 51 return bit; 214 le_uint8 bit = highBit(nGroups); local 215 fPower = 1 << bit; [all...] |
/external/compiler-rt/lib/sanitizer_common/tests/ |
H A D | sanitizer_bitvector_test.cc | 94 uptr bit = ((uptr)my_rand() % bv.size()); local 95 EXPECT_EQ(bv.getBit(bit), s.count(bit) == 1); 98 EXPECT_EQ(bv.setBit(bit), s.insert(bit).second); 102 s.erase(bit); 103 EXPECT_EQ(bv.clearBit(bit), old_size > s.size()); 106 EXPECT_EQ(bv.getBit(bit), s.count(bit) == 1);
|
/external/icu/icu4c/source/test/letest/ |
H A D | cmaps.cpp | 19 // Finds the high bit by binary searching 24 le_uint8 bit = 0; local 28 bit += 16; 33 bit += 8; 38 bit += 4; 43 bit += 2; 48 bit += 1; 51 return bit; 214 le_uint8 bit = highBit(nGroups); local 215 fPower = 1 << bit; [all...] |
/external/icu/icu4c/source/test/perf/leperf/ |
H A D | cmaps.cpp | 19 // Finds the high bit by binary searching 24 le_uint8 bit = 0; local 28 bit += 16; 33 bit += 8; 38 bit += 4; 43 bit += 2; 48 bit += 1; 51 return bit; 214 le_uint8 bit = highBit(nGroups); local 215 fPower = 1 << bit; [all...] |
/external/chromium_org/net/quic/crypto/ |
H A D | strike_register.cc | 164 // Find the best match to |value| in the crit-bit tree. The best match is 196 // Now we need to find the first bit where we differ from |best_match|. 207 // to find the most significant differing bit. We could do this with a simple 213 // Now this bit trick results in all the bits set, except the original 218 // have the critical bit set, the result is the same as |new_other_bits|. If 237 // store the child indexes in the top 24-bits of a 32-bit word and, to keep 396 // An internal node in a crit-bit tree always has exactly two children. 454 unsigned bit = 0; local 457 bit = 0; 460 bit 502 unsigned bit = i->first % 8; local [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | ConvexHull_Test.cpp | 247 int pt, bit; local 272 for (bit = 0; bit < 4; ++bit) { 273 if (pts & 1 << bit) { 277 if (order[pt] == bit) { 280 if (cubic[order[pt]] == cubic[bit]) { 281 pts |= 1 << bit; 285 for (bit = 0; bit < [all...] |
/external/skia/experimental/Intersection/ |
H A D | ConvexHull_Test.cpp | 247 int pt, bit; local 272 for (bit = 0; bit < 4; ++bit) { 273 if (pts & 1 << bit) { 277 if (order[pt] == bit) { 280 if (cubic[order[pt]] == cubic[bit]) { 281 pts |= 1 << bit; 285 for (bit = 0; bit < [all...] |
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
H A D | BitSet.as | 90 * @param bit element that must fit in set 92 public function growToInclude(bit:int):void { 93 var newSize:int = Math.max(bits.length << 1, numWordsToHold(bit)); 134 for (var bit:int = BITS - 1; bit >= 0; bit--) { 135 if ((word & (1 << bit)) != 0) { 234 private static function wordNumber(bit:uint):uint { 235 return bit >> LOG_BITS; // bit / BIT [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
H A D | BitSet.cs | 139 * <param name="bit">element that must fit in set</param> 141 public void GrowToInclude(int bit) { argument 142 int newSize = Math.Max(_bits.Length << 1, NumWordsToHold(bit)); 181 for (int bit = BITS - 1; bit >= 0; bit--) { 182 if ((word & (1UL << bit)) != 0) { 288 private static int WordNumber(int bit) { argument 289 return bit >> LOG_BITS; // bit / BIT [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
H A D | BitSet.cs | 154 * <param name="bit">element that must fit in set</param> 156 public void GrowToInclude( int bit ) 158 int newSize = Math.Max( _bits.Length << 1, NumWordsToHold( bit ) ); 207 for ( int bit = BITS - 1; bit >= 0; bit-- ) 209 if ( ( word & ( 1UL << bit ) ) != 0 ) 340 private static int WordNumber( int bit ) 342 return bit >> LOG_BITS; // bit / BIT [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
H A D | BitSet.java | 127 * @param bit element that must fit in set 129 public void growToInclude(int bit) { argument 130 int newSize = Math.max(bits.length << 1, numWordsToHold(bit)); 184 for (int bit = BITS - 1; bit >= 0; bit--) { 185 if ((word & (1L << bit)) != 0) { 292 private final static int wordNumber(int bit) { argument 293 return bit >> LOG_BITS; // bit / BIT [all...] |
/external/chromium_org/third_party/libwebp/enc/ |
H A D | cost.h | 51 extern const uint16_t VP8EntropyCost[256]; // 8bit fixed-point log(p) 54 static WEBP_INLINE int VP8BitCost(int bit, uint8_t proba) { argument 55 return !bit ? VP8EntropyCost[proba] : VP8EntropyCost[255 - proba];
|
/external/clang/test/Sema/ |
H A D | statements.c | 38 void test11(int bit) { 39 switch (bit)
|
/external/e2fsprogs/lib/blkid/ |
H A D | blkid_types.h.in | 33 ?==error: undefined 16 bit type 47 ?==error: undefined 16 bit type 65 ?== error: undefined 32 bit type 83 ?== error: undefined 32 bit type
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | ext2_types.h.in | 33 ?==error: undefined 16 bit type 47 ?==error: undefined 16 bit type 65 ?== error: undefined 32 bit type 83 ?== error: undefined 32 bit type
|
/external/icu/icu4c/source/layout/ |
H A D | CoverageTables.cpp | 45 le_uint8 bit = OpenTypeUtilities::highBit(count); local 46 le_uint16 power = 1 << bit;
|
/external/llvm/test/MC/ARM/ |
H A D | elf-thumbfunc-reloc.s | 1 @@ test st_value bit 0 of thumb function 31 @@ the thumb bit.
|
H A D | elf-thumbfunc.s | 1 @@ test st_value bit 0 of thumb function 17 @@ make sure foo and bar are thumb function: bit 0 = 1 (st_value)
|
H A D | fp-const-errors.s | 3 @ Test for floating point constants that are out of the 8-bit encoded value range 10 @ Test that vmov.f instructions do not accept an 8-bit encoded float as an operand
|
/external/webp/src/enc/ |
H A D | cost.h | 51 extern const uint16_t VP8EntropyCost[256]; // 8bit fixed-point log(p) 54 static WEBP_INLINE int VP8BitCost(int bit, uint8_t proba) { argument 55 return !bit ? VP8EntropyCost[proba] : VP8EntropyCost[255 - proba];
|
/external/valgrind/main/memcheck/tests/ |
H A D | origin3-no.stderr.exp | 2 Undef 1 of 8 (8 bit undef) 20 Undef 3 of 8 (32 bit undef) 30 Undef 4 of 8 (32 bit undef, unaligned) 40 Undef 5 of 8 (32 bit undef, modified) 50 Undef 6 of 8 (32 bit undef, unaligned, strange, #1) 59 Undef 7 of 8 (32 bit undef, unaligned, strange, #2) 68 Undef 8 of 8 (32 bit undef, unaligned, strange, #3)
|
/external/chromium_org/media/cast/test/utility/ |
H A D | audio_utility.cc | 64 // EncodeTimestamp stores a 16-bit number as frequencies in a sample. 69 // Each bit of the timestamp is stored as a frequency, where the 86 // will only differ in one bit, we should never get numbers out 160 for (size_t bit = 0; success && bit < kNumBits; bit++) { 164 kBaseFrequency * (bit + 1)); 166 // Zero bit, no action 169 // One bit 170 gray_coded |= 1 << bit; [all...] |