Lines Matching +defs:info +defs:found
74 int32_t pri_after; /* priority found after idle move test */
85 static void dump_info_table(pidinfo_t *info, uint32_t count);
317 pidinfo_t info[MAXTESTPIDS];
320 memset (info, 0, MAXTESTPIDS * sizeof(pidinfo_t));
332 /* initialize info structures and properties */
334 info[i].pid = list[i].pid;
335 info[i].pri_random = random() % MAXPRIORITY; /* generate path only */
336 info[i].pri_before = -1;
337 info[i].indx_before = -1;
338 info[i].pri_after = -1;
339 info[i].exp_after = g_new_priority;
340 info[i].indx_after = -1;
345 mp.priority = info[i].pri_random;
354 info[i].exp_after = -1;
361 if (do_get_priority_list(TRUE, list, pid_count, info) == FALSE) {
380 if (do_get_priority_list(FALSE, list, pid_count, info) == FALSE) {
391 qsort ((void *)info, pid_count, sizeof(pidinfo_t),priority_cmp);
402 if (info[i].pri_before == -1){
408 if (info[i].pri_after != info[i].exp_after) {
415 if (info[i].pid == info[i+1].pid) {
420 if (info[i].indx_before < info[i+1].indx_before &&
421 info[i].indx_after < info[i+1].indx_after &&
422 info[i].pri_before <= info[i+1].pri_before &&
423 info[i].pri_after <= info[i+1].pri_after ) {
434 dump_info_table(info, pid_count);
487 int found = 0;
579 /* Introduce a case where pid is not found */
612 dump_info_table(pidinfo_t *info, uint32_t count)
627 printf("%10d", info[i].pid);
628 printf("\t(%4d |", info[i].pri_before);
629 printf("%4d |", info[i].pri_after);
630 printf("%4d)", info[i].exp_after);
631 printf("\t\t(%5d |", info[i].indx_before);
632 printf("%5d)\n", info[i].indx_after);