denuvo-ref/VTIL-Core
1
0
Fork 0
mirror of https://github.com/vtil-project/VTIL-Core synced 2026-08-17 08:23:03 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

Remove unnecessary type erasure.

Browse source
This commit is contained in:
Can Bölük 2020-08-21 08:14:49 +02:00
parent 8bedc73714
commit 1c2260f73e
1 changed files with 33 additions and 46 deletions
Download patch file Download diff file Expand all files Collapse all files

79
VTIL-Architecture/trace/cached_tracer.cpp
View file

@ -55,52 +55,6 @@ namespace vtil
return result;
}
// Declare a predicate for the search of the variable in the cache.
//
function_view<bool( const cache_entry& )> predicate;
// If memory variable:
//
if ( lookup.is_memory() )
{
predicate = [ & ] ( const cache_entry& pair )
{
// Key must be of memory type at the same position.
//
if ( !pair.first.is_memory() ) return false;
if ( pair.first.at != lookup.at ) return false;
// Must be the same pointer and have a larger or equal size.
//
auto& self = lookup.mem();
auto& other = pair.first.mem();
return self.decay()->equals( *other.decay() ) &&
self.bit_count >= other.bit_count;
};
}
// If register variable:
//
else
{
fassert( lookup.is_register() );
predicate = [ & ] ( const cache_entry& pair )
{
// Key must be of memory type at the same position.
//
if ( !pair.first.is_register() ) return false;
if ( pair.first.at != lookup.at ) return false;
// Must be the same register and have a larger or equal size.
//
auto& self = lookup.reg();
auto& other = pair.first.reg();
return self.flags == other.flags &&
self.combined_id == other.combined_id &&
self.bit_offset == other.bit_offset &&
self.bit_count >= other.bit_count;
};
}
// Try lookup the exact variable in the map in a fast manner.
//
std::shared_lock lock{ mtx };
@ -143,6 +97,39 @@ namespace vtil
return result;
}
// Declare a predicate for the search of the variable in the cache.
//
auto predicate = [ & ] ( const cache_entry& pair )
{
// Key must be of same type at the same position.
//
if ( pair.first.is_register() != lookup.is_register() ||
pair.first.at != lookup.at )
return false;
if ( lookup.is_memory() )
{
// Must be the same pointer and have a larger or equal size.
//
auto& self = lookup.mem();
auto& other = pair.first.mem();
return self.bit_count >= other.bit_count &&
self.decay()->equals( *other.decay() );
}
else
{
// Must be the same register and have a larger or equal size.
//
auto& self = lookup.reg();
auto& other = pair.first.reg();
return self.flags == other.flags &&
self.combined_id == other.combined_id &&
self.bit_offset == other.bit_offset &&
self.bit_count >= other.bit_count;
}
};
// Search the map, if we find a matching entry shrink and use as the result.
//
symbolic::expression::reference result;