OLD | NEW |
1 /* | 1 /* |
2 * libjingle | 2 * Copyright 2011 The WebRTC Project Authors. All rights reserved. |
3 * Copyright 2011 Google Inc. | |
4 * | 3 * |
5 * Redistribution and use in source and binary forms, with or without | 4 * Use of this source code is governed by a BSD-style license |
6 * modification, are permitted provided that the following conditions are met: | 5 * that can be found in the LICENSE file in the root of the source |
7 * | 6 * tree. An additional intellectual property rights grant can be found |
8 * 1. Redistributions of source code must retain the above copyright notice, | 7 * in the file PATENTS. All contributing project authors may |
9 * this list of conditions and the following disclaimer. | 8 * be found in the AUTHORS file in the root of the source tree. |
10 * 2. Redistributions in binary form must reproduce the above copyright notice, | |
11 * this list of conditions and the following disclaimer in the documentation | |
12 * and/or other materials provided with the distribution. | |
13 * 3. The name of the author may not be used to endorse or promote products | |
14 * derived from this software without specific prior written permission. | |
15 * | |
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED | |
17 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF | |
18 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO | |
19 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
20 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | |
21 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; | |
22 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, | |
23 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR | |
24 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF | |
25 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
26 */ | 9 */ |
27 | 10 |
28 #include <stdio.h> | 11 #include <stdio.h> |
29 #include <stdlib.h> | 12 #include <stdlib.h> |
30 #include <string.h> | 13 #include <string.h> |
31 | 14 |
32 #include <vector> | 15 #include <vector> |
33 | 16 |
34 #include "talk/examples/peerconnection/server/data_socket.h" | 17 #include "webrtc/examples/peerconnection/server/data_socket.h" |
35 #include "talk/examples/peerconnection/server/peer_channel.h" | 18 #include "webrtc/examples/peerconnection/server/peer_channel.h" |
36 #include "talk/examples/peerconnection/server/utils.h" | 19 #include "webrtc/examples/peerconnection/server/utils.h" |
37 #include "webrtc/base/flags.h" | 20 #include "webrtc/base/flags.h" |
38 | 21 |
39 DEFINE_bool(help, false, "Prints this message"); | 22 DEFINE_bool(help, false, "Prints this message"); |
40 DEFINE_int(port, 8888, "The port on which to listen."); | 23 DEFINE_int(port, 8888, "The port on which to listen."); |
41 | 24 |
42 static const size_t kMaxConnections = (FD_SETSIZE - 2); | 25 static const size_t kMaxConnections = (FD_SETSIZE - 2); |
43 | 26 |
44 void HandleBrowserRequest(DataSocket* ds, bool* quit) { | 27 void HandleBrowserRequest(DataSocket* ds, bool* quit) { |
45 assert(ds && ds->valid()); | 28 assert(ds && ds->valid()); |
46 assert(quit); | 29 assert(quit); |
(...skipping 134 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
181 } | 164 } |
182 } | 165 } |
183 } | 166 } |
184 | 167 |
185 for (SocketArray::iterator i = sockets.begin(); i != sockets.end(); ++i) | 168 for (SocketArray::iterator i = sockets.begin(); i != sockets.end(); ++i) |
186 delete (*i); | 169 delete (*i); |
187 sockets.clear(); | 170 sockets.clear(); |
188 | 171 |
189 return 0; | 172 return 0; |
190 } | 173 } |
OLD | NEW |