2022-08-26 15:44:59 +00:00
|
|
|
// Copyright 2017 Google LLC. All rights reserved.
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
//
|
|
|
|
// Use of this source code is governed by a BSD-style
|
|
|
|
// license that can be found in the LICENSE file or at
|
|
|
|
// https://developers.google.com/open-source/licenses/bsd
|
|
|
|
|
|
|
|
#include "packager/media/base/media_handler_test_base.h"
|
|
|
|
|
|
|
|
#include "packager/media/base/audio_stream_info.h"
|
2017-09-18 15:47:00 +00:00
|
|
|
#include "packager/media/base/text_stream_info.h"
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
#include "packager/media/base/video_stream_info.h"
|
2022-11-04 22:46:41 +00:00
|
|
|
#include "packager/status/status_test_util.h"
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
|
|
|
|
namespace {
|
|
|
|
|
|
|
|
const int kTrackId = 1;
|
2021-08-04 18:56:44 +00:00
|
|
|
const int64_t kDuration = 10000;
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
const char kCodecString[] = "codec string";
|
|
|
|
const uint8_t kSampleBits = 1;
|
|
|
|
const uint8_t kNumChannels = 2;
|
|
|
|
const uint32_t kSamplingFrequency = 48000;
|
|
|
|
const uint64_t kSeekPrerollNs = 12345;
|
|
|
|
const uint64_t kCodecDelayNs = 56789;
|
|
|
|
const uint32_t kMaxBitrate = 13579;
|
|
|
|
const uint32_t kAvgBitrate = 13000;
|
|
|
|
const char kLanguage[] = "eng";
|
2022-11-04 22:46:41 +00:00
|
|
|
const uint32_t kWidth = 10u;
|
|
|
|
const uint32_t kHeight = 20u;
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
const uint32_t kPixelWidth = 2u;
|
|
|
|
const uint32_t kPixelHeight = 3u;
|
2019-09-23 06:24:33 +00:00
|
|
|
const uint8_t kTransferCharacteristics = 0;
|
2017-05-15 16:22:06 +00:00
|
|
|
const int16_t kTrickPlayFactor = 0;
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
const uint8_t kNaluLengthSize = 1u;
|
|
|
|
const bool kEncrypted = true;
|
|
|
|
|
|
|
|
// Use H264 code config.
|
|
|
|
const uint8_t kCodecConfig[]{
|
2018-03-26 18:04:09 +00:00
|
|
|
// clang-format off
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
// Header
|
|
|
|
0x01, 0x64, 0x00, 0x1e, 0xff,
|
|
|
|
// SPS count (ignore top three bits)
|
|
|
|
0xe1,
|
|
|
|
// SPS
|
|
|
|
0x00, 0x19, // Size
|
|
|
|
0x67, 0x64, 0x00, 0x1e, 0xac, 0xd9, 0x40, 0xa0, 0x2f, 0xf9, 0x70, 0x11,
|
|
|
|
0x00, 0x00, 0x03, 0x03, 0xe9, 0x00, 0x00, 0xea, 0x60, 0x0f, 0x16, 0x2d,
|
|
|
|
0x96,
|
|
|
|
// PPS count
|
|
|
|
0x01,
|
|
|
|
// PPS
|
|
|
|
0x00, 0x06, // Size
|
|
|
|
0x68, 0xeb, 0xe3, 0xcb, 0x22, 0xc0,
|
2018-03-26 18:04:09 +00:00
|
|
|
// clang-format on
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
// Mock data, we don't really care about what is inside.
|
|
|
|
const uint8_t kData[]{
|
|
|
|
0x01, 0x02, 0x03, 0x04, 0x05, 0x06,
|
|
|
|
};
|
|
|
|
|
|
|
|
} // namespace
|
|
|
|
|
|
|
|
namespace shaka {
|
|
|
|
namespace media {
|
|
|
|
|
2018-01-03 00:10:33 +00:00
|
|
|
std::string BoolToString(bool value) {
|
|
|
|
return value ? "true" : "false";
|
|
|
|
}
|
|
|
|
|
2018-05-25 17:41:02 +00:00
|
|
|
bool TryMatchStreamDataType(const StreamDataType& actual,
|
|
|
|
const StreamDataType& expected,
|
|
|
|
::testing::MatchResultListener* listener) {
|
|
|
|
if (actual != expected) {
|
|
|
|
std::string expected_as_string = StreamDataTypeToString(expected);
|
|
|
|
std::string actual_as_string = StreamDataTypeToString(actual);
|
|
|
|
|
2018-06-19 16:53:50 +00:00
|
|
|
*listener << "which is " << actual_as_string << " (expected "
|
|
|
|
<< expected_as_string << ")";
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool TryMatchStreamType(const StreamType& actual,
|
|
|
|
const StreamType& expected,
|
|
|
|
::testing::MatchResultListener* listener) {
|
|
|
|
if (actual != expected) {
|
|
|
|
std::string expected_as_string = StreamTypeToString(expected);
|
|
|
|
std::string actual_as_string = StreamTypeToString(actual);
|
|
|
|
|
2018-05-25 17:41:02 +00:00
|
|
|
*listener << "which is " << actual_as_string << " (expected "
|
|
|
|
<< expected_as_string << ")";
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string ToPrettyString(const std::string& str) {
|
|
|
|
std::string out;
|
|
|
|
|
|
|
|
// Opening quotation.
|
|
|
|
out.push_back('"');
|
|
|
|
|
|
|
|
for (char c : str) {
|
|
|
|
if (isspace(c)) {
|
|
|
|
// Make all white space characters spaces to avoid print issues in
|
|
|
|
// the terminal.
|
|
|
|
out.push_back(' ');
|
|
|
|
} else if (isalnum(c)) {
|
|
|
|
// If the character is alpha-numeric, then print it as is. Just using
|
|
|
|
// these characters, it should be enough to understand the string.
|
|
|
|
out.push_back(c);
|
|
|
|
} else {
|
|
|
|
// Replace all other characters with '.'. This is to avoid print issues
|
|
|
|
// (e.g. \n) or readability issues (e.g. ").
|
|
|
|
out.push_back('.');
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Closing quotation.
|
|
|
|
out.push_back('"');
|
|
|
|
|
|
|
|
return out;
|
|
|
|
}
|
|
|
|
|
2017-09-14 16:23:29 +00:00
|
|
|
bool FakeInputMediaHandler::ValidateOutputStreamIndex(size_t index) const {
|
2022-11-04 22:46:41 +00:00
|
|
|
UNUSED(index);
|
2017-09-14 16:23:29 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
Status FakeInputMediaHandler::InitializeInternal() {
|
|
|
|
return Status::OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
Status FakeInputMediaHandler::Process(std::unique_ptr<StreamData> stream_data) {
|
2022-11-04 22:46:41 +00:00
|
|
|
UNUSED(stream_data);
|
2017-09-14 16:23:29 +00:00
|
|
|
return Status(error::INTERNAL_ERROR,
|
|
|
|
"FakeInputMediaHandler should never be a downstream handler.");
|
2017-09-14 16:23:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Status MockOutputMediaHandler::InitializeInternal() {
|
|
|
|
return Status::OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
Status MockOutputMediaHandler::Process(
|
|
|
|
std::unique_ptr<StreamData> stream_data) {
|
|
|
|
OnProcess(stream_data.get());
|
|
|
|
return Status::OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
Status MockOutputMediaHandler::OnFlushRequest(size_t index) {
|
|
|
|
OnFlush(index);
|
|
|
|
return Status::OK;
|
|
|
|
}
|
|
|
|
|
2018-06-20 23:13:15 +00:00
|
|
|
Status CachingMediaHandler::InitializeInternal() {
|
2017-03-21 23:14:46 +00:00
|
|
|
return Status::OK;
|
|
|
|
}
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
|
2018-06-20 23:13:15 +00:00
|
|
|
Status CachingMediaHandler::Process(std::unique_ptr<StreamData> stream_data) {
|
2017-03-21 23:14:46 +00:00
|
|
|
stream_data_vector_.push_back(std::move(stream_data));
|
|
|
|
return Status::OK;
|
|
|
|
}
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
|
2018-06-20 23:13:15 +00:00
|
|
|
Status CachingMediaHandler::OnFlushRequest(size_t input_stream_index) {
|
2022-11-04 22:46:41 +00:00
|
|
|
UNUSED(input_stream_index);
|
2017-03-21 23:14:46 +00:00
|
|
|
return Status::OK;
|
|
|
|
}
|
|
|
|
|
2018-06-20 23:13:15 +00:00
|
|
|
bool CachingMediaHandler::ValidateOutputStreamIndex(size_t stream_index) const {
|
2022-11-04 22:46:41 +00:00
|
|
|
UNUSED(stream_index);
|
2017-03-21 23:14:46 +00:00
|
|
|
return true;
|
|
|
|
}
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
|
2017-09-12 17:24:24 +00:00
|
|
|
bool MediaHandlerTestBase::IsVideoCodec(Codec codec) const {
|
|
|
|
return codec >= kCodecVideo && codec < kCodecVideoMaxPlusOne;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::unique_ptr<StreamInfo> MediaHandlerTestBase::GetVideoStreamInfo(
|
2021-08-04 18:56:44 +00:00
|
|
|
int32_t time_scale) const {
|
2017-09-12 17:24:24 +00:00
|
|
|
return GetVideoStreamInfo(time_scale, kCodecVP9, kWidth, kHeight);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::unique_ptr<StreamInfo> MediaHandlerTestBase::GetVideoStreamInfo(
|
2021-08-04 18:56:44 +00:00
|
|
|
int32_t time_scale,
|
2017-09-12 17:24:24 +00:00
|
|
|
uint32_t width,
|
2022-11-04 22:46:41 +00:00
|
|
|
uint32_t height) const {
|
2017-09-12 17:24:24 +00:00
|
|
|
return GetVideoStreamInfo(time_scale, kCodecVP9, width, height);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::unique_ptr<StreamInfo> MediaHandlerTestBase::GetVideoStreamInfo(
|
2021-08-04 18:56:44 +00:00
|
|
|
int32_t time_scale,
|
2017-09-12 17:24:24 +00:00
|
|
|
Codec codec) const {
|
|
|
|
return GetVideoStreamInfo(time_scale, codec, kWidth, kHeight);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::unique_ptr<StreamInfo> MediaHandlerTestBase::GetVideoStreamInfo(
|
2021-08-04 18:56:44 +00:00
|
|
|
int32_t time_scale,
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
Codec codec,
|
2017-09-12 17:24:24 +00:00
|
|
|
uint32_t width,
|
2022-11-04 22:46:41 +00:00
|
|
|
uint32_t height) const {
|
2017-09-12 17:24:24 +00:00
|
|
|
return std::unique_ptr<VideoStreamInfo>(new VideoStreamInfo(
|
|
|
|
kTrackId, time_scale, kDuration, codec, H26xStreamFormat::kUnSpecified,
|
|
|
|
kCodecString, kCodecConfig, sizeof(kCodecConfig), width, height,
|
2019-09-23 06:24:33 +00:00
|
|
|
kPixelWidth, kPixelHeight, kTransferCharacteristics, kTrickPlayFactor,
|
|
|
|
kNaluLengthSize, kLanguage, !kEncrypted));
|
2017-09-12 17:24:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
std::unique_ptr<StreamInfo> MediaHandlerTestBase::GetAudioStreamInfo(
|
2021-08-04 18:56:44 +00:00
|
|
|
int32_t time_scale) const {
|
2017-09-12 17:24:24 +00:00
|
|
|
return GetAudioStreamInfo(time_scale, kCodecAAC);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::unique_ptr<StreamInfo> MediaHandlerTestBase::GetAudioStreamInfo(
|
2021-08-04 18:56:44 +00:00
|
|
|
int32_t time_scale,
|
2017-09-12 17:24:24 +00:00
|
|
|
Codec codec) const {
|
|
|
|
return std::unique_ptr<AudioStreamInfo>(new AudioStreamInfo(
|
|
|
|
kTrackId, time_scale, kDuration, codec, kCodecString, kCodecConfig,
|
|
|
|
sizeof(kCodecConfig), kSampleBits, kNumChannels, kSamplingFrequency,
|
|
|
|
kSeekPrerollNs, kCodecDelayNs, kMaxBitrate, kAvgBitrate, kLanguage,
|
|
|
|
!kEncrypted));
|
|
|
|
}
|
|
|
|
|
2017-09-18 23:31:00 +00:00
|
|
|
std::shared_ptr<MediaSample> MediaHandlerTestBase::GetMediaSample(
|
2017-09-12 17:24:24 +00:00
|
|
|
int64_t timestamp,
|
|
|
|
int64_t duration,
|
|
|
|
bool is_keyframe) const {
|
|
|
|
return GetMediaSample(timestamp, duration, is_keyframe, kData, sizeof(kData));
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
}
|
|
|
|
|
2017-09-18 23:31:00 +00:00
|
|
|
std::shared_ptr<MediaSample> MediaHandlerTestBase::GetMediaSample(
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
int64_t timestamp,
|
|
|
|
int64_t duration,
|
2017-09-12 17:24:24 +00:00
|
|
|
bool is_keyframe,
|
|
|
|
const uint8_t* data,
|
|
|
|
size_t data_length) const {
|
2017-09-18 23:31:00 +00:00
|
|
|
std::shared_ptr<MediaSample> sample =
|
|
|
|
MediaSample::CopyFrom(data, data_length, nullptr, 0, is_keyframe);
|
2017-09-12 17:24:24 +00:00
|
|
|
sample->set_dts(timestamp);
|
2018-01-03 00:10:33 +00:00
|
|
|
sample->set_pts(timestamp);
|
2017-09-12 17:24:24 +00:00
|
|
|
sample->set_duration(duration);
|
|
|
|
|
|
|
|
return sample;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::unique_ptr<SegmentInfo> MediaHandlerTestBase::GetSegmentInfo(
|
2017-03-11 02:48:04 +00:00
|
|
|
int64_t start_timestamp,
|
|
|
|
int64_t duration,
|
2017-09-12 17:24:24 +00:00
|
|
|
bool is_subsegment) const {
|
|
|
|
std::unique_ptr<SegmentInfo> info(new SegmentInfo);
|
|
|
|
info->start_timestamp = start_timestamp;
|
|
|
|
info->duration = duration;
|
|
|
|
info->is_subsegment = is_subsegment;
|
|
|
|
|
|
|
|
return info;
|
2017-03-11 02:48:04 +00:00
|
|
|
}
|
|
|
|
|
2018-06-06 18:41:21 +00:00
|
|
|
std::unique_ptr<StreamInfo> MediaHandlerTestBase::GetTextStreamInfo(
|
2021-08-04 18:56:44 +00:00
|
|
|
int32_t timescale) const {
|
2017-09-18 15:47:00 +00:00
|
|
|
// None of this information is actually used by the text out handler.
|
|
|
|
// The stream info is just needed to signal the start of the stream.
|
|
|
|
return std::unique_ptr<StreamInfo>(
|
2018-06-06 18:41:21 +00:00
|
|
|
new TextStreamInfo(0, timescale, 0, kUnknownCodec, "", "", 0, 0, ""));
|
2017-09-18 15:47:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
std::unique_ptr<TextSample> MediaHandlerTestBase::GetTextSample(
|
|
|
|
const std::string& id,
|
2018-03-26 18:04:09 +00:00
|
|
|
int64_t start,
|
|
|
|
int64_t end,
|
2017-09-18 15:47:00 +00:00
|
|
|
const std::string& payload) const {
|
2020-08-24 22:23:15 +00:00
|
|
|
return std::unique_ptr<TextSample>{
|
2020-08-26 20:47:14 +00:00
|
|
|
new TextSample(id, start, end, {}, TextFragment{{}, payload})};
|
2017-09-18 15:47:00 +00:00
|
|
|
}
|
2017-09-26 16:00:33 +00:00
|
|
|
|
2018-03-26 18:04:09 +00:00
|
|
|
std::unique_ptr<CueEvent> MediaHandlerTestBase::GetCueEvent(
|
|
|
|
double time_in_seconds) const {
|
|
|
|
std::unique_ptr<CueEvent> event(new CueEvent);
|
|
|
|
event->time_in_seconds = time_in_seconds;
|
|
|
|
|
|
|
|
return event;
|
|
|
|
}
|
|
|
|
|
2017-09-26 16:00:33 +00:00
|
|
|
Status MediaHandlerTestBase::SetUpAndInitializeGraph(
|
|
|
|
std::shared_ptr<MediaHandler> handler,
|
|
|
|
size_t input_count,
|
|
|
|
size_t output_count) {
|
|
|
|
DCHECK(handler);
|
|
|
|
DCHECK_EQ(nullptr, handler_);
|
|
|
|
DCHECK(inputs_.empty());
|
|
|
|
DCHECK(outputs_.empty());
|
|
|
|
|
|
|
|
handler_ = std::move(handler);
|
|
|
|
|
|
|
|
Status status;
|
|
|
|
|
|
|
|
// Add and connect all the requested inputs.
|
|
|
|
for (size_t i = 0; i < input_count; i++) {
|
|
|
|
inputs_.emplace_back(new FakeInputMediaHandler);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (auto& input : inputs_) {
|
|
|
|
status.Update(input->AddHandler(handler_));
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!status.ok()) {
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Add and connect all the requested outputs.
|
|
|
|
for (size_t i = 0; i < output_count; i++) {
|
2017-09-18 15:43:21 +00:00
|
|
|
outputs_.emplace_back(new testing::NiceMock<MockOutputMediaHandler>);
|
2017-09-26 16:00:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
for (auto& output : outputs_) {
|
|
|
|
status.Update(handler_->AddHandler(output));
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!status.ok()) {
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Initialize the graph.
|
|
|
|
for (auto& input : inputs_) {
|
|
|
|
status.Update(input->Initialize());
|
|
|
|
}
|
|
|
|
|
|
|
|
// In the case that there are no inputs, the start of the graph
|
|
|
|
// is at |handler_| so it needs to be initialized or else the graph
|
|
|
|
// won't be initialized.
|
|
|
|
if (inputs_.empty()) {
|
|
|
|
status.Update(handler_->Initialize());
|
|
|
|
}
|
|
|
|
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
|
|
|
FakeInputMediaHandler* MediaHandlerTestBase::Input(size_t index) {
|
|
|
|
DCHECK_LT(index, inputs_.size());
|
|
|
|
return inputs_[index].get();
|
|
|
|
}
|
|
|
|
|
|
|
|
MockOutputMediaHandler* MediaHandlerTestBase::Output(size_t index) {
|
|
|
|
DCHECK_LT(index, outputs_.size());
|
|
|
|
return outputs_[index].get();
|
|
|
|
}
|
|
|
|
|
2017-09-14 16:23:29 +00:00
|
|
|
MediaHandlerGraphTestBase::MediaHandlerGraphTestBase()
|
2018-06-20 23:13:15 +00:00
|
|
|
: next_handler_(new CachingMediaHandler),
|
|
|
|
some_handler_(new CachingMediaHandler) {}
|
2017-09-14 16:23:29 +00:00
|
|
|
|
2017-09-18 15:47:00 +00:00
|
|
|
void MediaHandlerGraphTestBase::SetUpGraph(
|
|
|
|
size_t num_inputs,
|
|
|
|
size_t num_outputs,
|
|
|
|
std::shared_ptr<MediaHandler> handler) {
|
2018-06-20 23:13:15 +00:00
|
|
|
// Input handler is not really used anywhere else except to validate number of
|
|
|
|
// allowed inputs for the handler to be tested.
|
|
|
|
auto input_handler = std::make_shared<CachingMediaHandler>();
|
2017-03-28 06:04:29 +00:00
|
|
|
for (size_t i = 0; i < num_inputs; ++i)
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
ASSERT_OK(input_handler->SetHandler(i, handler));
|
|
|
|
// All outputs are routed to |next_handler_|.
|
2017-03-28 06:04:29 +00:00
|
|
|
for (size_t i = 0; i < num_outputs; ++i)
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
ASSERT_OK(handler->SetHandler(i, next_handler_));
|
|
|
|
}
|
|
|
|
|
|
|
|
const std::vector<std::unique_ptr<StreamData>>&
|
2017-09-14 16:23:29 +00:00
|
|
|
MediaHandlerGraphTestBase::GetOutputStreamDataVector() const {
|
2018-06-20 23:13:15 +00:00
|
|
|
return next_handler_->Cache();
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
}
|
|
|
|
|
2017-09-14 16:23:29 +00:00
|
|
|
void MediaHandlerGraphTestBase::ClearOutputStreamDataVector() {
|
2018-06-20 23:13:15 +00:00
|
|
|
next_handler_->Clear();
|
Implement ChunkingHandler
This handler is a multi-in multi-out handler. If more than one input is
provided, there should be one and only one video stream; also, all inputs
should come from the same thread and are synchronized.
There can be multiple chunking handler running in different threads or even
different processes, we use the "consistent chunking algorithm" to make sure
the chunks in different streams are aligned without explicit communcating
with each other - which is not efficient and often difficult.
Consistent Chunking Algorithm:
1. Find the consistent chunkable boundary
Let the timestamps for video frames be (t1, t2, t3, ...). Then a
consistent chunkable boundary is simply the first chunkable boundary after
(tk / N) != (tk-1 / N), where '/' denotes integer division, and N is the
intended chunk duration.
2. Chunk only at the consistent chunkable boundary
This algorithm will make sure the chunks from different video streams are
aligned if they have aligned GoPs. However, this algorithm will only work
for video streams. To be able to chunk non video streams at similar
positions as video streams, ChunkingHandler is designed to accept one video
input and multiple non video inputs, the non video inputs are chunked when
the video input is chunked. If the inputs are synchronized - which is true
if the inputs come from the same demuxer, the video and non video chunks
are aligned.
Change-Id: Id3bad51ab14f311efdb8713b6cd36d36cf9e4639
2017-02-07 18:58:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace media
|
|
|
|
} // namespace shaka
|