Post

Jordan Isaacs
@snowytrees.dev

Also this don’t work for runtime locks. E.g Map<string, Lock<value>>. I came up with the “OrderedLock”. You specify it logically at compile time to fit into the DAG. At runtime each lock has an ordered key. Then it asserts ordered acquisition - which fits within compile time enforced ordering

Carl Sverre
@f0a.org

Seems like surelock should handle runtime locks? Or do you mean the lock-ordering crate? I think @expede.wtf wasn't trying to list all prior art, just the ones that influenced the design.

Jordan Isaacs
@snowytrees.dev

The LockSet idea is really cool, but misses out on some flexibility. My understanding is you pre-declare the locks you need (LockSet does ordering internally). But it’s common to not know what locks you need upfront. For this the application needs to be in control of ordering.

useful.storeuseful.store
Carl Sverre
@f0a.org

Looks like lock_tree, which was listed as prior art, was also based on the Fuchsia lock-ordering design. Hence, it seems lock-ordering (indirectly) was declared as prior art after all :)