OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2004 The WebRTC Project Authors. All rights reserved. | 2 * Copyright 2004 The WebRTC Project Authors. All rights reserved. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license | 4 * Use of this source code is governed by a BSD-style license |
5 * that can be found in the LICENSE file in the root of the source | 5 * that can be found in the LICENSE file in the root of the source |
6 * tree. An additional intellectual property rights grant can be found | 6 * tree. An additional intellectual property rights grant can be found |
7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
9 */ | 9 */ |
10 | 10 |
11 // P2PTransportChannel wraps up the state management of the connection between | 11 // P2PTransportChannel wraps up the state management of the connection between |
12 // two P2P clients. Clients have candidate ports for connecting, and | 12 // two P2P clients. Clients have candidate ports for connecting, and |
13 // connections which are combinations of candidates from each end (Alice and | 13 // connections which are combinations of candidates from each end (Alice and |
14 // Bob each have candidates, one candidate from Alice and one candidate from | 14 // Bob each have candidates, one candidate from Alice and one candidate from |
15 // Bob are used to make a connection, repeat to make many connections). | 15 // Bob are used to make a connection, repeat to make many connections). |
16 // | 16 // |
17 // When all of the available connections become invalid (non-writable), we | 17 // When all of the available connections become invalid (non-writable), we |
18 // kick off a process of determining more candidates and more connections. | 18 // kick off a process of determining more candidates and more connections. |
19 // | 19 // |
20 #ifndef WEBRTC_P2P_BASE_P2PTRANSPORTCHANNEL_H_ | 20 #ifndef WEBRTC_P2P_BASE_P2PTRANSPORTCHANNEL_H_ |
21 #define WEBRTC_P2P_BASE_P2PTRANSPORTCHANNEL_H_ | 21 #define WEBRTC_P2P_BASE_P2PTRANSPORTCHANNEL_H_ |
22 | 22 |
23 #include <map> | 23 #include <map> |
24 #include <set> | 24 #include <set> |
25 #include <string> | 25 #include <string> |
26 #include <vector> | 26 #include <vector> |
| 27 |
| 28 #include "webrtc/base/constructormagic.h" |
27 #include "webrtc/p2p/base/candidate.h" | 29 #include "webrtc/p2p/base/candidate.h" |
28 #include "webrtc/p2p/base/candidatepairinterface.h" | 30 #include "webrtc/p2p/base/candidatepairinterface.h" |
29 #include "webrtc/p2p/base/p2ptransport.h" | 31 #include "webrtc/p2p/base/p2ptransport.h" |
30 #include "webrtc/p2p/base/portallocator.h" | 32 #include "webrtc/p2p/base/portallocator.h" |
31 #include "webrtc/p2p/base/portinterface.h" | 33 #include "webrtc/p2p/base/portinterface.h" |
32 #include "webrtc/p2p/base/transportchannelimpl.h" | 34 #include "webrtc/p2p/base/transportchannelimpl.h" |
33 #include "webrtc/base/asyncpacketsocket.h" | 35 #include "webrtc/base/asyncpacketsocket.h" |
34 #include "webrtc/base/sigslot.h" | 36 #include "webrtc/base/sigslot.h" |
35 | 37 |
36 namespace cricket { | 38 namespace cricket { |
(...skipping 291 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
328 TransportChannelState state_ = TransportChannelState::STATE_INIT; | 330 TransportChannelState state_ = TransportChannelState::STATE_INIT; |
329 IceConfig config_; | 331 IceConfig config_; |
330 int last_sent_packet_id_ = -1; // -1 indicates no packet was sent before. | 332 int last_sent_packet_id_ = -1; // -1 indicates no packet was sent before. |
331 | 333 |
332 RTC_DISALLOW_COPY_AND_ASSIGN(P2PTransportChannel); | 334 RTC_DISALLOW_COPY_AND_ASSIGN(P2PTransportChannel); |
333 }; | 335 }; |
334 | 336 |
335 } // namespace cricket | 337 } // namespace cricket |
336 | 338 |
337 #endif // WEBRTC_P2P_BASE_P2PTRANSPORTCHANNEL_H_ | 339 #endif // WEBRTC_P2P_BASE_P2PTRANSPORTCHANNEL_H_ |
OLD | NEW |