Lines Matching refs:sno
441 static inline TTEntry* index_tte ( UInt sNo, UInt tteNo )
443 vg_assert(sNo < n_sectors);
445 Sector* s = §ors[sNo];
679 Int sno = sector_search_order[i];
680 if (UNLIKELY(sno == -1))
683 Sector* sec = §ors[sno];
713 *from_sNo = sno;
727 Int i, sno;
729 sno = sector_search_order[i];
730 if (sno == -1)
732 if ((UChar*)hcode >= (UChar*)sectors[sno].tc
733 && (UChar*)hcode <= (UChar*)sectors[sno].tc_next
1254 Int sno;
1257 for (sno = 0; sno < n_sectors; sno++) {
1261 sec = §ors[sno];
1350 static void initialiseSector ( Int sno )
1355 vg_assert(isValidSector(sno));
1360 sec = §ors[sno];
1376 VG_(debugLog)(1,"transtab", "allocate sector %d\n", sno);
1378 VG_(dmsg)("transtab: " "allocate sector %d\n", sno);
1414 sector_search_order[i] = sno;
1417 VG_(message)(Vg_DebugMsg, "TT/TC: initialise sector %d\n", sno);
1422 VG_(debugLog)(1,"transtab", "recycle sector %d\n", sno);
1424 VG_(dmsg)("transtab: " "recycle sector %d\n", sno);
1435 sno);
1447 unchain_in_preparation_for_deletion(vex_arch, sno, i);
1455 sno);
1479 if (sector_search_order[i] == sno)
1485 VG_(message)(Vg_DebugMsg, "TT/TC: recycle sector %d\n", sno);
1677 Int i, j, k, kstart, sno;
1691 sno = sector_search_order[i];
1692 if (UNLIKELY(sno == -1))
1698 if (sectors[sno].tt[k].status == InUse
1699 && sectors[sno].tt[k].entry == guest_addr) {
1703 guest_addr, sectors[sno].tt[k].tcptr );
1705 *res_hcode = (AddrH)sectors[sno].tt[k].tcptr;
1707 *res_sNo = sno;
1720 if (sectors[sno].tt[k].status == Empty)
1892 Int sno, ec;
1947 for (sno = 0; sno < n_sectors; sno++) {
1948 sec = §ors[sno];
1952 sec, sno, guest_start, range, ec,
1956 sec, sno, guest_start, range, ECLASS_MISC,
1968 for (sno = 0; sno < n_sectors; sno++) {
1969 sec = §ors[sno];
1973 sec, sno, guest_start, range, vex_arch );
1992 for (sno = 0; sno < n_sectors; sno++) {
1993 sec = §ors[sno];
2308 Int sno, i, r, s;
2321 for (sno = 0; sno < n_sectors; sno++) {
2322 if (sectors[sno].tc == NULL)
2325 if (sectors[sno].tt[i].status != InUse)
2327 score_total += score(§ors[sno].tt[i]);
2328 /* Find the rank for sectors[sno].tt[i]. */
2337 if ( score(§ors[sno].tt[i]) > tops[r].score ) {
2350 tops[r].addr = sectors[sno].tt[i].entry;
2351 tops[r].score = score( §ors[sno].tt[i] );
2359 for (sno = 0; sno < n_sectors; sno++) {
2360 if (sectors[sno].tc == NULL)
2363 if (sectors[sno].tt[i].status != InUse)
2365 sectors[sno].tt[i].count = 0;