258                                unsigned CommonLevels)  in FullDependence()  argument
259     : Dependence(Source, Destination), Levels(CommonLevels),  in FullDependence()
262   if (CommonLevels)  in FullDependence()
263     DV = std::make_unique<DVEntry[]>(CommonLevels);  in FullDependence()
767   CommonLevels = SrcLevel;  in establishNestingLevels()
768   MaxLevels -= CommonLevels;  in establishNestingLevels()
783   if (D > CommonLevels)  in mapDstLoop()
784     return D - CommonLevels + SrcLevels;  in mapDstLoop()
808     if (Level <= CommonLevels && !SE->isLoopInvariant(Expression, LoopNest))  in collectCommonLoops()
1157   assert(0 < Level && Level <= CommonLevels && "level out of range");  in strongSIVtest()
1290   assert(0 < Level && Level <= CommonLevels && "Level out of range");  in weakCrossingSIVtest()
1492   assert(0 < Level && Level <= CommonLevels && "Level out of range");  in exactSIVtest()
1696     if (Level < CommonLevels) {  in weakZeroSrcSIVtest()
1724       if (Level < CommonLevels) {  in weakZeroSrcSIVtest()
1805     if (Level < CommonLevels) {  in weakZeroDstSIVtest()
1833       if (Level < CommonLevels) {  in weakZeroDstSIVtest()
2564       for (unsigned K = 1; K <= CommonLevels; ++K) {  in banerjeeMIVtest()
2605   if (Level > CommonLevels) {  in exploreDirections()
2608     for (unsigned K = 1; K <= CommonLevels; ++K) {  in exploreDirections()
3544   LLVM_DEBUG(dbgs() << "    common nesting levels = " << CommonLevels << "\n");  in depends()
3547   FullDependence Result(Src, Dst, PossiblyLoopIndependent, CommonLevels);  in depends()
3848         if (SJ > CommonLevels)  in depends()
3861   for (unsigned II = 1; II <= CommonLevels; ++II)  in depends()
3869     for (unsigned II = 1; II <= CommonLevels; ++II) {  in depends()
3880     for (unsigned II = 1; II <= CommonLevels; ++II) {  in depends()
3959   FullDependence Result(Src, Dst, false, CommonLevels);  in getSplitIteration()