| 1346 | } |
| 1347 | |
| 1348 | void ConnectionsPool::printPool(string& str) |
| 1349 | { |
| 1350 | string s; |
| 1351 | s.printf("Conn pool 0x%08X, all %d, max %d, lifeTime %d\n", |
| 1352 | this, m_allCount, m_maxCount, m_lifeTime); |
| 1353 | str.append(s); |
| 1354 | |
| 1355 | s.printf(" active list 0x%08X:\n", m_activeList); |
| 1356 | str.append(s); |
| 1357 | |
| 1358 | Data* item = m_activeList; |
| 1359 | int cntActive = 0; |
| 1360 | if (item) |
| 1361 | { |
| 1362 | do |
| 1363 | { |
| 1364 | str.append(item->print()); |
| 1365 | item = item->m_next; |
| 1366 | cntActive++; |
| 1367 | } while (item != m_activeList); |
| 1368 | } |
| 1369 | |
| 1370 | s.printf(" idle list 0x%08X:\n", m_idleList); |
| 1371 | str.append(s); |
| 1372 | |
| 1373 | item = m_idleList; |
| 1374 | int cntIdle = 0; |
| 1375 | if (item) |
| 1376 | { |
| 1377 | do |
| 1378 | { |
| 1379 | str.append(item->print()); |
| 1380 | item = item->m_next; |
| 1381 | cntIdle++; |
| 1382 | } while (item != m_idleList); |
| 1383 | } |
| 1384 | |
| 1385 | s.printf(" active list count: %d\n", cntActive); |
| 1386 | str.append(s); |
| 1387 | s.printf(" idle list count: %d\n", cntIdle); |
| 1388 | str.append(s); |
| 1389 | s.printf(" idle array count: %d\n", m_idleArray.getCount()); |
| 1390 | str.append(s); |
| 1391 | |
| 1392 | for (FB_SIZE_T i = 0; i < m_idleArray.getCount(); i++) |
| 1393 | str.append(m_idleArray[i]->print()); |
| 1394 | } |
| 1395 | |
| 1396 | string ConnectionsPool::Data::print() |
| 1397 | { |
no test coverage detected