This file is indexed.

/usr/include/resip/dum/DialogEventInfo.hxx is in libresiprocate-1.9-dev 1.9.6-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
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
#if !defined(RESIP_DialogEventInfo_hxx)
#define RESIP_DialogEventInfo_hxx

#include <memory>
#include "resip/stack/NameAddr.hxx"
#include "resip/dum/DialogId.hxx"
#include "resip/dum/Handles.hxx"
#include "resip/stack/Contents.hxx"

namespace resip
{

//As uac, one is created for DialogSet; given to first dialog, new instances are
//generated for each fork.  As uas, created at the same time as a Dialog.
class DialogEventInfo
{
   public:
      DialogEventInfo(void);
      DialogEventInfo(const DialogEventInfo& rhs);
      DialogEventInfo& operator=(const DialogEventInfo& dialogEventInfo);
      
      //based on DialogEventId
      bool operator==(const DialogEventInfo& rhs) const;
      bool operator!=(const DialogEventInfo& rhs) const;
      bool operator<(const DialogEventInfo& rhs) const;
         
      enum Direction 
      {
         Initiator,
         Recipient
      };

      enum State
      {
         Trying = 0,
         Proceeding,
         Early,
         Confirmed,
         Terminated
      };

      const State& getState() const;

      const Data& getDialogEventId() const;
      
      const Data& getCallId() const;
      const Data& getLocalTag() const;
      bool hasRemoteTag() const;
      const Data& getRemoteTag() const;
      
      bool hasRefferedBy() const;
      const NameAddr& getRefferredBy() const;
      
      const NameAddr& getLocalIdentity() const;
      const NameAddr& getRemoteIdentity() const;
      const Uri& getLocalTarget() const;
      //has... below only applicable when direction is outgoing
      bool hasRouteSet() const;
      const NameAddrs& getRouteSet() const;
      bool hasRemoteTarget() const;
      const Uri& getRemoteTarget() const;

      // cache the first one, then forevermore lookup from InviteSession
      const Contents& getLocalOfferAnswer() const;
      const Contents& getRemoteOfferAnswer() const;
      bool hasLocalOfferAnswer() const;
      bool hasRemoteOfferAnswer() const;

      UInt64 getDurationSeconds() const; // in seconds

      bool hasReplacesId() const;
      const DialogId& getReplacesId() const;

      Direction getDirection() const;

   protected:
      friend class DialogEventStateManager;

      State mState;
      Data mDialogEventId; //unique for all Dialogs at this ua...may hash local +
                          //callid, all 3 tags for forks.  Or could cycles an
                          //integer...hash memory location+salt at cons time(might be easiest).
      DialogId mDialogId;
      Direction mDirection;
      //ID of the dialog this dialog replaced.
      std::auto_ptr<DialogId> mReplacesId;
      InviteSessionHandle mInviteSession;

      std::auto_ptr<NameAddr> mReferredBy;

//could back-point to dialog for this information to save space
      NameAddrs mRouteSet; 
      NameAddr mLocalIdentity;
      NameAddr mRemoteIdentity;
      Uri mLocalTarget;
      std::auto_ptr<Uri> mRemoteTarget;

      UInt64 mCreationTimeSeconds;

      std::auto_ptr<Contents> mLocalOfferAnswer;
      std::auto_ptr<Contents> mRemoteOfferAnswer;

   private:
      bool mReplaced;
};

}

#endif


/* ====================================================================
 * The Vovida Software License, Version 1.0 
 * 
 * Copyright (c) 2000 Vovida Networks, Inc.  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. The names "VOCAL", "Vovida Open Communication Application Library",
 *    and "Vovida Open Communication Application Library (VOCAL)" must
 *    not be used to endorse or promote products derived from this
 *    software without prior written permission. For written
 *    permission, please contact vocal@vovida.org.
 *
 * 4. Products derived from this software may not be called "VOCAL", nor
 *    may "VOCAL" appear in their name, without prior written
 *    permission of Vovida Networks, Inc.
 * 
 * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESSED OR IMPLIED
 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND
 * NON-INFRINGEMENT ARE DISCLAIMED.  IN NO EVENT SHALL VOVIDA
 * NETWORKS, INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT DAMAGES
 * IN EXCESS OF $1,000, NOR FOR ANY 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.
 * 
 * ====================================================================
 * 
 * This software consists of voluntary contributions made by Vovida
 * Networks, Inc. and many individuals on behalf of Vovida Networks,
 * Inc.  For more information on Vovida Networks, Inc., please see
 * <http://www.vovida.org/>.
 *
 */