mirror of
https://github.com/vtil-project/VTIL-Core
synced 2026-08-17 08:23:03 -04:00
62 lines
No EOL
2.4 KiB
C++
62 lines
No EOL
2.4 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 mosquitto 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 <vtil/arch>
|
|
#include "../common/interface.hpp"
|
|
|
|
namespace vtil::optimizer
|
|
{
|
|
// Removes every non-volatile instruction whose effects are
|
|
// ignored or overwritten.
|
|
//
|
|
struct dead_code_elimination_pass : pass_interface<true>
|
|
{
|
|
cached_tracer ctrace;
|
|
std::set<basic_block*> visited;
|
|
|
|
size_t pass( basic_block* blk, bool xblock = false ) override;
|
|
|
|
// Cross block logic should execute from the bottom.
|
|
//
|
|
size_t cpass( basic_block* blk )
|
|
{
|
|
if ( visited.contains( blk ) )
|
|
return 0;
|
|
visited.insert( blk );
|
|
size_t count = 0;
|
|
for ( basic_block* block : blk->next )
|
|
count += cpass( block );
|
|
count += pass( blk, true );
|
|
return count;
|
|
}
|
|
size_t xpass( routine* rtn ) override
|
|
{
|
|
return cpass( rtn->entry_point );
|
|
}
|
|
};
|
|
}; |