Lines Matching refs:Query
68 struct Query {
86 Query(const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI,
90 Query(const Query &Q, const Value *NewExcl)
123 unsigned Depth, const Query &Q);
130 Query(DL, AC, safeCxtI(V, CxtI), DT));
149 unsigned Depth, const Query &Q);
156 Query(DL, AC, safeCxtI(V, CxtI), DT));
160 const Query &Q);
167 Query(DL, AC, safeCxtI(V, CxtI), DT));
170 static bool isKnownNonZero(Value *V, unsigned Depth, const Query &Q);
175 return ::isKnownNonZero(V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT));
193 // that only a single query is needed.
206 static bool isKnownNonEqual(Value *V1, Value *V2, const Query &Q);
211 return ::isKnownNonEqual(V1, V2, Query(DL, AC,
217 const Query &Q);
223 Query(DL, AC, safeCxtI(V, CxtI), DT));
226 static unsigned ComputeNumSignBits(Value *V, unsigned Depth, const Query &Q);
232 return ::ComputeNumSignBits(V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT));
238 unsigned Depth, const Query &Q) {
317 unsigned Depth, const Query &Q) {
521 const Query &Q) {
569 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
578 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
580 computeKnownBits(B, MaskKnownZero, MaskKnownOne, Depth+1, Query(Q, I));
592 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
594 computeKnownBits(B, MaskKnownZero, MaskKnownOne, Depth+1, Query(Q, I));
606 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
608 computeKnownBits(B, BKnownZero, BKnownOne, Depth+1, Query(Q, I));
620 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
622 computeKnownBits(B, BKnownZero, BKnownOne, Depth+1, Query(Q, I));
634 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
636 computeKnownBits(B, BKnownZero, BKnownOne, Depth+1, Query(Q, I));
651 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
653 computeKnownBits(B, BKnownZero, BKnownOne, Depth+1, Query(Q, I));
668 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
679 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
692 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
705 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
715 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
726 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
737 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
748 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
759 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
769 computeKnownBits(A, RHSKnownZero, RHSKnownOne, Depth+1, Query(Q, I));
773 if (isKnownToBeAPowerOfTwo(A, false, Depth + 1, Query(Q, I)))
795 unsigned Depth, const Query &Q, KZFunctor KZF, KOFunctor KOF) {
871 const Query &Q) {
1376 unsigned Depth, const Query &Q) {
1476 unsigned Depth, const Query &Q) {
1495 const Query &Q) {
1594 const Query &Q) {
1671 bool isKnownNonZero(Value *V, unsigned Depth, const Query &Q) {
1868 static bool isAddOfNonZero(Value *V1, Value *V2, const Query &Q) {
1883 static bool isKnownNonEqual(Value *V1, Value *V2, const Query &Q) {
1920 const Query &Q) {
1959 unsigned ComputeNumSignBits(Value *V, unsigned Depth, const Query &Q) {
