sepaerate Analyzer_Utili.C, add pxi-time-order.c
This commit is contained in:
parent
06d3e52601
commit
0acff94f90
3
.gitignore
vendored
3
.gitignore
vendored
|
|
@ -8,7 +8,10 @@ xia2root
|
||||||
xia2ev2*
|
xia2ev2*
|
||||||
pixie2root
|
pixie2root
|
||||||
scan
|
scan
|
||||||
|
pxi-time-order
|
||||||
|
|
||||||
*.so
|
*.so
|
||||||
*.d
|
*.d
|
||||||
*.pcm
|
*.pcm
|
||||||
|
|
||||||
|
ti74pt7a
|
||||||
|
|
|
||||||
62
Analyzer.C
62
Analyzer.C
|
|
@ -31,9 +31,9 @@ TH2F * hgg[NCLOVER][NCLOVER];
|
||||||
|
|
||||||
TH2F * hcoin;
|
TH2F * hcoin;
|
||||||
|
|
||||||
///----- after calibration
|
///----- after calibration and BGO veto
|
||||||
TH2F * heCalVID;
|
TH2F * heCalVID;
|
||||||
TH1F * heCal[NCLOVER]; // BGO veto
|
TH1F * heCal[NCLOVER];
|
||||||
TH2F * hcoinBGO;
|
TH2F * hcoinBGO;
|
||||||
|
|
||||||
void Analyzer::Begin(TTree * tree){
|
void Analyzer::Begin(TTree * tree){
|
||||||
|
|
@ -129,58 +129,6 @@ Bool_t Analyzer::Process(Long64_t entry){
|
||||||
return kTRUE;
|
return kTRUE;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
void listDraws(void) {
|
|
||||||
printf("------------------- List of Plots -------------------\n");
|
|
||||||
printf(" rawID() - Raw e vs ID\n");
|
|
||||||
printf(" drawE() - Raw e for all %d detectors\n", NCLOVER);
|
|
||||||
printf("-----------------------------------------------------\n");
|
|
||||||
}
|
|
||||||
|
|
||||||
void rawID(){
|
|
||||||
TCanvas * cRawID = (TCanvas *) gROOT->FindObjectAny("cRawID");
|
|
||||||
if( cRawID == NULL ) cRawID = new TCanvas("cRawID", "raw ID", 1000, 800);
|
|
||||||
cRawID->cd(1)->SetGrid();
|
|
||||||
heVID->Draw("colz");
|
|
||||||
}
|
|
||||||
|
|
||||||
void drawE(bool isLogy = false, bool cali = false){
|
|
||||||
|
|
||||||
int numCol = NCLOVER / 4;
|
|
||||||
|
|
||||||
TCanvas *cRawE = (TCanvas *) gROOT->FindObjectAny("cRawE");
|
|
||||||
if( cRawE == NULL ) cRawE = new TCanvas("cRawE", cali ? "Cal e" : "Raw e", 1200, 800);
|
|
||||||
cRawE->Clear();cRawE->Divide(numCol, 4);
|
|
||||||
|
|
||||||
//cRawE->SetRightMargin(0);
|
|
||||||
//cRawE->SetLeftMargin(0);
|
|
||||||
//cRawE->SetTopMargin(0);
|
|
||||||
//cRawE->SetBottomMargin(0);
|
|
||||||
//cRawE->SetTicks(1,1);
|
|
||||||
//cRawE->SetBorderMode(1);
|
|
||||||
|
|
||||||
for (Int_t i = 0; i < 4; i++) {
|
|
||||||
for( Int_t j = 0; j < numCol; j++){
|
|
||||||
int canvasID = numCol * i + j + 1;
|
|
||||||
cRawE->cd(canvasID);
|
|
||||||
cRawE->cd(canvasID)->SetGrid();
|
|
||||||
cRawE->cd(canvasID)->SetRightMargin(0.1);
|
|
||||||
//cRawE->cd(canvasID)->SetLeftMargin(0);
|
|
||||||
cRawE->cd(canvasID)->SetTopMargin(0);
|
|
||||||
//cRawE->cd(canvasID)->SetBottomMargin(0);
|
|
||||||
//cRawE->cd(canvasID)->SetBorderMode(1);
|
|
||||||
if( isLogy ) cRawE->cd(canvasID)->SetLogy();
|
|
||||||
int hID = 4*j+ i;
|
|
||||||
if( cali ) {
|
|
||||||
heCal[hID]->Draw("");
|
|
||||||
}else{
|
|
||||||
he[hID]->Draw("");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
void Analyzer::Terminate(){
|
void Analyzer::Terminate(){
|
||||||
|
|
||||||
printf("============================== finishing.\n");
|
printf("============================== finishing.\n");
|
||||||
|
|
@ -210,10 +158,12 @@ void Analyzer::Terminate(){
|
||||||
cCanvas->cd(4)->SetLogz(1);
|
cCanvas->cd(4)->SetLogz(1);
|
||||||
hcoinBGO->Draw("colz");
|
hcoinBGO->Draw("colz");
|
||||||
|
|
||||||
listDraws();
|
printf("=============== Analyzer Utility\n");
|
||||||
|
gROOT->ProcessLine(".L Analyzer_Utilt.c");
|
||||||
|
gROOT->ProcessLine("listDraws()");
|
||||||
|
|
||||||
gROOT->ProcessLine(".L AutoFit.C");
|
|
||||||
printf("=============== loaded AutoFit.C\n");
|
printf("=============== loaded AutoFit.C\n");
|
||||||
|
gROOT->ProcessLine(".L AutoFit.C");
|
||||||
|
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
|
||||||
50
Analyzer_Utili.c
Normal file
50
Analyzer_Utili.c
Normal file
|
|
@ -0,0 +1,50 @@
|
||||||
|
void listDraws(void) {
|
||||||
|
printf("------------------- List of Plots -------------------\n");
|
||||||
|
printf(" rawID() - Raw e vs ID\n");
|
||||||
|
printf(" drawE() - Raw e for all %d detectors\n", NCLOVER);
|
||||||
|
printf("-----------------------------------------------------\n");
|
||||||
|
}
|
||||||
|
|
||||||
|
void rawID(){
|
||||||
|
TCanvas * cRawID = (TCanvas *) gROOT->FindObjectAny("cRawID");
|
||||||
|
if( cRawID == NULL ) cRawID = new TCanvas("cRawID", "raw ID", 1000, 800);
|
||||||
|
cRawID->cd(1)->SetGrid();
|
||||||
|
heVID->Draw("colz");
|
||||||
|
}
|
||||||
|
|
||||||
|
void drawE(bool isLogy = false, bool cali = false){
|
||||||
|
|
||||||
|
int numCol = NCLOVER / 4;
|
||||||
|
|
||||||
|
TCanvas *cRawE = (TCanvas *) gROOT->FindObjectAny("cRawE");
|
||||||
|
if( cRawE == NULL ) cRawE = new TCanvas("cRawE", cali ? "Cal e" : "Raw e", 1200, 800);
|
||||||
|
cRawE->Clear();cRawE->Divide(numCol, 4);
|
||||||
|
|
||||||
|
//cRawE->SetRightMargin(0);
|
||||||
|
//cRawE->SetLeftMargin(0);
|
||||||
|
//cRawE->SetTopMargin(0);
|
||||||
|
//cRawE->SetBottomMargin(0);
|
||||||
|
//cRawE->SetTicks(1,1);
|
||||||
|
//cRawE->SetBorderMode(1);
|
||||||
|
|
||||||
|
for (Int_t i = 0; i < 4; i++) {
|
||||||
|
for( Int_t j = 0; j < numCol; j++){
|
||||||
|
int canvasID = numCol * i + j + 1;
|
||||||
|
cRawE->cd(canvasID);
|
||||||
|
cRawE->cd(canvasID)->SetGrid();
|
||||||
|
cRawE->cd(canvasID)->SetRightMargin(0.1);
|
||||||
|
//cRawE->cd(canvasID)->SetLeftMargin(0);
|
||||||
|
cRawE->cd(canvasID)->SetTopMargin(0);
|
||||||
|
//cRawE->cd(canvasID)->SetBottomMargin(0);
|
||||||
|
//cRawE->cd(canvasID)->SetBorderMode(1);
|
||||||
|
if( isLogy ) cRawE->cd(canvasID)->SetLogy();
|
||||||
|
int hID = 4*j+ i;
|
||||||
|
if( cali ) {
|
||||||
|
heCal[hID]->Draw("");
|
||||||
|
}else{
|
||||||
|
he[hID]->Draw("");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
5
makefile
5
makefile
|
|
@ -1,6 +1,6 @@
|
||||||
CC=g++
|
CC=g++
|
||||||
|
|
||||||
all: xia2root xia2ev2_nopart pixie2root scan
|
all: xia2root xia2ev2_nopart pixie2root scan pxi-time-order
|
||||||
|
|
||||||
xia2root: xia2root.cpp
|
xia2root: xia2root.cpp
|
||||||
$(CC) xia2root.cpp -o xia2root `root-config --cflags --glibs`
|
$(CC) xia2root.cpp -o xia2root `root-config --cflags --glibs`
|
||||||
|
|
@ -13,3 +13,6 @@ pixie2root: pixie2root.cpp
|
||||||
|
|
||||||
scan: scan.c
|
scan: scan.c
|
||||||
$(CC) scan.c -o scan
|
$(CC) scan.c -o scan
|
||||||
|
|
||||||
|
pxi-time-order: pxi-time-order.c
|
||||||
|
$(CC) pxi-time-order.c -o pxi-time-order
|
||||||
|
|
|
||||||
430
pxi-time-order.c
Normal file
430
pxi-time-order.c
Normal file
|
|
@ -0,0 +1,430 @@
|
||||||
|
/*********************************************************/
|
||||||
|
/* PXI Time Order -- J.M. Allmond (ORNL) -- v1 Jul 2016 */
|
||||||
|
/* -- v2 Feb 2018 */
|
||||||
|
/* -- v3 Jun 2018 */
|
||||||
|
/* -- v4 May 2019 */
|
||||||
|
/* */
|
||||||
|
/* !Time Order Events from Pixie-16 digitizers */
|
||||||
|
/* !Max of: */
|
||||||
|
/* !IDs = static, Evts = dynamic, data = dynamic */
|
||||||
|
/* */
|
||||||
|
/* gcc -o pxi-time-order pxi-time-order.c */
|
||||||
|
/* ./pxi-time-order datafile */
|
||||||
|
/*********************************************************/
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////
|
||||||
|
//Code assumes that sequential sub events for a //
|
||||||
|
//specific channel are time ordered; therefore, //
|
||||||
|
//unmerge data into circular buffers on a per //
|
||||||
|
//channel id basis and then remerge channels in //
|
||||||
|
//time order. //
|
||||||
|
/////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <unistd.h>
|
||||||
|
#include <time.h>
|
||||||
|
|
||||||
|
#define MAX_CRATES 2
|
||||||
|
#define MAX_BOARDS_PER_CRATE 13
|
||||||
|
#define MAX_CHANNELS_PER_BOARD 16
|
||||||
|
#define BOARD_START 2
|
||||||
|
|
||||||
|
#define MAX_ID MAX_CRATES*MAX_BOARDS_PER_CRATE*MAX_CHANNELS_PER_BOARD
|
||||||
|
|
||||||
|
#define HEADER_LENGTH 4 //unit = words with 4 bytes per word
|
||||||
|
#define MAX_SUB_LENGTH 2016 //unit = words with 4 bytes per word ; 2016 --> 40 micro-second trace + 4 word header + 12 extra header
|
||||||
|
|
||||||
|
|
||||||
|
#define DEF_SUB_EVENTS 100 //number of events for each dynamic buffer level
|
||||||
|
#define M1_SUB_EVENTS 1000 //manual input for irregular / non-linear / non-geometric progression
|
||||||
|
#define M2_SUB_EVENTS 5000
|
||||||
|
#define M3_SUB_EVENTS 20000
|
||||||
|
#define M4_SUB_EVENTS 50000
|
||||||
|
#define M5_SUB_EVENTS 100000
|
||||||
|
#define MAX_SUB_EVENTS 200000
|
||||||
|
|
||||||
|
#define MAX_MALLOC 4000*1024*1024L //2GB
|
||||||
|
|
||||||
|
struct subevent
|
||||||
|
{
|
||||||
|
long long int timestamp;
|
||||||
|
int length; //unit = words with 4 bytes per word
|
||||||
|
unsigned int *data;
|
||||||
|
};
|
||||||
|
|
||||||
|
struct subevent *subevents[MAX_ID];
|
||||||
|
int nevts[MAX_ID], iptr[MAX_ID];
|
||||||
|
int maxevts[MAX_ID];
|
||||||
|
|
||||||
|
|
||||||
|
int main(int argc, char **argv) {
|
||||||
|
|
||||||
|
FILE *fpr, *fpw;
|
||||||
|
long int fprsize=0, fprsize_orig=0, fprsize_old=-1, fprpos=0;
|
||||||
|
|
||||||
|
int online = 0;
|
||||||
|
|
||||||
|
unsigned int subhead[HEADER_LENGTH];
|
||||||
|
memset(subhead, 0, sizeof(subhead));
|
||||||
|
int pause=0;
|
||||||
|
|
||||||
|
long long int nwords=0, evts_tot_read=0, evts_tot_write=0;
|
||||||
|
|
||||||
|
long long int time=0,time_old=0;
|
||||||
|
int length=0;
|
||||||
|
int chn=0;
|
||||||
|
int sln=0;
|
||||||
|
int crn=0;
|
||||||
|
int id=0;
|
||||||
|
|
||||||
|
int idmax=0;
|
||||||
|
int totmem=0;
|
||||||
|
int outoforder=0;
|
||||||
|
int evts_old=0;
|
||||||
|
int evts_new=0;
|
||||||
|
|
||||||
|
long long int timemin=0, timemin_old=0;
|
||||||
|
int min_id = -1;
|
||||||
|
|
||||||
|
memset(nevts, 0, sizeof(nevts));
|
||||||
|
memset(iptr, 0, sizeof(iptr));
|
||||||
|
|
||||||
|
int i=0, j=0;
|
||||||
|
div_t e_div;
|
||||||
|
|
||||||
|
|
||||||
|
//open input event file
|
||||||
|
if ((fpr = fopen(argv[1], "r")) == NULL) {
|
||||||
|
fprintf(stderr, "Error, cannot open input file %s\n", argv[1]);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
//write time order file to current location, not location of event file
|
||||||
|
char filenameto[80];
|
||||||
|
char *filename = strrchr(argv[1], '/');
|
||||||
|
if (filename == NULL) strcpy(filenameto,argv[1]);
|
||||||
|
else strcpy(filenameto,filename+1);
|
||||||
|
strcat(filenameto,".to");
|
||||||
|
if ((fpw = fopen(filenameto, "w")) == NULL) {
|
||||||
|
fprintf(stderr, "Error, cannot open output file %s\n", filenameto);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
//check for lockfile, active PID, and event file for auto "online" mode detection
|
||||||
|
FILE *FPLOCK;
|
||||||
|
char lockfile[1024];
|
||||||
|
strcpy(lockfile, getenv("HOME"));
|
||||||
|
strcat(lockfile, "/.Pixie16Lock");
|
||||||
|
int lockpid;
|
||||||
|
|
||||||
|
FILE *FPPATH;
|
||||||
|
char pathfile[1024];
|
||||||
|
char line[1024];
|
||||||
|
char onlinefile[1024];
|
||||||
|
strcpy(pathfile, getenv("HOME"));
|
||||||
|
strcat(pathfile, "/.Pixie16Path");
|
||||||
|
|
||||||
|
FPLOCK = fopen(lockfile, "r");
|
||||||
|
if (FPLOCK != NULL) {
|
||||||
|
fscanf(FPLOCK, "%d", &lockpid);
|
||||||
|
fclose(FPLOCK);
|
||||||
|
//PID from lockfile matches a running PID; run timesort in "online" mode for now
|
||||||
|
if (getpgid(lockpid) >= 0) {
|
||||||
|
FPPATH = fopen(pathfile, "r");
|
||||||
|
if (FPPATH == NULL) {
|
||||||
|
online = 0;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
fgets(line, 1024, FPPATH); //skip first line
|
||||||
|
fgets(line, 1024, FPPATH); //need second line
|
||||||
|
sscanf(line,"%s\n", onlinefile);
|
||||||
|
fclose(FPPATH);
|
||||||
|
if (filename == NULL) {
|
||||||
|
if (strcmp(onlinefile,argv[1]) == 0) {
|
||||||
|
online = 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
if (strcmp(onlinefile,filename+1) == 0) {
|
||||||
|
online = 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (online == 1) printf("Auto Mode: \x1B[32mOnline\x1B[0m\n");
|
||||||
|
else printf("Auto Mode: \x1B[32mOffline\x1B[0m\n");
|
||||||
|
|
||||||
|
//check file size for auto "online" mode
|
||||||
|
fprpos = ftell(fpr);
|
||||||
|
fseek(fpr, 0L, SEEK_END);
|
||||||
|
fprsize = fprsize_orig = ftell(fpr);
|
||||||
|
fseek(fpr, fprpos, SEEK_SET);
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
//Get memory for default number of subevents per channel id
|
||||||
|
for (i=0; i<MAX_ID; i++){
|
||||||
|
subevents[i] = malloc(sizeof(struct subevent)*DEF_SUB_EVENTS);
|
||||||
|
if (subevents[i] == NULL) {
|
||||||
|
printf("malloc failed\n");
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
totmem += sizeof(struct subevent)*DEF_SUB_EVENTS;
|
||||||
|
maxevts[i] = DEF_SUB_EVENTS;
|
||||||
|
for (j=0; j<DEF_SUB_EVENTS; j++) {
|
||||||
|
subevents[i][j].data = NULL;
|
||||||
|
subevents[i][j].length = 0;
|
||||||
|
subevents[i][j].timestamp = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
printf("Static Memory = %ld KB (cf. MAX_ID=%d)\n", sizeof(subevents)/1024, MAX_ID);
|
||||||
|
while (1) { //main while loop
|
||||||
|
|
||||||
|
/////////
|
||||||
|
while (1) { //fill buffers until (A) maxevents or (maxevents and 2GB) is reached for any ID
|
||||||
|
//(B) EOF
|
||||||
|
//(C) auto online mode will wait for updates and break out of fill buffers for narrow time window
|
||||||
|
//read 4-byte header
|
||||||
|
if (pause == 1) {
|
||||||
|
pause = 0;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
|
||||||
|
//////////////
|
||||||
|
//auto online
|
||||||
|
while ( (fprsize - nwords*sizeof(int) < MAX_SUB_LENGTH*sizeof(int)) && online == 1) {
|
||||||
|
|
||||||
|
online = 0;
|
||||||
|
usleep(100000); //wait 0.1 seconds before checking (prevents excessive cpu usage)
|
||||||
|
|
||||||
|
//check new file size
|
||||||
|
fprpos = ftell(fpr);
|
||||||
|
fseek(fpr, 0L, SEEK_END);
|
||||||
|
fprsize = ftell(fpr);
|
||||||
|
fseek(fpr, fprpos, SEEK_SET);
|
||||||
|
|
||||||
|
//check for lock file and active PID
|
||||||
|
FPLOCK = fopen(lockfile, "r");
|
||||||
|
if (FPLOCK != NULL) {
|
||||||
|
fscanf(FPLOCK, "%d", &lockpid);
|
||||||
|
fclose(FPLOCK);
|
||||||
|
if (getpgid(lockpid) >= 0) {
|
||||||
|
FPPATH = fopen(pathfile, "r");
|
||||||
|
if (FPPATH != NULL) {
|
||||||
|
fgets(line, 1024, FPPATH); //skip first line
|
||||||
|
fgets(line, 1024, FPPATH); //need second line
|
||||||
|
sscanf(line,"%s\n", onlinefile);
|
||||||
|
fclose(FPPATH);
|
||||||
|
if (filename == NULL) {
|
||||||
|
if (strcmp(onlinefile,argv[1]) == 0) online = 1;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
if (strcmp(onlinefile,filename+1) == 0) online = 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} //end auto online
|
||||||
|
|
||||||
|
|
||||||
|
//read 4-byte header
|
||||||
|
if (fread(subhead, sizeof(subhead), 1, fpr) != 1) break;
|
||||||
|
nwords = nwords + HEADER_LENGTH;
|
||||||
|
chn = subhead[0] & 0xF;
|
||||||
|
sln = (subhead[0] & 0xF0) >> 4;
|
||||||
|
crn = (subhead[0] & 0xF00) >> 8;
|
||||||
|
id = crn*MAX_BOARDS_PER_CRATE*MAX_CHANNELS_PER_BOARD + (sln-BOARD_START)*MAX_CHANNELS_PER_BOARD + chn;
|
||||||
|
length = (subhead[0] & 0x7FFE0000) >> 17; //unit = words with 4 bytes per word
|
||||||
|
time = ( (long long int)(subhead[2] & 0xFFFF) << 32) + subhead[1];
|
||||||
|
if (id > idmax) idmax = id;
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
//check memory
|
||||||
|
if (totmem > MAX_MALLOC) {printf("Error: Exceeded MAX_MALLOC"); return -1;}
|
||||||
|
|
||||||
|
//Expand memory for more events (careful when final is to left of initial in circular buffer)
|
||||||
|
if ( maxevts[id] - nevts[id] == 1 && totmem < MAX_MALLOC) {
|
||||||
|
|
||||||
|
if (maxevts[id] == DEF_SUB_EVENTS) {evts_old = DEF_SUB_EVENTS; evts_new = M1_SUB_EVENTS;}
|
||||||
|
if (maxevts[id] == M1_SUB_EVENTS) {evts_old = M1_SUB_EVENTS; evts_new = M2_SUB_EVENTS;}
|
||||||
|
if (maxevts[id] == M2_SUB_EVENTS) {evts_old = M2_SUB_EVENTS; evts_new = M3_SUB_EVENTS;}
|
||||||
|
if (maxevts[id] == M3_SUB_EVENTS) {evts_old = M3_SUB_EVENTS; evts_new = M4_SUB_EVENTS;}
|
||||||
|
if (maxevts[id] == M4_SUB_EVENTS) {evts_old = M4_SUB_EVENTS; evts_new = M5_SUB_EVENTS;}
|
||||||
|
if (maxevts[id] == M5_SUB_EVENTS) {evts_old = M5_SUB_EVENTS; evts_new = MAX_SUB_EVENTS;}
|
||||||
|
|
||||||
|
if (maxevts[id]==evts_old && totmem + (evts_new-evts_old)*(sizeof(struct subevent) + sizeof(unsigned int)*length) < MAX_MALLOC) {
|
||||||
|
subevents[id] = realloc(subevents[id], sizeof(struct subevent)*evts_new);
|
||||||
|
if (subevents[id] == NULL) {
|
||||||
|
printf("realloc failed\n");
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
totmem = totmem - sizeof(struct subevent)*evts_old + sizeof(struct subevent)*evts_new;
|
||||||
|
maxevts[id] = evts_new;
|
||||||
|
for (j=evts_old; j<evts_new; j++) {
|
||||||
|
subevents[id][j].data = NULL;
|
||||||
|
subevents[id][j].length = 0;
|
||||||
|
subevents[id][j].timestamp = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
// if circular buffer is wrapped around (i.e., final is to left of intial, move data to right of initial)
|
||||||
|
if (iptr[id] + nevts[id] > evts_old) {
|
||||||
|
for (j=0; j<iptr[id] + nevts[id] - evts_old; j++) {
|
||||||
|
if (subevents[id][evts_old+j].data == NULL) {
|
||||||
|
subevents[id][evts_old+j].data = malloc(sizeof(unsigned int)*subevents[id][j].length);
|
||||||
|
if (subevents[id][evts_old+j].data == NULL) {
|
||||||
|
printf("malloc failed\n");
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
totmem += sizeof(unsigned int)*subevents[id][j].length;
|
||||||
|
}
|
||||||
|
subevents[id][evts_old+j].length = subevents[id][j].length;
|
||||||
|
subevents[id][evts_old+j].timestamp = subevents[id][j].timestamp;
|
||||||
|
for (i=0; i<subevents[id][evts_old+j].length; i++) {
|
||||||
|
subevents[id][evts_old+j].data[i]=subevents[id][j].data[i];
|
||||||
|
}
|
||||||
|
//free data memory until it's needed again
|
||||||
|
free(subevents[id][j].data);
|
||||||
|
subevents[id][j].data = NULL;
|
||||||
|
totmem -= sizeof(unsigned int)*subevents[id][j].length;
|
||||||
|
subevents[id][j].length = 0;
|
||||||
|
subevents[id][j].timestamp = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
// time control of buffer filling for auto online mode (reset if initial value or large gap > 3.5 sec)
|
||||||
|
// large gap could be from low rate or un/replug
|
||||||
|
if ( time_old == 0 || (time - time_old)/10000000 > 35 ) time_old = time;
|
||||||
|
|
||||||
|
//fill buffers until full (online mode will stop filling buffers after 2.5 sec lag betweeen output/input)
|
||||||
|
if ( nevts[id] < maxevts[id] && ( (time - time_old)/10000000 < 25 || online == 0 ) ) {
|
||||||
|
|
||||||
|
|
||||||
|
j = nevts[id] + iptr[id];
|
||||||
|
if (j >= maxevts[id]) j -= maxevts[id];
|
||||||
|
|
||||||
|
subevents[id][j].timestamp = time;
|
||||||
|
|
||||||
|
if (subevents[id][j].data == NULL) {
|
||||||
|
subevents[id][j].data = malloc(sizeof(unsigned int)*length);
|
||||||
|
if (subevents[id][j].data == NULL) {
|
||||||
|
printf("malloc failed\n");
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
totmem += sizeof(unsigned int)*length;
|
||||||
|
}
|
||||||
|
else if (length != subevents[id][j].length) { //not needed anymore since always free data after use now. Keep for future ...
|
||||||
|
subevents[id][j].data = realloc(subevents[id][j].data, sizeof(unsigned int)*length);
|
||||||
|
if (subevents[id][j].data == NULL) {
|
||||||
|
printf("realloc failed\n");
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
totmem = totmem - sizeof(unsigned int)*subevents[id][j].length + sizeof(unsigned int)*length;
|
||||||
|
}
|
||||||
|
|
||||||
|
subevents[id][j].length = length;
|
||||||
|
|
||||||
|
if (length>HEADER_LENGTH) {
|
||||||
|
if (fread(subevents[id][j].data + HEADER_LENGTH, (length-HEADER_LENGTH)*sizeof(int), 1, fpr) != 1) break;
|
||||||
|
nwords = nwords + (length-HEADER_LENGTH);
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i=0; i < HEADER_LENGTH; i++) {
|
||||||
|
subevents[id][j].data[i] = subhead[i];
|
||||||
|
}
|
||||||
|
|
||||||
|
nevts[id]++;
|
||||||
|
evts_tot_read++;
|
||||||
|
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
pause = 1;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
} // end while for fill buffers
|
||||||
|
/////////
|
||||||
|
|
||||||
|
|
||||||
|
/////////
|
||||||
|
// write event with minimum time to file
|
||||||
|
timemin_old = timemin;
|
||||||
|
timemin = -1;
|
||||||
|
for (i=0; i < idmax + 1; i++) { //could be MAX_ID but limit ourselves to current max, idmax
|
||||||
|
if (nevts[i] > 0) {
|
||||||
|
if (timemin == -1) {
|
||||||
|
timemin = subevents[i][iptr[i]].timestamp;
|
||||||
|
time_old = timemin;
|
||||||
|
min_id = i;
|
||||||
|
}
|
||||||
|
else if (subevents[i][iptr[i]].timestamp < timemin) {
|
||||||
|
timemin = subevents[i][iptr[i]].timestamp;
|
||||||
|
time_old = timemin;
|
||||||
|
min_id = i;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
if (timemin > -1) {
|
||||||
|
if (timemin < timemin_old) {
|
||||||
|
printf("\nWarning!!! timemin = %lld and timemin_old = %lld and min_id = %d\n", timemin, timemin_old, min_id);
|
||||||
|
outoforder++;
|
||||||
|
}
|
||||||
|
if (subevents[min_id][iptr[min_id]].data == NULL) {printf("Error: data = NULL\n"); return -1;}
|
||||||
|
fwrite(subevents[min_id][iptr[min_id]].data, sizeof(unsigned int)*subevents[min_id][iptr[min_id]].length, 1, fpw);
|
||||||
|
|
||||||
|
//free data memory up until it's needed again
|
||||||
|
free(subevents[min_id][iptr[min_id]].data);
|
||||||
|
subevents[min_id][iptr[min_id]].data = NULL;
|
||||||
|
totmem -= sizeof(unsigned int)*subevents[min_id][iptr[min_id]].length;
|
||||||
|
subevents[min_id][iptr[min_id]].length = 0;
|
||||||
|
subevents[min_id][iptr[min_id]].timestamp = 0;
|
||||||
|
|
||||||
|
nevts[min_id]--;
|
||||||
|
if (++iptr[min_id] >= maxevts[min_id]) iptr[min_id] -= maxevts[min_id];
|
||||||
|
evts_tot_write++;
|
||||||
|
}
|
||||||
|
else break;
|
||||||
|
/////////
|
||||||
|
|
||||||
|
|
||||||
|
//print statistics
|
||||||
|
e_div=div(evts_tot_read,10000);
|
||||||
|
if ( e_div.rem == 0)
|
||||||
|
printf("Malloc (%d MB) : evts in (\x1B[34m%lld\x1B[0m) : evts out (\x1B[32m%lld\x1B[0m) : diff (\x1B[31m%lld\x1B[0m)\r", (totmem)/1024/1024, evts_tot_read, evts_tot_write, evts_tot_read-evts_tot_write);
|
||||||
|
|
||||||
|
} //end main while
|
||||||
|
|
||||||
|
|
||||||
|
//cleanup
|
||||||
|
fclose(fpr);
|
||||||
|
fclose(fpw);
|
||||||
|
for (i=0; i<MAX_ID; i++){
|
||||||
|
free(subevents[i]);
|
||||||
|
totmem -= sizeof(struct subevent)*maxevts[i];
|
||||||
|
}
|
||||||
|
|
||||||
|
//print statistics last time
|
||||||
|
printf("\33[2K");
|
||||||
|
printf("Malloc (%d MB) : evts in (\x1B[34m%lld\x1B[0m) : evts out (\x1B[32m%lld\x1B[0m) : diff (\x1B[31m%lld\x1B[0m)\n", (totmem)/1024/1024, evts_tot_read, evts_tot_write, evts_tot_read-evts_tot_write);
|
||||||
|
if (outoforder > 0) printf("\x1B[31mWarning, there are %d events out of time order\x1B[0m\n", outoforder);
|
||||||
|
if (totmem != 0) printf("\x1B[31mError: total memory not conserved\x1B[0m\n");
|
||||||
|
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
Loading…
Reference in New Issue
Block a user