* Compute the greatest common divisor of a and b. */
| 59 | * Compute the greatest common divisor of a and b. |
| 60 | */ |
| 61 | static int |
| 62 | gcd(int a, int b) |
| 63 | { |
| 64 | int c; |
| 65 | |
| 66 | c = a % b; |
| 67 | while (c != 0) { |
| 68 | a = b; |
| 69 | b = c; |
| 70 | c = a % b; |
| 71 | } |
| 72 | |
| 73 | return (b); |
| 74 | } |
| 75 | |
| 76 | /* |
| 77 | * Exchange the block from nonopt_start to nonopt_end with the block |