Lines Matching refs:Query
102 struct Query {
127 Query(const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI,
132 Query(const Query &Q, const Value *NewExcl)
167 unsigned Depth, const Query &Q);
175 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
179 const Query &Q);
188 V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
228 const Query &Q);
235 V, OrZero, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));
238 static bool isKnownNonZero(const Value *V, unsigned Depth, const Query &Q);
244 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));
276 static bool isKnownNonEqual(const Value *V1, const Value *V2, const Query &Q);
283 Query(DL, AC, safeCxtI(V1, safeCxtI(V2, CxtI)), DT,
288 const Query &Q);
295 V, Mask, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));
299 const Query &Q);
306 V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));
312 unsigned Depth, const Query &Q) {
326 unsigned Depth, const Query &Q) {
579 static bool isKnownNonZeroFromAssume(const Value *V, const Query &Q) {
647 unsigned Depth, const Query &Q) {
709 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
717 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
719 computeKnownBits(B, MaskKnown, Depth+1, Query(Q, I));
730 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
732 computeKnownBits(B, MaskKnown, Depth+1, Query(Q, I));
743 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
745 computeKnownBits(B, BKnown, Depth+1, Query(Q, I));
756 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
758 computeKnownBits(B, BKnown, Depth+1, Query(Q, I));
769 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
771 computeKnownBits(B, BKnown, Depth+1, Query(Q, I));
785 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
787 computeKnownBits(B, BKnown, Depth+1, Query(Q, I));
801 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
813 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
825 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
835 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
847 computeKnownBits(A, RHSKnown, Depth + 1, Query(Q, I));
860 computeKnownBits(A, RHSKnown, Depth + 1, Query(Q, I));
873 computeKnownBits(A, RHSKnown, Depth + 1, Query(Q, I));
886 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
899 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
910 computeKnownBits(A, RHSKnown, Depth+1, Query(Q, I));
922 if (isKnownToBeAPowerOfTwo(A, false, Depth + 1, Query(Q, I)))
961 unsigned Depth, const Query &Q,
1047 unsigned Depth, const Query &Q) {
1452 Query RecQ = Q;
1527 Query RecQ = Q;
1700 KnownBits computeKnownBits(const Value *V, unsigned Depth, const Query &Q) {
1722 const Query &Q) {
1830 const Query &Q) {
1929 const Query &Q) {
2096 bool isKnownNonZero(const Value *V, unsigned Depth, const Query &Q) {
2347 static bool isAddOfNonZero(const Value *V1, const Value *V2, const Query &Q) {
2362 static bool isKnownNonEqual(const Value *V1, const Value *V2, const Query &Q) {
2394 const Query &Q) {
2456 const Query &Q);
2459 const Query &Q) {
2472 const Query &Q) {
4297 Add, AddKnown, /*Depth=*/0, Query(DL, AC, CxtI, DT, true));