mirror of
https://github.com/mozilla/gecko-dev.git
synced 2024-12-13 10:25:01 +00:00
Bug 589262 - TM: Move GCStats into separate file. r=igor
This commit is contained in:
Gregor Wagner
parent
f2297d0017
commit
c4e2721fbd
@ -139,6 +139,7 @@ CPPSRCS = \
|
||||
jsfun.cpp \
|
||||
jsgc.cpp \
|
||||
jsgcchunk.cpp \
|
||||
jsgcstats.cpp \
|
||||
jshash.cpp \
|
||||
jsinterp.cpp \
|
||||
jsinvoke.cpp \
|
||||
@ -198,6 +199,7 @@ INSTALLED_HEADERS = \
|
||||
jsfun.h \
|
||||
jsgc.h \
|
||||
jsgcchunk.h \
|
||||
jsgcstats.h \
|
||||
jshash.h \
|
||||
jsinterp.h \
|
||||
jsinttypes.h \
|
||||
|
||||
@ -1609,6 +1609,7 @@ struct JSRuntime {
|
||||
|
||||
#ifdef JS_GCMETER
|
||||
JSGCStats gcStats;
|
||||
JSGCArenaStats gcArenaStats[FINALIZE_LIMIT];
|
||||
#endif
|
||||
|
||||
#ifdef DEBUG
|
||||
|
||||
377
js/src/jsgc.cpp
377
js/src/jsgc.cpp
@ -240,6 +240,14 @@ JS_STATIC_ASSERT(sizeof(JSFunction) % GC_CELL_SIZE == 0);
|
||||
JS_STATIC_ASSERT(sizeof(JSXML) % GC_CELL_SIZE == 0);
|
||||
#endif
|
||||
|
||||
#ifdef JS_GCMETER
|
||||
# define METER(x) ((void) (x))
|
||||
# define METER_IF(condition, x) ((void) ((condition) && (x)))
|
||||
#else
|
||||
# define METER(x) ((void) 0)
|
||||
# define METER_IF(condition, x) ((void) 0)
|
||||
#endif
|
||||
|
||||
struct JSGCArenaInfo {
|
||||
/*
|
||||
* Allocation list for the arena.
|
||||
@ -532,7 +540,7 @@ MarkIfUnmarkedGCThing(void *thing, uint32 color = BLACK)
|
||||
return true;
|
||||
}
|
||||
|
||||
inline size_t
|
||||
size_t
|
||||
ThingsPerArena(size_t thingSize)
|
||||
{
|
||||
JS_ASSERT(!(thingSize & GC_CELL_MASK));
|
||||
@ -595,22 +603,6 @@ MakeNewArenaFreeList(JSGCArena *a, size_t thingSize)
|
||||
return reinterpret_cast<JSGCThing *>(thingsStart);
|
||||
}
|
||||
|
||||
#ifdef JS_GCMETER
|
||||
# define METER(x) ((void) (x))
|
||||
# define METER_IF(condition, x) ((void) ((condition) && (x)))
|
||||
#else
|
||||
# define METER(x) ((void) 0)
|
||||
# define METER_IF(condition, x) ((void) 0)
|
||||
#endif
|
||||
|
||||
#define METER_UPDATE_MAX(maxLval, rval) \
|
||||
METER_IF((maxLval) < (rval), (maxLval) = (rval))
|
||||
|
||||
#ifdef MOZ_GCTIMER
|
||||
static jsrefcount newChunkCount = 0;
|
||||
static jsrefcount destroyChunkCount = 0;
|
||||
#endif
|
||||
|
||||
inline jsuword
|
||||
GetGCChunk(JSRuntime *rt)
|
||||
{
|
||||
@ -1081,30 +1073,6 @@ IsGCThingWord(JSRuntime *rt, jsuword w)
|
||||
return IsGCThingWord(rt, w, thing, traceKind);
|
||||
}
|
||||
|
||||
|
||||
#if defined(JS_DUMP_CONSERVATIVE_GC_ROOTS) || defined(JS_GCMETER)
|
||||
|
||||
void
|
||||
ConservativeGCStats::dump(FILE *fp)
|
||||
{
|
||||
size_t words = 0;
|
||||
for (size_t i = 0; i != JS_ARRAY_LENGTH(counter); ++i)
|
||||
words += counter[i];
|
||||
|
||||
#define ULSTAT(x) ((unsigned long)(x))
|
||||
fprintf(fp, "CONSERVATIVE STACK SCANNING:\n");
|
||||
fprintf(fp, " number of stack words: %lu\n", ULSTAT(words));
|
||||
fprintf(fp, " excluded, low bit set: %lu\n", ULSTAT(counter[CGCT_LOWBITSET]));
|
||||
fprintf(fp, " not withing a chunk: %lu\n", ULSTAT(counter[CGCT_NOTCHUNK]));
|
||||
fprintf(fp, " not within arena range: %lu\n", ULSTAT(counter[CGCT_NOTARENA]));
|
||||
fprintf(fp, " points to free arena: %lu\n", ULSTAT(counter[CGCT_FREEARENA]));
|
||||
fprintf(fp, " excluded, wrong tag: %lu\n", ULSTAT(counter[CGCT_WRONGTAG]));
|
||||
fprintf(fp, " excluded, not live: %lu\n", ULSTAT(counter[CGCT_NOTLIVE]));
|
||||
fprintf(fp, " valid GC things: %lu\n", ULSTAT(counter[CGCT_VALID]));
|
||||
#undef ULSTAT
|
||||
}
|
||||
#endif
|
||||
|
||||
static void
|
||||
MarkWordConservatively(JSTracer *trc, jsuword w)
|
||||
{
|
||||
@ -1211,158 +1179,6 @@ ConservativeGCThreadData::disable()
|
||||
|
||||
} /* namespace js */
|
||||
|
||||
|
||||
#ifdef JS_GCMETER
|
||||
|
||||
static void
|
||||
UpdateArenaStats(JSGCArenaStats *st, uint32 nlivearenas, uint32 nkilledArenas,
|
||||
uint32 nthings)
|
||||
{
|
||||
size_t narenas;
|
||||
|
||||
narenas = nlivearenas + nkilledArenas;
|
||||
JS_ASSERT(narenas >= st->livearenas);
|
||||
|
||||
st->newarenas = narenas - st->livearenas;
|
||||
st->narenas = narenas;
|
||||
st->livearenas = nlivearenas;
|
||||
if (st->maxarenas < narenas)
|
||||
st->maxarenas = narenas;
|
||||
st->totalarenas += narenas;
|
||||
|
||||
st->nthings = nthings;
|
||||
if (st->maxthings < nthings)
|
||||
st->maxthings = nthings;
|
||||
st->totalthings += nthings;
|
||||
}
|
||||
|
||||
JS_FRIEND_API(void)
|
||||
js_DumpGCStats(JSRuntime *rt, FILE *fp)
|
||||
{
|
||||
static const char *const GC_ARENA_NAMES[] = {
|
||||
"object",
|
||||
"function",
|
||||
#if JS_HAS_XML_SUPPORT
|
||||
"xml",
|
||||
#endif
|
||||
"short string",
|
||||
"string",
|
||||
"external_string_0",
|
||||
"external_string_1",
|
||||
"external_string_2",
|
||||
"external_string_3",
|
||||
"external_string_4",
|
||||
"external_string_5",
|
||||
"external_string_6",
|
||||
"external_string_7",
|
||||
};
|
||||
JS_STATIC_ASSERT(JS_ARRAY_LENGTH(GC_ARENA_NAMES) == FINALIZE_LIMIT);
|
||||
|
||||
fprintf(fp, "\nGC allocation statistics:\n\n");
|
||||
|
||||
#define UL(x) ((unsigned long)(x))
|
||||
#define ULSTAT(x) UL(rt->gcStats.x)
|
||||
#define PERCENT(x,y) (100.0 * (double) (x) / (double) (y))
|
||||
|
||||
size_t sumArenas = 0;
|
||||
size_t sumTotalArenas = 0;
|
||||
size_t sumThings = 0;
|
||||
size_t sumMaxThings = 0;
|
||||
size_t sumThingSize = 0;
|
||||
size_t sumTotalThingSize = 0;
|
||||
size_t sumArenaCapacity = 0;
|
||||
size_t sumTotalArenaCapacity = 0;
|
||||
size_t sumAlloc = 0;
|
||||
size_t sumLocalAlloc = 0;
|
||||
size_t sumFail = 0;
|
||||
size_t sumRetry = 0;
|
||||
for (int i = 0; i < (int) FINALIZE_LIMIT; i++) {
|
||||
size_t thingSize, thingsPerArena;
|
||||
JSGCArenaStats *st;
|
||||
thingSize = rt->gcArenaList[i].thingSize;
|
||||
thingsPerArena = ThingsPerArena(thingSize);
|
||||
st = &rt->gcStats.arenaStats[i];
|
||||
if (st->maxarenas == 0)
|
||||
continue;
|
||||
fprintf(fp,
|
||||
"%s arenas (thing size %lu, %lu things per arena):",
|
||||
GC_ARENA_NAMES[i], UL(thingSize), UL(thingsPerArena));
|
||||
putc('\n', fp);
|
||||
fprintf(fp, " arenas before GC: %lu\n", UL(st->narenas));
|
||||
fprintf(fp, " new arenas before GC: %lu (%.1f%%)\n",
|
||||
UL(st->newarenas), PERCENT(st->newarenas, st->narenas));
|
||||
fprintf(fp, " arenas after GC: %lu (%.1f%%)\n",
|
||||
UL(st->livearenas), PERCENT(st->livearenas, st->narenas));
|
||||
fprintf(fp, " max arenas: %lu\n", UL(st->maxarenas));
|
||||
fprintf(fp, " things: %lu\n", UL(st->nthings));
|
||||
fprintf(fp, " GC cell utilization: %.1f%%\n",
|
||||
PERCENT(st->nthings, thingsPerArena * st->narenas));
|
||||
fprintf(fp, " average cell utilization: %.1f%%\n",
|
||||
PERCENT(st->totalthings, thingsPerArena * st->totalarenas));
|
||||
fprintf(fp, " max things: %lu\n", UL(st->maxthings));
|
||||
fprintf(fp, " alloc attempts: %lu\n", UL(st->alloc));
|
||||
fprintf(fp, " alloc without locks: %lu (%.1f%%)\n",
|
||||
UL(st->localalloc), PERCENT(st->localalloc, st->alloc));
|
||||
sumArenas += st->narenas;
|
||||
sumTotalArenas += st->totalarenas;
|
||||
sumThings += st->nthings;
|
||||
sumMaxThings += st->maxthings;
|
||||
sumThingSize += thingSize * st->nthings;
|
||||
sumTotalThingSize += size_t(thingSize * st->totalthings);
|
||||
sumArenaCapacity += thingSize * thingsPerArena * st->narenas;
|
||||
sumTotalArenaCapacity += thingSize * thingsPerArena * st->totalarenas;
|
||||
sumAlloc += st->alloc;
|
||||
sumLocalAlloc += st->localalloc;
|
||||
sumFail += st->fail;
|
||||
sumRetry += st->retry;
|
||||
putc('\n', fp);
|
||||
}
|
||||
|
||||
fputs("Never used arenas:\n", fp);
|
||||
for (int i = 0; i < (int) FINALIZE_LIMIT; i++) {
|
||||
size_t thingSize, thingsPerArena;
|
||||
JSGCArenaStats *st;
|
||||
thingSize = rt->gcArenaList[i].thingSize;
|
||||
thingsPerArena = ThingsPerArena(thingSize);
|
||||
st = &rt->gcStats.arenaStats[i];
|
||||
if (st->maxarenas != 0)
|
||||
continue;
|
||||
fprintf(fp,
|
||||
"%s (thing size %lu, %lu things per arena)\n",
|
||||
GC_ARENA_NAMES[i], UL(thingSize), UL(thingsPerArena));
|
||||
}
|
||||
fprintf(fp, "\nTOTAL STATS:\n");
|
||||
fprintf(fp, " bytes allocated: %lu\n", UL(rt->gcBytes));
|
||||
fprintf(fp, " total GC arenas: %lu\n", UL(sumArenas));
|
||||
fprintf(fp, " max allocated arenas: %lu\n", ULSTAT(maxnallarenas));
|
||||
fprintf(fp, " max allocated chunks: %lu\n", ULSTAT(maxnchunks));
|
||||
fprintf(fp, " total GC things: %lu\n", UL(sumThings));
|
||||
fprintf(fp, " max total GC things: %lu\n", UL(sumMaxThings));
|
||||
fprintf(fp, " GC cell utilization: %.1f%%\n",
|
||||
PERCENT(sumThingSize, sumArenaCapacity));
|
||||
fprintf(fp, " average cell utilization: %.1f%%\n",
|
||||
PERCENT(sumTotalThingSize, sumTotalArenaCapacity));
|
||||
fprintf(fp, "allocation retries after GC: %lu\n", UL(sumRetry));
|
||||
fprintf(fp, " alloc attempts: %lu\n", UL(sumAlloc));
|
||||
fprintf(fp, " alloc without locks: %lu (%.1f%%)\n",
|
||||
UL(sumLocalAlloc), PERCENT(sumLocalAlloc, sumAlloc));
|
||||
fprintf(fp, " allocation failures: %lu\n", UL(sumFail));
|
||||
fprintf(fp, " valid lock calls: %lu\n", ULSTAT(lock));
|
||||
fprintf(fp, " valid unlock calls: %lu\n", ULSTAT(unlock));
|
||||
fprintf(fp, " delayed tracing calls: %lu\n", ULSTAT(unmarked));
|
||||
#ifdef DEBUG
|
||||
fprintf(fp, " max trace later count: %lu\n", ULSTAT(maxunmarked));
|
||||
#endif
|
||||
fprintf(fp, "potentially useful GC calls: %lu\n", ULSTAT(poke));
|
||||
fprintf(fp, " thing arenas freed so far: %lu\n", ULSTAT(afree));
|
||||
rt->gcStats.conservative.dump(fp);
|
||||
|
||||
#undef UL
|
||||
#undef ULSTAT
|
||||
#undef PERCENT
|
||||
}
|
||||
#endif
|
||||
|
||||
#ifdef DEBUG
|
||||
static void
|
||||
CheckLeakedRoots(JSRuntime *rt);
|
||||
@ -1628,7 +1444,7 @@ RefillFinalizableFreeList(JSContext *cx, unsigned thingKind)
|
||||
for (;;) {
|
||||
if (doGC) {
|
||||
LastDitchGC(cx);
|
||||
METER(cx->runtime->gcStats.arenaStats[thingKind].retry++);
|
||||
METER(cx->runtime->gcArenaStats[thingKind].retry++);
|
||||
canGC = false;
|
||||
|
||||
/*
|
||||
@ -1655,7 +1471,7 @@ RefillFinalizableFreeList(JSContext *cx, unsigned thingKind)
|
||||
if (a)
|
||||
break;
|
||||
if (!canGC) {
|
||||
METER(cx->runtime->gcStats.arenaStats[thingKind].fail++);
|
||||
METER(cx->runtime->gcArenaStats[thingKind].fail++);
|
||||
return NULL;
|
||||
}
|
||||
doGC = true;
|
||||
@ -1702,7 +1518,7 @@ js_NewFinalizableGCThing(JSContext *cx, unsigned thingKind)
|
||||
#endif
|
||||
|
||||
/* Updates of metering counters here may not be thread-safe. */
|
||||
METER(cx->runtime->gcStats.arenaStats[thingKind].alloc++);
|
||||
METER(cx->runtime->gcArenaStats[thingKind].alloc++);
|
||||
|
||||
JSGCThing **freeListp =
|
||||
JS_THREAD_DATA(cx)->gcFreeLists.finalizables + thingKind;
|
||||
@ -1710,7 +1526,7 @@ js_NewFinalizableGCThing(JSContext *cx, unsigned thingKind)
|
||||
if (thing) {
|
||||
*freeListp = thing->link;
|
||||
CheckGCFreeListLink(thing);
|
||||
METER(cx->runtime->gcStats.arenaStats[thingKind].localalloc++);
|
||||
METER(cx->runtime->gcArenaStats[thingKind].localalloc++);
|
||||
return thing;
|
||||
}
|
||||
|
||||
@ -1878,64 +1694,6 @@ GCMarker::~GCMarker()
|
||||
#endif
|
||||
}
|
||||
|
||||
#ifdef JS_DUMP_CONSERVATIVE_GC_ROOTS
|
||||
void
|
||||
GCMarker::dumpConservativeRoots()
|
||||
{
|
||||
if (!conservativeDumpFileName)
|
||||
return;
|
||||
|
||||
FILE *fp;
|
||||
if (!strcmp(conservativeDumpFileName, "stdout")) {
|
||||
fp = stdout;
|
||||
} else if (!strcmp(conservativeDumpFileName, "stderr")) {
|
||||
fp = stderr;
|
||||
} else if (!(fp = fopen(conservativeDumpFileName, "aw"))) {
|
||||
fprintf(stderr,
|
||||
"Warning: cannot open %s to dump the conservative roots\n",
|
||||
conservativeDumpFileName);
|
||||
return;
|
||||
}
|
||||
|
||||
conservativeStats.dump(fp);
|
||||
|
||||
for (ConservativeRoot *i = conservativeRoots.begin();
|
||||
i != conservativeRoots.end();
|
||||
++i) {
|
||||
fprintf(fp, " %p: ", i->thing);
|
||||
switch (i->traceKind) {
|
||||
default:
|
||||
JS_NOT_REACHED("Unknown trace kind");
|
||||
|
||||
case JSTRACE_OBJECT: {
|
||||
JSObject *obj = (JSObject *) i->thing;
|
||||
fprintf(fp, "object %s", obj->getClass()->name);
|
||||
break;
|
||||
}
|
||||
case JSTRACE_STRING: {
|
||||
JSString *str = (JSString *) i->thing;
|
||||
char buf[50];
|
||||
js_PutEscapedString(buf, sizeof buf, str, '"');
|
||||
fprintf(fp, "string %s", buf);
|
||||
break;
|
||||
}
|
||||
# if JS_HAS_XML_SUPPORT
|
||||
case JSTRACE_XML: {
|
||||
JSXML *xml = (JSXML *) i->thing;
|
||||
fprintf(fp, "xml %u", (unsigned)xml->xml_class);
|
||||
break;
|
||||
}
|
||||
# endif
|
||||
}
|
||||
fputc('\n', fp);
|
||||
}
|
||||
fputc('\n', fp);
|
||||
|
||||
if (fp != stdout && fp != stderr)
|
||||
fclose(fp);
|
||||
}
|
||||
#endif /* JS_DUMP_CONSERVATIVE_GC_ROOTS */
|
||||
|
||||
void
|
||||
GCMarker::delayMarkingChildren(void *thing)
|
||||
{
|
||||
@ -2785,89 +2543,10 @@ FinalizeArenaList(JSContext *cx, unsigned thingKind)
|
||||
}
|
||||
arenaList->cursor = arenaList->head;
|
||||
|
||||
METER(UpdateArenaStats(&cx->runtime->gcStats.arenaStats[thingKind],
|
||||
METER(UpdateArenaStats(&cx->runtime->gcArenaStats[thingKind],
|
||||
nlivearenas, nkilledarenas, nthings));
|
||||
}
|
||||
|
||||
#ifdef MOZ_GCTIMER
|
||||
|
||||
const bool JS_WANT_GC_SUITE_PRINT = true; //false for gnuplot output
|
||||
|
||||
struct GCTimer {
|
||||
uint64 enter;
|
||||
uint64 startMark;
|
||||
uint64 startSweep;
|
||||
uint64 sweepObjectEnd;
|
||||
uint64 sweepStringEnd;
|
||||
uint64 sweepDestroyEnd;
|
||||
uint64 end;
|
||||
|
||||
GCTimer() {
|
||||
getFirstEnter();
|
||||
memset(this, 0, sizeof(GCTimer));
|
||||
enter = rdtsc();
|
||||
}
|
||||
|
||||
static uint64 getFirstEnter() {
|
||||
static uint64 firstEnter = rdtsc();
|
||||
return firstEnter;
|
||||
}
|
||||
|
||||
void finish(bool lastGC) {
|
||||
end = rdtsc();
|
||||
|
||||
if (startMark > 0) {
|
||||
if (JS_WANT_GC_SUITE_PRINT) {
|
||||
fprintf(stderr, "%f %f %f\n",
|
||||
(double)(end - enter) / 1e6,
|
||||
(double)(startSweep - startMark) / 1e6,
|
||||
(double)(sweepDestroyEnd - startSweep) / 1e6);
|
||||
} else {
|
||||
static FILE *gcFile;
|
||||
|
||||
if (!gcFile) {
|
||||
gcFile = fopen("gcTimer.dat", "w");
|
||||
|
||||
fprintf(gcFile, " AppTime, Total, Mark, Sweep, FinObj,");
|
||||
fprintf(gcFile, " FinStr, Destroy, newChunks, destoyChunks\n");
|
||||
}
|
||||
JS_ASSERT(gcFile);
|
||||
fprintf(gcFile, "%12.1f, %6.1f, %6.1f, %6.1f, %6.1f, %6.1f, %7.1f, ",
|
||||
(double)(enter - getFirstEnter()) / 1e6,
|
||||
(double)(end - enter) / 1e6,
|
||||
(double)(startSweep - startMark) / 1e6,
|
||||
(double)(sweepDestroyEnd - startSweep) / 1e6,
|
||||
(double)(sweepObjectEnd - startSweep) / 1e6,
|
||||
(double)(sweepStringEnd - sweepObjectEnd) / 1e6,
|
||||
(double)(sweepDestroyEnd - sweepStringEnd) / 1e6);
|
||||
fprintf(gcFile, "%10d, %10d \n", newChunkCount,
|
||||
destroyChunkCount);
|
||||
fflush(gcFile);
|
||||
|
||||
if (lastGC) {
|
||||
fclose(gcFile);
|
||||
gcFile = NULL;
|
||||
}
|
||||
}
|
||||
}
|
||||
newChunkCount = 0;
|
||||
destroyChunkCount = 0;
|
||||
}
|
||||
};
|
||||
|
||||
# define GCTIMER_PARAM , GCTimer &gcTimer
|
||||
# define GCTIMER_ARG , gcTimer
|
||||
# define TIMESTAMP(x) (gcTimer.x = rdtsc())
|
||||
# define GCTIMER_BEGIN() GCTimer gcTimer
|
||||
# define GCTIMER_END(last) (gcTimer.finish(last))
|
||||
#else
|
||||
# define GCTIMER_PARAM
|
||||
# define GCTIMER_ARG
|
||||
# define TIMESTAMP(x) ((void) 0)
|
||||
# define GCTIMER_BEGIN() ((void) 0)
|
||||
# define GCTIMER_END(last) ((void) 0)
|
||||
#endif
|
||||
|
||||
#ifdef JS_THREADSAFE
|
||||
|
||||
namespace js {
|
||||
@ -3128,32 +2807,12 @@ GC(JSContext *cx GCTIMER_PARAM)
|
||||
#endif
|
||||
|
||||
#ifdef JS_SCOPE_DEPTH_METER
|
||||
{ static FILE *fp;
|
||||
if (!fp)
|
||||
fp = fopen("/tmp/scopedepth.stats", "w");
|
||||
|
||||
if (fp) {
|
||||
JS_DumpBasicStats(&rt->protoLookupDepthStats, "proto-lookup depth", fp);
|
||||
JS_DumpBasicStats(&rt->scopeSearchDepthStats, "scope-search depth", fp);
|
||||
JS_DumpBasicStats(&rt->hostenvScopeDepthStats, "hostenv scope depth", fp);
|
||||
JS_DumpBasicStats(&rt->lexicalScopeDepthStats, "lexical scope depth", fp);
|
||||
|
||||
putc('\n', fp);
|
||||
fflush(fp);
|
||||
}
|
||||
}
|
||||
#endif /* JS_SCOPE_DEPTH_METER */
|
||||
DumpScopeDepthMeter(rt);
|
||||
#endif
|
||||
|
||||
#ifdef JS_DUMP_LOOP_STATS
|
||||
{ static FILE *lsfp;
|
||||
if (!lsfp)
|
||||
lsfp = fopen("/tmp/loopstats", "w");
|
||||
if (lsfp) {
|
||||
JS_DumpBasicStats(&rt->loopStats, "loops", lsfp);
|
||||
fflush(lsfp);
|
||||
}
|
||||
}
|
||||
#endif /* JS_DUMP_LOOP_STATS */
|
||||
DumpLoopStats(rt);
|
||||
#endif
|
||||
}
|
||||
|
||||
#ifdef JS_THREADSAFE
|
||||
|
||||
@ -56,17 +56,7 @@
|
||||
#include "jsversion.h"
|
||||
#include "jsobj.h"
|
||||
#include "jsfun.h"
|
||||
|
||||
#if !defined JS_DUMP_CONSERVATIVE_GC_ROOTS && defined DEBUG
|
||||
# define JS_DUMP_CONSERVATIVE_GC_ROOTS 1
|
||||
#endif
|
||||
|
||||
#if defined JS_GCMETER
|
||||
const bool JS_WANT_GC_METER_PRINT = true;
|
||||
#elif defined DEBUG
|
||||
# define JS_GCMETER 1
|
||||
const bool JS_WANT_GC_METER_PRINT = false;
|
||||
#endif
|
||||
#include "jsgcstats.h"
|
||||
|
||||
#define JSTRACE_XML 2
|
||||
|
||||
@ -87,6 +77,9 @@ js_GetExternalStringGCType(JSString *str);
|
||||
extern JS_FRIEND_API(uint32)
|
||||
js_GetGCThingTraceKind(void *thing);
|
||||
|
||||
extern size_t
|
||||
ThingsPerArena(size_t thingSize);
|
||||
|
||||
/*
|
||||
* The sole purpose of the function is to preserve public API compatibility
|
||||
* in JS_GetStringBytes which takes only single JSString* argument.
|
||||
@ -440,33 +433,6 @@ struct ConservativeGCThreadData {
|
||||
bool isEnabled() const { return enableCount > 0; }
|
||||
};
|
||||
|
||||
/*
|
||||
* The conservative GC test for a word shows that it is either a valid GC
|
||||
* thing or is not for one of the following reasons.
|
||||
*/
|
||||
enum ConservativeGCTest {
|
||||
CGCT_VALID,
|
||||
CGCT_LOWBITSET, /* excluded because one of the low bits was set */
|
||||
CGCT_NOTARENA, /* not within arena range in a chunk */
|
||||
CGCT_NOTCHUNK, /* not within a valid chunk */
|
||||
CGCT_FREEARENA, /* within arena containing only free things */
|
||||
CGCT_WRONGTAG, /* tagged pointer but wrong type */
|
||||
CGCT_NOTLIVE, /* gcthing is not allocated */
|
||||
CGCT_END
|
||||
};
|
||||
|
||||
struct ConservativeGCStats {
|
||||
uint32 counter[CGCT_END]; /* ConservativeGCTest classification
|
||||
counters */
|
||||
|
||||
void add(const ConservativeGCStats &another) {
|
||||
for (size_t i = 0; i != JS_ARRAY_LENGTH(counter); ++i)
|
||||
counter[i] += another.counter[i];
|
||||
}
|
||||
|
||||
void dump(FILE *fp);
|
||||
};
|
||||
|
||||
struct GCMarker : public JSTracer {
|
||||
private:
|
||||
/* The color is only applied to objects, functions and xml. */
|
||||
@ -522,50 +488,6 @@ struct GCMarker : public JSTracer {
|
||||
extern void
|
||||
js_FinalizeStringRT(JSRuntime *rt, JSString *str);
|
||||
|
||||
#ifdef JS_GCMETER
|
||||
|
||||
struct JSGCArenaStats {
|
||||
uint32 alloc; /* allocation attempts */
|
||||
uint32 localalloc; /* allocations from local lists */
|
||||
uint32 retry; /* allocation retries after running the GC */
|
||||
uint32 fail; /* allocation failures */
|
||||
uint32 nthings; /* live GC things */
|
||||
uint32 maxthings; /* maximum of live GC cells */
|
||||
double totalthings; /* live GC things the GC scanned so far */
|
||||
uint32 narenas; /* number of arena in list before the GC */
|
||||
uint32 newarenas; /* new arenas allocated before the last GC */
|
||||
uint32 livearenas; /* number of live arenas after the last GC */
|
||||
uint32 maxarenas; /* maximum of allocated arenas */
|
||||
uint32 totalarenas; /* total number of arenas with live things that
|
||||
GC scanned so far */
|
||||
};
|
||||
|
||||
struct JSGCStats {
|
||||
uint32 lock; /* valid lock calls */
|
||||
uint32 unlock; /* valid unlock calls */
|
||||
uint32 unmarked; /* number of times marking of GC thing's children were
|
||||
delayed due to a low C stack */
|
||||
#ifdef DEBUG
|
||||
uint32 maxunmarked;/* maximum number of things with children to mark
|
||||
later */
|
||||
#endif
|
||||
uint32 poke; /* number of potentially useful GC calls */
|
||||
uint32 afree; /* thing arenas freed so far */
|
||||
uint32 nallarenas; /* number of all allocated arenas */
|
||||
uint32 maxnallarenas; /* maximum number of all allocated arenas */
|
||||
uint32 nchunks; /* number of allocated chunks */
|
||||
uint32 maxnchunks; /* maximum number of allocated chunks */
|
||||
|
||||
JSGCArenaStats arenaStats[FINALIZE_LIMIT];
|
||||
|
||||
js::ConservativeGCStats conservative;
|
||||
};
|
||||
|
||||
extern JS_FRIEND_API(void)
|
||||
js_DumpGCStats(JSRuntime *rt, FILE *fp);
|
||||
|
||||
#endif /* JS_GCMETER */
|
||||
|
||||
/*
|
||||
* This function is defined in jsdbgapi.cpp but is declared here to avoid
|
||||
* polluting jsdbgapi.h, a public API header, with internal functions.
|
||||
|
||||
375
js/src/jsgcstats.cpp
Normal file
375
js/src/jsgcstats.cpp
Normal file
@ -0,0 +1,375 @@
|
||||
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
|
||||
* vim: set ts=4 sw=4 et tw=99 ft=cpp:
|
||||
*
|
||||
* ***** 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 SpiderMonkey JavaScript 1.9 code, released
|
||||
* June 30, 2010
|
||||
*
|
||||
* The Initial Developer of the Original Code is
|
||||
* the Mozilla Corporation.
|
||||
*
|
||||
* Contributor(s):
|
||||
*
|
||||
* 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 ***** */
|
||||
|
||||
#include "jstypes.h"
|
||||
#include "jscntxt.h"
|
||||
#include "jsgcstats.h"
|
||||
#include "jsgc.h"
|
||||
#include "jsxml.h"
|
||||
#include "jsbuiltins.h"
|
||||
|
||||
using namespace js;
|
||||
|
||||
#if defined(JS_DUMP_CONSERVATIVE_GC_ROOTS) || defined(JS_GCMETER)
|
||||
|
||||
void
|
||||
ConservativeGCStats::dump(FILE *fp)
|
||||
{
|
||||
size_t words = 0;
|
||||
for (size_t i = 0; i != JS_ARRAY_LENGTH(counter); ++i)
|
||||
words += counter[i];
|
||||
|
||||
#define ULSTAT(x) ((unsigned long)(x))
|
||||
fprintf(fp, "CONSERVATIVE STACK SCANNING:\n");
|
||||
fprintf(fp, " number of stack words: %lu\n", ULSTAT(words));
|
||||
fprintf(fp, " excluded, low bit set: %lu\n", ULSTAT(counter[CGCT_LOWBITSET]));
|
||||
fprintf(fp, " not withing a chunk: %lu\n", ULSTAT(counter[CGCT_NOTCHUNK]));
|
||||
fprintf(fp, " not within arena range: %lu\n", ULSTAT(counter[CGCT_NOTARENA]));
|
||||
fprintf(fp, " points to free arena: %lu\n", ULSTAT(counter[CGCT_FREEARENA]));
|
||||
fprintf(fp, " excluded, wrong tag: %lu\n", ULSTAT(counter[CGCT_WRONGTAG]));
|
||||
fprintf(fp, " excluded, not live: %lu\n", ULSTAT(counter[CGCT_NOTLIVE]));
|
||||
fprintf(fp, " valid GC things: %lu\n", ULSTAT(counter[CGCT_VALID]));
|
||||
#undef ULSTAT
|
||||
}
|
||||
#endif
|
||||
|
||||
#ifdef JS_DUMP_CONSERVATIVE_GC_ROOTS
|
||||
void
|
||||
GCMarker::dumpConservativeRoots()
|
||||
{
|
||||
if (!conservativeDumpFileName)
|
||||
return;
|
||||
|
||||
FILE *fp;
|
||||
if (!strcmp(conservativeDumpFileName, "stdout")) {
|
||||
fp = stdout;
|
||||
} else if (!strcmp(conservativeDumpFileName, "stderr")) {
|
||||
fp = stderr;
|
||||
} else if (!(fp = fopen(conservativeDumpFileName, "aw"))) {
|
||||
fprintf(stderr,
|
||||
"Warning: cannot open %s to dump the conservative roots\n",
|
||||
conservativeDumpFileName);
|
||||
return;
|
||||
}
|
||||
|
||||
conservativeStats.dump(fp);
|
||||
|
||||
for (ConservativeRoot *i = conservativeRoots.begin();
|
||||
i != conservativeRoots.end();
|
||||
++i) {
|
||||
fprintf(fp, " %p: ", i->thing);
|
||||
switch (i->traceKind) {
|
||||
default:
|
||||
JS_NOT_REACHED("Unknown trace kind");
|
||||
|
||||
case JSTRACE_OBJECT: {
|
||||
JSObject *obj = (JSObject *) i->thing;
|
||||
fprintf(fp, "object %s", obj->getClass()->name);
|
||||
break;
|
||||
}
|
||||
case JSTRACE_STRING: {
|
||||
JSString *str = (JSString *) i->thing;
|
||||
char buf[50];
|
||||
js_PutEscapedString(buf, sizeof buf, str, '"');
|
||||
fprintf(fp, "string %s", buf);
|
||||
break;
|
||||
}
|
||||
# if JS_HAS_XML_SUPPORT
|
||||
case JSTRACE_XML: {
|
||||
JSXML *xml = (JSXML *) i->thing;
|
||||
fprintf(fp, "xml %u", (unsigned)xml->xml_class);
|
||||
break;
|
||||
}
|
||||
# endif
|
||||
}
|
||||
fputc('\n', fp);
|
||||
}
|
||||
fputc('\n', fp);
|
||||
|
||||
if (fp != stdout && fp != stderr)
|
||||
fclose(fp);
|
||||
}
|
||||
#endif /* JS_DUMP_CONSERVATIVE_GC_ROOTS */
|
||||
|
||||
#ifdef JS_GCMETER
|
||||
|
||||
void
|
||||
UpdateArenaStats(JSGCArenaStats *st, uint32 nlivearenas, uint32 nkilledArenas,
|
||||
uint32 nthings)
|
||||
{
|
||||
size_t narenas;
|
||||
|
||||
narenas = nlivearenas + nkilledArenas;
|
||||
JS_ASSERT(narenas >= st->livearenas);
|
||||
|
||||
st->newarenas = narenas - st->livearenas;
|
||||
st->narenas = narenas;
|
||||
st->livearenas = nlivearenas;
|
||||
if (st->maxarenas < narenas)
|
||||
st->maxarenas = narenas;
|
||||
st->totalarenas += narenas;
|
||||
|
||||
st->nthings = nthings;
|
||||
if (st->maxthings < nthings)
|
||||
st->maxthings = nthings;
|
||||
st->totalthings += nthings;
|
||||
}
|
||||
|
||||
JS_FRIEND_API(void)
|
||||
js_DumpGCStats(JSRuntime *rt, FILE *fp)
|
||||
{
|
||||
static const char *const GC_ARENA_NAMES[] = {
|
||||
"object",
|
||||
"function",
|
||||
#if JS_HAS_XML_SUPPORT
|
||||
"xml",
|
||||
#endif
|
||||
"short string",
|
||||
"string",
|
||||
"external_string_0",
|
||||
"external_string_1",
|
||||
"external_string_2",
|
||||
"external_string_3",
|
||||
"external_string_4",
|
||||
"external_string_5",
|
||||
"external_string_6",
|
||||
"external_string_7",
|
||||
};
|
||||
|
||||
fprintf(fp, "\nGC allocation statistics:\n\n");
|
||||
|
||||
#define UL(x) ((unsigned long)(x))
|
||||
#define ULSTAT(x) UL(rt->gcStats.x)
|
||||
#define PERCENT(x,y) (100.0 * (double) (x) / (double) (y))
|
||||
|
||||
size_t sumArenas = 0;
|
||||
size_t sumTotalArenas = 0;
|
||||
size_t sumThings = 0;
|
||||
size_t sumMaxThings = 0;
|
||||
size_t sumThingSize = 0;
|
||||
size_t sumTotalThingSize = 0;
|
||||
size_t sumArenaCapacity = 0;
|
||||
size_t sumTotalArenaCapacity = 0;
|
||||
size_t sumAlloc = 0;
|
||||
size_t sumLocalAlloc = 0;
|
||||
size_t sumFail = 0;
|
||||
size_t sumRetry = 0;
|
||||
for (int i = 0; i < (int) FINALIZE_LIMIT; i++) {
|
||||
size_t thingSize, thingsPerArena;
|
||||
JSGCArenaStats *st;
|
||||
thingSize = rt->gcArenaList[i].thingSize;
|
||||
thingsPerArena = ThingsPerArena(thingSize);
|
||||
st = &rt->gcArenaStats[i];
|
||||
if (st->maxarenas == 0)
|
||||
continue;
|
||||
fprintf(fp,
|
||||
"%s arenas (thing size %lu, %lu things per arena):",
|
||||
GC_ARENA_NAMES[i], UL(thingSize), UL(thingsPerArena));
|
||||
putc('\n', fp);
|
||||
fprintf(fp, " arenas before GC: %lu\n", UL(st->narenas));
|
||||
fprintf(fp, " new arenas before GC: %lu (%.1f%%)\n",
|
||||
UL(st->newarenas), PERCENT(st->newarenas, st->narenas));
|
||||
fprintf(fp, " arenas after GC: %lu (%.1f%%)\n",
|
||||
UL(st->livearenas), PERCENT(st->livearenas, st->narenas));
|
||||
fprintf(fp, " max arenas: %lu\n", UL(st->maxarenas));
|
||||
fprintf(fp, " things: %lu\n", UL(st->nthings));
|
||||
fprintf(fp, " GC cell utilization: %.1f%%\n",
|
||||
PERCENT(st->nthings, thingsPerArena * st->narenas));
|
||||
fprintf(fp, " average cell utilization: %.1f%%\n",
|
||||
PERCENT(st->totalthings, thingsPerArena * st->totalarenas));
|
||||
fprintf(fp, " max things: %lu\n", UL(st->maxthings));
|
||||
fprintf(fp, " alloc attempts: %lu\n", UL(st->alloc));
|
||||
fprintf(fp, " alloc without locks: %lu (%.1f%%)\n",
|
||||
UL(st->localalloc), PERCENT(st->localalloc, st->alloc));
|
||||
sumArenas += st->narenas;
|
||||
sumTotalArenas += st->totalarenas;
|
||||
sumThings += st->nthings;
|
||||
sumMaxThings += st->maxthings;
|
||||
sumThingSize += thingSize * st->nthings;
|
||||
sumTotalThingSize += size_t(thingSize * st->totalthings);
|
||||
sumArenaCapacity += thingSize * thingsPerArena * st->narenas;
|
||||
sumTotalArenaCapacity += thingSize * thingsPerArena * st->totalarenas;
|
||||
sumAlloc += st->alloc;
|
||||
sumLocalAlloc += st->localalloc;
|
||||
sumFail += st->fail;
|
||||
sumRetry += st->retry;
|
||||
putc('\n', fp);
|
||||
}
|
||||
|
||||
fputs("Never used arenas:\n", fp);
|
||||
for (int i = 0; i < (int) FINALIZE_LIMIT; i++) {
|
||||
size_t thingSize, thingsPerArena;
|
||||
JSGCArenaStats *st;
|
||||
thingSize = rt->gcArenaList[i].thingSize;
|
||||
thingsPerArena = ThingsPerArena(thingSize);
|
||||
st = &rt->gcArenaStats[i];
|
||||
if (st->maxarenas != 0)
|
||||
continue;
|
||||
fprintf(fp,
|
||||
"%s (thing size %lu, %lu things per arena)\n",
|
||||
GC_ARENA_NAMES[i], UL(thingSize), UL(thingsPerArena));
|
||||
}
|
||||
fprintf(fp, "\nTOTAL STATS:\n");
|
||||
fprintf(fp, " bytes allocated: %lu\n", UL(rt->gcBytes));
|
||||
fprintf(fp, " total GC arenas: %lu\n", UL(sumArenas));
|
||||
fprintf(fp, " max allocated arenas: %lu\n", ULSTAT(maxnallarenas));
|
||||
fprintf(fp, " max allocated chunks: %lu\n", ULSTAT(maxnchunks));
|
||||
fprintf(fp, " total GC things: %lu\n", UL(sumThings));
|
||||
fprintf(fp, " max total GC things: %lu\n", UL(sumMaxThings));
|
||||
fprintf(fp, " GC cell utilization: %.1f%%\n",
|
||||
PERCENT(sumThingSize, sumArenaCapacity));
|
||||
fprintf(fp, " average cell utilization: %.1f%%\n",
|
||||
PERCENT(sumTotalThingSize, sumTotalArenaCapacity));
|
||||
fprintf(fp, "allocation retries after GC: %lu\n", UL(sumRetry));
|
||||
fprintf(fp, " alloc attempts: %lu\n", UL(sumAlloc));
|
||||
fprintf(fp, " alloc without locks: %lu (%.1f%%)\n",
|
||||
UL(sumLocalAlloc), PERCENT(sumLocalAlloc, sumAlloc));
|
||||
fprintf(fp, " allocation failures: %lu\n", UL(sumFail));
|
||||
fprintf(fp, " valid lock calls: %lu\n", ULSTAT(lock));
|
||||
fprintf(fp, " valid unlock calls: %lu\n", ULSTAT(unlock));
|
||||
fprintf(fp, " delayed tracing calls: %lu\n", ULSTAT(unmarked));
|
||||
#ifdef DEBUG
|
||||
fprintf(fp, " max trace later count: %lu\n", ULSTAT(maxunmarked));
|
||||
#endif
|
||||
fprintf(fp, "potentially useful GC calls: %lu\n", ULSTAT(poke));
|
||||
fprintf(fp, " thing arenas freed so far: %lu\n", ULSTAT(afree));
|
||||
rt->gcStats.conservative.dump(fp);
|
||||
|
||||
#undef UL
|
||||
#undef ULSTAT
|
||||
#undef PERCENT
|
||||
}
|
||||
#endif
|
||||
|
||||
#ifdef MOZ_GCTIMER
|
||||
|
||||
namespace js {
|
||||
|
||||
jsrefcount newChunkCount = 0;
|
||||
jsrefcount destroyChunkCount = 0;
|
||||
|
||||
GCTimer::GCTimer() {
|
||||
getFirstEnter();
|
||||
memset(this, 0, sizeof(GCTimer));
|
||||
enter = rdtsc();
|
||||
}
|
||||
|
||||
uint64
|
||||
GCTimer::getFirstEnter() {
|
||||
static uint64 firstEnter = rdtsc();
|
||||
return firstEnter;
|
||||
}
|
||||
|
||||
void
|
||||
GCTimer::finish(bool lastGC) {
|
||||
end = rdtsc();
|
||||
|
||||
if (startMark > 0 && JS_WANT_GC_TIMER_PRINT) {
|
||||
if (JS_WANT_GC_SUITE_PRINT) {
|
||||
fprintf(stderr, "%f %f %f\n",
|
||||
(double)(end - enter) / 1e6,
|
||||
(double)(startSweep - startMark) / 1e6,
|
||||
(double)(sweepDestroyEnd - startSweep) / 1e6);
|
||||
} else {
|
||||
static FILE *gcFile;
|
||||
|
||||
if (!gcFile) {
|
||||
gcFile = fopen("gcTimer.dat", "w");
|
||||
|
||||
fprintf(gcFile, " AppTime, Total, Mark, Sweep, FinObj,");
|
||||
fprintf(gcFile, " FinStr, Destroy, newChunks, destoyChunks\n");
|
||||
}
|
||||
JS_ASSERT(gcFile);
|
||||
fprintf(gcFile, "%12.1f, %6.1f, %6.1f, %6.1f, %6.1f, %6.1f, %7.1f, ",
|
||||
(double)(enter - getFirstEnter()) / 1e6,
|
||||
(double)(end - enter) / 1e6,
|
||||
(double)(startSweep - startMark) / 1e6,
|
||||
(double)(sweepDestroyEnd - startSweep) / 1e6,
|
||||
(double)(sweepObjectEnd - startSweep) / 1e6,
|
||||
(double)(sweepStringEnd - sweepObjectEnd) / 1e6,
|
||||
(double)(sweepDestroyEnd - sweepStringEnd) / 1e6);
|
||||
fprintf(gcFile, "%10d, %10d \n", newChunkCount,
|
||||
destroyChunkCount);
|
||||
fflush(gcFile);
|
||||
|
||||
if (lastGC) {
|
||||
fclose(gcFile);
|
||||
gcFile = NULL;
|
||||
}
|
||||
}
|
||||
}
|
||||
newChunkCount = 0;
|
||||
destroyChunkCount = 0;
|
||||
}
|
||||
|
||||
#ifdef JS_SCOPE_DEPTH_METER
|
||||
void
|
||||
DumpScopeDepthMeter(JSRuntime *rt)
|
||||
{
|
||||
static FILE *fp;
|
||||
if (!fp)
|
||||
fp = fopen("/tmp/scopedepth.stats", "w");
|
||||
|
||||
if (fp) {
|
||||
JS_DumpBasicStats(&rt->protoLookupDepthStats, "proto-lookup depth", fp);
|
||||
JS_DumpBasicStats(&rt->scopeSearchDepthStats, "scope-search depth", fp);
|
||||
JS_DumpBasicStats(&rt->hostenvScopeDepthStats, "hostenv scope depth", fp);
|
||||
JS_DumpBasicStats(&rt->lexicalScopeDepthStats, "lexical scope depth", fp);
|
||||
|
||||
putc('\n', fp);
|
||||
fflush(fp);
|
||||
}
|
||||
}
|
||||
#endif
|
||||
|
||||
#ifdef JS_DUMP_LOOP_STATS
|
||||
void
|
||||
DumpLoopStats(JSRuntime *rt)
|
||||
{
|
||||
static FILE *lsfp;
|
||||
if (!lsfp)
|
||||
lsfp = fopen("/tmp/loopstats", "w");
|
||||
if (lsfp) {
|
||||
JS_DumpBasicStats(&rt->loopStats, "loops", lsfp);
|
||||
fflush(lsfp);
|
||||
}
|
||||
}
|
||||
#endif
|
||||
|
||||
} /* namespace js */
|
||||
#endif
|
||||
190
js/src/jsgcstats.h
Normal file
190
js/src/jsgcstats.h
Normal file
@ -0,0 +1,190 @@
|
||||
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
|
||||
* vim: set ts=4 sw=4 et tw=99 ft=cpp:
|
||||
*
|
||||
* ***** 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 SpiderMonkey JavaScript 1.9 code, released
|
||||
* June 30, 2010
|
||||
*
|
||||
* The Initial Developer of the Original Code is
|
||||
* the Mozilla Corporation.
|
||||
*
|
||||
* Contributor(s):
|
||||
*
|
||||
* 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 ***** */
|
||||
|
||||
#ifndef jsgcstats_h___
|
||||
#define jsgcstats_h___
|
||||
|
||||
#if !defined JS_DUMP_CONSERVATIVE_GC_ROOTS && defined DEBUG
|
||||
# define JS_DUMP_CONSERVATIVE_GC_ROOTS 1
|
||||
#endif
|
||||
|
||||
/* Define JS_GCMETER here if wanted */
|
||||
#if defined JS_GCMETER
|
||||
const bool JS_WANT_GC_METER_PRINT = true;
|
||||
#elif defined DEBUG
|
||||
# define JS_GCMETER 1
|
||||
const bool JS_WANT_GC_METER_PRINT = false;
|
||||
#endif
|
||||
|
||||
/* MOZ_GCTIMER is a compile flag. --enable-gctimer */
|
||||
#if defined MOZ_GCTIMER
|
||||
const bool JS_WANT_GC_TIMER_PRINT = true;
|
||||
#elif defined DEBUG
|
||||
# define MOZ_GCTIMER 1
|
||||
const bool JS_WANT_GC_TIMER_PRINT = false;
|
||||
#endif
|
||||
|
||||
#define METER_UPDATE_MAX(maxLval, rval) \
|
||||
METER_IF((maxLval) < (rval), (maxLval) = (rval))
|
||||
|
||||
namespace js {
|
||||
|
||||
/*
|
||||
* The conservative GC test for a word shows that it is either a valid GC
|
||||
* thing or is not for one of the following reasons.
|
||||
*/
|
||||
enum ConservativeGCTest {
|
||||
CGCT_VALID,
|
||||
CGCT_LOWBITSET, /* excluded because one of the low bits was set */
|
||||
CGCT_NOTARENA, /* not within arena range in a chunk */
|
||||
CGCT_NOTCHUNK, /* not within a valid chunk */
|
||||
CGCT_FREEARENA, /* within arena containing only free things */
|
||||
CGCT_WRONGTAG, /* tagged pointer but wrong type */
|
||||
CGCT_NOTLIVE, /* gcthing is not allocated */
|
||||
CGCT_END
|
||||
};
|
||||
|
||||
struct ConservativeGCStats {
|
||||
uint32 counter[CGCT_END]; /* ConservativeGCTest classification
|
||||
counters */
|
||||
|
||||
void add(const ConservativeGCStats &another) {
|
||||
for (size_t i = 0; i != JS_ARRAY_LENGTH(counter); ++i)
|
||||
counter[i] += another.counter[i];
|
||||
}
|
||||
|
||||
void dump(FILE *fp);
|
||||
};
|
||||
|
||||
} /* namespace js */
|
||||
|
||||
#ifdef JS_GCMETER
|
||||
|
||||
struct JSGCArenaStats {
|
||||
uint32 alloc; /* allocation attempts */
|
||||
uint32 localalloc; /* allocations from local lists */
|
||||
uint32 retry; /* allocation retries after running the GC */
|
||||
uint32 fail; /* allocation failures */
|
||||
uint32 nthings; /* live GC things */
|
||||
uint32 maxthings; /* maximum of live GC cells */
|
||||
double totalthings; /* live GC things the GC scanned so far */
|
||||
uint32 narenas; /* number of arena in list before the GC */
|
||||
uint32 newarenas; /* new arenas allocated before the last GC */
|
||||
uint32 livearenas; /* number of live arenas after the last GC */
|
||||
uint32 maxarenas; /* maximum of allocated arenas */
|
||||
uint32 totalarenas; /* total number of arenas with live things that
|
||||
GC scanned so far */
|
||||
};
|
||||
|
||||
struct JSGCStats {
|
||||
uint32 lock; /* valid lock calls */
|
||||
uint32 unlock; /* valid unlock calls */
|
||||
uint32 unmarked; /* number of times marking of GC thing's children were
|
||||
delayed due to a low C stack */
|
||||
#ifdef DEBUG
|
||||
uint32 maxunmarked;/* maximum number of things with children to mark
|
||||
later */
|
||||
#endif
|
||||
uint32 poke; /* number of potentially useful GC calls */
|
||||
uint32 afree; /* thing arenas freed so far */
|
||||
uint32 nallarenas; /* number of all allocated arenas */
|
||||
uint32 maxnallarenas; /* maximum number of all allocated arenas */
|
||||
uint32 nchunks; /* number of allocated chunks */
|
||||
uint32 maxnchunks; /* maximum number of allocated chunks */
|
||||
|
||||
js::ConservativeGCStats conservative;
|
||||
};
|
||||
|
||||
extern JS_FRIEND_API(void)
|
||||
js_DumpGCStats(JSRuntime *rt, FILE *fp);
|
||||
|
||||
extern void
|
||||
UpdateArenaStats(JSGCArenaStats *st, uint32 nlivearenas, uint32 nkilledArenas,
|
||||
uint32 nthings);
|
||||
|
||||
#endif /* JS_GCMETER */
|
||||
|
||||
namespace js {
|
||||
|
||||
#ifdef MOZ_GCTIMER
|
||||
|
||||
extern jsrefcount newChunkCount;
|
||||
extern jsrefcount destroyChunkCount;
|
||||
|
||||
const bool JS_WANT_GC_SUITE_PRINT = false; //false for gnuplot output
|
||||
|
||||
struct GCTimer {
|
||||
uint64 enter;
|
||||
uint64 startMark;
|
||||
uint64 startSweep;
|
||||
uint64 sweepObjectEnd;
|
||||
uint64 sweepStringEnd;
|
||||
uint64 sweepDestroyEnd;
|
||||
uint64 end;
|
||||
|
||||
GCTimer();
|
||||
static uint64 getFirstEnter();
|
||||
void finish(bool lastGC);
|
||||
};
|
||||
|
||||
# define GCTIMER_PARAM , GCTimer &gcTimer
|
||||
# define GCTIMER_ARG , gcTimer
|
||||
# define TIMESTAMP(x) (gcTimer.x = rdtsc())
|
||||
# define GCTIMER_BEGIN() GCTimer gcTimer
|
||||
# define GCTIMER_END(last) (gcTimer.finish(last))
|
||||
#else
|
||||
# define GCTIMER_PARAM
|
||||
# define GCTIMER_ARG
|
||||
# define TIMESTAMP(x) ((void) 0)
|
||||
# define GCTIMER_BEGIN() ((void) 0)
|
||||
# define GCTIMER_END(last) ((void) 0)
|
||||
#endif
|
||||
|
||||
#ifdef JS_SCOPE_DEPTH_METER
|
||||
extern void
|
||||
DumpScopeDepthMeter(JSRuntime *rt);
|
||||
#endif
|
||||
|
||||
#ifdef JS_DUMP_LOOP_STATS
|
||||
extern void
|
||||
DumpLoopStats(JSRuntime *rt);
|
||||
#endif
|
||||
|
||||
} /* namepsace js */
|
||||
|
||||
#endif /* jsgcstats_h___ */
|
||||
Loading…
Reference in New Issue
Block a user