1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
#include "binaryninjaapi.h"
using namespace BinaryNinja;
using namespace std;
FunctionGraph::FunctionGraph(BNFunctionGraph* graph): m_graph(graph)
{
}
FunctionGraph::~FunctionGraph()
{
BNFreeFunctionGraph(m_graph);
}
void FunctionGraph::CompleteCallback(void* ctxt)
{
FunctionGraph* graph = (FunctionGraph*)ctxt;
graph->m_completeFunc();
}
Ref<Function> FunctionGraph::GetFunction() const
{
return new Function(BNNewFunctionReference(BNGetFunctionForFunctionGraph(m_graph)));
}
int FunctionGraph::GetHorizontalBlockMargin() const
{
return BNGetHorizontalFunctionGraphBlockMargin(m_graph);
}
int FunctionGraph::GetVerticalBlockMargin() const
{
return BNGetVerticalFunctionGraphBlockMargin(m_graph);
}
void FunctionGraph::SetBlockMargins(int horiz, int vert)
{
BNSetFunctionGraphBlockMargins(m_graph, horiz, vert);
}
void FunctionGraph::StartLayout()
{
BNStartFunctionGraphLayout(m_graph);
}
bool FunctionGraph::IsLayoutComplete()
{
return BNIsFunctionGraphLayoutComplete(m_graph);
}
void FunctionGraph::OnComplete(const std::function<void()>& func)
{
m_completeFunc = func;
BNSetFunctionGraphCompleteCallback(m_graph, this, CompleteCallback);
}
vector<Ref<FunctionGraphBlock>> FunctionGraph::GetBlocks() const
{
size_t count;
BNFunctionGraphBlock** blocks = BNGetFunctionGraphBlocks(m_graph, &count);
vector<Ref<FunctionGraphBlock>> result;
for (size_t i = 0; i < count; i++)
result.push_back(new FunctionGraphBlock(BNNewFunctionGraphBlockReference(blocks[i])));
BNFreeFunctionGraphBlockList(blocks, count);
return result;
}
int FunctionGraph::GetLeftExtent() const
{
return BNGetFunctionGraphLeftExtent(m_graph);
}
int FunctionGraph::GetTopExtent() const
{
return BNGetFunctionGraphTopExtent(m_graph);
}
int FunctionGraph::GetRightExtent() const
{
return BNGetFunctionGraphRightExtent(m_graph);
}
int FunctionGraph::GetBottomExtent() const
{
return BNGetFunctionGraphBottomExtent(m_graph);
}
vector<Ref<FunctionGraphBlock>> FunctionGraph::GetBlocksInRegion(int left, int top, int right, int bottom)
{
size_t count;
BNFunctionGraphBlock** blocks = BNGetFunctionGraphBlocksInRegion(m_graph, left, top, right, bottom, &count);
vector<Ref<FunctionGraphBlock>> result;
for (size_t i = 0; i < count; i++)
result.push_back(new FunctionGraphBlock(BNNewFunctionGraphBlockReference(blocks[i])));
BNFreeFunctionGraphBlockList(blocks, count);
return result;
}
|
