Fix all warnings -Wall spews

[lsnes.git] / memorymanip.cpp

#include "lsnes.hpp"
#include "window.hpp"
#include <iostream>
#include <snes/snes.hpp>
#include "rom.hpp"
#include "memorymanip.hpp"
#include "fieldsplit.hpp"
#include <sstream>
#include <iomanip>
#include <cstdint>
typedef uint8_t uint8;
typedef uint16_t uint16;
typedef uint32_t uint32;
typedef int8_t int8;
typedef int16_t int16;
typedef int32_t int32;
#include <nall/platform.hpp>
#include <nall/endian.hpp>
#include <nall/varint.hpp>
#include <nall/bit.hpp>
#include <nall/serializer.hpp>
#include <nall/property.hpp>
using namespace nall;
#include <ui-libsnes/libsnes.hpp>
using namespace SNES;


namespace
{
        struct translated_address
        {
                uint32_t rel_addr;
                uint32_t raw_addr;
                uint8_t* memory;
                uint32_t memory_size;
                bool not_writable;
                bool native_endian;
        };

        struct region
        {
                std::string name;
                uint32_t base;
                uint32_t size;
                uint8_t* memory;
                bool not_writable;
                bool native_endian;
        };

        std::vector<region> memory_regions;
        uint32_t linear_ram_size = 0;
        bool system_little_endian = true;

        struct translated_address translate_address(uint32_t rawaddr) throw()
        {
                struct translated_address t;
                t.rel_addr = 0;
                t.raw_addr = 0;
                t.memory = NULL;
                t.memory_size = 0;
                t.not_writable = true;
                for(auto i = memory_regions.begin(); i != memory_regions.end(); ++i) {
                        if(i->base > rawaddr || i->base + i->size <= rawaddr)
                                continue;
                        t.rel_addr = rawaddr - i->base;
                        t.raw_addr = rawaddr;
                        t.memory = i->memory;
                        t.memory_size = i->size;
                        t.not_writable = i->not_writable;
                        t.native_endian = i->native_endian;
                        break;
                }
                return t;
        }

        struct translated_address translate_address_linear_ram(uint32_t ramlinaddr) throw()
        {
                struct translated_address t;
                t.rel_addr = 0;
                t.raw_addr = 0;
                t.memory = NULL;
                t.memory_size = 0;
                t.not_writable = true;
                for(auto i = memory_regions.begin(); i != memory_regions.end(); ++i) {
                        if(i->not_writable)
                                continue;
                        if(ramlinaddr >= i->size) {
                                ramlinaddr -= i->size;
                                continue;
                        }
                        t.rel_addr = ramlinaddr;
                        t.raw_addr = i->base + ramlinaddr;
                        t.memory = i->memory;
                        t.memory_size = i->size;
                        t.not_writable = i->not_writable;
                        t.native_endian = i->native_endian;
                        break;
                }
                return t;
        }

        uint32_t get_linear_ram_size() throw()
        {
                return linear_ram_size;
        }

        uint32_t create_region(const std::string& name, uint32_t base, uint8_t* memory, uint32_t size, bool readonly,
                bool native_endian = false) throw(std::bad_alloc)
        {
                if(size == 0)
                        return base;
                struct region r;
                r.name = name;
                r.base = base;
                r.memory = memory;
                r.size = size;
                r.not_writable = readonly;
                r.native_endian = native_endian;
                if(!readonly)
                        linear_ram_size += size;
                memory_regions.push_back(r);
                return base + size;
        }

        uint32_t create_region(const std::string& name, uint32_t base, MappedRAM& memory, bool readonly,
                bool native_endian = false) throw(std::bad_alloc)
        {
                return create_region(name, base, memory.data(), memory.size(), readonly, native_endian);
        }

        uint16_t native_bigendian_convert(uint16_t x) throw()
        {
                if(system_little_endian)
                        return (((x >> 8) & 0xFF) | ((x << 8) & 0xFF00));
                else
                        return x;
        }

        uint32_t native_bigendian_convert(uint32_t x) throw()
        {
                if(system_little_endian)
                        return (((x >> 24) & 0xFF) | ((x >> 8) & 0xFF00) |
                                ((x << 8) & 0xFF0000) | ((x << 24) & 0xFF000000));
                else
                        return x;
        }

        uint64_t native_bigendian_convert(uint64_t x) throw()
        {
                if(system_little_endian)
                        return (((x >> 56) & 0xFF) | ((x >> 40) & 0xFF00) |
                                ((x >> 24) & 0xFF0000) | ((x >> 8) & 0xFF000000) |
                                ((x << 8) & 0xFF00000000ULL) | ((x << 24) & 0xFF0000000000ULL) |
                                ((x << 40) & 0xFF000000000000ULL) | ((x << 56) & 0xFF00000000000000ULL));
                else
                        return x;
        }

}

void refresh_cart_mappings() throw(std::bad_alloc)
{
        linear_ram_size = 0;
        memory_regions.clear();
        if(get_current_rom_info().first == ROMTYPE_NONE)
                return;
        create_region("WRAM", 0x007E0000, cpu.wram, 131072, false);
        create_region("APURAM", 0x00000000, smp.apuram, 65536, false);
        create_region("VRAM", 0x00010000, ppu.vram, 65536, false);
        create_region("OAM", 0x00020000, ppu.oam, 544, false);
        create_region("CGRAM", 0x00021000, ppu.cgram, 512, false);
        if(cartridge.has_srtc()) create_region("RTC", 0x00022000, srtc.rtc, 20, false);
        if(cartridge.has_spc7110rtc()) create_region("RTC", 0x00022000, spc7110.rtc, 20, false);
        if(cartridge.has_necdsp()) {
                create_region("DSPRAM", 0x00023000, reinterpret_cast<uint8_t*>(necdsp.dataRAM), 4096, false, true);
                create_region("DSPPROM", 0xF0000000, reinterpret_cast<uint8_t*>(necdsp.programROM), 65536, true,
                        true);
                create_region("DSPDROM", 0xF0010000, reinterpret_cast<uint8_t*>(necdsp.dataROM), 4096, true, true);
        }
        create_region("SRAM", 0x10000000, cartridge.ram, false);
        create_region("ROM", 0x80000000, cartridge.rom, true);
        switch(get_current_rom_info().first) {
        case ROMTYPE_BSX:
        case ROMTYPE_BSXSLOTTED:
                create_region("BSXFLASH", 0x90000000, bsxflash.memory, true);
                create_region("BSX_RAM", 0x20000000, bsxcartridge.sram, false);
                create_region("BSX_PRAM", 0x30000000, bsxcartridge.psram, false);
                break;
        case ROMTYPE_SUFAMITURBO:
                create_region("SLOTA_ROM", 0x90000000, sufamiturbo.slotA.rom, true);
                create_region("SLOTB_ROM", 0xA0000000, sufamiturbo.slotB.rom, true);
                create_region("SLOTA_RAM", 0x20000000, sufamiturbo.slotA.ram, false);
                create_region("SLOTB_RAM", 0x30000000, sufamiturbo.slotB.ram, false);
                break;
        case ROMTYPE_SGB:
                create_region("GBROM", 0x90000000, GameBoy::cartridge.romdata, GameBoy::cartridge.romsize, true);
                create_region("GBRAM", 0x20000000, GameBoy::cartridge.ramdata, GameBoy::cartridge.ramsize, false);
                break;
        case ROMTYPE_SNES:
        case ROMTYPE_NONE:
                break;
        };
}

std::vector<struct memory_region> get_regions() throw(std::bad_alloc)
{
        std::vector<struct memory_region> out;
        for(auto i = memory_regions.begin(); i != memory_regions.end(); ++i) {
                struct memory_region r;
                r.region_name = i->name;
                r.baseaddr = i->base;
                r.size = i->size;
                r.lastaddr = i->base + i->size - 1;
                r.readonly = i->not_writable;
                r.native_endian = i->native_endian;
                out.push_back(r);
        }
        return out;
}

uint8_t memory_read_byte(uint32_t addr) throw()
{
        struct translated_address laddr = translate_address(addr);
        uint8_t value = 0;
        if(laddr.rel_addr < laddr.memory_size)
                value |= laddr.memory[laddr.rel_addr++];
        return value;
}

uint16_t memory_read_word(uint32_t addr) throw()
{
        struct translated_address laddr = translate_address(addr);
        uint16_t value = 0;
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint16_t>(laddr.memory[laddr.rel_addr++]) << 8);
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint16_t>(laddr.memory[laddr.rel_addr++]));
        if(laddr.native_endian)
                value = native_bigendian_convert(value);
        return value;
}

uint32_t memory_read_dword(uint32_t addr) throw()
{
        struct translated_address laddr = translate_address(addr);
        uint32_t value = 0;
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint32_t>(laddr.memory[laddr.rel_addr++]) << 24);
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint32_t>(laddr.memory[laddr.rel_addr++]) << 16);
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint32_t>(laddr.memory[laddr.rel_addr++]) << 8);
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint32_t>(laddr.memory[laddr.rel_addr++]));
        if(laddr.native_endian)
                value = native_bigendian_convert(value);
        return value;
}

uint64_t memory_read_qword(uint32_t addr) throw()
{
        struct translated_address laddr = translate_address(addr);
        uint64_t value = 0;
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint64_t>(laddr.memory[laddr.rel_addr++]) << 56);
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint64_t>(laddr.memory[laddr.rel_addr++]) << 48);
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint64_t>(laddr.memory[laddr.rel_addr++]) << 40);
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint64_t>(laddr.memory[laddr.rel_addr++]) << 32);
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint64_t>(laddr.memory[laddr.rel_addr++]) << 24);
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint64_t>(laddr.memory[laddr.rel_addr++]) << 16);
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint64_t>(laddr.memory[laddr.rel_addr++]) << 8);
        if(laddr.rel_addr < laddr.memory_size)
                value |= (static_cast<uint64_t>(laddr.memory[laddr.rel_addr++]));
        if(laddr.native_endian)
                value = native_bigendian_convert(value);
        return value;
}

//Byte write to address (false if failed).
bool memory_write_byte(uint32_t addr, uint8_t data) throw()
{
        struct translated_address laddr = translate_address(addr);
        if(laddr.rel_addr >= laddr.memory_size || laddr.not_writable)
                return false;
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data);
        return true;
}

bool memory_write_word(uint32_t addr, uint16_t data) throw()
{
        struct translated_address laddr = translate_address(addr);
        if(laddr.native_endian)
                data = native_bigendian_convert(data);
        if(laddr.rel_addr >= laddr.memory_size - 1 || laddr.not_writable)
                return false;
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data >> 8);
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data);
        return true;
}

bool memory_write_dword(uint32_t addr, uint32_t data) throw()
{
        struct translated_address laddr = translate_address(addr);
        if(laddr.native_endian)
                data = native_bigendian_convert(data);
        if(laddr.rel_addr >= laddr.memory_size - 3 || laddr.not_writable)
                return false;
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data >> 24);
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data >> 16);
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data >> 8);
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data);
        return true;
}

bool memory_write_qword(uint32_t addr, uint64_t data) throw()
{
        struct translated_address laddr = translate_address(addr);
        if(laddr.native_endian)
                data = native_bigendian_convert(data);
        if(laddr.rel_addr >= laddr.memory_size - 7 || laddr.not_writable)
                return false;
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data >> 56);
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data >> 48);
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data >> 40);
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data >> 32);
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data >> 24);
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data >> 16);
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data >> 8);
        laddr.memory[laddr.rel_addr++] = static_cast<uint8_t>(data);
        return true;
}

memorysearch::memorysearch() throw(std::bad_alloc)
{
        reset();
}

void memorysearch::reset() throw(std::bad_alloc)
{
        uint32_t linearram = get_linear_ram_size();
        previous_content.resize(linearram);
        still_in.resize((linearram + 63) / 64);
        for(uint32_t i = 0; i < linearram / 64; i++)
                still_in[i] = 0xFFFFFFFFFFFFFFFFULL;
        if(linearram % 64)
                still_in[linearram / 64] = (1ULL << (linearram % 64)) - 1;
        uint32_t addr = 0;
        while(addr < linearram) {
                struct translated_address t = translate_address_linear_ram(addr);
                memcpy(&previous_content[addr], t.memory, t.memory_size);
                addr += t.memory_size;
        }
        candidates = linearram;
}

/**
 * \brief Native-value search function for specific value
 */
template<typename T>
struct search_value
{
/**
 * \brief The underlying numeric type
 */
        typedef T value_type;

/**
 * \brief Create new search object
 *
 * \param v The value to search for.
 */
        search_value(T v) throw()
        {
                val = v;
        }

/**
 * \brief Condition function.
 * \param oldv The old value
 * \param newv The new value
 * \return True if new value satisfies condition, false otherwise.
 */
        bool operator()(T oldv, T newv) const throw()
        {
                return (newv == val);
        }

/**
 * \brief The value to look for
 */
        T val;
};

/**
 * \brief Native-value search function for less-than function.
 */
template<typename T>
struct search_lt
{
/**
 * \brief The underlying numeric type
 */
        typedef T value_type;

/**
 * \brief Condition function.
 * \param oldv The old value
 * \param newv The new value
 * \return True if new value satisfies condition, false otherwise.
 */
        bool operator()(T oldv, T newv) const throw()
        {
                return (newv < oldv);
        }
};

/**
 * \brief Native-value search function for less-or-equal-to function.
 */
template<typename T>
struct search_le
{
/**
 * \brief The underlying numeric type
 */
        typedef T value_type;

/**
 * \brief Condition function.
 * \param oldv The old value
 * \param newv The new value
 * \return True if new value satisfies condition, false otherwise.
 */
        bool operator()(T oldv, T newv) const throw()
        {
                return (newv <= oldv);
        }
};

/**
 * \brief Native-value search function for equals function.
 */
template<typename T>
struct search_eq
{
/**
 * \brief The underlying numeric type
 */
        typedef T value_type;

/**
 * \brief Condition function.
 * \param oldv The old value
 * \param newv The new value
 * \return True if new value satisfies condition, false otherwise.
 */
        bool operator()(T oldv, T newv) const throw()
        {
                return (newv == oldv);
        }
};

/**
 * \brief Native-value search function for not-equal function.
 */
template<typename T>
struct search_ne
{
/**
 * \brief The underlying numeric type
 */
        typedef T value_type;

/**
 * \brief Condition function.
 * \param oldv The old value
 * \param newv The new value
 * \return True if new value satisfies condition, false otherwise.
 */
        bool operator()(T oldv, T newv) const throw()
        {
                return (newv != oldv);
        }
};

/**
 * \brief Native-value search function for greater-or-equal-to function.
 */
template<typename T>
struct search_ge
{
/**
 * \brief The underlying numeric type
 */
        typedef T value_type;

/**
 * \brief Condition function.
 * \param oldv The old value
 * \param newv The new value
 * \return True if new value satisfies condition, false otherwise.
 */
        bool operator()(T oldv, T newv) const throw()
        {
                return (newv >= oldv);
        }
};

/**
 * \brief Native-value search function for greater-than function.
 */
template<typename T>
struct search_gt
{
/**
 * \brief The underlying numeric type
 */
        typedef T value_type;

/**
 * \brief Condition function.
 * \param oldv The old value
 * \param newv The new value
 * \return True if new value satisfies condition, false otherwise.
 */
        bool operator()(T oldv, T newv) const throw()
        {
                return (newv > oldv);
        }
};

/**
 * \brief Helper class to decode arguments to search functions
 *
 * This class acts as adapter between search conditions taking native numbers as parameters and the interface
 * expected for the search function.
 */
template<typename T>
struct search_value_helper
{
/**
 * \brief The underlying numeric type
 */
        typedef typename T::value_type value_type;

/**
 * \brief Constructor constructing condition object
 *
 * This constructor takes in condition object with the native-value interface and makes condition object with
 * interface used by search().
 *
 * \param v The condition object to wrap.
 */
        search_value_helper(const T& v)  throw()
                : val(v)
        {
        }

/**
 * \brief Condition function
 *
 * This function is search()-compatible condition function calling the underlying condition.
 */
        bool operator()(const uint8_t* newv, const uint8_t* oldv, uint32_t left, bool nativeendian) const throw()
        {
                if(left < sizeof(value_type))
                        return false;
                value_type v1 = 0;
                value_type v2 = 0;
                if(nativeendian) {
                        v1 = *reinterpret_cast<const value_type*>(oldv);
                        v2 = *reinterpret_cast<const value_type*>(newv);
                } else
                        for(size_t i = 0; i < sizeof(value_type); i++) {
                                v1 |= static_cast<value_type>(oldv[i]) << (8 * (sizeof(value_type) - i));
                                v2 |= static_cast<value_type>(newv[i]) << (8 * (sizeof(value_type) - i));
                        }
                return val(v1, v2);
        }

/**
 * \brief The underlying condition.
 */
        const T& val;
};

template<class T> void memorysearch::search(const T& obj) throw()
{
        search_value_helper<T> helper(obj);
        struct translated_address t = translate_address_linear_ram(0);
        uint32_t switch_at = t.memory_size;
        uint32_t base = 0;
        uint32_t size = previous_content.size();
        for(uint32_t i = 0; i < size; i++) {
                if(still_in[i / 64] == 0) {
                        i = (i + 64) >> 6 << 6;
                        i--;
                        continue;
                }
                //t.memory_size == 0 can happen if cart changes.
                while(i >= switch_at && t.memory_size > 0) {
                        t = translate_address_linear_ram(switch_at);
                        base = switch_at;
                        switch_at += t.memory_size;
                }
                if(t.memory_size == 0 || !helper(t.memory + i - base, &previous_content[i],
                        t.memory_size - (i - base), t.native_endian)) {
                        if((still_in[i / 64] >> (i % 64)) & 1) {
                                still_in[i / 64] &= ~(1ULL << (i % 64));
                                candidates--;
                        }
                }
        }
        t = translate_address_linear_ram(0);
        base = 0;
        size = previous_content.size();
        while(base < size) {
                size_t m = t.memory_size;
                if(m > (size - base))
                        m = size - base;
                memcpy(&previous_content[base], t.memory, m);
                base += t.memory_size;
                t = translate_address_linear_ram(base);
        }
}

void memorysearch::byte_value(uint8_t value) throw() { search(search_value<uint8_t>(value)); }
void memorysearch::byte_slt() throw() { search(search_lt<int8_t>()); }
void memorysearch::byte_sle() throw() { search(search_le<int8_t>()); }
void memorysearch::byte_seq() throw() { search(search_eq<int8_t>()); }
void memorysearch::byte_sne() throw() { search(search_ne<int8_t>()); }
void memorysearch::byte_sge() throw() { search(search_ge<int8_t>()); }
void memorysearch::byte_sgt() throw() { search(search_gt<int8_t>()); }
void memorysearch::byte_ult() throw() { search(search_lt<uint8_t>()); }
void memorysearch::byte_ule() throw() { search(search_le<uint8_t>()); }
void memorysearch::byte_ueq() throw() { search(search_eq<uint8_t>()); }
void memorysearch::byte_une() throw() { search(search_ne<uint8_t>()); }
void memorysearch::byte_uge() throw() { search(search_ge<uint8_t>()); }
void memorysearch::byte_ugt() throw() { search(search_gt<uint8_t>()); }

void memorysearch::word_value(uint16_t value) throw() { search(search_value<uint16_t>(value)); }
void memorysearch::word_slt() throw() { search(search_lt<int16_t>()); }
void memorysearch::word_sle() throw() { search(search_le<int16_t>()); }
void memorysearch::word_seq() throw() { search(search_eq<int16_t>()); }
void memorysearch::word_sne() throw() { search(search_ne<int16_t>()); }
void memorysearch::word_sge() throw() { search(search_ge<int16_t>()); }
void memorysearch::word_sgt() throw() { search(search_gt<int16_t>()); }
void memorysearch::word_ult() throw() { search(search_lt<uint16_t>()); }
void memorysearch::word_ule() throw() { search(search_le<uint16_t>()); }
void memorysearch::word_ueq() throw() { search(search_eq<uint16_t>()); }
void memorysearch::word_une() throw() { search(search_ne<uint16_t>()); }
void memorysearch::word_uge() throw() { search(search_ge<uint16_t>()); }
void memorysearch::word_ugt() throw() { search(search_gt<uint16_t>()); }

void memorysearch::dword_value(uint32_t value) throw() { search(search_value<uint32_t>(value)); }
void memorysearch::dword_slt() throw() { search(search_lt<int32_t>()); }
void memorysearch::dword_sle() throw() { search(search_le<int32_t>()); }
void memorysearch::dword_seq() throw() { search(search_eq<int32_t>()); }
void memorysearch::dword_sne() throw() { search(search_ne<int32_t>()); }
void memorysearch::dword_sge() throw() { search(search_ge<int32_t>()); }
void memorysearch::dword_sgt() throw() { search(search_gt<int32_t>()); }
void memorysearch::dword_ult() throw() { search(search_lt<uint32_t>()); }
void memorysearch::dword_ule() throw() { search(search_le<uint32_t>()); }
void memorysearch::dword_ueq() throw() { search(search_eq<uint32_t>()); }
void memorysearch::dword_une() throw() { search(search_ne<uint32_t>()); }
void memorysearch::dword_uge() throw() { search(search_ge<uint32_t>()); }
void memorysearch::dword_ugt() throw() { search(search_gt<uint32_t>()); }

void memorysearch::qword_value(uint64_t value) throw() { search(search_value<uint64_t>(value)); }
void memorysearch::qword_slt() throw() { search(search_lt<int64_t>()); }
void memorysearch::qword_sle() throw() { search(search_le<int64_t>()); }
void memorysearch::qword_seq() throw() { search(search_eq<int64_t>()); }
void memorysearch::qword_sne() throw() { search(search_ne<int64_t>()); }
void memorysearch::qword_sge() throw() { search(search_ge<int64_t>()); }
void memorysearch::qword_sgt() throw() { search(search_gt<int64_t>()); }
void memorysearch::qword_ult() throw() { search(search_lt<uint64_t>()); }
void memorysearch::qword_ule() throw() { search(search_le<uint64_t>()); }
void memorysearch::qword_ueq() throw() { search(search_eq<uint64_t>()); }
void memorysearch::qword_une() throw() { search(search_ne<uint64_t>()); }
void memorysearch::qword_uge() throw() { search(search_ge<uint64_t>()); }
void memorysearch::qword_ugt() throw() { search(search_gt<uint64_t>()); }

uint32_t memorysearch::get_candidate_count() throw()
{
        return candidates;
}

std::list<uint32_t> memorysearch::get_candidates() throw(std::bad_alloc)
{
        struct translated_address t = translate_address_linear_ram(0);
        uint32_t switch_at = t.memory_size;
        uint32_t base = 0;
        uint32_t rbase = t.raw_addr;
        uint32_t size = previous_content.size();
        std::list<uint32_t> out;

        for(uint32_t i = 0; i < size; i++) {
                if(still_in[i / 64] == 0) {
                        i = (i + 64) >> 6 << 6;
                        i--;
                        continue;
                }
                while(i >= switch_at && t.memory_size > 0) {
                        t = translate_address_linear_ram(switch_at);
                        base = switch_at;
                        rbase = t.raw_addr - t.rel_addr;
                        switch_at += t.memory_size;
                }
                if((still_in[i / 64] >> (i % 64)) & 1)
                        out.push_back(i - base + rbase);
        }
        std::cout << "out=" << out.size() << " candidates=" << candidates << std::endl;
        return out;
}

namespace
{
        memorysearch* isrch;

        std::string tokenize1(const std::string& command, const std::string& syntax);
        std::pair<std::string, std::string> tokenize2(const std::string& command, const std::string& syntax);
        std::pair<std::string, std::string> tokenize12(const std::string& command, const std::string& syntax);

        unsigned char hex(char ch)
        {
                switch(ch) {
                case '0':                       return 0;
                case '1':                       return 1;
                case '2':                       return 2;
                case '3':                       return 3;
                case '4':                       return 4;
                case '5':                       return 5;
                case '6':                       return 6;
                case '7':                       return 7;
                case '8':                       return 8;
                case '9':                       return 9;
                case 'a':       case 'A':       return 10;
                case 'b':       case 'B':       return 11;
                case 'c':       case 'C':       return 12;
                case 'd':       case 'D':       return 13;
                case 'e':       case 'E':       return 14;
                case 'f':       case 'F':       return 15;
                };
                throw std::runtime_error("Bad hex character");
        }

}

bool memorymanip_command(const std::string& cmd, window* win) throw(std::bad_alloc, std::runtime_error)
{
        tokensplitter t(cmd);
        std::string command = t;
        std::string firstword = t;
        std::string secondword = t;
        uint32_t address;
        uint64_t value;
        bool has_tail = (t.tail() != "");
        bool address_bad = true;
        bool value_bad = true;
        bool has_value = (secondword != "");
        try {
                if(firstword.length() >= 2 && firstword.substr(0, 2) == "0x") {
                        if(firstword.length() > 10)
                                throw 42;
                        address = 0;
                        for(unsigned i = 2; i < firstword.length(); i++)
                                address = 16 * address + hex(firstword[i]);
                } else {
                        address = parse_value<uint32_t>(firstword);
                }
                address_bad = false;
        } catch(...) {
        }
        try {
                if(secondword.length() >= 2 && secondword.substr(0, 2) == "0x") {
                        if(secondword.length() > 18)
                                throw 42;
                        value = 0;
                        for(unsigned i = 2; i < secondword.length(); i++)
                                value = 16 * value + hex(secondword[i]);
                } else if(secondword.length() > 0 && secondword[0] == '-') {
                        value = static_cast<uint64_t>(parse_value<int64_t>(secondword));
                } else {
                        value = parse_value<uint64_t>(secondword);
                }
                value_bad = false;
        } catch(...) {
        }
        if(command == "read-byte") {
                if(address_bad || has_value || has_tail)
                        throw std::runtime_error("Syntax: " + command + " <address>");
                {
                        std::ostringstream x;
                        x << "0x" << std::hex << address << " -> " << std::dec
                                << static_cast<uint64_t>(memory_read_byte(address));
                        out(win) << x.str() << std::endl;
                }
                return true;
        }
        if(command == "read-word") {
                if(address_bad || has_value || has_tail)
                        throw std::runtime_error("Syntax: " + command + " <address>");
                {
                        std::ostringstream x;
                        x << "0x" << std::hex << address << " -> " << std::dec
                                << static_cast<uint64_t>(memory_read_word(address));
                        out(win) << x.str() << std::endl;
                }
                return true;
        }
        if(command == "read-dword") {
                if(address_bad || has_value || has_tail)
                        throw std::runtime_error("Syntax: " + command + " <address>");
                {
                        std::ostringstream x;
                        x << "0x" << std::hex << address << " -> " << std::dec
                                << static_cast<uint64_t>(memory_read_dword(address));
                        out(win) << x.str() << std::endl;
                }
                return true;
        }
        if(command == "read-qword") {
                if(address_bad || has_value || has_tail)
                        throw std::runtime_error("Syntax: " + command + " <address>");
                {
                        std::ostringstream x;
                        x << "0x" << std::hex << address << " -> " << std::dec
                                << static_cast<uint64_t>(memory_read_qword(address));
                        out(win) << x.str() << std::endl;
                }
                return true;
        }
        if(command == "read-sbyte") {
                if(address_bad || has_value || has_tail)
                        throw std::runtime_error("Syntax: " + command + " <address>");
                {
                        std::ostringstream x;
                        x << "0x" << std::hex << address << " -> " << std::dec
                                << static_cast<int64_t>(static_cast<int8_t>(memory_read_byte(address)));
                        out(win) << x.str() << std::endl;
                }
                return true;
        }
        if(command == "read-sword") {
                if(address_bad || has_value || has_tail)
                        throw std::runtime_error("Syntax: " + command + " <address>");
                {
                        std::ostringstream x;
                        x << "0x" << std::hex << address << " -> " << std::dec
                                << static_cast<int64_t>(static_cast<int16_t>(memory_read_word(address)));
                        out(win) << x.str() << std::endl;
                }
                return true;
        }
        if(command == "read-sdword") {
                if(address_bad || has_value || has_tail)
                        throw std::runtime_error("Syntax: " + command + " <address>");
                {
                        std::ostringstream x;
                        x << "0x" << std::hex << address << " -> " << std::dec
                                << static_cast<int64_t>(static_cast<int32_t>(memory_read_dword(address)));
                        out(win) << x.str() << std::endl;
                }
                return true;
        }
        if(command == "read-sqword") {
                if(address_bad || has_value || has_tail)
                        throw std::runtime_error("Syntax: " + command + " <address>");
                {
                        std::ostringstream x;
                        x << "0x" << std::hex << address << " -> " << std::dec
                                << static_cast<int64_t>(static_cast<int64_t>(memory_read_qword(address)));
                        out(win) << x.str() << std::endl;
                }
                return true;
        }
        if(command == "write-byte") {
                if(address_bad || value_bad || has_tail)
                        throw std::runtime_error("Syntax: " + command + " <address> <value>");
                if(static_cast<int64_t>(value) < -128 || value > 255)
                        throw std::runtime_error("Value to write out of range");
                memory_write_byte(address, value & 0xFF);
                return true;
        }
        if(command == "write-word") {
                if(address_bad || value_bad || has_tail)
                        throw std::runtime_error("Syntax: " + command + " <address> <value>");
                if(static_cast<int64_t>(value) < -32768 || value > 65535)
                        throw std::runtime_error("Value to write out of range");
                memory_write_word(address, value & 0xFFFF);
                return true;
        }
        if(command == "write-dword") {
                if(address_bad || value_bad || has_tail)
                        throw std::runtime_error("Syntax: " + command + " <address> <value>");
                if(static_cast<int64_t>(value) < -2147483648 || value > 4294967295ULL)
                        throw std::runtime_error("Value to write out of range");
                memory_write_dword(address, value & 0xFFFF);
                return true;
        }
        if(command == "write-qword") {
                if(address_bad || value_bad || has_tail)
                        throw std::runtime_error("Syntax: " + command + " <address> <value>");
                memory_write_dword(address, value & 0xFFFF);
                return true;
        }
        if(command == "search-memory") {
                if(!isrch)
                        isrch = new memorysearch();
                if(firstword == "sblt" && !has_value)
                        isrch->byte_slt();
                else if(firstword == "sble" && !has_value)
                        isrch->byte_sle();
                else if(firstword == "sbeq" && !has_value)
                        isrch->byte_seq();
                else if(firstword == "sbne" && !has_value)
                        isrch->byte_sne();
                else if(firstword == "sbge" && !has_value)
                        isrch->byte_sge();
                else if(firstword == "sbgt" && !has_value)
                        isrch->byte_sgt();
                else if(firstword == "ublt" && !has_value)
                        isrch->byte_ult();
                else if(firstword == "uble" && !has_value)
                        isrch->byte_ule();
                else if(firstword == "ubeq" && !has_value)
                        isrch->byte_ueq();
                else if(firstword == "ubne" && !has_value)
                        isrch->byte_une();
                else if(firstword == "ubge" && !has_value)
                        isrch->byte_uge();
                else if(firstword == "ubgt" && !has_value)
                        isrch->byte_ugt();
                else if(firstword == "b" && has_value) {
                        if(static_cast<int64_t>(value) < -128 || value > 255)
                                throw std::runtime_error("Value to compare out of range");
                        isrch->byte_value(value & 0xFF);
                } else if(firstword == "swlt" && !has_value)
                        isrch->word_slt();
                else if(firstword == "swle" && !has_value)
                        isrch->word_sle();
                else if(firstword == "sweq" && !has_value)
                        isrch->word_seq();
                else if(firstword == "swne" && !has_value)
                        isrch->word_sne();
                else if(firstword == "swge" && !has_value)
                        isrch->word_sge();
                else if(firstword == "swgt" && !has_value)
                        isrch->word_sgt();
                else if(firstword == "uwlt" && !has_value)
                        isrch->word_ult();
                else if(firstword == "uwle" && !has_value)
                        isrch->word_ule();
                else if(firstword == "uweq" && !has_value)
                        isrch->word_ueq();
                else if(firstword == "uwne" && !has_value)
                        isrch->word_une();
                else if(firstword == "uwge" && !has_value)
                        isrch->word_uge();
                else if(firstword == "uwgt" && !has_value)
                        isrch->word_ugt();
                else if(firstword == "w" && has_value) {
                        if(static_cast<int64_t>(value) < -32768 || value > 65535)
                                throw std::runtime_error("Value to compare out of range");
                        isrch->word_value(value & 0xFF);
                } else if(firstword == "sdlt" && !has_value)
                        isrch->dword_slt();
                else if(firstword == "sdle" && !has_value)
                        isrch->dword_sle();
                else if(firstword == "sdeq" && !has_value)
                        isrch->dword_seq();
                else if(firstword == "sdne" && !has_value)
                        isrch->dword_sne();
                else if(firstword == "sdge" && !has_value)
                        isrch->dword_sge();
                else if(firstword == "sdgt" && !has_value)
                        isrch->dword_sgt();
                else if(firstword == "udlt" && !has_value)
                        isrch->dword_ult();
                else if(firstword == "udle" && !has_value)
                        isrch->dword_ule();
                else if(firstword == "udeq" && !has_value)
                        isrch->dword_ueq();
                else if(firstword == "udne" && !has_value)
                        isrch->dword_une();
                else if(firstword == "udge" && !has_value)
                        isrch->dword_uge();
                else if(firstword == "udgt" && !has_value)
                        isrch->dword_ugt();
                else if(firstword == "d" && has_value) {
                        if(static_cast<int64_t>(value) < -2147483648 || value > 4294967295ULL)
                                throw std::runtime_error("Value to compare out of range");
                        isrch->dword_value(value & 0xFF);
                } else if(firstword == "sqlt" && !has_value)
                        isrch->qword_slt();
                else if(firstword == "sqle" && !has_value)
                        isrch->qword_sle();
                else if(firstword == "sqeq" && !has_value)
                        isrch->qword_seq();
                else if(firstword == "sqne" && !has_value)
                        isrch->qword_sne();
                else if(firstword == "sqge" && !has_value)
                        isrch->qword_sge();
                else if(firstword == "sqgt" && !has_value)
                        isrch->qword_sgt();
                else if(firstword == "uqlt" && !has_value)
                        isrch->qword_ult();
                else if(firstword == "uqle" && !has_value)
                        isrch->qword_ule();
                else if(firstword == "uqeq" && !has_value)
                        isrch->qword_ueq();
                else if(firstword == "uqne" && !has_value)
                        isrch->qword_une();
                else if(firstword == "uqge" && !has_value)
                        isrch->qword_uge();
                else if(firstword == "uqgt" && !has_value)
                        isrch->qword_ugt();
                else if(firstword == "q" && has_value) {
                        isrch->qword_value(value & 0xFF);
                } else if(firstword == "reset" && !has_value)
                        isrch->reset();
                else if(firstword == "count" && !has_value)
                        ;
                else if(firstword == "print" && !has_value) {
                        auto c = isrch->get_candidates();
                        for(auto ci = c.begin(); ci != c.end(); ci++) {
                                std::ostringstream x;
                                x << "0x" << std::hex << std::setw(8) << std::setfill('0') << *ci;
                                out(win) << x.str() << std::endl;
                        }
                } else
                        throw std::runtime_error("Unknown memorysearch subcommand '" + firstword + "'");
                out(win) << isrch->get_candidate_count() << " candidates remain." << std::endl;
                return true;
        }
        return false;
}