Lines Matching defs:index
67 int i, index;
85 index = 0;
88 sortednlp[index++] = &(mi->nl[i]);
93 for (index = 0; (index < total_names) && print_flag; index += 1) {
94 np = sortednlp[index];
240 "index", "%time", "self", "descendents",
241 "called", "self", "name", "index");
252 (void) sprintf(kirkbuffer, "[%d]", np->index);
294 int index;
304 for (index = 0; index < total_names + ncycle && count_flag; index++) {
305 parentp = timesortnlp[index];
520 if (selfp->index != 0) {
522 (void) printf(" [%d]", selfp->index);
524 (void) printf(" (%d)", selfp->index);
636 (void) sprintf(kirkbuffer, "[%d]", cyclep->index);
648 cyclep->index);
942 int index, nnames, todo, i, j;
948 * to create an index.
958 for (index = 0; index < mi->nname; index++) {
959 if (zflag == 0 && (mi->nl[index]).ncall == 0 &&
960 (mi->nl[index]).time == 0) {
968 if (is_special_sym(&(mi->nl[index])))
971 namesortnlp[nnames++] = &(mi->nl[index]);
982 for (index = 1, todo = nnames; index <= ncycle; index++)
983 namesortnlp[todo++] = &cyclenl[index];
988 index = (todo + 2) / 3;
990 index = todo;
992 for (i = 0; i < index; i++) {
994 for (j = i; j < todo; j += index) {
999 "[%d]", nlp->index);
1002 "(%d)", nlp->index);
1031 (void) sprintf(peterbuffer, "[%d]", nlp->index);
1033 (void) sprintf(peterbuffer, "(%d)", nlp->index);