forked from Pissandshittium/pissandshittium
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlogs.cc
335 lines (275 loc) · 11 KB
/
logs.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
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
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
// Copyright 2018 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/chrome_elf/third_party_dlls/logs.h"
#include <windows.h>
#include <assert.h>
#include <atomic>
#include <vector>
#include "chrome/chrome_elf/sha1/sha1.h"
namespace third_party_dlls {
namespace {
enum { kMaxLogEntries = 100, kMaxMutexWaitMs = 5000 };
// Mutex for log access;
HANDLE g_log_mutex = nullptr;
// An event handle that can be registered by outside modules via
// RegisterLogNotification().
HANDLE g_notification_event = nullptr;
// Keep track of the count of blocked modules.
std::atomic<uint32_t> g_blocked_modules_count;
std::atomic<uint32_t> g_unique_blocked_modules_count;
// This structure will be translated into LogEntry when draining log.
struct LogEntryInternal {
uint32_t image_size;
uint32_t time_date_stamp;
std::string full_path;
};
// Converts a given LogEntryInternal into a LogEntry.
void TranslateEntry(LogType log_type,
const LogEntryInternal& src,
LogEntry* dst) {
dst->type = log_type;
dst->module_size = src.image_size;
dst->time_date_stamp = src.time_date_stamp;
// Sanity check - there should be no LogEntryInternal with a too long path.
// LogLoadAttempt() ensures this.
assert(src.full_path.size() < std::numeric_limits<uint32_t>::max());
dst->path_len = static_cast<uint32_t>(src.full_path.size());
::memcpy(dst->path, src.full_path.c_str(), dst->path_len + 1);
}
//------------------------------------------------------------------------------
// Log
// Class wrapper for internal logging events of module load attempts.
// - A Log instance will either track 'block' events, or 'allow' events.
//------------------------------------------------------------------------------
class Log;
Log& GetBlockedRecordLog();
class Log {
public:
// Move constructor
Log(Log&&) noexcept = default;
// Move assignment
Log& operator=(Log&&) noexcept = default;
// Constructor - |log_type| indicates what LogType this instance holds.
explicit Log(LogType log_type) : log_type_(log_type) {}
Log(const Log&) = delete;
Log& operator=(const Log&) = delete;
// Returns the size in bytes of the full log, in terms of LogEntry structs.
// I.e. how many bytes would a provided buffer need to be to DrainLog().
uint32_t GetFullLogSize() const {
uint32_t size = 0;
for (auto entry : entries_) {
size += GetLogEntrySize(static_cast<uint32_t>(entry.full_path.size()));
}
return size;
}
// Add a LogEntryInternal to the log. Take ownership of the argument.
void AddEntry(LogEntryInternal&& entry) {
if (log_type_ == LogType::kBlocked) {
// Count the number of modules that were blocked.
g_blocked_modules_count.fetch_add(1, std::memory_order_relaxed);
// As opposed to kAllowed entries, it's possible to receive duplicate
// kBlocked entries. Do not add a new entry for those duplicates.
if (GetBlockedRecordLog().ContainsEntry(entry) || ContainsEntry(entry)) {
return;
} else {
// Also count the number of unique modules that were blocked.
g_unique_blocked_modules_count.fetch_add(1, std::memory_order_relaxed);
}
}
// Ensure the log size stays reasonable.
if (entries_.size() == kMaxLogEntries)
return;
entries_.push_back(std::move(entry));
// Fire the global notification event - if any is registered.
if (g_notification_event)
::SetEvent(g_notification_event);
}
// Writes entries from the start of this Log into |buffer| until either all
// entries have been written or until no more will fit within |buffer_size|.
// - Emitted entries are removed from the log.
// - The number of bytes_written is returned.
uint32_t Drain(uint8_t* buffer, uint32_t buffer_size) {
uint32_t remaining_buffer_size = buffer_size;
uint32_t pop_count = 0;
uint32_t entry_size = 0;
uint32_t bytes_written = 0;
// Drain as many entries as possible.
for (auto entry : entries_) {
entry_size =
GetLogEntrySize(static_cast<uint32_t>(entry.full_path.size()));
if (remaining_buffer_size < entry_size)
break;
LogEntry* temp = reinterpret_cast<LogEntry*>(buffer + bytes_written);
TranslateEntry(log_type_, entry, temp);
// Update counters.
remaining_buffer_size -= entry_size;
bytes_written += entry_size;
++pop_count;
}
DequeueEntries(pop_count);
return bytes_written;
}
// Insert a block of log entries, silently and efficiently.
// - Intended for use with backing up logs to another Log object. Normal
// logging events should be added via AddEntry().
void InsertAtEnd(std::vector<LogEntryInternal>::iterator first_element,
uint32_t count) {
size_t elements = (entries_.size() + count <= kMaxLogEntries)
? count
: kMaxLogEntries - entries_.size();
assert(elements <= count);
if (elements)
entries_.insert(entries_.end(), first_element, first_element + elements);
}
// Empty the log.
void Reset() { entries_.clear(); }
private:
// Logs are currently unordered, so just loop.
// - Returns true if the given hashes already exist in the log.
bool ContainsEntry(const LogEntryInternal& new_entry) const {
for (auto entry : entries_) {
// Compare strings last, only if everything else matches, for efficiency.
if (new_entry.image_size == entry.image_size &&
new_entry.time_date_stamp == entry.time_date_stamp &&
new_entry.full_path.compare(entry.full_path) == 0) {
return true;
}
}
return false;
}
// Remove |count| entries from start of log vector.
// - More efficient to take a chunk off the vector once, instead of one entry
// at a time.
// - NOTE: use this function from Drain().
void DequeueEntries(uint32_t count) {
assert(count <= entries_.size());
if (log_type_ == LogType::kBlocked) {
// Backup block logs to the "permanent" record log.
GetBlockedRecordLog().InsertAtEnd(entries_.begin(), count);
}
entries_.erase(entries_.begin(), entries_.begin() + count);
}
LogType log_type_;
std::vector<LogEntryInternal> entries_;
};
//------------------------------------------------------------------------------
// The internal log structures
//
// NOTE: these "globals" are only initialized once during InitLogs().
// NOTE: they are wrapped in functions to prevent exit-time dtors.
//
// *These returned Log instances must only be accessed under g_log_mutex.
//------------------------------------------------------------------------------
Log& GetAllowedLog() {
static Log* const allowed_log = new Log(LogType::kAllowed);
return *allowed_log;
}
Log& GetBlockedLog() {
static Log* const blocked_log = new Log(LogType::kBlocked);
return *blocked_log;
}
// This Log will hold kBlocked logs "permanently" across calls to Drain(), to
// prevent spammy duplicates across drains. This Log is internal only, and
// is not drained itself.
Log& GetBlockedRecordLog() {
static Log* const blocked_record_log = new Log(LogType::kBlocked);
return *blocked_record_log;
}
} // namespace
//------------------------------------------------------------------------------
// Public defines & functions
//------------------------------------------------------------------------------
// This is called from inside a hook shim, so don't bother with return status.
void LogLoadAttempt(LogType log_type,
uint32_t image_size,
uint32_t time_date_stamp,
const std::string& full_image_path) {
assert(g_log_mutex);
if (::WaitForSingleObject(g_log_mutex, kMaxMutexWaitMs) != WAIT_OBJECT_0)
return;
// Build the new log entry.
LogEntryInternal entry;
entry.image_size = image_size;
entry.time_date_stamp = time_date_stamp;
entry.full_path = full_image_path;
// Edge condition. Ensure the path length is <= max(uint32_t) - 1.
if (entry.full_path.size() > std::numeric_limits<uint32_t>::max() - 1)
entry.full_path.resize(std::numeric_limits<uint32_t>::max() - 1);
// Add the new entry.
Log& log =
(log_type == LogType::kBlocked ? GetBlockedLog() : GetAllowedLog());
log.AddEntry(std::move(entry));
::ReleaseMutex(g_log_mutex);
}
ThirdPartyStatus InitLogs() {
// Debug check: InitLogs should not be called more than once.
assert(!g_log_mutex);
// Create unnamed mutex for log access.
g_log_mutex = ::CreateMutex(nullptr, false, nullptr);
if (!g_log_mutex)
return ThirdPartyStatus::kLogsCreateMutexFailure;
return ThirdPartyStatus::kSuccess;
}
void DeinitLogs() {
if (g_log_mutex)
::CloseHandle(g_log_mutex);
g_log_mutex = nullptr;
GetBlockedLog().Reset();
GetBlockedRecordLog().Reset();
GetAllowedLog().Reset();
}
} // namespace third_party_dlls
//------------------------------------------------------------------------------
// Exports
// - Function definition in logging_api.h
// - Export declared in chrome_elf_[x64|x86].def
//------------------------------------------------------------------------------
uint32_t DrainLog(uint8_t* buffer,
uint32_t buffer_size,
uint32_t* log_remaining) {
if (!third_party_dlls::g_log_mutex ||
::WaitForSingleObject(third_party_dlls::g_log_mutex,
third_party_dlls::kMaxMutexWaitMs) != WAIT_OBJECT_0)
return 0;
third_party_dlls::Log& blocked = third_party_dlls::GetBlockedLog();
third_party_dlls::Log& allowed = third_party_dlls::GetAllowedLog();
uint32_t bytes_written = blocked.Drain(buffer, buffer_size);
bytes_written +=
allowed.Drain(buffer + bytes_written, buffer_size - bytes_written);
// If requested, return the remaining logs size.
if (log_remaining) {
// Edge case: maximum 32-bit value.
uint64_t full_size = blocked.GetFullLogSize() + allowed.GetFullLogSize();
if (full_size > std::numeric_limits<uint32_t>::max())
*log_remaining = std::numeric_limits<uint32_t>::max();
else
*log_remaining = static_cast<uint32_t>(full_size);
}
::ReleaseMutex(third_party_dlls::g_log_mutex);
return bytes_written;
}
bool RegisterLogNotification(HANDLE event_handle) {
if (!third_party_dlls::g_log_mutex)
return false;
// Duplicate the new handle, if not clearing with nullptr.
HANDLE temp = nullptr;
if (event_handle && !::DuplicateHandle(::GetCurrentProcess(), event_handle,
::GetCurrentProcess(), &temp, 0, FALSE,
DUPLICATE_SAME_ACCESS)) {
return false;
}
// Close any existing registered handle.
if (third_party_dlls::g_notification_event)
::CloseHandle(third_party_dlls::g_notification_event);
third_party_dlls::g_notification_event = temp;
return true;
}
uint32_t GetBlockedModulesCount() {
return third_party_dlls::g_blocked_modules_count.load(
std::memory_order_relaxed);
}
uint32_t GetUniqueBlockedModulesCount() {
return third_party_dlls::g_unique_blocked_modules_count.load(
std::memory_order_relaxed);
}