00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033
00034
00035
00036
00037
00038
00039
00040
00041
00042
00043
00044
00045
00046
00047
00048
00049
00050
00051
00052
00053
00054
00055
00056
00057
00058
00059
00060
00061
00062
00063
00064
00065
00066
00067
00068
00069
00070
00071
00072
00073
00074
00075
00076
00077
00078
00079
00080
00081 #include "TObjectTable.h"
00082 #include "TROOT.h"
00083 #include "TClass.h"
00084 #include "TError.h"
00085
00086
00087 TObjectTable *gObjectTable;
00088
00089
00090 ClassImp(TObjectTable)
00091
00092
00093 TObjectTable::TObjectTable(Int_t tableSize)
00094 {
00095
00096
00097 fSize = (Int_t)TMath::NextPrime(tableSize);
00098 fTable = new TObject* [fSize];
00099 memset(fTable, 0, fSize*sizeof(TObject*));
00100 fTally = 0;
00101 }
00102
00103
00104 TObjectTable::~TObjectTable()
00105 {
00106
00107
00108 delete [] fTable; fTable = 0;
00109 }
00110
00111
00112 void TObjectTable::Print(Option_t *option) const
00113 {
00114
00115
00116
00117
00118 TString opt = option;
00119 opt.ToLower();
00120 if (opt.Contains("all")) {
00121 TObject *obj;
00122 int i, num = 0;
00123 Printf("\nList of all objects");
00124 Printf("object address class name");
00125 Printf("================================================================================");
00126 for (i = 0; i < fSize; i++) {
00127 if (!fTable[i]) continue;
00128 num++;
00129 obj = fTable[i];
00130 printf("%-8d 0x%-16lx %-24s %s\n", num, (Long_t)obj, obj->ClassName(),
00131 obj->GetName());
00132 }
00133 Printf("================================================================================\n");
00134 }
00135
00136
00137 InstanceStatistics();
00138 }
00139
00140
00141 void TObjectTable::Add(TObject *op)
00142 {
00143
00144
00145 if (!op) {
00146 Error("Add", "op is 0");
00147 return;
00148 }
00149 if (!fTable)
00150 return;
00151
00152 Int_t slot = FindElement(op);
00153 if (fTable[slot] == 0) {
00154 fTable[slot] = op;
00155 fTally++;
00156 if (HighWaterMark())
00157 Expand(2 * fSize);
00158 }
00159 }
00160
00161
00162 void TObjectTable::AddObj(TObject *op)
00163 {
00164
00165
00166
00167
00168
00169 static Bool_t olock = kFALSE;
00170
00171 if (!op) {
00172 ::Error("TObjectTable::AddObj", "op is 0");
00173 return;
00174 }
00175 if (olock)
00176 return;
00177
00178 if (!gObjectTable) {
00179 olock = kTRUE;
00180 gObjectTable = new TObjectTable(10000);
00181 olock = kFALSE;
00182 gObjectTable->Add(gObjectTable);
00183 }
00184
00185 gObjectTable->Add(op);
00186 }
00187
00188
00189 void TObjectTable::Delete(Option_t *)
00190 {
00191
00192
00193 for (int i = 0; i < fSize; i++) {
00194 if (fTable[i]) {
00195 delete fTable[i];
00196 fTable[i] = 0;
00197 }
00198 }
00199 fTally = 0;
00200 }
00201
00202
00203 void TObjectTable::Remove(TObject *op)
00204 {
00205
00206
00207 if (op == 0) {
00208 Error("Remove", "remove 0 from TObjectTable");
00209 return;
00210 }
00211
00212 if (!fTable)
00213 return;
00214
00215 Int_t i = FindElement(op);
00216 if (fTable[i] == 0) {
00217 Warning("Remove", "0x%lx not found at %d", (long)op, i);
00218 for (int j = 0; j < fSize; j++) {
00219 if (fTable[j] == op) {
00220 Error("Remove", "0x%lx found at %d !!!", (long)op, j);
00221 i = j;
00222 }
00223 }
00224 }
00225
00226 if (fTable[i]) {
00227 fTable[i] = 0;
00228 FixCollisions(i);
00229 fTally--;
00230 }
00231 }
00232
00233
00234 void TObjectTable::RemoveQuietly(TObject *op)
00235 {
00236
00237
00238
00239
00240
00241 if (op == 0) return;
00242
00243 if (!fTable)
00244 return;
00245
00246 Int_t i = FindElement(op);
00247 if (fTable[i] == 0)
00248 for (int j = 0; j < fSize; j++)
00249 if (fTable[j] == op)
00250 i = j;
00251
00252 fTable[i] = 0;
00253 FixCollisions(i);
00254 fTally--;
00255 }
00256
00257
00258 void TObjectTable::Terminate()
00259 {
00260
00261
00262 InstanceStatistics();
00263 delete [] fTable; fTable = 0;
00264 }
00265
00266
00267 Int_t TObjectTable::FindElement(TObject *op)
00268 {
00269
00270
00271
00272
00273 Int_t slot, n;
00274 TObject *slotOp;
00275
00276 if (!fTable)
00277 return 0;
00278
00279
00280 slot = Int_t(TString::Hash(&op, sizeof(TObject*)) % fSize);
00281 for (n = 0; n < fSize; n++) {
00282 if ((slotOp = fTable[slot]) == 0)
00283 break;
00284 if (op == slotOp)
00285 break;
00286 if (++slot == fSize)
00287 slot = 0;
00288 }
00289 return slot;
00290 }
00291
00292
00293 void TObjectTable::FixCollisions(Int_t index)
00294 {
00295
00296
00297 Int_t oldIndex, nextIndex;
00298 TObject *nextObject;
00299
00300 for (oldIndex = index+1; ;oldIndex++) {
00301 if (oldIndex >= fSize)
00302 oldIndex = 0;
00303 nextObject = fTable[oldIndex];
00304 if (nextObject == 0)
00305 break;
00306 nextIndex = FindElement(nextObject);
00307 if (nextIndex != oldIndex) {
00308 fTable[nextIndex] = nextObject;
00309 fTable[oldIndex] = 0;
00310 }
00311 }
00312 }
00313
00314
00315 void TObjectTable::Expand(Int_t newSize)
00316 {
00317
00318
00319 TObject **oldTable = fTable, *op;
00320 int oldsize = fSize;
00321 newSize = (Int_t)TMath::NextPrime(newSize);
00322 fTable = new TObject* [newSize];
00323 memset(fTable, 0, newSize*sizeof(TObject*));
00324 fSize = newSize;
00325 fTally = 0;
00326 for (int i = 0; i < oldsize; i++)
00327 if ((op = oldTable[i]))
00328 Add(op);
00329 delete [] oldTable;
00330 }
00331
00332
00333 void TObjectTable::InstanceStatistics() const
00334 {
00335
00336
00337 int n, h, s, ncum = 0, hcum = 0, scum = 0, tcum = 0, thcum = 0;
00338
00339 if (fTally == 0 || !fTable)
00340 return;
00341
00342 UpdateInstCount();
00343
00344 Printf("\nObject statistics");
00345 Printf("class cnt on heap size total size heap size");
00346 Printf("================================================================================");
00347 TIter next(gROOT->GetListOfClasses());
00348 TClass *cl;
00349 while ((cl = (TClass*) next())) {
00350 n = cl->GetInstanceCount();
00351 h = cl->GetHeapInstanceCount();
00352 s = cl->Size();
00353 if (n > 0) {
00354 Printf("%-24s %8d%11d%9d%14d%13d", cl->GetName(), n, h, s, n*s, h*s);
00355 ncum += n;
00356 hcum += h;
00357 scum += s;
00358 tcum += n*s;
00359 thcum += h*s;
00360 }
00361 }
00362 Printf("--------------------------------------------------------------------------------");
00363 Printf("Total: %8d%11d%9d%14d%13d", ncum, hcum, scum, tcum, thcum);
00364 Printf("================================================================================\n");
00365 }
00366
00367
00368 void TObjectTable::UpdateInstCount() const
00369 {
00370
00371
00372 TObject *op;
00373
00374 if (!fTable || !TROOT::Initialized())
00375 return;
00376
00377 gROOT->GetListOfClasses()->R__FOR_EACH(TClass,ResetInstanceCount)();
00378
00379 for (int i = 0; i < fSize; i++)
00380 if ((op = fTable[i])) {
00381 if (op->TestBit(TObject::kNotDeleted))
00382 op->IsA()->AddInstance(op->IsOnHeap());
00383 else
00384 Error("UpdateInstCount", "oops 0x%lx\n", (Long_t)op);
00385 }
00386 }
00387
00388
00389 void *TObjectTable::CheckPtrAndWarn(const char *msg, void *vp)
00390 {
00391
00392
00393
00394 if (fTable && vp && fTable[FindElement((TObject*)vp)]) {
00395 Remove((TObject*)vp);
00396 Warning("CheckPtrAndWarn", "%s (0x%lx)\n", msg, (Long_t)vp);
00397 }
00398 return vp;
00399 }