[u/mrichter/AliRoot.git] / EMCAL / AliEMCALTriggerTRU.cxx

/**************************************************************************
 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
 *                                                                        *
 * Author: The ALICE Off-line Project.                                    *
 * Contributors are mentioned in the code where appropriate.              *
 *                                                                        *
 * Permission to use, copy, modify and distribute this software and its   *
 * documentation strictly for non-commercial purposes is hereby granted   *
 * without fee, provided that the above copyright notice appears in all   *
 * copies and that both the copyright notice and this permission notice   *
 * appear in the supporting documentation. The authors make no claims     *
 * about the suitability of this software for any purpose. It is          *
 * provided "as is" without express or implied warranty.                  *
 **************************************************************************/

/*


Author: R. GUERNANE LPSC Grenoble CNRS/IN2P3
*/


#include "AliEMCALTriggerTRU.h"
#include "AliEMCALTriggerPatch.h"
#include "AliEMCALTriggerTRUDCSConfig.h"
#include "AliLog.h"

#include <TClonesArray.h>
#include <TSystem.h>
#include <Riostream.h>
  
namespace
{
	const Int_t kTimeBins       = 16; // number of sampling bins of the FastOR signal
	const Int_t kTimeWindowSize =  4; // 
	const Int_t kNup            =  2; // 
	const Int_t kNdown          =  1; // 
}

ClassImp(AliEMCALTriggerTRU)

//________________
AliEMCALTriggerTRU::AliEMCALTriggerTRU() : AliEMCALTriggerBoard(),
fDCSConfig(0x0)
{
	//
	for (Int_t i=0;i<96;i++) for (Int_t j=0;j<256;j++) fADC[i][j] = 0;
}

//________________
AliEMCALTriggerTRU::AliEMCALTriggerTRU(AliEMCALTriggerTRUDCSConfig* dcsConf, const TVector2& rSize, Int_t mapType) : 
AliEMCALTriggerBoard(rSize),
fDCSConfig(dcsConf)
{
	//
	for (Int_t i=0;i<96;i++) for (Int_t j=0;j<256;j++) fADC[i][j] = 0;

	TVector2 size;
	
	if (dcsConf->GetL0SEL() & 0x0001) // 4-by-4
	{
		size.Set( 1. , 1. );
		SetSubRegionSize( size );
		
		size.Set( 2. , 2. );
		SetPatchSize( size );
	}	
	else                              // 2-by-2
	{
		size.Set( 1. , 1. );
		SetSubRegionSize( size );
		
		size.Set( 1. , 1. );
		SetPatchSize( size );	
	}	
	
	for (Int_t ietam=0;ietam<24;ietam++)
	{
		for (Int_t iphim=0;iphim<4;iphim++)
		{
			// idx: 0..95 since iphim: 0..11 ietam: 0..23
			Int_t idx = ( !mapType ) ? ( 3 - iphim ) + ietam * 4 : iphim + (23 - ietam) * 4;	
	
			// Build a matrix used to get TRU digit id (ADC channel) from (eta,phi)|SM
			fMap[ietam][iphim] = idx; // [0..11][0..3] namely [eta][phi] in SM
		}
	}
}

//________________
AliEMCALTriggerTRU::~AliEMCALTriggerTRU()
{
	//
}

//________________
void AliEMCALTriggerTRU::ShowFastOR(Int_t iTimeWindow, Int_t iChannel)
{
	//
	Int_t iChanF, iChanL;
	
	if (iChannel != -1) iChanF = iChanL = iChannel;
	else
	{
		iChanF =  0;
		iChanL = 96;
	}
	
	for (Int_t i=iChanF;i<iChanL+1;i++)
	{
		printf("\tChannel: %2d - ",i);
		for (Int_t j=0;j<60;j++) 
		{
			if (j == iTimeWindow)
				printf(" | %4d",fADC[i][j]);
			else if (j == iTimeWindow+kTimeWindowSize-1)
				printf(" %4d |",fADC[i][j]);
			else
				printf(" %4d",fADC[i][j]);
		}
		
		printf("\n");
	}
}

//________________
Int_t AliEMCALTriggerTRU::L0()
{
	// Mimick the TRU L0 'virtual' since not yet released algo
	
	// L0 issuing condition is: (2 up & 1 down) AND (time sum > thres)
	// fill a matrix to support sliding window
	// compute the time sum for all the FastOR of a given TRU
	// and then move the space window

	AliDebug(999,"=== Running TRU L0 algorithm ===");
	const Int_t xsize    = Int_t(fRegionSize->X());
	const Int_t ysize    = Int_t(fRegionSize->Y());
	const Int_t zsize    = kNup+kNdown;

	Int_t ***buffer = new Int_t**[xsize];
	for (Int_t x = 0; x < xsize; x++)
	{
		buffer[x] = new Int_t*[ysize];
		
		for (Int_t y = 0; y < ysize; y++)
		{
			buffer[x][y] = new Int_t[zsize];
		}
	}
	
	for (Int_t i = 0; i < fRegionSize->X(); i++) 
		for (Int_t j = 0; j < fRegionSize->Y(); j++) 
			for (Int_t k = 0; k < kNup + kNdown; k++) buffer[i][j][k] = 0;
		
	// Time sliding window algorithm
	for (Int_t i=0; i<=(kTimeBins-kTimeWindowSize); i++) 
	{
		AliDebug(999,Form("----------- Time window: %d\n",i));
		
		for (Int_t j=0; j<fRegionSize->X(); j++)
		{		
			for (Int_t k=0; k<fRegionSize->Y(); k++)
			{
				for (Int_t l=i; l<i+kTimeWindowSize; l++) 
				{
					// [eta][phi][time]
					fRegion[j][k] += fADC[fMap[j][k]][l];	
				}
				
				buffer[j][k][i%(kNup + kNdown)] = fRegion[j][k];
				
				if ( i > kNup + kNdown - 1 ) 
				{	
					for (Int_t v = 0; v < kNup + kNdown - 1; v++) buffer[j][k][v] =  buffer[j][k][v+1];
	
					buffer[j][k][kNup + kNdown - 1] = fRegion[j][k];
				}
				else
				{
					buffer[j][k][i] = fRegion[j][k];
				}
				
//				if (kTimeWindowSize > 4) fRegion[j][k] = fRegion[j][k] >> 1; // truncate time sum to fit 14b
			}
		}
		
		// Don't start to evaluate space sum if a peak can't be findable
		if (i < kNup + kNdown - 1) 
		{
			ZeroRegion();
			continue; 
		}
		
		Int_t **peaks = new Int_t*[xsize];
		for (Int_t x = 0; x < xsize; x++)
		{
			peaks[x] = new Int_t[ysize];
		}
		
		for (Int_t j=0; j<fRegionSize->X(); j++) for (Int_t k=0; k<fRegionSize->Y(); k++) peaks[j][k] = 0;
		
		Int_t nPeaks = 0;
		
		for (Int_t j=0; j<fRegionSize->X(); j++)
		{		
			for (Int_t k=0; k<fRegionSize->Y(); k++)
			{
				Int_t foundU = 0;
				
				Int_t foundD = 0;
		
				for (Int_t l=   1;l<kNup       ;l++) foundU = ( buffer[j][k][l]> buffer[j][k][l-1] && buffer[j][k][l-1] ) ? 1 : 0;
				
				for (Int_t l=kNup;l<kNup+kNdown;l++) foundD = ( buffer[j][k][l]<=buffer[j][k][l-1] && buffer[j][k][l  ] ) ? 1 : 0; 
		
				if ( foundU && foundD ) 
				{
					peaks[j][k] = 1;
					nPeaks++;
				}
			}
		}

		if (!nPeaks)
		{
			ZeroRegion();

			for (Int_t x = 0; x < xsize; x++)
			{
			  delete [] peaks[x];
			}
			delete [] peaks;

			continue;
		}
		
		// Threshold 
		// FIXME: for now consider just one threshold for all patches, should consider one per patch?
		// ANSWE: both solutions will be implemented in the TRU
		// return the list of patches above threshold
		// Theshold checked out from OCDB
		
		SlidingWindow(kL0, fDCSConfig->GetGTHRL0(), i);
		
//		for(Int_t j=0; j<fRegionSize->X(); j++)
//			for (Int_t k=0; k<fRegionSize->Y(); k++) fRegion[j][k] = fRegion[j][k]>>2; // go to 12b before shipping to STU
		
		for (Int_t j=0; j<fPatches->GetEntriesFast(); j++)
		{
			AliEMCALTriggerPatch* p = (AliEMCALTriggerPatch*)fPatches->At( j );

			if ( AliDebugLevel() ) p->Print("");

			TVector2 v; p->Position(v);
			
			Int_t sizeX = (Int_t)(fPatchSize->X() * fSubRegionSize->X());
			
			Int_t sizeY = (Int_t)(fPatchSize->Y() * fSubRegionSize->Y());
			
			const Int_t psize =  sizeX * sizeY; // Number of FastOR in the patch
			
			Int_t foundPeak = 0;
			
			Int_t* idx = new Int_t[psize];
			
			for (Int_t xx=0;xx<sizeX;xx++) 
			{
				for (Int_t yy=0;yy<sizeY;yy++) 
				{   
					Int_t index = xx*sizeY+yy;
					
					idx[index] = fMap[int(v.X()*fSubRegionSize->X())+xx][int(v.Y()*fSubRegionSize->Y())+yy]; // Get current patch FastOR ADC channels 
					
					if (peaks[int(v.X() * fSubRegionSize->X()) + xx][int(v.Y() * fSubRegionSize->Y()) + yy]) 
					{
						foundPeak++;
						
						p->SetPeak(xx, yy, sizeX, sizeY);
					}
					
					if (AliDebugLevel() >= 999) ShowFastOR(i, idx[index]);
				}
			}
			
			delete [] idx;

			if ( !foundPeak ) 
			{
				fPatches->RemoveAt( j );
				fPatches->Compress();
			}				
		}
		
		//Delete, avoid leak
		for (Int_t x = 0; x < xsize; x++)
		{
			delete [] peaks[x];
		}
		delete [] peaks;

		if ( !fPatches->GetEntriesFast() ) // No patch left
			ZeroRegion();
		else                             // Stop the algo when at least one patch is found ( thres & max )
		{
			for (Int_t xx = 0; xx < fRegionSize->X(); xx++) 
			{
				for (Int_t yy = 0; yy < fRegionSize->Y(); yy++) 
				{   
					// Prepare data to be sent to STU for further L1 processing
					// Sent time sum (rollback tuning) is the one before L0 is issued (maximum time sum)
					fRegion[xx][yy] = buffer[xx][yy][1];
				}
			}
			
			break;
		}		
	}
	
	//Delete, avoid leak
	for (Int_t x = 0; x < xsize; x++)
	{
		for (Int_t y = 0; y < ysize; y++)
		{
			delete [] buffer[x][y];
		}
		delete [] buffer[x];
	}
	delete [] buffer;
	
	return fPatches->GetEntriesFast();
}

//________________
void AliEMCALTriggerTRU::SetADC( Int_t channel, Int_t bin, Int_t sig )
{
  //Set ADC value
  if (channel > 95 || bin > 255) {
    AliError("TRU has 96 ADC channels and 256 bins only!");
  }
  else{ 
    fADC[channel][bin] = sig;
  }
}

//________________
void AliEMCALTriggerTRU::SaveRegionADC(Int_t iTRU, Int_t iEvent)
{
	// O for STU Hw
	//
	gSystem->Exec(Form("mkdir -p Event%d",iEvent));
	
	ofstream outfile(Form("Event%d/data_TRU%d.txt",iEvent,iTRU),ios_base::trunc);
	
	for (Int_t i=0;i<96;i++) 
	{
		Int_t ietam = 23 - i/4;
	
		Int_t iphim =  3 - i%4;
		
		outfile << fRegion[ietam][iphim] << endl;
	}

	outfile.close();
}

//________________
void AliEMCALTriggerTRU::Reset()
{
	//
	fPatches->Delete();
	
	ZeroRegion();
	
	for (Int_t i=0;i<96;i++) for (Int_t j=0;j<256;j++) fADC[i][j] = 0;
}
Commit	Line	Data
916f1e76	1	/**************************************************************************
	2	* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
	3	* *
	4	* Author: The ALICE Off-line Project. *
	5	* Contributors are mentioned in the code where appropriate. *
	6	* *
	7	* Permission to use, copy, modify and distribute this software and its *
	8	* documentation strictly for non-commercial purposes is hereby granted *
	9	* without fee, provided that the above copyright notice appears in all *
	10	* copies and that both the copyright notice and this permission notice *
	11	* appear in the supporting documentation. The authors make no claims *
	12	* about the suitability of this software for any purpose. It is *
	13	* provided "as is" without express or implied warranty. *
	14	**************************************************************************/
	15
	16	/*
	17
	18
	19
	20
	21	Author: R. GUERNANE LPSC Grenoble CNRS/IN2P3
	22	*/
	23
	24
	25	#include "AliEMCALTriggerTRU.h"
	26	#include "AliEMCALTriggerPatch.h"
fff39dd1	27	#include "AliEMCALTriggerTRUDCSConfig.h"
916f1e76	28	#include "AliLog.h"
916f1e76	29
916f1e76	30	#include <TClonesArray.h>
	31	#include <TSystem.h>
	32	#include <Riostream.h>
	33
	34	namespace
	35	{
fff39dd1	36	const Int_t kTimeBins = 16; // number of sampling bins of the FastOR signal
916f1e76	37	const Int_t kTimeWindowSize = 4; //
	38	const Int_t kNup = 2; //
	39	const Int_t kNdown = 1; //
	40	}
	41
	42	ClassImp(AliEMCALTriggerTRU)
	43
	44	//________________
de39a0ff	45	AliEMCALTriggerTRU::AliEMCALTriggerTRU() : AliEMCALTriggerBoard(),
de39a0ff	46	fDCSConfig(0x0)
916f1e76	47	{
	48	//
	49	for (Int_t i=0;i<96;i++) for (Int_t j=0;j<256;j++) fADC[i][j] = 0;
	50	}
	51
	52	//________________
fff39dd1	53	AliEMCALTriggerTRU::AliEMCALTriggerTRU(AliEMCALTriggerTRUDCSConfig* dcsConf, const TVector2& rSize, Int_t mapType) :
de39a0ff	54	AliEMCALTriggerBoard(rSize),
de39a0ff	55	fDCSConfig(dcsConf)
916f1e76	56	{
	57	//
	58	for (Int_t i=0;i<96;i++) for (Int_t j=0;j<256;j++) fADC[i][j] = 0;
	59
916f1e76	60	TVector2 size;
916f1e76	61
de39a0ff	62	if (dcsConf->GetL0SEL() & 0x0001) // 4-by-4
	63	{
	64	size.Set( 1. , 1. );
	65	SetSubRegionSize( size );
	66
	67	size.Set( 2. , 2. );
	68	SetPatchSize( size );
	69	}
	70	else // 2-by-2
	71	{
	72	size.Set( 1. , 1. );
	73	SetSubRegionSize( size );
	74
	75	size.Set( 1. , 1. );
	76	SetPatchSize( size );
	77	}
916f1e76	78
	79	for (Int_t ietam=0;ietam<24;ietam++)
	80	{
	81	for (Int_t iphim=0;iphim<4;iphim++)
	82	{
	83	// idx: 0..95 since iphim: 0..11 ietam: 0..23
	84	Int_t idx = ( !mapType ) ? ( 3 - iphim ) + ietam * 4 : iphim + (23 - ietam) * 4;
	85
	86	// Build a matrix used to get TRU digit id (ADC channel) from (eta,phi)\|SM
	87	fMap[ietam][iphim] = idx; // [0..11][0..3] namely [eta][phi] in SM
	88	}
	89	}
	90	}
	91
	92	//________________
	93	AliEMCALTriggerTRU::~AliEMCALTriggerTRU()
	94	{
de39a0ff	95	//
916f1e76	96	}
916f1e76	97
916f1e76	98	//________________
	99	void AliEMCALTriggerTRU::ShowFastOR(Int_t iTimeWindow, Int_t iChannel)
	100	{
	101	//
	102	Int_t iChanF, iChanL;
	103
	104	if (iChannel != -1) iChanF = iChanL = iChannel;
	105	else
	106	{
	107	iChanF = 0;
	108	iChanL = 96;
	109	}
	110
	111	for (Int_t i=iChanF;i<iChanL+1;i++)
	112	{
	113	printf("\tChannel: %2d - ",i);
	114	for (Int_t j=0;j<60;j++)
	115	{
	116	if (j == iTimeWindow)
	117	printf(" \| %4d",fADC[i][j]);
	118	else if (j == iTimeWindow+kTimeWindowSize-1)
	119	printf(" %4d \|",fADC[i][j]);
	120	else
	121	printf(" %4d",fADC[i][j]);
	122	}
	123
	124	printf("\n");
	125	}
	126	}
	127
	128	//________________
fff39dd1	129	Int_t AliEMCALTriggerTRU::L0()
916f1e76	130	{
	131	// Mimick the TRU L0 'virtual' since not yet released algo
	132
	133	// L0 issuing condition is: (2 up & 1 down) AND (time sum > thres)
	134	// fill a matrix to support sliding window
	135	// compute the time sum for all the FastOR of a given TRU
	136	// and then move the space window
fff39dd1	137
de39a0ff	138	AliDebug(999,"=== Running TRU L0 algorithm ===");
8476b1c8	139	const Int_t xsize = Int_t(fRegionSize->X());
8b07b672	140	const Int_t ysize = Int_t(fRegionSize->Y());
	141	const Int_t zsize = kNup+kNdown;
	142
f4e2cc1e	143	Int_t *buffer = new Int_t[xsize];
	144	for (Int_t x = 0; x < xsize; x++)
	145	{
	146	buffer[x] = new Int_t*[ysize];
	147
	148	for (Int_t y = 0; y < ysize; y++)
	149	{
	150	buffer[x][y] = new Int_t[zsize];
	151	}
	152	}
916f1e76	153
de39a0ff	154	for (Int_t i = 0; i < fRegionSize->X(); i++)
	155	for (Int_t j = 0; j < fRegionSize->Y(); j++)
	156	for (Int_t k = 0; k < kNup + kNdown; k++) buffer[i][j][k] = 0;
fff39dd1	157
fff39dd1	158	// Time sliding window algorithm
916f1e76	159	for (Int_t i=0; i<=(kTimeBins-kTimeWindowSize); i++)
916f1e76	160	{
de39a0ff	161	AliDebug(999,Form("----------- Time window: %d\n",i));
fff39dd1	162
fff39dd1	163	for (Int_t j=0; j<fRegionSize->X(); j++)
916f1e76	164	{
	165	for (Int_t k=0; k<fRegionSize->Y(); k++)
	166	{
	167	for (Int_t l=i; l<i+kTimeWindowSize; l++)
	168	{
	169	// [eta][phi][time]
fff39dd1	170	fRegion[j][k] += fADC[fMap[j][k]][l];
916f1e76	171	}
916f1e76	172
fff39dd1	173	buffer[j][k][i%(kNup + kNdown)] = fRegion[j][k];
916f1e76	174
fff39dd1	175	if ( i > kNup + kNdown - 1 )
	176	{
	177	for (Int_t v = 0; v < kNup + kNdown - 1; v++) buffer[j][k][v] = buffer[j][k][v+1];
	178
	179	buffer[j][k][kNup + kNdown - 1] = fRegion[j][k];
	180	}
	181	else
	182	{
	183	buffer[j][k][i] = fRegion[j][k];
	184	}
916f1e76	185
fff39dd1	186	// if (kTimeWindowSize > 4) fRegion[j][k] = fRegion[j][k] >> 1; // truncate time sum to fit 14b
916f1e76	187	}
	188	}
	189
fff39dd1	190	// Don't start to evaluate space sum if a peak can't be findable
	191	if (i < kNup + kNdown - 1)
	192	{
	193	ZeroRegion();
	194	continue;
	195	}
916f1e76	196
f4e2cc1e	197	Int_t *peaks = new Int_t[xsize];
	198	for (Int_t x = 0; x < xsize; x++)
	199	{
	200	peaks[x] = new Int_t[ysize];
	201	}
916f1e76	202
fff39dd1	203	for (Int_t j=0; j<fRegionSize->X(); j++) for (Int_t k=0; k<fRegionSize->Y(); k++) peaks[j][k] = 0;
	204
	205	Int_t nPeaks = 0;
916f1e76	206
	207	for (Int_t j=0; j<fRegionSize->X(); j++)
	208	{
	209	for (Int_t k=0; k<fRegionSize->Y(); k++)
	210	{
fff39dd1	211	Int_t foundU = 0;
	212
	213	Int_t foundD = 0;
	214
	215	for (Int_t l= 1;l<kNup ;l++) foundU = ( buffer[j][k][l]> buffer[j][k][l-1] && buffer[j][k][l-1] ) ? 1 : 0;
	216
	217	for (Int_t l=kNup;l<kNup+kNdown;l++) foundD = ( buffer[j][k][l]<=buffer[j][k][l-1] && buffer[j][k][l ] ) ? 1 : 0;
	218
	219	if ( foundU && foundD )
916f1e76	220	{
fff39dd1	221	peaks[j][k] = 1;
fff39dd1	222	nPeaks++;
916f1e76	223	}
916f1e76	224	}
916f1e76	225	}
fff39dd1	226
de39a0ff	227	if (!nPeaks)
fff39dd1	228	{
fff39dd1	229	ZeroRegion();
4bd37bd4	230
	231	for (Int_t x = 0; x < xsize; x++)
	232	{
	233	delete [] peaks[x];
	234	}
	235	delete [] peaks;
	236
fff39dd1	237	continue;
fff39dd1	238	}
916f1e76	239
	240	// Threshold
	241	// FIXME: for now consider just one threshold for all patches, should consider one per patch?
	242	// ANSWE: both solutions will be implemented in the TRU
	243	// return the list of patches above threshold
fff39dd1	244	// Theshold checked out from OCDB
916f1e76	245
de39a0ff	246	SlidingWindow(kL0, fDCSConfig->GetGTHRL0(), i);
916f1e76	247
	248	// for(Int_t j=0; j<fRegionSize->X(); j++)
	249	// for (Int_t k=0; k<fRegionSize->Y(); k++) fRegion[j][k] = fRegion[j][k]>>2; // go to 12b before shipping to STU
	250
916f1e76	251	for (Int_t j=0; j<fPatches->GetEntriesFast(); j++)
	252	{
	253	AliEMCALTriggerPatch* p = (AliEMCALTriggerPatch*)fPatches->At( j );
	254
	255	if ( AliDebugLevel() ) p->Print("");
	256
fff39dd1	257	TVector2 v; p->Position(v);
916f1e76	258
da509d54	259	Int_t sizeX = (Int_t)(fPatchSize->X() * fSubRegionSize->X());
fff39dd1	260
da509d54	261	Int_t sizeY = (Int_t)(fPatchSize->Y() * fSubRegionSize->Y());
916f1e76	262
	263	const Int_t psize = sizeX * sizeY; // Number of FastOR in the patch
	264
39c05eac	265	Int_t foundPeak = 0;
39c05eac	266
fff39dd1	267	Int_t* idx = new Int_t[psize];
916f1e76	268
	269	for (Int_t xx=0;xx<sizeX;xx++)
	270	{
	271	for (Int_t yy=0;yy<sizeY;yy++)
	272	{
fff39dd1	273	Int_t index = xx*sizeY+yy;
916f1e76	274
fff39dd1	275	idx[index] = fMap[int(v.X()fSubRegionSize->X())+xx][int(v.Y()fSubRegionSize->Y())+yy]; // Get current patch FastOR ADC channels
916f1e76	276
de39a0ff	277	if (peaks[int(v.X() * fSubRegionSize->X()) + xx][int(v.Y() * fSubRegionSize->Y()) + yy])
	278	{
	279	foundPeak++;
	280
	281	p->SetPeak(xx, yy, sizeX, sizeY);
	282	}
fff39dd1	283
de39a0ff	284	if (AliDebugLevel() >= 999) ShowFastOR(i, idx[index]);
916f1e76	285	}
916f1e76	286	}
916f1e76	287
4bd37bd4	288	delete [] idx;
4bd37bd4	289
39c05eac	290	if ( !foundPeak )
916f1e76	291	{
39c05eac	292	fPatches->RemoveAt( j );
	293	fPatches->Compress();
	294	}
916f1e76	295	}
fff39dd1	296
f4e2cc1e	297	//Delete, avoid leak
	298	for (Int_t x = 0; x < xsize; x++)
	299	{
	300	delete [] peaks[x];
	301	}
	302	delete [] peaks;
39c05eac	303
	304	if ( !fPatches->GetEntriesFast() ) // No patch left
	305	ZeroRegion();
de39a0ff	306	else // Stop the algo when at least one patch is found ( thres & max )
39c05eac	307	{
de39a0ff	308	for (Int_t xx = 0; xx < fRegionSize->X(); xx++)
	309	{
	310	for (Int_t yy = 0; yy < fRegionSize->Y(); yy++)
	311	{
	312	// Prepare data to be sent to STU for further L1 processing
	313	// Sent time sum (rollback tuning) is the one before L0 is issued (maximum time sum)
	314	fRegion[xx][yy] = buffer[xx][yy][1];
	315	}
	316	}
	317
	318	break;
	319	}
916f1e76	320	}
916f1e76	321
f4e2cc1e	322	//Delete, avoid leak
	323	for (Int_t x = 0; x < xsize; x++)
	324	{
	325	for (Int_t y = 0; y < ysize; y++)
	326	{
	327	delete [] buffer[x][y];
	328	}
	329	delete [] buffer[x];
	330	}
	331	delete [] buffer;
8b07b672	332
916f1e76	333	return fPatches->GetEntriesFast();
	334	}
	335
916f1e76	336	//________________
	337	void AliEMCALTriggerTRU::SetADC( Int_t channel, Int_t bin, Int_t sig )
	338	{
a51e676d	339	//Set ADC value
	340	if (channel > 95 \|\| bin > 255) {
	341	AliError("TRU has 96 ADC channels and 256 bins only!");
	342	}
	343	else{
	344	fADC[channel][bin] = sig;
	345	}
916f1e76	346	}
916f1e76	347
916f1e76	348	//________________
	349	void AliEMCALTriggerTRU::SaveRegionADC(Int_t iTRU, Int_t iEvent)
	350	{
	351	// O for STU Hw
	352	//
	353	gSystem->Exec(Form("mkdir -p Event%d",iEvent));
	354
	355	ofstream outfile(Form("Event%d/data_TRU%d.txt",iEvent,iTRU),ios_base::trunc);
	356
	357	for (Int_t i=0;i<96;i++)
	358	{
	359	Int_t ietam = 23 - i/4;
	360
	361	Int_t iphim = 3 - i%4;
	362
	363	outfile << fRegion[ietam][iphim] << endl;
	364	}
	365
	366	outfile.close();
	367	}
	368
916f1e76	369	//________________
	370	void AliEMCALTriggerTRU::Reset()
	371	{
	372	//
	373	fPatches->Delete();
	374
	375	ZeroRegion();
	376
	377	for (Int_t i=0;i<96;i++) for (Int_t j=0;j<256;j++) fADC[i][j] = 0;
	378	}
	379