HomeSort by relevance Sort by last modified time
    Searched defs:Shift (Results 51 - 75 of 189) sorted by null

1 23 4 5 6 7 8

  /prebuilts/clang/host/darwin-x86/clang-4691093/include/clang/Tooling/ASTDiff/
ASTDiff.h 40 int Depth, Height, Shift = 0;
  /prebuilts/clang/host/linux-x86/clang-4579689/include/clang/Tooling/ASTDiff/
ASTDiff.h 40 int Depth, Height, Shift = 0;
  /prebuilts/clang/host/linux-x86/clang-4630689/include/clang/Tooling/ASTDiff/
ASTDiff.h 40 int Depth, Height, Shift = 0;
  /prebuilts/clang/host/linux-x86/clang-4639204/include/clang/Tooling/ASTDiff/
ASTDiff.h 40 int Depth, Height, Shift = 0;
  /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/Tooling/ASTDiff/
ASTDiff.h 40 int Depth, Height, Shift = 0;
  /device/linaro/bootloader/edk2/AppPkg/Applications/Sockets/WebServer/
HTTP.c 1190 INT32 Shift;
1201 Shift = (( Bits + 3 ) & ( ~3 )) - 4;
1202 while ( 0 <= Shift ) {
1206 Digit = (UINT32)(( Value >> Shift ) & 0xf );
1220 // Set the next shift
1222 Shift -= 4;
1250 INT32 Shift;
1262 Shift = 60;
1267 Digit = (UINT32)(( Value >> Shift ) & 0xf );
1275 if (( 0 != Digit ) || bDisplayZeros || ( 0 == Shift )) {
    [all...]
  /external/capstone/
MathExtras.h 106 unsigned Shift;
110 for (Shift = 32 >> 1; Shift; Shift >>= 1) {
111 uint32_t Tmp = Value >> Shift;
115 Count |= Shift;
144 unsigned Shift;
150 for (Shift = 64 >> 1; Shift; Shift >>= 1)
    [all...]
  /external/clang/lib/Format/
WhitespaceManager.cpp 169 int Shift = 0;
173 Shift = 0;
181 Shift = Column - Changes[i].StartOfTokenColumn;
182 Changes[i].Spaces += Shift;
185 assert(Shift >= 0);
186 Changes[i].StartOfTokenColumn += Shift;
188 Changes[i + 1].PreviousEndOfTokenColumn += Shift;
424 int Shift = 0;
426 Shift = Column - Changes[i].StartOfTokenColumn;
429 Shift = Changes[i].IndentationOffset
    [all...]
  /external/clang/lib/Tooling/Core/
Replacement.cpp 311 int Shift = 0;
313 unsigned Offset = R.getOffset() + Shift;
315 Shift += Length - R.getLength();
  /external/llvm/lib/ExecutionEngine/RuntimeDyld/Targets/
RuntimeDyldMachOARM.h 47 // Now we've got the shifted immediate, shift by 2, sign extend and ret.
274 unsigned Shift = (HalfDiffKindBits & 0x1) ? 16 : 0;
275 uint32_t FullImmVal = (Immediate << Shift) | (OtherHalf << (16 - Shift));
  /external/swiftshader/third_party/LLVM/lib/Archive/
ArchiveReader.cpp 24 unsigned Shift = 0;
30 Result |= (unsigned)((*At++) & 0x7F) << Shift;
31 Shift += 7;
  /external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/
InstCombineShifts.cpp 26 // See if we can fold away this shift.
40 // X shift (A srem B) -> X shift (A and B-1) iff B is a power of 2.
77 // If this is the opposite shift, we can directly reuse the input of the shift
79 // the value which means that we don't care if the shift has multiple uses.
80 // TODO: Handle opposite shift by exact value.
116 // We can often fold the shift into shifts-by-a-constant.
140 // We can often fold the shift into shifts-by-a-constant.
219 // If this is oversized composite shift, then unsigned shifts get 0
    [all...]
  /external/swiftshader/third_party/subzero/src/
IceTypes.cpp 148 int8_t Shift = typeWidthInBytesLog2(Ty);
149 return (Shift < 0) ? 0 : 1 << Shift;
IceTargetLoweringX8632.cpp 184 uint16_t Shift = 0;
189 Shift = Mem->getShift();
197 Func, Mem->getType(), RebasePtrR, Mem->getOffset(), T, Shift,
337 Addr->Shift = 0;
  /external/tensorflow/tensorflow/examples/android/jni/object_tracking/
geom.h 218 inline void Shift(const Point2f shift_amount) {
279 inline void Shift(const Point2f shift_amount) {
  /external/v8/src/
fixed-dtoa.cc 42 void Shift(int shift_amount) {
250 fractionals128.Shift(-exponent - 64);
  /prebuilts/go/darwin-x86/test/chan/
powser1.go 424 func Shift(c rat, U PS) PS {
555 split(Mul(Cmul(neg(z), U), Shift(z, ZZ[0])), ZZ)
powser2.go 438 func Shift(c *rat, U PS) PS {
569 split(Mul(Cmul(neg(z), U), Shift(z, ZZ[0])), ZZ)
  /prebuilts/go/linux-x86/test/chan/
powser1.go 424 func Shift(c rat, U PS) PS {
555 split(Mul(Cmul(neg(z), U), Shift(z, ZZ[0])), ZZ)
powser2.go 438 func Shift(c *rat, U PS) PS {
569 split(Mul(Cmul(neg(z), U), Shift(z, ZZ[0])), ZZ)
  /external/llvm/lib/Analysis/
BlockFrequencyInfoImpl.cpp 185 static uint64_t shiftRightAndRound(uint64_t N, int Shift) {
186 assert(Shift >= 0);
187 assert(Shift < 64);
188 if (!Shift)
190 return (N >> Shift) + (UINT64_C(1) & N >> (Shift - 1));
209 // Determine how much to shift right so that the total fits into 32-bits.
211 // If we shift at all, shift by 1 extra. Otherwise, the lower limit of 1
213 int Shift = 0
    [all...]
  /external/llvm/lib/MC/
MCAsmStreamer.cpp 819 uint64_t Shift = 64 - EmissionSize * 8;
820 assert(Shift < static_cast<uint64_t>(
823 ValueToEmit &= ~0ULL >> Shift;
    [all...]
  /external/llvm/lib/Target/Mips/MCTargetDesc/
MipsMCCodeEmitter.cpp 50 // If the D<shift> instruction has a shift amount that is greater
51 // than 31 (checked in calling routine), lower it to a D<shift>32 instruction
54 assert(Inst.getNumOperands() == 3 && "Invalid no. of operands for shift!");
57 int64_t Shift = Inst.getOperand(2).getImm();
58 if (Shift <= 31)
60 Shift -= 32;
63 Inst.getOperand(2).setImm(Shift);
68 llvm_unreachable("Unexpected shift instruction");
175 unsigned Shift = IsLittleEndian ? i * 8 : (Size - 1 - i) * 8
    [all...]
  /external/llvm/lib/Transforms/InstCombine/
InstCombineShifts.cpp 28 // See if we can fold away this shift.
42 // X shift (A srem B) -> X shift (A and B-1) iff B is a power of 2.
59 /// that have constant shift amounts.
86 // If the 2nd shift is bigger than the 1st, we can fold:
90 // Also check that the 2nd shift is valid (less than the type width) or we'll
124 // If this is the opposite shift, we can directly reuse the input of the shift
126 // the value which means that we don't care if the shift has multiple uses.
127 // TODO: Handle opposite shift by exact value
    [all...]
  /external/pdfium/fxjs/
cjs_eventhandler.cpp 586 bool CJS_EventHandler::Shift() const {

Completed in 1122 milliseconds

1 23 4 5 6 7 8