diff options
| author | Rusty Wagner <rusty@vector35.com> | 2016-10-10 18:24:38 -0400 |
|---|---|---|
| committer | Rusty Wagner <rusty@vector35.com> | 2016-10-10 18:24:38 -0400 |
| commit | 98d187d9d86506ea915731266b8faaaa2dc0c9d6 (patch) | |
| tree | fa1ee82d342c12ed5d42e7caf9397312edf7cf63 /functiongraph.cpp | |
| parent | 4598adb7ae961e69fb6ed3e594c0244c49eef511 (diff) | |
| parent | 55ac7a184b7956c0c2e2ca41d512e7c4a81267d9 (diff) | |
Merge commit '55ac7a184b7956c0c2e2ca41d512e7c4a81267d9'
Diffstat (limited to 'functiongraph.cpp')
| -rw-r--r-- | functiongraph.cpp | 30 |
1 files changed, 27 insertions, 3 deletions
diff --git a/functiongraph.cpp b/functiongraph.cpp index 93f60f63..30e2e165 100644 --- a/functiongraph.cpp +++ b/functiongraph.cpp @@ -104,14 +104,26 @@ void FunctionGraph::Abort() } -vector<Ref<FunctionGraphBlock>> FunctionGraph::GetBlocks() const +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++) - result.push_back(new FunctionGraphBlock(BNNewFunctionGraphBlockReference(blocks[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; @@ -137,7 +149,19 @@ vector<Ref<FunctionGraphBlock>> FunctionGraph::GetBlocksInRegion(int left, int t vector<Ref<FunctionGraphBlock>> result; for (size_t i = 0; i < count; i++) - result.push_back(new FunctionGraphBlock(BNNewFunctionGraphBlockReference(blocks[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; |
