Lines Matching refs:Row
199 static bool isOuterMostDepPositive(CharMatrix &DepMatrix, unsigned Row,
202 if (DepMatrix[Row][i] == '<')
204 if (DepMatrix[Row][i] == '>')
211 // Checks if no dependence exist in the dependency matrix in Row before Column.
212 static bool containsNoDependence(CharMatrix &DepMatrix, unsigned Row,
215 if (DepMatrix[Row][i] != '=' || DepMatrix[Row][i] != 'S' ||
216 DepMatrix[Row][i] != 'I')
222 static bool validDepInterchange(CharMatrix &DepMatrix, unsigned Row,
226 if (isOuterMostDepPositive(DepMatrix, Row, OuterLoopId))
232 // It is legal to interchange if and only if after interchange no row has a
248 // interchanging will result in this row having an outermost non '='
250 if (!containsNoDependence(DepMatrix, Row, OuterLoopId))
261 // has no ">" direction as the leftmost non-"=" direction in any row.
267 // For each row check if it is valid to interchange.
268 for (unsigned Row = 0; Row < NumRows; ++Row) {
269 char InnerDep = DepMatrix[Row][InnerLoopId];
270 char OuterDep = DepMatrix[Row][OuterLoopId];
273 else if (!validDepInterchange(DepMatrix, Row, OuterLoopId, InnerDep,
959 unsigned Row = DepMatrix.size();
960 for (unsigned i = 0; i < Row; ++i) {
