Nabble - xine-codec-devel

Re: Looking for codec for mutiple description video coding

2007-12-14T09:19:51Z

Chen Tan wrote:
> xine-codec-devel，您好！
> I am looking out for a MDC codec.
> Any information will be of great help.

I have never heard of this codec. A Google search produces pages of more
people asking for the codec. Do you have samples encoded in this format?

--
-Mike Melanson

-------------------------------------------------------------------------
SF.Net email is sponsored by:
Check out the new SourceForge.net Marketplace.
It's the best place to buy or sell services
for just about anything Open Source.
http://ad.doubleclick.net/clk;164216239;13503038;w?http://sf.net/marketplace
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

Looking for codec for mutiple description video coding

2007-12-14T04:37:57Z

xine-codec-devel，您好！
I am looking out for a MDC codec.
Any information will be of great help.
thanks 　　

　　　　　　　　　　　　　　Chen Tan
　　　　　　　　　　　　　　chentan@...
　　　　　　　　　　　　　　　　　2007-12-14

-------------------------------------------------------------------------
SF.Net email is sponsored by:
Check out the new SourceForge.net Marketplace.
It's the best place to buy or sell services
for just about anything Open Source.
http://ad.doubleclick.net/clk;164216239;13503038;w?http://sf.net/marketplace
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

Re: Mine type: audio/vnd.octel.sbc

2007-11-18T08:33:43Z

On Mon, 2007-11-12 at 17:18 +0000, James Courtier-Dutton wrote:

> Benjamin Larsson wrote:
> > James Courtier-Dutton wrote:
> >
> >> Hi,
> >>
> >> Are there any linux programs that can play this audio format?
> >> It is used on mobile phone messaging systems. E.g. vodafone.net in the UK.
> >>
> >> audio/vnd.octel.sbc
> >>
> >>
> >>
> >
> > It could be the same as Lernout & Hauspie SBC. Please supply a sample.
> >
> > MvH
> > Benjamin Larsson
> >
> >
> >
>
> See attachments.
> the .sbc file, and a .wav of the same sound.

This is similar to what Vodafone Hungary uses. It is definitely not the
Blutooth SBC as that has a syncword 0x9C as the first byte, neither your
or my sample contain that.

Here is what I have found out:
http://wiki.multimedia.cx/index.php?title=Octel_SBC

--
Alex

-------------------------------------------------------------------------
This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2005.
http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

Re: Mine type: audio/vnd.octel.sbc

2007-11-12T09:18:44Z

Benjamin Larsson wrote:

> James Courtier-Dutton wrote:
>
>> Hi,
>>
>> Are there any linux programs that can play this audio format?
>> It is used on mobile phone messaging systems. E.g. vodafone.net in the UK.
>>
>> audio/vnd.octel.sbc
>>
>>
>>
>
> It could be the same as Lernout & Hauspie SBC. Please supply a sample.
>
> MvH
> Benjamin Larsson
>
>
>

See attachments.
the .sbc file, and a .wav of the same sound.

-------------------------------------------------------------------------
This SF.net email is sponsored by: Splunk Inc.
Still grepping through log files to find problems? Stop.
Now Search log events and configuration files using AJAX and a browser.
Download your FREE copy of Splunk now >> http://get.splunk.com/
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

music.sbc (54K) Download Attachment
music.wav (218K) Download Attachment

Re: Mine type: audio/vnd.octel.sbc

2007-11-12T03:04:31Z

James Courtier-Dutton wrote:
> Hi,
>
> Are there any linux programs that can play this audio format?
> It is used on mobile phone messaging systems. E.g. vodafone.net in the UK.
>
> audio/vnd.octel.sbc
>
>

It could be the same as Lernout & Hauspie SBC. Please supply a sample.

MvH
Benjamin Larsson

-------------------------------------------------------------------------
This SF.net email is sponsored by: Splunk Inc.
Still grepping through log files to find problems? Stop.
Now Search log events and configuration files using AJAX and a browser.
Download your FREE copy of Splunk now >> http://get.splunk.com/
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

Mine type: audio/vnd.octel.sbc

2007-11-11T13:28:49Z

Hi,

Are there any linux programs that can play this audio format?
It is used on mobile phone messaging systems. E.g. vodafone.net in the UK.

audio/vnd.octel.sbc

-------------------------------------------------------------------------
This SF.net email is sponsored by: Splunk Inc.
Still grepping through log files to find problems? Stop.
Now Search log events and configuration files using AJAX and a browser.
Download your FREE copy of Splunk now >> http://get.splunk.com/
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

Looking for tips on reverse engineering unknown audio formats

2007-03-05T19:36:58Z

I have a game (Electronic Arts Command & Conquer 3) which is using a custom
audio format. There is a 16 byte header attached with (among other things)
a sample rate of 48000 (on the sample files we are looking at) in it as
well as a field that corresponds to the size in bytes of the followed by
the actual audio data. I have tried to import it into a wave editor with
"import raw" using all kinds of options (raw audio, ADPCM etc), none of
which seem to produce anything other than noise.

It looks like the actual audio data is broken up in to 76 byte blocks, with
a 16 byte header of some kind being used as input into the codec with a 60
byte block of actual sample data. The decoded audio data is 2 bytes per
sample, with 80 samples for each of 2 channels in every 60 byte block (i.e.
512 bytes of decoded data). Further analysis has not been possible because
the decode function is highly convoluted and is using MMX/SSE (something I
have no knowledge about)

There is mention of "this game uses MP3 technology" in the readme file but
I don't believe these particular audio files are MP3 compressed

Does anyone have any tips how to figure out what sort of audio it is?
Would it be worth my time making samples files encoded with this codec
available? (for one of the sample archives that seem to be floating around
for example)

-------------------------------------------------------------------------
Take Surveys. Earn Cash. Influence the Future of IT
Join SourceForge.net's Techsay panel and you'll get the chance to share your
opinions on IT & business topics through brief surveys-and earn cash
http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

Who was making that midi decoder?

2006-09-03T19:42:31Z

I'm trying to figure out where things are in terms of making a midi
decoder for xine lib.

I remember somebody once said on this list (or another xine list) that
they were making a midi decoder for xine lib.

Does anybody know who is making that midi decoder?

--
-TwoEyedHuman
tech support d00d at Glenkirk
www.glenkirk.org <http://www.glenkirk.org>
my home: greenguy41.csoft.net <http://greenguy41.csoft.net>
linux user 396666

-------------------------------------------------------------------------
Using Tomcat but need to do more? Need to support web services, security?
Get stuff done quickly with pre-integrated technology to make your job easier
Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo
http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

Re: WMV3 VfW Decoder?

2006-08-29T00:10:45Z

Hi.

Kostya skrev:
> Hello, does anybody know if $subj exists at all?
> If so, please point to it, I need it to make my decoder work
> with old WMV9 samples (and possibly also reverse-engineer those
> J-frames from WMV2/8, they are related).
>
> I tried Linspire libwmv3.so but it looks not supporting them and
> DMO decoder is too hard to me - I got lost in those COM interfaces.
>
>
http://www.microsoft.com/japan/windows/windowsmedia/9series/codecs/vcm.aspx

Is that what you are searching for ?

MvH
Benjamin Larsson

-------------------------------------------------------------------------
Using Tomcat but need to do more? Need to support web services, security?
Get stuff done quickly with pre-integrated technology to make your job easier
Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo
http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

WMV3 VfW Decoder?

2006-08-28T22:24:28Z

Hello, does anybody know if $subj exists at all?
If so, please point to it, I need it to make my decoder work
with old WMV9 samples (and possibly also reverse-engineer those
J-frames from WMV2/8, they are related).

I tried Linspire libwmv3.so but it looks not supporting them and
DMO decoder is too hard to me - I got lost in those COM interfaces.

-------------------------------------------------------------------------
Using Tomcat but need to do more? Need to support web services, security?
Get stuff done quickly with pre-integrated technology to make your job easier
Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo
http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

Re: codecs for amd64?

2006-08-05T14:52:25Z

On Sat, Aug 05, 2006 at 10:28:58PM +0200, Pool, LC, Mr <14117614@...> wrote:
>
> [..] I'm not a windows user [..]

.. but you send mails with Exchange ..

> Now the question is:
>
> 1.) Why is there no development of win64 codecs for linux?
>
> 2.) How can I get the source for myself and compile the 64-bit dll's myself?
>
> I love xine, and I do from time to time use mplayer...

Time to compile a CVS snapshot of xine or a Subversion snapshot of
MPlayer. You should have a pleasant surprise.

Diego

-------------------------------------------------------------------------
Take Surveys. Earn Cash. Influence the Future of IT
Join SourceForge.net's Techsay panel and you'll get the chance to share your
opinions on IT & business topics through brief surveys -- and earn cash
http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

codecs for amd64?

2006-08-05T14:28:58Z

Hi...

I'm a debian user and my distro is a "pure" 64-bit. As I've found out, my 64-bit machine cannot play win32 codecs, or specifically wmv codecs.

Now normally this is not a problem, but the fact that I've got some assignments that require the use of a win32 wmv player. I'm not a windows user, and the debian work around of using chroot and basically having two OS's running on one machine is not really what I had in mind in buying a 64-bit machine.

Now the question is:

1.) Why is there no development of win64 codecs for linux?

2.) How can I get the source for myself and compile the 64-bit dll's myself?

I love xine, and I do from time to time use mplayer...

Any help on this matter would be greatly appreciated.

What I've done so far is to recompile xine to 32-bit and run this in a chroot 32-it environment.
This means my system is not really configured properly and I have trouble now with getting regular updates from my mirror, here at uni...

Thanks for the time...

He who has a why to live can bear with almost any how.
Friedrich Nietzsche

-------------------------------------------------------------------------
Take Surveys. Earn Cash. Influence the Future of IT
Join SourceForge.net's Techsay panel and you'll get the chance to share your
opinions on IT & business topics through brief surveys -- and earn cash
http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

Re: TrueSpeech

2005-12-27T10:29:03Z

Kostya wrote:

> Here is my implementation of DSP Group TrueSpeech decoder. It is not
> ideal, still something can be heard. Decoder decodes stream.dump (can
> be created with mplayer -dumpaudio) into decoded.raw (raw format, 8000
> Hz, 16-bit, mono). Compile with "gcc ts_decoder.c"
> Please look into code and point to similar functions in other codecs
> (I suspect something is wrong in my Correlate() function and somewhere
> else too). Thanks.

Hi, do you have any samples and the dll used ? A debug run with Ollydbg
should weed out some of the bugs.

MvH
Benjamin Larsson

--
"incorrect information" is an oxymoron. Information is, by definition, factual, correct.

-------------------------------------------------------
This SF.net email is sponsored by: Splunk Inc. Do you grep through log files
for problems? Stop! Download the new AJAX search engine that makes
searching your log files as easy as surfing the web. DOWNLOAD SPLUNK!
http://ads.osdn.com/?ad_id=7637&alloc_id=16865&op=click
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

TrueSpeech

2005-12-26T20:24:55Z

Here is my implementation of DSP Group TrueSpeech decoder. It is not
ideal, still something can be heard. Decoder decodes stream.dump (can be
created with mplayer -dumpaudio) into decoded.raw (raw format, 8000 Hz,
16-bit, mono). Compile with "gcc ts_decoder.c"
Please look into code and point to similar functions in other codecs (I
suspect something is wrong in my Correlate() function and somewhere else
too). Thanks.

true_speech.tgz (6K) Download Attachment

Re: Table extractor tool

2005-12-21T13:55:27Z

Michael Niedermayer wrote:

> Hi
>
> On Tue, Dec 20, 2005 at 07:55:44PM +0000, Benjamin Larsson wrote:
>
>>Hi, I have meant to release this tool for some time now but I've been
>>lazy. Anyway it's called elftractor and can extract tables from elf
>>executables with the info from the symbol tables. To use it just run it
>
>
> hmm, that remainds me of my vlc-leech tool which will search for vlc and
> scantables bruteforce style, it will find plenty of false positives and is
> slow but maybe its usefull for someone

Sounds like a good topic for a blog post...
--
-Mike Melanson

-------------------------------------------------------
This SF.net email is sponsored by: Splunk Inc. Do you grep through log files
for problems? Stop! Download the new AJAX search engine that makes
searching your log files as easy as surfing the web. DOWNLOAD SPLUNK!
http://ads.osdn.com/?ad_id=7637&alloc_id=16865&op=click
_______________________________________________
xine-codec-devel mailing list
xine-codec-devel@...
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

Re: Table extractor tool

2005-12-21T13:54:21Z

Hi

On Tue, Dec 20, 2005 at 07:55:44PM +0000, Benjamin Larsson wrote:
> Hi, I have meant to release this tool for some time now but I've been
> lazy. Anyway it's called elftractor and can extract tables from elf
> executables with the info from the symbol tables. To use it just run it

hmm, that remainds me of my vlc-leech tool which will search for vlc and
scantables bruteforce style, it will find plenty of false positives and is
slow but maybe its usefull for someone

[...]

--
Michael

/*
Copyright (C) 2004 Michael Niedermayer <michaelni@...>

This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <inttypes.h>

#define CODE_SPACE (1<<31)
#define MIN(a,b) ((a) < (b) ? (a) : (b))

const uint8_t ff_log2_tab[256]={
0,0,1,1,2,2,2,2,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,
5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7
};

static inline int log2(unsigned int v)
{
int n;

n = 0;
if (v & 0xffff0000) {
v >>= 16;
n += 16;
}
if (v & 0xff00) {
v >>= 8;
n += 8;
}
n += ff_log2_tab[v];

return n;
}

static int read_symbol(uint8_t *b, int size){
if(size==1)
return *b;
else if(size==2)
return *(uint16_t*)b;
else
return *(uint32_t*)b;
}

int main(int argc, char **argv){
FILE *f;
int filesize, size, start, step, index, temp, i;
int size2, start2, step2, index2, table_index;
int last_start, last_table_size, last_size;
uint8_t *buffer;
uint8_t len_table[100000];
int bits_table[100000];
int tables_found=0;

int min_code_count=8;
int max_code_len=31;

f= fopen(argv[1], "r");
if(f==NULL){
fprintf(stderr, "cant open\n");
return -1;
}
fseek(f, 0, SEEK_END);
filesize= ftell(f);
fseek(f, 0, SEEK_SET);
buffer= malloc(filesize);

if(1 != fread(buffer, filesize, 1, f)){
fprintf(stderr, "cant read\n");
return -1;
}

// scantables
for(start=0; start<filesize; start++){
for(size= 1; size <=4; size+=size){
for(size2=16; size2<=64; size2+=size2){
int row_size= size2 <= 16 ? 4 : 8;
uint8_t tab[64];
int trivial=1;
step= size;
memset(tab, 0, sizeof(tab));

if(filesize - start < size2*step)
continue;

for(table_index= 0; table_index<size2; table_index++){
unsigned int x= read_symbol(buffer+start+table_index*step, size);
if(x>=size2)
break;
if(x==0 && table_index!=0 && table_index!=8 && size2 == 16)
break;
if(x != table_index)
trivial=0;
tab[x]++;
if(tab[x] > 1)
break;
}
if(table_index<size2 || trivial)
continue;

printf("found possible %dx%d scantable at %X with %2dbit entries\n",
row_size, size2 / row_size,
start,
8*size
);

for(table_index= 0; table_index<size2; table_index++){
int x= read_symbol(buffer+start+table_index*step, size);

printf("%2d ", x);
if(table_index % row_size == row_size-1 || table_index+1 == size2)
printf("\n");
}
}
}
}

last_start= last_table_size= last_size=0;
for(start=0; start<filesize; start++){
for(size= 1; size <=4; size+=size){
step= size;
// for(step=size; step<=2*size; step+=size){ remove and add bit reversed indexing
int table_size;
for(table_size=16384; table_size>=16; table_size>>=1){
int last_x, run, count;
int min_len= 31;
int max_len= 1;

if(filesize - start < table_size*step)
continue;

count= 0;
run=1;
last_x= read_symbol(buffer+start, size);
for(table_index= 1; table_index<=table_size; table_index++){
int x= table_index<table_size ? read_symbol(buffer+start+table_index*step, size)
: last_x+1;

if(x == last_x){
run++;
}else{
int len;
if(run&(run-1))
break;
if(table_index % run)
break;

len= (int)log2(table_size/run);
len_table[count++]= len;
if(len < min_len) min_len= len;
if(len > max_len) max_len= len;
run=1;
last_x= x;
}
}
if(table_index<=table_size)
continue;

if(count<min_code_count)
continue;

if(count > table_size/2)
continue;

if(min_len == max_len) //flc
continue;

if(1<<max_len < table_size) //table could be 50% smaller
continue;

last_x= read_symbol(buffer+start, size);
for(table_index= 1; table_index<table_size; table_index++){
int x= read_symbol(buffer+start+table_index*step, size);

if(x != last_x){
for(i=0; i<table_index; i++){
int y= read_symbol(buffer+start+i*step, size);
if(y == x)
break;
}
if(i<table_index)
break;
}
last_x= x;
}
if(table_index<table_size)
continue;

if(last_start == start && last_table_size*last_size >= table_size*size) // same or smaller block with larger element size
continue;

printf("found possible vlc table at %X with %4d %2dbit entries (%3d unique), len=%d/%d id=%d\n",
start,
table_size,
8*size,
count,
min_len, max_len,
tables_found
);

for(table_index=0; table_index< count; table_index++){
int len= len_table[table_index];
printf("%3d ", len);
if(table_index % 8 == 7 || table_index+1 == count)
printf("\n");
}
for(table_index=0; table_index< table_size; table_index++){
int x= read_symbol(buffer+start+table_index*step, size);
printf("%8X ", x);
if(table_index % 8 == 7 || table_index+1 == table_size)
printf("\n");
}
last_start=start;
last_table_size= table_size;
last_size= size;
break;

}
}
}

//vlc
for(start=0; start<filesize; start++){
for(size= 1; size <=4; size+=size){
for(step=size; step<=2*size; step+=size){
int optimal_count=0;
int optimal_space, optimal_min_len, optimal_max_len, optimal_table_size, optimal_high_zero[2], optimal_skip_zero, table_index;
unsigned int code_space=0;
int count=0;
int max_len= 1;
int min_len= max_code_len;
int high_zero[2]= {1,1};
int skip_zero=1;
int stats[32];

for(index= start; index+size <= filesize; index+= step){
unsigned int len= read_symbol(buffer+index, size);
table_index= (index-start)/step;

len_table[table_index]= len;

if(step > size || read_symbol(buffer+index+size, size))
skip_zero=0;

if(len){
if(len > (unsigned)max_code_len)
break;

code_space += 1<<(31-len);
if(code_space > (unsigned)CODE_SPACE)
break;

if(len > max_len) max_len= len;
if(len < min_len) min_len= len;

high_zero[ table_index & 1 ]= 0;

temp= CODE_SPACE - code_space;
count++;
if(!(temp & (temp-1))){
optimal_count= count;
optimal_table_size= table_index+1;
optimal_space= temp;
optimal_min_len= min_len;
optimal_max_len= max_len;
optimal_high_zero[0]= high_zero[0];
optimal_high_zero[1]= high_zero[1];
optimal_skip_zero= skip_zero;
}
}else if(index == start)
break;
}
if(optimal_count < min_code_count)
continue;
if((unsigned)optimal_space > ((unsigned)CODE_SPACE)/(unsigned)optimal_count)
continue;
// if((unsigned)optimal_space > 1U<<(31-optimal_max_len)) //only single zero word
// continue;
// if(optimal_space)
// continue;
if(optimal_min_len == optimal_max_len) //constant style 2222
continue;
if(optimal_min_len+1 == optimal_max_len) //split constant style 333322
continue;
if(optimal_high_zero[0] || optimal_high_zero[1] || optimal_skip_zero)
continue;

memset(stats, 0, sizeof(stats));
for(i=0; i<optimal_table_size; i++){
int len= len_table[i];
stats[len]++;
if(stats[len] > 1 && len > 0 && len < optimal_max_len)
break;
if(stats[len] > 2 && len==optimal_max_len)
break;
}
if(i == optimal_table_size && optimal_min_len==1 && optimal_max_len==optimal_count) //monotone style 1234
continue;
// if(i == optimal_table_size && optimal_min_len==1 && optimal_max_len+1==optimal_count) //monotone style 12344
// continue;

tables_found++;

for(start2=0; start2<filesize; start2++){
for(size2= 1; size2 <=4; size2+=size2){
for(step2=size2; step2<=2*size2; step2+=size2){
if(size2*step != size*step2) // same interleave
continue;
if(step != size && step != step2) //if interleaved then step must be the same
continue;

if(filesize - start2 < optimal_table_size*step2)
continue;

for(table_index=0; table_index< optimal_table_size; table_index++){
unsigned int bits= read_symbol(buffer+start2+step2*table_index, size2);
int len= len_table[table_index];

bits_table[table_index]= bits;

if(bits >> len)
break;
if(optimal_space && bits == 0) //zero code in zeroless table
break;
}
if(table_index < optimal_table_size)
continue;

for(table_index=0; table_index< optimal_table_size; table_index++){
unsigned int bits= read_symbol(buffer+start2+step2*table_index, size2);
int len= len_table[table_index];

for(i=0; i< table_index; i++){
unsigned int bits2= read_symbol(buffer+start2+step2*i, size2);
int min_len= MIN(len_table[table_index], len_table[i]);

if(min_len && bits>>(len - min_len) == bits2>>(len_table[i] - min_len))
break;
}
if(i<table_index)
break;
}
if(table_index < optimal_table_size)
continue;

printf("found possible %s vlc table at %X/%X with %3d %2d/%2dbit entries %f%% waste %d-%d len, id=%d\n",
optimal_space ? "zeroless" : "optimal",
start, start2,
optimal_count,
8*size, 8*size2,
optimal_space*100.0 / (float)((unsigned)CODE_SPACE),
optimal_min_len, optimal_max_len,
tables_found
);

for(table_index=0; table_index< optimal_table_size; table_index++){
int bits= bits_table[table_index];
int len= len_table[table_index];
printf("%3d ", len);
if(table_index % 8 == 7 || table_index+1 == optimal_table_size)
printf("\n");
}
for(table_index=0; table_index< optimal_table_size; table_index++){
int bits= bits_table[table_index];
int len= len_table[table_index];
printf("%8X ", bits);
if(table_index % 8 == 7 || table_index+1 == optimal_table_size)
printf("\n");
}
printf("\n");
}
}
}

}
}
}
}