Lines Matching refs:Query
48 struct Query {
55 Query(const DataLayout &DL, const TargetLibraryInfo *tli,
62 static Value *SimplifyAndInst(Value *, Value *, const Query &, unsigned);
63 static Value *SimplifyBinOp(unsigned, Value *, Value *, const Query &,
66 const Query &, unsigned);
67 static Value *SimplifyCmpInst(unsigned, Value *, Value *, const Query &,
69 static Value *SimplifyOrInst(Value *, Value *, const Query &, unsigned);
70 static Value *SimplifyXorInst(Value *, Value *, const Query &, unsigned);
71 static Value *SimplifyTruncInst(Value *, Type *, const Query &, unsigned);
140 unsigned OpcToExpand, const Query &Q,
199 const Query &Q, unsigned MaxRecurse) {
298 const Query &Q, unsigned MaxRecurse) {
370 Value *RHS, const Query &Q,
452 const Query &Q, unsigned MaxRecurse) {
494 const Query &Q, unsigned MaxRecurse) {
530 const Query &Q, unsigned MaxRecurse) {
589 return ::SimplifyAddInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
662 const Query &Q, unsigned MaxRecurse) {
782 return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
789 const Query &Q, unsigned MaxRecurse) {
831 const Query &Q, unsigned MaxRecurse) {
868 const Query &Q,
894 static Value *SimplifyMulInst(Value *Op0, Value *Op1, const Query &Q,
962 return ::SimplifyFAddInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
971 return ::SimplifyFSubInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
980 return ::SimplifyFMulInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
988 return ::SimplifyMulInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
995 const Query &Q, unsigned MaxRecurse) {
1080 static Value *SimplifySDivInst(Value *Op0, Value *Op1, const Query &Q,
1092 return ::SimplifySDivInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1098 static Value *SimplifyUDivInst(Value *Op0, Value *Op1, const Query &Q,
1110 return ::SimplifyUDivInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1115 const Query &Q, unsigned) {
1153 return ::SimplifyFDivInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
1160 const Query &Q, unsigned MaxRecurse) {
1220 static Value *SimplifySRemInst(Value *Op0, Value *Op1, const Query &Q,
1232 return ::SimplifySRemInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1238 static Value *SimplifyURemInst(Value *Op0, Value *Op1, const Query &Q,
1250 return ::SimplifyURemInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1255 const Query &, unsigned) {
1278 return ::SimplifyFRemInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
1312 const Query &Q, unsigned MaxRecurse) {
1350 bool isExact, const Query &Q,
1381 const Query &Q, unsigned MaxRecurse) {
1401 return ::SimplifyShlInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
1408 const Query &Q, unsigned MaxRecurse) {
1426 return ::SimplifyLShrInst(Op0, Op1, isExact, Query(DL, TLI, DT, AC, CxtI),
1433 const Query &Q, unsigned MaxRecurse) {
1460 return ::SimplifyAShrInst(Op0, Op1, isExact, Query(DL, TLI, DT, AC, CxtI),
1559 static Value *SimplifyAndInst(Value *Op0, Value *Op1, const Query &Q,
1660 return ::SimplifyAndInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1718 static Value *SimplifyOrInst(Value *Op0, Value *Op1, const Query &Q,
1848 return ::SimplifyOrInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1854 static Value *SimplifyXorInst(Value *Op0, Value *Op1, const Query &Q,
1905 return ::SimplifyXorInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
2133 const Query &Q, unsigned MaxRecurse) {
3101 return ::SimplifyICmpInst(Predicate, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3108 FastMathFlags FMF, const Query &Q,
3227 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3233 const Query &Q,
3317 Value *FalseVal, const Query &Q,
3449 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3455 const Query &Q, unsigned) {
3542 Ops, Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3548 ArrayRef<unsigned> Idxs, const Query &Q,
3578 return ::SimplifyInsertValueInst(Agg, Val, Idxs, Query(DL, TLI, DT, AC, CxtI),
3585 const Query &, unsigned) {
3613 return ::SimplifyExtractValueInst(Agg, Idxs, Query(DL, TLI, DT, AC, CxtI),
3619 static Value *SimplifyExtractElementInst(Value *Vec, Value *Idx, const Query &,
3645 return ::SimplifyExtractElementInst(Vec, Idx, Query(DL, TLI, DT, AC, CxtI),
3650 static Value *SimplifyPHINode(PHINode *PN, const Query &Q) {
3682 static Value *SimplifyTruncInst(Value *Op, Type *Ty, const Query &Q, unsigned) {
3693 return ::SimplifyTruncInst(Op, Ty, Query(DL, TLI, DT, AC, CxtI),
3702 const Query &Q, unsigned MaxRecurse) {
3771 const FastMathFlags &FMF, const Query &Q,
3789 return ::SimplifyBinOp(Opcode, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3798 return ::SimplifyFPBinOp(Opcode, LHS, RHS, FMF, Query(DL, TLI, DT, AC, CxtI),
3805 const Query &Q, unsigned MaxRecurse) {
3815 return ::SimplifyCmpInst(Predicate, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3837 const Query &Q, unsigned MaxRecurse) {
3892 const Query &Q, unsigned MaxRecurse) {
3929 return ::SimplifyCall(V, ArgBegin, ArgEnd, Query(DL, TLI, DT, AC, CxtI),
3938 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
4071 Result = SimplifyPHINode(cast<PHINode>(I), Query(DL, TLI, DT, AC, I));
