class
SRemOverflow extends Pass
Instance Constructors
-
new
SRemOverflow()(implicit top: Top)
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
implicit
def
fresh: Fresh
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
onDefn(defn: Defn): Defn
-
def
onDefns(assembly: Seq[Defn]): Seq[Defn]
-
def
onInst(inst: Inst): Inst
-
def
onInsts(insts: Seq[Inst]): Seq[Inst]
-
def
onNext(next: Next): Next
-
def
onOp(op: Op): Op
-
def
onType(ty: Type): Type
-
def
onVal(value: Val): Val
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Detects taking remainder for division by -1 and replaces it by division by 1 which can't overflow.
We implement '%' (remainder) with LLVM's 'srem' and it can overflow for cases: Int.MinValue % -1 Long.MinValue % -1 E.g. On x86_64 'srem' might get translated to 'idiv' which computes both quotient and remainder at once and quotient can overflow.