| /external/v8/src/mips/ |
| disasm-mips.cc | 288 int32_t code = instr->Bits(25, 6);
299 int32_t code = instr->Bits(15, 6);
456 // which will just print "unknown" of the instruction bits.
|
| simulator-mips.cc | 127 uint32_t code = instr->Bits(25, 6);
161 uint32_t code = instr->Bits(25, 6);
[all...] |
| /external/llvm/include/llvm/ADT/ |
| APInt.h | 52 /// integer sizes and large integer value types such as 3-bits, 15-bits, or more
53 /// than 64-bits of precision. APInt provides a variety of arithmetic operators
76 unsigned BitWidth; ///< The number of bits in this APInt.
81 uint64_t VAL; ///< Used to store the <= 64 bits integer value.
82 uint64_t *pVal; ///< Used to store the >64 bits integer value.
87 /// Bits in a word
97 APInt(uint64_t* val, unsigned bits) : BitWidth(bits), pVal(val) { }
99 /// @returns true if the number of bits <= 64, false otherwise
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/video/bwindow/ |
| SDL_sysyuv.cc | 224 overlay->pixels[0] = (Uint8 *)bbitmap->Bits();
|
| SDL_sysvideo.cc | 563 current->pixels = (void *)bbitmap->Bits();
|
| /external/clang/lib/AST/ |
| ItaniumMangle.cpp | 182 unsigned Bits;
187 FunctionTypeDepthState() : Bits(0) {}
191 return Bits >> 1;
196 return Bits & InResultTypeMask;
201 Bits = (Bits & ~InResultTypeMask) + 2;
206 Bits |= InResultTypeMask;
210 Bits &= ~InResultTypeMask;
215 Bits = saved.Bits;
[all...] |
| ExprCXX.cpp | 776 unsigned Bits = 0;
778 Bits |= Capture_Implicit;
786 Bits |= Capture_ByCopy;
792 VarAndBits.setInt(Bits);
[all...] |
| Type.cpp | 92 unsigned Bits = Context.getTypeSize(Context.getSizeType());
94 // GCC appears to only allow 63 bits worth of address space when compiling
96 if (Bits == 64)
97 --Bits;
99 return Bits;
[all...] |
| /external/llvm/lib/TableGen/ |
| TGParser.cpp | 100 // If we are assigning to a subset of the bits in the value... then we must be
108 + "' is not a bits type");
110 // Convert the incoming value to a bits type of the appropriate size...
123 // Loop over bits, assigning values as appropriate.
678 /// Type ::= BITS '<' INTVAL '>' // bits<x> type
695 case tgtok::Bits: {
696 if (Lex.Lex() != tgtok::less) { // Eat 'bits'
697 TokError("expected '<' after bits type");
701 TokError("expected integer in bits<n> type")
[all...] |
| /external/llvm/lib/Target/CellSPU/ |
| SPUISelDAGToDAG.cpp | 747 // Take advantage of the fact that the upper 32 bits are in the
925 unsigned bits = unsigned(CN->getZExtValue()) & 7; local
984 unsigned bits = unsigned(CN->getZExtValue()) & 7; local
1074 unsigned bits = unsigned(CN->getZExtValue()) & 7; local
[all...] |
| /external/clang/lib/Serialization/ |
| ASTWriter.cpp | [all...] |
| ASTReader.cpp | 69 #define LANGOPT(Name, Bits, Default, Description) \
76 #define VALUE_LANGOPT(Name, Bits, Default, Description) \
83 #define ENUM_LANGOPT(Name, Type, Bits, Default, Description) \
90 #define BENIGN_LANGOPT(Name, Bits, Default, Description)
91 #define BENIGN_ENUM_LANGOPT(Name, Type, Bits, Default, Description)
530 unsigned Bits = ReadUnalignedLE16(d);
531 bool CPlusPlusOperatorKeyword = Bits & 0x01;
532 Bits >>= 1;
533 bool HasRevertedTokenIDToIdentifier = Bits & 0x01;
534 Bits >>= 1
[all...] |
| /external/llvm/include/llvm/Support/ |
| CommandLine.h | [all...] |
| /external/valgrind/main/VEX/priv/ |
| guest_x86_helpers.c | [all...] |
| /external/llvm/utils/TableGen/ |
| RegisterInfoEmitter.cpp | 453 // Width is the number of bits per hex number.
455 const BitVector &Bits,
459 for (unsigned i = 0, e = Bits.size(); i < e; i += Width) {
462 Value |= Bits.test(i + j) << j;
467 // Helper to emit a set of bits into a constant byte array.
618 // Default the scale to 0 if it can't be encoded in 4 bits.
704 << "Bits[] = {\n ";
729 << RC.getName() << ", " << RC.getName() << "Bits, "
730 << RC.getOrder().size() << ", sizeof(" << RC.getName() << "Bits), "
[all...] |
| /external/llvm/lib/CodeGen/ |
| LiveIntervalAnalysis.cpp | [all...] |
| /external/clang/lib/Frontend/ |
| CompilerInvocation.cpp | [all...] |
| /external/chromium/testing/gtest/test/ |
| gtest_unittest.cc | 369 // Tests that Unicode code-points that have 8 to 11 bits are encoded
384 // Tests that Unicode code-points that have 12 to 16 bits are encoded
398 // Tests in this group require a wchar_t to hold > 16 bits, and thus
402 // Tests that Unicode code-points that have 17 to 21 bits are encoded
441 // Tests that Unicode code-points that have 8 to 11 bits are encoded
454 // Tests that Unicode code-points that have 12 to 16 bits are encoded
480 // Tests that Unicode code-points that have 17 to 21 bits are encoded
[all...] |
| /external/gtest/test/ |
| gtest_unittest.cc | 369 // Tests that Unicode code-points that have 8 to 11 bits are encoded
384 // Tests that Unicode code-points that have 12 to 16 bits are encoded
398 // Tests in this group require a wchar_t to hold > 16 bits, and thus
402 // Tests that Unicode code-points that have 17 to 21 bits are encoded
441 // Tests that Unicode code-points that have 8 to 11 bits are encoded
454 // Tests that Unicode code-points that have 12 to 16 bits are encoded
480 // Tests that Unicode code-points that have 17 to 21 bits are encoded
[all...] |
| /external/libvorbis/doc/ |
| 02-bitpacking.tex | 10 bitstream in which bits are coded one-by-one by the encoder and then
12 decoder. Most current binary storage arrangements group bits into a
13 native word size of eight bits (octets), sixteen bits, thirty-two bits
22 'octet', that is, eight bits. This has not always been the case;
26 modern platforms, this is generally assumed to be eight bits (not
33 octet (eight bits) and a word to be a group of two, four or eight
34 bytes (16, 32 or 64 bits). Note however that the Vorbis bitpacking
44 end of the byte. Bits in a byte are numbered from zero at the LSb t
[all...] |
| /external/protobuf/gtest/test/ |
| gtest_unittest.cc | 346 // Tests that Unicode code-points that have 8 to 11 bits are encoded
357 // Tests that Unicode code-points that have 12 to 16 bits are encoded
369 // Tests in this group require a wchar_t to hold > 16 bits, and thus
373 // Tests that Unicode code-points that have 17 to 21 bits are encoded
412 // Tests that Unicode code-points that have 8 to 11 bits are encoded
424 // Tests that Unicode code-points that have 12 to 16 bits are encoded
449 // Tests that Unicode code-points that have 17 to 21 bits are encoded
[all...] |
| /external/chromium/testing/gmock/test/ |
| gmock-matchers_test.cc | [all...] |
| /external/valgrind/main/coregrind/m_syswrap/ |
| syswrap-darwin.c | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | [all...] |
| /external/libvpx/vp8/common/ppc/ |
| loopfilter_filters_altivec.asm | 32 ;# when we think of them as permutations of address bits: Concatenate a
34 ;# memory beginning at address zero. The low four bits 0...3 of the
36 ;# address bits select the register.
40 ;# still if the low-order bits of the register number correspond to
41 ;# conceptual address bits. We do this whenever reasonable.
44 ;# a 256-element block of memory. It takes 8 bits 0...7 to address this
46 ;# 0 with 4, 1 with 5, 2 with 6, and 3 with 7. Bits 0...3 index the
47 ;# column, which is interchanged with the row addressed by bits 4..7.
83 ;# Except for bits s and d, the other relationships between register
84 ;# number (= high-order part of address) bits are at the disposal o
[all...] |
