Mercurial > otakunoraifu
view scn2k/gandump.cc @ 54:d7cde171a1de
* scn2k_grp.cc now handles commands in a cleanier way \o/
* some cleaning
author | thib |
---|---|
date | Mon, 20 Apr 2009 16:18:55 +0000 |
parents | 15a18fbe6f21 |
children |
line wrap: on
line source
/* * Copyright (c) 2004-2006 Kazunori "jagarl" Ueno * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include <stdio.h> #include <string.h> char* ganname[6] = {"ptn", "x", "y", "time", "alpha", "?"}; int main(int argc, char** argv) { if (argc != 2) return NULL; FILE* f = fopen(argv[1],"rb"); if (f == NULL) return NULL; fseek(f, 0, 2); int sz = ftell(f); fseek(f, 0, SEEK_SET); char* buf = new char[sz]; char* bufo = buf; fread(buf, 1, sz, f); fclose(f); int i; for (i=0; i<16; i++) { printf("%02x ",int(buf[i])&0xff); } printf("\n"); buf += 16; printf("file '%s'\n",buf); buf += strlen(buf)+1; printf("N1 = %3d\n", *(int*)buf); buf += 4; int ptns = *(int*)buf; buf += 4; for (i=0; i<ptns; i++) { int j; printf("\tN2 = %3d\n",*(int*)buf); buf += 4; int n = *(int*)buf; buf += 4; for (j=0; j < n; j++) { printf("\t%3d: ",j); int k, d1, d2; for (k=0; k<6; k++) { d1 = *(int*)(buf+k*8); d2 = *(int*)(buf+k*8+4); if (d1 != 30100+k) printf("err: d1 %d\n",d1); printf("%s: %5d, ",ganname[k],d2); } printf("\n"); buf += 6*8; int d = *(int*)buf; buf += 4; if (d != 999999) printf("err: dd %d\n",d); } } if (buf != bufo+sz) { printf("orig sz %d read %d\n",sz,buf-bufo);} }