2016-09-05 12:00:04 -07:00
|
|
|
/*----------------------------------------------------------------------------*/
|
|
|
|
|
/* Copyright (c) FIRST 2016. All Rights Reserved. */
|
|
|
|
|
/* Open Source Software - may be modified and shared by FRC teams. The code */
|
|
|
|
|
/* must be accompanied by the FIRST BSD license file in the root directory of */
|
|
|
|
|
/* the project. */
|
|
|
|
|
/*----------------------------------------------------------------------------*/
|
|
|
|
|
|
|
|
|
|
#include "SourceImpl.h"
|
|
|
|
|
|
2016-10-13 00:16:24 -07:00
|
|
|
#include <algorithm>
|
|
|
|
|
#include <cstring>
|
|
|
|
|
|
|
|
|
|
#include "Log.h"
|
2016-09-05 12:00:04 -07:00
|
|
|
|
|
|
|
|
using namespace cs;
|
|
|
|
|
|
2016-10-13 00:16:24 -07:00
|
|
|
static constexpr std::size_t kMaxFramesAvail = 32;
|
|
|
|
|
|
2016-09-05 12:00:04 -07:00
|
|
|
SourceImpl::SourceImpl(llvm::StringRef name)
|
|
|
|
|
: m_name{name}, m_frame{*this, nullptr} {}
|
|
|
|
|
|
|
|
|
|
SourceImpl::~SourceImpl() {
|
|
|
|
|
// Wake up anyone who is waiting. This also clears the current frame,
|
|
|
|
|
// which is good because its destructor will call back into the class.
|
|
|
|
|
Wakeup();
|
2016-10-13 00:16:24 -07:00
|
|
|
// Set a flag so ReleaseFrame() doesn't re-add them to m_framesAvail.
|
|
|
|
|
// Put in a block so we destroy before the destructor ends.
|
|
|
|
|
{
|
|
|
|
|
m_destroyFrames = true;
|
|
|
|
|
auto frames = std::move(m_framesAvail);
|
|
|
|
|
}
|
2016-09-05 12:00:04 -07:00
|
|
|
// Everything else can clean up itself.
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Frame SourceImpl::GetNextFrame() {
|
|
|
|
|
std::unique_lock<std::mutex> lock{m_frameMutex};
|
|
|
|
|
// TODO: handle spurious wakeup by comparing frame timestamps
|
2016-09-08 23:52:23 -07:00
|
|
|
m_frameCv.wait(lock);
|
2016-09-05 12:00:04 -07:00
|
|
|
return m_frame;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void SourceImpl::Wakeup() {
|
|
|
|
|
{
|
|
|
|
|
std::lock_guard<std::mutex> lock{m_frameMutex};
|
|
|
|
|
m_frame = Frame{*this, nullptr};
|
|
|
|
|
}
|
2016-09-08 23:52:23 -07:00
|
|
|
m_frameCv.notify_all();
|
2016-09-05 12:00:04 -07:00
|
|
|
}
|
|
|
|
|
|
2016-09-29 00:04:16 -07:00
|
|
|
bool SourceImpl::SetPixelFormat(VideoMode::PixelFormat pixelFormat,
|
|
|
|
|
CS_Status* status) {
|
|
|
|
|
auto mode = GetVideoMode(status);
|
|
|
|
|
if (!mode) return false;
|
|
|
|
|
mode.pixelFormat = pixelFormat;
|
|
|
|
|
return SetVideoMode(mode, status);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool SourceImpl::SetResolution(int width, int height, CS_Status* status) {
|
|
|
|
|
auto mode = GetVideoMode(status);
|
|
|
|
|
if (!mode) return false;
|
|
|
|
|
mode.width = width;
|
|
|
|
|
mode.height = height;
|
|
|
|
|
return SetVideoMode(mode, status);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool SourceImpl::SetFPS(int fps, CS_Status* status) {
|
|
|
|
|
auto mode = GetVideoMode(status);
|
|
|
|
|
if (!mode) return false;
|
|
|
|
|
mode.fps = fps;
|
|
|
|
|
return SetVideoMode(mode, status);
|
|
|
|
|
}
|
|
|
|
|
|
2016-10-13 00:16:24 -07:00
|
|
|
void SourceImpl::PutFrame(VideoMode::PixelFormat pixelFormat,
|
|
|
|
|
llvm::StringRef data, Frame::Time time) {
|
|
|
|
|
std::unique_ptr<Frame::Data> frameData;
|
|
|
|
|
{
|
|
|
|
|
std::lock_guard<std::mutex> lock{m_mutex};
|
|
|
|
|
// find the smallest existing frame that is at least big enough.
|
|
|
|
|
int found = -1;
|
|
|
|
|
for (std::size_t i = 0; i < m_framesAvail.size(); ++i) {
|
|
|
|
|
// is it big enough?
|
|
|
|
|
if (m_framesAvail[i] && m_framesAvail[i]->capacity >= data.size()) {
|
|
|
|
|
// is it smaller than the last found?
|
|
|
|
|
if (found < 0 ||
|
|
|
|
|
m_framesAvail[i]->capacity < m_framesAvail[found]->capacity) {
|
|
|
|
|
// yes, update
|
|
|
|
|
found = i;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// if nothing found, allocate a new buffer
|
|
|
|
|
if (found < 0)
|
|
|
|
|
frameData.reset(new Frame::Data{data.size()});
|
|
|
|
|
else
|
|
|
|
|
frameData = std::move(m_framesAvail[found]);
|
2016-09-05 12:00:04 -07:00
|
|
|
}
|
|
|
|
|
|
2016-10-13 00:16:24 -07:00
|
|
|
// Initialize frame data
|
|
|
|
|
frameData->refcount = 0;
|
|
|
|
|
frameData->time = time;
|
|
|
|
|
frameData->size = data.size();
|
|
|
|
|
frameData->pixelFormat = pixelFormat;
|
|
|
|
|
|
|
|
|
|
// Copy in image data
|
|
|
|
|
DEBUG4("Copying data to " << ((void*)frameData->data) << " from "
|
|
|
|
|
<< ((void*)data.data()) << " (" << data.size()
|
|
|
|
|
<< " bytes)");
|
|
|
|
|
std::memcpy(frameData->data, data.data(), data.size());
|
2016-09-05 12:00:04 -07:00
|
|
|
|
2016-10-13 00:16:24 -07:00
|
|
|
// Update frame
|
2016-09-05 12:00:04 -07:00
|
|
|
{
|
2016-10-13 00:16:24 -07:00
|
|
|
std::lock_guard<std::mutex> lock{m_frameMutex};
|
|
|
|
|
m_frame = Frame{*this, std::move(frameData)};
|
2016-09-05 12:00:04 -07:00
|
|
|
}
|
2016-10-13 00:16:24 -07:00
|
|
|
|
|
|
|
|
// Signal listeners
|
2016-09-08 23:52:23 -07:00
|
|
|
m_frameCv.notify_all();
|
2016-09-05 12:00:04 -07:00
|
|
|
}
|
|
|
|
|
|
2016-10-13 00:16:24 -07:00
|
|
|
void SourceImpl::ReleaseFrame(std::unique_ptr<Frame::Data> data) {
|
2016-09-05 12:00:04 -07:00
|
|
|
std::lock_guard<std::mutex> lock{m_mutex};
|
2016-10-13 00:16:24 -07:00
|
|
|
if (m_destroyFrames) return;
|
|
|
|
|
// Return the frame to the pool. First try to find an empty slot, otherwise
|
|
|
|
|
// add it to the end.
|
|
|
|
|
auto it = std::find(m_framesAvail.begin(), m_framesAvail.end(), nullptr);
|
|
|
|
|
if (it != m_framesAvail.end())
|
|
|
|
|
(*it) = std::move(data);
|
|
|
|
|
else if (m_framesAvail.size() > kMaxFramesAvail) {
|
|
|
|
|
// Replace smallest buffer; don't need to check for null because the above
|
|
|
|
|
// find would have found it.
|
|
|
|
|
auto it2 = std::min_element(m_framesAvail.begin(), m_framesAvail.end(),
|
|
|
|
|
[](const std::unique_ptr<Frame::Data>& a,
|
|
|
|
|
const std::unique_ptr<Frame::Data>& b) {
|
|
|
|
|
return a->capacity < b->capacity;
|
|
|
|
|
});
|
|
|
|
|
if ((*it2)->capacity < data->capacity)
|
|
|
|
|
*it2 = std::move(data);
|
|
|
|
|
} else
|
|
|
|
|
m_framesAvail.emplace_back(std::move(data));
|
2016-09-05 12:00:04 -07:00
|
|
|
}
|