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()
765   CommonLevels = SrcLevel;  in establishNestingLevels()
766   MaxLevels -= CommonLevels;  in establishNestingLevels()
781   if (D > CommonLevels)  in mapDstLoop()
782     return D - CommonLevels + SrcLevels;  in mapDstLoop()
806     if (Level <= CommonLevels && !SE->isLoopInvariant(Expression, LoopNest))  in collectCommonLoops()
1155   assert(0 < Level && Level <= CommonLevels && "level out of range");  in strongSIVtest()
1288   assert(0 < Level && Level <= CommonLevels && "Level out of range");  in weakCrossingSIVtest()
1501   assert(0 < Level && Level <= CommonLevels && "Level out of range");  in exactSIVtest()
1721     if (Level < CommonLevels) {  in weakZeroSrcSIVtest()
1749       if (Level < CommonLevels) {  in weakZeroSrcSIVtest()
1830     if (Level < CommonLevels) {  in weakZeroDstSIVtest()
1858       if (Level < CommonLevels) {  in weakZeroDstSIVtest()
2573       for (unsigned K = 1; K <= CommonLevels; ++K) {  in banerjeeMIVtest()
2614   if (Level > CommonLevels) {  in exploreDirections()
2617     for (unsigned K = 1; K <= CommonLevels; ++K) {  in exploreDirections()
3440   LLVM_DEBUG(dbgs() << "    common nesting levels = " << CommonLevels << "\n");  in depends()
3443   FullDependence Result(Src, Dst, PossiblyLoopIndependent, CommonLevels);  in depends()
3734         if (SJ > CommonLevels)  in depends()
3747   for (unsigned II = 1; II <= CommonLevels; ++II)  in depends()
3755     for (unsigned II = 1; II <= CommonLevels; ++II) {  in depends()
3766     for (unsigned II = 1; II <= CommonLevels; ++II) {  in depends()
3845   FullDependence Result(Src, Dst, false, CommonLevels);  in getSplitIteration()