🚀 go-pugleaf

How does MIPS TLB load deal with used/modified bits? I assume that
part of the path always executed determines that the bits are in the
correct state. i.e. some of the instructions included in your count
are for is-used-set?, is-this-a-write-well-then-is-modified-set?.

Assuming that these are coded with branch-not-taken being common
(used/modified already has correct value), a multiprocessor still has
to do some kind of exclusivity locking when it diddles the bits.
Got any multi implementation or plans you can talk about? e.g.
how long would THAT sequence be?

Can you describe any special hardware characteristics of the TLB in
greater detail (or is it published)? How about the way you use the TLB
in your UN*X implementation.



-----
disclaimer: generic disclaimer *

* - have you seen advertisements with '*'s, and no footnote?
It's the same with this disclaimer...