2004-07-16 23:30:11 +04:00
|
|
|
/* ***** BEGIN LICENSE BLOCK *****
|
|
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
|
|
*
|
|
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
|
|
* 1.1 (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.mozilla.org/MPL/
|
|
|
|
*
|
|
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
|
|
* for the specific language governing rights and limitations under the
|
|
|
|
* License.
|
|
|
|
*
|
|
|
|
* The Original Code is mozilla.org code.
|
|
|
|
*
|
|
|
|
* The Initial Developer of the Original Code is
|
|
|
|
* Kipp E.B. Hickman.
|
|
|
|
* Portions created by the Initial Developer are Copyright (C) 1999
|
|
|
|
* the Initial Developer. All Rights Reserved.
|
|
|
|
*
|
|
|
|
* Contributor(s):
|
|
|
|
*
|
|
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
|
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
|
|
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
|
|
* the provisions above, a recipient may use your version of this file under
|
|
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
|
|
*
|
|
|
|
* ***** END LICENSE BLOCK ***** */
|
1999-05-14 20:32:07 +04:00
|
|
|
|
|
|
|
#ifndef __leaky_h_
|
|
|
|
#define __leaky_h_
|
|
|
|
|
|
|
|
#include "config.h"
|
1999-09-26 10:31:18 +04:00
|
|
|
#include <stdio.h>
|
1999-09-30 05:51:20 +04:00
|
|
|
#include <string.h>
|
1999-05-14 20:32:07 +04:00
|
|
|
#include <sys/types.h>
|
|
|
|
#include "dict.h"
|
|
|
|
#include "strset.h"
|
2003-08-02 01:42:02 +04:00
|
|
|
#include "xpcom-config.h" // for CPP_NEW_THROW
|
1999-05-14 20:32:07 +04:00
|
|
|
|
1999-09-25 11:09:15 +04:00
|
|
|
typedef unsigned int u_int;
|
|
|
|
|
1999-09-26 10:31:18 +04:00
|
|
|
struct Symbol;
|
|
|
|
|
1999-09-30 05:51:20 +04:00
|
|
|
struct TreeNode {
|
|
|
|
TreeNode(Symbol* aSymbol) {
|
1999-09-26 10:31:18 +04:00
|
|
|
symbol = aSymbol;
|
1999-09-30 05:51:20 +04:00
|
|
|
nextSibling = NULL;
|
|
|
|
descendants = NULL;
|
1999-10-01 01:22:16 +04:00
|
|
|
nextRoot = NULL;
|
1999-10-05 00:25:53 +04:00
|
|
|
bytesLeaked = 0;
|
|
|
|
descendantBytesLeaked = 0;
|
1999-09-26 10:31:18 +04:00
|
|
|
}
|
|
|
|
|
1999-09-30 05:51:20 +04:00
|
|
|
TreeNode* GetDirectDescendant(Symbol* aSymbol);
|
|
|
|
|
|
|
|
bool HasDescendants() const {
|
|
|
|
return NULL != descendants;
|
|
|
|
}
|
|
|
|
|
|
|
|
TreeNode* AddDescendant(Symbol* aSymbol);
|
1999-09-26 10:31:18 +04:00
|
|
|
|
1999-09-30 05:51:20 +04:00
|
|
|
TreeNode* descendants;
|
|
|
|
TreeNode* nextSibling;
|
1999-10-01 01:22:16 +04:00
|
|
|
TreeNode* nextRoot;
|
1999-09-26 10:31:18 +04:00
|
|
|
Symbol* symbol;
|
|
|
|
|
1999-09-30 05:51:20 +04:00
|
|
|
u_long bytesLeaked;
|
|
|
|
u_long descendantBytesLeaked;
|
|
|
|
|
2002-07-03 00:25:30 +04:00
|
|
|
void* operator new(size_t size) CPP_THROW_NEW ;
|
1999-09-30 05:51:20 +04:00
|
|
|
void operator delete(void* ptr);
|
|
|
|
|
|
|
|
static TreeNode* freeList;
|
1999-09-26 10:31:18 +04:00
|
|
|
};
|
|
|
|
|
1999-05-14 20:32:07 +04:00
|
|
|
struct Symbol {
|
1999-09-26 10:31:18 +04:00
|
|
|
char* name;
|
1999-05-14 20:32:07 +04:00
|
|
|
u_long address;
|
1999-09-30 05:51:20 +04:00
|
|
|
TreeNode* root;
|
1999-09-26 10:31:18 +04:00
|
|
|
|
1999-09-30 05:51:20 +04:00
|
|
|
void Init(const char* aName, u_long aAddress) {
|
1999-11-10 02:04:16 +03:00
|
|
|
name = aName ? strdup(aName) : (char *)"";
|
1999-09-30 05:51:20 +04:00
|
|
|
address = aAddress;
|
|
|
|
root = NULL;
|
1999-09-26 10:31:18 +04:00
|
|
|
}
|
1999-05-14 20:32:07 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
struct LoadMapEntry {
|
|
|
|
char* name; // name of .so
|
|
|
|
u_long address; // base address where it was mapped in
|
|
|
|
LoadMapEntry* next;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct leaky {
|
|
|
|
leaky();
|
|
|
|
~leaky();
|
|
|
|
|
|
|
|
void initialize(int argc, char** argv);
|
|
|
|
void open();
|
|
|
|
|
|
|
|
char* applicationName;
|
|
|
|
char* logFile;
|
|
|
|
char* progFile;
|
|
|
|
|
1999-10-04 20:32:03 +04:00
|
|
|
int dumpLeaks;
|
1999-09-26 10:31:18 +04:00
|
|
|
int dumpGraph;
|
1999-09-30 05:51:20 +04:00
|
|
|
int dumpHTML;
|
1999-05-14 20:32:07 +04:00
|
|
|
int quiet;
|
1999-10-04 20:32:03 +04:00
|
|
|
int dumpEntireLog;
|
1999-05-14 20:32:07 +04:00
|
|
|
int showAddress;
|
1999-10-04 20:32:03 +04:00
|
|
|
bool dumpRefcnts;
|
1999-05-14 20:32:07 +04:00
|
|
|
u_int stackDepth;
|
|
|
|
|
1999-09-30 05:51:20 +04:00
|
|
|
int mappedLogFile;
|
|
|
|
malloc_log_entry* firstLogEntry;
|
|
|
|
malloc_log_entry* lastLogEntry;
|
1999-05-14 20:32:07 +04:00
|
|
|
u_int buckets;
|
|
|
|
MallocDict* dict;
|
1999-10-04 20:32:03 +04:00
|
|
|
MallocDict* refcntDict;
|
1999-05-14 20:32:07 +04:00
|
|
|
|
|
|
|
u_long mallocs;
|
|
|
|
u_long reallocs;
|
|
|
|
u_long frees;
|
|
|
|
u_long totalMalloced;
|
|
|
|
u_long errors;
|
|
|
|
u_long totalLeaked;
|
|
|
|
|
|
|
|
int sfd;
|
|
|
|
Symbol* externalSymbols;
|
|
|
|
u_int usefulSymbols;
|
|
|
|
u_int numExternalSymbols;
|
|
|
|
StrSet exclusions;
|
|
|
|
u_long lowestSymbolAddr;
|
|
|
|
u_long highestSymbolAddr;
|
|
|
|
|
|
|
|
LoadMapEntry* loadMap;
|
|
|
|
|
1999-10-01 01:22:16 +04:00
|
|
|
TreeNode* rootList;
|
|
|
|
|
|
|
|
StrSet roots;
|
1999-10-04 20:32:03 +04:00
|
|
|
StrSet includes;
|
1999-10-01 01:22:16 +04:00
|
|
|
|
1999-05-14 20:32:07 +04:00
|
|
|
void usageError();
|
|
|
|
|
|
|
|
void LoadMap();
|
|
|
|
|
|
|
|
void analyze();
|
|
|
|
|
|
|
|
void dumpLog();
|
|
|
|
void dumpEntryToLog(malloc_log_entry* lep);
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
void dumpToTree();
|
|
|
|
void dumpEntryToTree(FILE* fp, malloc_log_entry* lep);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
void insertAddress(u_long address, malloc_log_entry* lep);
|
|
|
|
void removeAddress(u_long address, malloc_log_entry* lep);
|
|
|
|
|
1999-09-30 05:51:20 +04:00
|
|
|
void displayStackTrace(FILE* out, malloc_log_entry* lep);
|
1999-05-14 20:32:07 +04:00
|
|
|
|
|
|
|
void ReadSymbols(const char* fileName, u_long aBaseAddress);
|
|
|
|
void ReadSharedLibrarySymbols();
|
|
|
|
void setupSymbols(const char* fileName);
|
1999-09-26 10:31:18 +04:00
|
|
|
Symbol* findSymbol(u_long address);
|
1999-10-04 20:32:03 +04:00
|
|
|
bool excluded(malloc_log_entry* lep);
|
|
|
|
bool included(malloc_log_entry* lep);
|
1999-09-26 10:31:18 +04:00
|
|
|
|
|
|
|
void buildLeakGraph();
|
|
|
|
Symbol* findLeakGraphRoot(Symbol* aStart, Symbol* aEnd);
|
|
|
|
void dumpLeakGraph();
|
1999-09-30 05:51:20 +04:00
|
|
|
void dumpLeakTree(TreeNode* aNode, int aIndent);
|
1999-09-26 10:31:18 +04:00
|
|
|
|
1999-10-04 20:32:03 +04:00
|
|
|
bool ShowThisEntry(malloc_log_entry* lep);
|
|
|
|
|
|
|
|
bool IsRefcnt(malloc_log_entry* lep) const {
|
|
|
|
return (lep->type == malloc_log_addref) ||
|
|
|
|
(lep->type == malloc_log_release);
|
|
|
|
}
|
|
|
|
|
1999-09-26 10:31:18 +04:00
|
|
|
static void indentBy(int aCount) {
|
|
|
|
while (--aCount >= 0) fputs(" ", stdout);
|
|
|
|
}
|
1999-05-14 20:32:07 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
#endif /* __leaky_h_ */
|