* Compute the greatest common divisor of a and b. */
| 131 | * Compute the greatest common divisor of a and b. |
| 132 | */ |
| 133 | static int gcd(int a, int b) |
| 134 | { |
| 135 | int c; |
| 136 | |
| 137 | c = a % b; |
| 138 | while (c != 0) |
| 139 | { |
| 140 | a = b; |
| 141 | b = c; |
| 142 | c = a % b; |
| 143 | } |
| 144 | |
| 145 | return (b); |
| 146 | } |
| 147 | |
| 148 | /* |
| 149 | * Exchange the block from nonopt_start to nonopt_end with the block |