mirror of
https://github.com/simtactics/niotso.git
synced 2025-03-22 10:52:20 +00:00
351 lines
No EOL
12 KiB
C
351 lines
No EOL
12 KiB
C
/*
|
|
chunks.c - Copyright (c) 2012 Fatbag <X-Fi6@phppoll.org>
|
|
|
|
Permission to use, copy, modify, and/or distribute this software for any
|
|
purpose with or without fee is hereby granted, provided that the above
|
|
copyright notice and this permission notice appear in all copies.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <stdint.h>
|
|
#include "iff.h"
|
|
|
|
/* All chunk-parsing functions */
|
|
static int iff_parse_rsmp(IFFChunk * ChunkInfo, const uint8_t * Buffer, unsigned IFFSize);
|
|
static int iff_parse_bcon(IFFChunk * ChunkInfo, const uint8_t * Buffer);
|
|
static int iff_parse_str(IFFChunk * ChunkInfo, const uint8_t * Buffer);
|
|
static int iff_parse_trcn(IFFChunk * ChunkInfo, const uint8_t * Buffer);
|
|
|
|
int iff_parse_chunk(IFFChunk * ChunkInfo, const uint8_t * Buffer){
|
|
unsigned i;
|
|
const char chunktypes[] =
|
|
"STR#" "CTSS" "FAMs" "TTAs"
|
|
"BCON"
|
|
"TRCN"
|
|
;
|
|
int (* const iff_parse_function[])(IFFChunk*, const uint8_t*) = {
|
|
iff_parse_str, iff_parse_str, iff_parse_str, iff_parse_str,
|
|
iff_parse_bcon,
|
|
iff_parse_trcn
|
|
};
|
|
|
|
for(i=0; chunktypes[i*4] != '\0'; i++){
|
|
if(!memcmp(ChunkInfo->Type, chunktypes+i*4, 4))
|
|
return iff_parse_function[i](ChunkInfo, Buffer);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static int iff_parse_rsmp(IFFChunk * ChunkInfo, const uint8_t * Buffer, unsigned IFFSize){
|
|
return 1;
|
|
}
|
|
|
|
static int iff_parse_bcon(IFFChunk * ChunkInfo, const uint8_t * Buffer){
|
|
IFF_BCON *BCONData;
|
|
unsigned Size = ChunkInfo->Size - 76;
|
|
unsigned i;
|
|
|
|
if(Size < 2)
|
|
return 0;
|
|
ChunkInfo->FormattedData = malloc(sizeof(IFF_BCON));
|
|
if(ChunkInfo->FormattedData == NULL)
|
|
return 0;
|
|
|
|
BCONData = (IFF_BCON*) ChunkInfo->FormattedData;
|
|
BCONData->ConstantCount = read_uint8le(Buffer);
|
|
BCONData->Flags = read_uint8le(Buffer + 1);
|
|
if(BCONData->ConstantCount == 0)
|
|
return 1;
|
|
if(BCONData->ConstantCount * 2 > Size - 2){
|
|
free(BCONData);
|
|
return 0;
|
|
}
|
|
|
|
BCONData->Constants = malloc(BCONData->ConstantCount * sizeof(uint16_t));
|
|
if(BCONData->Constants == NULL){
|
|
free(BCONData);
|
|
return 0;
|
|
}
|
|
|
|
Buffer += 2;
|
|
for(i=0; i<BCONData->ConstantCount; i++, Buffer += 2)
|
|
BCONData->Constants[i] = read_uint16le(Buffer);
|
|
return 1;
|
|
}
|
|
|
|
static int iff_parse_str(IFFChunk * ChunkInfo, const uint8_t * Buffer){
|
|
/* No bounds checking yet */
|
|
IFF_STR * StringData;
|
|
unsigned Size = ChunkInfo->Size - 76;
|
|
|
|
if(Size < 2)
|
|
return 0;
|
|
ChunkInfo->FormattedData = malloc(sizeof(IFF_STR));
|
|
if(ChunkInfo->FormattedData == NULL)
|
|
return 0;
|
|
|
|
StringData = (IFF_STR*) ChunkInfo->FormattedData;
|
|
memset(StringData, 0, sizeof(IFF_STR));
|
|
StringData->Format = read_int16le(Buffer);
|
|
Buffer += 2;
|
|
if(Size-2 < 2) /* TSO allows this; as seen in the animations chunk in personglobals.iff */
|
|
return 1;
|
|
|
|
switch(StringData->Format){
|
|
|
|
case 0: {
|
|
unsigned i;
|
|
IFFStringPairNode * PrevPair = NULL;
|
|
|
|
StringData->LanguageSets[0].PairCount = read_uint16le(Buffer);
|
|
Buffer += 2;
|
|
if(StringData->LanguageSets[0].PairCount == 0)
|
|
return 1;
|
|
|
|
for(i=0; i<StringData->LanguageSets[0].PairCount; i++){
|
|
IFFStringPairNode * CurrentPair;
|
|
unsigned length;
|
|
CurrentPair = malloc(sizeof(IFFStringPairNode));
|
|
memset(CurrentPair, 0, sizeof(IFFStringPairNode));
|
|
|
|
if(i == 0) StringData->LanguageSets[0].FirstPair = CurrentPair;
|
|
else PrevPair->NextPair = CurrentPair;
|
|
CurrentPair->PrevPair = PrevPair;
|
|
|
|
/* Key */
|
|
length = read_uint8le(Buffer);
|
|
if(length != 0){
|
|
CurrentPair->Pair.Key = malloc(length+1);
|
|
memcpy(CurrentPair->Pair.Key, Buffer+1, length);
|
|
CurrentPair->Pair.Key[length] = 0x00;
|
|
}
|
|
Buffer += length+1;
|
|
|
|
PrevPair = CurrentPair;
|
|
}
|
|
StringData->LanguageSets[0].LastPair = PrevPair;
|
|
} return 1;
|
|
|
|
case -1: {
|
|
unsigned i;
|
|
IFFStringPairNode * PrevPair = NULL;
|
|
|
|
StringData->LanguageSets[0].PairCount = read_uint16le(Buffer);
|
|
Buffer += 2;
|
|
if(StringData->LanguageSets[0].PairCount == 0)
|
|
return 1;
|
|
|
|
for(i=0; i<StringData->LanguageSets[0].PairCount; i++){
|
|
IFFStringPairNode * CurrentPair;
|
|
unsigned length;
|
|
CurrentPair = malloc(sizeof(IFFStringPairNode));
|
|
memset(CurrentPair, 0, sizeof(IFFStringPairNode));
|
|
|
|
if(i == 0) StringData->LanguageSets[0].FirstPair = CurrentPair;
|
|
else PrevPair->NextPair = CurrentPair;
|
|
CurrentPair->PrevPair = PrevPair;
|
|
|
|
/* Key */
|
|
length = strlen((char*)Buffer);
|
|
if(length != 0){
|
|
CurrentPair->Pair.Key = malloc(length+1);
|
|
strcpy(CurrentPair->Pair.Key, (char*)Buffer);
|
|
}
|
|
Buffer += length+1;
|
|
|
|
PrevPair = CurrentPair;
|
|
}
|
|
StringData->LanguageSets[0].LastPair = PrevPair;
|
|
} return 1;
|
|
|
|
case -2: {
|
|
unsigned i;
|
|
IFFStringPairNode * PrevPair = NULL;
|
|
|
|
StringData->LanguageSets[0].PairCount = read_uint16le(Buffer);
|
|
Buffer += 2;
|
|
if(StringData->LanguageSets[0].PairCount == 0)
|
|
return 1;
|
|
|
|
for(i=0; i<StringData->LanguageSets[0].PairCount; i++){
|
|
IFFStringPairNode * CurrentPair;
|
|
unsigned length;
|
|
CurrentPair = malloc(sizeof(IFFStringPairNode));
|
|
memset(CurrentPair, 0, sizeof(IFFStringPairNode));
|
|
|
|
if(i == 0) StringData->LanguageSets[0].FirstPair = CurrentPair;
|
|
else PrevPair->NextPair = CurrentPair;
|
|
CurrentPair->PrevPair = PrevPair;
|
|
|
|
/* Key */
|
|
length = strlen((char*)Buffer);
|
|
if(length != 0){
|
|
CurrentPair->Pair.Key = malloc(length+1);
|
|
strcpy(CurrentPair->Pair.Key, (char*)Buffer);
|
|
}
|
|
Buffer += length+1;
|
|
|
|
/* Value */
|
|
length = strlen((char*)Buffer);
|
|
if(length != 0){
|
|
CurrentPair->Pair.Value = malloc(length+1);
|
|
strcpy(CurrentPair->Pair.Value, (char*)Buffer);
|
|
}
|
|
Buffer += length+1;
|
|
|
|
PrevPair = CurrentPair;
|
|
}
|
|
StringData->LanguageSets[0].LastPair = PrevPair;
|
|
} return 1;
|
|
|
|
case -3: {
|
|
unsigned i, TotalPairCount;
|
|
|
|
TotalPairCount = read_uint16le(Buffer);
|
|
Buffer += 2;
|
|
if(TotalPairCount == 0)
|
|
return 1;
|
|
|
|
for(i=0; i<TotalPairCount; i++){
|
|
IFFStringPairNode * Pair;
|
|
unsigned length;
|
|
Pair = malloc(sizeof(IFFStringPairNode));
|
|
memset(Pair, 0, sizeof(IFFStringPairNode));
|
|
Pair->Pair.LanguageSet = read_uint8le(Buffer) - 1;
|
|
Buffer++;
|
|
|
|
/* Key */
|
|
length = strlen((char*)Buffer);
|
|
if(length != 0){
|
|
Pair->Pair.Key = malloc(length+1);
|
|
strcpy(Pair->Pair.Key, (char*)Buffer);
|
|
}
|
|
Buffer += length+1;
|
|
|
|
/* Value */
|
|
length = strlen((char*)Buffer);
|
|
if(length != 0){
|
|
Pair->Pair.Value = malloc(length+1);
|
|
strcpy(Pair->Pair.Value, (char*)Buffer);
|
|
}
|
|
Buffer += length+1;
|
|
|
|
/* Add the pair to the end of the associated language set */
|
|
Pair->PrevPair = StringData->LanguageSets[0].LastPair;
|
|
if(StringData->LanguageSets[0].PairCount == 0)
|
|
StringData->LanguageSets[0].FirstPair = Pair;
|
|
else
|
|
StringData->LanguageSets[0].LastPair->NextPair = Pair;
|
|
StringData->LanguageSets[0].PairCount++;
|
|
StringData->LanguageSets[0].LastPair = Pair;
|
|
}
|
|
} return 1;
|
|
|
|
case -4: {
|
|
unsigned LanguageSet;
|
|
unsigned LanguageSetCount = read_uint8le(Buffer);
|
|
Buffer++;
|
|
if(LanguageSetCount > 20) LanguageSetCount = 20;
|
|
|
|
for(LanguageSet=0; LanguageSet<LanguageSetCount; LanguageSet++){
|
|
unsigned i;
|
|
IFFStringPairNode * PrevPair = NULL;
|
|
|
|
StringData->LanguageSets[LanguageSet].PairCount = read_uint16le(Buffer);
|
|
Buffer += 2;
|
|
if(StringData->LanguageSets[LanguageSet].PairCount == 0)
|
|
continue;
|
|
|
|
for(i=0; i<StringData->LanguageSets[LanguageSet].PairCount; i++){
|
|
IFFStringPairNode * CurrentPair;
|
|
unsigned length;
|
|
CurrentPair = malloc(sizeof(IFFStringPairNode));
|
|
memset(CurrentPair, 0, sizeof(IFFStringPairNode));
|
|
|
|
if(i == 0) StringData->LanguageSets[LanguageSet].FirstPair = CurrentPair;
|
|
else PrevPair->NextPair = CurrentPair;
|
|
CurrentPair->PrevPair = PrevPair;
|
|
|
|
Buffer++; /* Skip over LanguageSet */
|
|
|
|
/* Key */
|
|
length = read_uint8le(Buffer);
|
|
if(length > 127){
|
|
length = (length & 127) | (read_uint8le(Buffer+1) << 7);
|
|
Buffer++;
|
|
}
|
|
if(length != 0){
|
|
CurrentPair->Pair.Key = malloc(length+1);
|
|
memcpy(CurrentPair->Pair.Key, Buffer+1, length);
|
|
CurrentPair->Pair.Key[length] = 0x00;
|
|
}
|
|
Buffer += length + 1;
|
|
|
|
/* Value */
|
|
length = read_uint8le(Buffer);
|
|
if(length > 127){
|
|
length = (length & 127) | (read_uint8le(Buffer+1) << 7);
|
|
Buffer++;
|
|
}
|
|
if(length != 0){
|
|
CurrentPair->Pair.Value = malloc(length+1);
|
|
memcpy(CurrentPair->Pair.Value, Buffer+1, length);
|
|
CurrentPair->Pair.Value[length] = 0x00;
|
|
}
|
|
Buffer += length + 1;
|
|
|
|
PrevPair = CurrentPair;
|
|
}
|
|
StringData->LanguageSets[LanguageSet].LastPair = PrevPair;
|
|
}
|
|
} return 1;
|
|
|
|
}
|
|
|
|
free(ChunkInfo->FormattedData);
|
|
return 0;
|
|
}
|
|
|
|
static int iff_parse_trcn(IFFChunk * ChunkInfo, const uint8_t * Buffer){
|
|
IFF_TRCN * TRCNData;
|
|
unsigned Size = ChunkInfo->Size - 76;
|
|
unsigned i;
|
|
|
|
if(Size < 16)
|
|
return 0;
|
|
ChunkInfo->FormattedData = malloc(sizeof(IFF_TRCN));
|
|
if(ChunkInfo->FormattedData == NULL)
|
|
return 0;
|
|
|
|
TRCNData = (IFF_TRCN*) ChunkInfo->FormattedData;
|
|
TRCNData->Reserved = read_uint32le(Buffer+0);
|
|
TRCNData->Version = read_uint32le(Buffer+4);
|
|
memcpy(TRCNData->MagicNumber, Buffer+8, 4);
|
|
TRCNData->MagicNumber[4] = 0x00;
|
|
TRCNData->EntryCount = read_uint32le(Buffer+12);
|
|
|
|
if(TRCNData->Reserved != 0 || TRCNData->Version > 2 || strcmp(TRCNData->MagicNumber, "NCRT")){
|
|
free(TRCNData);
|
|
return 0;
|
|
}
|
|
ChunkInfo->FormattedData = malloc(TRCNData->EntryCount * sizeof(IFFRangePair));
|
|
if(ChunkInfo->FormattedData == NULL){
|
|
free(TRCNData);
|
|
return 0;
|
|
}
|
|
|
|
Buffer += 16;
|
|
for(i=0; i<TRCNData->EntryCount; i++){/*
|
|
IsUnused = read_uint32le(Buffer+0);
|
|
Unknown = read_uint32le(Buffer+4);*/
|
|
}
|
|
} |