Use continual gathering to restore backup connections

webrtc/p2p/base/transport.h

 /*
  *  Copyright 2004 The WebRTC Project Authors. All rights reserved.
  *
  *  Use of this source code is governed by a BSD-style license
  *  that can be found in the LICENSE file in the root of the source
  *  tree. An additional intellectual property rights grant can be found
  *  in the file PATENTS.  All contributing project authors may
  *  be found in the AUTHORS file in the root of the source tree.
  */
 
@@ skipping 63 matching lines @@
 
 // TODO(deadbeef): Unify with PeerConnectionInterface::IceConnectionState
 // once /talk/ and /webrtc/ are combined, and also switch to ENUM_NAME naming
 // style.
 enum IceGatheringState {
   kIceGatheringNew = 0,
   kIceGatheringGathering,
   kIceGatheringComplete,
 };
 
+enum ContinualGatheringPolicy {
+  // All port allocator sessions will stop after a writable connection is found.
+  GATHER_ONCE = 0;
+  // The most recent port allocator session will keep on running.
+  GATHER_CONTINUALLY;
+  // The most recent port allocator session will keep on running, and it will
+  // try to recover connectivity if the channel becomes not connected.
+  GATHER_CONTINUALLY_AND_RECOVER;
+};
+
 // Stats that we can return about the connections for a transport channel.
 // TODO(hta): Rename to ConnectionStats
 struct ConnectionInfo {
   ConnectionInfo()
       : best_connection(false),
         writable(false),
         receiving(false),
         timeout(false),
         new_connection(false),
         rtt(0),
@@ skipping 57 matching lines @@
   TransportChannelStatsList channel_stats;
 };
 
 // Information about ICE configuration.
 struct IceConfig {
   // The ICE connection receiving timeout value in milliseconds.
   int receiving_timeout = -1;
   // Time interval in milliseconds to ping a backup connection when the ICE
   // channel is strongly connected.
   int backup_connection_ping_interval = -1;
-  // If true, the most recent port allocator session will keep on running.
-  bool gather_continually = false;
+
+  ContinualGatheringPolicy gathering_policy = GATHER_ONCE;
+
+  bool gather_continually() {
+    return gathering_policy == GATHER_CONTINUALLY ||
+           gathering_policy == GATHER_CONTINUALLY_AND_RECOVER;
+  }
 
   // Whether we should prioritize Relay/Relay candidate when nothing
   // is writable yet.
   bool prioritize_most_likely_candidate_pairs = false;
 
   // If the current best connection is both writable and receiving,
   // then we will also try hard to make sure it is pinged at this rate
   // (Default value is a little less than 2 * STRONG_PING_INTERVAL).
   int max_strong_interval = -1;
 
+  // Interval to check on all networks and to perform ICE regathering on any
+  // active network having no connection on it.
+  int regather_on_failed_networks_interval = -1;
+
   IceConfig() {}
   IceConfig(int receiving_timeout_ms,
             int backup_connection_ping_interval,
-            bool gather_continually,
+            bool gathering_policy,
             bool prioritize_most_likely_candidate_pairs,
-            int max_strong_interval_ms)
+            int max_strong_interval_ms,
+            int regather_on_failed_networks_interval_ms)
       : receiving_timeout(receiving_timeout_ms),
         backup_connection_ping_interval(backup_connection_ping_interval),
-        gather_continually(gather_continually),
+        gathering_policy(gathering_policy),
         prioritize_most_likely_candidate_pairs(
             prioritize_most_likely_candidate_pairs),
-        max_strong_interval(max_strong_interval_ms) {}
+        max_strong_interval(max_strong_interval_ms),
+        regather_on_failed_networks_interval(
+            regather_on_failed_networks_interval_ms) {}
 };
 
 bool BadTransportDescription(const std::string& desc, std::string* err_desc);
 
 bool IceCredentialsChanged(const std::string& old_ufrag,
                            const std::string& old_pwd,
                            const std::string& new_ufrag,
                            const std::string& new_pwd);
 
 class Transport : public sigslot::has_slots<> {
@@ skipping 173 matching lines @@
 
   ChannelMap channels_;
 
   RTC_DISALLOW_COPY_AND_ASSIGN(Transport);
 };
 
 
 }  // namespace cricket
 
 #endif  // WEBRTC_P2P_BASE_TRANSPORT_H_