Lines Matching refs:repcount
348 if (e1->repcount < e2->repcount)
350 else if (e1->repcount > e2->repcount)
359 * And a final way of sorting a log (by access type followed by repcount).
371 else if (e1->repcount < e2->repcount)
373 else if (e1->repcount > e2->repcount)
409 items->value, items->repcount,
422 items->value, items->repcount,
772 acnt = item->repcount / 10 + 1; /* 10% */
789 i, item->repcount, acnt, intrs, ttime);
791 for (j = 0, fon = 1, nttime = ttime; j < item->repcount;
906 * (defined by union pu pol). Set the repcount field of each entry to a
912 elem->repcount = i, i++, elem++) {
918 (!(pol & MULTIPOLICY) || elem->repcount == 1) &&
925 elem->size *= elem->repcount;
952 * Reuse the repcount field to store the no. of duplicate accesses.
957 for (i = 1, cnt = 1, elem = items, elem->repcount = 1, item = elem + 1;
961 elem->repcount++;
963 elem->access_time = logtime / elem->repcount;
967 elem->repcount = 1;
970 elem->access_time = logtime / elem->repcount;
988 for (j = i + 1, acnt = items[i].repcount; j < cnt &&
990 acnt += items[j].repcount;
997 mina = items[i].repcount;
998 maxa = items[j-1].repcount;
1005 if (items[ub].repcount > cutoff[0])
1016 if (items[lb].repcount < cutoff[1])
1202 acc_cnt = items[i].repcount;
1206 acc_cnt += items[j].repcount;
1211 acc_cnt, items[i].repcount, items[j-1].repcount,