Lines Matching refs:fl
171 FORM **fl;
212 fl = (FORM**)ckalloc(sizeof(FORM*) * ps->length);
214 fl[i] = (FORM*)ckalloc(sizeof(FORM));
236 fl[i]->prept = (short*)ckalloc(sizeof(short) * ncan);
237 fl[i]->cumerr = (double*)ckalloc(sizeof(double) * ncan);
238 fl[i]->cand = (short**)ckalloc(sizeof(short*) * ncan);
240 fl[i]->cand[j] = (short*)ckalloc(sizeof(short) * nform);
242 fl[i]->cand[j][k] = pcan[j][k];
245 fl[i]->ncand = ncan;
250 if(fl[i-1]->ncand) minerr = 2.0e30;
252 for(k=0; k < fl[i-1]->ncand; k++){ /* for each PREVIOUS map... */
254 ic = fl[i]->cand[j][l];
255 ip = fl[i-1]->cand[k][l];
270 conerr = (rmsdffact * pferr) + fl[i-1]->cumerr[k];
280 fl[i]->prept[j] = mincan; /* point to best previous mapping */
284 ic = fl[i]->cand[j][k];
289 (ftemp == pole[i]->freq[fl[i]->cand[j][1]]))?
303 fl[i]->cumerr[j] = (FBIAS * fbias) + (bfact * berr) + merger +
313 printf("%6.0f ",pole[i]->freq[fl[i]->cand[j][k]]);
316 printf(" cum:%7.2f pp:%d",fl[i]->cumerr[j], fl[i]->prept[j]);
332 printf("\nFrame:%4d mincan:%2d ncand:%2d ",i,mincan,fl[i]->ncand);
335 if(fl[i]->ncand){ /* have candidates at this frame? */
336 minerr = fl[i]->cumerr[0];
338 for(j=1; j<fl[i]->ncand; j++)
339 if( fl[i]->cumerr[j] < minerr ){
340 minerr = fl[i]->cumerr[j];
345 if((j = fl[i]->ncand) > dmaxc) dmaxc = j;
351 k = fl[i]->cand[mincan][j];
371 mincan = fl[i]->prept[mincan];
389 if(fl[i]->ncand){
390 if(fl[i]->cand) {
391 for(j=0; j<fl[i]->ncand; j++) ckfree((void *)fl[i]->cand[j]);
392 ckfree((void *)fl[i]->cand);
393 ckfree((void *)fl[i]->cumerr);
394 ckfree((void *)fl[i]->prept);
398 for(i=0; i<ps->length; i++) ckfree((void *)fl[i]);
399 ckfree((void *)fl);
400 fl = 0;