dfhack/examples/veinlook.cpp

544 lines
14 KiB
C++

#include <integers.h>
#include <string.h> // for memset
#include <string>
2010-02-19 17:12:55 -07:00
#include <fstream>
#include <iostream>
2010-02-19 17:12:55 -07:00
#include <iomanip>
#include <vector>
#include <map>
using namespace std;
#include <DFTypes.h>
#include <DFTileTypes.h>
#include <DFHackAPI.h>
#include <DFProcess.h>
#include <DFMemInfo.h>
using namespace DFHack;
#include <sstream>
#include <curses.h>
#include <stdlib.h>
#include <signal.h>
string error;
2010-02-18 18:48:03 -07:00
API * pDF = 0;
static void finish(int sig);
int gotoxy(int x, int y)
{
wmove(stdscr, y , x );
return 0;
}
int putch(int x, int y, int znak, int color)
{
attron(COLOR_PAIR(color));
mvwaddch(stdscr, y, x, znak);
attroff(COLOR_PAIR(color));
}
/*
enum TileClass
{
EMPTY,
WALL,
PILLAR,
FORTIFICATION,
STAIR_UP,
STAIR_DOWN,
STAIR_UPDOWN,
RAMP,
FLOOR,
TREE_DEAD,
TREE_OK,
SAPLING_DEAD,
SAPLING_OK,
SHRUB_DEAD,
SHRUB_OK,
BOULDER,
PEBBLES
};*/
int puttile(int x, int y, int tiletype, int color)
{
unsigned int znak;
switch(tileTypeTable[tiletype].c)
{
case EMPTY:
znak = ' ';
break;
case WALL:
case FORTIFICATION:
znak = '#';
break;
case PILLAR:
znak = 'O';
break;
case STAIR_DOWN:
znak = '>';
break;
case STAIR_UP:
znak = '<';
break;
case STAIR_UPDOWN:
znak = '=';
break;
case RAMP:
znak = '^';
break;
case FLOOR:
znak = '.';
break;
case TREE_DEAD:
case TREE_OK:
znak= 'Y';
break;
case SAPLING_DEAD:
case SAPLING_OK:
znak= 'i';
break;
case SHRUB_DEAD:
case SHRUB_OK:
znak= 'o';
break;
case BOULDER:
case PEBBLES:
znak= '*';
break;
}
attron(COLOR_PAIR(color));
mvwaddch(stdscr, y, x, znak);
attroff(COLOR_PAIR(color));
}
int cprintf(char *fmt, ...)
{
va_list ap;
va_start(ap, fmt);
int i = vwprintw(stdscr,fmt, ap);
va_end(ap);
return i;
}
void clrscr()
{
wbkgd(stdscr, COLOR_PAIR(COLOR_BLACK));
wclear(stdscr);
}
/*
enum TileMaterial
{
AIR,
SOIL,
STONE,
FEATSTONE, // whatever it is
OBSIDIAN,
VEIN,
ICE,
GRASS,
GRASS2,
GRASS_DEAD,
GRASS_DRY,
#include <DFProcess.h>
#include <DFProcess.h>
DRIFTWOOD,
HFS,
MAGMA,
CAMPFIRE,
FIRE,
ASHES,
CONSTRUCTED
};
*/
int pickColor(int tiletype)
{
switch(tileTypeTable[tiletype].m)
{
case AIR:
return COLOR_BLACK;
case STONE:
case FEATSTONE:
case OBSIDIAN:
case CONSTRUCTED:
case ASHES:
default:
return COLOR_WHITE;
case SOIL:
case GRASS_DEAD:
case GRASS_DRY:
case DRIFTWOOD:
return COLOR_YELLOW;
case ICE:
return COLOR_CYAN;
case VEIN:
return COLOR_MAGENTA;
case GRASS:
case GRASS2:
return COLOR_GREEN;
case HFS:
case MAGMA:
case CAMPFIRE:
case FIRE:
return COLOR_RED;
}
2010-02-18 18:48:03 -07:00
}
2010-02-19 17:12:55 -07:00
/*
address = absolute address of dump start
length = length in bytes
*/
void hexdump (DFHack::API& DF, uint32_t address, uint32_t length, int filenum)
2010-02-18 18:48:03 -07:00
{
2010-02-19 17:12:55 -07:00
uint32_t reallength;
uint32_t lines;
lines = (length / 16) + 1;
reallength = lines * 16;
char *buf = new char[reallength];
ofstream myfile;
stringstream ss;
ss << "hexdump" << filenum << ".txt";
string name = ss.str();
2010-02-19 17:12:55 -07:00
myfile.open (name.c_str());
DF.ReadRaw(address, reallength, (uint8_t *) buf);
for (int i = 0; i < lines; i++)
{
// leading offset
myfile << "0x" << hex << setw(4) << i*16 << " ";
// groups
for(int j = 0; j < 4; j++)
{
// bytes
for(int k = 0; k < 4; k++)
{
int idx = i * 16 + j * 4 + k;
myfile << hex << setw(2) << int(static_cast<unsigned char>(buf[idx])) << " ";
}
myfile << " ";
}
myfile << endl;
}
delete buf;
myfile.close();
}
2010-02-19 17:12:55 -07:00
main(int argc, char *argv[])
{
/* initialize your non-curses data structures here */
signal(SIGINT, finish); /* arrange interrupts to terminate */
initscr(); /* initialize the curses library */
keypad(stdscr, TRUE); /* enable keyboard mapping */
nonl(); /* tell curses not to do NL->CR/NL on output */
cbreak(); /* take input chars one at a time, no wait for \n */
noecho(); /* don't echo input */
//nodelay(stdscr, true);
int wxMax = getmaxx(stdscr);
int wyMax = getmaxy(stdscr);
keypad(stdscr, TRUE);
scrollok(stdscr, TRUE);
if (has_colors())
{
start_color();
/*
* Simple color assignment, often all we need.
*/
init_pair(COLOR_BLACK, COLOR_BLACK, COLOR_BLACK);
init_pair(COLOR_GREEN, COLOR_GREEN, COLOR_BLACK);
init_pair(COLOR_RED, COLOR_RED, COLOR_BLACK);
init_pair(COLOR_BLUE, COLOR_BLUE, COLOR_BLACK);
init_pair(COLOR_YELLOW, COLOR_YELLOW, COLOR_BLACK);
init_color(COLOR_CYAN, 700, 700, 700); // lt grey
init_color(COLOR_MAGENTA, 500, 500, 500); // dk grey
init_pair(COLOR_WHITE, COLOR_WHITE, COLOR_BLACK);
init_pair(COLOR_CYAN, COLOR_CYAN, COLOR_BLACK);
init_pair(COLOR_MAGENTA, COLOR_MAGENTA, COLOR_BLACK);
}
int x_max,y_max,z_max;
uint32_t x_max_a,y_max_a,z_max_a;
uint16_t tiletypes[16][16];
DFHack::t_designation designations[16][16];
uint8_t regionoffsets[16];
map <int16_t, uint32_t> materials;
materials.clear();
vector<DFHack::t_matgloss> stonetypes;
vector< vector <uint16_t> > layerassign;
vector<t_vein> veinVector;
vector<t_frozenliquidvein> IceVeinVector;
// init the API
DFHack::API DF("Memory.xml");
2010-02-18 18:48:03 -07:00
pDF = &DF;
// attach
if(!DF.Attach())
{
error = "Can't find DF.";
2010-02-18 18:48:03 -07:00
pDF = 0;
finish(0);
}
Process* p = DF.getProcess();
// init the map
2010-02-18 18:48:03 -07:00
if(!DF.InitMap())
{
error = "Can't find a map to look at.";
pDF = 0;
finish(0);
#include <DFMemInfo.h>
2010-02-18 18:48:03 -07:00
}
DF.getSize(x_max_a,y_max_a,z_max_a);
x_max = x_max_a;
y_max = y_max_a;
z_max = z_max_a;
// get stone matgloss mapping
if(!DF.ReadStoneMatgloss(stonetypes))
{
error = "Can't read stone types.";
2010-02-18 18:48:03 -07:00
pDF = 0;
finish(0);
}
2010-02-20 20:39:01 -07:00
vector <string> classes;
p->getDescriptor()->getClassIDMapping(classes);
// get region geology
if(!DF.ReadGeology( layerassign ))
{
error = "Can't read local geology.";
2010-02-18 18:48:03 -07:00
pDF = 0;
finish(0);
}
// FIXME: could fail on small forts
int cursorX = x_max/2 - 1;
int cursorY = y_max/2 - 1;
int cursorZ = z_max/2 - 1;
2010-02-19 17:12:55 -07:00
bool dig = false;
bool dump = false;
bool digbit = false;
int vein = 0;
2010-02-19 17:12:55 -07:00
int filenum = 0;
bool dirtybit = false;
2010-02-19 17:12:55 -07:00
uint32_t blockaddr = 0;
// walk the map!
for (;;)
{
2010-02-19 17:12:55 -07:00
dig = false;
dump = false;
digbit = false;
2010-02-18 18:48:03 -07:00
DF.Resume();
int c = getch(); /* refresh, accept single keystroke of input */
clrscr();
/* process the command keystroke */
switch(c)
{
case KEY_DOWN:
cursorY ++;
break;
case KEY_UP:
cursorY --;
break;
case KEY_LEFT:
cursorX --;
break;
case KEY_RIGHT:
cursorX ++;
break;
case KEY_NPAGE:
cursorZ --;
break;
case KEY_PPAGE:
cursorZ ++;
break;
case '+':
vein ++;
break;
2010-02-19 17:12:55 -07:00
case 'd':
dig = true;
break;
case 'o':
dump = true;
break;
case '-':
vein --;
break;
case 'z':
digbit = true;
break;
default:
break;
}
cursorX = max(cursorX, 0);
cursorY = max(cursorY, 0);
cursorZ = max(cursorZ, 0);
cursorX = min(cursorX, x_max - 1);
cursorY = min(cursorY, y_max - 1);
cursorZ = min(cursorZ, z_max - 1);
DF.Suspend();
for(int i = -1; i <= 1; i++)
{
for(int j = -1; j <= 1; j++)
{
if(DF.isValidBlock(cursorX+i,cursorY+j,cursorZ))
{
// read data
DF.ReadTileTypes(cursorX+i,cursorY+j,cursorZ, (uint16_t *) tiletypes);
DF.ReadDesignations(cursorX+i,cursorY+j,cursorZ, (uint32_t *) designations);
for(int x = 0; x < 16; x++)
{
for(int y = 0; y < 16; y++)
{
2010-02-19 17:12:55 -07:00
if(dig)
{
if(tileTypeTable[tiletypes[x][y]].c == WALL && tileTypeTable[tiletypes[x][y]].m == VEIN
|| tileTypeTable[tiletypes[x][y]].c == TREE_OK || tileTypeTable[tiletypes[x][y]].c == TREE_DEAD)
{
designations[x][y].bits.dig = designation_default;
}
}
int color = COLOR_BLACK;
color = pickColor(tiletypes[x][y]);
if(designations[x][y].bits.hidden)
{
puttile(x+(i+1)*16,y+(j+1)*16,tiletypes[x][y], color);
}
else
{
attron(A_STANDOUT);
puttile(x+(i+1)*16,y+(j+1)*16,tiletypes[x][y], color);
attroff(A_STANDOUT);
}
}
}
2010-02-19 17:12:55 -07:00
if(i == 0 && j == 0)
{
2010-02-19 17:12:55 -07:00
blockaddr = DF.getBlockPtr(cursorX+i,cursorY+j,cursorZ);
if(dump)
{
hexdump(DF,blockaddr,0x1E00/*0x1DB8*/,filenum);
2010-02-19 17:12:55 -07:00
filenum++;
}
if(dig)
DF.WriteDesignations(cursorX+i,cursorY+j,cursorZ, (uint32_t *) designations);
DF.ReadDirtyBit(cursorX+i,cursorY+j,cursorZ,dirtybit);
if(digbit)
{
dirtybit = !dirtybit;
DF.WriteDirtyBit(cursorX+i,cursorY+j,cursorZ,dirtybit);
}
veinVector.clear();
IceVeinVector.clear();
DF.ReadVeins(cursorX+i,cursorY+j,cursorZ,veinVector,IceVeinVector);
}
}
}
}
gotoxy(0,48);
cprintf("arrow keys, PGUP, PGDN = navigate");
gotoxy(0,49);
cprintf("+,- = switch vein");
gotoxy(0,50);
uint32_t mineralsize = veinVector.size();
uint32_t icesize = IceVeinVector.size();
uint32_t totalVeinSize = mineralsize+ icesize;
if(vein == totalVeinSize) vein = totalVeinSize - 1;
if(vein < -1) vein = -1;
cprintf("X %d/%d, Y %d/%d, Z %d/%d. Vein %d of %d",cursorX+1,x_max,cursorY+1,y_max,cursorZ,z_max,vein+1,totalVeinSize);
if(!veinVector.empty() || !IceVeinVector.empty())
{
if(vein != -1 && vein < totalVeinSize)
{
uint32_t realvein = 0;
if(vein < mineralsize)
{
realvein = vein;
//iterate through vein rows
for(uint32_t j = 0;j<16;j++)
{
//iterate through the bits
for (uint32_t k = 0; k< 16;k++)
{
// and the bit array with a one-bit mask, check if the bit is set
bool set = !!(((1 << k) & veinVector[realvein].assignment[j]) >> k);
if(set)
{
putch(k+16,j+16,'$',COLOR_RED);
}
}
}
gotoxy(0,51);
cprintf("Mineral: %s",stonetypes[veinVector[vein].type].name);
}
else
2010-02-20 20:39:01 -07:00
{
realvein = vein - mineralsize;
t_frozenliquidvein &frozen = IceVeinVector[realvein];
for(uint32_t i = 0;i<16;i++)
{
for (uint32_t j = 0; j< 16;j++)
{
int color = COLOR_BLACK;
int tile = frozen.tiles[i][j];
color = pickColor(tile);
attron(A_STANDOUT);
puttile(i+16,j+16,tile, color);
attroff(A_STANDOUT);
}
}
gotoxy(0,51);
cprintf("ICE");
2010-02-20 20:39:01 -07:00
}
}
}
uint32_t sptr = blockaddr + p->getDescriptor()->getOffset("block_flags");
gotoxy (0,52);
2010-02-20 20:39:01 -07:00
cprintf("block address 0x%x",blockaddr);
gotoxy (0,53);
cprintf("dirty bit: %d",dirtybit);
gotoxy (0,54);
cprintf ("d - dig veins, o - dump map block, z - toggle dirty bit");
wrefresh(stdscr);
}
2010-02-18 18:48:03 -07:00
pDF = 0;
finish(0);
}
static void finish(int sig)
{
2010-02-18 18:48:03 -07:00
// ugly
if(pDF)
{
2010-02-18 19:37:16 -07:00
pDF->ForceResume();
2010-02-18 18:48:03 -07:00
pDF->Detach();
}
endwin();
if(!error.empty())
{
cerr << error << endl;
}
exit(0);
}