⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 common.h

📁 Trolltech公司发布的图形界面操作系统。可在qt-embedded-2.3.7平台上编译为嵌入式图形界面操作系统。
💻 H
📖 第 1 页 / 共 2 页
字号:
        name##_cache <<= (num);\// FIXME name?#   define SKIP_COUNTER(name, gb, num)\        name##_index += (num);\#   define SKIP_BITS(name, gb, num)\        {\            SKIP_CACHE(name, gb, num)\            SKIP_COUNTER(name, gb, num)\        }\#   define LAST_SKIP_BITS(name, gb, num) SKIP_COUNTER(name, gb, num)#   define LAST_SKIP_CACHE(name, gb, num) ;#   define SHOW_UBITS(name, gb, num)\        NEG_USR32(name##_cache, num)#   define SHOW_SBITS(name, gb, num)\        NEG_SSR32(name##_cache, num)#   define GET_CACHE(name, gb)\        ((uint32_t)name##_cache)static inline int get_bits_count(GetBitContext *s){    return s->index;}#elif defined LIBMPEG2_BITSTREAM_READER//libmpeg2 like reader#   define MIN_CACHE_BITS 16#   define OPEN_READER(name, gb)\        int name##_bit_count=(gb)->bit_count;\        int name##_cache= (gb)->cache;\        uint8_t * name##_buffer_ptr=(gb)->buffer_ptr;\#   define CLOSE_READER(name, gb)\        (gb)->bit_count= name##_bit_count;\        (gb)->cache= name##_cache;\        (gb)->buffer_ptr= name##_buffer_ptr;\#   define UPDATE_CACHE(name, gb)\    if(name##_bit_count > 0){\        name##_cache+= ((name##_buffer_ptr[0]<<8) + name##_buffer_ptr[1]) << name##_bit_count;\        name##_buffer_ptr+=2;\        name##_bit_count-= 16;\    }\#   define SKIP_CACHE(name, gb, num)\        name##_cache <<= (num);\#   define SKIP_COUNTER(name, gb, num)\        name##_bit_count += (num);\#   define SKIP_BITS(name, gb, num)\        {\            SKIP_CACHE(name, gb, num)\            SKIP_COUNTER(name, gb, num)\        }\#   define LAST_SKIP_BITS(name, gb, num) SKIP_BITS(name, gb, num)#   define LAST_SKIP_CACHE(name, gb, num) SKIP_CACHE(name, gb, num)#   define SHOW_UBITS(name, gb, num)\        NEG_USR32(name##_cache, num)#   define SHOW_SBITS(name, gb, num)\        NEG_SSR32(name##_cache, num)#   define GET_CACHE(name, gb)\        ((uint32_t)name##_cache)static inline int get_bits_count(GetBitContext *s){    return (s->buffer_ptr - s->buffer)*8 - 16 + s->bit_count;}#elif defined A32_BITSTREAM_READER#   define MIN_CACHE_BITS 32#   define OPEN_READER(name, gb)\        int name##_bit_count=(gb)->bit_count;\        uint32_t name##_cache0= (gb)->cache0;\        uint32_t name##_cache1= (gb)->cache1;\        uint32_t * name##_buffer_ptr=(gb)->buffer_ptr;\#   define CLOSE_READER(name, gb)\        (gb)->bit_count= name##_bit_count;\        (gb)->cache0= name##_cache0;\        (gb)->cache1= name##_cache1;\        (gb)->buffer_ptr= name##_buffer_ptr;\#   define UPDATE_CACHE(name, gb)\    if(name##_bit_count > 0){\        const uint32_t next= be2me_32( *name##_buffer_ptr );\        name##_cache0 |= NEG_USR32(next,name##_bit_count);\        name##_cache1 |= next<<name##_bit_count;\        name##_buffer_ptr++;\        name##_bit_count-= 32;\    }\#ifdef ARCH_X86#   define SKIP_CACHE(name, gb, num)\        asm(\            "shldl %2, %1, %0		\n\t"\            "shll %2, %1		\n\t"\            : "+r" (name##_cache0), "+r" (name##_cache1)\            : "Ic" ((uint8_t)num)\           );#else#   define SKIP_CACHE(name, gb, num)\        name##_cache0 <<= (num);\        name##_cache0 |= NEG_USR32(name##_cache1,num);\        name##_cache1 <<= (num);#endif#   define SKIP_COUNTER(name, gb, num)\        name##_bit_count += (num);\#   define SKIP_BITS(name, gb, num)\        {\            SKIP_CACHE(name, gb, num)\            SKIP_COUNTER(name, gb, num)\        }\#   define LAST_SKIP_BITS(name, gb, num) SKIP_BITS(name, gb, num)#   define LAST_SKIP_CACHE(name, gb, num) SKIP_CACHE(name, gb, num)#   define SHOW_UBITS(name, gb, num)\        NEG_USR32(name##_cache0, num)#   define SHOW_SBITS(name, gb, num)\        NEG_SSR32(name##_cache0, num)#   define GET_CACHE(name, gb)\        (name##_cache0)static inline int get_bits_count(GetBitContext *s){    return ((uint8_t*)s->buffer_ptr - s->buffer)*8 - 32 + s->bit_count;}#endifstatic inline unsigned int get_bits(GetBitContext *s, int n){    register int tmp;    OPEN_READER(re, s)    UPDATE_CACHE(re, s)    tmp= SHOW_UBITS(re, s, n);    LAST_SKIP_BITS(re, s, n)    CLOSE_READER(re, s)    return tmp;}static inline unsigned int show_bits(GetBitContext *s, int n){    register int tmp;    OPEN_READER(re, s)    UPDATE_CACHE(re, s)    tmp= SHOW_UBITS(re, s, n);//    CLOSE_READER(re, s)    return tmp;}static inline void skip_bits(GetBitContext *s, int n){ //Note gcc seems to optimize this to s->index+=n for the ALT_READER :))    OPEN_READER(re, s)    UPDATE_CACHE(re, s)    LAST_SKIP_BITS(re, s, n)    CLOSE_READER(re, s)}static inline unsigned int get_bits1(GetBitContext *s){#ifdef ALT_BITSTREAM_READER    int index= s->index;    uint8_t result= s->buffer[ index>>3 ];    result<<= (index&0x07);    result>>= 8 - 1;    index++;    s->index= index;    return result;#else    return get_bits(s, 1);#endif}static inline unsigned int show_bits1(GetBitContext *s){    return show_bits(s, 1);}static inline void skip_bits1(GetBitContext *s){    skip_bits(s, 1);}void init_get_bits(GetBitContext *s,                   UINT8 *buffer, int buffer_size);int check_marker(GetBitContext *s, const char *msg);void align_get_bits(GetBitContext *s);int init_vlc(VLC *vlc, int nb_bits, int nb_codes,             const void *bits, int bits_wrap, int bits_size,             const void *codes, int codes_wrap, int codes_size);void free_vlc(VLC *vlc);#define GET_VLC(code, name, gb, table, bits, max_depth)\{\    int n, index, nb_bits;\\    index= SHOW_UBITS(name, gb, bits);\    code = table[index][0];\    n    = table[index][1];\\    if(max_depth > 1 && n < 0){\        LAST_SKIP_BITS(name, gb, bits)\        UPDATE_CACHE(name, gb)\\        nb_bits = -n;\\        index= SHOW_UBITS(name, gb, nb_bits) + code;\        code = table[index][0];\        n    = table[index][1];\        if(max_depth > 2 && n < 0){\            LAST_SKIP_BITS(name, gb, nb_bits)\            UPDATE_CACHE(name, gb)\\            nb_bits = -n;\\            index= SHOW_UBITS(name, gb, nb_bits) + code;\            code = table[index][0];\            n    = table[index][1];\        }\    }\    SKIP_BITS(name, gb, n)\}#define GET_RL_VLC(level, run, name, gb, table, bits, max_depth)\{\    int n, index, nb_bits;\\    index= SHOW_UBITS(name, gb, bits);\    level = table[index].level;\    n     = table[index].len;\\    if(max_depth > 1 && n < 0){\        LAST_SKIP_BITS(name, gb, bits)\        UPDATE_CACHE(name, gb)\\        nb_bits = -n;\\        index= SHOW_UBITS(name, gb, nb_bits) + level;\        level = table[index].level;\        n     = table[index].len;\    }\    run= table[index].run;\    SKIP_BITS(name, gb, n)\}// deprecated, dont use get_vlc for new code, use get_vlc2 instead or use GET_VLC directlystatic inline int get_vlc(GetBitContext *s, VLC *vlc){    int code;    VLC_TYPE (*table)[2]= vlc->table;        OPEN_READER(re, s)    UPDATE_CACHE(re, s)    GET_VLC(code, re, s, table, vlc->bits, 3)        CLOSE_READER(re, s)    return code;}static always_inline int get_vlc2(GetBitContext *s, VLC_TYPE (*table)[2],                                  int bits, int max_depth){    int code;        OPEN_READER(re, s)    UPDATE_CACHE(re, s)    GET_VLC(code, re, s, table, bits, max_depth)    CLOSE_READER(re, s)    return code;}/* define it to include statistics code (useful only for optimizing   codec efficiency *///#define STATS#ifdef STATSenum {    ST_UNKNOWN,    ST_DC,    ST_INTRA_AC,    ST_INTER_AC,    ST_INTRA_MB,    ST_INTER_MB,    ST_MV,    ST_NB,};extern int st_current_index;extern unsigned int st_bit_counts[ST_NB];extern unsigned int st_out_bit_counts[ST_NB];void print_stats(void);#endif/* misc math functions */static inline int av_log2(unsigned int v){    int n;    n = 0;    if (v & 0xffff0000) {        v >>= 16;        n += 16;    }    if (v & 0xff00) {        v >>= 8;        n += 8;    }    if (v & 0xf0) {        v >>= 4;        n += 4;    }    if (v & 0xc) {        v >>= 2;        n += 2;    }    if (v & 0x2) {        n++;    }    return n;}/* median of 3 */static inline int mid_pred(int a, int b, int c){    int vmin, vmax;    vmax = vmin = a;    if (b < vmin)        vmin = b;    else	vmax = b;    if (c < vmin)        vmin = c;    else if (c > vmax)        vmax = c;    return a + b + c - vmin - vmax;}static inline int clip(int a, int amin, int amax){    if (a < amin)        return amin;    else if (a > amax)        return amax;    else        return a;}/* math */extern const UINT8 ff_sqrt_tab[128];int ff_gcd(int a, int b);static inline int ff_sqrt(int a){    int ret=0;    int s;    int ret_sq=0;        if(a<128) return ff_sqrt_tab[a];        for(s=15; s>=0; s--){        int b= ret_sq + (1<<(s*2)) + (ret<<s)*2;        if(b<=a){            ret_sq=b;            ret+= 1<<s;        }    }    return ret;}/** * converts fourcc string to int */static inline int ff_get_fourcc(const char *s){    assert( strlen(s)==4 );        return (s[0]) + (s[1]<<8) + (s[2]<<16) + (s[3]<<24);}void ff_float2fraction(int *nom_arg, int *denom_arg, double f, int max);#ifdef ARCH_X86#define MASK_ABS(mask, level)\            asm volatile(\		"cdq			\n\t"\		"xorl %1, %0		\n\t"\		"subl %1, %0		\n\t"\		: "+a" (level), "=&d" (mask)\	    );#else#define MASK_ABS(mask, level)\            mask= level>>31;\            level= (level^mask)-mask;#endif#if __CPU__ >= 686 && !defined(RUNTIME_CPUDETECT)#define COPY3_IF_LT(x,y,a,b,c,d)\asm volatile (\    "cmpl %0, %3	\n\t"\    "cmovl %3, %0	\n\t"\    "cmovl %4, %1	\n\t"\    "cmovl %5, %2	\n\t"\    : "+r" (x), "+r" (a), "+r" (c)\    : "r" (y), "r" (b), "r" (d)\);#else#define COPY3_IF_LT(x,y,a,b,c,d)\if((y)<(x)){\     (x)=(y);\     (a)=(b);\     (c)=(d);\}#endif#define CLAMP_TO_8BIT(d) ((d > 0xff) ? 0xff : (d < 0) ? 0 : d)#endif /* HAVE_AV_CONFIG_H */#endif /* COMMON_H */

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -