dev/arm/smmu_v3_caches.cc

174     Set set(associativity, e);
175     sets.resize(num_sets, set);
184     Set &set = sets[pickSetIdx(va)];
186     for (size_t i = 0; i < set.size(); i++) {
187         const Entry &e = set[i];
218         Set &set = sets[s];
220         for (size_t i = 0; i < set.size(); i++) {
221             const Entry &e = set[i];
253         Set &set = sets[pickSetIdx(incoming.va)];
254         set[pickEntryIdxToReplace(set, alloc)] = incoming;
263     Set &set = sets[pickSetIdx(sid, ssid)];
265     for (size_t i = 0; i < set.size(); i++) {
266         Entry &e = set[i];
277         Set &set = sets[s];
279         for (size_t i = 0; i < set.size(); i++) {
280             Entry &e = set[i];
291     Set &set = sets[pickSetIdx(va)];
293     for (size_t i = 0; i < set.size(); i++) {
294         Entry &e = set[i];
307     Set &set = sets[pickSetIdx(va)];
309     for (size_t i = 0; i < set.size(); i++) {
310         Entry &e = set[i];
321         Set &set = sets[s];
323         for (size_t i = 0; i < set.size(); i++) {
324             Entry &e = set[i];
336         Set &set = sets[s];
338         for (size_t i = 0; i < set.size(); i++) {
339             Entry &e = set[i];
351         Set &set = sets[s];
353         for (size_t i = 0; i < set.size(); i++)
354             set[i].valid = false;
371 SMMUTLB::pickEntryIdxToReplace(const Set &set, AllocPolicy alloc)
380             set.size()-1 : set.size();
383         if (!set[i].valid) {
388         if (set[i].lastUsed < lru_tick) {
390             lru_tick = set[i].lastUsed;
454     Set set(associativity, e);
455     sets.resize(num_sets, set);
463     Set &set = sets[pickSetIdx(va, asid, vmid)];
465     for (size_t i = 0; i < set.size(); i++) {
466         const Entry &e = set[i];
505         Set &set = sets[pickSetIdx(incoming.va, incoming.asid, incoming.vmid)];
506         set[pickEntryIdxToReplace(set)] = incoming;
515     Set &set = sets[pickSetIdx(va, asid, vmid)];
517     for (size_t i = 0; i < set.size(); i++) {
518         Entry &e = set[i];
532         Set &set = sets[s];
534         for (size_t i = 0; i < set.size(); i++) {
535             Entry &e = set[i];
547         Set &set = sets[s];
549         for (size_t i = 0; i < set.size(); i++) {
550             Entry &e = set[i];
562         Set &set = sets[s];
564         for (size_t i = 0; i < set.size(); i++) {
565             Entry &e = set[i];
577         Set &set = sets[s];
579         for (size_t i = 0; i < set.size(); i++)
580             set[i].valid = false;
591 ARMArchTLB::pickEntryIdxToReplace(const Set &set)
596     for (size_t i = 0; i < set.size(); i++) {
597         if (!set[i].valid) {
602         if (set[i].lastUsed < lru_tick) {
604             lru_tick = set[i].lastUsed;
653     Set set(associativity, e);
654     sets.resize(num_sets, set);
662     Set &set = sets[pickSetIdx(ipa, vmid)];
664     for (size_t i = 0; i < set.size(); i++) {
665         const Entry &e = set[i];
703         Set &set = sets[pickSetIdx(incoming.ipa, incoming.vmid)];
704         set[pickEntryIdxToReplace(set)] = incoming;
713     Set &set = sets[pickSetIdx(ipa, vmid)];
715     for (size_t i = 0; i < set.size(); i++) {
716         Entry &e = set[i];
727         Set &set = sets[s];
729         for (size_t i = 0; i < set.size(); i++) {
730             Entry &e = set[i];
742         Set &set = sets[s];
744         for (size_t i = 0; i < set.size(); i++) {
745             Entry &e = set[i];
757         Set &set = sets[s];
759         for (size_t i = 0; i < set.size(); i++)
760             set[i].valid = false;
771 IPACache::pickEntryIdxToReplace(const Set &set)
776     for (size_t i = 0; i < set.size(); i++) {
777         if (!set[i].valid) {
782         if (set[i].lastUsed < lru_tick) {
784             lru_tick = set[i].lastUsed;
833     Set set(associativity, e);
834     sets.resize(num_sets, set);
842     Set &set = sets[pickSetIdx(sid, ssid)];
844     for (size_t i = 0; i < set.size(); i++) {
845         const Entry &e = set[i];
882         Set &set = sets[pickSetIdx(incoming.sid, incoming.ssid)];
883         set[pickEntryIdxToReplace(set)] = incoming;
892     Set &set = sets[pickSetIdx(sid, ssid)];
894     for (size_t i = 0; i < set.size(); i++) {
895         Entry &e = set[i];
906         Set &set = sets[s];
908         for (size_t i = 0; i < set.size(); i++) {
909             Entry &e = set[i];
921         Set &set = sets[s];
923         for (size_t i = 0; i < set.size(); i++)
924             set[i].valid = false;
935 ConfigCache::pickEntryIdxToReplace(const Set &set)
940     for (size_t i = 0; i < set.size(); i++) {
941         if (!set[i].valid) {
946         if (set[i].lastUsed < lru_tick) {
948             lru_tick = set[i].lastUsed;
1009     Set set(associativity, e);
1010     sets.resize(num_sets, set);
1021     Set &set = sets[pickSetIdx(va, vaMask, stage, level)];
1023     for (size_t i = 0; i < set.size(); i++) {
1024         const Entry &e = set[i];
1074         Set &set = sets[pickSetIdx(incoming.va, incoming.vaMask,
1076         set[pickEntryIdxToReplace(set, incoming.stage, incoming.level)] =
1090         Set &set = sets[s];
1092         for (size_t i = 0; i < set.size(); i++) {
1093             Entry &e = set[i];
1108         Set &set = sets[s];
1110         for (size_t i = 0; i < set.size(); i++) {
1111             Entry &e = set[i];
1126         Set &set = sets[s];
1128         for (size_t i = 0; i < set.size(); i++) {
1129             Entry &e = set[i];
1141         Set &set = sets[s];
1143         for (size_t i = 0; i < set.size(); i++) {
1144             Entry &e = set[i];
1156         Set &set = sets[s];
1158         for (size_t i = 0; i < set.size(); i++)
1159             set[i].valid = false;
1192 WalkCache::pickEntryIdxToReplace(const Set &set,
1198     for (size_t i = 0; i < set.size(); i++) {
1199         if (!set[i].valid) {
1205         if (set[i].lastUsed < lru_tick) {
1207             lru_tick = set[i].lastUsed;