/prebuilts/go/darwin-x86/src/cmd/vendor/golang.org/x/arch/ppc64/ppc64asm/ |
field.go | 13 // Bits are counted from 0 from the MSB to 31 as the LSB.
|
/prebuilts/go/linux-x86/src/cmd/vendor/golang.org/x/arch/ppc64/ppc64asm/ |
field.go | 13 // Bits are counted from 0 from the MSB to 31 as the LSB.
|
/bionic/libc/arch-arm/krait/bionic/ |
strcmp.S | 35 #define MSB 0x000000ff 49 #define MSB 0xff000000
|
/prebuilts/go/darwin-x86/src/compress/lzw/ |
writer_test.go | 94 for _, order := range [...]Order{LSB, MSB} {
|
writer.go | 225 if e.order == MSB { 246 case MSB:
|
/prebuilts/go/linux-x86/src/compress/lzw/ |
writer_test.go | 94 for _, order := range [...]Order{LSB, MSB} {
|
writer.go | 225 if e.order == MSB { 246 case MSB:
|
/system/tpm/trunks/ftdi/ |
mpsse.h | 29 #define MSB 0x00
|
mpsse.c | 54 * @endianess - Specifies how data is clocked in/out (MSB, LSB). 81 * @endianess - Specifies how data is clocked in/out (MSB, LSB). 107 * @endianess - Specifies how data is clocked in/out (MSB, LSB). 833 if (mpsse->endianess == MSB) { 835 * In MSB mode, bits are sifted in from the left. If less than 8 bits were
|
/system/tpm/trunks/ |
trunks_ftdi_spi.cc | 167 mpsse_ = MPSSE(SPI0, ONE_MHZ, MSB);
|
/external/llvm/lib/Target/AArch64/ |
AArch64ISelDAGToDAG.cpp | [all...] |
/prebuilts/go/darwin-x86/src/math/ |
sqrt.go | 127 r := uint64(1 << (shift + 1)) // r = moving bit from MSB to LSB
|
/prebuilts/go/darwin-x86/src/runtime/ |
sqrt.go | 136 r := uint64(1 << (float64Shift + 1)) // r = moving bit from MSB to LSB
|
/prebuilts/go/linux-x86/src/math/ |
sqrt.go | 127 r := uint64(1 << (shift + 1)) // r = moving bit from MSB to LSB
|
/prebuilts/go/linux-x86/src/runtime/ |
sqrt.go | 136 r := uint64(1 << (float64Shift + 1)) // r = moving bit from MSB to LSB
|
/prebuilts/go/darwin-x86/src/compress/bzip2/ |
huffman.go | 103 // So branches are taken from the MSB downwards. This makes it easy to
|
/prebuilts/go/darwin-x86/src/crypto/sha1/ |
sha1.go | 206 t := nx - 56 // if nx < 56 then the MSB of t is one
|
/prebuilts/go/linux-x86/src/compress/bzip2/ |
huffman.go | 103 // So branches are taken from the MSB downwards. This makes it easy to
|
/prebuilts/go/linux-x86/src/crypto/sha1/ |
sha1.go | 206 t := nx - 56 // if nx < 56 then the MSB of t is one
|
/toolchain/binutils/binutils-2.27/opcodes/ |
mips-opc.c | 76 case 'B': MSB (5, 11, 1, TRUE, 32); /* (1 .. 32), 32-bit op */ 77 case 'C': MSB (5, 11, 1, FALSE, 32); /* (1 .. 32), 32-bit op */ 79 case 'F': MSB (5, 11, 33, TRUE, 64); /* (33 .. 64), 64-bit op */ 80 case 'G': MSB (5, 11, 33, FALSE, 64); /* (33 .. 64), 64-bit op */ 81 case 'H': MSB (5, 11, 1, FALSE, 64); /* (1 .. 32), 64-bit op */ 92 case 'S': MSB (5, 11, 0, FALSE, 63); /* (0 .. 31), 64-bit op */ 118 case 's': MSB (5, 11, 0, FALSE, 31); /* (0 .. 31) */ [all...] |
/hardware/qcom/gps/msm8909w_3100/android/location_api/ |
GnssAPIClient.cpp | 300 data |= IGnssCallback::Capabilities::MSB;
|
/hardware/qcom/gps/msm8998/android/location_api/ |
GnssAPIClient.cpp | 251 data |= IGnssCallback::Capabilities::MSB;
|
/prebuilts/go/darwin-x86/src/crypto/tls/ |
conn.go | 217 // if len(payload) >= (paddingLen - 1) then the MSB of t is zero 229 // if i <= paddingLen then the MSB of t is zero 610 // start with a uint16 length where the MSB is set and the first record [all...] |
/prebuilts/go/linux-x86/src/crypto/tls/ |
conn.go | 217 // if len(payload) >= (paddingLen - 1) then the MSB of t is zero 229 // if i <= paddingLen then the MSB of t is zero 610 // start with a uint16 length where the MSB is set and the first record [all...] |
/external/protobuf/js/binary/ |
arith.js | 107 * Test the MSB. 110 jspb.arith.UInt64.prototype.msb = function() { method in class:jspb.arith.UInt64 241 while (!divisor.msb()) {
|