[Ffmpeg-devel] [RFC] Fraps v2 support
Kostya
kostya.shishkov
Thu Nov 2 19:24:46 CET 2006
Please test if patch attached confirms to $subj. I have only a bit of one
sample here.
-------------- next part --------------
Index: libavcodec/fraps.c
===================================================================
--- libavcodec/fraps.c (revision 6830)
+++ libavcodec/fraps.c (working copy)
@@ -1,6 +1,7 @@
/*
* Fraps FPS1 decoder
* Copyright (c) 2005 Roine Gustafsson
+ * Copyright (c) 2006 Konstantin Shishkov
*
* This file is part of FFmpeg.
*
@@ -24,24 +25,39 @@
* @file fraps.c
* Lossless Fraps 'FPS1' decoder
* @author Roine Gustafsson <roine at users sf net>
+ * @author Konstantin Shishkov
*
* Only decodes version 0 and 1 files.
* Codec algorithm for version 0 is taken from Transcode <www.transcoding.org>
*
- * Version 2 files, which are the most commonly found Fraps files, cannot be
- * decoded yet.
+ * Version 2 files support by Konstantin Shishkov
*/
#include "avcodec.h"
#define FPS_TAG MKTAG('F', 'P', 'S', 'x')
+/* symbol for huffman tree node */
+#define HNODE -1
+
/**
+ * Huffman node
+ * FIXME one day this should belong to one general framework
+ */
+typedef struct Node{
+ int sym;
+ int count;
+ int n0;
+ int n1;
+}Node;
+
+/**
* local variable storage
*/
typedef struct FrapsContext{
AVCodecContext *avctx;
AVFrame frame;
+ Node nodes[512];
} FrapsContext;
@@ -64,8 +80,92 @@
return 0;
}
+/**
+ * Comparator - our nodes should ascend by count
+ * but with preserved symbol order
+ */
+static int huff_cmp(const Node *a, const Node *b){
+ if(a->count == b->count){
+ return (a->sym > b->sym) ? 1 : -1;
+ }
+ return (a->count > b->count) ? 1 : -1;
+}
/**
+ * decode Fraps v2 packed plane
+ */
+static int fraps2_decode_plane(FrapsContext *s, uint8_t *dst, int stride, int w,
+ int h, uint8_t *src, int size, int Uoff)
+{
+ int i, j;
+ Node tmp;
+ uint32_t bitbuf;
+ int bits = 0, b;
+ int curcode, cur_node;
+
+ for(i = 0; i < 256; i++){
+ s->nodes[i].sym = i;
+ s->nodes[i].count = LE_32(src);
+ s->nodes[i].n0 = s->nodes[i].n1 = -1;
+ src += 4;
+ }
+ size -= 1024;
+ qsort(s->nodes, 256, sizeof(Node), huff_cmp);
+ cur_node = 256;
+ // FIXME how it will handle nodes with zero count?
+ for(i = 0; i < 511; i += 2){
+ s->nodes[cur_node].sym = HNODE;
+ s->nodes[cur_node].count = s->nodes[i].count + s->nodes[i+1].count;
+ s->nodes[cur_node].n0 = i;
+ s->nodes[cur_node].n1 = i + 1;
+ for(j = cur_node; j > 0; j--){
+ if(s->nodes[j].count >= s->nodes[j - 1].count) break;
+ tmp = s->nodes[j];
+ s->nodes[j] = s->nodes[j - 1];
+ s->nodes[j - 1] = tmp;
+ }
+ cur_node++;
+ }
+ cur_node = 510; // for futher use in huffman decoding
+ /* we have built Huffman table and are ready to decode plane */
+ /* XXX this bitreader ignores every 32th bit so lavc bitreader cannot be used*/
+ bits = 0; bitbuf = 0;
+ for(j = 0; j < h; j++){
+ for(i = 0; i < w; i++){
+ /* get one huffman code */
+ curcode = cur_node;
+ while(s->nodes[curcode].sym == HNODE) {
+ /* get one bit */
+ if(!bits){
+ if(size <= 0){
+ av_log(s->avctx, AV_LOG_ERROR, "Code went out of bounds\n");
+ return -1;
+ }
+ bitbuf = LE_32(src);
+ bits = 32;
+ src += 4;
+ size -= 4;
+ }
+ bits--;
+ b = (bitbuf >> bits) & 1;
+ if(!b)
+ curcode = s->nodes[curcode].n0;
+ else
+ curcode = s->nodes[curcode].n1;
+ assert(curcode >= 0 && curcode <= s->cur_node);
+ }
+ dst[i] = s->nodes[curcode].sym;
+ /* we need to add 0x80 to the first line of the chroma planes */
+ if(!j && Uoff) dst[i] += 0x80;
+ /* lines are stored as deltas between previous line */
+ if(j) dst[i] += dst[i - stride];
+ }
+ dst += stride;
+ }
+ return 0;
+}
+
+/**
* decode a frame
* @param avctx codec context
* @param data output AVFrame
@@ -86,13 +186,15 @@
unsigned int x, y;
uint32_t *buf32;
uint32_t *luma1,*luma2,*cb,*cr;
+ uint32_t offs[3];
+ int i;
header = LE_32(buf);
version = header & 0xff;
header_size = (header & (1<<30))? 8 : 4; /* bit 30 means pad to 8 bytes */
- if (version > 1) {
+ if (version > 2) {
av_log(avctx, AV_LOG_ERROR,
"This file is encoded with Fraps version %d. " \
"This codec can only decode version 0 and 1.\n", version);
@@ -188,29 +290,51 @@
case 2:
/**
- * Fraps v2 sub-header description. All numbers are little-endian:
- * (this is all guesswork)
- *
- * 0: DWORD 'FPSx'
- * 4: DWORD 0x00000010 unknown, perhaps flags
- * 8: DWORD off_2 offset to plane 2
- * 12: DWORD off_3 offset to plane 3
- * 16: 256xDWORD freqtbl_1 frequency table for plane 1
- * 1040: plane_1
- * ...
- * off_2: 256xDWORD freqtbl_2 frequency table for plane 2
- * plane_2
- * ...
- * off_3: 256xDWORD freqtbl_3 frequency table for plane 3
- * plane_3
+ * Fraps v2 is Huffman-coded YUV420 planes
*/
- if ((BE_32(buf) != FPS_TAG)||(buf_size < (3*1024 + 8))) {
+ avctx->pix_fmt = PIX_FMT_YUV420P;
+ f->reference = 1;
+ f->buffer_hints = FF_BUFFER_HINTS_VALID |
+ FF_BUFFER_HINTS_PRESERVE |
+ FF_BUFFER_HINTS_REUSABLE;
+ if (avctx->reget_buffer(avctx, f)) {
+ av_log(avctx, AV_LOG_ERROR, "reget_buffer() failed\n");
+ return -1;
+ }
+ /* skip frame */
+ if(buf_size == 8) {
+ f->pict_type = FF_P_TYPE;
+ f->key_frame = 0;
+ break;
+ }
+ f->pict_type = FF_I_TYPE;
+ f->key_frame = 1;
+ if ((LE_32(buf) != FPS_TAG)||(buf_size < (3*1024 + 24))) {
av_log(avctx, AV_LOG_ERROR, "Fraps: error in data stream\n");
return -1;
}
-
- /* NOT FINISHED */
-
+ for(i = 0; i < 3; i++) {
+ offs[i] = LE_32(buf + 4 + i * 4);
+ if(offs[i] >= buf_size || (i && offs[i] <= offs[i - 1] + 1024)) {
+ av_log(avctx, AV_LOG_ERROR, "Fraps: plane %i offset is out of bounds\n", i);
+ return -1;
+ }
+ }
+ if(fraps2_decode_plane(s, f->data[0], f->linesize[0], avctx->width,
+ avctx->height, buf + offs[0], offs[1] - offs[0], 0) < 0) {
+ av_log(avctx, AV_LOG_ERROR, "Error decoding plane 0\n");
+ return -1;
+ }
+ if(fraps2_decode_plane(s, f->data[1], f->linesize[1], avctx->width/2,
+ avctx->height/2, buf + offs[1], offs[2] - offs[1], 1) < 0) {
+ av_log(avctx, AV_LOG_ERROR, "Error decoding plane 1\n");
+ return -1;
+ }
+ if(fraps2_decode_plane(s, f->data[2], f->linesize[1], avctx->width/2,
+ avctx->height/2, buf + offs[2], buf_size - offs[2], 1) < 0) {
+ av_log(avctx, AV_LOG_ERROR, "Error decoding plane 2\n");
+ return -1;
+ }
break;
}
More information about the ffmpeg-devel
mailing list