1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
|
/*
* process_hkl.c
*
* Assemble and process FEL Bragg intensities
*
* (c) 2006-2010 Thomas White <taw@physics.org>
*
* Part of CrystFEL - crystallography with a FEL
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <stdarg.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <getopt.h>
#include "utils.h"
#include "statistics.h"
#include "sfac.h"
#include "reflections.h"
#include "likelihood.h"
#include "symmetry.h"
/* Number of divisions for intensity histograms */
#define NBINS (200)
static void show_help(const char *s)
{
printf("Syntax: %s [options]\n\n", s);
printf(
"Assemble and process FEL Bragg intensities.\n"
"\n"
" -h, --help Display this help message.\n"
" -i, --input=<filename> Specify input filename (\"-\" for stdin).\n"
" -o, --output=<filename> Specify output filename for merged intensities\n"
" (don't specify for no output).\n"
" -p, --pdb=<filename> PDB file to use (default: molecule.pdb).\n"
"\n"
" --max-only Take the integrated intensity to be equal to the\n"
" maximum intensity measured for that reflection.\n"
" The default is to use the mean value from all\n"
" measurements.\n"
" --sum Sum (rather than average) the intensities for the\n"
" final output list. This is useful for comparing\n"
" results to radially summed powder patterns, but\n"
" will break R-factor analysis.\n"
" --stop-after=<n> Stop after processing n patterns. Zero means\n"
" keep going until the end of the input, and is\n"
" the default.\n"
" -g, --histogram=<h,k,l> Calculate the histogram of measurements for this\n"
" reflection.\n"
"\n"
" --scale Scale each pattern for best fit with the current\n"
" model.\n"
" -y, --symmetry=<sym> Merge according to point group <sym>.\n"
);
}
static void plot_histogram(double *vals, int n)
{
int i;
double max = -INFINITY;
double min = +INFINITY;
double step;
int histo[NBINS];
FILE *fh;
fh = fopen("histogram.dat", "w");
if ( fh == NULL ) {
ERROR("Couldn't open 'histogram.dat'\n");
return;
}
for ( i=0; i<n; i++ ) {
if ( vals[i] > max ) max = vals[i];
if ( vals[i] < min ) min = vals[i];
}
STATUS("%f %f\n", min, max);
for ( i=0; i<NBINS; i++ ) {
histo[i] = 0;
}
step = (max-min)/NBINS;
for ( i=0; i<n; i++ ) {
int bin;
bin = (vals[i]-min)/step;
histo[bin]++;
}
for ( i=0; i<NBINS; i++ ) {
fprintf(fh, "%f %i\n", min+step*i, histo[i]);
}
fclose(fh);
}
/* Note "holo" needn't actually be a holohedral point group, if you want to try
* something strange like resolving from a low-symmetry group into an even
* lower symmetry one.
*/
static ReflItemList *get_twin_possibilities(const char *holo, const char *mero)
{
ReflItemList *test_items;
ReflItemList *twins;
int np;
np = num_general_equivs(holo) / num_general_equivs(mero);
test_items = new_items();
/* Some arbitrarily chosen reflections which can't be special
* reflections in any point group, i.e. lots of odd numbers,
* prime numbers and so on. There's probably an analytical
* way of working these out, but this will do. */
add_item(test_items, 1, 2, 3);
add_item(test_items, 3, 7, 13);
add_item(test_items, 5, 2, 1);
twins = get_twins(test_items, holo, mero);
delete_items(test_items);
/* Idiot check. Wouldn't be necessary if I could prove that the above
* set of arbitrarily chosen reflections were always general. */
if ( num_items(twins) != np ) {
ERROR("Whoops! Couldn't find all the twinning possiblities.\n");
abort();
}
return twins;
}
static int resolve_twin(const double *model, ReflItemList *observed,
const double *patt, ReflItemList *items,
ReflItemList *twins, const char *holo, const char *mero)
{
int n, i;
double best_fom = 0.0;
int best_op = 0;
n = num_items(twins);
for ( i=0; i<n; i++ ) {
int j;
int op;
double *trial_ints = new_list_intensity();
unsigned int *trial_counts = new_list_count();
double fom;
ReflItemList *intersection;
op = get_item(twins, i)->op;
for ( j=0; j<num_items(items); j++ ) {
signed int h, k, l;
struct refl_item *r = get_item(items, j);
get_general_equiv(r->h, r->k, r->l, &h, &k, &l,
holo, op);
get_asymm(h, k, l, &h, &k, &l, mero);
set_intensity(trial_ints, h, k, l,
lookup_intensity(patt, r->h, r->k, r->l));
set_count(trial_counts, h, k, l, 1);
}
intersection = intersection_items(observed, items);
fom = stat_pearson(trial_ints, model, intersection);
delete_items(intersection);
free(trial_ints);
free(trial_counts);
//printf(" %f", fom);
if ( fom > best_fom ) {
best_fom = fom;
best_op = op;
}
}
//printf("\n");
return best_op;
}
static void merge_pattern(double *model, ReflItemList *observed,
const double *new, ReflItemList *items,
unsigned int *model_counts, int mo,
ReflItemList *twins,
const char *holo, const char *mero, double *hist_vals,
signed int hist_h, signed int hist_k,
signed int hist_l, int *hist_n)
{
int i;
int twin;
ReflItemList *sym_items = new_items();
if ( twins != NULL ) {
twin = resolve_twin(model, observed, new, items,
twins, holo, mero);
} else {
twin = 0;
}
for ( i=0; i<num_items(items); i++ ) {
double intensity;
signed int hs, ks, ls;
signed int h, k, l;
struct refl_item *item;
item = get_item(items, i);
hs = item->h;
ks = item->k;
ls = item->l;
/* Transform into correct side of the twin law.
* "twin" is always zero if no de-twinning is performed. */
get_general_equiv(hs, ks, ls, &h, &k, &l, holo, twin);
/* Put into the asymmetric cell for the target group */
get_asymm(h, k, l, &h, &k, &l, mero);
intensity = lookup_intensity(new, h, k, l);
/* User asked for max only? */
if ( !mo ) {
integrate_intensity(model, h, k, l, intensity);
} else {
if ( intensity > lookup_intensity(model, h, k, l) ) {
set_intensity(model, h, k, l, intensity);
}
}
/* Already seen this reflection in this pattern? Complain. */
if ( !find_item(sym_items, h, k, l) ) {
/* Add the asymmetric version of this reflection to our
* temporary list. One reflection (in the asymmetric
* unit) may appear more than once per pattern if
* symmetrically related reflections are present.
* That's fine... */
} add_item(sym_items, h, k, l);
/* Increase count count */
integrate_count(model_counts, h, k, l, 1);
if ( hist_vals != NULL ) {
int p = *hist_n;
if ( (h==hist_h) && (k==hist_k) && (l==hist_l) ) {
hist_vals[p] = intensity;
*hist_n = p+1;
}
}
}
/* Dump the reflections in this pattern into the overall list */
union_items(observed, sym_items);
delete_items(sym_items);
}
static void merge_all(FILE *fh, double **pmodel, ReflItemList **pobserved,
unsigned int **pcounts,
int config_maxonly, int config_scale, int config_sum,
int config_stopafter,
ReflItemList *twins, const char *holo, const char *mero,
int n_total_patterns, double *hist_vals,
signed int hist_h, signed int hist_k, signed int hist_l,
int *hist_i)
{
char *rval;
float f0;
int n_nof0 = 0;
int f0_valid = 0;
int n_patterns = 0;
double *new_pattern = new_list_intensity();
ReflItemList *items = new_items();
ReflItemList *observed = new_items();
double *model = new_list_intensity();
unsigned int *counts = new_list_count();
int i;
do {
char line[1024];
signed int h, k, l;
float intensity;
int r;
rval = fgets(line, 1023, fh);
if ( (strncmp(line, "Reflections from indexing", 25) == 0)
|| (strncmp(line, "New pattern", 11) == 0) ) {
/* Start of first pattern? */
if ( n_patterns == 0 ) {
n_patterns++;
continue;
}
/* Assume a default I0 if we don't have one by now */
if ( config_scale && !f0_valid ) {
n_nof0++;
f0 = 1.0;
}
/* Scale if requested */
if ( config_scale ) {
scale_intensities(model, observed,
new_pattern, items,
f0, f0_valid);
}
/* Start of second or later pattern */
merge_pattern(model, observed, new_pattern, items,
counts, config_maxonly,
twins, holo, mero,
hist_vals, hist_h, hist_k, hist_l,
hist_i);
if ( n_patterns == config_stopafter ) break;
/* Reset for the next pattern */
n_patterns++;
clear_items(items);
progress_bar(n_patterns, n_total_patterns, "Merging");
f0_valid = 0;
}
if ( strncmp(line, "f0 = ", 5) == 0 ) {
r = sscanf(line, "f0 = %f", &f0);
if ( r != 1 ) {
f0 = 1.0;
f0_valid = 0;
continue;
}
f0_valid = 1;
}
r = sscanf(line, "%i %i %i %f", &h, &k, &l, &intensity);
if ( r != 4 ) continue;
/* Not interested in the central beam */
if ( (h==0) && (k==0) && (l==0) ) continue;
/* The same raw indices (before mapping into the asymmetric
* unit should not turn up twice in one pattern. */
if ( find_item(items, h, k, l) != 0 ) {
ERROR("More than one measurement for %i %i %i in"
" pattern number %i\n", h, k, l, n_patterns);
}
set_intensity(new_pattern, h, k, l, intensity);
/* NB: This list contains raw indices, before working out
* where they belong in the asymmetric unit. */
add_item(items, h, k, l);
} while ( rval != NULL );
delete_items(items);
free(new_pattern);
/* Calculate mean intensity if necessary */
if ( !config_sum && !config_maxonly ) {
for ( i=0; i<IDIM*IDIM*IDIM; i++ ) {
if ( counts[i] > 0 ) {
model[i] /= (double)counts[i];
}
}
}
*pmodel = model;
*pcounts = counts;
*pobserved = observed;
STATUS("%i patterns had no f0 valid value.\n", n_nof0);
}
static int count_patterns(FILE *fh)
{
char *rval;
int n_total_patterns = 0;
do {
char line[1024];
rval = fgets(line, 1023, fh);
if ( (strncmp(line, "Reflections from indexing", 25) == 0)
|| (strncmp(line, "New pattern", 11) == 0) ) {
n_total_patterns++;
}
} while ( rval != NULL );
return n_total_patterns;
}
int main(int argc, char *argv[])
{
int c;
char *filename = NULL;
char *output = NULL;
FILE *fh;
double *model;
unsigned int *counts;
UnitCell *cell;
int config_maxonly = 0;
int config_stopafter = 0;
int config_sum = 0;
int config_scale = 0;
unsigned int n_total_patterns;
char *sym = NULL;
char *pdb = NULL;
ReflItemList *twins;
ReflItemList *observed;
int i;
const char *holo = NULL;
char *histo = NULL;
signed int hist_h, hist_k, hist_l;
double *hist_vals = NULL;
int hist_i;
/* Long options */
const struct option longopts[] = {
{"help", 0, NULL, 'h'},
{"input", 1, NULL, 'i'},
{"output", 1, NULL, 'o'},
{"max-only", 0, &config_maxonly, 1},
{"output-every", 1, NULL, 'e'},
{"stop-after", 1, NULL, 's'},
{"sum", 0, &config_sum, 1},
{"scale", 0, &config_scale, 1},
{"symmetry", 1, NULL, 'y'},
{"pdb", 1, NULL, 'p'},
{"histogram", 1, NULL, 'g'},
{0, 0, NULL, 0}
};
/* Short options */
while ((c = getopt_long(argc, argv, "hi:e:ro:p:y:g:",
longopts, NULL)) != -1) {
switch (c) {
case 'h' :
show_help(argv[0]);
return 0;
case 'i' :
filename = strdup(optarg);
break;
case 'o' :
output = strdup(optarg);
break;
case 's' :
config_stopafter = atoi(optarg);
break;
case 'p' :
pdb = strdup(optarg);
break;
case 'y' :
sym = strdup(optarg);
break;
case 'g' :
histo = strdup(optarg);
break;
case 0 :
break;
default :
return 1;
}
}
if ( filename == NULL ) {
ERROR("Please specify filename using the -i option\n");
return 1;
}
if ( pdb == NULL ) {
pdb = strdup("molecule.pdb");
}
cell = load_cell_from_pdb(pdb);
free(pdb);
/* Show useful symmetry information */
if ( sym != NULL ) {
holo = get_holohedral(sym);
int np = num_general_equivs(holo) / num_general_equivs(sym);
if ( np > 1 ) {
STATUS("Resolving point group %s into %s "
"(%i possibilities)\n",
holo, sym, np);
/* Get the list of twin/Bijvoet possibilities */
twins = get_twin_possibilities(holo, sym);
STATUS("Twin/inversion operation indices from %s are:",
holo);
for ( i=0; i<num_items(twins); i++ ) {
STATUS(" %i", get_item(twins, i)->op);
}
STATUS("\n");
} else {
STATUS("No twin/inversion resolution necessary.\n");
twins = NULL;
}
} else {
STATUS("Not performing any twin/inversion resolution.\n");
twins = NULL;
sym = strdup("1");
holo = strdup("1");
}
if ( histo != NULL ) {
int r;
r = sscanf(histo, "%i,%i,%i", &hist_h, &hist_k, &hist_l);
if ( r != 3 ) {
ERROR("Invalid indices for '--histogram'\n");
return 1;
}
hist_vals = malloc(10*1024*sizeof(double));
free(histo);
STATUS("Histogramming %i %i %i -> ", hist_h, hist_k, hist_l);
/* Put into the asymmetric cell for the target group */
get_asymm(hist_h, hist_k, hist_l,
&hist_h, &hist_k, &hist_l, sym);
STATUS("%i %i %i\n", hist_h, hist_k, hist_l);
}
/* Open the data stream */
if ( strcmp(filename, "-") == 0 ) {
fh = stdin;
} else {
fh = fopen(filename, "r");
}
free(filename);
if ( fh == NULL ) {
ERROR("Failed to open input file\n");
return 1;
}
/* Count the number of patterns in the file */
n_total_patterns = count_patterns(fh);
STATUS("There are %i patterns to process\n", n_total_patterns);
rewind(fh);
hist_i = 0;
merge_all(fh, &model, &observed, &counts,
config_maxonly, config_scale, config_sum, config_stopafter,
twins, holo, sym, n_total_patterns,
hist_vals, hist_h, hist_k, hist_l, &hist_i);
rewind(fh);
fclose(fh);
if ( hist_vals != NULL ) {
STATUS("%i %i %i was seen %i times.\n", hist_h, hist_k, hist_l,
hist_i);
plot_histogram(hist_vals, hist_i);
}
if ( output != NULL ) {
write_reflections(output, observed, model, NULL, counts, cell);
}
free(sym);
free(model);
free(counts);
free(output);
free(cell);
return 0;
}
|