Lines Matching refs:runp
1198 struct arc_list *runp = sym->froms; in add_arcs() local
1200 while (runp != NULL in add_arcs()
1201 && ((data[cnt].from_pc == 0 && runp->idx != (size_t) -1l) in add_arcs()
1203 && (runp->idx == (size_t) -1l in add_arcs()
1204 || data[cnt].from_pc < sortsym[runp->idx]->addr in add_arcs()
1206 >= (sortsym[runp->idx]->addr in add_arcs()
1207 + sortsym[runp->idx]->size)))))) in add_arcs()
1208 runp = runp->next; in add_arcs()
1210 if (runp == NULL) in add_arcs()
1226 runp->count += data[cnt].count; in add_arcs()
1234 struct arc_list *runp = sym->tos; in add_arcs() local
1236 while (runp != NULL in add_arcs()
1237 && (runp->idx == (size_t) -1l in add_arcs()
1238 || data[cnt].self_pc < sortsym[runp->idx]->addr in add_arcs()
1239 || data[cnt].self_pc >= (sortsym[runp->idx]->addr in add_arcs()
1240 + sortsym[runp->idx]->size))) in add_arcs()
1241 runp = runp->next; in add_arcs()
1243 if (runp == NULL) in add_arcs()
1256 runp->count += data[cnt].count; in add_arcs()
1344 struct arc_list *runp; in generate_call_graph() local
1348 runp = sortsym[cnt]->froms; in generate_call_graph()
1349 while (runp != NULL) in generate_call_graph()
1352 (runp->idx != (size_t) -1l in generate_call_graph()
1353 ? sortsym[runp->idx]->ticks * tick_unit : 0.0), in generate_call_graph()
1355 runp->count, sortsym[cnt]->calls, in generate_call_graph()
1356 (runp->idx != (size_t) -1l in generate_call_graph()
1357 ? sortsym[runp->idx]->name : "<UNKNOWN>")); in generate_call_graph()
1359 if (runp->idx != (size_t) -1l) in generate_call_graph()
1360 printf (" [%Zd]", runp->idx); in generate_call_graph()
1363 runp = runp->next; in generate_call_graph()
1377 runp = sortsym[cnt]->tos; in generate_call_graph()
1378 while (runp != NULL) in generate_call_graph()
1381 (runp->idx != (size_t) -1l in generate_call_graph()
1382 ? sortsym[runp->idx]->ticks * tick_unit : 0.0), in generate_call_graph()
1384 runp->count); in generate_call_graph()
1386 if (runp->idx != (size_t) -1l) in generate_call_graph()
1388 sortsym[runp->idx]->calls, in generate_call_graph()
1389 sortsym[runp->idx]->name, in generate_call_graph()
1390 runp->idx); in generate_call_graph()
1394 runp = runp->next; in generate_call_graph()
1410 struct arc_list *runp; in generate_call_pair_list() local
1413 runp = sortsym[cnt]->froms; in generate_call_pair_list()
1414 while (runp != NULL) in generate_call_pair_list()
1416 if (runp->idx == (size_t) -1l) in generate_call_pair_list()
1419 sortsym[cnt]->name, runp->count); in generate_call_pair_list()
1420 runp = runp->next; in generate_call_pair_list()
1424 runp = sortsym[cnt]->tos; in generate_call_pair_list()
1425 while (runp != NULL) in generate_call_pair_list()
1429 (runp->idx != (size_t) -1l in generate_call_pair_list()
1430 ? sortsym[runp->idx]->name : "<UNKNOWN>"), in generate_call_pair_list()
1431 runp->count); in generate_call_pair_list()
1432 runp = runp->next; in generate_call_pair_list()