mirror of
https://github.com/RGBCube/serenity
synced 2025-05-31 04:48:14 +00:00
2fceffff6f
Instead of doing an O(n) scan over all the mallocations whenever we're doing a read/write audit, UE now keeps track of ChunkedBlocks and their chunks. Both the block lookup and the chunk lookup is O(1). We know what ChunkedBlocks look like via mallocdefs.h from LibC. Note that the old linear scan is still in use for big mallocations, but the vast majority of mallocations are chunked, so this helps a lot. This makes malloc auditing significantly faster! :^)
101 lines
3.2 KiB
C++
101 lines
3.2 KiB
C++
/*
|
|
* Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/Badge.h>
|
|
#include <AK/HashMap.h>
|
|
#include <AK/OwnPtr.h>
|
|
#include <AK/Types.h>
|
|
#include <AK/Vector.h>
|
|
|
|
namespace UserspaceEmulator {
|
|
|
|
class SoftCPU;
|
|
|
|
class MallocTracer {
|
|
public:
|
|
MallocTracer();
|
|
|
|
void target_did_malloc(Badge<SoftCPU>, FlatPtr address, size_t);
|
|
void target_did_free(Badge<SoftCPU>, FlatPtr address);
|
|
void target_did_realloc(Badge<SoftCPU>, FlatPtr address, size_t);
|
|
|
|
void audit_read(FlatPtr address, size_t);
|
|
void audit_write(FlatPtr address, size_t);
|
|
|
|
void dump_leak_report();
|
|
|
|
private:
|
|
struct Mallocation {
|
|
bool contains(FlatPtr a) const
|
|
{
|
|
return a >= address && a < (address + size);
|
|
}
|
|
|
|
FlatPtr address { 0 };
|
|
size_t size { 0 };
|
|
bool used { false };
|
|
bool freed { false };
|
|
|
|
Vector<FlatPtr> malloc_backtrace;
|
|
Vector<FlatPtr> free_backtrace;
|
|
};
|
|
|
|
struct TrackedChunkedBlock {
|
|
FlatPtr address { 0 };
|
|
size_t chunk_size { 0 };
|
|
|
|
Vector<Mallocation> mallocations;
|
|
};
|
|
|
|
template<typename Callback>
|
|
void for_each_mallocation(Callback callback) const
|
|
{
|
|
for (auto& it : m_chunked_blocks) {
|
|
for (auto& mallocation : it.value->mallocations) {
|
|
if (mallocation.used && callback(mallocation) == IterationDecision::Break)
|
|
return;
|
|
}
|
|
}
|
|
for (auto& big_mallocation : m_big_mallocations) {
|
|
if (callback(big_mallocation) == IterationDecision::Break)
|
|
return;
|
|
}
|
|
}
|
|
|
|
Mallocation* find_mallocation(FlatPtr);
|
|
Mallocation* find_mallocation_before(FlatPtr);
|
|
Mallocation* find_mallocation_after(FlatPtr);
|
|
bool is_reachable(const Mallocation&) const;
|
|
|
|
HashMap<FlatPtr, NonnullOwnPtr<TrackedChunkedBlock>> m_chunked_blocks;
|
|
Vector<Mallocation> m_big_mallocations;
|
|
|
|
bool m_auditing_enabled { true };
|
|
};
|
|
|
|
}
|