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

Better naming of depth ordered list.

Browse source
This commit is contained in:
Can Bölük 2020-08-23 03:55:23 +02:00
parent 3bff85e673
commit fbd82c8469
3 changed files with 5 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

2
VTIL-Architecture/routine/routine.cpp
View file

@ -291,7 +291,7 @@ namespace vtil
// Gets a list of depth ordered block lists that can be analysed in parallel without any dependencies on previous level.
//
std::vector<routine::depth_entry> routine::get_depth_ordered_list( bool fwd ) const
std::vector<routine::depth_placement> routine::get_depth_ordered_list( bool fwd ) const
{
// Acquire the routine mutex.
//

6
VTIL-Architecture/routine/routine.hpp
View file

@ -108,7 +108,7 @@ namespace vtil
// Cache of depth ordered lists.
//
struct depth_entry
struct depth_placement
{
size_t level_dependency;
size_t level_depth;
@ -117,7 +117,7 @@ namespace vtil
struct depth_ordered_list
{
epoch_t epoch = invalid_epoch;
std::vector<routine::depth_entry> list;
std::vector<routine::depth_placement> list;
};
mutable depth_ordered_list depth_ordered_list_cache[ 2 ];
@ -236,7 +236,7 @@ namespace vtil
// Gets a list of depth ordered block lists that can be analysed in parallel without any dependencies on previous level.
//
std::vector<depth_entry> get_depth_ordered_list( bool fwd ) const;
std::vector<depth_placement> get_depth_ordered_list( bool fwd ) const;
// Provide basic statistics about the complexity of the routine.
//

2
VTIL-Common/util/range.hpp
View file

@ -38,7 +38,7 @@ namespace vtil
iterator_type iend;
constexpr iterator_type begin() const { return ibegin; }
constexpr iterator_type end() const { return iend; }
constexpr iterator_type end() const { return iend; }
};
template<typename iterator_type>