forked from google/binexport
-
Notifications
You must be signed in to change notification settings - Fork 0
/
operand.cc
106 lines (87 loc) · 3.07 KB
/
operand.cc
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
// Copyright 2011-2021 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include "third_party/zynamics/binexport/operand.h"
#include <iterator>
#include <sstream>
#include "base/logging.h"
Expressions Operand::expressions_;
Operand::OperandCache Operand::operand_cache_;
uint32_t Operand::global_id_ = 0;
// Delete unreferenced operands from cache and relabel surviving ones so we'll
// have continuous ids again.
void Operand::PurgeCache(const absl::flat_hash_set<int>& ids_to_keep) {
int new_id = 0;
for (auto it = operand_cache_.begin(), end = operand_cache_.end();
it != end;) {
if (!ids_to_keep.contains(it->second.id_)) {
operand_cache_.erase(it++);
} else {
it->second.id_ = ++new_id;
++it;
}
}
}
Operand::Operand(const Expressions& expressions)
: id_(0),
expression_index_(static_cast<uint32_t>(expressions_.size())),
expression_count_(static_cast<uint8_t>(expressions.size())) {
expressions_.insert(expressions_.end(), expressions.begin(),
expressions.end());
}
Operand* Operand::CreateOperand(const Expressions& expressions) {
std::string signature;
signature.reserve(expressions.size() * 18 /* bytes for a single signature */);
for (auto* expression : expressions) {
signature.append(expression->CreateSignature());
}
auto it = operand_cache_.find(signature);
if (it != operand_cache_.end()) {
return &it->second;
}
Operand operand(expressions);
// Simply count how many objects are already in the cache.
operand.id_ = ++global_id_;
return &operand_cache_.emplace(signature, operand).first->second;
}
void Operand::EmptyCache() {
Expressions().swap(expressions_);
OperandCache().swap(operand_cache_);
global_id_ = 0;
}
const Operand::OperandCache& Operand::GetOperands() {
return operand_cache_;
}
int Operand::GetId() const {
return id_;
}
Expressions::const_iterator Operand::cbegin() const {
return expressions_.begin() + expression_index_;
}
Expressions::const_iterator Operand::cend() const {
return begin() + expression_count_;
}
Expressions::iterator Operand::begin() const {
return expressions_.begin() + expression_index_;
}
Expressions::iterator Operand::end() const {
return begin() + expression_count_;
}
uint8_t Operand::GetExpressionCount() const { return expression_count_; }
const Expression& Operand::GetExpression(int index) const {
CHECK(index >= 0 && index < GetExpressionCount());
return *expressions_[expression_index_ + index];
}
const Expression& Operand::GetLastExpression() const {
return GetExpression(GetExpressionCount() - 1);
}