2009-10-03 07:21:34 +00:00
|
|
|
/* -*- Mode: C++; tab-width: 50; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
|
|
/* ***** 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
|
|
|
|
* mozilla.org
|
|
|
|
* Portions created by the Initial Developer are Copyright (C) 2008
|
|
|
|
* the Initial Developer. All Rights Reserved.
|
|
|
|
*
|
|
|
|
* Contributor(s):
|
|
|
|
* Vladimir Vukicevic <vladimir@pobox.com> (original author)
|
|
|
|
*
|
|
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
|
|
* either of 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 ***** */
|
2008-03-06 01:28:25 +00:00
|
|
|
|
2011-07-07 05:54:34 +00:00
|
|
|
#include "nsAutoPtr.h"
|
2008-03-06 01:28:25 +00:00
|
|
|
#include "nsCOMPtr.h"
|
|
|
|
#include "nsServiceManagerUtils.h"
|
|
|
|
#include "nsMemoryReporterManager.h"
|
|
|
|
#include "nsArrayEnumerator.h"
|
2011-07-07 05:54:34 +00:00
|
|
|
#include "nsISimpleEnumerator.h"
|
2008-03-06 01:28:25 +00:00
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
#if defined(XP_LINUX) || defined(XP_MACOSX)
|
|
|
|
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/resource.h>
|
|
|
|
|
|
|
|
static PRInt64 GetHardPageFaults()
|
|
|
|
{
|
|
|
|
struct rusage usage;
|
|
|
|
int err = getrusage(RUSAGE_SELF, &usage);
|
|
|
|
if (err != 0) {
|
|
|
|
return PRInt64(-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
return usage.ru_majflt;
|
|
|
|
}
|
|
|
|
|
|
|
|
static PRInt64 GetSoftPageFaults()
|
|
|
|
{
|
|
|
|
struct rusage usage;
|
|
|
|
int err = getrusage(RUSAGE_SELF, &usage);
|
|
|
|
if (err != 0) {
|
|
|
|
return PRInt64(-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
return usage.ru_minflt;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2011-05-04 00:12:58 +00:00
|
|
|
#if defined(XP_LINUX)
|
|
|
|
|
|
|
|
#include <unistd.h>
|
|
|
|
static PRInt64 GetProcSelfStatmField(int n)
|
|
|
|
{
|
|
|
|
// There are more than two fields, but we're only interested in the first
|
|
|
|
// two.
|
|
|
|
static const int MAX_FIELD = 2;
|
|
|
|
size_t fields[MAX_FIELD];
|
|
|
|
NS_ASSERTION(n < MAX_FIELD, "bad field number");
|
|
|
|
FILE *f = fopen("/proc/self/statm", "r");
|
|
|
|
if (f) {
|
|
|
|
int nread = fscanf(f, "%lu %lu", &fields[0], &fields[1]);
|
|
|
|
fclose(f);
|
|
|
|
return (PRInt64) ((nread == MAX_FIELD) ? fields[n]*getpagesize() : -1);
|
|
|
|
}
|
|
|
|
return (PRInt64) -1;
|
|
|
|
}
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetVsize()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
|
|
|
return GetProcSelfStatmField(0);
|
|
|
|
}
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetResident()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
|
|
|
return GetProcSelfStatmField(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
#elif defined(XP_MACOSX)
|
|
|
|
|
|
|
|
#include <mach/mach_init.h>
|
|
|
|
#include <mach/task.h>
|
|
|
|
|
|
|
|
static bool GetTaskBasicInfo(struct task_basic_info *ti)
|
|
|
|
{
|
|
|
|
mach_msg_type_number_t count = TASK_BASIC_INFO_COUNT;
|
|
|
|
kern_return_t kr = task_info(mach_task_self(), TASK_BASIC_INFO,
|
|
|
|
(task_info_t)ti, &count);
|
|
|
|
return kr == KERN_SUCCESS;
|
|
|
|
}
|
|
|
|
|
2011-05-23 02:49:56 +00:00
|
|
|
// The VSIZE figure on Mac includes huge amounts of shared memory and is always
|
|
|
|
// absurdly high, eg. 2GB+ even at start-up. But both 'top' and 'ps' report
|
|
|
|
// it, so we might as well too.
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetVsize()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
|
|
|
task_basic_info ti;
|
|
|
|
return (PRInt64) (GetTaskBasicInfo(&ti) ? ti.virtual_size : -1);
|
|
|
|
}
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetResident()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
|
|
|
task_basic_info ti;
|
|
|
|
return (PRInt64) (GetTaskBasicInfo(&ti) ? ti.resident_size : -1);
|
|
|
|
}
|
|
|
|
|
|
|
|
#elif defined(XP_WIN)
|
|
|
|
|
|
|
|
#include <windows.h>
|
|
|
|
#include <psapi.h>
|
|
|
|
|
2011-06-30 14:46:30 +00:00
|
|
|
static PRInt64 GetVsize()
|
|
|
|
{
|
|
|
|
MEMORYSTATUSEX s;
|
|
|
|
s.dwLength = sizeof(s);
|
|
|
|
|
|
|
|
bool success = GlobalMemoryStatusEx(&s);
|
|
|
|
if (!success)
|
|
|
|
return -1;
|
|
|
|
|
2011-07-05 13:38:45 +00:00
|
|
|
return s.ullTotalVirtual - s.ullAvailVirtual;
|
2011-06-30 14:46:30 +00:00
|
|
|
}
|
|
|
|
|
2011-05-04 00:12:58 +00:00
|
|
|
#if MOZ_WINSDK_TARGETVER >= MOZ_NTDDI_LONGHORN
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetPrivate()
|
2011-05-23 02:49:56 +00:00
|
|
|
{
|
|
|
|
PROCESS_MEMORY_COUNTERS_EX pmcex;
|
|
|
|
pmcex.cb = sizeof(PROCESS_MEMORY_COUNTERS_EX);
|
2011-05-04 00:12:58 +00:00
|
|
|
|
2011-05-23 02:49:56 +00:00
|
|
|
if (!GetProcessMemoryInfo(GetCurrentProcess(),
|
|
|
|
(PPROCESS_MEMORY_COUNTERS) &pmcex, sizeof(pmcex)))
|
|
|
|
return (PRInt64) -1;
|
2011-05-04 00:12:58 +00:00
|
|
|
|
2011-05-23 02:49:56 +00:00
|
|
|
return pmcex.PrivateUsage;
|
2011-05-04 00:12:58 +00:00
|
|
|
}
|
|
|
|
|
2011-05-23 02:49:56 +00:00
|
|
|
NS_MEMORY_REPORTER_IMPLEMENT(Private,
|
|
|
|
"private",
|
2011-06-16 18:34:09 +00:00
|
|
|
KIND_OTHER,
|
|
|
|
UNITS_BYTES,
|
|
|
|
GetPrivate,
|
2011-05-23 02:49:56 +00:00
|
|
|
"Memory that cannot be shared with other processes, including memory that "
|
|
|
|
"is committed and marked MEM_PRIVATE, data that is not mapped, and "
|
2011-06-16 18:34:09 +00:00
|
|
|
"executable pages that have been written to.")
|
2011-05-23 02:49:56 +00:00
|
|
|
#endif
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetResident()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
|
|
|
PROCESS_MEMORY_COUNTERS pmc;
|
|
|
|
pmc.cb = sizeof(PROCESS_MEMORY_COUNTERS);
|
|
|
|
|
|
|
|
if (!GetProcessMemoryInfo(GetCurrentProcess(), &pmc, sizeof(pmc)))
|
|
|
|
return (PRInt64) -1;
|
|
|
|
|
|
|
|
return pmc.WorkingSetSize;
|
|
|
|
}
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetResident()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
|
|
|
return (PRInt64) -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2011-06-30 14:46:30 +00:00
|
|
|
#if defined(XP_LINUX) || defined(XP_MACOSX) || defined(XP_WIN)
|
2011-05-23 02:49:56 +00:00
|
|
|
NS_MEMORY_REPORTER_IMPLEMENT(Vsize,
|
|
|
|
"vsize",
|
2011-06-16 18:34:09 +00:00
|
|
|
KIND_OTHER,
|
|
|
|
UNITS_BYTES,
|
|
|
|
GetVsize,
|
2011-05-23 02:49:56 +00:00
|
|
|
"Memory mapped by the process, including code and data segments, the "
|
|
|
|
"heap, thread stacks, memory explicitly mapped by the process via mmap "
|
|
|
|
"and similar operations, and memory shared with other processes. "
|
|
|
|
"(Note that 'resident' is a better measure of the memory resources used "
|
|
|
|
"by the process.) "
|
|
|
|
"This is the vsize figure as reported by 'top' or 'ps'; on Mac the amount "
|
|
|
|
"of memory shared with other processes is very high and so this figure is "
|
2011-06-16 18:34:09 +00:00
|
|
|
"of limited use.")
|
2011-06-30 14:46:30 +00:00
|
|
|
#endif
|
2011-06-16 18:34:09 +00:00
|
|
|
|
2011-06-30 14:46:30 +00:00
|
|
|
#if defined(XP_LINUX) || defined(XP_MACOSX)
|
2011-06-16 18:34:09 +00:00
|
|
|
NS_MEMORY_REPORTER_IMPLEMENT(SoftPageFaults,
|
|
|
|
"soft-page-faults",
|
|
|
|
KIND_OTHER,
|
|
|
|
UNITS_COUNT,
|
|
|
|
GetSoftPageFaults,
|
|
|
|
"The number of soft page faults (also known as \"minor page faults\") that "
|
|
|
|
"have occurred since the process started. A soft page fault occurs when the "
|
|
|
|
"process tries to access a page which is present in physical memory but is "
|
|
|
|
"not mapped into the process's address space. For instance, a process might "
|
|
|
|
"observe soft page faults when it loads a shared library which is already "
|
|
|
|
"present in physical memory. A process may experience many thousands of soft "
|
|
|
|
"page faults even when the machine has plenty of available physical memory, "
|
|
|
|
"and because the OS services a soft page fault without accessing the disk, "
|
|
|
|
"they impact performance much less than hard page faults.")
|
|
|
|
|
|
|
|
NS_MEMORY_REPORTER_IMPLEMENT(HardPageFaults,
|
|
|
|
"hard-page-faults",
|
|
|
|
KIND_OTHER,
|
|
|
|
UNITS_COUNT,
|
|
|
|
GetHardPageFaults,
|
|
|
|
"The number of hard page faults (also known as \"major page faults\") that "
|
|
|
|
"have occurred since the process started. A hard page fault occurs when a "
|
|
|
|
"process tries to access a page which is not present in physical memory. "
|
|
|
|
"The operating system must access the disk in order to fulfill a hard page "
|
|
|
|
"fault. When memory is plentiful, you should see very few hard page faults. "
|
|
|
|
"But if the process tries to use more memory than your machine has "
|
|
|
|
"available, you may see many thousands of hard page faults. Because "
|
|
|
|
"accessing the disk is up to a million times slower than accessing RAM, "
|
|
|
|
"the program may run very slowly when it is experiencing more than 100 or "
|
|
|
|
"so hard page faults a second.")
|
2011-05-23 02:49:56 +00:00
|
|
|
#endif
|
2011-05-04 00:12:58 +00:00
|
|
|
|
|
|
|
NS_MEMORY_REPORTER_IMPLEMENT(Resident,
|
|
|
|
"resident",
|
2011-06-16 18:34:09 +00:00
|
|
|
KIND_OTHER,
|
|
|
|
UNITS_BYTES,
|
|
|
|
GetResident,
|
2011-05-04 00:12:58 +00:00
|
|
|
"Memory mapped by the process that is present in physical memory, "
|
|
|
|
"also known as the resident set size (RSS). This is the best single "
|
|
|
|
"figure to use when considering the memory resources used by the process, "
|
|
|
|
"but it depends both on other processes being run and details of the OS "
|
|
|
|
"kernel and so is best used for comparing the memory usage of a single "
|
2011-06-16 18:34:09 +00:00
|
|
|
"process at different points in time.")
|
2011-05-04 00:12:58 +00:00
|
|
|
|
2009-10-03 07:21:34 +00:00
|
|
|
/**
|
|
|
|
** memory reporter implementation for jemalloc and OSX malloc,
|
|
|
|
** to obtain info on total memory in use (that we know about,
|
|
|
|
** at least -- on OSX, there are sometimes other zones in use).
|
|
|
|
**/
|
|
|
|
|
2010-05-26 19:40:52 +00:00
|
|
|
#if defined(MOZ_MEMORY)
|
2010-10-15 21:12:54 +00:00
|
|
|
# if defined(XP_WIN) || defined(SOLARIS) || defined(ANDROID)
|
2010-05-26 19:40:52 +00:00
|
|
|
# define HAVE_JEMALLOC_STATS 1
|
|
|
|
# include "jemalloc.h"
|
|
|
|
# elif defined(XP_LINUX)
|
|
|
|
# define HAVE_JEMALLOC_STATS 1
|
|
|
|
# include "jemalloc_types.h"
|
|
|
|
// jemalloc is directly linked into firefox-bin; libxul doesn't link
|
|
|
|
// with it. So if we tried to use jemalloc_stats directly here, it
|
|
|
|
// wouldn't be defined. Instead, we don't include the jemalloc header
|
|
|
|
// and weakly link against jemalloc_stats.
|
|
|
|
extern "C" {
|
|
|
|
extern void jemalloc_stats(jemalloc_stats_t* stats)
|
|
|
|
NS_VISIBILITY_DEFAULT __attribute__((weak));
|
|
|
|
}
|
|
|
|
# endif // XP_LINUX
|
|
|
|
#endif // MOZ_MEMORY
|
2009-10-03 07:21:34 +00:00
|
|
|
|
2010-05-26 19:40:52 +00:00
|
|
|
#if HAVE_JEMALLOC_STATS
|
2009-10-03 07:21:34 +00:00
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetHeapUsed()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
2009-10-03 07:21:34 +00:00
|
|
|
jemalloc_stats_t stats;
|
|
|
|
jemalloc_stats(&stats);
|
2011-05-04 00:12:58 +00:00
|
|
|
return (PRInt64) stats.allocated;
|
2009-10-03 07:21:34 +00:00
|
|
|
}
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetHeapUnused()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
2009-10-03 07:21:34 +00:00
|
|
|
jemalloc_stats_t stats;
|
|
|
|
jemalloc_stats(&stats);
|
2011-05-04 00:12:58 +00:00
|
|
|
return (PRInt64) (stats.mapped - stats.allocated);
|
2009-10-03 07:21:34 +00:00
|
|
|
}
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetHeapCommitted()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
2009-10-03 07:21:34 +00:00
|
|
|
jemalloc_stats_t stats;
|
|
|
|
jemalloc_stats(&stats);
|
|
|
|
return (PRInt64) stats.committed;
|
|
|
|
}
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetHeapDirty()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
2009-10-03 07:21:34 +00:00
|
|
|
jemalloc_stats_t stats;
|
|
|
|
jemalloc_stats(&stats);
|
|
|
|
return (PRInt64) stats.dirty;
|
|
|
|
}
|
|
|
|
|
2011-05-04 00:12:58 +00:00
|
|
|
NS_MEMORY_REPORTER_IMPLEMENT(HeapCommitted,
|
2011-05-23 02:49:56 +00:00
|
|
|
"heap-committed",
|
2011-06-16 18:34:09 +00:00
|
|
|
KIND_OTHER,
|
|
|
|
UNITS_BYTES,
|
2011-05-23 02:49:56 +00:00
|
|
|
GetHeapCommitted,
|
2011-06-16 18:34:09 +00:00
|
|
|
"Memory mapped by the heap allocator that is committed, i.e. in physical "
|
|
|
|
"memory or paged to disk.")
|
2011-05-04 00:12:58 +00:00
|
|
|
|
|
|
|
NS_MEMORY_REPORTER_IMPLEMENT(HeapDirty,
|
2011-05-23 02:49:56 +00:00
|
|
|
"heap-dirty",
|
2011-06-16 18:34:09 +00:00
|
|
|
KIND_OTHER,
|
|
|
|
UNITS_BYTES,
|
2011-05-23 02:49:56 +00:00
|
|
|
GetHeapDirty,
|
2011-06-16 18:34:09 +00:00
|
|
|
"Memory mapped by the heap allocator that is committed but unused.")
|
2011-05-04 00:12:58 +00:00
|
|
|
|
2009-10-03 07:21:34 +00:00
|
|
|
#elif defined(XP_MACOSX) && !defined(MOZ_MEMORY)
|
|
|
|
#include <malloc/malloc.h>
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetHeapUsed()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
2009-10-03 07:21:34 +00:00
|
|
|
struct mstats stats = mstats();
|
|
|
|
return (PRInt64) stats.bytes_used;
|
|
|
|
}
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetHeapUnused()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
2009-10-03 07:21:34 +00:00
|
|
|
struct mstats stats = mstats();
|
2011-05-04 00:12:58 +00:00
|
|
|
return (PRInt64) (stats.bytes_total - stats.bytes_used);
|
2009-10-03 07:21:34 +00:00
|
|
|
}
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetHeapZone0Committed()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
2009-10-03 07:21:34 +00:00
|
|
|
malloc_statistics_t stats;
|
|
|
|
malloc_zone_statistics(malloc_default_zone(), &stats);
|
|
|
|
return stats.size_in_use;
|
|
|
|
}
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetHeapZone0Used()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
2009-10-03 07:21:34 +00:00
|
|
|
malloc_statistics_t stats;
|
|
|
|
malloc_zone_statistics(malloc_default_zone(), &stats);
|
|
|
|
return stats.size_allocated;
|
|
|
|
}
|
|
|
|
|
2011-05-04 00:12:58 +00:00
|
|
|
NS_MEMORY_REPORTER_IMPLEMENT(HeapZone0Committed,
|
2011-05-23 02:49:56 +00:00
|
|
|
"heap-zone0-committed",
|
2011-06-16 18:34:09 +00:00
|
|
|
KIND_OTHER,
|
|
|
|
UNITS_BYTES,
|
2011-05-23 02:49:56 +00:00
|
|
|
GetHeapZone0Committed,
|
2011-06-16 18:34:09 +00:00
|
|
|
"Memory mapped by the heap allocator that is committed in the default "
|
|
|
|
"zone.")
|
2009-10-03 07:21:34 +00:00
|
|
|
|
2011-05-04 00:12:58 +00:00
|
|
|
NS_MEMORY_REPORTER_IMPLEMENT(HeapZone0Used,
|
2011-05-23 02:49:56 +00:00
|
|
|
"heap-zone0-used",
|
2011-06-16 18:34:09 +00:00
|
|
|
KIND_OTHER,
|
|
|
|
UNITS_BYTES,
|
2011-05-23 02:49:56 +00:00
|
|
|
GetHeapZone0Used,
|
2011-06-16 18:34:09 +00:00
|
|
|
"Memory mapped by the heap allocator in the default zone that is "
|
|
|
|
"available for use by the application.")
|
2010-05-21 05:58:53 +00:00
|
|
|
#else
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetHeapUsed()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
|
|
|
return (PRInt64) -1;
|
2010-05-21 05:58:53 +00:00
|
|
|
}
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
static PRInt64 GetHeapUnused()
|
2011-05-04 00:12:58 +00:00
|
|
|
{
|
|
|
|
return (PRInt64) -1;
|
|
|
|
}
|
2010-05-21 05:58:53 +00:00
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2011-05-23 02:49:56 +00:00
|
|
|
NS_MEMORY_REPORTER_IMPLEMENT(HeapUsed,
|
|
|
|
"heap-used",
|
2011-06-16 18:34:09 +00:00
|
|
|
KIND_OTHER,
|
|
|
|
UNITS_BYTES,
|
|
|
|
GetHeapUsed,
|
2011-05-04 00:12:58 +00:00
|
|
|
"Memory mapped by the heap allocator that is available for use by the "
|
|
|
|
"application. This may exceed the amount of memory requested by the "
|
2011-05-23 02:49:56 +00:00
|
|
|
"application due to the allocator rounding up request sizes. "
|
2011-06-16 18:34:09 +00:00
|
|
|
"(The exact amount requested is not measured.) ")
|
2011-05-04 00:12:58 +00:00
|
|
|
|
2011-05-23 02:49:56 +00:00
|
|
|
NS_MEMORY_REPORTER_IMPLEMENT(HeapUnused,
|
|
|
|
"heap-unused",
|
2011-06-16 18:34:09 +00:00
|
|
|
KIND_OTHER,
|
|
|
|
UNITS_BYTES,
|
|
|
|
GetHeapUnused,
|
2011-05-04 00:12:58 +00:00
|
|
|
"Memory mapped by the heap allocator and not available for use by the "
|
|
|
|
"application. This can grow large if the heap allocator is holding onto "
|
2011-06-16 18:34:09 +00:00
|
|
|
"memory that the application has freed.")
|
2011-05-04 00:12:58 +00:00
|
|
|
|
2009-10-03 07:21:34 +00:00
|
|
|
/**
|
|
|
|
** nsMemoryReporterManager implementation
|
|
|
|
**/
|
|
|
|
|
2010-12-15 17:47:16 +00:00
|
|
|
NS_IMPL_THREADSAFE_ISUPPORTS1(nsMemoryReporterManager, nsIMemoryReporterManager)
|
2008-03-06 01:28:25 +00:00
|
|
|
|
2009-10-03 07:21:34 +00:00
|
|
|
NS_IMETHODIMP
|
|
|
|
nsMemoryReporterManager::Init()
|
|
|
|
{
|
2010-11-17 08:56:19 +00:00
|
|
|
#if HAVE_JEMALLOC_STATS && defined(XP_LINUX)
|
|
|
|
if (!jemalloc_stats)
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
#endif
|
2011-05-04 00:12:58 +00:00
|
|
|
|
2010-05-21 05:58:53 +00:00
|
|
|
#define REGISTER(_x) RegisterReporter(new NS_MEMORY_REPORTER_NAME(_x))
|
2009-10-03 07:21:34 +00:00
|
|
|
|
2011-05-23 02:49:56 +00:00
|
|
|
REGISTER(HeapUsed);
|
|
|
|
REGISTER(HeapUnused);
|
2011-05-04 00:12:58 +00:00
|
|
|
REGISTER(Resident);
|
2009-10-03 07:21:34 +00:00
|
|
|
|
2011-06-30 14:46:30 +00:00
|
|
|
#if defined(XP_LINUX) || defined(XP_MACOSX) || defined(XP_WIN)
|
2011-06-30 04:48:57 +00:00
|
|
|
REGISTER(Vsize);
|
2011-06-30 14:46:30 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#if defined(XP_LINUX) || defined(XP_MACOSX)
|
2011-06-16 18:34:09 +00:00
|
|
|
REGISTER(SoftPageFaults);
|
|
|
|
REGISTER(HardPageFaults);
|
2011-06-30 14:46:30 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#if defined(XP_WIN) && MOZ_WINSDK_TARGETVER >= MOZ_NTDDI_LONGHORN
|
2011-05-23 02:49:56 +00:00
|
|
|
REGISTER(Private);
|
|
|
|
#endif
|
|
|
|
|
2009-10-03 07:21:34 +00:00
|
|
|
#if defined(HAVE_JEMALLOC_STATS)
|
2011-05-04 00:12:58 +00:00
|
|
|
REGISTER(HeapCommitted);
|
|
|
|
REGISTER(HeapDirty);
|
2009-10-03 07:21:34 +00:00
|
|
|
#elif defined(XP_MACOSX) && !defined(MOZ_MEMORY)
|
2011-05-04 00:12:58 +00:00
|
|
|
REGISTER(HeapZone0Committed);
|
|
|
|
REGISTER(HeapZone0Used);
|
2009-10-03 07:21:34 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
2010-12-15 17:47:16 +00:00
|
|
|
nsMemoryReporterManager::nsMemoryReporterManager()
|
|
|
|
: mMutex("nsMemoryReporterManager::mMutex")
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
nsMemoryReporterManager::~nsMemoryReporterManager()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2008-03-06 01:28:25 +00:00
|
|
|
NS_IMETHODIMP
|
|
|
|
nsMemoryReporterManager::EnumerateReporters(nsISimpleEnumerator **result)
|
|
|
|
{
|
2010-12-15 17:47:16 +00:00
|
|
|
nsresult rv;
|
2011-05-04 00:12:58 +00:00
|
|
|
mozilla::MutexAutoLock autoLock(mMutex);
|
2010-12-15 17:47:16 +00:00
|
|
|
rv = NS_NewArrayEnumerator(result, mReporters);
|
|
|
|
return rv;
|
2008-03-06 01:28:25 +00:00
|
|
|
}
|
|
|
|
|
2011-06-29 23:39:32 +00:00
|
|
|
NS_IMETHODIMP
|
|
|
|
nsMemoryReporterManager::EnumerateMultiReporters(nsISimpleEnumerator **result)
|
|
|
|
{
|
|
|
|
nsresult rv;
|
|
|
|
mozilla::MutexAutoLock autoLock(mMutex);
|
|
|
|
rv = NS_NewArrayEnumerator(result, mMultiReporters);
|
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
|
2008-03-06 01:28:25 +00:00
|
|
|
NS_IMETHODIMP
|
|
|
|
nsMemoryReporterManager::RegisterReporter(nsIMemoryReporter *reporter)
|
|
|
|
{
|
2011-05-04 00:12:58 +00:00
|
|
|
mozilla::MutexAutoLock autoLock(mMutex);
|
2008-03-06 01:28:25 +00:00
|
|
|
if (mReporters.IndexOf(reporter) != -1)
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
|
|
|
|
mReporters.AppendObject(reporter);
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
2011-06-29 23:39:32 +00:00
|
|
|
NS_IMETHODIMP
|
|
|
|
nsMemoryReporterManager::RegisterMultiReporter(nsIMemoryMultiReporter *reporter)
|
|
|
|
{
|
|
|
|
mozilla::MutexAutoLock autoLock(mMutex);
|
|
|
|
if (mMultiReporters.IndexOf(reporter) != -1)
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
|
|
|
|
mMultiReporters.AppendObject(reporter);
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
2008-03-06 01:28:25 +00:00
|
|
|
NS_IMETHODIMP
|
|
|
|
nsMemoryReporterManager::UnregisterReporter(nsIMemoryReporter *reporter)
|
|
|
|
{
|
2011-05-04 00:12:58 +00:00
|
|
|
mozilla::MutexAutoLock autoLock(mMutex);
|
2008-03-06 01:28:25 +00:00
|
|
|
if (!mReporters.RemoveObject(reporter))
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
2011-06-29 23:39:32 +00:00
|
|
|
NS_IMETHODIMP
|
|
|
|
nsMemoryReporterManager::UnregisterMultiReporter(nsIMemoryMultiReporter *reporter)
|
|
|
|
{
|
|
|
|
mozilla::MutexAutoLock autoLock(mMutex);
|
|
|
|
if (!mMultiReporters.RemoveObject(reporter))
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
2011-07-07 05:54:34 +00:00
|
|
|
NS_IMETHODIMP
|
|
|
|
nsMemoryReporterManager::GetResident(PRInt64 *aResident)
|
|
|
|
{
|
|
|
|
*aResident = ::GetResident();
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct MemoryReport {
|
|
|
|
MemoryReport(const nsACString &path, PRInt64 amount)
|
|
|
|
: path(path), amount(amount)
|
|
|
|
{
|
|
|
|
MOZ_COUNT_CTOR(MemoryReport);
|
|
|
|
}
|
|
|
|
MemoryReport(const MemoryReport& rhs)
|
|
|
|
: path(rhs.path), amount(rhs.amount)
|
|
|
|
{
|
|
|
|
MOZ_COUNT_CTOR(MemoryReport);
|
|
|
|
}
|
|
|
|
~MemoryReport()
|
|
|
|
{
|
|
|
|
MOZ_COUNT_DTOR(MemoryReport);
|
|
|
|
}
|
|
|
|
const nsCString path;
|
|
|
|
PRInt64 amount;
|
|
|
|
};
|
|
|
|
|
|
|
|
// This is just a wrapper for InfallibleTArray<MemoryReport> that implements
|
|
|
|
// nsISupports, so it can be passed to nsIMemoryMultiReporter::CollectReports.
|
|
|
|
class MemoryReportsWrapper : public nsISupports {
|
|
|
|
public:
|
|
|
|
NS_DECL_ISUPPORTS
|
|
|
|
MemoryReportsWrapper(InfallibleTArray<MemoryReport> *r) : mReports(r) { }
|
|
|
|
InfallibleTArray<MemoryReport> *mReports;
|
|
|
|
};
|
|
|
|
NS_IMPL_ISUPPORTS0(MemoryReportsWrapper)
|
|
|
|
|
|
|
|
class MemoryReportCallback : public nsIMemoryMultiReporterCallback
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
NS_DECL_ISUPPORTS
|
|
|
|
|
|
|
|
NS_IMETHOD Callback(const nsACString &aProcess, const nsACString &aPath,
|
|
|
|
PRInt32 aKind, PRInt32 aUnits, PRInt64 aAmount,
|
|
|
|
const nsACString &aDescription,
|
|
|
|
nsISupports *aWrappedMRs)
|
|
|
|
{
|
|
|
|
if (aKind == nsIMemoryReporter::KIND_MAPPED && aAmount != PRInt64(-1)) {
|
|
|
|
MemoryReportsWrapper *wrappedMRs =
|
|
|
|
static_cast<MemoryReportsWrapper *>(aWrappedMRs);
|
|
|
|
MemoryReport mr(aPath, aAmount);
|
|
|
|
wrappedMRs->mReports->AppendElement(mr);
|
|
|
|
}
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
NS_IMPL_ISUPPORTS1(
|
|
|
|
MemoryReportCallback
|
|
|
|
, nsIMemoryMultiReporterCallback
|
|
|
|
)
|
|
|
|
|
|
|
|
// Is path1 a prefix, and thus a parent, of path2? Eg. "a/b" is a parent of
|
|
|
|
// "a/b/c", but "a/bb" is not.
|
|
|
|
static bool
|
|
|
|
isParent(const nsACString &path1, const nsACString &path2)
|
|
|
|
{
|
|
|
|
if (path1.Length() >= path2.Length())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
const nsACString& subStr = Substring(path2, 0, path1.Length());
|
|
|
|
return subStr.Equals(path1) && path2[path1.Length()] == '/';
|
|
|
|
}
|
|
|
|
|
|
|
|
NS_IMETHODIMP
|
|
|
|
nsMemoryReporterManager::GetExplicit(PRInt64 *aExplicit)
|
|
|
|
{
|
|
|
|
InfallibleTArray<MemoryReport> mapped;
|
|
|
|
PRInt64 heapUsed = PRInt64(-1);
|
|
|
|
|
|
|
|
// Get "heap-used" and all the KIND_MAPPED measurements from vanilla
|
|
|
|
// reporters.
|
|
|
|
nsCOMPtr<nsISimpleEnumerator> e;
|
|
|
|
EnumerateReporters(getter_AddRefs(e));
|
|
|
|
|
|
|
|
PRBool more;
|
|
|
|
while (NS_SUCCEEDED(e->HasMoreElements(&more)) && more) {
|
|
|
|
nsCOMPtr<nsIMemoryReporter> r;
|
|
|
|
e->GetNext(getter_AddRefs(r));
|
|
|
|
|
|
|
|
PRInt32 kind;
|
|
|
|
nsresult rv = r->GetKind(&kind);
|
|
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
|
|
|
|
if (kind == nsIMemoryReporter::KIND_MAPPED) {
|
|
|
|
nsCString path;
|
|
|
|
rv = r->GetPath(getter_Copies(path));
|
|
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
|
|
|
|
PRInt64 amount;
|
|
|
|
rv = r->GetAmount(&amount);
|
|
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
|
|
|
|
// Just skip any MAPPED reporters that fail, because "heap-used" is
|
|
|
|
// the most important one.
|
|
|
|
if (amount != PRInt64(-1)) {
|
|
|
|
MemoryReport mr(path, amount);
|
|
|
|
mapped.AppendElement(mr);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
nsCString path;
|
|
|
|
rv = r->GetPath(getter_Copies(path));
|
|
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
|
|
|
|
if (path.Equals("heap-used")) {
|
|
|
|
rv = r->GetAmount(&heapUsed);
|
|
|
|
NS_ENSURE_SUCCESS(rv, rv);
|
|
|
|
// If "heap-used" fails, we give up, because the result would be
|
|
|
|
// horribly inaccurate.
|
|
|
|
if (heapUsed == PRInt64(-1)) {
|
|
|
|
*aExplicit = PRInt64(-1);
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get KIND_MAPPED measurements from multi-reporters, too.
|
|
|
|
nsCOMPtr<nsISimpleEnumerator> e2;
|
|
|
|
EnumerateMultiReporters(getter_AddRefs(e2));
|
|
|
|
nsRefPtr<MemoryReportsWrapper> wrappedMRs =
|
|
|
|
new MemoryReportsWrapper(&mapped);
|
|
|
|
nsRefPtr<MemoryReportCallback> cb = new MemoryReportCallback();
|
|
|
|
|
|
|
|
while (NS_SUCCEEDED(e2->HasMoreElements(&more)) && more) {
|
|
|
|
nsCOMPtr<nsIMemoryMultiReporter> r;
|
|
|
|
e2->GetNext(getter_AddRefs(r));
|
|
|
|
r->CollectReports(cb, wrappedMRs);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Ignore (by zeroing its amount) any reporter that is a child of another
|
|
|
|
// reporter. Eg. if we have "explicit/a" and "explicit/a/b", zero the
|
|
|
|
// latter. This is quadratic in the number of MAPPED reporters, but there
|
|
|
|
// shouldn't be many.
|
|
|
|
for (PRUint32 i = 0; i < mapped.Length(); i++) {
|
|
|
|
const nsCString &iPath = mapped[i].path;
|
|
|
|
for (PRUint32 j = i + 1; j < mapped.Length(); j++) {
|
|
|
|
const nsCString &jPath = mapped[j].path;
|
|
|
|
if (isParent(iPath, jPath)) {
|
|
|
|
mapped[j].amount = 0;
|
|
|
|
} else if (isParent(jPath, iPath)) {
|
|
|
|
mapped[i].amount = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Sum all the mapped reporters and heapUsed.
|
|
|
|
*aExplicit = heapUsed;
|
|
|
|
for (PRUint32 i = 0; i < mapped.Length(); i++) {
|
|
|
|
*aExplicit += mapped[i].amount;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
2011-02-16 18:43:23 +00:00
|
|
|
NS_IMPL_ISUPPORTS1(nsMemoryReporter, nsIMemoryReporter)
|
|
|
|
|
2011-06-06 01:22:45 +00:00
|
|
|
nsMemoryReporter::nsMemoryReporter(nsCString& process,
|
2011-02-16 18:43:23 +00:00
|
|
|
nsCString& path,
|
2011-05-23 02:49:56 +00:00
|
|
|
PRInt32 kind,
|
2011-06-16 18:34:09 +00:00
|
|
|
PRInt32 units,
|
|
|
|
PRInt64 amount,
|
|
|
|
nsCString& desc)
|
2011-06-06 01:22:45 +00:00
|
|
|
: mProcess(process)
|
|
|
|
, mPath(path)
|
|
|
|
, mKind(kind)
|
2011-06-16 18:34:09 +00:00
|
|
|
, mUnits(units)
|
|
|
|
, mAmount(amount)
|
2011-06-30 23:54:42 +00:00
|
|
|
, mDesc(desc)
|
2011-02-16 18:43:23 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
nsMemoryReporter::~nsMemoryReporter()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2011-06-06 01:22:45 +00:00
|
|
|
NS_IMETHODIMP nsMemoryReporter::GetProcess(char **aProcess)
|
|
|
|
{
|
|
|
|
*aProcess = strdup(mProcess.get());
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
2011-02-16 18:43:23 +00:00
|
|
|
NS_IMETHODIMP nsMemoryReporter::GetPath(char **aPath)
|
|
|
|
{
|
2011-05-04 00:12:58 +00:00
|
|
|
*aPath = strdup(mPath.get());
|
|
|
|
return NS_OK;
|
2011-02-16 18:43:23 +00:00
|
|
|
}
|
|
|
|
|
2011-05-23 02:49:56 +00:00
|
|
|
NS_IMETHODIMP nsMemoryReporter::GetKind(PRInt32 *aKind)
|
|
|
|
{
|
|
|
|
*aKind = mKind;
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
NS_IMETHODIMP nsMemoryReporter::GetUnits(PRInt32 *aUnits)
|
2011-02-16 18:43:23 +00:00
|
|
|
{
|
2011-06-16 18:34:09 +00:00
|
|
|
*aUnits = mUnits;
|
|
|
|
return NS_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
NS_IMETHODIMP nsMemoryReporter::GetAmount(PRInt64 *aAmount)
|
|
|
|
{
|
|
|
|
*aAmount = mAmount;
|
2011-05-04 00:12:58 +00:00
|
|
|
return NS_OK;
|
2011-02-16 18:43:23 +00:00
|
|
|
}
|
|
|
|
|
2011-06-16 18:34:09 +00:00
|
|
|
NS_IMETHODIMP nsMemoryReporter::GetDescription(char **aDescription)
|
2011-02-16 18:43:23 +00:00
|
|
|
{
|
2011-06-16 18:34:09 +00:00
|
|
|
*aDescription = strdup(mDesc.get());
|
2011-05-04 00:12:58 +00:00
|
|
|
return NS_OK;
|
2011-02-16 18:43:23 +00:00
|
|
|
}
|
|
|
|
|
2008-03-06 06:39:36 +00:00
|
|
|
NS_COM nsresult
|
2008-03-06 01:28:25 +00:00
|
|
|
NS_RegisterMemoryReporter (nsIMemoryReporter *reporter)
|
|
|
|
{
|
|
|
|
nsCOMPtr<nsIMemoryReporterManager> mgr = do_GetService("@mozilla.org/memory-reporter-manager;1");
|
|
|
|
if (mgr == nsnull)
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
return mgr->RegisterReporter(reporter);
|
|
|
|
}
|
|
|
|
|
2011-06-29 23:39:32 +00:00
|
|
|
NS_COM nsresult
|
|
|
|
NS_RegisterMemoryMultiReporter (nsIMemoryMultiReporter *reporter)
|
|
|
|
{
|
|
|
|
nsCOMPtr<nsIMemoryReporterManager> mgr = do_GetService("@mozilla.org/memory-reporter-manager;1");
|
|
|
|
if (mgr == nsnull)
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
return mgr->RegisterMultiReporter(reporter);
|
|
|
|
}
|
|
|
|
|
2008-03-06 06:39:36 +00:00
|
|
|
NS_COM nsresult
|
2008-03-06 01:28:25 +00:00
|
|
|
NS_UnregisterMemoryReporter (nsIMemoryReporter *reporter)
|
|
|
|
{
|
|
|
|
nsCOMPtr<nsIMemoryReporterManager> mgr = do_GetService("@mozilla.org/memory-reporter-manager;1");
|
|
|
|
if (mgr == nsnull)
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
return mgr->UnregisterReporter(reporter);
|
|
|
|
}
|
|
|
|
|
2011-06-29 23:39:32 +00:00
|
|
|
NS_COM nsresult
|
|
|
|
NS_UnregisterMemoryMultiReporter (nsIMemoryMultiReporter *reporter)
|
|
|
|
{
|
|
|
|
nsCOMPtr<nsIMemoryReporterManager> mgr = do_GetService("@mozilla.org/memory-reporter-manager;1");
|
|
|
|
if (mgr == nsnull)
|
|
|
|
return NS_ERROR_FAILURE;
|
|
|
|
return mgr->UnregisterMultiReporter(reporter);
|
|
|
|
}
|
|
|
|
|