the file uses the zlib compression, that's clear. what is not clear is why it's composed by 2 zipped blocks that don't have much sense if you look at their size because the size specified in the two 32bit values at the beginning is the total size (so the total compressed and uncompressed size withou...

@fatduck
I have just added the -D option which uses the decimal notation internally in quickbms so your doubt problem be solved.

well done chrrox and just in time for the new version of QuickBMS with (experimental) support for the recursive functions :)

new version of quickbms just released with (experimental) support for recursive function. I have tested it with the 2 files you provided and worked perfectly so get the script and the new version and test also the other files: http://aluigi.org/papers/bms/thevoid.bms http://aluigi.org/papers.htm#qui...

the archive of that game is horrible, it's composed by various chunks but the PNTR one is not like the others... blah

considering that the coefficient is not known and so the result is noisy it's not much useful to play it. anyway it's necessary to add the header to the file for then passing it to vgmstream. exists a graphical tool for creating the needed GENH header (http://www.hcs64.com/manakoAT/genh_creator.html...

the bms language is not good for recursive formats like this one

ops I forgot that :) uhmmm I could add an option for that (an option and not a command for not creating too much custom commands outside the BMS language). practically internally quickbms converts all the numbers in 0xhexadecimal because it's more useful during scripts debugging so, yes, if necessar...

new version out :)

about FindLoc I have opted for the additional argument after the file number. practically if you specify -1 after the filenumber that value will be assigned to the variable if the string is not found, example: FindLoc OFFSET string "FatduckFile" 0 "bad_luck_man" if OFFSET == &quo...

in reality it's more easy than how much it looks. practically the info table (name table or how you want to call it) is obfuscated with a simple algorithm which uses the length of the table as key, in C it looks like: void func(unsigned char *data, int datalen) { int i; unsigned char a, c, d; a = da...

the value that I would assign to the destination variable is not found is "" so that it's enough to use the following example: findloc OFFSET string "FatduckFile" if OFFSET == "" cleanexit # or anything else you want to do when the end of the file is reached endif but t...

job done but at the moment the function used in the script is implemented only in the beta that I will release in these days. so for the moment I show the script (which is enough slow unfortunately) and when the new version of quickbms will be out you will be able to use it: # Tibet Quest # script f...

for the previous post of chrrox: uhmmm simple solution but it's not logical (because at that returned offset is not located the searched string) and still incompatible with the current findloc standard behaviour. while for the current one: modifying the input file manually is definitely not a good s...

I understand, practically you use the location of the next "FatduckFile" to calculate the size of the previous one... uhmmm yeah without knowing if there is another FatduckFile is available you can do nothing. anyway the action in case findloc doesn't find the searched string is the termin...