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)
205 KnownBits &Known, unsigned Depth, const Query &Q);
208 const Query &Q) {
228 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
237 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
241 unsigned Depth, const Query &Q);
244 const Query &Q);
253 V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
264 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
304 const Query &Q);
311 V, OrZero, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));
315 unsigned Depth, const Query &Q);
317 static bool isKnownNonZero(const Value *V, unsigned Depth, const Query &Q);
323 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));
355 static bool isKnownNonEqual(const Value *V1, const Value *V2, const Query &Q);
362 Query(DL, AC, safeCxtI(V1, safeCxtI(V2, CxtI)), DT,
367 const Query &Q);
374 V, Mask, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));
378 unsigned Depth, const Query &Q);
381 const Query &Q) {
398 V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));
404 unsigned Depth, const Query &Q) {
419 const Query &Q) {
665 static bool isKnownNonZeroFromAssume(const Value *V, const Query &Q) {
739 unsigned Depth, const Query &Q) {
802 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
810 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
812 computeKnownBits(B, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
823 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
825 computeKnownBits(B, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
836 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
838 computeKnownBits(B, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
849 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
851 computeKnownBits(B, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
862 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
864 computeKnownBits(B, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
878 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
880 computeKnownBits(B, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
894 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
907 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
919 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
929 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
941 computeKnownBits(A, Depth + 1, Query(Q, I)).anyextOrTrunc(BitWidth);
954 computeKnownBits(A, Depth + 1, Query(Q, I)).anyextOrTrunc(BitWidth);
967 computeKnownBits(A, Depth + 1, Query(Q, I)).anyextOrTrunc(BitWidth);
980 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
993 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
1004 computeKnownBits(A, Depth+1, Query(Q, I)).anyextOrTrunc(BitWidth);
1016 if (isKnownToBeAPowerOfTwo(A, false, Depth + 1, Query(Q, I)))
1055 KnownBits &Known2, unsigned Depth, const Query &Q,
1144 const Query &Q) {
1537 Query RecQ = Q;
1612 Query RecQ = Q;
1859 unsigned Depth, const Query &Q) {
1867 KnownBits computeKnownBits(const Value *V, unsigned Depth, const Query &Q) {
1889 KnownBits &Known, unsigned Depth, const Query &Q) {
2021 const Query &Q) {
2120 const Query &Q) {
2288 const Query &Q) {
2559 bool isKnownNonZero(const Value* V, unsigned Depth, const Query& Q) {
2572 static bool isAddOfNonZero(const Value *V1, const Value *V2, const Query &Q) {
2587 static bool isKnownNonEqual(const Value *V1, const Value *V2, const Query &Q) {
2619 const Query &Q) {
2685 unsigned Depth, const Query &Q);
2688 unsigned Depth, const Query &Q) {
2703 unsigned Depth, const Query &Q) {
4562 Add, AddKnown, /*Depth=*/0, Query(DL, AC, CxtI, DT, true));