245                                unsigned CommonLevels)  in FullDependence()  argument
246     : Dependence(Source, Destination), Levels(CommonLevels),  in FullDependence()
249   if (CommonLevels)  in FullDependence()
250     DV = make_unique<DVEntry[]>(CommonLevels);  in FullDependence()
752   CommonLevels = SrcLevel;  in establishNestingLevels()
753   MaxLevels -= CommonLevels;  in establishNestingLevels()
768   if (D > CommonLevels)  in mapDstLoop()
769     return D - CommonLevels + SrcLevels;  in mapDstLoop()
793     if (Level <= CommonLevels && !SE->isLoopInvariant(Expression, LoopNest))  in collectCommonLoops()
1151   assert(0 < Level && Level <= CommonLevels && "level out of range");  in strongSIVtest()
1284   assert(0 < Level && Level <= CommonLevels && "Level out of range");  in weakCrossingSIVtest()
1497   assert(0 < Level && Level <= CommonLevels && "Level out of range");  in exactSIVtest()
1717     if (Level < CommonLevels) {  in weakZeroSrcSIVtest()
1745       if (Level < CommonLevels) {  in weakZeroSrcSIVtest()
1826     if (Level < CommonLevels) {  in weakZeroDstSIVtest()
1854       if (Level < CommonLevels) {  in weakZeroDstSIVtest()
2569       for (unsigned K = 1; K <= CommonLevels; ++K) {  in banerjeeMIVtest()
2610   if (Level > CommonLevels) {  in exploreDirections()
2613     for (unsigned K = 1; K <= CommonLevels; ++K) {  in exploreDirections()
3423   LLVM_DEBUG(dbgs() << "    common nesting levels = " << CommonLevels << "\n");  in depends()
3426   FullDependence Result(Src, Dst, PossiblyLoopIndependent, CommonLevels);  in depends()
3717         if (SJ > CommonLevels)  in depends()
3730   for (unsigned II = 1; II <= CommonLevels; ++II)  in depends()
3738     for (unsigned II = 1; II <= CommonLevels; ++II) {  in depends()
3749     for (unsigned II = 1; II <= CommonLevels; ++II) {  in depends()
3830   FullDependence Result(Src, Dst, false, CommonLevels);  in getSplitIteration()