[RFC PATCH 0/2] landlock: Refactor layer masks

Günther Noack gnoack3000 at gmail.com
Tue Dec 30 10:39:17 UTC 2025


Hello!

This patch set "transposes" the layer masks matrix, which was
previously modeled as a access-max-sized array of layer masks, and
changes it to be a layer-max-sized array of access masks instead.
(It is a pure refactoring, there are no user-visible changes.)

This unlocks a few code simplifications and in multiple places it
removes the need for loops and branches that deal with individual
bits.  Instead, the changed data structure now lends itself for more
bitwise operations.  The underlying hypothesis for me was that by
using more bitwise operations and fewer branches, we would get an
overall speedup even when the data structure size increases slightly
in some cases.

Tentative results with and without this patch set show that the
hypothesis likely holds true.  The benchmark I used exercises a "worst
case" scenario that attempts to be bottlenecked on the affected code:
constructs a large number of nested directories, with one "path
beneath" rule each and then tries to open the innermost directory many
times.  The benchmark is intentionally unrealistic to amplify the
amount of time used for the path walk logic and forces Landlock to
walk the full path (eventually failing the open syscall).  (I'll send
the benchmark program in a reply to this mail for full transparency.)

Measured with the benchmark program, the patch set results in a
speedup of -8.3%.  The benchmark results are only tentative and have
been produced in Qemu:

With the patch, the benchmark runs in 5932 clocks (measured with
times(3)):

*** Benchmark ***
10000 dirs, 100000 iterations, with landlock
*** Benchmark concluded ***
System: 5932 clocks
User  : 1 clocks
Clocks per second: 1000000

Without the patch, we get 6472 clocks, which is 9.1% more.

*** Benchmark ***
10000 dirs, 100000 iterations, with landlock
*** Benchmark concluded ***
System: 6472 clocks
User  : 1 clocks
Clocks per second: 1000000

The base revision used for benchmarking was commit 7a51784da76d
("tools/sched_ext: update scx_show_state.py for scx_aborting change")

In real-life scenarios, the speed improvement from this patch set will
be less pronounced than in the artificial benchmark, as people do not
usually stack directories that deeply and attach so many rules to
them, and the EACCES error should also be the exception rather than
the norm.

I am looking forward to your feedback.

P.S.: I am open to suggestions on what the "layer masks" variables
should be called, because the name "layer masks" might be less
appropriate after this change.  I have not fixed up the name
everywhere because fixing up the code took priority for now.

Günther Noack (2):
  landlock: access_mask_subset() helper
  landlock: transpose the layer masks data structure

 security/landlock/access.h  |  10 +-
 security/landlock/audit.c   | 155 ++++++----------
 security/landlock/audit.h   |   3 +-
 security/landlock/domain.c  | 120 +++---------
 security/landlock/domain.h  |   6 +-
 security/landlock/fs.c      | 361 +++++++++++++++++-------------------
 security/landlock/net.c     |  10 +-
 security/landlock/ruleset.c |  78 ++------
 security/landlock/ruleset.h |  18 +-
 9 files changed, 300 insertions(+), 461 deletions(-)

-- 
2.52.0




More information about the Linux-security-module-archive mailing list