20       [=](const LegalityQuery &Query) { return Query.Types[TypeIdx] == Type; };  in typeIs()  argument
27   return [=](const LegalityQuery &Query) {  in typeInSet()  argument
28     return std::find(Types.begin(), Types.end(), Query.Types[TypeIdx]) != Types.end();  in typeInSet()
36   return [=](const LegalityQuery &Query) {  in typePairInSet()  argument
37     std::pair<LLT, LLT> Match = {Query.Types[TypeIdx0], Query.Types[TypeIdx1]};  in typePairInSet()
46   return [=](const LegalityQuery &Query) {  in typePairAndMemSizeInSet()  argument
47     TypePairAndMemSize Match = {Query.Types[TypeIdx0], Query.Types[TypeIdx1],  in typePairAndMemSizeInSet()
48                                 Query.MMODescrs[MMOIdx].SizeInBits};  in typePairAndMemSizeInSet()
55   return [=](const LegalityQuery &Query) {  in isScalar()  argument
56     return Query.Types[TypeIdx].isScalar();  in isScalar()
62   return [=](const LegalityQuery &Query) {  in narrowerThan()  argument
63     const LLT &QueryTy = Query.Types[TypeIdx];  in narrowerThan()
70   return [=](const LegalityQuery &Query) {  in widerThan()  argument
71     const LLT &QueryTy = Query.Types[TypeIdx];  in widerThan()
77   return [=](const LegalityQuery &Query) {  in sizeNotPow2()  argument
78     const LLT &QueryTy = Query.Types[TypeIdx];  in sizeNotPow2()
84   return [=](const LegalityQuery &Query) {  in memSizeInBytesNotPow2()  argument
85     return !isPowerOf2_32(Query.MMODescrs[MMOIdx].SizeInBits / 8);  in memSizeInBytesNotPow2()
90   return [=](const LegalityQuery &Query) {  in numElementsNotPow2()  argument
91     const LLT &QueryTy = Query.Types[TypeIdx];  in numElementsNotPow2()
98   return [=](const LegalityQuery &Query) {  in atomicOrderingAtLeastOrStrongerThan()  argument
99     return isAtLeastOrStrongerThan(Query.MMODescrs[MMOIdx].Ordering, Ordering);  in atomicOrderingAtLeastOrStrongerThan()