2 ms·
Although you're right about it being relatively the most complex, it's absolutely a very simple algorithm. noatime: if false: update() atime: if tru
by tomp 12y ago
Although you're right about it being relatively the most complex, it's absolutely a very simple algorithm.
noatime:
if false:
update()
atime:
if true:
update()
relatime:
if a > b:
update()
Doesn't seem very complex to me.
- bjourne 12y agoI believe the original check was if mtime was greater than or equal to atime. The current Linux implementation isn't that simple though, see: http://lwn.net/Articles/244829/ http://lwn.net/Articles/244829/. If you allow some extra complexity, it's easy to then allow some more, and then some more..