OLD | NEW |
| (Empty) |
1 /* | |
2 * Copyright (C) 2012 Google Inc. All rights reserved. | |
3 * | |
4 * Redistribution and use in source and binary forms, with or without | |
5 * modification, are permitted provided that the following conditions | |
6 * are met: | |
7 * | |
8 * 1. Redistributions of source code must retain the above copyright | |
9 * notice, this list of conditions and the following disclaimer. | |
10 * 2. Redistributions in binary form must reproduce the above copyright | |
11 * notice, this list of conditions and the following disclaimer | |
12 * in the documentation and/or other materials provided with the | |
13 * distribution. | |
14 * 3. Neither the name of Google Inc. nor the names of its contributors | |
15 * may be used to endorse or promote products derived from this | |
16 * software without specific prior written permission. | |
17 * | |
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
29 */ | |
30 | |
31 #include "config.h" | |
32 #include "modules/mediastream/RTCIceCandidate.h" | |
33 | |
34 #include "bindings/core/v8/Dictionary.h" | |
35 #include "bindings/core/v8/ExceptionMessages.h" | |
36 #include "bindings/core/v8/ExceptionState.h" | |
37 #include "core/dom/ExceptionCode.h" | |
38 | |
39 namespace blink { | |
40 | |
41 RTCIceCandidate* RTCIceCandidate::create(const Dictionary& dictionary, Exception
State& exceptionState) | |
42 { | |
43 String candidate; | |
44 bool ok = DictionaryHelper::get(dictionary, "candidate", candidate); | |
45 if (!ok || !candidate.length()) { | |
46 exceptionState.throwDOMException(TypeMismatchError, ExceptionMessages::i
ncorrectPropertyType("candidate", "is not a string, or is empty.")); | |
47 return nullptr; | |
48 } | |
49 | |
50 String sdpMid; | |
51 DictionaryHelper::get(dictionary, "sdpMid", sdpMid); | |
52 | |
53 unsigned short sdpMLineIndex = 0; | |
54 DictionaryHelper::get(dictionary, "sdpMLineIndex", sdpMLineIndex); | |
55 | |
56 return new RTCIceCandidate(WebRTCICECandidate(candidate, sdpMid, sdpMLineInd
ex)); | |
57 } | |
58 | |
59 RTCIceCandidate* RTCIceCandidate::create(WebRTCICECandidate webCandidate) | |
60 { | |
61 return new RTCIceCandidate(webCandidate); | |
62 } | |
63 | |
64 RTCIceCandidate::RTCIceCandidate(WebRTCICECandidate webCandidate) | |
65 : m_webCandidate(webCandidate) | |
66 { | |
67 } | |
68 | |
69 String RTCIceCandidate::candidate() const | |
70 { | |
71 return m_webCandidate.candidate(); | |
72 } | |
73 | |
74 String RTCIceCandidate::sdpMid() const | |
75 { | |
76 return m_webCandidate.sdpMid(); | |
77 } | |
78 | |
79 unsigned short RTCIceCandidate::sdpMLineIndex() const | |
80 { | |
81 return m_webCandidate.sdpMLineIndex(); | |
82 } | |
83 | |
84 WebRTCICECandidate RTCIceCandidate::webCandidate() const | |
85 { | |
86 return m_webCandidate; | |
87 } | |
88 | |
89 void RTCIceCandidate::setCandidate(String candidate) | |
90 { | |
91 m_webCandidate.setCandidate(candidate); | |
92 } | |
93 | |
94 void RTCIceCandidate::setSdpMid(String sdpMid) | |
95 { | |
96 m_webCandidate.setSdpMid(sdpMid); | |
97 } | |
98 | |
99 void RTCIceCandidate::setSdpMLineIndex(unsigned short sdpMLineIndex) | |
100 { | |
101 m_webCandidate.setSdpMLineIndex(sdpMLineIndex); | |
102 } | |
103 | |
104 } // namespace blink | |
OLD | NEW |