hub / github.com/GoSSIP-SJTU/Armariris / SolveLinEquationWithOverflow

Function SolveLinEquationWithOverflow

lib/Analysis/ScalarEvolution.cpp:6933–6970 · view source on GitHub ↗

Finds the minimum unsigned root of the following equation: A * X = B (mod N) where N = 2^BW and BW is the common bit width of A and B. The signedness of A and B isn't important. If the equation does not have a solution, SCEVCouldNotCompute is returned.

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

howFarToZeroMethod · 0.85

Calls 11

countTrailingZerosMethod · 0.80

getCouldNotComputeMethod · 0.80

zextMethod · 0.80

multiplicativeInverseMethod · 0.80

uremMethod · 0.80

assertFunction · 0.50

getBitWidthMethod · 0.45

lshrMethod · 0.45

setBitMethod · 0.45

getConstantMethod · 0.45

truncMethod · 0.45

Tested by

no test coverage detected