Lines Matching refs:Query
49 struct Query {
56 Query(const DataLayout &DL, const TargetLibraryInfo *tli,
63 static Value *SimplifyAndInst(Value *, Value *, const Query &, unsigned);
64 static Value *SimplifyBinOp(unsigned, Value *, Value *, const Query &,
67 const Query &, unsigned);
68 static Value *SimplifyCmpInst(unsigned, Value *, Value *, const Query &,
70 static Value *SimplifyOrInst(Value *, Value *, const Query &, unsigned);
71 static Value *SimplifyXorInst(Value *, Value *, const Query &, unsigned);
72 static Value *SimplifyTruncInst(Value *, Type *, const Query &, unsigned);
141 unsigned OpcToExpand, const Query &Q,
200 const Query &Q, unsigned MaxRecurse) {
299 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) {
586 return ::SimplifyAddInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
664 const Query &Q, unsigned MaxRecurse) {
781 return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
788 const Query &Q, unsigned MaxRecurse) {
827 const Query &Q, unsigned MaxRecurse) {
862 const Query &Q,
885 static Value *SimplifyMulInst(Value *Op0, Value *Op1, const Query &Q,
950 return ::SimplifyFAddInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
959 return ::SimplifyFSubInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
968 return ::SimplifyFMulInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
976 return ::SimplifyMulInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
983 const Query &Q, unsigned MaxRecurse) {
1065 static Value *SimplifySDivInst(Value *Op0, Value *Op1, const Query &Q,
1077 return ::SimplifySDivInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1083 static Value *SimplifyUDivInst(Value *Op0, Value *Op1, const Query &Q,
1095 return ::SimplifyUDivInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1100 const Query &Q, unsigned) {
1138 return ::SimplifyFDivInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
1145 const Query &Q, unsigned MaxRecurse) {
1202 static Value *SimplifySRemInst(Value *Op0, Value *Op1, const Query &Q,
1214 return ::SimplifySRemInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1220 static Value *SimplifyURemInst(Value *Op0, Value *Op1, const Query &Q,
1232 return ::SimplifyURemInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1237 const Query &, unsigned) {
1260 return ::SimplifyFRemInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI),
1294 const Query &Q, unsigned MaxRecurse) {
1345 bool isExact, const Query &Q,
1376 const Query &Q, unsigned MaxRecurse) {
1396 return ::SimplifyShlInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI),
1403 const Query &Q, unsigned MaxRecurse) {
1421 return ::SimplifyLShrInst(Op0, Op1, isExact, Query(DL, TLI, DT, AC, CxtI),
1428 const Query &Q, unsigned MaxRecurse) {
1455 return ::SimplifyAShrInst(Op0, Op1, isExact, Query(DL, TLI, DT, AC, CxtI),
1563 static Value *SimplifyAndInst(Value *Op0, Value *Op1, const Query &Q,
1679 return ::SimplifyAndInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1737 static Value *SimplifyOrInst(Value *Op0, Value *Op1, const Query &Q,
1864 return ::SimplifyOrInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
1870 static Value *SimplifyXorInst(Value *Op0, Value *Op1, const Query &Q,
1918 return ::SimplifyXorInst(Op0, Op1, Query(DL, TLI, DT, AC, CxtI),
2156 const Query &Q, unsigned MaxRecurse) {
3156 return ::SimplifyICmpInst(Predicate, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3163 FastMathFlags FMF, const Query &Q,
3289 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3294 const Query &Q,
3377 Value *FalseVal, const Query &Q,
3509 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3515 const Query &Q, unsigned) {
3602 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
3608 ArrayRef<unsigned> Idxs, const Query &Q,
3638 return ::SimplifyInsertValueInst(Agg, Val, Idxs, Query(DL, TLI, DT, AC, CxtI),
3645 const Query &, unsigned) {
3673 return ::SimplifyExtractValueInst(Agg, Idxs, Query(DL, TLI, DT, AC, CxtI),
3679 static Value *SimplifyExtractElementInst(Value *Vec, Value *Idx, const Query &,
3705 return ::SimplifyExtractElementInst(Vec, Idx, Query(DL, TLI, DT, AC, CxtI),
3710 static Value *SimplifyPHINode(PHINode *PN, const Query &Q) {
3742 static Value *SimplifyTruncInst(Value *Op, Type *Ty, const Query &Q, unsigned) {
3753 return ::SimplifyTruncInst(Op, Ty, Query(DL, TLI, DT, AC, CxtI),
3762 const Query &Q, unsigned MaxRecurse) {
3828 const FastMathFlags &FMF, const Query &Q,
3846 return ::SimplifyBinOp(Opcode, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3855 return ::SimplifyFPBinOp(Opcode, LHS, RHS, FMF, Query(DL, TLI, DT, AC, CxtI),
3861 const Query &Q, unsigned MaxRecurse) {
3871 return ::SimplifyCmpInst(Predicate, LHS, RHS, Query(DL, TLI, DT, AC, CxtI),
3965 const Query &Q, unsigned MaxRecurse) {
4034 const Query &Q, unsigned MaxRecurse) {
4072 return ::SimplifyCall(V, ArgBegin, ArgEnd, Query(DL, TLI, DT, AC, CxtI),
4081 Query(DL, TLI, DT, AC, CxtI), RecursionLimit);
4215 Result = SimplifyPHINode(cast<PHINode>(I), Query(DL, TLI, DT, AC, I));
