FFmpeg coverage


Directory: ../../../ffmpeg/
File: src/libavcodec/rle.c
Date: 2021-09-16 08:47:15
Exec Total Coverage
Lines: 26 27 96.3%
Branches: 19 20 95.0%

Line Branch Exec Source
1 /*
2 * RLE encoder
3 * Copyright (c) 2007 Bobby Bingham
4 *
5 * This file is part of FFmpeg.
6 *
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22 #include <string.h>
23
24 #include "libavutil/common.h"
25
26 #include "rle.h"
27
28 239474 int ff_rle_count_pixels(const uint8_t *start, int len, int bpp, int same)
29 {
30 const uint8_t *pos;
31 239474 int count = 1;
32
33
2/2
✓ Branch 0 taken 9285053 times.
✓ Branch 1 taken 69544 times.
9354597 for (pos = start + bpp; count < FFMIN(127, len); pos += bpp, count++) {
34
2/2
✓ Branch 0 taken 268613 times.
✓ Branch 1 taken 9016440 times.
9285053 if (same != !memcmp(pos - bpp, pos, bpp)) {
35
2/2
✓ Branch 0 taken 129548 times.
✓ Branch 1 taken 139065 times.
268613 if (!same) {
36 /* if bpp == 1, then 0 1 1 0 is more efficiently encoded as a
37 * single raw block of pixels. For larger bpp, RLE is as good
38 * or better */
39
6/6
✓ Branch 0 taken 126204 times.
✓ Branch 1 taken 3344 times.
✓ Branch 2 taken 125470 times.
✓ Branch 3 taken 734 times.
✓ Branch 4 taken 98683 times.
✓ Branch 5 taken 26787 times.
129548 if (bpp == 1 && count + 1 < FFMIN(127, len) && *pos != *(pos + 1))
40 98683 continue;
41
42 /* if RLE can encode the next block better than as a raw block,
43 * back up and leave _all_ the identical pixels for RLE */
44 30865 count--;
45 }
46 169930 break;
47 }
48 }
49
50 239474 return count;
51 }
52
53 7488 int ff_rle_encode(uint8_t *outbuf, int out_size, const uint8_t *ptr, int bpp,
54 int w, int add_rep, int xor_rep, int add_raw, int xor_raw)
55 {
56 int count, x;
57 7488 uint8_t *out = outbuf;
58
59
2/2
✓ Branch 0 taken 53514 times.
✓ Branch 1 taken 7475 times.
60989 for (x = 0; x < w; x += count) {
60 /* see if we can encode the next set of pixels with RLE */
61
2/2
✓ Branch 1 taken 5546 times.
✓ Branch 2 taken 47968 times.
53514 if ((count = ff_rle_count_pixels(ptr, w - x, bpp, 1)) > 1) {
62
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5546 times.
5546 if (out + bpp + 1 > outbuf + out_size)
63 return -1;
64
65 5546 *out++ = (count ^ xor_rep) + add_rep;
66 5546 memcpy(out, ptr, bpp);
67 5546 out += bpp;
68 } else {
69 /* fall back on uncompressed */
70 47968 count = ff_rle_count_pixels(ptr, w - x, bpp, 0);
71
2/2
✓ Branch 0 taken 13 times.
✓ Branch 1 taken 47955 times.
47968 if (out + bpp * count >= outbuf + out_size)
72 13 return -1;
73
74 47955 *out++ = (count ^ xor_raw) + add_raw;
75 47955 memcpy(out, ptr, bpp * count);
76 47955 out += bpp * count;
77 }
78
79 53501 ptr += count * bpp;
80 }
81
82 7475 return out - outbuf;
83 }
84