56 return StatusCode::SUCCESS;
64 string TileMuIdFile =
"TileMuId_thresholds.dat";
65 fstream *fl =
new fstream(TileMuIdFile.c_str(), fstream::app|
fstream::out);
69 ATH_MSG_INFO (
" TileMuId file didn't open succesfully" );
72 int DSP[4][64][40]; memset(DSP,0,
sizeof(DSP));
73 int Thr[4][64][40]; memset(Thr,0,
sizeof(Thr));
76 int Thr_barrel[23] = {
77 1350, 2550, 1590, 960, 1980, 870, 1770, 1110, 750, 1890, 840, 1860, 1050, 840, 1800, 930, 1890, 1050, 840, 1860, 960, 1110, 900
81 int Thr_extbarrel[12] = {
82 1050, 2100, 210, 1380, 1140, 1440, 2370, 1230, 1500, 1380, 1680, 1680
85 IdentifierHash caloCellMin=0;
86 IdentifierHash caloCellMax=0;
87 m_calo_id->calo_cell_hash_range(3, caloCellMin, caloCellMax);
91 ATH_MSG_INFO (
"Start loop over TileCal cells " << caloCellMax-caloCellMin );
95 for (
unsigned int i=caloCellMin;
i<caloCellMax;
i++) {
97 IdentifierHash idHash =
i;
98 Identifier
id =
m_calo_id->cell_id(idHash);
100 IdentifierHash idSubHash =
m_calo_id->subcalo_cell_hash (idHash, subCalo);
121 for(
int j=0;j<64;j++) {
122 for(
int k=0;
k<20;
k++) {
130 for(
int j=0;j<64;j++) {
131 for(
int k=0;
k<2;
k++) {
136 for(
int k=2;
k<19;
k++) {
142 for(
int i=2;
i<4;
i++) {
143 for(
int j=0;j<64;j++) {
144 for(
int k=0;
k<11;
k++) {
150 for(
int i=0;
i<2;
i++) {
152 for(
int j=0;j<64;j++) {
158 Thr[
i][j][
k]=DSP[
i][j][2];
k++; Thr[
i][j][
k]=DSP[
i][j][7];
k++; Thr[
i][j][
k]=DSP[
i][j][12];
k++; Thr[
i][j][
k]=DSP[
i][j][17];
k++;
159 Thr[
i][j][
k]=2*Thr_barrel[2];
k++; Thr[
i][j][
k]=2*Thr_barrel[7];
k++; Thr[
i][j][
k]=2*Thr_barrel[12];
k++; Thr[
i][j][
k]=2*Thr_barrel[17];
k++;
163 Thr[
i][j][
k]=DSP[
i][j][1];
k++; Thr[
i][j][
k]=DSP[
i][j][4];
k++; Thr[
i][j][
k]=DSP[
i][j][6];
k++; Thr[
i][j][
k]=DSP[
i][j][9];
k++;
164 Thr[
i][j][
k]=DSP[
i][j][11];
k++; Thr[
i][j][
k]=DSP[
i][j][14];
k++; Thr[
i][j][
k]=DSP[
i][j][16];
k++; Thr[
i][j][
k]=DSP[
i][j][19];
k++;
165 Thr[
i][j][
k]=2*Thr_barrel[1];
k++; Thr[
i][j][
k]=2*Thr_barrel[4];
k++; Thr[
i][j][
k]=2*Thr_barrel[6];
k++; Thr[
i][j][
k]=2*Thr_barrel[9];
k++;
166 Thr[
i][j][
k]=2*Thr_barrel[11];
k++; Thr[
i][j][
k]=2*Thr_barrel[14];
k++; Thr[
i][j][
k]=2*Thr_barrel[16];
k++; Thr[
i][j][
k]=2*Thr_barrel[19];
k++;
170 Thr[
i][j][
k]=DSP[
i][j][0];
k++; Thr[
i][j][
k]=DSP[
i][j][3];
k++; Thr[
i][j][
k]=DSP[
i][j][5];
k++; Thr[
i][j][
k]=DSP[
i][j][8];
k++;
171 Thr[
i][j][
k]=DSP[
i][j][10];
k++; Thr[
i][j][
k]=DSP[
i][j][13];
k++; Thr[
i][j][
k]=DSP[
i][j][15];
k++; Thr[
i][j][
k]=DSP[
i][j][18];
k++;
172 Thr[
i][j][
k]=2*Thr_barrel[0];
k++; Thr[
i][j][
k]=2*Thr_barrel[3];
k++; Thr[
i][j][
k]=2*Thr_barrel[5];
k++; Thr[
i][j][
k]=2*Thr_barrel[8];
k++;
173 Thr[
i][j][
k]=2*Thr_barrel[10];
k++; Thr[
i][j][
k]=2*Thr_barrel[13];
k++; Thr[
i][j][
k]=2*Thr_barrel[15];
k++; Thr[
i][j][
k]=2*Thr_barrel[18];
k++;
179 for(
int i=2;
i<4;
i++) {
181 for(
int j=0;j<64;j++) {
187 Thr[
i][j][
k]=DSP[
i][j][1];
k++; Thr[
i][j][
k]=DSP[
i][j][6];
k++;
188 Thr[
i][j][
k]=2*Thr_extbarrel[1];
k++; Thr[
i][j][
k]=2*Thr_extbarrel[6];
k++;
192 Thr[
i][j][
k]=DSP[
i][j][0];
k++; Thr[
i][j][
k]=DSP[
i][j][3];
k++; Thr[
i][j][
k]=DSP[
i][j][5];
k++; Thr[
i][j][
k]=DSP[
i][j][8];
k++; Thr[
i][j][
k]=DSP[
i][j][10];
k++;
193 Thr[
i][j][
k]=2*Thr_extbarrel[0];
k++; Thr[
i][j][
k]=2*Thr_extbarrel[3];
k++; Thr[
i][j][
k]=2*Thr_extbarrel[5];
k++; Thr[
i][j][
k]=2*Thr_extbarrel[8];
k++; Thr[
i][j][
k]=2*Thr_extbarrel[10];
k++;
197 Thr[
i][j][
k]=DSP[
i][j][2];
k++; Thr[
i][j][
k]=DSP[
i][j][4];
k++; Thr[
i][j][
k]=DSP[
i][j][7];
k++; Thr[
i][j][
k]=DSP[
i][j][9];
k++;
198 Thr[
i][j][
k]=2*Thr_extbarrel[2];
k++; Thr[
i][j][
k]=2*Thr_extbarrel[4];
k++; Thr[
i][j][
k]=2*Thr_extbarrel[7];
k++; Thr[
i][j][
k]=2*Thr_extbarrel[9];
k++;
204 for(
int i=0;
i<4;
i++) {
206 for(
int j=0;j<64;j++) {
209 <<
"TileMuId 0x" << std::hex << (
i+1)*0x100+j << std::dec <<
" 0";
210 *fl <<
"TileMuId 0x" << std::hex << (
i+1)*0x100+j << std::dec <<
" 0";
212 for(
int k=0;
k<40;
k++) {
215 <<
" " << Thr[
i][j][
k];
216 *fl <<
" " << Thr[
i][j][
k];
230 return StatusCode::SUCCESS;
238 return StatusCode::SUCCESS;