This file is indexed.

/usr/include/quickfix/DatabaseConnectionPool.h is in libquickfix-dev 1.14.4+dfsg-1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
/* -*- C++ -*- */

/****************************************************************************
** Copyright (c) 2001-2014
**
** This file is part of the QuickFIX FIX Engine
**
** This file may be distributed under the terms of the quickfixengine.org
** license as defined by quickfixengine.org and appearing in the file
** LICENSE included in the packaging of this file.
**
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
**
** See http://www.quickfixengine.org/LICENSE for licensing information.
**
** Contact ask@quickfixengine.org if any conditions of this licensing are
** not clear to you.
**
****************************************************************************/

#ifndef FIX_DATABASECONNECTIONPOOL_H
#define FIX_DATABASECONNECTIONPOOL_H

#ifdef _MSC_VER
#pragma warning( disable : 4503 4355 4786 4290 )
#endif

#include "DatabaseConnectionID.h"
#include <string>
#include <map>

namespace FIX
{
template< typename T > class DatabaseConnectionPool
{
public:
  DatabaseConnectionPool( bool poolConnections )
  : m_poolConnections( poolConnections ) {}

  T* create( const DatabaseConnectionID& id )
  {
    if( !m_poolConnections )
      return new T( id );

    if( m_connections.find( id ) == m_connections.end() )
    {
      m_connections[id] = Connection
        ( new T(id), 0 );
    }
    m_connections[id].second++;
    return m_connections[id].first;
  }

  bool destroy( T* pConnection )
  {
    if( !m_poolConnections )
    {
      delete pConnection;
      return true;
    }

    const DatabaseConnectionID& id = pConnection->connectionID();
    if( m_connections.find( id ) == m_connections.end() )
      return false;

    Connection& connection = m_connections[id];
    if( connection.first != pConnection )
      return false;

    connection.second--;
    if( connection.second == 0 )
    {
      m_connections.erase( id );
      delete pConnection;
    }
    return true;
  }

private:
  typedef std::pair<T*, int>
    Connection;
  typedef std::map<DatabaseConnectionID, Connection>
    Connections;

  Connections m_connections;
  bool m_poolConnections;
};
}

#endif