Searched refs:CacheEntries (Results 1 – 6 of 6) sorted by relevance
32 for (unsigned i = 0; i != CacheEntries; ++i) in init()38 if (E < CacheEntries && Entries[E].getPhysReg() == PhysReg) { in get()45 if (++RoundRobin == CacheEntries) in get()47 for (unsigned i = 0; i != CacheEntries; ++i) { in get()50 if (++E == CacheEntries) in get()
111 enum { CacheEntries = 32 }; enumerator121 Entry Entries[CacheEntries];135 unsigned getMaxCursors() const { return CacheEntries; } in getMaxCursors()
64 for (unsigned i = 0; i != CacheEntries; ++i) in init()70 if (E < CacheEntries && Entries[E].getPhysReg() == PhysReg) { in get()77 if (++RoundRobin == CacheEntries) in get()79 for (unsigned i = 0; i != CacheEntries; ++i) { in get()82 if (++E == CacheEntries) in get()
140 enum { CacheEntries = 32 }; enumerator155 Entry Entries[CacheEntries];178 unsigned getMaxCursors() const { return CacheEntries; } in getMaxCursors()
52 for (unsigned i = 0; i != CacheEntries; ++i) in init()58 if (E < CacheEntries && Entries[E].getPhysReg() == PhysReg) { in get()65 if (++RoundRobin == CacheEntries) in get()67 for (unsigned i = 0; i != CacheEntries; ++i) { in get()70 if (++E == CacheEntries) in get()
135 enum { CacheEntries = 32 }; enumerator146 Entry Entries[CacheEntries];168 unsigned getMaxCursors() const { return CacheEntries; } in getMaxCursors()