- If we have a cycle of length n that includes the tos,
- we need n-1 exchange operations.
- We can always add the tos and restore it, so we need
- n+1 exchange operations for a cycle not containing the tos.
- So, the maximum of needed operations is for a cycle of 7
- not including the tos == 8.
- This is the same number of ops we would need for using stores,
- so exchange is cheaper (we save the loads).
- On the other hand, we might need an additional exchange
- in the next block to bring one operand on top, so the
- number of ops in the first case is identical.
- Further, no more than 4 cycles can exists (4 x 2).
- */
+ * If we have a cycle of length n that includes the tos,
+ * we need n-1 exchange operations.
+ * We can always add the tos and restore it, so we need
+ * n+1 exchange operations for a cycle not containing the tos.
+ * So, the maximum of needed operations is for a cycle of 7
+ * not including the tos == 8.
+ * This is the same number of ops we would need for using stores,
+ * so exchange is cheaper (we save the loads).
+ * On the other hand, we might need an additional exchange
+ * in the next block to bring one operand on top, so the
+ * number of ops in the first case is identical.
+ * Further, no more than 4 cycles can exists (4 x 2). */