Lines Matching defs:numMethods
146 int numMethods;
153 int numMethods;
188 int numMethods;
868 pKeys->numMethods = count;
928 qsort(pKeys->methods, pKeys->numMethods, sizeof(MethodEntry),
1007 printf("Methods (%d):\n", pKeys->numMethods);
1008 for (i = 0; i < pKeys->numMethods; i++) {
1108 hi = pKeys->numMethods - 1;
1530 void printExclusiveProfile(MethodEntry **pMethods, int numMethods,
1555 qsort(pMethods, numMethods, sizeof(MethodEntry*), compareElapsedInclusive);
1557 for (ii = 0; ii < numMethods; ++ii)
1562 qsort(pMethods, numMethods, sizeof(MethodEntry*),
1578 for (ii = 0; ii < numMethods; ++ii) {
1691 void printInclusiveProfile(MethodEntry **pMethods, int numMethods,
1714 qsort(pMethods, numMethods, sizeof(MethodEntry*),
1725 for (ii = 0; ii < numMethods; ++ii) {
1790 void createClassList(TraceData* traceData, MethodEntry **pMethods, int numMethods)
1797 qsort(pMethods, numMethods, sizeof(MethodEntry*), compareClassNames);
1803 for (ii = 0; ii < numMethods; ++ii) {
1830 for (ii = 0; ii < numMethods; ++ii) {
1835 pClass->numMethods = prevNumMethods;
1841 pClass->numMethods = prevNumMethods;
1847 for (ii = 0; ii < numMethods; ++ii) {
1858 int nbytes = sizeof(MethodEntry*) * pClass->numMethods;
1930 //printf("%s %d methods\n", pClass->className, pClass->numMethods);
1931 int numMethods = pClass->numMethods;
1932 for (jj = 0; jj < numMethods; ++jj) {
1940 qsort(pClass->methods, numMethods, sizeof(MethodEntry*),
2006 int numMethods = pClass->numMethods;
2009 for (jj = 0; jj < numMethods; ++jj) {
2058 void createUniqueMethodList(TraceData* traceData, MethodEntry **pMethods, int numMethods)
2065 qsort(pMethods, numMethods, sizeof(MethodEntry*), compareMethodNames);
2072 for (ii = 0; ii < numMethods; ++ii) {
2092 for (ii = 0; ii < numMethods; ++ii) {
2099 pUnique->numMethods = prevNumMethods;
2105 pUnique->numMethods = prevNumMethods;
2111 for (ii = 0; ii < numMethods; ++ii) {
2121 int nbytes = sizeof(MethodEntry*) * pUnique->numMethods;
2161 int numMethods = pUnique->numMethods;
2162 for (jj = 0; jj < numMethods; ++jj) {
2170 qsort(pUnique->methods, numMethods, sizeof(MethodEntry*),
2237 int numMethods = pUnique->numMethods;
2240 for (jj = 0; jj < numMethods; ++jj) {
2492 MethodEntry** pMethods = (MethodEntry**) malloc(sizeof(MethodEntry*) * dataKeys->numMethods);
2493 for (ii = 0; ii < dataKeys->numMethods; ++ii) {
2504 void profileTrace(TraceData* traceData, MethodEntry **pMethods, int numMethods, uint64_t sumThreadTime)
2512 printExclusiveProfile(pMethods, numMethods, sumThreadTime);
2513 printInclusiveProfile(pMethods, numMethods, sumThreadTime);
2515 createClassList(traceData, pMethods, numMethods);
2518 createUniqueMethodList(traceData, pMethods, numMethods);
2631 qsort(methods1, d1->numMethods, sizeof(MethodEntry*), compareElapsedInclusive);
2632 for (i = 0; i < d1->numMethods; ++i) {
2636 qsort(methods2, d2->numMethods, sizeof(MethodEntry*), compareElapsedInclusive);
2637 for (i = 0; i < d2->numMethods; ++i) {
2641 int max = (d1->numMethods < d2->numMethods) ? d2->numMethods : d1->numMethods;
2647 // printf("<br>d1->numMethods: %d d1->numMethods: %d<br>\n", d1->numMethods, d2->numMethods);
2651 for (i = 0 ; i < d1->numMethods ; i++) {
2652 int match = findMatch(methods2, d2->numMethods, methods1[i]);
2783 for (i = 0; i < d1->numMethods; ++i) {
2795 for (i = 0; i < d2->numMethods; ++i) {
2900 profileTrace(&data1, methods, dataKeys->numMethods, sumThreadTime);
