2009/09/15 Linux Kernel Podcast
Audio: http://media.libsyn.com/media/jcm/linux_kernel_podcast_20090915.mp3
NOTE: We’re 10 days behind, but you’ll notice we’re moving several days forward at a time, and so should be up to date early next week. Patience really is a virtue! (you’re welcome to volunteer to help me out!). I will record and upload the missing audio versions on my day off on Monday, as I prepare to return from the Linux Plumbers Conference.
For Tuesday, September 15th, 2009, I’m Jon Masters with a summary of today’s LKML traffic.
In today’s issue: Mudflap, POSIX O_SYNC vs. O_DSYNC, and speeding up kernel compiles.
Mudflap. Janboe Ye posted version 3 of the “mudflap” patch series. This is a patch series intended to catch use-after-free type situations (in previously SLAB allocated memory regions) by taking advantage of the gcc “mudflap” code generation feature to catch certain kinds of memory access (using hardware breakpoints, and other underlying hardware features) and verify that they are not attempting to access data that has previously been explicitly freed. The latest version includes further efforts at architecture independence following previous comments from Pekka J. Enberg on the previous iterations.
POSIX O_SYNC and O_DSYNC semantics. Christoph Hellwig posted the latest iteration of a patch series implementing full O_SYNC support (as opposed to the existing behavior within the kernel in which O_SYNC requests are actually implemented in the form of O_DSYNC semantics). This patch series relies upon previous work done by Jan Kara and has been discussed several times before.
Speeding up kernel compiles. Ozan Caglayan posted a question concerning prefered methods for speeding up kernel compiles. He suggested various methods that one might use (building inside a – RAM-backed – tmpfs, using ccache, switching to a performance power management governor, passing -j to gcc, and so forth), but wonders out loud what others are doing. Specifically, Ozan would love to know if others are really using icecream or distcc for their daily test builds.
In today’s pull requests: some security and credential fixes (including various KEYS fixes from David Howells) from James Morris, some percpu fixes for 2.6.32 from Tejun Heo (including sparse conguent allocation in the kernel’s vmalloc area, and a note that all arches other than IA64 are now using the new percpu data allocator introduced previously), some IDE fixes from David Miller, some UWB fixes from David Vrabel, an official request to merge the new DRBD distributed replicated block device patches from Philipp Reisner, round 1 of some hwmon updates for 2.6.32 from Jean Delvare, some tracing fixes from Steven Rostedt, a large number of staging patches from Greg Kroah-Hartman (who recently posted over 700 patches to his list), some SLAB fixes from Pekka J. Enberg, some
In today’s miscellaneous items: some ftrace documentation updates from Mike Frysinger (Steven Rostedt also posted some documentation updates), the addition of histograms showing potential and effective wakeup latencies (especially in the preempt-rt kernel tree) from Carsten Emde, some further /proc/kmem cleanups (and some HWPOISON bits also) from Fengguang Wu, version 2 of the previously covered cpuidle menu governor performance optimization patches from Arjan van de Ven, a patch enhancing support for catching unsupported relocations when using CONFIG_RELOCATABLE on PowerPC 64-bit systems from Ben Herrenschmidt, a trivial performance counters fix (for a buffer overflow in perf_copy_attr) from Xizo Guangrong, a patch adding further use of unreachable() to the MIPS architecture from Ralf Baechle, a tracing patch to set_pid_ftrace from Jiri Olsa adding the ability for ftrace to simultaneously trace multiple independent processes, some ftrace and systemtap integration patches from Atsushi Tsuji, version 3 of a patch series implementing support for choosing which power state a POWER (pseries) CPU will enter when going offline (affording greater flexibility in allowing a CPU to remain assigned to a particular LPAR or be returned to the pool), version 3 of the post-merge per-bdi writeback patches from Jens Axboe (to which Nick Piggin followed up with a 5 part patch series of fixes), and the latest iteration of an RFC patch series from Corrado Zoccolo implementing scalable CFQ IO slice sizing proportional to the number of processes performing IO operations.
In today’s announcements: Linux 2.6.27.34 and Linux 2.6.30.7. Greg Kroah-Hartman announced the latest round of stable kernel releases – 2.6.27.34 and 2.6.30.7 – and encouraged existing users of these kernels to upgrade. He has also recent begun contributing to an LWN column entitled “ask a kernel hacker” in which he talks about the process for stable kernel releases.
2.6.31-rt10. Thomas Gleixner announced version 2.6.31-rt10 of the preempt-rt Real Time patches. The latest version updates to 2.6.31, includes timekeeping and locking fixes, a KVM fix, tracing, performance counters fixes, and more. There are several known issues, including a scheduler load balancing problem that Peter Zijlstra has been looking at for a while. Thomas later followed up to note that, as mentioned elsewhere, latency histograms are back!
The latest kernel release was 2.6.31.
Andrew Morton posted some 2.6.32 merge plans for -mm, noting that there are an unusual amount of actual memory management patches in the tree.
Chuck Ebbert reported a regression in 2.6.30. In this kernel (and presumably also in more recent kernels, including the recently released 2.6.31) binfmt_misc is taking precedence over binfmt_script as a binary format handler when a miscellaneous handler (and pattern) are defined that should otherwise be caught and handled by the generic script handler.
Ingo Molnar reported that the previous regression involving SLAB corruption was more repeatable than once in 1000 reboots. It turns out that he had another machine that managed to fall over, also in bdi_alloc_work, during an overnight test run. Ingo goes through a process of elimination (non-SMP, different distros, different hardware, etc.) and concludes that this is a BDI bug, although he doesn’t have much else other than logs to go on.
Tobias Oetiker draws attention to “unfair IO behavior” for high load interactive use in kernel 2.6.31. He points out that his use case is different from similar reports, since he has a busy NFS server with a lot of processes accessing many small and medium sized files for reading and writing (as opposed to the case of, for example, several concurrent dd processes performing read and write operations). Tobias notes that iostat reports “huge” wMB/s and “ridiculously low” rMB/s.
Stephen Rothwell posted a linux-next tree for September 15th. Since Monday the sh, rr, and drbd trees gained issues, while the net, input, block, slab, and block trees lost their issues. The total sub-tree count remains steady at 140 trees in the latest linux-next compose.
Stephen repeated previous warnings that code intended to be merged into 2.6.32 should not be pushed for linux-next inclusion until after 2.6.32-rc1 has been released. He also noted that conflicts continue to bounce between trees as Linus continues to perform various merging activity.
That’s a summary of today’s Linux Kernel Mailing List traffic, for further information visit www.kernel.org. I’m Jon Masters.

