Lines Matching full:impossible
312 // If none of the mapping worked that means they are all impossible. in findBestMapping()
313 // Thus, pick the first one and set an impossible repairing point. in findBestMapping()
317 RepairingPlacement(MI, 0, *TRI, *this, RepairingPlacement::Impossible)); in findBestMapping()
438 RepairPt.switchTo(RepairingPlacement::RepairingKind::Impossible); in tryAvoidingSplit()
511 LLVM_DEBUG(dbgs() << "Mapping involves impossible repairing\n"); in computeMapping()
536 // This is an impossible to repair cost. in computeMapping()
597 RepairPt.getKind() == RepairingPlacement::Impossible) in applyMapping()
766 CanMaterialize(Kind != RepairingKind::Impossible), P(P) { in RepairingPlacement()
1020 // If one is impossible to realize the other is cheaper unless it is in operator <()
1021 // impossible as well. in operator <()
1107 OS << "impossible"; in print()