%s

\n" michael@0: " " michael@0: " \n" michael@0: " \n", id, michael@0: table_class ? table_class : "", michael@0: caption); michael@0: michael@0: for (i=0; i< header_length; i++) michael@0: PR_fprintf(inRequest->mFD, michael@0: " \n", headers[i]); michael@0: michael@0: PR_fprintf(inRequest->mFD, " \n"); michael@0: } michael@0: michael@0: /* michael@0: ** callsiteArrayFromCallsite michael@0: ** michael@0: ** Simply return an array of the callsites divulged from the site passed in, michael@0: ** including the site passed in. michael@0: ** Do not worry about dups, or the order of the items. michael@0: ** michael@0: ** Returns the number of items in the array. michael@0: ** If the same as aExistingCount, then nothing happened. michael@0: */ michael@0: uint32_t michael@0: callsiteArrayFromCallsite(tmcallsite *** aArray, uint32_t aExistingCount, michael@0: tmcallsite * aSite, int aFollow) michael@0: { michael@0: uint32_t retval = 0; michael@0: michael@0: if (NULL != aArray && NULL != aSite) { michael@0: tmcallsite **expand = NULL; michael@0: michael@0: /* michael@0: ** If we have an existing count, we just keep expanding this. michael@0: */ michael@0: retval = aExistingCount; michael@0: michael@0: /* michael@0: ** Go through every allocation. michael@0: */ michael@0: do { michael@0: /* michael@0: ** expand the array. michael@0: */ michael@0: expand = michael@0: (tmcallsite **) realloc(*aArray, michael@0: sizeof(tmcallsite *) * (retval + 1)); michael@0: if (NULL != expand) { michael@0: /* michael@0: ** Set the callsite in case of pointer move. michael@0: */ michael@0: *aArray = expand; michael@0: michael@0: /* michael@0: ** Assign the value. michael@0: */ michael@0: (*aArray)[retval] = aSite; michael@0: retval++; michael@0: } michael@0: else { michael@0: REPORT_ERROR(__LINE__, realloc); michael@0: break; michael@0: } michael@0: michael@0: michael@0: /* michael@0: ** What do we follow? michael@0: */ michael@0: switch (aFollow) { michael@0: case ST_FOLLOW_SIBLINGS: michael@0: aSite = aSite->siblings; michael@0: break; michael@0: case ST_FOLLOW_PARENTS: michael@0: aSite = aSite->parent; michael@0: break; michael@0: default: michael@0: aSite = NULL; michael@0: REPORT_ERROR(__LINE__, callsiteArrayFromCallsite); michael@0: break; michael@0: } michael@0: } michael@0: while (NULL != aSite && NULL != aSite->method); michael@0: } michael@0: michael@0: return retval; michael@0: } michael@0: michael@0: /* michael@0: ** callsiteArrayFromRun michael@0: ** michael@0: ** Simply return an array of the callsites from the run allocations. michael@0: ** We only pay attention to callsites that were not free callsites. michael@0: ** Do not worry about dups, or the order of the items. michael@0: ** michael@0: ** Returns the number of items in the array. michael@0: ** If the same as aExistingCount, then nothing happened. michael@0: */ michael@0: uint32_t michael@0: callsiteArrayFromRun(tmcallsite *** aArray, uint32_t aExistingCount, michael@0: STRun * aRun) michael@0: { michael@0: uint32_t retval = 0; michael@0: michael@0: if (NULL != aArray && NULL != aRun && 0 < aRun->mAllocationCount) { michael@0: uint32_t allocLoop = 0; michael@0: uint32_t eventLoop = 0; michael@0: int stopLoops = 0; michael@0: michael@0: /* michael@0: ** If we have an existing count, we just keep expanding this. michael@0: */ michael@0: retval = aExistingCount; michael@0: michael@0: /* michael@0: ** Go through every allocation. michael@0: */ michael@0: for (allocLoop = 0; michael@0: 0 == stopLoops && allocLoop < aRun->mAllocationCount; michael@0: allocLoop++) { michael@0: /* michael@0: ** Go through every event. michael@0: */ michael@0: for (eventLoop = 0; michael@0: 0 == stopLoops michael@0: && eventLoop < aRun->mAllocations[allocLoop]->mEventCount; michael@0: eventLoop++) { michael@0: /* michael@0: ** Skip the free events. michael@0: */ michael@0: if (TM_EVENT_FREE != michael@0: aRun->mAllocations[allocLoop]->mEvents[eventLoop]. michael@0: mEventType) { michael@0: tmcallsite **expand = NULL; michael@0: michael@0: /* michael@0: ** expand the array. michael@0: */ michael@0: expand = michael@0: (tmcallsite **) realloc(*aArray, michael@0: sizeof(tmcallsite *) * michael@0: (retval + 1)); michael@0: if (NULL != expand) { michael@0: /* michael@0: ** Set the callsite in case of pointer move. michael@0: */ michael@0: *aArray = expand; michael@0: michael@0: /* michael@0: ** Assign the value. michael@0: */ michael@0: (*aArray)[retval] = michael@0: aRun->mAllocations[allocLoop]->mEvents[eventLoop]. michael@0: mCallsite; michael@0: retval++; michael@0: } michael@0: else { michael@0: REPORT_ERROR(__LINE__, realloc); michael@0: stopLoops = __LINE__; michael@0: } michael@0: } michael@0: } michael@0: } michael@0: } michael@0: michael@0: return retval; michael@0: } michael@0: michael@0: /* michael@0: ** getDataPRUint* michael@0: ** michael@0: ** Helper to avoid cut and paste code. michael@0: ** Failure to find aCheckFor does not mean failure. michael@0: ** In case of dups, specify an index on non "1" to get others. michael@0: ** Do not touch storage space unless a find is made. michael@0: ** Returns !0 on failure. michael@0: */ michael@0: int michael@0: getDataPRUint32Base(const FormData * aGetData, const char *aCheckFor, michael@0: int inIndex, void *aStoreResult, uint32_t aBits) michael@0: { michael@0: int retval = 0; michael@0: michael@0: if (NULL != aGetData && NULL != aCheckFor && 0 != inIndex michael@0: && NULL != aStoreResult) { michael@0: unsigned finder = 0; michael@0: michael@0: /* michael@0: ** Loop over the names, looking for an exact string match. michael@0: ** Skip over initial finds, decrementing inIndex, until "1". michael@0: */ michael@0: for (finder = 0; finder < aGetData->mNVCount; finder++) { michael@0: if (0 == strcmp(aCheckFor, aGetData->mNArray[finder])) { michael@0: inIndex--; michael@0: michael@0: if (0 == inIndex) { michael@0: int32_t scanRes = 0; michael@0: michael@0: if (64 == aBits) { michael@0: scanRes = michael@0: PR_sscanf(aGetData->mVArray[finder], "%llu", michael@0: aStoreResult); michael@0: } michael@0: else { michael@0: scanRes = michael@0: PR_sscanf(aGetData->mVArray[finder], "%u", michael@0: aStoreResult); michael@0: } michael@0: if (1 != scanRes) { michael@0: retval = __LINE__; michael@0: REPORT_ERROR(__LINE__, PR_sscanf); michael@0: } michael@0: break; michael@0: } michael@0: } michael@0: } michael@0: } michael@0: else { michael@0: retval = __LINE__; michael@0: REPORT_ERROR(__LINE__, getDataPRUint32Base); michael@0: } michael@0: michael@0: return retval; michael@0: } michael@0: michael@0: int michael@0: getDataPRUint32(const FormData * aGetData, const char *aCheckFor, int inIndex, michael@0: uint32_t * aStoreResult, uint32_t aConversion) michael@0: { michael@0: int retval = 0; michael@0: michael@0: retval = michael@0: getDataPRUint32Base(aGetData, aCheckFor, inIndex, aStoreResult, 32); michael@0: *aStoreResult *= aConversion; michael@0: michael@0: return retval; michael@0: } michael@0: michael@0: int michael@0: getDataPRUint64(const FormData * aGetData, const char *aCheckFor, int inIndex, michael@0: uint64_t * aStoreResult64, uint64_t aConversion64) michael@0: { michael@0: int retval = 0; michael@0: uint64_t value64 = 0; michael@0: michael@0: retval = getDataPRUint32Base(aGetData, aCheckFor, inIndex, &value64, 64); michael@0: *aStoreResult64 = value64 * aConversion64; michael@0: michael@0: return retval; michael@0: } michael@0: michael@0: /* michael@0: ** getDataString michael@0: ** michael@0: ** Pull out the string data, if specified. michael@0: ** In case of dups, specify an index on non "1" to get others. michael@0: ** Do not touch storage space unless a find is made. michael@0: ** Return !0 on failure. michael@0: */ michael@0: int michael@0: getDataString(const FormData * aGetData, const char *aCheckFor, int inIndex, michael@0: char *aStoreResult, int inStoreResultLength) michael@0: { michael@0: int retval = 0; michael@0: michael@0: if (NULL != aGetData && NULL != aCheckFor && 0 != inIndex michael@0: && NULL != aStoreResult && 0 != inStoreResultLength) { michael@0: unsigned finder = 0; michael@0: michael@0: /* michael@0: ** Loop over the names, looking for an exact string match. michael@0: ** Skip over initial finds, decrementing inIndex, until "1". michael@0: */ michael@0: for (finder = 0; finder < aGetData->mNVCount; finder++) { michael@0: if (0 == strcmp(aCheckFor, aGetData->mNArray[finder])) { michael@0: inIndex--; michael@0: michael@0: if (0 == inIndex) { michael@0: PR_snprintf(aStoreResult, inStoreResultLength, "%s", michael@0: aGetData->mVArray[finder]); michael@0: break; michael@0: } michael@0: } michael@0: } michael@0: } michael@0: else { michael@0: retval = __LINE__; michael@0: REPORT_ERROR(__LINE__, getDataPRUint32); michael@0: } michael@0: michael@0: return retval; michael@0: } michael@0: michael@0: /* michael@0: ** displayTopAllocations michael@0: ** michael@0: ** Present the top allocations. michael@0: ** The run must be passed in, and it must be pre-sorted. michael@0: ** michael@0: ** Returns !0 on failure. michael@0: */ michael@0: int michael@0: displayTopAllocations(STRequest * inRequest, STRun * aRun, michael@0: const char* id, michael@0: const char* caption, michael@0: int aWantCallsite) michael@0: { michael@0: int retval = 0; michael@0: michael@0: if (NULL != aRun) { michael@0: if (0 < aRun->mAllocationCount) { michael@0: uint32_t loop = 0; michael@0: STAllocation *current = NULL; michael@0: michael@0: static const char* const headers[] = { michael@0: "Rank", "Index", "Byte Size", "Lifespan (sec)", michael@0: "Weight", "Heap Op (sec)" michael@0: }; michael@0: michael@0: static const char* const headers_callsite[] = { michael@0: "Rank", "Index", "Byte Size", "Lifespan (sec)", michael@0: "Weight", "Heap Op (sec)", "Origin Callsite" michael@0: }; michael@0: michael@0: if (aWantCallsite) michael@0: htmlStartTable(inRequest, NULL, id, michael@0: caption, michael@0: headers_callsite, michael@0: sizeof(headers_callsite) / sizeof(headers_callsite[0])); michael@0: else michael@0: htmlStartTable(inRequest, NULL, id, caption, michael@0: headers, michael@0: sizeof(headers) / sizeof(headers[0])); michael@0: /* michael@0: ** Loop over the items, up to some limit or until the end. michael@0: */ michael@0: for (loop = 0; michael@0: loop < inRequest->mOptions.mListItemMax michael@0: && loop < aRun->mAllocationCount; loop++) { michael@0: current = aRun->mAllocations[loop]; michael@0: if (NULL != current) { michael@0: uint32_t lifespan = michael@0: current->mMaxTimeval - current->mMinTimeval; michael@0: uint32_t size = byteSize(&inRequest->mOptions, current); michael@0: uint32_t heapCost = current->mHeapRuntimeCost; michael@0: uint64_t weight64 = 0; michael@0: char buffer[32]; michael@0: michael@0: weight64 =(uint64_t)(size * lifespan); michael@0: michael@0: PR_fprintf(inRequest->mFD, "\n"); michael@0: michael@0: /* michael@0: ** Rank. michael@0: */ michael@0: PR_fprintf(inRequest->mFD, "\n", michael@0: loop + 1); michael@0: michael@0: /* michael@0: ** Index. michael@0: */ michael@0: PR_snprintf(buffer, sizeof(buffer), "%u", michael@0: current->mRunIndex); michael@0: PR_fprintf(inRequest->mFD, "\n"); michael@0: michael@0: /* michael@0: ** Byte Size. michael@0: */ michael@0: PR_fprintf(inRequest->mFD, "\n", michael@0: size); michael@0: michael@0: /* michael@0: ** Lifespan. michael@0: */ michael@0: PR_fprintf(inRequest->mFD, michael@0: "\n", michael@0: ST_TIMEVAL_PRINTABLE(lifespan)); michael@0: michael@0: /* michael@0: ** Weight. michael@0: */ michael@0: PR_fprintf(inRequest->mFD, "\n", michael@0: weight64); michael@0: michael@0: /* michael@0: ** Heap operation cost. michael@0: */ michael@0: PR_fprintf(inRequest->mFD, michael@0: "\n", ST_MICROVAL_PRINTABLE(heapCost)); michael@0: michael@0: if (0 != aWantCallsite) { michael@0: /* michael@0: ** Callsite. michael@0: */ michael@0: PR_fprintf(inRequest->mFD, "\n"); michael@0: } michael@0: michael@0: PR_fprintf(inRequest->mFD, "\n"); michael@0: } michael@0: } michael@0: michael@0: PR_fprintf(inRequest->mFD, "\n

%s
%s
%u	\n"); michael@0: htmlAllocationAnchor(inRequest, current, buffer); michael@0: PR_fprintf(inRequest->mFD, "	%u	" ST_TIMEVAL_FORMAT "	%llu	" ST_MICROVAL_FORMAT michael@0: "	"); michael@0: htmlCallsiteAnchor(inRequest, michael@0: current->mEvents[0].mCallsite, michael@0: NULL, 0); michael@0: PR_fprintf(inRequest->mFD, "

Final Size:	%u
Lifespan Seconds:	" michael@0: ST_TIMEVAL_FORMAT "
Weight:	%llu
Heap Operation Seconds:	" michael@0: ST_MICROVAL_FORMAT "

Composite Byte Size:	%u
Composite Seconds:	" michael@0: ST_TIMEVAL_FORMAT "
Composite Weight:	%llu
Heap Object Count:	%u
Heap Operation Seconds:	" michael@0: ST_MICROVAL_FORMAT "

\n"); michael@0: #endif michael@0: #define ST_WEB_OPTION_BOOL(option_name, option_genre, option_help) \ michael@0: displayOptionBool(option_name, option_genre, option_help) michael@0: #define ST_WEB_OPTION_STRING(option_name, option_genre, default_value, option_help) \ michael@0: displayOptionString(inRequest, #option_name, #option_genre, default_value, option_help, inRequest->mOptions.m##option_name); michael@0: #define ST_WEB_OPTION_STRING_ARRAY(option_name, option_genre, array_size, option_help) \ michael@0: displayOptionStringArray(inRequest, #option_name, #option_genre, array_size, option_help, inRequest->mOptions.m##option_name); michael@0: #define ST_WEB_OPTION_STRING_PTR_ARRAY(option_name, option_genre, option_help) /* no implementation */ michael@0: #define ST_WEB_OPTION_UINT32(option_name, option_genre, default_value, multiplier, option_help) \ michael@0: displayOptionInt(inRequest, #option_name, #option_genre, default_value, multiplier, option_help, inRequest->mOptions.m##option_name); michael@0: #define ST_WEB_OPTION_UINT64(option_name, option_genre, default_value, multiplier, option_help) \ michael@0: displayOptionInt64(inRequest, #option_name, #option_genre, default_value, multiplier, option_help, inRequest->mOptions.m##option_name##64); michael@0: #include "stoptions.h" michael@0: /* michael@0: ** Give a submit/reset button, obligatory. michael@0: ** Done respecting newlines in help text. michael@0: */ michael@0: PR_fprintf(inRequest->mFD, michael@0: " \n"); michael@0: #if 0 michael@0: PR_fprintf(inRequest->mFD, "