v20221202

Bug fix release:

• Recovery should work correctly even for a run with -W in the first stage.
• Progress should be reported promptly even for runs with -W and a fixed square.

Previous release:

New option "-W"

• If "-W100" is specified with "-p200", it will use a different process to test all possible cases involving p^2 with 100 < p <= 200, and then continue with the normal process as if "-p100" had been specified. This option is only available when n=12, we are running over a single batch (see "-b" below), and the limit is high enough that we won't miss any possible allocations of p^5. Within those constraints, this can give a very substantial speed improvement.
• For D(12,11), the slowest patterns (LCM=554400) appear to benefit from a value no higher than "-W5e5" (and maybe lower). For faster patterns it seems fastest to provide the minimum possible value, "-W21817". Total run times for a batch are more than 3x faster.
• Thanks (again) to Dmitry Petukhov for the idea behind this.

New build option DEBUG_ALL for pcoul

• If built with DEBUG_ALL, every value tested by linear search is printed to the log file.

Small speedup for sq12

• Skip values that are not in the range (32x-7, ..., 32x+7), since they cannot be part of any relevant chain.

Thanks DemIS for the Windows build, attached as pcoul_20221202.zip.