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

Lines Matching defs:next
137     struct TimedMethod *next;
579  * Find the offset to the next occurrence of the specified character.
602  * Count the number of lines until the next token.
609     int next;
612         next = findNextChar(data, len, '\n');
613         if (next < 0)
616         data += next+1;
617         len -= next+1;
631     int next;
639     next = findNextChar(data, len, '\n');
640     if (next < cmpLen+1)
648     return next+1;
658     int i, count, next;
665     next = checkToken(data, dataEnd - data, "version");
666     if (next <= 0)
669     data += next;
682     next = findNextChar(data, dataEnd - data, '\n');
683     if (next < 0)
686     data[next] = '\0';
691     data += next+1;
695         next = findNextChar(data, dataEnd - data, '\n');
696         if (next < 0)
698         //data[next] = '\0';
700         data += next+1;
713     int i, next, tab, count;
720     next = checkToken(data, dataEnd - data, "threads");
722     data += next;
743         next = findNextChar(data, dataEnd - data, '\n');
744         assert(next > 0);
745         data[next] = '\0';
747         tab = findNextChar(data, next, '\t');
753         data += next+1;
767     int i, next, count;
774     next = checkToken(data, dataEnd - data, "methods");
775     if (next < 0)
778     data += next;
810         next = findNextChar(data, dataEnd - data, '\n');
811         assert(next > 0);
812         data[next] = '\0';
814         tab1 = findNextChar(data, next, '\t');
815         tab2 = findNextChar(data+(tab1+1), next-(tab1+1), '\t');
816         tab3 = findNextChar(data+(tab1+tab2+2), next-(tab1+tab2+2), '\t');
818                             next-(tab1+tab2+tab3+3), '\t');
820                             next-(tab1+tab2+tab3+tab4+4), '\t');
865         data += next+1;
879     int next;
886     next = checkToken(data, dataEnd - data, "end");
887     if (next < 0)
890     data += next;
1126  * Reads the next data record, and assigns the data values to threadId,
1316     for (pTimed = children; pTimed; pTimed = pTimed->next) {
1331         pTimed->next = children;
1337     for (pTimed = parents; pTimed; pTimed = pTimed->next) {
1352         pTimed->next = parents;
1376     for (pTimed = list; pTimed; pTimed = pTimed->next)
1384     for (ii = 0, pTimed = list; pTimed; pTimed = pTimed->next, ++ii)
1388     /* Fix up the "next" pointers so that they work. */
1390         sorted[ii].next = &sorted[ii + 1];
1391     sorted[num_entries - 1].next = NULL;
1422     for (pTimed = sorted; pTimed; pTimed = pTimed->next) {
1634     for (child = method->children[0] ; child ; child = child->next) {
1648     for (child = method->children[0] ; child ; child = child->next) {
2445         /* If this thread never existed, then continue with next thread */