What does the phrase “Simple For Loops” mean in computability theory?


I was reading a Wikipedia page on Primitive Recursive Functions but there is a phrase for describing the simple for loops which I really don’t understand. Can anyone explain this to me?

The Phrase: An upper bound of the number of iterations of every loop can be determined before entering the loop

The Wikipedia page