Lines Matching refs:dbgs
118 LLVM_DEBUG(dbgs() << "Trip count of loop " << L.getName() in computeTripCount()
155 LLVM_DEBUG(dbgs().indent(2) << "Succesfully delinearized: " << *this in IndexedReference()
165 LLVM_DEBUG(dbgs().indent(2) in hasSpacialReuse()
172 LLVM_DEBUG(dbgs().indent(2) in hasSpacialReuse()
180 LLVM_DEBUG(dbgs().indent(2) << "No spacial reuse, different subscripts: " in hasSpacialReuse()
195 LLVM_DEBUG(dbgs().indent(2) in hasSpacialReuse()
206 dbgs().indent(2) << "Found spacial reuse.\n"; in hasSpacialReuse()
208 dbgs().indent(2) << "No spacial reuse.\n"; in hasSpacialReuse()
221 LLVM_DEBUG(dbgs().indent(2) in hasTemporalReuse()
230 LLVM_DEBUG(dbgs().indent(2) << "No temporal reuse: no dependence\n"); in hasTemporalReuse()
235 LLVM_DEBUG(dbgs().indent(2) << "Found temporal reuse\n"); in hasTemporalReuse()
249 LLVM_DEBUG(dbgs().indent(2) << "No temporal reuse: distance unknown\n"); in hasTemporalReuse()
255 LLVM_DEBUG(dbgs().indent(2) in hasTemporalReuse()
261 dbgs().indent(2) in hasTemporalReuse()
268 LLVM_DEBUG(dbgs().indent(2) << "Found temporal reuse\n"); in hasTemporalReuse()
276 dbgs().indent(2) << "Computing cache cost for:\n"; in computeRefCost()
277 dbgs().indent(4) << *this << "\n"; in computeRefCost()
282 LLVM_DEBUG(dbgs().indent(4) << "Reference is loop invariant: RefCost=1\n"); in computeRefCost()
288 LLVM_DEBUG(dbgs() << "TripCount=" << *TripCount << "\n"); in computeRefCost()
309 LLVM_DEBUG(dbgs().indent(4) in computeRefCost()
335 LLVM_DEBUG(dbgs().indent(4) in computeRefCost()
344 LLVM_DEBUG(dbgs().indent(4) in computeRefCost()
364 dbgs() << "Delinearized subscripts of fixed-size array\n" in tryDelinearizeFixedSize()
375 LLVM_DEBUG(dbgs() << "Delinearizing: " << StoreOrLoadInst << "\n"); in delinearize()
387 dbgs().indent(2) in delinearize()
398 LLVM_DEBUG(dbgs().indent(2) << "In Loop '" << L->getName() in delinearize()
406 LLVM_DEBUG(dbgs().indent(2) << "In Loop '" << L->getName() in delinearize()
417 LLVM_DEBUG(dbgs().indent(2) in delinearize()
583 LLVM_DEBUG(dbgs() << "Expecting the outermost loop in a loop nest\n"); in getCacheCost()
591 LLVM_DEBUG(dbgs() << "Cannot compute cache cost of loop nest with more " in getCacheCost()
600 LLVM_DEBUG(dbgs() << "POPULATING REFERENCE GROUPS\n"); in calculateCacheFootprint()
605 LLVM_DEBUG(dbgs() << "COMPUTING LOOP CACHE COSTS\n"); in calculateCacheFootprint()
639 dbgs() << "References:\n"; in populateReferenceGroups()
640 dbgs().indent(2) << *R << "\n"; in populateReferenceGroups()
641 dbgs().indent(2) << Representative << "\n"; in populateReferenceGroups()
681 dbgs() << "\nIDENTIFIED REFERENCE GROUPS:\n"; in populateReferenceGroups()
684 dbgs().indent(2) << "RefGroup " << n << ":\n"; in populateReferenceGroups()
686 dbgs().indent(4) << *IR << "\n"; in populateReferenceGroups()
689 dbgs() << "\n"; in populateReferenceGroups()
701 LLVM_DEBUG(dbgs() << "Considering loop '" << L.getName() in computeLoopCacheCost()
718 LLVM_DEBUG(dbgs().indent(2) << "Loop '" << L.getName() in computeLoopCacheCost()