Lines Matching refs:entry
54 PersistentTableEntry &entry = i->second;
58 assert(!(entry.m_starving.isElement(locker)));
61 entry.m_starving.add(locker);
63 entry.m_request_to_write.add(locker);
66 assert(entry.m_marked.isSubset(entry.m_starving));
75 PersistentTableEntry& entry = m_map[address];
80 assert(entry.m_starving.isElement(unlocker));
81 assert(entry.m_marked.isSubset(entry.m_starving));
82 entry.m_starving.remove(unlocker);
83 entry.m_marked.remove(unlocker);
84 entry.m_request_to_write.remove(unlocker);
85 assert(entry.m_marked.isSubset(entry.m_starving));
88 if (entry.m_starving.isEmpty()) {
89 assert(entry.m_marked.isEmpty());
102 // No entry present
106 const PersistentTableEntry &entry = i->second;
108 if (entry.m_starving.isElement(machId)) {
114 return entry.m_marked.isEmpty();
123 const PersistentTableEntry& entry = i->second;
124 return entry.m_starving.smallestElement();
133 const PersistentTableEntry& entry = i->second;
134 if (entry.m_request_to_write.
135 isElement(entry.m_starving.smallestElement())) {
150 PersistentTableEntry& entry = i->second;
153 assert(entry.m_marked.isEmpty());
156 entry.m_marked = entry.m_starving;
164 // If an entry is present, it must be locked
176 const PersistentTableEntry& entry = i->second;
177 return entry.m_starving.count();
188 const PersistentTableEntry& entry = i->second;
189 return entry.m_starving.count() - entry.m_request_to_write.count();