HomeSort by: relevance | last modified time | path
    Searched refs:NewX (Results 1 - 4 of 4) sorted by relevancy

  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/
FuzzerUtil.cpp 64 auto NewX = X;
65 NewX &= 127;
66 if (!isspace(NewX) && !isprint(NewX))
67 NewX = ' ';
68 Changed |= NewX != X;
69 X = NewX;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopIdiomRecognize.cpp 2331 // NewX is always safe to compute, because `LoopBackedgeTakenCount`
2333 Value *NewX = Builder.CreateShl(X, LoopBackedgeTakenCount);
2334 NewX->takeName(XCurr);
2335 if (auto *I = dyn_cast<Instruction>(NewX))
2351 // alternatively, we could check that NewX is INT_MIN (or BitPos is )
2353 NewXNext = Builder.CreateShl(NewX, ConstantInt::get(Ty, 1));
2363 XCurr->replaceUsesOutsideBlock(NewX, LoopHeaderBB);
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86ISelDAGToDAG.cpp 1920 SDValue NewX = DAG.getNode(ISD::ANY_EXTEND, DL, VT, X);
1921 insertDAGNode(DAG, N, NewX);
1922 X = NewX;
2029 SDValue NewX = DAG.getNode(ISD::ZERO_EXTEND, SDLoc(X), VT, X);
2030 insertDAGNode(DAG, N, NewX);
2031 X = NewX;
4022 SDValue NewX = CurDAG->getNode(ISD::ANY_EXTEND, dl, NVT, X);
4023 insertDAGNode(*CurDAG, SDValue(N, 0), NewX);
4024 X = NewX;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombineCompares.cpp 5491 Value *NewX = Builder.CreateLShr(X, Y, X->getName() + ".highbits");
5492 Constant *Zero = Constant::getNullValue(NewX->getType());
5493 return CmpInst::Create(Instruction::ICmp, NewPred, NewX, Zero);

Completed in 53 milliseconds