// De-ramp.  All ramps marked for removal are replaced with given tile (presently, normal floor).

#include "Core.h"
#include "Console.h"
#include "Export.h"
#include "PluginManager.h"

#include "DataDefs.h"
#include "df/world.h"
#include "df/map_block.h"
#include "df/tile_dig_designation.h"
#include "TileTypes.h"

using std::vector;
using std::string;
using namespace DFHack;

using df::global::world;
using namespace DFHack;

// This is slightly different from what's in the Maps module - it takes tile coordinates rather than block coordinates
df::map_block *getBlock (int32_t x, int32_t y, int32_t z)
{
    if ((x < 0) || (y < 0) || (z < 0))
        return NULL;
    if ((x >= world->map.x_count) || (y >= world->map.y_count) || (z >= world->map.z_count))
        return NULL;
    return world->map.block_index[x >> 4][y >> 4][z];
}

DFhackCExport command_result df_deramp (Core * c, vector <string> & parameters)
{
    for(int i = 0; i < parameters.size();i++)
    {
        if(parameters[i] == "help" || parameters[i] == "?")
        {
            c->con.print("This command does two things:\n"
                "If there are any ramps designated for removal, they will be instantly removed.\n"
                "Any ramps that don't have their counterpart will be removed (fixes bugs with caveins)\n"
                );
            return CR_OK;
        }
    }

    CoreSuspender suspend(c);

    int count = 0;
    int countbad = 0;

    int num_blocks = 0, blocks_total = world->map.map_blocks.size();
    for (int i = 0; i < blocks_total; i++)
    {
        df::map_block *block = world->map.map_blocks[i];
        df::map_block *above = getBlock(block->map_x, block->map_y, block->map_z + 1);

        for (int x = 0; x < 16; x++)
        {
            for (int y = 0; y < 16; y++)
            {
                int16_t oldT = block->tiletype[x][y];
                if ((tileShape(oldT) == RAMP) &&
                    (block->designation[x][y].bits.dig == df::tile_dig_designation::Default))
                {
                    // Current tile is a ramp.
                    // Set current tile, as accurately as can be expected
                    int16_t newT = findSimilarTileType(oldT, FLOOR);

                    // If no change, skip it (couldn't find a good tile type)
                    if (oldT == newT)
                        continue;
                    // Set new tile type, clear designation
                    block->tiletype[x][y] = newT;
                    block->designation[x][y].bits.dig = df::tile_dig_designation::No;

                    // Check the tile above this one, in case a downward slope needs to be removed.
                    if ((above) && (tileShape(above->tiletype[x][y]) == RAMP_TOP))
                        above->tiletype[x][y] = 32; // open space
                    count++;
                }
                // ramp fixer
                else if ((tileShape(oldT) != RAMP)
                    && (above) && (tileShape(above->tiletype[x][y]) == RAMP_TOP))
                {
                    above->tiletype[x][y] = 32; // open space
                    countbad++;
                }
            }
        }
    }
    if (count)
        c->con.print("Found and changed %d tiles.\n", count);
    if (countbad)
        c->con.print("Fixed %d bad down ramps.\n", countbad);
    return CR_OK;
}

DFhackCExport const char * plugin_name ( void )
{
    return "deramp";
}

DFhackCExport command_result plugin_init ( Core * c, std::vector <PluginCommand> &commands)
{
    commands.clear();
    commands.push_back(PluginCommand("deramp",
        "De-ramp.  All ramps marked for removal are replaced with floors.",
        df_deramp));
    return CR_OK;
}

DFhackCExport command_result plugin_shutdown ( Core * c )
{
    return CR_OK;
}