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

Method insert

lib/Analysis/LoopAccessAnalysis.cpp:164–206 · view source on GitHub ↗

Calculate Start and End points of memory access. Let's assume A is the first access and B is a memory access on N-th loop iteration. Then B is calculated as: B = A + Step*N . Step value may be positive or negative. N is a calculated back-edge taken count: N = (TripCount > 0) ? RoundDown(TripCount -1 , VF) : 0 Start and End points are calculated in the following way: Start = UMIN(A, B) ; End = UMAX

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 15

restoreParsingStateMethod · 0.45

ValidateEndOfModuleMethod · 0.45

ParseValIDMethod · 0.45

ParseSwitchMethod · 0.45

mergeSetInMethod · 0.45

addVectorizableFunctionsMethod · 0.45

visitSwitchInstMethod · 0.45

stripAndComputeInBoundsConstantOffsetsMethod · 0.45

analyzeCallMethod · 0.45

calcUnreachableHeuristicsMethod · 0.45

calcColdCallHeuristicsMethod · 0.45

setEdgeProbabilityMethod · 0.45

Calls 15

getSEMethod · 0.80

getBackedgeTakenCountMethod · 0.80

evaluateAtIterationMethod · 0.80

getStepRecurrenceMethod · 0.80

getUMinExprMethod · 0.80

getUMaxExprMethod · 0.80

getPointerElementTypeMethod · 0.80

emplace_backMethod · 0.80

assertFunction · 0.50

swapFunction · 0.50

isLoopInvariantMethod · 0.45

getStartMethod · 0.45

Tested by

no test coverage detected