Lines Matching refs:top
214 int top;
1554 void countRecursiveEntries(CallStack *pStack, int top, MethodEntry *method)
1559 for (ii = 0; ii < top; ++ii) {
1565 void stackDump(CallStack *pStack, int top)
1569 for (ii = 0; ii < top; ++ii) {
1596 printf("<a href=\"#contents\">[Top]</a>\n");
2115 * sort the methods so the most expensive appear at the top.
2346 * sort the methods so the most expensive appear at the top.
2978 pStack->top = 0;
2995 pStack->top, method->className, method->methodName,
3001 pStack->top, method->className);
3007 if (pStack->top >= MAX_STACK_DEPTH) {
3014 if (pStack->top >= 1)
3015 caller = pStack->calls[pStack->top - 1].method;
3018 countRecursiveEntries(pStack, pStack->top, caller);
3032 pStack->calls[pStack->top].method = method;
3033 pStack->calls[pStack->top++].entryTime = currentTime;
3059 if (pStack->top > 0) {
3060 pStack->top -= 1;
3061 entryTime = pStack->calls[pStack->top].entryTime;
3062 if (method != pStack->calls[pStack->top].method) {
3073 stackDump(pStack, pStack->top + 1);
3079 if (pStack->top >= 1)
3080 caller = pStack->calls[pStack->top - 1].method;
3083 countRecursiveEntries(pStack, pStack->top, caller);
3084 top, method);
3134 for (ii = 0; ii < pStack->top; ++ii) {
