Performance improvements in libffi
Summary
Anthony Green discusses optimizing libffi's function-call path by precomputing an argument-placement plan. The plan-based approach replaces per-call re-classification with an immutable bytecode, delivering significant speedups over ffi_call and approaching direct calls on supported shapes. The work is experimental and currently Linux/x86-64 only, with testing needed and caveats about ABI compatibility.