The Impact of Generic Data Structures: Decoding the Role of Lists in the Linux Kernel
The increasing adoption of the Linux kernel has been sustained by a large and constant maintenance effort, performed by a wide and heterogeneous base of contributors. One important problem that maintainers face in any code base is the rapid understanding of complex data structures. The Linux kernel is written in the C language, which enables the definition of arbitrarily uninformative datatype, via the use of casts and pointer arithmetic, of which doubly linked lists are a prominent example. In this paper, we explore the advantages and disadvantages of such lists, for expressivity, for code understanding, and for code reliability. Based on our observations, we have developed a toolset that includes inference of descriptive list types and a tool for list visualization. Our tools identify more than 10.000 list fields and variables in recent Linux kernel releases and succeeds in typing more than 90%. We show how these tools could have been used to detect previously fixed bugs and identify 6 new ones.
Tue 22 Sep Times are displayed in time zone: (UTC) Coordinated Universal Time change
|08:00 - 08:20|
Bruce CollieUniversity of Edinburgh, Philip GinsbachGitHub Software UK, Jackson WoodruffUniversity of Edinburgh, Ajitha RajanUniversity of Edinburgh, Michael F. P. O'BoyleUniversity of EdinburghPre-print Media Attached
|08:20 - 08:40|
|08:40 - 09:00|
Carlos Gavidia-CalderonUniversity College London, Federica SarroUniversity College London, UK, Mark HarmanUniversity College London, UK, Earl T. BarrUniversity College London, UKLink to publication DOI Pre-print Media Attached