1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357
|
/*****************************************************************************
* Copyright (C) 2013-2017 MulticoreWare, Inc
*
* Authors: liwei <liwei@multicorewareinc.com>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111, USA.
*
* This program is also available under a commercial proprietary license.
* For more information, contact us at license @ x265.com
*****************************************************************************/
#include "ringmem.h"
#ifndef _WIN32
#include <sys/mman.h>
#endif ////< _WIN32
#ifdef _WIN32
#define X265_SHARED_MEM_NAME "Local\\_x265_shr_mem_"
#define X265_SEMAPHORE_RINGMEM_WRITER_NAME "_x265_semW_"
#define X265_SEMAPHORE_RINGMEM_READER_NAME "_x265_semR_"
#else /* POSIX / pthreads */
#define X265_SHARED_MEM_NAME "/tmp/_x265_shr_mem_"
#define X265_SEMAPHORE_RINGMEM_WRITER_NAME "/tmp/_x265_semW_"
#define X265_SEMAPHORE_RINGMEM_READER_NAME "/tmp/_x265_semR_"
#endif
#define RINGMEM_ALLIGNMENT 64
namespace X265_NS {
RingMem::RingMem()
: m_initialized(false)
, m_protectRW(false)
, m_itemSize(0)
, m_itemCnt(0)
, m_dataPool(NULL)
, m_shrMem(NULL)
#ifdef _WIN32
, m_handle(NULL)
#else //_WIN32
, m_filepath(NULL)
#endif //_WIN32
, m_writeSem(NULL)
, m_readSem(NULL)
{
}
RingMem::~RingMem()
{
}
bool RingMem::skipRead(int32_t cnt) {
if (!m_initialized)
{
return false;
}
if (m_protectRW)
{
for (int i = 0; i < cnt; i++)
{
m_readSem->take();
}
}
ATOMIC_ADD(&m_shrMem->m_read, cnt);
if (m_protectRW)
{
m_writeSem->give(cnt);
}
return true;
}
bool RingMem::skipWrite(int32_t cnt) {
if (!m_initialized)
{
return false;
}
if (m_protectRW)
{
for (int i = 0; i < cnt; i++)
{
m_writeSem->take();
}
}
ATOMIC_ADD(&m_shrMem->m_write, cnt);
if (m_protectRW)
{
m_readSem->give(cnt);
}
return true;
}
///< initialize
bool RingMem::init(int32_t itemSize, int32_t itemCnt, const char *name, bool protectRW)
{
///< check parameters
if (itemSize <= 0 || itemCnt <= 0 || NULL == name)
{
///< invalid parameters
return false;
}
if (!m_initialized)
{
///< formating names
char nameBuf[MAX_SHR_NAME_LEN] = { 0 };
///< shared memory name
snprintf(nameBuf, sizeof(nameBuf) - 1, "%s%s", X265_SHARED_MEM_NAME, name);
///< create or open shared memory
bool newCreated = false;
///< calculate the size of the shared memory
int32_t shrMemSize = (itemSize * itemCnt + sizeof(ShrMemCtrl) + RINGMEM_ALLIGNMENT - 1) & ~(RINGMEM_ALLIGNMENT - 1);
#ifdef _WIN32
HANDLE h = OpenFileMappingA(FILE_MAP_WRITE | FILE_MAP_READ, FALSE, nameBuf);
if (!h)
{
h = CreateFileMappingA(INVALID_HANDLE_VALUE, NULL, PAGE_READWRITE, 0, shrMemSize, nameBuf);
if (!h)
{
return false;
}
newCreated = true;
}
void *pool = MapViewOfFile(h, FILE_MAP_ALL_ACCESS, 0, 0, 0);
///< should not close the handle here, otherwise the OpenFileMapping would fail
//CloseHandle(h);
m_handle = h;
if (!pool)
{
return false;
}
#else /* POSIX / pthreads */
mode_t mode = S_IRUSR | S_IWUSR | S_IRGRP | S_IWGRP | S_IROTH | S_IWOTH;
int flag = O_RDWR;
int shrfd = -1;
if ((shrfd = open(nameBuf, flag, mode)) < 0)
{
flag |= O_CREAT;
shrfd = open(nameBuf, flag, mode);
if (shrfd < 0)
{
return false;
}
newCreated = true;
lseek(shrfd, shrMemSize - 1, SEEK_SET);
if (-1 == write(shrfd, "\0", 1))
{
close(shrfd);
return false;
}
if (lseek(shrfd, 0, SEEK_END) < shrMemSize)
{
close(shrfd);
return false;
}
}
void *pool = mmap(0,
shrMemSize,
PROT_READ | PROT_WRITE,
MAP_SHARED,
shrfd,
0);
close(shrfd);
if (pool == MAP_FAILED)
{
return false;
}
m_filepath = strdup(nameBuf);
#endif ///< _WIN32
if (newCreated)
{
memset(pool, 0, shrMemSize);
}
m_shrMem = reinterpret_cast<ShrMemCtrl *>(pool);
m_dataPool = reinterpret_cast<uint8_t *>(pool) + sizeof(ShrMemCtrl);
m_itemSize = itemSize;
m_itemCnt = itemCnt;
m_initialized = true;
if (protectRW)
{
m_protectRW = true;
m_writeSem = new NamedSemaphore();
if (!m_writeSem)
{
release();
return false;
}
///< shared memory name
snprintf(nameBuf, sizeof(nameBuf) - 1, "%s%s", X265_SEMAPHORE_RINGMEM_WRITER_NAME, name);
if (!m_writeSem->create(nameBuf, m_itemCnt, m_itemCnt))
{
release();
return false;
}
m_readSem = new NamedSemaphore();
if (!m_readSem)
{
release();
return false;
}
///< shared memory name
snprintf(nameBuf, sizeof(nameBuf) - 1, "%s%s", X265_SEMAPHORE_RINGMEM_READER_NAME, name);
if (!m_readSem->create(nameBuf, 0, m_itemCnt))
{
release();
return false;
}
}
}
return true;
}
///< finalize
void RingMem::release()
{
if (m_initialized)
{
m_initialized = false;
if (m_shrMem)
{
#ifdef _WIN32
UnmapViewOfFile(m_shrMem);
CloseHandle(m_handle);
m_handle = NULL;
#else /* POSIX / pthreads */
int32_t shrMemSize = (m_itemSize * m_itemCnt + sizeof(ShrMemCtrl) + RINGMEM_ALLIGNMENT - 1) & (~RINGMEM_ALLIGNMENT - 1);
munmap(m_shrMem, shrMemSize);
unlink(m_filepath);
free(m_filepath);
m_filepath = NULL;
#endif ///< _WIN32
m_shrMem = NULL;
m_dataPool = NULL;
m_itemSize = 0;
m_itemCnt = 0;
}
if (m_protectRW)
{
m_protectRW = false;
if (m_writeSem)
{
m_writeSem->release();
delete m_writeSem;
m_writeSem = NULL;
}
if (m_readSem)
{
m_readSem->release();
delete m_readSem;
m_readSem = NULL;
}
}
}
}
///< data read
bool RingMem::readNext(void* dst, fnRWSharedData callback)
{
if (!m_initialized || !callback || !dst)
{
return false;
}
if (m_protectRW)
{
if (!m_readSem->take())
{
return false;
}
}
int32_t index = ATOMIC_ADD(&m_shrMem->m_read, 1) % m_itemCnt;
(*callback)(dst, reinterpret_cast<uint8_t *>(m_dataPool) + index * m_itemSize, m_itemSize);
if (m_protectRW)
{
m_writeSem->give(1);
}
return true;
}
///< data write
bool RingMem::writeData(void *data, fnRWSharedData callback)
{
if (!m_initialized || !data || !callback)
{
return false;
}
if (m_protectRW)
{
if (!m_writeSem->take())
{
return false;
}
}
int32_t index = ATOMIC_ADD(&m_shrMem->m_write, 1) % m_itemCnt;
(*callback)(reinterpret_cast<uint8_t *>(m_dataPool) + index * m_itemSize, data, m_itemSize);
if (m_protectRW)
{
m_readSem->give(1);
}
return true;
}
}
|