summaryrefslogtreecommitdiffstats
path: root/media/gmp-clearkey/0.1/AnnexB.cpp
diff options
context:
space:
mode:
authorMatt A. Tobin <mattatobin@localhost.localdomain>2018-02-02 04:16:08 -0500
committerMatt A. Tobin <mattatobin@localhost.localdomain>2018-02-02 04:16:08 -0500
commit5f8de423f190bbb79a62f804151bc24824fa32d8 (patch)
tree10027f336435511475e392454359edea8e25895d /media/gmp-clearkey/0.1/AnnexB.cpp
parent49ee0794b5d912db1f95dce6eb52d781dc210db5 (diff)
downloadUXP-5f8de423f190bbb79a62f804151bc24824fa32d8.tar
UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.tar.gz
UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.tar.lz
UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.tar.xz
UXP-5f8de423f190bbb79a62f804151bc24824fa32d8.zip
Add m-esr52 at 52.6.0
Diffstat (limited to 'media/gmp-clearkey/0.1/AnnexB.cpp')
-rw-r--r--media/gmp-clearkey/0.1/AnnexB.cpp79
1 files changed, 79 insertions, 0 deletions
diff --git a/media/gmp-clearkey/0.1/AnnexB.cpp b/media/gmp-clearkey/0.1/AnnexB.cpp
new file mode 100644
index 000000000..952936deb
--- /dev/null
+++ b/media/gmp-clearkey/0.1/AnnexB.cpp
@@ -0,0 +1,79 @@
+/*
+ * Copyright 2015, Mozilla Foundation and contributors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#include "AnnexB.h"
+#include "BigEndian.h"
+
+#include <cstring>
+
+using mozilla::BigEndian;
+
+static const uint8_t kAnnexBDelimiter[] = { 0, 0, 0, 1 };
+
+/* static */ void
+AnnexB::ConvertFrameInPlace(std::vector<uint8_t>& aBuffer)
+{
+ for (size_t i = 0; i < aBuffer.size() - 4 - sizeof(kAnnexBDelimiter) + 1; ) {
+ uint32_t nalLen = BigEndian::readUint32(&aBuffer[i]);
+ memcpy(&aBuffer[i], kAnnexBDelimiter, sizeof(kAnnexBDelimiter));
+ i += nalLen + 4;
+ }
+}
+
+static void
+ConvertParamSetToAnnexB(std::vector<uint8_t>::const_iterator& aIter,
+ size_t aCount,
+ std::vector<uint8_t>& aOutAnnexB)
+{
+ for (size_t i = 0; i < aCount; i++) {
+ aOutAnnexB.insert(aOutAnnexB.end(), kAnnexBDelimiter,
+ kAnnexBDelimiter + sizeof(kAnnexBDelimiter));
+
+ uint16_t len = BigEndian::readUint16(&*aIter); aIter += 2;
+ aOutAnnexB.insert(aOutAnnexB.end(), aIter, aIter + len); aIter += len;
+ }
+}
+
+/* static */ void
+AnnexB::ConvertConfig(const std::vector<uint8_t>& aBuffer,
+ std::vector<uint8_t>& aOutAnnexB)
+{
+ // Skip past irrelevant headers
+ auto it = aBuffer.begin() + 5;
+
+ if (it >= aBuffer.end()) {
+ return;
+ }
+
+ size_t count = *(it++) & 31;
+
+ // Check that we have enough bytes for the Annex B conversion
+ // and the next size field. Bail if not.
+ if (it + count * 2 >= aBuffer.end()) {
+ return;
+ }
+
+ ConvertParamSetToAnnexB(it, count, aOutAnnexB);
+
+ // Check that we have enough bytes for the Annex B conversion.
+ count = *(it++);
+ if (it + count * 2 > aBuffer.end()) {
+ aOutAnnexB.clear();
+ return;
+ }
+
+ ConvertParamSetToAnnexB(it, count, aOutAnnexB);
+}