This file is indexed.

/usr/include/resip/dum/TlsPeerAuthManager.hxx is in libresiprocate-1.11-dev 1:1.11.0~beta5-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
92
93
94
95
96
#if !defined(RESIP_TLSPEERAUTHMANAGER_HXX)
#define RESIP_TLSPEERAUTHMANAGER_HXX

#include <map>
#include <set>

#include "resip/stack/SipMessage.hxx"
#include "DumFeature.hxx"

namespace resip
{
class DialogUsageManager;

typedef std::set<Data> PermittedFromAddresses;
typedef std::map<Data, PermittedFromAddresses> CommonNameMappings;

class TlsPeerAuthManager : public DumFeature
{
   public:
      enum Result
      {
         Authorized,
         Skipped,
         Rejected
      };

      TlsPeerAuthManager(DialogUsageManager& dum, TargetCommand::Target& target, const std::set<Data>& trustedPeers, bool thirdPartyRequiresCertificate = true);
      TlsPeerAuthManager(DialogUsageManager& dum, TargetCommand::Target& target, const std::set<Data>& trustedPeers, bool thirdPartyRequiresCertificate, CommonNameMappings& commonNameMappings);
      virtual ~TlsPeerAuthManager();

      virtual ProcessingResult process(Message* msg);      
      
   protected:

      // can return Authorized, Rejected, Skipped
      virtual Result handle(SipMessage* sipMsg);

      /// should return true if the passed in user is authorized for the provided uri
      virtual bool authorizedForThisIdentity(const std::list<resip::Data> &peerNames, 
                                             resip::Uri &fromUri);

      /// should return true if the request must be challenged
      /// The default is to challenge all requests - override this class to change this beviour
      virtual bool requiresAuthorization(const SipMessage& msg);
      /// should return true if the request should be trusted based on
      /// the source/transport
      /// default implementation uses mTrustedPeers
      virtual bool isTrustedSource(const SipMessage& msg);

   private:
      std::set<Data> mTrustedPeers;
      bool mThirdPartyRequiresCertificate;
      CommonNameMappings mCommonNameMappings;
};

 
}

#endif

/* ====================================================================
 * BSD License
 * 
 * Copyright (c) 2012 Daniel Pocock  All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in
 *    the documentation and/or other materials provided with the
 *    distribution.
 * 
 * 3. Neither the name of the author(s) nor the names of any contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) AND CONTRIBUTORS "AS IS" AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 * 
 * ====================================================================
 * 
 */