Cross Reference: /dalvik/tools/dmtracedump/TraceDump.c

Lines Matching defs:methods
147     struct MethodEntry **methods;       /* list of methods in this class */
154     struct MethodEntry **methods;       /* list of methods with same name */
175     int index;                  /* used after sorting to number methods */
189     MethodEntry* methods;       /* 2 extra methods: "toplevel" and "unknown" */
327  * methods into decreasing order of exclusive elapsed time.
342     /* If the elapsed times of two methods are equal, then sort them
365  * methods into decreasing order of inclusive elapsed time.
381     /* If the elapsed times of two methods are equal, then sort them
420     /* If the elapsed times of two methods are equal, then sort them
490         unsigned int idA = classA->methods[0]->methodId;
491         unsigned int idB = classB->methods[0]->methodId;
532  * unique methods into decreasing order of exclusive elapsed time.
547     /* If the elapsed times of two methods are equal, then sort them
550     result = strcmp(uniqueA->methods[0]->className,
551                     uniqueB->methods[0]->className);
553         unsigned int idA = uniqueA->methods[0]->methodId;
554         unsigned int idB = uniqueB->methods[0]->methodId;
574     free(pKeys->methods);
761  * Parse the "*methods" section.
774     next = checkToken(data, dataEnd - data, "methods");
786             "ERROR: failed while reading methods (found %d)\n", count);
791      * and another extra method for all other "unknown" methods.
794     pKeys->methods = (MethodEntry*) malloc(sizeof(MethodEntry) * count);
795     if (pKeys->methods == NULL)
797     initMethodEntry(&pKeys->methods[TOPLEVEL_INDEX], 0, "(toplevel)",
799     initMethodEntry(&pKeys->methods[UNKNOWN_INDEX], 0, "(unknown)",
853                 initMethodEntry(&pKeys->methods[i], id, data + tab1 +1,
857                 initMethodEntry(&pKeys->methods[i], id, data + tab1 +1,
861             initMethodEntry(&pKeys->methods[i], id, data + tab1 +1,
928     qsort(pKeys->methods, pKeys->numMethods, sizeof(MethodEntry),
1004      * Dump list of methods.
1010                    pKeys->methods[i].methodId, pKeys->methods[i].className,
1011                    pKeys->methods[i].methodName, pKeys->methods[i].signature);
1113         id = pKeys->methods[mid].methodId;
1115             return &pKeys->methods[mid];
1278 /* This routine adds the given time to the parent and child methods.
1552     /* First, sort the methods into decreasing order of inclusive
1560     /* Sort the methods into decreasing order of exclusive elapsed time.
1582         /* Don't show methods with zero cycles */
1674     createLabels(file, dataKeys->methods);
1675     createLinks(file, dataKeys->methods);
1713     /* Sort the methods into decreasing order of inclusive elapsed time. */
1733         /* Don't show methods with zero cycles */
1794     /* Sort the methods into alphabetical order to find the unique class
1857             /* Allocate space for the methods array */
1859             pClass->methods = (MethodEntry**) malloc(nbytes);
1862         pClass->methods[nextMethod++] = pMethods[ii];
1918     printf("\nExclusive elapsed time for each class, summed over all the methods\n");
1924     /* For each class, sum the exclusive times in all of the methods
1926      * sort the methods so the most expensive appear at the top.
1930         //printf("%s %d methods\n", pClass->className, pClass->numMethods);
1933             method = pClass->methods[jj];
1939         /* Sort the methods into decreasing order of exclusive time */
1940         qsort(pClass->methods, numMethods, sizeof(MethodEntry*),
2010             method = pClass->methods[jj];
2062     /* Sort the methods into alphabetical order of method names
2083     /* Allocate space for pointers to all of the unique methods */
2120             /* Allocate space for the methods array */
2122             pUnique->methods = (MethodEntry**) malloc(nbytes);
2125         pUnique->methods[nextMethod++] = pMethods[ii];
2155     /* For each unique method, sum the exclusive times in all of the methods
2157      * sort the methods so the most expensive appear at the top.
2163             method = pUnique->methods[jj];
2169         /* Sort the methods into decreasing order of exclusive time */
2170         qsort(pUnique->methods, numMethods, sizeof(MethodEntry*),
2174     /* Allocate an array of pointers to the methods for more efficient
2183     /* Sort the methods into decreasing order of exclusive time */
2198         /* Skip methods with zero cycles */
2206         methodName = (char*)(pUnique->methods[0]->methodName);
2241             method = pUnique->methods[jj];
2347             method = &dataKeys->methods[UNKNOWN_INDEX];
2376                 caller = &dataKeys->methods[TOPLEVEL_INDEX];
2421                 caller = &dataKeys->methods[TOPLEVEL_INDEX];
2437      * are exiting from their methods now.
2454                 caller = &dataKeys->methods[TOPLEVEL_INDEX];
2466     caller = &dataKeys->methods[TOPLEVEL_INDEX];
2487     /* Create a new array of pointers to the methods and sort the pointers
2494         MethodEntry* entry = &dataKeys->methods[ii];
2502  * Produce a function profile from the following methods
2545 int findMatch(MethodEntry** methods, int size, MethodEntry* matchThis)
2550         MethodEntry* method = methods[i];
2779         printf("<h3>Run 1 methods not found in Run 2</h3>");
2791         printf("<h3>Run 2 methods not found in Run 1</h3>");
2899         MethodEntry** methods = parseMethodEntries(dataKeys);
2900         profileTrace(&data1, methods, dataKeys->numMethods, sumThreadTime);
2904         free(methods);