LockDoc is an approach to extract locking rules for kernel data structures from a dynamic execution trace recorded while the system is under a benchmark load. These locking rules can e.g. be used to locate synchronization bugs. For high rule precision and thorough bug finding, the approach heavily depends on the choice of benchmarks: They must trigger the execution of as much code as possible in the kernel subsystem relevant for the targeted data structures. However, existing test suites such as those provided by the Linux Test Project (LTP) only achieve -- in the case of LTP -- about 35 percent basic-block coverage for the VFS subsystem, which is the relevant subsystem when extracting locking rules for filesystem-related data structures. In this article, we discuss how to complement the LTP suites to improve the code coverage for our LockDoc scenario. We repurpose syzkaller -- a coverage-guided fuzzer with the goal to validate the robustness of kernel APIs -- to 1) not aim for kernel crashes, and to 2) maximize code coverage for a specific kernel subsystem. Thereby, we generate new benchmark programs that can be run in addition to the LTP, and increase VFS basic-block coverage by 26.1 percent.
翻译:LockDoc 是一种从系统处于基准负荷下时所记录的动态执行轨迹中提取内核数据结构锁定规则的方法。 这些锁定规则可以用于定位同步错误。 对于高规则精度和彻底的错误发现, 方法在很大程度上取决于基准的选择: 它们必须触发与目标数据结构相关的内核子系统中尽可能多的代码。 然而, Linux 测试项目(LTP)提供的那些现有测试套件,如Linux 测试项目提供的套件,只能达到 -- -- 就LTP而言 -- -- VFS 子系统在为文件系统相关数据结构提取锁定规则时,是相关的子系统。 在文章中,我们讨论如何补充 LTP 套件,以改进我们锁定Doc 情景的代码覆盖。 我们重新使用 syzkaller -- -- 覆盖制导的模糊器,目的是验证内核崩溃的坚固性 -- -- 至1个不是针对内核碰撞的,而2个是特定内核子子子系统的最大代码覆盖。 因此, 我们用新的FS IP1 来设定新的 L 基底基程序。