mirror of
https://github.com/vtil-project/VTIL-Core
synced 2026-08-17 08:23:03 -04:00
69 lines
No EOL
2.9 KiB
C++
69 lines
No EOL
2.9 KiB
C++
// Copyright (c) 2020 Can Boluk and contributors of the VTIL Project
|
|
// 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. Neither the name of VTIL Project nor the names of its contributors
|
|
// may be used to endorse or promote products derived from this software
|
|
// without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT OWNER OR CONTRIBUTORS 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.
|
|
//
|
|
#pragma once
|
|
#include <iterator>
|
|
#include <unordered_map>
|
|
#include <memory>
|
|
#include "../expressions/expression.hpp"
|
|
|
|
// [Configuration]
|
|
// Determine whether we should log the details of the simplification process.
|
|
//
|
|
#ifndef VTIL_SYMEX_SIMPLIFY_VERBOSE
|
|
#define VTIL_SYMEX_SIMPLIFY_VERBOSE 1
|
|
#endif
|
|
|
|
namespace vtil::symbolic
|
|
{
|
|
struct simplifier_state;
|
|
struct simplifier_state_deleter
|
|
{
|
|
constexpr simplifier_state_deleter() noexcept = default;
|
|
void operator()( simplifier_state* p ) const noexcept;
|
|
};
|
|
using simplifier_state_ptr = std::unique_ptr<simplifier_state, simplifier_state_deleter>;
|
|
|
|
struct simplifier_state_allocator
|
|
{
|
|
constexpr simplifier_state_allocator() noexcept = default;
|
|
simplifier_state_ptr operator()() const noexcept;
|
|
};
|
|
|
|
// Attempts to simplify the expression given, returns whether the simplification
|
|
// succeeded or not.
|
|
//
|
|
bool simplify_expression( expression::reference& exp, bool pretty = false, bool unpack = true );
|
|
|
|
// Purges the current thread's simplifier cache.
|
|
//
|
|
void purge_simplifier_state();
|
|
|
|
// Swaps the current thread's simplifier cache.
|
|
//
|
|
simplifier_state_ptr swap_simplifier_state( simplifier_state_ptr p = nullptr );
|
|
}; |