|
|
|
|
@ -108,6 +108,7 @@ int64_t srs_get_system_time_ms()
|
|
|
|
|
|
|
|
|
|
return _srs_system_time_us_cache / 1000;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int64_t srs_get_system_startup_time_ms()
|
|
|
|
|
{
|
|
|
|
|
if (_srs_system_time_startup_time <= 0) {
|
|
|
|
|
@ -116,6 +117,7 @@ int64_t srs_get_system_startup_time_ms()
|
|
|
|
|
|
|
|
|
|
return _srs_system_time_startup_time / 1000;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int64_t srs_update_system_time_ms()
|
|
|
|
|
{
|
|
|
|
|
timeval now;
|
|
|
|
|
@ -515,6 +517,7 @@ int srs_do_create_dir_recursively(string dir)
|
|
|
|
|
srs_error("create dir %s failed. ret=%d", dir.c_str(), ret);
|
|
|
|
|
return ret;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
srs_info("create dir %s success.", dir.c_str());
|
|
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
|
@ -546,7 +549,7 @@ int srs_do_create_dir_recursively(string dir)
|
|
|
|
|
{
|
|
|
|
|
int ret = srs_do_create_dir_recursively(dir);
|
|
|
|
|
|
|
|
|
|
if (ret == ERROR_SYSTEM_DIR_EXISTS) {
|
|
|
|
|
if (ret == ERROR_SYSTEM_DIR_EXISTS || ret == ERROR_SUCCESS) {
|
|
|
|
|
return srs_success;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
@ -666,379 +669,274 @@ int srs_do_create_dir_recursively(string dir)
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// @see http://www.stmc.edu.hk/~vincent/ffmpeg_0.4.9-pre1/libavformat/mpegtsenc.c
|
|
|
|
|
unsigned int __mpegts_crc32(const uint8_t *data, int len)
|
|
|
|
|
// @see pycrc reflect at https://github.com/winlinvip/pycrc/blob/master/pycrc/algorithms.py#L107
|
|
|
|
|
uint64_t __crc32_reflect(uint64_t data, int width)
|
|
|
|
|
{
|
|
|
|
|
/*
|
|
|
|
|
* MPEG2 transport stream (aka DVB) mux
|
|
|
|
|
* Copyright (c) 2003 Fabrice Bellard.
|
|
|
|
|
*
|
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
|
* version 2 of the License, or (at your option) any later version.
|
|
|
|
|
*
|
|
|
|
|
* This library 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
|
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
|
*
|
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
|
* License along with this library; if not, write to the Free Software
|
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
|
*/
|
|
|
|
|
static const uint32_t table[256] = {
|
|
|
|
|
0x00000000, 0x04c11db7, 0x09823b6e, 0x0d4326d9, 0x130476dc, 0x17c56b6b,
|
|
|
|
|
0x1a864db2, 0x1e475005, 0x2608edb8, 0x22c9f00f, 0x2f8ad6d6, 0x2b4bcb61,
|
|
|
|
|
0x350c9b64, 0x31cd86d3, 0x3c8ea00a, 0x384fbdbd, 0x4c11db70, 0x48d0c6c7,
|
|
|
|
|
0x4593e01e, 0x4152fda9, 0x5f15adac, 0x5bd4b01b, 0x569796c2, 0x52568b75,
|
|
|
|
|
0x6a1936c8, 0x6ed82b7f, 0x639b0da6, 0x675a1011, 0x791d4014, 0x7ddc5da3,
|
|
|
|
|
0x709f7b7a, 0x745e66cd, 0x9823b6e0, 0x9ce2ab57, 0x91a18d8e, 0x95609039,
|
|
|
|
|
0x8b27c03c, 0x8fe6dd8b, 0x82a5fb52, 0x8664e6e5, 0xbe2b5b58, 0xbaea46ef,
|
|
|
|
|
0xb7a96036, 0xb3687d81, 0xad2f2d84, 0xa9ee3033, 0xa4ad16ea, 0xa06c0b5d,
|
|
|
|
|
0xd4326d90, 0xd0f37027, 0xddb056fe, 0xd9714b49, 0xc7361b4c, 0xc3f706fb,
|
|
|
|
|
0xceb42022, 0xca753d95, 0xf23a8028, 0xf6fb9d9f, 0xfbb8bb46, 0xff79a6f1,
|
|
|
|
|
0xe13ef6f4, 0xe5ffeb43, 0xe8bccd9a, 0xec7dd02d, 0x34867077, 0x30476dc0,
|
|
|
|
|
0x3d044b19, 0x39c556ae, 0x278206ab, 0x23431b1c, 0x2e003dc5, 0x2ac12072,
|
|
|
|
|
0x128e9dcf, 0x164f8078, 0x1b0ca6a1, 0x1fcdbb16, 0x018aeb13, 0x054bf6a4,
|
|
|
|
|
0x0808d07d, 0x0cc9cdca, 0x7897ab07, 0x7c56b6b0, 0x71159069, 0x75d48dde,
|
|
|
|
|
0x6b93dddb, 0x6f52c06c, 0x6211e6b5, 0x66d0fb02, 0x5e9f46bf, 0x5a5e5b08,
|
|
|
|
|
0x571d7dd1, 0x53dc6066, 0x4d9b3063, 0x495a2dd4, 0x44190b0d, 0x40d816ba,
|
|
|
|
|
0xaca5c697, 0xa864db20, 0xa527fdf9, 0xa1e6e04e, 0xbfa1b04b, 0xbb60adfc,
|
|
|
|
|
0xb6238b25, 0xb2e29692, 0x8aad2b2f, 0x8e6c3698, 0x832f1041, 0x87ee0df6,
|
|
|
|
|
0x99a95df3, 0x9d684044, 0x902b669d, 0x94ea7b2a, 0xe0b41de7, 0xe4750050,
|
|
|
|
|
0xe9362689, 0xedf73b3e, 0xf3b06b3b, 0xf771768c, 0xfa325055, 0xfef34de2,
|
|
|
|
|
0xc6bcf05f, 0xc27dede8, 0xcf3ecb31, 0xcbffd686, 0xd5b88683, 0xd1799b34,
|
|
|
|
|
0xdc3abded, 0xd8fba05a, 0x690ce0ee, 0x6dcdfd59, 0x608edb80, 0x644fc637,
|
|
|
|
|
0x7a089632, 0x7ec98b85, 0x738aad5c, 0x774bb0eb, 0x4f040d56, 0x4bc510e1,
|
|
|
|
|
0x46863638, 0x42472b8f, 0x5c007b8a, 0x58c1663d, 0x558240e4, 0x51435d53,
|
|
|
|
|
0x251d3b9e, 0x21dc2629, 0x2c9f00f0, 0x285e1d47, 0x36194d42, 0x32d850f5,
|
|
|
|
|
0x3f9b762c, 0x3b5a6b9b, 0x0315d626, 0x07d4cb91, 0x0a97ed48, 0x0e56f0ff,
|
|
|
|
|
0x1011a0fa, 0x14d0bd4d, 0x19939b94, 0x1d528623, 0xf12f560e, 0xf5ee4bb9,
|
|
|
|
|
0xf8ad6d60, 0xfc6c70d7, 0xe22b20d2, 0xe6ea3d65, 0xeba91bbc, 0xef68060b,
|
|
|
|
|
0xd727bbb6, 0xd3e6a601, 0xdea580d8, 0xda649d6f, 0xc423cd6a, 0xc0e2d0dd,
|
|
|
|
|
0xcda1f604, 0xc960ebb3, 0xbd3e8d7e, 0xb9ff90c9, 0xb4bcb610, 0xb07daba7,
|
|
|
|
|
0xae3afba2, 0xaafbe615, 0xa7b8c0cc, 0xa379dd7b, 0x9b3660c6, 0x9ff77d71,
|
|
|
|
|
0x92b45ba8, 0x9675461f, 0x8832161a, 0x8cf30bad, 0x81b02d74, 0x857130c3,
|
|
|
|
|
0x5d8a9099, 0x594b8d2e, 0x5408abf7, 0x50c9b640, 0x4e8ee645, 0x4a4ffbf2,
|
|
|
|
|
0x470cdd2b, 0x43cdc09c, 0x7b827d21, 0x7f436096, 0x7200464f, 0x76c15bf8,
|
|
|
|
|
0x68860bfd, 0x6c47164a, 0x61043093, 0x65c52d24, 0x119b4be9, 0x155a565e,
|
|
|
|
|
0x18197087, 0x1cd86d30, 0x029f3d35, 0x065e2082, 0x0b1d065b, 0x0fdc1bec,
|
|
|
|
|
0x3793a651, 0x3352bbe6, 0x3e119d3f, 0x3ad08088, 0x2497d08d, 0x2056cd3a,
|
|
|
|
|
0x2d15ebe3, 0x29d4f654, 0xc5a92679, 0xc1683bce, 0xcc2b1d17, 0xc8ea00a0,
|
|
|
|
|
0xd6ad50a5, 0xd26c4d12, 0xdf2f6bcb, 0xdbee767c, 0xe3a1cbc1, 0xe760d676,
|
|
|
|
|
0xea23f0af, 0xeee2ed18, 0xf0a5bd1d, 0xf464a0aa, 0xf9278673, 0xfde69bc4,
|
|
|
|
|
0x89b8fd09, 0x8d79e0be, 0x803ac667, 0x84fbdbd0, 0x9abc8bd5, 0x9e7d9662,
|
|
|
|
|
0x933eb0bb, 0x97ffad0c, 0xafb010b1, 0xab710d06, 0xa6322bdf, 0xa2f33668,
|
|
|
|
|
0xbcb4666d, 0xb8757bda, 0xb5365d03, 0xb1f740b4
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
uint32_t crc = 0xffffffff;
|
|
|
|
|
uint64_t res = data & 0x01;
|
|
|
|
|
|
|
|
|
|
for (int i=0; i<len; i++) {
|
|
|
|
|
crc = (crc << 8) ^ table[((crc >> 24) ^ *data++) & 0xff];
|
|
|
|
|
for (int i = 0; i < width - 1; i++) {
|
|
|
|
|
data >>= 1;
|
|
|
|
|
res = (res << 1) | (data & 0x01);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return crc;
|
|
|
|
|
return res;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// @see https://github.com/ETrun/crc32/blob/master/crc32.c
|
|
|
|
|
uint32_t __crc32_ieee(uint32_t init, const uint8_t* buf, size_t nb_buf)
|
|
|
|
|
// @see pycrc gen_table at https://github.com/winlinvip/pycrc/blob/master/pycrc/algorithms.py#L178
|
|
|
|
|
void __crc32_make_table(uint32_t t[256], uint32_t poly, bool reflect_in)
|
|
|
|
|
{
|
|
|
|
|
/*----------------------------------------------------------------------------*\
|
|
|
|
|
* CRC-32 version 2.0.0 by Craig Bruce, 2006-04-29.
|
|
|
|
|
*
|
|
|
|
|
* This program generates the CRC-32 values for the files named in the
|
|
|
|
|
* command-line arguments. These are the same CRC-32 values used by GZIP,
|
|
|
|
|
* PKZIP, and ZMODEM. The Crc32_ComputeBuf() can also be detached and
|
|
|
|
|
* used independently.
|
|
|
|
|
*
|
|
|
|
|
* THIS PROGRAM IS PUBLIC-DOMAIN SOFTWARE.
|
|
|
|
|
*
|
|
|
|
|
* Based on the byte-oriented implementation "File Verification Using CRC"
|
|
|
|
|
* by Mark R. Nelson in Dr. Dobb's Journal, May 1992, pp. 64-67.
|
|
|
|
|
*
|
|
|
|
|
* v1.0.0: original release.
|
|
|
|
|
* v1.0.1: fixed printf formats.
|
|
|
|
|
* v1.0.2: fixed something else.
|
|
|
|
|
* v1.0.3: replaced CRC constant table by generator function.
|
|
|
|
|
* v1.0.4: reformatted code, made ANSI C. 1994-12-05.
|
|
|
|
|
* v2.0.0: rewrote to use memory buffer & static table, 2006-04-29.
|
|
|
|
|
* v2.1.0: modified by Nico, 2013-04-20
|
|
|
|
|
\*----------------------------------------------------------------------------*/
|
|
|
|
|
static const uint32_t table[256] = {
|
|
|
|
|
0x00000000,0x77073096,0xEE0E612C,0x990951BA,0x076DC419,0x706AF48F,0xE963A535,
|
|
|
|
|
0x9E6495A3,0x0EDB8832,0x79DCB8A4,0xE0D5E91E,0x97D2D988,0x09B64C2B,0x7EB17CBD,
|
|
|
|
|
0xE7B82D07,0x90BF1D91,0x1DB71064,0x6AB020F2,0xF3B97148,0x84BE41DE,0x1ADAD47D,
|
|
|
|
|
0x6DDDE4EB,0xF4D4B551,0x83D385C7,0x136C9856,0x646BA8C0,0xFD62F97A,0x8A65C9EC,
|
|
|
|
|
0x14015C4F,0x63066CD9,0xFA0F3D63,0x8D080DF5,0x3B6E20C8,0x4C69105E,0xD56041E4,
|
|
|
|
|
0xA2677172,0x3C03E4D1,0x4B04D447,0xD20D85FD,0xA50AB56B,0x35B5A8FA,0x42B2986C,
|
|
|
|
|
0xDBBBC9D6,0xACBCF940,0x32D86CE3,0x45DF5C75,0xDCD60DCF,0xABD13D59,0x26D930AC,
|
|
|
|
|
0x51DE003A,0xC8D75180,0xBFD06116,0x21B4F4B5,0x56B3C423,0xCFBA9599,0xB8BDA50F,
|
|
|
|
|
0x2802B89E,0x5F058808,0xC60CD9B2,0xB10BE924,0x2F6F7C87,0x58684C11,0xC1611DAB,
|
|
|
|
|
0xB6662D3D,0x76DC4190,0x01DB7106,0x98D220BC,0xEFD5102A,0x71B18589,0x06B6B51F,
|
|
|
|
|
0x9FBFE4A5,0xE8B8D433,0x7807C9A2,0x0F00F934,0x9609A88E,0xE10E9818,0x7F6A0DBB,
|
|
|
|
|
0x086D3D2D,0x91646C97,0xE6635C01,0x6B6B51F4,0x1C6C6162,0x856530D8,0xF262004E,
|
|
|
|
|
0x6C0695ED,0x1B01A57B,0x8208F4C1,0xF50FC457,0x65B0D9C6,0x12B7E950,0x8BBEB8EA,
|
|
|
|
|
0xFCB9887C,0x62DD1DDF,0x15DA2D49,0x8CD37CF3,0xFBD44C65,0x4DB26158,0x3AB551CE,
|
|
|
|
|
0xA3BC0074,0xD4BB30E2,0x4ADFA541,0x3DD895D7,0xA4D1C46D,0xD3D6F4FB,0x4369E96A,
|
|
|
|
|
0x346ED9FC,0xAD678846,0xDA60B8D0,0x44042D73,0x33031DE5,0xAA0A4C5F,0xDD0D7CC9,
|
|
|
|
|
0x5005713C,0x270241AA,0xBE0B1010,0xC90C2086,0x5768B525,0x206F85B3,0xB966D409,
|
|
|
|
|
0xCE61E49F,0x5EDEF90E,0x29D9C998,0xB0D09822,0xC7D7A8B4,0x59B33D17,0x2EB40D81,
|
|
|
|
|
0xB7BD5C3B,0xC0BA6CAD,0xEDB88320,0x9ABFB3B6,0x03B6E20C,0x74B1D29A,0xEAD54739,
|
|
|
|
|
0x9DD277AF,0x04DB2615,0x73DC1683,0xE3630B12,0x94643B84,0x0D6D6A3E,0x7A6A5AA8,
|
|
|
|
|
0xE40ECF0B,0x9309FF9D,0x0A00AE27,0x7D079EB1,0xF00F9344,0x8708A3D2,0x1E01F268,
|
|
|
|
|
0x6906C2FE,0xF762575D,0x806567CB,0x196C3671,0x6E6B06E7,0xFED41B76,0x89D32BE0,
|
|
|
|
|
0x10DA7A5A,0x67DD4ACC,0xF9B9DF6F,0x8EBEEFF9,0x17B7BE43,0x60B08ED5,0xD6D6A3E8,
|
|
|
|
|
0xA1D1937E,0x38D8C2C4,0x4FDFF252,0xD1BB67F1,0xA6BC5767,0x3FB506DD,0x48B2364B,
|
|
|
|
|
0xD80D2BDA,0xAF0A1B4C,0x36034AF6,0x41047A60,0xDF60EFC3,0xA867DF55,0x316E8EEF,
|
|
|
|
|
0x4669BE79,0xCB61B38C,0xBC66831A,0x256FD2A0,0x5268E236,0xCC0C7795,0xBB0B4703,
|
|
|
|
|
0x220216B9,0x5505262F,0xC5BA3BBE,0xB2BD0B28,0x2BB45A92,0x5CB36A04,0xC2D7FFA7,
|
|
|
|
|
0xB5D0CF31,0x2CD99E8B,0x5BDEAE1D,0x9B64C2B0,0xEC63F226,0x756AA39C,0x026D930A,
|
|
|
|
|
0x9C0906A9,0xEB0E363F,0x72076785,0x05005713,0x95BF4A82,0xE2B87A14,0x7BB12BAE,
|
|
|
|
|
0x0CB61B38,0x92D28E9B,0xE5D5BE0D,0x7CDCEFB7,0x0BDBDF21,0x86D3D2D4,0xF1D4E242,
|
|
|
|
|
0x68DDB3F8,0x1FDA836E,0x81BE16CD,0xF6B9265B,0x6FB077E1,0x18B74777,0x88085AE6,
|
|
|
|
|
0xFF0F6A70,0x66063BCA,0x11010B5C,0x8F659EFF,0xF862AE69,0x616BFFD3,0x166CCF45,
|
|
|
|
|
0xA00AE278,0xD70DD2EE,0x4E048354,0x3903B3C2,0xA7672661,0xD06016F7,0x4969474D,
|
|
|
|
|
0x3E6E77DB,0xAED16A4A,0xD9D65ADC,0x40DF0B66,0x37D83BF0,0xA9BCAE53,0xDEBB9EC5,
|
|
|
|
|
0x47B2CF7F,0x30B5FFE9,0xBDBDF21C,0xCABAC28A,0x53B39330,0x24B4A3A6,0xBAD03605,
|
|
|
|
|
0xCDD70693,0x54DE5729,0x23D967BF,0xB3667A2E,0xC4614AB8,0x5D681B02,0x2A6F2B94,
|
|
|
|
|
0xB40BBE37,0xC30C8EA1,0x5A05DF1B,0x2D02EF8D
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
uint32_t crc = init ^ 0xFFFFFFFF;
|
|
|
|
|
|
|
|
|
|
for (size_t i = 0; i < nb_buf; i++) {
|
|
|
|
|
crc = table[(crc ^ buf[i]) & 0xff] ^ (crc >> 8);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return crc^0xFFFFFFFF;
|
|
|
|
|
int width = 32; // 32bits checksum.
|
|
|
|
|
uint64_t msb_mask = (uint32_t)(0x01 << (width - 1));
|
|
|
|
|
uint64_t mask = (uint32_t)(((msb_mask - 1) << 1) | 1);
|
|
|
|
|
|
|
|
|
|
int tbl_idx_width = 8; // table index size.
|
|
|
|
|
int tbl_width = 0x01 << tbl_idx_width; // table size: 256
|
|
|
|
|
|
|
|
|
|
for (int i = 0; i < tbl_width; i++) {
|
|
|
|
|
uint64_t reg = uint64_t(i);
|
|
|
|
|
|
|
|
|
|
if (reflect_in) {
|
|
|
|
|
reg = __crc32_reflect(reg, tbl_idx_width);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
uint32_t srs_crc32_mpegts(const void* buf, int size)
|
|
|
|
|
{
|
|
|
|
|
return __mpegts_crc32((const uint8_t*)buf, size);
|
|
|
|
|
reg = reg << (width - tbl_idx_width);
|
|
|
|
|
for (int j = 0; j < tbl_idx_width; j++) {
|
|
|
|
|
if ((reg&msb_mask) != 0) {
|
|
|
|
|
reg = (reg << 1) ^ poly;
|
|
|
|
|
} else {
|
|
|
|
|
reg = reg << 1;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
uint32_t srs_crc32_ieee(const void* buf, int size, uint32_t previous)
|
|
|
|
|
{
|
|
|
|
|
return __crc32_ieee(previous, (const uint8_t*)buf, size);
|
|
|
|
|
if (reflect_in) {
|
|
|
|
|
reg = __crc32_reflect(reg, width);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Copyright (c) 2006 Ryan Martell. (rdm4@martellventures.com)
|
|
|
|
|
*
|
|
|
|
|
* This file is part of FFmpeg.
|
|
|
|
|
*
|
|
|
|
|
* FFmpeg is free software; you can redistribute it and/or
|
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
|
*
|
|
|
|
|
* FFmpeg 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
|
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
|
*
|
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
|
* License along with FFmpeg; if not, write to the Free Software
|
|
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
|
*/
|
|
|
|
|
t[i] = (uint32_t)(reg & mask);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#ifndef UINT_MAX
|
|
|
|
|
#define UINT_MAX 0xffffffff
|
|
|
|
|
#endif
|
|
|
|
|
// @see pycrc table_driven at https://github.com/winlinvip/pycrc/blob/master/pycrc/algorithms.py#L207
|
|
|
|
|
uint32_t __crc32_table_driven(uint32_t* t, const void* buf, int size, uint32_t previous, bool reflect_in, uint32_t xor_in, bool reflect_out, uint32_t xor_out)
|
|
|
|
|
{
|
|
|
|
|
int width = 32; // 32bits checksum.
|
|
|
|
|
uint64_t msb_mask = (uint32_t)(0x01 << (width - 1));
|
|
|
|
|
uint64_t mask = (uint32_t)(((msb_mask - 1) << 1) | 1);
|
|
|
|
|
|
|
|
|
|
#ifndef AV_RB32
|
|
|
|
|
# define AV_RB32(x) \
|
|
|
|
|
(((uint32_t)((const uint8_t*)(x))[0] << 24) | \
|
|
|
|
|
(((const uint8_t*)(x))[1] << 16) | \
|
|
|
|
|
(((const uint8_t*)(x))[2] << 8) | \
|
|
|
|
|
((const uint8_t*)(x))[3])
|
|
|
|
|
#endif
|
|
|
|
|
int tbl_idx_width = 8; // table index size.
|
|
|
|
|
|
|
|
|
|
#ifndef AV_WL32
|
|
|
|
|
# define AV_WL32(p, darg) do { \
|
|
|
|
|
unsigned d = (darg); \
|
|
|
|
|
((uint8_t*)(p))[0] = (d); \
|
|
|
|
|
((uint8_t*)(p))[1] = (d)>>8; \
|
|
|
|
|
((uint8_t*)(p))[2] = (d)>>16; \
|
|
|
|
|
((uint8_t*)(p))[3] = (d)>>24; \
|
|
|
|
|
} while(0)
|
|
|
|
|
#endif
|
|
|
|
|
uint8_t* p = (uint8_t*)buf;
|
|
|
|
|
uint64_t reg = 0;
|
|
|
|
|
|
|
|
|
|
# define AV_WN(s, p, v) AV_WL##s(p, v)
|
|
|
|
|
if (!reflect_in) {
|
|
|
|
|
reg = xor_in;
|
|
|
|
|
|
|
|
|
|
# if defined(AV_WN32) && !defined(AV_WL32)
|
|
|
|
|
# define AV_WL32(p, v) AV_WN32(p, v)
|
|
|
|
|
# elif !defined(AV_WN32) && defined(AV_WL32)
|
|
|
|
|
# define AV_WN32(p, v) AV_WL32(p, v)
|
|
|
|
|
# endif
|
|
|
|
|
for (int i = 0; i < size; i++) {
|
|
|
|
|
uint8_t tblidx = (uint8_t)((reg >> (width - tbl_idx_width)) ^ p[i]);
|
|
|
|
|
reg = t[tblidx] ^ (reg << tbl_idx_width);
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
reg = previous ^ __crc32_reflect(xor_in, width);
|
|
|
|
|
|
|
|
|
|
#ifndef AV_WN32
|
|
|
|
|
# define AV_WN32(p, v) AV_WN(32, p, v)
|
|
|
|
|
#endif
|
|
|
|
|
for (int i = 0; i < size; i++) {
|
|
|
|
|
uint8_t tblidx = (uint8_t)(reg ^ p[i]);
|
|
|
|
|
reg = t[tblidx] ^ (reg >> tbl_idx_width);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define AV_BSWAP16C(x) (((x) << 8 & 0xff00) | ((x) >> 8 & 0x00ff))
|
|
|
|
|
#define AV_BSWAP32C(x) (AV_BSWAP16C(x) << 16 | AV_BSWAP16C((x) >> 16))
|
|
|
|
|
reg = __crc32_reflect(reg, width);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#ifndef av_bswap32
|
|
|
|
|
static const uint32_t av_bswap32(uint32_t x)
|
|
|
|
|
{
|
|
|
|
|
return AV_BSWAP32C(x);
|
|
|
|
|
if (reflect_out) {
|
|
|
|
|
reg = __crc32_reflect(reg, width);
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#define av_be2ne32(x) av_bswap32(x)
|
|
|
|
|
reg ^= xor_out;
|
|
|
|
|
return (uint32_t)(reg & mask);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* @file
|
|
|
|
|
* @brief Base64 encode/decode
|
|
|
|
|
* @author Ryan Martell <rdm4@martellventures.com> (with lots of Michael)
|
|
|
|
|
*/
|
|
|
|
|
// @see pycrc https://github.com/winlinvip/pycrc/blob/master/pycrc/algorithms.py#L207
|
|
|
|
|
// IEEETable is the table for the IEEE polynomial.
|
|
|
|
|
static uint32_t __crc32_IEEE_table[256];
|
|
|
|
|
static bool __crc32_IEEE_table_initialized = false;
|
|
|
|
|
|
|
|
|
|
/* ---------------- private code */
|
|
|
|
|
static const uint8_t map2[256] =
|
|
|
|
|
// @see pycrc https://github.com/winlinvip/pycrc/blob/master/pycrc/models.py#L220
|
|
|
|
|
// crc32('123456789') = 0xcbf43926
|
|
|
|
|
// where it's defined as model:
|
|
|
|
|
// 'name': 'crc-32',
|
|
|
|
|
// 'width': 32,
|
|
|
|
|
// 'poly': 0x4c11db7,
|
|
|
|
|
// 'reflect_in': True,
|
|
|
|
|
// 'xor_in': 0xffffffff,
|
|
|
|
|
// 'reflect_out': True,
|
|
|
|
|
// 'xor_out': 0xffffffff,
|
|
|
|
|
// 'check': 0xcbf43926,
|
|
|
|
|
uint32_t srs_crc32_ieee(const void* buf, int size, uint32_t previous)
|
|
|
|
|
{
|
|
|
|
|
0xfe, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff,
|
|
|
|
|
|
|
|
|
|
0x3e, 0xff, 0xff, 0xff, 0x3f, 0x34, 0x35, 0x36,
|
|
|
|
|
0x37, 0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0xff,
|
|
|
|
|
0xff, 0xff, 0xfe, 0xff, 0xff, 0xff, 0x00, 0x01,
|
|
|
|
|
0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09,
|
|
|
|
|
0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10, 0x11,
|
|
|
|
|
0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x1a, 0x1b,
|
|
|
|
|
0x1c, 0x1d, 0x1e, 0x1f, 0x20, 0x21, 0x22, 0x23,
|
|
|
|
|
0x24, 0x25, 0x26, 0x27, 0x28, 0x29, 0x2a, 0x2b,
|
|
|
|
|
0x2c, 0x2d, 0x2e, 0x2f, 0x30, 0x31, 0x32, 0x33,
|
|
|
|
|
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#define BASE64_DEC_STEP(i) do { \
|
|
|
|
|
bits = map2[in[i]]; \
|
|
|
|
|
if (bits & 0x80) \
|
|
|
|
|
goto out ## i; \
|
|
|
|
|
v = i ? (v << 6) + bits : bits; \
|
|
|
|
|
} while(0)
|
|
|
|
|
|
|
|
|
|
int srs_av_base64_decode(uint8_t* out, const char* in_str, int out_size)
|
|
|
|
|
// @see golang IEEE of hash/crc32/crc32.go
|
|
|
|
|
// IEEE is by far and away the most common CRC-32 polynomial.
|
|
|
|
|
// Used by ethernet (IEEE 802.3), v.42, fddi, gzip, zip, png, ...
|
|
|
|
|
// @remark The poly of CRC32 IEEE is 0x04C11DB7, its reverse is 0xEDB88320,
|
|
|
|
|
// please read https://en.wikipedia.org/wiki/Cyclic_redundancy_check
|
|
|
|
|
uint32_t poly = 0x04C11DB7;
|
|
|
|
|
|
|
|
|
|
bool reflect_in = true;
|
|
|
|
|
uint32_t xor_in = 0xffffffff;
|
|
|
|
|
bool reflect_out = true;
|
|
|
|
|
uint32_t xor_out = 0xffffffff;
|
|
|
|
|
|
|
|
|
|
if (!__crc32_IEEE_table_initialized) {
|
|
|
|
|
__crc32_make_table(__crc32_IEEE_table, poly, reflect_in);
|
|
|
|
|
__crc32_IEEE_table_initialized = true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return __crc32_table_driven(__crc32_IEEE_table, buf, size, previous, reflect_in, xor_in, reflect_out, xor_out);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// @see pycrc https://github.com/winlinvip/pycrc/blob/master/pycrc/algorithms.py#L238
|
|
|
|
|
// IEEETable is the table for the MPEG polynomial.
|
|
|
|
|
static uint32_t __crc32_MPEG_table[256];
|
|
|
|
|
static bool __crc32_MPEG_table_initialized = false;
|
|
|
|
|
|
|
|
|
|
// @see pycrc https://github.com/winlinvip/pycrc/blob/master/pycrc/models.py#L238
|
|
|
|
|
// crc32('123456789') = 0x0376e6e7
|
|
|
|
|
// where it's defined as model:
|
|
|
|
|
// 'name': 'crc-32',
|
|
|
|
|
// 'width': 32,
|
|
|
|
|
// 'poly': 0x4c11db7,
|
|
|
|
|
// 'reflect_in': False,
|
|
|
|
|
// 'xor_in': 0xffffffff,
|
|
|
|
|
// 'reflect_out': False,
|
|
|
|
|
// 'xor_out': 0x0,
|
|
|
|
|
// 'check': 0x0376e6e7,
|
|
|
|
|
uint32_t srs_crc32_mpegts(const void* buf, int size)
|
|
|
|
|
{
|
|
|
|
|
uint8_t *dst = out;
|
|
|
|
|
uint8_t *end = out + out_size;
|
|
|
|
|
// no sign extension
|
|
|
|
|
const uint8_t *in = (const uint8_t*)in_str;
|
|
|
|
|
unsigned bits = 0xff;
|
|
|
|
|
unsigned v = 0;
|
|
|
|
|
|
|
|
|
|
while (end - dst > 3) {
|
|
|
|
|
BASE64_DEC_STEP(0);
|
|
|
|
|
BASE64_DEC_STEP(1);
|
|
|
|
|
BASE64_DEC_STEP(2);
|
|
|
|
|
BASE64_DEC_STEP(3);
|
|
|
|
|
// Using AV_WB32 directly confuses compiler
|
|
|
|
|
v = av_be2ne32(v << 8);
|
|
|
|
|
AV_WN32(dst, v);
|
|
|
|
|
dst += 3;
|
|
|
|
|
in += 4;
|
|
|
|
|
}
|
|
|
|
|
if (end - dst) {
|
|
|
|
|
BASE64_DEC_STEP(0);
|
|
|
|
|
BASE64_DEC_STEP(1);
|
|
|
|
|
BASE64_DEC_STEP(2);
|
|
|
|
|
BASE64_DEC_STEP(3);
|
|
|
|
|
*dst++ = v >> 16;
|
|
|
|
|
if (end - dst)
|
|
|
|
|
*dst++ = v >> 8;
|
|
|
|
|
if (end - dst)
|
|
|
|
|
*dst++ = v;
|
|
|
|
|
in += 4;
|
|
|
|
|
}
|
|
|
|
|
while (1) {
|
|
|
|
|
BASE64_DEC_STEP(0);
|
|
|
|
|
in++;
|
|
|
|
|
BASE64_DEC_STEP(0);
|
|
|
|
|
in++;
|
|
|
|
|
BASE64_DEC_STEP(0);
|
|
|
|
|
in++;
|
|
|
|
|
BASE64_DEC_STEP(0);
|
|
|
|
|
in++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
out3:
|
|
|
|
|
*dst++ = v >> 10;
|
|
|
|
|
v <<= 2;
|
|
|
|
|
out2:
|
|
|
|
|
*dst++ = v >> 4;
|
|
|
|
|
out1:
|
|
|
|
|
out0:
|
|
|
|
|
return bits & 1 ? -1 : (int)(dst - out);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************
|
|
|
|
|
* b64_encode: Stolen from VLC's http.c.
|
|
|
|
|
* Simplified by Michael.
|
|
|
|
|
* Fixed edge cases and made it work from data (vs. strings) by Ryan.
|
|
|
|
|
*****************************************************************************/
|
|
|
|
|
|
|
|
|
|
char* srs_av_base64_encode(char* out, int out_size, const uint8_t* in, int in_size)
|
|
|
|
|
// @see golang IEEE of hash/crc32/crc32.go
|
|
|
|
|
// IEEE is by far and away the most common CRC-32 polynomial.
|
|
|
|
|
// Used by ethernet (IEEE 802.3), v.42, fddi, gzip, zip, png, ...
|
|
|
|
|
// @remark The poly of CRC32 IEEE is 0x04C11DB7, its reverse is 0xEDB88320,
|
|
|
|
|
// please read https://en.wikipedia.org/wiki/Cyclic_redundancy_check
|
|
|
|
|
uint32_t poly = 0x04C11DB7;
|
|
|
|
|
|
|
|
|
|
bool reflect_in = false;
|
|
|
|
|
uint32_t xor_in = 0xffffffff;
|
|
|
|
|
bool reflect_out = false;
|
|
|
|
|
uint32_t xor_out = 0x0;
|
|
|
|
|
|
|
|
|
|
if (!__crc32_MPEG_table_initialized) {
|
|
|
|
|
__crc32_make_table(__crc32_MPEG_table, poly, reflect_in);
|
|
|
|
|
__crc32_MPEG_table_initialized = true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return __crc32_table_driven(__crc32_MPEG_table, buf, size, 0x00, reflect_in, xor_in, reflect_out, xor_out);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// @see golang encoding/base64/base64.go
|
|
|
|
|
srs_error_t srs_av_base64_decode(string cipher, string& plaintext)
|
|
|
|
|
{
|
|
|
|
|
static const char b64[] =
|
|
|
|
|
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
|
|
|
|
char *ret, *dst;
|
|
|
|
|
unsigned i_bits = 0;
|
|
|
|
|
int i_shift = 0;
|
|
|
|
|
int bytes_remaining = in_size;
|
|
|
|
|
|
|
|
|
|
if (in_size >= (int)(UINT_MAX / 4) ||
|
|
|
|
|
out_size < SRS_AV_BASE64_SIZE(in_size))
|
|
|
|
|
return NULL;
|
|
|
|
|
ret = dst = out;
|
|
|
|
|
while (bytes_remaining > 3) {
|
|
|
|
|
i_bits = AV_RB32(in);
|
|
|
|
|
in += 3; bytes_remaining -= 3;
|
|
|
|
|
*dst++ = b64[ i_bits>>26 ];
|
|
|
|
|
*dst++ = b64[(i_bits>>20) & 0x3F];
|
|
|
|
|
*dst++ = b64[(i_bits>>14) & 0x3F];
|
|
|
|
|
*dst++ = b64[(i_bits>>8 ) & 0x3F];
|
|
|
|
|
}
|
|
|
|
|
i_bits = 0;
|
|
|
|
|
while (bytes_remaining) {
|
|
|
|
|
i_bits = (i_bits << 8) + *in++;
|
|
|
|
|
bytes_remaining--;
|
|
|
|
|
i_shift += 8;
|
|
|
|
|
}
|
|
|
|
|
while (i_shift > 0) {
|
|
|
|
|
*dst++ = b64[(i_bits << 6 >> i_shift) & 0x3f];
|
|
|
|
|
i_shift -= 6;
|
|
|
|
|
}
|
|
|
|
|
while ((dst - ret) & 3)
|
|
|
|
|
*dst++ = '=';
|
|
|
|
|
*dst = '\0';
|
|
|
|
|
srs_error_t err = srs_success;
|
|
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
|
// We use the standard encoding:
|
|
|
|
|
// var StdEncoding = NewEncoding(encodeStd)
|
|
|
|
|
// StdEncoding is the standard base64 encoding, as defined in RFC 4648.
|
|
|
|
|
char padding = '=';
|
|
|
|
|
string encoder = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
|
|
|
|
|
|
|
|
|
uint8_t decodeMap[256];
|
|
|
|
|
memset(decodeMap, 0xff, sizeof(decodeMap));
|
|
|
|
|
|
|
|
|
|
for (int i = 0; i < encoder.length(); i++) {
|
|
|
|
|
decodeMap[(uint8_t)encoder.at(i)] = uint8_t(i);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// decode is like Decode but returns an additional 'end' value, which
|
|
|
|
|
// indicates if end-of-message padding or a partial quantum was encountered
|
|
|
|
|
// and thus any additional data is an error.
|
|
|
|
|
int si = 0;
|
|
|
|
|
|
|
|
|
|
// skip over newlines
|
|
|
|
|
for (; si < cipher.length() && (cipher.at(si) == '\n' || cipher.at(si) == '\r'); si++) {
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (bool end = false; si < cipher.length() && !end;) {
|
|
|
|
|
// Decode quantum using the base64 alphabet
|
|
|
|
|
uint8_t dbuf[4];
|
|
|
|
|
memset(dbuf, 0x00, sizeof(dbuf));
|
|
|
|
|
|
|
|
|
|
int dinc = 3;
|
|
|
|
|
int dlen = 4;
|
|
|
|
|
|
|
|
|
|
for (int j = 0; j < sizeof(dbuf); j++) {
|
|
|
|
|
if (si == cipher.length()) {
|
|
|
|
|
if (padding != -1 || j < 2) {
|
|
|
|
|
return srs_error_new(ERROR_BASE64_DECODE, "corrupt input at %d", si);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
dinc = j - 1;
|
|
|
|
|
dlen = j;
|
|
|
|
|
end = true;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
char in = cipher.at(si);
|
|
|
|
|
|
|
|
|
|
si++;
|
|
|
|
|
// skip over newlines
|
|
|
|
|
for (; si < cipher.length() && (cipher.at(si) == '\n' || cipher.at(si) == '\r'); si++) {
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (in == padding) {
|
|
|
|
|
// We've reached the end and there's padding
|
|
|
|
|
switch (j) {
|
|
|
|
|
case 0:
|
|
|
|
|
case 1:
|
|
|
|
|
// incorrect padding
|
|
|
|
|
return srs_error_new(ERROR_BASE64_DECODE, "corrupt input at %d", si);
|
|
|
|
|
case 2:
|
|
|
|
|
// "==" is expected, the first "=" is already consumed.
|
|
|
|
|
if (si == cipher.length()) {
|
|
|
|
|
return srs_error_new(ERROR_BASE64_DECODE, "corrupt input at %d", si);
|
|
|
|
|
}
|
|
|
|
|
if (cipher.at(si) != padding) {
|
|
|
|
|
// incorrect padding
|
|
|
|
|
return srs_error_new(ERROR_BASE64_DECODE, "corrupt input at %d", si);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
si++;
|
|
|
|
|
// skip over newlines
|
|
|
|
|
for (; si < cipher.length() && (cipher.at(si) == '\n' || cipher.at(si) == '\r'); si++) {
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (si < cipher.length()) {
|
|
|
|
|
// trailing garbage
|
|
|
|
|
err = srs_error_new(ERROR_BASE64_DECODE, "corrupt input at %d", si);
|
|
|
|
|
}
|
|
|
|
|
dinc = 3;
|
|
|
|
|
dlen = j;
|
|
|
|
|
end = true;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
dbuf[j] = decodeMap[(uint8_t)in];
|
|
|
|
|
if (dbuf[j] == 0xff) {
|
|
|
|
|
return srs_error_new(ERROR_BASE64_DECODE, "corrupt input at %d", si);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Convert 4x 6bit source bytes into 3 bytes
|
|
|
|
|
uint32_t val = uint32_t(dbuf[0])<<18 | uint32_t(dbuf[1])<<12 | uint32_t(dbuf[2])<<6 | uint32_t(dbuf[3]);
|
|
|
|
|
if (dlen >= 2) {
|
|
|
|
|
plaintext.append(1, char(val >> 16));
|
|
|
|
|
}
|
|
|
|
|
if (dlen >= 3) {
|
|
|
|
|
plaintext.append(1, char(val >> 8));
|
|
|
|
|
}
|
|
|
|
|
if (dlen >= 4) {
|
|
|
|
|
plaintext.append(1, char(val));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return err;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define SPACE_CHARS " \t\r\n"
|
|
|
|
|
@ -1051,12 +949,30 @@ int srs_do_create_dir_recursively(string dir)
|
|
|
|
|
return c;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// fromHexChar converts a hex character into its value and a success flag.
|
|
|
|
|
uint8_t srs_from_hex_char(uint8_t c)
|
|
|
|
|
{
|
|
|
|
|
if ('0' <= c && c <= '9') {
|
|
|
|
|
return c - '0';
|
|
|
|
|
}
|
|
|
|
|
if ('a' <= c && c <= 'f') {
|
|
|
|
|
return c - 'a' + 10;
|
|
|
|
|
}
|
|
|
|
|
if ('A' <= c && c <= 'F') {
|
|
|
|
|
return c - 'A' + 10;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
char *srs_data_to_hex(char *des,const u_int8_t *src,int len)
|
|
|
|
|
{
|
|
|
|
|
if(src == NULL || len == 0 || des == NULL){
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const char *hex_table = "0123456789ABCDEF";
|
|
|
|
|
|
|
|
|
|
for (int i=0; i<len; i++) {
|
|
|
|
|
des[i * 2] = hex_table[src[i] >> 4];
|
|
|
|
|
des[i * 2 + 1] = hex_table[src[i] & 0x0F];
|
|
|
|
|
@ -1065,32 +981,27 @@ int srs_do_create_dir_recursively(string dir)
|
|
|
|
|
return des;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int ff_hex_to_data(uint8_t* data, const char* p)
|
|
|
|
|
int srs_hex_to_data(uint8_t* data, const char* p, int size)
|
|
|
|
|
{
|
|
|
|
|
int c, len, v;
|
|
|
|
|
if (size <= 0 || (size%2) == 1) {
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
len = 0;
|
|
|
|
|
v = 1;
|
|
|
|
|
for (;;) {
|
|
|
|
|
p += strspn(p, SPACE_CHARS);
|
|
|
|
|
if (*p == '\0')
|
|
|
|
|
break;
|
|
|
|
|
c = av_toupper((unsigned char) *p++);
|
|
|
|
|
if (c >= '0' && c <= '9')
|
|
|
|
|
c = c - '0';
|
|
|
|
|
else if (c >= 'A' && c <= 'F')
|
|
|
|
|
c = c - 'A' + 10;
|
|
|
|
|
else
|
|
|
|
|
break;
|
|
|
|
|
v = (v << 4) | c;
|
|
|
|
|
if (v & 0x100) {
|
|
|
|
|
if (data)
|
|
|
|
|
data[len] = v;
|
|
|
|
|
len++;
|
|
|
|
|
v = 1;
|
|
|
|
|
for (int i = 0; i < size / 2; i++) {
|
|
|
|
|
uint8_t a = srs_from_hex_char(p[i*2]);
|
|
|
|
|
if (a == (uint8_t)-1) {
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
uint8_t b = srs_from_hex_char(p[i*2 + 1]);
|
|
|
|
|
if (b == (uint8_t)-1) {
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
return len;
|
|
|
|
|
|
|
|
|
|
data[i] = (a << 4) | b;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return size / 2;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int srs_chunk_header_c0(int perfer_cid, uint32_t timestamp, int32_t payload_length, int8_t message_type, int32_t stream_id, char* cache, int nb_cache)
|
|
|
|
|
|
Harlan
7 years ago