Lines Matching defs:top
203 int32_t top;
1307 void countRecursiveEntries(CallStack* pStack, int32_t top, MethodEntry* method) {
1309 for (int32_t ii = 0; ii < top; ++ii) {
1314 void stackDump(CallStack* pStack, int32_t top) {
1315 for (int32_t ii = 0; ii < top; ++ii) {
1693 * sort the methods so the most expensive appear at the top.
1903 * sort the methods so the most expensive appear at the top.
2075 pStack->top = 0;
2090 pStack->top, method->className, method->methodName,
2096 pStack->top, method->className);
2102 if (pStack->top >= MAX_STACK_DEPTH) {
2109 if (pStack->top >= 1)
2110 caller = pStack->calls[pStack->top - 1].method;
2113 countRecursiveEntries(pStack, pStack->top, caller);
2127 pStack->calls[pStack->top].method = method;
2128 pStack->calls[pStack->top++].entryTime = currentTime;
2134 if (pStack->top > 0) {
2135 pStack->top -= 1;
2136 entryTime = pStack->calls[pStack->top].entryTime;
2137 if (method != pStack->calls[pStack->top].method) {
2145 stackDump(pStack, pStack->top + 1);
2151 if (pStack->top >= 1)
2152 caller = pStack->calls[pStack->top - 1].method;
2155 countRecursiveEntries(pStack, pStack->top, caller);
2156 countRecursiveEntries(pStack, pStack->top, method);
2182 for (int32_t ii = 0; ii < pStack->top; ++ii) {