2018-03-07 22:38:48 +01:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2015 The Android Open Source Project
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* * Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* * 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 OWNER 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 <stdint.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
|
|
#include <atomic>
|
|
|
|
#include <deque>
|
|
|
|
#include <mutex>
|
|
|
|
#include <string>
|
|
|
|
#include <unordered_map>
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
#include <private/bionic_macros.h>
|
2018-04-05 20:12:38 +02:00
|
|
|
#include <unwindstack/LocalUnwinder.h>
|
2018-03-07 22:38:48 +01:00
|
|
|
|
|
|
|
#include "OptionData.h"
|
2018-04-05 20:12:38 +02:00
|
|
|
#include "UnwindBacktrace.h"
|
2018-03-07 22:38:48 +01:00
|
|
|
|
|
|
|
extern int* g_malloc_zygote_child;
|
|
|
|
|
|
|
|
// Forward declarations.
|
|
|
|
class Config;
|
|
|
|
|
|
|
|
struct FrameKeyType {
|
|
|
|
size_t num_frames;
|
|
|
|
uintptr_t* frames;
|
|
|
|
|
|
|
|
bool operator==(const FrameKeyType& comp) const {
|
|
|
|
if (num_frames != comp.num_frames) return false;
|
|
|
|
for (size_t i = 0; i < num_frames; i++) {
|
|
|
|
if (frames[i] != comp.frames[i]) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
namespace std {
|
|
|
|
template <>
|
|
|
|
struct hash<FrameKeyType> {
|
|
|
|
std::size_t operator()(const FrameKeyType& key) const {
|
|
|
|
std::size_t cur_hash = key.frames[0];
|
|
|
|
// Limit the number of frames to speed up hashing.
|
|
|
|
size_t max_frames = (key.num_frames > 5) ? 5 : key.num_frames;
|
|
|
|
for (size_t i = 1; i < max_frames; i++) {
|
|
|
|
cur_hash ^= key.frames[i];
|
|
|
|
}
|
|
|
|
return cur_hash;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}; // namespace std
|
|
|
|
|
|
|
|
struct FrameInfoType {
|
|
|
|
size_t references = 0;
|
|
|
|
std::vector<uintptr_t> frames;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct PointerInfoType {
|
|
|
|
size_t size;
|
|
|
|
size_t hash_index;
|
|
|
|
size_t RealSize() const { return size & ~(1U << 31); }
|
|
|
|
bool ZygoteChildAlloc() const { return size & (1U << 31); }
|
|
|
|
static size_t GetEncodedSize(size_t size) { return GetEncodedSize(*g_malloc_zygote_child, size); }
|
|
|
|
static size_t GetEncodedSize(bool child_alloc, size_t size) {
|
|
|
|
return size | ((child_alloc) ? (1U << 31) : 0);
|
|
|
|
}
|
|
|
|
static size_t MaxSize() { return (1U << 31) - 1; }
|
|
|
|
};
|
|
|
|
|
|
|
|
struct FreePointerInfoType {
|
|
|
|
uintptr_t pointer;
|
|
|
|
size_t hash_index;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct ListInfoType {
|
|
|
|
uintptr_t pointer;
|
|
|
|
size_t num_allocations;
|
|
|
|
size_t size;
|
|
|
|
bool zygote_child_alloc;
|
|
|
|
FrameInfoType* frame_info;
|
2018-04-05 20:12:38 +02:00
|
|
|
std::vector<unwindstack::LocalFrameData>* backtrace_info;
|
2018-03-07 22:38:48 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
class PointerData : public OptionData {
|
|
|
|
public:
|
|
|
|
PointerData(DebugData* debug_data);
|
|
|
|
virtual ~PointerData() = default;
|
|
|
|
|
|
|
|
bool Initialize(const Config& config);
|
|
|
|
|
|
|
|
inline size_t alloc_offset() { return alloc_offset_; }
|
|
|
|
|
|
|
|
bool ShouldBacktrace() { return backtrace_enabled_ == 1; }
|
|
|
|
void ToggleBacktraceEnabled() { backtrace_enabled_.fetch_xor(1); }
|
|
|
|
|
|
|
|
void EnableDumping() { backtrace_dump_ = true; }
|
|
|
|
bool ShouldDumpAndReset() {
|
|
|
|
bool expected = true;
|
|
|
|
return backtrace_dump_.compare_exchange_strong(expected, false);
|
|
|
|
}
|
|
|
|
|
|
|
|
void PrepareFork();
|
|
|
|
void PostForkParent();
|
|
|
|
void PostForkChild();
|
|
|
|
|
|
|
|
static void GetList(std::vector<ListInfoType>* list, bool only_with_backtrace);
|
|
|
|
static void GetUniqueList(std::vector<ListInfoType>* list, bool only_with_backtrace);
|
|
|
|
|
|
|
|
static size_t AddBacktrace(size_t num_frames);
|
|
|
|
static void RemoveBacktrace(size_t hash_index);
|
|
|
|
|
|
|
|
static void Add(const void* pointer, size_t size);
|
|
|
|
static void Remove(const void* pointer);
|
|
|
|
|
|
|
|
typedef std::unordered_map<uintptr_t, PointerInfoType>::iterator iterator;
|
|
|
|
static iterator begin() { return pointers_.begin(); }
|
|
|
|
static iterator end() { return pointers_.end(); }
|
|
|
|
|
|
|
|
static void* AddFreed(const void* pointer);
|
|
|
|
static void LogFreeError(const FreePointerInfoType& info, size_t usable_size);
|
|
|
|
static void LogFreeBacktrace(const void* ptr);
|
|
|
|
static void VerifyFreedPointer(const FreePointerInfoType& info);
|
|
|
|
static void VerifyAllFreed();
|
|
|
|
|
|
|
|
static void LogLeaks();
|
|
|
|
static void DumpLiveToFile(FILE* fp);
|
|
|
|
|
|
|
|
static void GetInfo(uint8_t** info, size_t* overall_size, size_t* info_size, size_t* total_memory,
|
|
|
|
size_t* backtrace_size);
|
|
|
|
|
|
|
|
static size_t GetFrames(const void* pointer, uintptr_t* frames, size_t max_frames);
|
|
|
|
|
|
|
|
static bool Exists(const void* pointer);
|
|
|
|
|
|
|
|
private:
|
|
|
|
static std::string GetHashString(uintptr_t* frames, size_t num_frames);
|
2018-04-05 20:12:38 +02:00
|
|
|
static void LogBacktrace(size_t hash_index);
|
2018-03-07 22:38:48 +01:00
|
|
|
|
|
|
|
size_t alloc_offset_ = 0;
|
|
|
|
std::vector<uint8_t> cmp_mem_;
|
|
|
|
|
|
|
|
static std::atomic_uint8_t backtrace_enabled_;
|
|
|
|
|
|
|
|
static std::atomic_bool backtrace_dump_;
|
|
|
|
|
|
|
|
static std::mutex pointer_mutex_;
|
|
|
|
static std::unordered_map<uintptr_t, PointerInfoType> pointers_;
|
|
|
|
|
|
|
|
static std::mutex frame_mutex_;
|
|
|
|
static std::unordered_map<FrameKeyType, size_t> key_to_index_;
|
|
|
|
static std::unordered_map<size_t, FrameInfoType> frames_;
|
2018-04-05 20:12:38 +02:00
|
|
|
static std::unordered_map<size_t, std::vector<unwindstack::LocalFrameData>> backtraces_info_;
|
2018-03-07 22:38:48 +01:00
|
|
|
static size_t cur_hash_index_;
|
|
|
|
|
|
|
|
static std::mutex free_pointer_mutex_;
|
|
|
|
static std::deque<FreePointerInfoType> free_pointers_;
|
|
|
|
|
|
|
|
DISALLOW_COPY_AND_ASSIGN(PointerData);
|
|
|
|
};
|