FFmpeg
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
rle.c
Go to the documentation of this file.
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 #include "avcodec.h"
22 #include "rle.h"
23 #include "libavutil/common.h"
24 
25 int ff_rle_count_pixels(const uint8_t *start, int len, int bpp, int same)
26 {
27  const uint8_t *pos;
28  int count = 1;
29 
30  for(pos = start + bpp; count < FFMIN(127, len); pos += bpp, count ++) {
31  if(same != !memcmp(pos-bpp, pos, bpp)) {
32  if(!same) {
33  /* if bpp == 1, then 0 1 1 0 is more efficiently encoded as a single
34  * raw block of pixels. for larger bpp, RLE is as good or better */
35  if(bpp == 1 && count + 1 < FFMIN(127, len) && *pos != *(pos+1))
36  continue;
37 
38  /* if RLE can encode the next block better than as a raw block,
39  * back up and leave _all_ the identical pixels for RLE */
40  count --;
41  }
42  break;
43  }
44  }
45 
46  return count;
47 }
48 
49 int ff_rle_encode(uint8_t *outbuf, int out_size, const uint8_t *ptr , int bpp, int w,
50  int add_rep, int xor_rep, int add_raw, int xor_raw)
51 {
52  int count, x;
53  uint8_t *out = outbuf;
54 
55  for(x = 0; x < w; x += count) {
56  /* see if we can encode the next set of pixels with RLE */
57  if ((count = ff_rle_count_pixels(ptr, w - x, bpp, 1)) > 1) {
58  if(out + bpp + 1 > outbuf + out_size) return -1;
59  *out++ = (count ^ xor_rep) + add_rep;
60  memcpy(out, ptr, bpp);
61  out += bpp;
62  } else {
63  /* fall back on uncompressed */
64  count = ff_rle_count_pixels(ptr, w - x, bpp, 0);
65  if(out + bpp*count >= outbuf + out_size) return -1;
66  *out++ = (count ^ xor_raw) + add_raw;
67 
68  memcpy(out, ptr, bpp * count);
69  out += bpp * count;
70  }
71 
72  ptr += count * bpp;
73  }
74 
75  return out - outbuf;
76 }
int ff_rle_count_pixels(const uint8_t *start, int len, int bpp, int same)
Count up to 127 consecutive pixels which are either all the same or all differ from the previous and ...
Definition: rle.c:25
uint8_t
int out_size
Definition: movenc-test.c:55
GLsizei count
Definition: opengl_enc.c:109
#define FFMIN(a, b)
Definition: common.h:96
FILE * out
Definition: movenc-test.c:54
Libavcodec external API header.
common internal and external API header
int len
void INT64 start
Definition: avisynth_c.h:553
int ff_rle_encode(uint8_t *outbuf, int out_size, const uint8_t *ptr, int bpp, int w, int add_rep, int xor_rep, int add_raw, int xor_raw)
RLE compress the row, with maximum size of out_size.
Definition: rle.c:49