mirror of
https://github.com/moonlight-stream/moonlight-qt.git
synced 2026-08-27 04:37:41 +00:00
Import minimal set of code from h264bitstream needed for SPS fixups
This commit is contained in:
Cameron Gutman
@@ -0,0 +1,275 @@
|
||||
#ifndef _H264_BS_H
|
||||
#define _H264_BS_H 1
|
||||
|
||||
#include <stdint.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
typedef struct
|
||||
{
|
||||
uint8_t* start;
|
||||
uint8_t* p;
|
||||
uint8_t* end;
|
||||
int bits_left;
|
||||
} bs_t;
|
||||
|
||||
#define _OPTIMIZE_BS_ 1
|
||||
|
||||
#if ( _OPTIMIZE_BS_ > 0 )
|
||||
#ifndef FAST_U8
|
||||
#define FAST_U8
|
||||
#endif
|
||||
#endif
|
||||
|
||||
static bs_t* bs_new(uint8_t* buf, size_t size);
|
||||
static void bs_free(bs_t* b);
|
||||
static bs_t* bs_init(bs_t* b, uint8_t* buf, size_t size);
|
||||
static uint32_t bs_byte_aligned(bs_t* b);
|
||||
static int bs_eof(bs_t* b);
|
||||
static int bs_overrun(bs_t* b);
|
||||
static int bs_pos(bs_t* b);
|
||||
|
||||
static uint32_t bs_read_u1(bs_t* b);
|
||||
static void bs_skip_u1(bs_t* b);
|
||||
static uint32_t bs_read_u(bs_t* b, int n);
|
||||
static void bs_skip_u(bs_t* b, int n);
|
||||
static uint32_t bs_read_u8(bs_t* b);
|
||||
static uint32_t bs_read_ue(bs_t* b);
|
||||
static int32_t bs_read_se(bs_t* b);
|
||||
|
||||
static void bs_write_u1(bs_t* b, uint32_t v);
|
||||
static void bs_write_u(bs_t* b, int n, uint32_t v);
|
||||
static void bs_write_u8(bs_t* b, uint32_t v);
|
||||
static void bs_write_ue(bs_t* b, uint32_t v);
|
||||
static void bs_write_se(bs_t* b, int32_t v);
|
||||
|
||||
// IMPLEMENTATION
|
||||
|
||||
static inline bs_t* bs_init(bs_t* b, uint8_t* buf, size_t size)
|
||||
{
|
||||
b->start = buf;
|
||||
b->p = buf;
|
||||
b->end = buf + size;
|
||||
b->bits_left = 8;
|
||||
return b;
|
||||
}
|
||||
|
||||
static inline bs_t* bs_new(uint8_t* buf, size_t size)
|
||||
{
|
||||
bs_t* b = (bs_t*)malloc(sizeof(bs_t));
|
||||
bs_init(b, buf, size);
|
||||
return b;
|
||||
}
|
||||
|
||||
static inline void bs_free(bs_t* b)
|
||||
{
|
||||
free(b);
|
||||
}
|
||||
|
||||
static inline uint32_t bs_byte_aligned(bs_t* b)
|
||||
{
|
||||
return (b->bits_left == 8);
|
||||
}
|
||||
|
||||
static inline int bs_eof(bs_t* b) { if (b->p >= b->end) { return 1; } else { return 0; } }
|
||||
|
||||
static inline int bs_overrun(bs_t* b) { if (b->p > b->end) { return 1; } else { return 0; } }
|
||||
|
||||
static inline int bs_pos(bs_t* b) { if (b->p > b->end) { return (b->end - b->start); } else { return (b->p - b->start); } }
|
||||
|
||||
static inline uint32_t bs_read_u1(bs_t* b)
|
||||
{
|
||||
uint32_t r = 0;
|
||||
|
||||
b->bits_left--;
|
||||
|
||||
if (! bs_eof(b))
|
||||
{
|
||||
r = ((*(b->p)) >> b->bits_left) & 0x01;
|
||||
}
|
||||
|
||||
if (b->bits_left == 0) { b->p ++; b->bits_left = 8; }
|
||||
|
||||
return r;
|
||||
}
|
||||
|
||||
static inline void bs_skip_u1(bs_t* b)
|
||||
{
|
||||
b->bits_left--;
|
||||
if (b->bits_left == 0) { b->p ++; b->bits_left = 8; }
|
||||
}
|
||||
|
||||
static inline uint32_t bs_read_u(bs_t* b, int n)
|
||||
{
|
||||
uint32_t r = 0;
|
||||
int i;
|
||||
for (i = 0; i < n; i++)
|
||||
{
|
||||
r |= ( bs_read_u1(b) << ( n - i - 1 ) );
|
||||
}
|
||||
return r;
|
||||
}
|
||||
|
||||
static inline void bs_skip_u(bs_t* b, int n)
|
||||
{
|
||||
int i;
|
||||
for ( i = 0; i < n; i++ )
|
||||
{
|
||||
bs_skip_u1( b );
|
||||
}
|
||||
}
|
||||
|
||||
static inline uint32_t bs_read_u8(bs_t* b)
|
||||
{
|
||||
#ifdef FAST_U8
|
||||
if (b->bits_left == 8 && ! bs_eof(b)) // can do fast read
|
||||
{
|
||||
uint32_t r = b->p[0];
|
||||
b->p++;
|
||||
return r;
|
||||
}
|
||||
#endif
|
||||
return bs_read_u(b, 8);
|
||||
}
|
||||
|
||||
static inline uint32_t bs_read_ue(bs_t* b)
|
||||
{
|
||||
int32_t r = 0;
|
||||
int i = 0;
|
||||
|
||||
while( (bs_read_u1(b) == 0) && (i < 32) && (!bs_eof(b)) )
|
||||
{
|
||||
i++;
|
||||
}
|
||||
r = bs_read_u(b, i);
|
||||
r += (1 << i) - 1;
|
||||
return r;
|
||||
}
|
||||
|
||||
static inline int32_t bs_read_se(bs_t* b)
|
||||
{
|
||||
int32_t r = bs_read_ue(b);
|
||||
if (r & 0x01)
|
||||
{
|
||||
r = (r+1)/2;
|
||||
}
|
||||
else
|
||||
{
|
||||
r = -(r/2);
|
||||
}
|
||||
return r;
|
||||
}
|
||||
|
||||
static inline void bs_write_u1(bs_t* b, uint32_t v)
|
||||
{
|
||||
b->bits_left--;
|
||||
|
||||
if (! bs_eof(b))
|
||||
{
|
||||
(*(b->p)) &= ~(0x01 << b->bits_left);
|
||||
(*(b->p)) |= ((v & 0x01) << b->bits_left);
|
||||
}
|
||||
|
||||
if (b->bits_left == 0) { b->p ++; b->bits_left = 8; }
|
||||
}
|
||||
|
||||
static inline void bs_write_u(bs_t* b, int n, uint32_t v)
|
||||
{
|
||||
int i;
|
||||
for (i = 0; i < n; i++)
|
||||
{
|
||||
bs_write_u1(b, (v >> ( n - i - 1 ))&0x01 );
|
||||
}
|
||||
}
|
||||
|
||||
static inline void bs_write_u8(bs_t* b, uint32_t v)
|
||||
{
|
||||
#ifdef FAST_U8
|
||||
if (b->bits_left == 8 && ! bs_eof(b)) // can do fast write
|
||||
{
|
||||
b->p[0] = v;
|
||||
b->p++;
|
||||
return;
|
||||
}
|
||||
#endif
|
||||
bs_write_u(b, 8, v);
|
||||
}
|
||||
|
||||
static inline void bs_write_ue(bs_t* b, uint32_t v)
|
||||
{
|
||||
static const int len_table[256] =
|
||||
{
|
||||
1,
|
||||
1,
|
||||
2,2,
|
||||
3,3,3,3,
|
||||
4,4,4,4,4,4,4,4,
|
||||
5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
|
||||
6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
|
||||
6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
|
||||
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
|
||||
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
|
||||
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
|
||||
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
|
||||
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
||||
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
||||
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
||||
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
||||
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
||||
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
||||
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
||||
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
||||
};
|
||||
|
||||
int len;
|
||||
|
||||
if (v == 0)
|
||||
{
|
||||
bs_write_u1(b, 1);
|
||||
}
|
||||
else
|
||||
{
|
||||
v++;
|
||||
|
||||
if (v >= 0x01000000)
|
||||
{
|
||||
len = 24 + len_table[ v >> 24 ];
|
||||
}
|
||||
else if(v >= 0x00010000)
|
||||
{
|
||||
len = 16 + len_table[ v >> 16 ];
|
||||
}
|
||||
else if(v >= 0x00000100)
|
||||
{
|
||||
len = 8 + len_table[ v >> 8 ];
|
||||
}
|
||||
else
|
||||
{
|
||||
len = len_table[ v ];
|
||||
}
|
||||
|
||||
bs_write_u(b, 2*len-1, v);
|
||||
}
|
||||
}
|
||||
|
||||
static inline void bs_write_se(bs_t* b, int32_t v)
|
||||
{
|
||||
if (v <= 0)
|
||||
{
|
||||
bs_write_ue(b, -v*2);
|
||||
}
|
||||
else
|
||||
{
|
||||
bs_write_ue(b, v*2 - 1);
|
||||
}
|
||||
}
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif
|
||||
Reference in New Issue
Block a user