Skip to content

Commit a8ea34d

Browse files
maojiajingmaojiajing
committed
testAnalysis
1 parent cd9c866 commit a8ea34d

File tree

1 file changed

+221
-0
lines changed

1 file changed

+221
-0
lines changed

‎DT5742/testAnalysis.cc‎

Lines changed: 221 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,221 @@
1+
#include "TROOT.h"
2+
#include "TFile.h"
3+
#include "TTree.h"
4+
#include "TH1F.h"
5+
#include <cstdio>
6+
#include <iostream>
7+
#include <fstream>
8+
#include <sstream>
9+
#include <string>
10+
#include <iostream>
11+
#include <stdio.h>
12+
#include <stdlib.h>
13+
14+
//LOCAL INCLUDES
15+
#include "Aux.hh"
16+
17+
int main()
18+
{
19+
FILE* pFile;
20+
long lSize;
21+
float* buffer;
22+
size_t result;
23+
24+
pFile = fopen ( "caltech_12_14_2016_v3.dat" , "rb" );
25+
if (pFile==NULL) {fputs ("File error\n",stderr); exit (1);}
26+
27+
// obtain file size:
28+
fseek (pFile , 0 , SEEK_END);
29+
lSize = ftell (pFile);
30+
//printf("%d\n", lSize);
31+
rewind (pFile);
32+
33+
// allocate memory to contain the whole file:
34+
buffer = (float*) malloc (sizeof(float)*lSize);
35+
if (buffer == NULL) {fputs ("Memory error\n",stderr); exit (2);}
36+
37+
//define the ouput root file and tree
38+
TFile *f = new TFile("output.root","recreate");
39+
TTree *tree = new TTree("Tree","Tree");
40+
41+
int event;
42+
float time[2][1024];
43+
float raw[18][1024];
44+
float channel[18][1024];
45+
float channelCorrected[18][1024];
46+
float base[18];
47+
48+
tree->Branch("event", &event, "event/I");
49+
tree->Branch("raw", raw, "raw[18][1024]/F");
50+
tree->Branch("channel", channel, "channel[18][1024]/F");
51+
tree->Branch("time", time, "time[2][1024]/F");
52+
53+
int event_size = 73752;
54+
int nevents = lSize/event_size;
55+
56+
std::cout << "nevents: " << nevents << std::endl;
57+
//*************************
58+
//Event Loop
59+
//*************************
60+
event = 0;
61+
for( int ievent = 0; ievent < nevents; ievent++)
62+
{
63+
if ( ievent % 1000 == 0 ) std::cout << "[INFO]: processing event #" << ievent << std::endl;
64+
// copy the file into the buffer:
65+
result = fread (buffer,1,event_size,pFile);
66+
//std::cout << result << " " << ievent << std::endl;
67+
if (result != event_size) {fputs ("Reading error\n",stderr); exit (3);}
68+
double x;
69+
x = *(buffer+6);
70+
for(int j = 0; j < 18; j++)
71+
{
72+
for(int i = 0; i < 1024; i++ )
73+
{
74+
raw[j][i] = buffer[i+6+j*1024];
75+
channel[j][i] = ( raw[j][i] - 2047. )/4096. ;//converting to volts [V]
76+
//std::cout << "i = " << i << " ; j = " << j << " ; raw[j][i] = " << raw[j][i] << " ; channel[j][i] = " << channel[j][i] << std::endl;
77+
time[0][i] = i*0.2;
78+
time[1][i] = i*0.2;
79+
}
80+
}
81+
for(int j = 0; j < 18; j++)
82+
{
83+
//Find Peak Location
84+
int index_min = FindMin (1024, channel[j]); // return index of the min
85+
std::cout << j << " index_min = " << index_min << std::endl;
86+
int index_minraw = FindMin (1024, raw[j]); // return index of the min
87+
std::cout << j << " index_minraw = " << index_minraw << std::endl;
88+
89+
//Estimate baseline
90+
float baseline = GetBaseline( index_min, channel[j]);
91+
std::cout << j << " baseline = " << baseline << std::endl;
92+
float baselineraw = GetBaseline( index_minraw, raw[j]);
93+
std::cout << j << " baselineraw = " << baselineraw << std::endl;
94+
base[j] = baseline;
95+
}
96+
97+
tree->Fill();
98+
event++;
99+
}
100+
101+
102+
//event2
103+
/*
104+
result = fread (buffer,1,lSize,pFile);
105+
std::cout << "EVENT 2 --> "<< result << " " << lSize << std::endl;
106+
if (result != lSize) {fputs ("Reading error\n",stderr); exit (3);}
107+
*/
108+
// for (int i = 0; i < 1024; i++ ) std::cout << buffer[i+6] << " " << buffer[5*1024+i+6] << " " << buffer[2048+i+6] << std::endl;
109+
// for (int i = 0; i < 1024; i++ ) std::cout << buffer[i+6] << " " << buffer[5*1024+i+6] << " " << buffer[2048+i+6] << std::endl;
110+
/* the whole file is now loaded in the memory buffer. */
111+
112+
//float myN = *buffer << 4;
113+
//float myN2 = *buffer >> 4;
114+
//float myN3 = *buffer & 0xFFF0;
115+
//float myN4 = *buffer & 0x0FFF;
116+
//for (int i = 0; i < 1024; i++ )printf("%f\n", *(buffer+i));
117+
//for(int i = 0; i < 1024*18; i++ )printf("%f\n", *(buffer+i));
118+
//printf("%f %f %f %f\n", myN, myN2, myN3, myN4);
119+
// terminate
120+
121+
//check histograms
122+
/*
123+
TH1F *ch0 = new TH1F("ch0","ch0",1024,0,1024);
124+
TH1F *ch1 = new TH1F("ch1","ch1",1024,0,1024);
125+
TH1F *ch2 = new TH1F("ch2","ch2",1024,0,1024);
126+
TH1F *ch3 = new TH1F("ch3","ch3",1024,0,1024);
127+
TH1F *ch4 = new TH1F("ch4","ch4",1024,0,1024);
128+
TH1F *ch5 = new TH1F("ch5","ch5",1024,0,1024);
129+
TH1F *ch6 = new TH1F("ch6","ch6",1024,0,1024);
130+
TH1F *ch7 = new TH1F("ch7","ch7",1024,0,1024);
131+
132+
TH1F *tr0 = new TH1F("tr0","tr0",1024,0,1024);
133+
134+
TH1F *ch8 = new TH1F("ch8","ch8",1024,0,1024);
135+
TH1F *ch9 = new TH1F("ch9","ch9",1024,0,1024);
136+
TH1F *ch10 = new TH1F("ch10","ch10",1024,0,1024);
137+
TH1F *ch11 = new TH1F("ch11","ch11",1024,0,1024);
138+
TH1F *ch12 = new TH1F("ch12","ch12",1024,0,1024);
139+
TH1F *ch13 = new TH1F("ch13","ch13",1024,0,1024);
140+
TH1F *ch14 = new TH1F("ch14","ch14",1024,0,1024);
141+
TH1F *ch15 = new TH1F("ch15","ch15",1024,0,1024);
142+
143+
TH1F *tr1 = new TH1F("tr1","tr1",1024,0,1024);
144+
145+
TH1F *channel0 = new TH1F("channel0","channel0",1024,-0.5,0.5);
146+
TH1F *channel1 = new TH1F("channel1","channel1",1024,-0.5,0.5);
147+
TH1F *channel2 = new TH1F("channel2","channel2",1024,-0.5,0.5);
148+
TH1F *channel3 = new TH1F("channel3","channel3",1024,-0.5,0.5);
149+
TH1F *channel4 = new TH1F("channel4","channel4",1024,-0.5,0.5);
150+
TH1F *channel5 = new TH1F("channel5","channel5",1024,-0.5,0.5);
151+
TH1F *channel6 = new TH1F("channel6","channel6",1024,-0.5,0.5);
152+
TH1F *channel7 = new TH1F("channel7","channel7",1024,-0.5,0.5);
153+
TH1F *channel8 = new TH1F("channel8","channel8",1024,-0.5,0.5);
154+
TH1F *channel9 = new TH1F("channel9","channel9",1024,-0.5,0.5);
155+
TH1F *channel10 = new TH1F("channel10","channel10",1024,-0.5,0.5);
156+
TH1F *channel11 = new TH1F("channel11","channel11",1024,-0.5,0.5);
157+
TH1F *channel12 = new TH1F("channel12","channel12",1024,-0.5,0.5);
158+
TH1F *channel13 = new TH1F("channel13","channel13",1024,-0.5,0.5);
159+
TH1F *channel14 = new TH1F("channel14","channel14",1024,-0.5,0.5);
160+
TH1F *channel15 = new TH1F("channel15","channel15",1024,-0.5,0.5);
161+
TH1F *channel16 = new TH1F("channel16","channel16",1024,-0.5,0.5);
162+
TH1F *channel17 = new TH1F("channel17","channel17",1024,-0.5,0.5);
163+
164+
double x;
165+
double y ;
166+
int ctr = 1;
167+
float* buffer1;
168+
buffer1 = buffer + 6 ;
169+
170+
while(ctr>0 && ctr<1024+1) { x = *(buffer+6+ctr); ch0->SetBinContent(ctr,x); y = (x-2047)/4096 ; channel0->SetBinContent(ctr,y); ctr++;}
171+
while(ctr>1024 && ctr<1024*2+1) { x = *(buffer+6+ctr); ch1->SetBinContent(ctr-1024,x); y = (x-2047)/4096 ; channel1->SetBinContent(ctr-1024,y); ctr++;}
172+
while(ctr>1024*2 && ctr<1024*3+1) { x = *(buffer+6+ctr); ch2->SetBinContent(ctr-1024*2,x); y = (x-2047)/4096 ; channel2->SetBinContent(ctr-1024*2,y); ctr++;}
173+
while(ctr>1024*3 && ctr<1024*4+1) { x = *(buffer+6+ctr); ch3->SetBinContent(ctr-1024*3,x); y = (x-2047)/4096 ; channel3->SetBinContent(ctr-1024*3,y); ctr++;}
174+
while(ctr>1024*4 && ctr<1024*5+1) { x = *(buffer+6+ctr); ch4->SetBinContent(ctr-1024*4,x); y = (x-2047)/4096 ; channel4->SetBinContent(ctr-1024*4,y); ctr++;}
175+
while(ctr>1024*5 && ctr<1024*6+1) { x = *(buffer+6+ctr); ch5->SetBinContent(ctr-1024*5,x); y = (x-2047)/4096 ; channel5->SetBinContent(ctr-1024*5,y); ctr++;}
176+
while(ctr>1024*6 && ctr<1024*7+1) { x = *(buffer+6+ctr); ch6->SetBinContent(ctr-1024*6,x); y = (x-2047)/4096 ; channel6->SetBinContent(ctr-1024*6,y); ctr++;}
177+
while(ctr>1024*7 && ctr<1024*8+1) { x = *(buffer+6+ctr); ch7->SetBinContent(ctr-1024*7,x); y = (x-2047)/4096 ; channel7->SetBinContent(ctr-1024*7,y); ctr++;}
178+
179+
while(ctr>1024*8 && ctr<1024*9+1) { x = *(buffer+6+ctr); tr0->SetBinContent(ctr-1024*8,x); y = (x-2047)/4096 ; channel8->SetBinContent(ctr-1024*8,y); ctr++;}
180+
181+
while(ctr>1024*9 && ctr<1024*10+1) { x = *(buffer+6+ctr); ch8->SetBinContent(ctr-1024*9,x); y = (x-2047)/4096 ; channel9->SetBinContent(ctr-1024*9,y); ctr++;}
182+
while(ctr>1024*10 && ctr<1024*11+1) { x = *(buffer+6+ctr); ch9->SetBinContent(ctr-1024*10,x); y = (x-2047)/4096 ; channel10->SetBinContent(ctr-1024*10,y); ctr++;}
183+
while(ctr>1024*11 && ctr<1024*12+1) { x = *(buffer+6+ctr); ch10->SetBinContent(ctr-1024*11,x); y = (x-2047)/4096 ; channel11->SetBinContent(ctr-1024*11,y); ctr++;}
184+
while(ctr>1024*12 && ctr<1024*13+1) { x = *(buffer+6+ctr); ch11->SetBinContent(ctr-1024*12,x); y = (x-2047)/4096 ; channel12->SetBinContent(ctr-1024*12,y); ctr++;}
185+
while(ctr>1024*13 && ctr<1024*14+1) { x = *(buffer+6+ctr); ch12->SetBinContent(ctr-1024*13,x); y = (x-2047)/4096 ; channel13->SetBinContent(ctr-1024*13,y); ctr++;}
186+
while(ctr>1024*14 && ctr<1024*15+1) { x = *(buffer+6+ctr); ch13->SetBinContent(ctr-1024*14,x); y = (x-2047)/4096 ; channel14->SetBinContent(ctr-1024*14,y); ctr++;}
187+
while(ctr>1024*15 && ctr<1024*16+1) { x = *(buffer+6+ctr); ch14->SetBinContent(ctr-1024*15,x); y = (x-2047)/4096 ; channel15->SetBinContent(ctr-1024*15,y); ctr++;}
188+
while(ctr>1024*16 && ctr<1024*17+1) { x = *(buffer+6+ctr); ch15->SetBinContent(ctr-1024*16,x); y = (x-2047)/4096 ; channel16->SetBinContent(ctr-1024*16,y); ctr++;}
189+
190+
while(ctr>1024*17 && ctr<1024*18+1) { x = *(buffer+6+ctr); tr1->SetBinContent(ctr-1024*17,x); y = (x-2047)/4096 ; channel17->SetBinContent(ctr-1024*17,y); ctr++;}
191+
*/
192+
/*
193+
while(ctr>0 && ctr<1024+1) { x = *(buffer+6+ctr); ch0->SetBinContent(ctr,x); ctr++;}
194+
while(ctr>1024 && ctr<1024*2+1) { x = *(buffer+6+ctr); ch1->SetBinContent(ctr-1024,x); ctr++;}
195+
while(ctr>1024*2 && ctr<1024*3+1) { x = *(buffer+6+ctr); ch2->SetBinContent(ctr-1024*2,x); ctr++;}
196+
while(ctr>1024*3 && ctr<1024*4+1) { x = *(buffer+6+ctr); ch3->SetBinContent(ctr-1024*3,x); ctr++;}
197+
while(ctr>1024*4 && ctr<1024*5+1) { x = *(buffer+6+ctr); ch4->SetBinContent(ctr-1024*4,x); ctr++;}
198+
while(ctr>1024*5 && ctr<1024*6+1) { x = *(buffer+6+ctr); ch5->SetBinContent(ctr-1024*5,x); ctr++;}
199+
while(ctr>1024*6 && ctr<1024*7+1) { x = *(buffer+6+ctr); ch6->SetBinContent(ctr-1024*6,x); ctr++;}
200+
while(ctr>1024*7 && ctr<1024*8+1) { x = *(buffer+6+ctr); ch7->SetBinContent(ctr-1024*7,x); ctr++;}
201+
202+
while(ctr>1024*8 && ctr<1024*9+1) { x = *(buffer+6+ctr); tr0->SetBinContent(ctr-1024*8,x); ctr++;}
203+
204+
while(ctr>1024*9 && ctr<1024*10+1) { x = *(buffer+6+ctr); ch8->SetBinContent(ctr-1024*9,x); ctr++;}
205+
while(ctr>1024*10 && ctr<1024*11+1) { x = *(buffer+6+ctr); ch9->SetBinContent(ctr-1024*10,x); ctr++;}
206+
while(ctr>1024*11 && ctr<1024*12+1) { x = *(buffer+6+ctr); ch10->SetBinContent(ctr-1024*11,x); ctr++;}
207+
while(ctr>1024*12 && ctr<1024*13+1) { x = *(buffer+6+ctr); ch11->SetBinContent(ctr-1024*12,x); ctr++;}
208+
while(ctr>1024*13 && ctr<1024*14+1) { x = *(buffer+6+ctr); ch12->SetBinContent(ctr-1024*13,x); ctr++;}
209+
while(ctr>1024*14 && ctr<1024*15+1) { x = *(buffer+6+ctr); ch13->SetBinContent(ctr-1024*14,x); ctr++;}
210+
while(ctr>1024*15 && ctr<1024*16+1) { x = *(buffer+6+ctr); ch14->SetBinContent(ctr-1024*15,x); ctr++;}
211+
while(ctr>1024*16 && ctr<1024*17+1) { x = *(buffer+6+ctr); ch15->SetBinContent(ctr-1024*16,x); ctr++;}
212+
213+
while(ctr>1024*17 && ctr<1024*18+1) { x = *(buffer+6+ctr); tr1->SetBinContent(ctr-1024*17,x); ctr++;}
214+
*/
215+
tree->Write();
216+
f->Write();
217+
f->Close();
218+
fclose (pFile);
219+
free (buffer);
220+
return 0;
221+
}

0 commit comments

Comments
 (0)