169   if (!selector->CanCover(node, input_node)) return false;  in TryMatchAnyShift()
203   if (!selector->CanCover(node, right_node)) return false;  in TryMatchAnyExtend()
219     if (selector->CanCover(mright.node(), mright.left().node()) &&  in TryMatchAnyExtend()
241   if (!selector->CanCover(node, index)) return false;  in TryMatchLoadStoreShift()
794   if (m.left().IsWord32Shr() && CanCover(node, m.left().node()) &&  in VisitWord32And()
826       this, node, &m, kArm64And32, CanCover(node, m.left().node()),  in VisitWord32And()
827       CanCover(node, m.right().node()), kLogical32Imm);  in VisitWord32And()
834   if (m.left().IsWord64Shr() && CanCover(node, m.left().node()) &&  in VisitWord64And()
866       this, node, &m, kArm64And, CanCover(node, m.left().node()),  in VisitWord64And()
867       CanCover(node, m.right().node()), kLogical64Imm);  in VisitWord64And()
874       this, node, &m, kArm64Or32, CanCover(node, m.left().node()),  in VisitWord32Or()
875       CanCover(node, m.right().node()), kLogical32Imm);  in VisitWord32Or()
882       this, node, &m, kArm64Or, CanCover(node, m.left().node()),  in VisitWord64Or()
883       CanCover(node, m.right().node()), kLogical64Imm);  in VisitWord64Or()
890       this, node, &m, kArm64Eor32, CanCover(node, m.left().node()),  in VisitWord32Xor()
891       CanCover(node, m.right().node()), kLogical32Imm);  in VisitWord32Xor()
898       this, node, &m, kArm64Eor, CanCover(node, m.left().node()),  in VisitWord64Xor()
899       CanCover(node, m.right().node()), kLogical64Imm);  in VisitWord64Xor()
905   if (m.left().IsWord32And() && CanCover(node, m.left().node()) &&  in VisitWord32Shl()
961   if (selector->CanCover(node, m.left().node()) && m.left().IsWord32Shl()) {  in TryEmitBitfieldExtract32()
1011       CanCover(node, node->InputAt(0))) {  in VisitWord32Shr()
1062       CanCover(node, node->InputAt(0))) {  in VisitWord32Sar()
1077       CanCover(node, node->InputAt(0))) {  in VisitWord32Sar()
1081         CanCover(add_node, madd_node.left().node())) {  in VisitWord32Sar()
1161   if (m.left().IsInt32Mul() && CanCover(node, m.left().node())) {  in VisitInt32Add()
1173   if (m.right().IsInt32Mul() && CanCover(node, m.right().node())) {  in VisitInt32Add()
1192   if (m.left().IsInt64Mul() && CanCover(node, m.left().node())) {  in VisitInt64Add()
1204   if (m.right().IsInt64Mul() && CanCover(node, m.right().node())) {  in VisitInt64Add()
1224   if (m.right().IsInt32Mul() && CanCover(node, m.right().node())) {  in VisitInt32Sub()
1245   if (m.right().IsInt64Mul() && CanCover(node, m.right().node())) {  in VisitInt64Sub()
1275   if (m.left().IsInt32Sub() && CanCover(node, m.left().node())) {  in VisitInt32Mul()
1287   if (m.right().IsInt32Sub() && CanCover(node, m.right().node())) {  in VisitInt32Mul()
1317   if (m.left().IsInt64Sub() && CanCover(node, m.left().node())) {  in VisitInt64Mul()
1329   if (m.right().IsInt64Sub() && CanCover(node, m.right().node())) {  in VisitInt64Mul()
1593   if (CanCover(node, value) && value->InputCount() >= 2) {  in VisitTruncateInt64ToInt32()
1671         CanCover(m.node(), m.right().node())) {  in VisitFloat64Sub()
1673           CanCover(m.right().node(), m.right().InputAt(0))) {  in VisitFloat64Sub()
1922       bool can_cover = selector->CanCover(node, sub);  in VisitWord32Compare()
2017   while (selector->CanCover(user, value)) {  in VisitWordCompareZero()
2049           if (selector->CanCover(value, left) &&  in VisitWordCompareZero()
2232     if (CanCover(user, value)) {  in VisitWord32Equal()
2293     if (CanCover(user, value)) {  in VisitWord64Equal()
2435       CanCover(node, left)) {  in VisitFloat64InsertLowWord32()
2453       CanCover(node, left)) {  in VisitFloat64InsertHighWord32()