EMILUA(3em)

💻 EMILUA 💻

Hey bestie, welcome to the emilua reference page for section 3em — it’s giving Lua execution engine energy, and we’re about to get into it. 🦋✨

🌸 NAME 🌸

Emilua — Lua execution engine. That’s the whole name vibe. 💖

🎀 DESCRIPTION 🎀

Okay so picture a recursive mutex — yes, that’s the thing. A fiber that already has exclusive ownership of a given recursive_mutex instance can call lock() or try_lock() to acquire an additional level of ownership of the mutex. And because recursion is a lil greedy, unlock() must be called once for each level of ownership acquired by a single fiber before ownership can be acquired by another fiber. That’s the rule, bestie. 💅

🛠️ FUNCTIONS 🛠️

🌱 new() → recursive_mutex

new() → recursive_mutex

Constructor. It makes the recursive_mutex, periodt. 🎀

🔒 lock(self)

lock(self)

Locks the mutex.

⚠️ Note: This suspending function does not act as a cancellation point.

🌀 Note: This mutex applies dispatch semantics. That means no context switch to other ready fibers will take place if it’s possible to acquire the mutex immediately.

🎲 try_lock(self) → boolean

try_lock(self) → boolean

Tries to lock the mutex. Returns whether lock acquisition was successful. 👑

💤 Note: The current fiber is never suspended.

🔓 unlock(self)

unlock(self)

Unlocks the mutex.

---

💖 That’s the EMILUA(3em) page, bestie — sign-off brought to you by Emilua 0.12.1-nixpkgs1, dated 1980-01-01. Stay iconic. 💅✨