In a general for loop of the form:for (i = 0, i <= n, i++) {    for (j = i, j <= n, j++)        ...    for (k = i, k <= n, k++)        ...}What form do the inequalities representing the iteration space take? Or what convex polyhedron represents this?BackgroundI am looking at the Dragon Book's chapter on parallelisation. This talks in detail of nested loops of the form:for (i = 0, i <= n, i++) {    for (j = i, j <= n, j++)       ...}but not of the form described at the top.The iteration space of d-deep nested loops can be represented as:$$ \{ i \in \mathbb{Z}^d \mid Bi + b \geq 0 \} $$where B is a $d \times d $ integer matrix and b is a vector of length $d$My question is basically do I have to do anything different when a loop contains multiple inner loops not nested within each other?
How is the iteration space of a nested for-loop containing two sequential nested loops represented?
dc.parallel comp;compilers