ZH_data.C

// already in *h #define DEBUG 1
#define ZHDEBUG 0
/*
    ./compile_root xml_attr.C  ZH_data.C
----------------------------------------------

.L xml_attr.C
.L log_term.C
.L ZH_data.C

ZH_data(1000, "RUN018_V" , "zhfile.xml", "plugins", "poper", "definitions" )
ZH_data(1000, "/home/ojr/AA_share/DATA/20130621_o17_dp_an/RUN0121_V" , "zhfile.xml", "plugins", "poper", "definitions" )

*/
#include "ZH_data.h"
#include "xml_attr.h"
#include "log_term.h"
#include "mut_queue.h"



#include <stdio.h>        // also   4 strcmp

#include "TROOT.h"    // Main INCLUDE !!!!
//in h #include "TFile.h"
//in h #include "TH1F.h"
#include "TTree.h"
#include <stdlib.h>     /* atof */
#include <string.h>         // strcmp
#include <string>         // strcmp

//int ZHbuffer[350000000];// 99M*4  // I MUST USE int!!!!!!????

// int ZHbuffer[99000000];// 99M*4  // I MUST USE int!!!!!!????
// int ZHbuffer[199000000];// 599M*4  // I MUST USE int!!!!!!????

int* ZHbuffer; // I TRY to malloc it

 int OEbuf[1000];//  ONE EVENT buffer; ;

char OverrideFileOUT[300];
Long64_t ZHbuffer_last; // last allocated cell

 int OEBmax;// ONE EVENT LIMIT !!!!!!!!!!
 Long64_t DataRead; // HowMuch was read to buffer

 Long64_t cnt_evt; // event number

 Long64_t cnt_evt_data; // event number, data not time// in TTree

//const int MAXCHAN=2048; // time is 1024+
   int       T_yn[MAXCHAN];//  4 levels (t1 t2 t3 t4)
   TH1F*     Thist;      
  //  one histogram for ALL
   TH1F*     ThistCNT;     //  counter's readout timediff
   TH1F*     ThistCan=NULL;     //  channel's readout timediff

   int       C_yn[MAXCHAN]; //level lo or hi ==  1 or 2
   Long64_t   COUN[MAXCHAN];// total (displays in title)
   TH1F*     COUNhist[MAXCHAN];//histo to fill 
   Long64_t   COUNtmp[MAXCHAN]; //one shot value (2 passes)
   TH1F*     HIST[MAXCHAN];    //address of NULL
   UShort_t  TREE[MAXCHAN];    //variables to clear after fill
   UShort_t  ZERO[MAXCHAN];    //fast reset to TREE
// - s : a 16 bit unsigned integer (UShort_t)
   TTree *ZH_tree;


 Double_t cTIME; // current data TIME (always>0)
 Double_t cTIME_root; // current data TIME (always>0)
 Double_t bTIME; // buffered time (mostly 0)
 Double_t sTIME; // startup time
 Double_t dTIME; // difference


 TFile *ftree;

/*----------------what can be done with channel-------------
1/ fill histo
 chan008
2/ decompose time ...1st approach: any time updates current
  a/ 1024
  b/ 1028
  c/ 141
  d/ ...
3/ run number 139
4/ block 140
5/ counters
X/   FILL TREE
nanot:
info                 souvisle pole      individ
timeV rnumV bnumV ...  V001 V002   ...  countrs

chan   histo   map_to_ttree   time
1       &TH1F    &var          
 */





//=======================  service===  read buffer from disk----
int fillbuffer( const char* datafile){
  FILE *f;
  //  int *pch=&ZHbuffer[0];
  //  printf( "I see   /%lx=%lx/\n",   (int64_t)pch, (int64_t)ZHbuffer );

  if ( fexists( datafile) <= 0) {
     printf("BAD  FILE = %s, file doesnot exist\n",datafile);return 1;
  }else{ 
     printf("GOOF FILE = %s, file exists       \n",datafile);
  }

  f=fopen( datafile , "rb" );
  if (f==NULL){ printf("BAD FILE = /%s/, ccannot open\n",datafile);return 1;}
  //  DataRead=fread( pch , 1, sizeof(ZHbuffer) , f  );

  printf("Trying to allocate  /%.1f/ MB of memory\n", 1.0*fexists( datafile)/1024./1024. );
  ZHbuffer = (int*) malloc ( fexists( datafile) );
  ZHbuffer_last=fexists( datafile)  ;

  printf("Trying to readout   /%.1f/ MB of memory\n", 1.0*fexists( datafile)/1024./1024. );
  DataRead=fread( ZHbuffer , 1, fexists( datafile) , f  );

  printf("%lld bytes READ  (=%.1f MB   filesize=%.1f)\n",
	 DataRead , 1.0*DataRead/1024./1024., 
	 //	 1.0*sizeof(ZHbuffer)/1014./1024.,
	 1.0*fexists( datafile)/1014./1024. );
  fclose(f);
  return 0;
}


//==========================service=== prepare  <int> ====4Bytes
//0000  e001    0012    008b    0000    F000   from OD translates to 
//e0010000     008b0012         f0000000  


// int EOE= 0xf0000000;//end of event
// int BOR= 0xEFFFFFFF;//begin of run
// int BOE= 0xe0000000;//begin of event
// int BOEm=0xe000ffff;//begin of event




Long64_t fillOEB(Long64_t pos){ // 
  Long64_t c=0;
   while( 1==1  ){

     //notwrk   if ( (pos+c % 1000000 )==0 ){ printf("...byte %lld\n", pos+c); }

     if (DEBUG!=0)printf("/%08X/ ",  ZHbuffer[pos+c] );
    OEbuf[c]= ZHbuffer[pos+c];
    if (OEbuf[c]==EOE){ return pos+c+1;}
    //    if (pos+c>=DataRead){ break;} // If not all data read, break
    c++; 
    //    if (pos+c>=ZHbuffer_last-1 )return -1;  // zhbuffer_last...

     if ( (pos+c)*4>ZHbuffer_last )return -1;  // zhbuffer_last... 
     //    if ( 4*(pos+c)>=DataRead )return -1;  // zhbuffer_last
  }//while
   if (DEBUG)printf("\n%s", ""  );//4
  //  printf("\n    sizeof(int)==%ld\n", sizeof(word)  );//4

  return pos+c+1;
}



int channels_in_event(int word){// mask Exxx0000 and shif by two nibbles
  return (word&0x0fff0000)>>16;
}



void reset_chan_table(){//  PREPARE CLEAN TABLE
for (int i=0;i<MAXCHAN;i++){T_yn[i]=0;}//0 1 2 3 4
for (int i=0;i<MAXCHAN;i++){C_yn[i]=0;}
for (int i=0;i<MAXCHAN;i++){COUN[i]=0;}
for (int i=0;i<MAXCHAN;i++){COUNtmp[i]=0;}
for (int i=0;i<MAXCHAN;i++){COUNhist[i]=NULL;}
for (int i=0;i<MAXCHAN;i++){HIST[i]=NULL;}   
for (int i=0;i<MAXCHAN;i++){TREE[i]=0;}   
 for (int i=0;i<MAXCHAN;i++){ZERO[i]=0;}//remains always 0
 cTIME=0.0;// current event time
 cTIME_root=0.0;// event reffered var by TTree -offset
 cnt_evt=0;
 cnt_evt_data=0;
 sTIME=0.0;
 bTIME=0.0; // just for fun - (t)event buffer
 dTIME=0.0; // just for fun - difference

 Thist=NULL; // YOU CAN do again:    acq()    without crash
 ThistCNT=NULL;
}


  //  sprintf( initline,   "chanlo=%d,chanhi=%d,kc014A=%d,kc014B=%d,kc014C=%d,ltime=%d,btime=%d,bnum=%d,c257=%d,c32=%d,v560na=%d,v560nb=%d,parnam=%s,tzero=%lf,circular=%d", 	   chanlo, chanhi,kc014A,kc014B,kc014C,ltime,btime,bnum,c257,c32,v560na,v560nb,parnam,tzero,	   circular); 











//=================================== TH1F ======= TTree ==========================
//  c001     normal  channels  (even block#...:(  )
//     ===  t1 t2 t3 t4  ;   s001...     1..999
//    c001=1  means put what arrives from channel1 to histogram 1
//=================================================================================


void load_chan_table(const char *str2k ){ // LOAD channel properties into the table
                                      // EITHER histo OR time OR counter:   not two
  char conf[2000];
  //="c001=1,c002=2,c003=3,c004=4,c005=5,c006=6,c007=7,c008=8,c009=9,c010=10,c011=11,c1024=t1,c1025=t2,c1026=t3,c1027=t4,c033=s001,c035=s002,c037=s003";
  strcpy( conf, str2k );

  //-------------variables for tokens-------
  char tok[100];
  char tokres[300];
  int toki;
  int MAXCH_4000=4096;


  char ch[1000];//  DEFINE TTree; I make it 1 leaf/branch
  char ttree_name[150];//
  char brname[300];   //
  int ttree_exists=0; // NO, but to be checked...

  sprintf( ttree_name, "%s",  "nanot"  ); 
  if ( gDirectory->Get( ttree_name ) != NULL){ ttree_exists=1;  }



  time_t curtime;  struct tm *loctime;  
  char begin[600];
  char *end;
  char tokres2[600];
//if (ZH_tree==NULL){//==========================ZH TREE   BEGIN==
  if ( ttree_exists==0 ){//=========================ZH TREE   BEGIN==

    // //tokres contains the output FILENAME
    // int runnum=0;
    // //I dont know how to enter with file= runnum here....
    // // TokenGet("runnum=",mmap_file,runnum); // takes a value from mmap
    // if (runnum>0){
    //   printf("RUN NUMBER DEFINED %d\n",runnum);
    //   char runxx[100];
    //   sprintf( runxx, "run%d", runnum );
    //   strcpy( tokres, runxx );
    // }else{
    toki=TokenGet( "file=", conf , tokres);
    if ( strlen(OverrideFileOUT)>0){
      //      printf("Override filename is %s\n", OverrideFileOUT );
      strcpy( tokres, OverrideFileOUT ); // (dest,src)
      if (strrchr( tokres, '.' )==NULL){// no .root
	strcat( tokres, ".root");
      }
      //      printf("Override filename is %s\n", OverrideFileOUT );
      //      printf("Override tokres is  %s\n",  tokres );
    }
    //    }


    if (strlen(tokres)>0){
      if ( fexists(tokres)>=0){      
	printf("...fexists tokres is  %s\n",  tokres );

	curtime = time (NULL);  loctime = localtime (&curtime);
	end=strrchr( tokres, '.' ); // .root
	if ( end==NULL){
	  end=strstr(tokres,""); // first occurence of "" is [0]
	}//doesnot work much- i put start,not the end....
	memcpy( begin,  tokres,  end-tokres ); // copy begin
	begin[ end-tokres] = '\0';

	sprintf(tokres2,"%s_%04d%02d%02d_%02d%02d%02d%s", begin,
		1900+loctime->tm_year,   1+loctime->tm_mon,  
		loctime->tm_mday,  loctime->tm_hour,   
		loctime->tm_min,  loctime->tm_sec,
		end);

	
	printf("...TECHNICAL: {%s} + {%s} {%d}\n{%s}=original ***\n", begin, end, end-tokres,  tokres );
	printf("...TECHNICAL: file %s\n ... I rename it to %s\n",
	       tokres, tokres2 );
	sprintf(tokres, "%s", tokres2 );
      }//fexists >=0

      ftree=new TFile(tokres, "NEW" );
      if (ftree==NULL){ printf( "%s *** NO TTREE  FILE  OPENED !!!!\n" , ""); return;}

      ftree->cd();
      ZH_tree = new TTree( ttree_name , "ttree_from_ZH_data");  
    }else{ //TOKRES!=""  file= TOKEN -----------------------------
      gROOT->cd(); // go to memory resident ttree
      ZH_tree = new TTree( ttree_name , "ttree_from_ZH_data");  
    }

    toki=TokenGet( "circtree=", conf , tokres);
    if (toki>0){//CIRCTREE = 100 000
      ZH_tree->SetCircular( toki ); //set it CIRCULAR....
      printf("circular TTree %d events\n",  toki );
    }// toki>0

    toki=TokenGet( "maxchan=", conf , tokres);
    if (toki>0){//maximum channel 4096
      MAXCH_4000=toki;
      printf("maximum channel is  %d \n",  toki );
    }// toki>0


    ZH_tree->Branch( "time" , &cTIME_root, "time/D" );// /D == Double_t 64bit
    ZH_tree->Branch( "cnt_evt" , &cnt_evt_data, "n/L" );// /: == Long64_t 64bi
}else{ // already exists..........???
    ZH_tree->SetBranchAddress( "time" ,&cTIME_root );
    ZH_tree->SetBranchAddress( "cnt_evt" ,&cnt_evt_data );// /i == Long64_t 64bit
  }//==============================================ZH TREE   END====




  //================================ histograms____vvvvv_________
  // HERE I DEFINE TH1F---------------------------TH1F---------
  for (int i=1; i< MAXCHAN; i++){//  c0001-c2000

    sprintf( tok, "c%03d=", i ); 
    toki=TokenGet( tok, conf, tokres); // get the integer after c001=

    if (toki!=0){// integer was found => it is HISTO------------
      sprintf( tok, "c%03d", toki ); // new channel=arbitrary integer<=999
      TH1F *h=new TH1F( tok, tok, MAXCH_4000,0,MAXCH_4000);
      HIST[i]=h;

      // DEFINE TTREE...........for every histo channel....
      sprintf( brname,  "V%03d", toki );//  branch  c001 
      sprintf(ch ,"%s/s", brname );  //  UShort_t ===  /s  
      if (ttree_exists==0){// does not exist yet
	ZH_tree->Branch(brname , &TREE[i], ch );// 
      }else{// already exists
	ZH_tree->SetBranchAddress( brname ,&TREE[i] );
      }//ttree existence

    }else if(strlen(tokres)>0){//-----NOT HISTO-----------------

      if ( strstr(tokres,"t")!=NULL){//time--------
	tokres[0]='0';
	T_yn[i]=atoi( tokres );   //  Thist will be defined later
	printf("ZH:time %d  defined (part %d)\n", i, T_yn[i]  );
      }//TIME

      if ( strstr(tokres,"e")!=NULL){//extended channel c001=e001 --------
	tokres[0]='0';
	toki=atoi( tokres );   //  Thist will be defined later
	if (toki!=0){// integer was found afte e  => it is HISTO------------
	  sprintf( tok, "c%03d", toki ); // new channel=arbitrary integer<=999
	  TH1F *h=new TH1F( tok, tok, 100000,0,100000); // EXTRA SIZE
	  HIST[i]=h;
	  
	  // DEFINE TTREE...........for every histo channel....
	  sprintf( brname,  "V%03d", toki );//  branch  c001 
	  sprintf(ch ,"%s/s", brname );  //  UShort_t ===  /s  
	  if (ttree_exists==0){// does not exist yet
	    ZH_tree->Branch(brname , &TREE[i], ch );// 
	  }else{// already exists
	    ZH_tree->SetBranchAddress( brname ,&TREE[i] );
	  }//ttree existence
	}
      }//EXTENDED - just histo size, TTREE remains the same


      if ( strstr(tokres,"s")==tokres){//counter----------- =s001, =s002...
	//        sprintf( tok, "s%03d", i ); 
	TH1F *h=new TH1F( tokres, tokres, 99000,0,99000);
	COUNhist[i]=h;
	C_yn[i]=1;
	C_yn[i+1]=2; // his number 2 - cover
	printf("ZH:counter %d defined\n", i  );

	// DEFINE TTREE...........for every counter channel....
	sprintf( brname,  "%s", tokres );//  branch  s001 
	sprintf(ch ,"%s/s", brname );  //  UShort_t ===  /s  
	//	printf("defining branch /%s/\n", brname  );
	if (ttree_exists==0){// does not exist yet
	  ZH_tree->Branch(brname , &TREE[i], ch );// 
	}else{// already exists
	  ZH_tree->SetBranchAddress( brname ,&TREE[i] );
	}//ttree existence


     }//COUNTER
    }// else....if something in the string ....NOT SOLE NUMBER
    //-------------------------------------HISTO -----------------end----
 
  }//MAXCHAN
}//======================================================+END OF FUNCTION============
  /*
  T_yn[1024]=1;
  T_yn[1025]=2;
  T_yn[1026]=3;
  T_yn[1027]=4;
  */

  // search TokenGet for
  //  c001=1
  //  c023=23
  //  h02a=24
  //-----------this gets you max # of  channels
  //h0400=t1  :  time, everythig else NULL automaticaly
  //c1025=t2
  //c1026=t3
  //c1027=t4
  //-----------
  //c077=s001   :  counter 1    (it takes always TWO channels and SUMS)
  //c079=s002   :  counter 2
  //--------------this gets you max # of counters








void process_chan(int ch,  int val){// KEY:fill propper histos,counters,time

  char mmm[100]; // titles

  if (T_yn[ch]==0){ //not TIME
    //----------------------
    if (C_yn[ch]==1){// COUNTER Lo
      COUN[ch]+=val;
      COUNtmp[ch]=val;// Must be in lo-hi order
      
    }
    if (C_yn[ch]==2){// COUNTER Hi
      // VERY SPECIFIC HANDLE OF COUNTERS (PAIRS)
      COUN[ch-1]+=val<<16;
      COUNtmp[ch-1]+=val<<16;

      COUNhist[ch-1]->Fill( COUNtmp[ch-1] );// Fill Histogram

      //      if (ThistCNT==NULL){
      //	ThistCNT=new TH1F("Thist_cnt","counters:time differences;seconds", 			  1800, 0, 180 );
      //      }
      ThistCNT->Fill(  cTIME-ROOT_offset );

      sprintf(mmm,"TOTAL COUNTS = %lld / %.1f",COUN[ch-1],
	      COUNhist[ch-1]->GetEntries() * COUNhist[ch-1]->GetMean() );
      COUNhist[ch-1]->SetTitle( mmm );
      TREE[ch-1]= COUNtmp[ch-1] ; // prepare the variable for tree
    }
    //----------------------
    if (HIST[ch]!=NULL){// HISTO
      HIST[ch]->Fill(val);
      TREE[ch]=val; // keep until TTree -> Fill
    }


  }else{// TIME...... forget everything else date -d @1299941976
    //=========VERY SPECIFIC TREATMENT OF TIME INFORMATION=======
    if (T_yn[ch]==1){bTIME=bTIME+0.000001*val;}
    if (T_yn[ch]==2){bTIME=bTIME+0.000001*(val<<16);}
    if (T_yn[ch]==3){bTIME=bTIME+val;}
    if (T_yn[ch]==4){bTIME=bTIME+(val<<16);
      if (Thist==NULL){
	//-----------THisto
	Thist=new TH1F("Thist","Thist", 
		       86400+4*3600, bTIME-ROOT_offset, bTIME+86400+4*3600-ROOT_offset );
	Thist->GetXaxis()->SetTimeDisplay(1);
	Thist->GetXaxis()->SetTimeFormat( "#splitline{%d.%m}{%H:%M}%F1994-12-31 22:00:00s" );
	//-----------CNT
	ThistCNT=new TH1F("ThistCNT","event in counters vs. time", 
		       86400+4*3600, bTIME-ROOT_offset, bTIME+86400+4*3600-ROOT_offset );
	ThistCNT->GetXaxis()->SetTimeDisplay(1);
	ThistCNT->GetXaxis()->SetTimeFormat( "#splitline{%d.%m}{%H:%M}%F1994-12-31 22:00:00s" );
	//-----------Can
	ThistCan=new TH1F("ThistCan","event in channels vs. time", 
		       86400+4*3600, bTIME-ROOT_offset, bTIME+86400+4*3600-ROOT_offset );
	ThistCan->GetXaxis()->SetTimeDisplay(1);
	ThistCan->GetXaxis()->SetTimeFormat( "#splitline{%d.%m}{%H:%M}%F1994-12-31 22:00:00s" );

      }// Thit==NULL
      Thist->Fill( bTIME-ROOT_offset );
      sprintf( mmm, "TOTAL TIME %9.2f sec (%8.2f min)" , 
	       bTIME-sTIME, (bTIME-sTIME)/60.0  );
      Thist->SetTitle( mmm );
      if (DEBUG)printf("TIME = %13.6f\n", bTIME );
    }//if ==4
  }//T_yn


}//ONE CHANNEL PROCESS









void process_BOE(){// begin of event - do cleaning
  //  cTIME=0.0; //cannot do, ay events dont have time mark
  bTIME=0.0;  // this checks if the event was data or time

 //?everytime 2048??? too slow.....
 // for (int i=0;i<MAXCHAN;i++){TREE[i]=0;}  // clear  the data for tree.
  memcpy ( TREE, ZERO,  sizeof( UShort_t)*MAXCHAN ) ;//FAST

  //  for (int i=0;i<MAXCHAN;i++){COUNtmp[i]=0;}//clear tmp cntr storage ??

}//BOE...finish






void process_EOE(){   // end of event - do filling
    cnt_evt++;
  if (bTIME==0){// bTIME==0  =>  real EVENT
    //enter cTIME to TTREE struct .....


    ZH_tree->Fill();// EVERY NON TIME EVENT - WE SAVE
    if (ThistCan!=NULL){ThistCan->Fill(  cTIME-ROOT_offset );}

    cnt_evt_data++;
  }//SAVE EVENT done
  else{// bTIME!=0  =>  just a new time.....
    cTIME=bTIME;
    cTIME_root=cTIME - ROOT_offset;
    if (sTIME==0.0)sTIME=cTIME; // one time only
  }//just a new time mark
}//EOE...finish






//=========================================
int process_ONE_EVENT(int *arr,  int *BUFANAL ){// translate buffer with one event to data
  // I still omit xcheck # channels:  e004 vs pos

   concurrent_queue<int> *bubu=(concurrent_queue<int>*)BUFANAL;
   //   sprintf(chL,"POE: ZH  : BUFF2==%ld",(int64_t)bubu);table_log(0,chL);


  int pos=0; // normaly 1st place is e000, but can be bor...
  int chn;
  int val;
  process_BOE();// zero TTree; reset bTIME(this evt buffr)
  while( 
	(  (arr[pos] & BOEm) != BOE ) &&
           (arr[pos] != EOE)	// finish with EOE
	  &&(pos<OEBmax) 

	 ){
    //    printf("==========> %08X\n",arr[pos] );
    pos++;
  }
  //  if ( arr[0]==BOR ){ printf("begin of run\n%s", "" ); }
  //  printf(":%08X\n",arr[pos] ); //{ printf("begin of run\n%s", "" ); }


  if (ZHDEBUG)printf("::%6lld   (%2d pairs)   d=%.3f \n", cnt_evt,  channels_in_event(arr[pos]),  cTIME-sTIME  ); 

  pos++; //move next from E000
  while(  (arr[pos] != EOE)&&(pos<OEBmax)  ){ // until EOE
    chn=(arr[pos] & 0xffff0000)>>16;
    val=(arr[pos] & 0x0000ffff);

    if (ZHDEBUG)printf("%3d/    %6d - %6d     0x%08x \n",  pos, chn, val, arr[pos] );  
    
    process_chan( chn, val );
    if (bubu!=NULL){ bubu->push( chn );bubu->push( val );}

    pos++;
  }//parse events.........
  if (bubu!=NULL){  bubu->push( 0xffffffff );  bubu->push( 0xffffffff );}

  //------------------------END OF EVENT
  process_EOE();// cnt_evt++;cnt_evt_data++; FILL; // cTime reset 
  
  if (ZHDEBUG)printf("::%6lld  pos==%2d \n", cnt_evt, pos); 

  return 0;
}//process_ONE_EVENT__________________________________________END___





/*************************************************************
 *
 *       M A I N    part
 *
 *************************************************************
 */




//-------------- xmlfile:  plugins / poper / file=""
//void ZH_data(int events, const char* datafileA,  const char* xmlfile, 
//	     const char* search,const char* seq,const char* searchatt){



void ZH_data(int events, 
	     const char* datafileIN,  
	     const char* datafileOUT,  
	     
	     const char* xmlfile, 
	     const char* search,const char* seq,const char* searchatt){
  //	     const char* search="plugins",const char* seq="popper",const char* searchatt="definitions"){

  printf("SEARCH/SEQ/SEARCHATT= %s %s %s\n", search, seq,  searchatt );
  //  int events = 10000; // LIMIT !!!!!!!
//void ZH_data(int events){

  //======== STANDARD  STARTUP ==============================
  OEBmax=1000;// ONE EVENT LIMIT !!!!!!!!!!
  DataRead=0; // HowMuch was read to buffer
  cnt_evt=0; // event number

 cTIME=0.0; // current data TIME (always>0)
 cTIME_root=0.0; // current data TIME (always>0)
 bTIME=0.0; // buffered time (mostly 0)
 sTIME=0.0; // startup time
 dTIME=0.0; // difference

 reset_chan_table();
  /*
translation
c001  ... original channels from data (e.g.c1024==time)
translates to
if number      1..   -> histograms  c001.. (simple channel)
if t1..t4            -> time mark, 
if s001..            ->counter (1st+2nd channels x 65000); "TOTAL" in title
   */  

 char  acqxml2[2000];// must be enough if you want long line

 strcpy( acqxml2, xmlfile );
 TSmallish_xml xml(    acqxml2   );
 
 // xml.DisplayTele( xml.mainnode, 0, "plugins","poper","definitions" );
 xml.DisplayTele( xml.mainnode, 0, search, seq,  searchatt );
 sprintf( acqxml2 ,"%s", xml.output  );

 strcpy( OverrideFileOUT, datafileOUT ); // We will use OVERRIDE

 load_chan_table(  acqxml2  ); //  here the "file=" token can be loaded
  printf( "LOAD_CHAN_TABLE LOADED:\n%s\n\n"  , acqxml2 );

  //  load_chan_table("c001=1,c002=2,c003=3,c004=4,c005=5,c006=6,c007=7,c008=8,c009=9,c010=10,c011=11,c1024=t1,c1025=t2,c1026=t3,c1027=t4,c033=s001,c035=s002,c037=s003" );

//datafile = RUN018_V
//"/home/ojr/00_central/Root/03_programs/58_kibbler_narval/RUN018_V"

// READ BUFFER// one time READ DATA FROM FILE
//  printf( "FILL BUFFER LOAD?: /%s/\n"  ,datafileA );

  printf("%s","...before allocation\n");
  if (0!= fillbuffer( datafileIN ) ){
    printf ("FILE %s not opened..............ending\n", "");
    return;
  }
  printf("%s","...after allocation\n");
  //  printf( "FILL BUFFER LOADED: /%s/\n"  ,datafileA );

  Long64_t pos=0;

  //---------already in *h   #define DEBUG 0
  Long64_t ie=0;
  //  for (int i=0;i<events;i++){
  while ( (events<0) || (ie<events) ){ // if events < 0=> limit
    ie++;  
        if ( ie % 1000000==0){ printf("... Mevent # %10lld\n" , ie/1000000); }
    //    if ( ie % 1000==0){ printf("... event # %10lld\n" , ie); }
  
  pos=fillOEB(pos);

   if (pos<0)break;

   process_ONE_EVENT(OEbuf, NULL);


  }

  printf("%lld (total) events done\n" , ie);   
  gDirectory->ls();
  printf("%lld (total) events done, closing files\n" , ie); 

  if ( ftree!=NULL) {   
    printf( "%s\n","...Writing the tree\n");
    ZH_tree->Write();
    ftree->Write(); 
    ftree->Close();   
  } 

  if (ZHbuffer != NULL){ 
    printf( "%s\n","...freeing the memory");
    free (ZHbuffer); 
  }

  // NOW I HAVE ALL THE DATA in MEM & in TTREE
}//ZH_data__________________________________________


void ZH_data(int events, 
	     const char* datafileIN,  
	     const char* datafileOUT,  
	     
	     const char* xmlfile){
	     //	     const char* search,const char* seq,const char* searchatt){
  //	     const char* search="plugins",const char* seq="popper",const char* searchatt="definitions"){
  printf("Using automatic   \"plugins\",\"popper\",\"definitions\" \n%s","");
     ZH_data(events, datafileIN, datafileOUT, xmlfile, 
             "plugins","poper","definitions"  );

}