diff options
| author | Baptiste Coudurier <baptiste.coudurier@gmail.com> | 2009-07-30 19:14:57 +0000 |
|---|---|---|
| committer | Baptiste Coudurier <baptiste.coudurier@gmail.com> | 2009-07-30 19:14:57 +0000 |
| commit | 46c9eb57d026801c1d0c626e9afa2930d8d966b8 (patch) | |
| tree | 421ccea911fe0c1e131bbf73188f95c2042a09e7 /libavformat/avc.c | |
| parent | 0fd7cf116b1e649cfd5353c25b0ab373da147651 (diff) | |
| download | ffmpeg-46c9eb57d026801c1d0c626e9afa2930d8d966b8.tar.gz | |
cosmetics, remove spaces after '(' and before ')'
Originally committed as revision 19547 to svn://svn.ffmpeg.org/ffmpeg/trunk
Diffstat (limited to 'libavformat/avc.c')
| -rw-r--r-- | libavformat/avc.c | 28 |
1 files changed, 14 insertions, 14 deletions
diff --git a/libavformat/avc.c b/libavformat/avc.c index 578e7d0462..0731e39698 100644 --- a/libavformat/avc.c +++ b/libavformat/avc.c @@ -27,33 +27,33 @@ const uint8_t *ff_avc_find_startcode(const uint8_t *p, const uint8_t *end) { const uint8_t *a = p + 4 - ((intptr_t)p & 3); - for( end -= 3; p < a && p < end; p++ ) { - if( p[0] == 0 && p[1] == 0 && p[2] == 1 ) + for (end -= 3; p < a && p < end; p++) { + if (p[0] == 0 && p[1] == 0 && p[2] == 1) return p; } - for( end -= 3; p < end; p += 4 ) { + for (end -= 3; p < end; p += 4) { uint32_t x = *(const uint32_t*)p; -// if( (x - 0x01000100) & (~x) & 0x80008000 ) // little endian -// if( (x - 0x00010001) & (~x) & 0x00800080 ) // big endian - if( (x - 0x01010101) & (~x) & 0x80808080 ) { // generic - if( p[1] == 0 ) { - if( p[0] == 0 && p[2] == 1 ) +// if ((x - 0x01000100) & (~x) & 0x80008000) // little endian +// if ((x - 0x00010001) & (~x) & 0x00800080) // big endian + if ((x - 0x01010101) & (~x) & 0x80808080) { // generic + if (p[1] == 0) { + if (p[0] == 0 && p[2] == 1) return p-1; - if( p[2] == 0 && p[3] == 1 ) + if (p[2] == 0 && p[3] == 1) return p; } - if( p[3] == 0 ) { - if( p[2] == 0 && p[4] == 1 ) + if (p[3] == 0) { + if (p[2] == 0 && p[4] == 1) return p+1; - if( p[4] == 0 && p[5] == 1 ) + if (p[4] == 0 && p[5] == 1) return p+2; } } } - for( end += 3; p < end; p++ ) { - if( p[0] == 0 && p[1] == 0 && p[2] == 1 ) + for (end += 3; p < end; p++) { + if (p[0] == 0 && p[1] == 0 && p[2] == 1) return p; } |