| 229 |
|
main(int argc, char *argv[]) |
| 230 |
|
{ |
| 231 |
|
extern int nprocs; |
| 232 |
< |
int auto_grazing = 0; |
| 232 |
> |
static char gval_buf[16]; |
| 233 |
> |
char * auto_grazing = NULL; |
| 234 |
|
const char *symmetry = "0"; |
| 235 |
|
int ninpfiles, totinc; |
| 236 |
|
int a, i; |
| 249 |
|
break; |
| 250 |
|
case 'g': |
| 251 |
|
if (toupper(argv[a+1][0]) == 'A') |
| 252 |
< |
auto_grazing = 1; |
| 252 |
> |
auto_grazing = argv[a+1] = gval_buf; |
| 253 |
|
else |
| 254 |
|
lim_graze = atof(argv[a+1]); |
| 255 |
|
++a; |
| 273 |
|
if (auto_grazing && fabs(inpfile[i].theta - 90.) < lim_graze) |
| 274 |
|
lim_graze = fabs(inpfile[i].theta - 90.); |
| 275 |
|
} |
| 276 |
+ |
if (auto_grazing) |
| 277 |
+ |
sprintf(auto_grazing, "%.2f", lim_graze); |
| 278 |
|
for (i = ninpfiles; i < totinc; i++) { /* copy for "up" symmetry */ |
| 279 |
|
inpfile[i] = inpfile[i-ninpfiles]; |
| 280 |
|
inpfile[i].phi += 180.; /* invert duplicate data */ |
