forked from jhurliman/binaryninja-api
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfunctiongraph.cpp
More file actions
180 lines (137 loc) · 4.47 KB
/
functiongraph.cpp
File metadata and controls
180 lines (137 loc) · 4.47 KB
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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
// Copyright (c) 2015-2016 Vector 35 LLC
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to
// deal in the Software without restriction, including without limitation the
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
// sell copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
// IN THE SOFTWARE.
#include "binaryninjaapi.h"
using namespace BinaryNinja;
using namespace std;
FunctionGraph::FunctionGraph(BNFunctionGraph* graph): m_graph(graph)
{
}
FunctionGraph::~FunctionGraph()
{
// This object is going away, so ensure that any pending completion routines are
// no longer called
Abort();
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);
}
Ref<DisassemblySettings> FunctionGraph::GetSettings()
{
return new DisassemblySettings(BNGetFunctionGraphSettings(m_graph));
}
void FunctionGraph::StartLayout(BNFunctionGraphType type)
{
BNStartFunctionGraphLayout(m_graph, type);
}
bool FunctionGraph::IsLayoutComplete()
{
return BNIsFunctionGraphLayoutComplete(m_graph);
}
void FunctionGraph::OnComplete(const std::function<void()>& func)
{
m_completeFunc = func;
BNSetFunctionGraphCompleteCallback(m_graph, this, CompleteCallback);
}
void FunctionGraph::Abort()
{
// Must clear the callback with the core before clearing our own function object, as until it
// is cleared in the core it can be called at any time from a different thread.
BNAbortFunctionGraph(m_graph);
m_completeFunc = []() {};
}
vector<Ref<FunctionGraphBlock>> FunctionGraph::GetBlocks()
{
size_t count;
BNFunctionGraphBlock** blocks = BNGetFunctionGraphBlocks(m_graph, &count);
vector<Ref<FunctionGraphBlock>> result;
for (size_t i = 0; i < count; i++)
{
auto block = m_cachedBlocks.find(blocks[i]);
if (block == m_cachedBlocks.end())
{
FunctionGraphBlock* newBlock = new FunctionGraphBlock(BNNewFunctionGraphBlockReference(blocks[i]));
m_cachedBlocks[blocks[i]] = newBlock;
result.push_back(newBlock);
}
else
{
result.push_back(block->second);
}
}
BNFreeFunctionGraphBlockList(blocks, count);
return result;
}
int FunctionGraph::GetWidth() const
{
return BNGetFunctionGraphWidth(m_graph);
}
int FunctionGraph::GetHeight() const
{
return BNGetFunctionGraphHeight(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++)
{
auto block = m_cachedBlocks.find(blocks[i]);
if (block == m_cachedBlocks.end())
{
FunctionGraphBlock* newBlock = new FunctionGraphBlock(BNNewFunctionGraphBlockReference(blocks[i]));
m_cachedBlocks[blocks[i]] = newBlock;
result.push_back(newBlock);
}
else
{
result.push_back(block->second);
}
}
BNFreeFunctionGraphBlockList(blocks, count);
return result;
}
bool FunctionGraph::IsOptionSet(BNDisassemblyOption option) const
{
return BNIsFunctionGraphOptionSet(m_graph, option);
}
void FunctionGraph::SetOption(BNDisassemblyOption option, bool state)
{
BNSetFunctionGraphOption(m_graph, option, state);
}