Lines Matching defs:A1
1408 APInt A0(Bits, 1, true), A1(Bits, 0, true);
1416 APInt A2 = A0 - Q*A1; A0 = A1; A1 = A2;
1423 X = AM.slt(0) ? -A1 : A1;
2035 bool DependenceInfo::symbolicRDIVtest(const SCEV *A1, const SCEV *A2,
2041 LLVM_DEBUG(dbgs() << "\t A1 = " << *A1);
2042 LLVM_DEBUG(dbgs() << ", type = " << *A1->getType() << "\n");
2046 const SCEV *N1 = collectUpperBound(Loop1, A1->getType());
2047 const SCEV *N2 = collectUpperBound(Loop2, A1->getType());
2054 if (SE->isKnownNonNegative(A1)) {
2056 // A1 >= 0 && A2 >= 0
2059 const SCEV *A1N1 = SE->getMulExpr(A1, N1);
2060 LLVM_DEBUG(dbgs() << "\t A1*N1 = " << *A1N1 << "\n");
2080 const SCEV *A1N1 = SE->getMulExpr(A1, N1);
2083 LLVM_DEBUG(dbgs() << "\t A1*N1 - A2*N2 = " << *A1N1_A2N2 << "\n");
2096 else if (SE->isKnownNonPositive(A1)) {
2101 const SCEV *A1N1 = SE->getMulExpr(A1, N1);
2104 LLVM_DEBUG(dbgs() << "\t A1*N1 - A2*N2 = " << *A1N1_A2N2 << "\n");
2120 const SCEV *A1N1 = SE->getMulExpr(A1, N1);
2121 LLVM_DEBUG(dbgs() << "\t A1*N1 = " << *A1N1 << "\n");