Kernel gains in-tree agent skill for correct Fixes tags
Sasha Levin proposes a portable find-fixes procedure after maintainers flagged widespread wrong attribution in stable backports.
By kexecSasha Levin proposes a portable find-fixes procedure after maintainers flagged widespread wrong attribution in stable backports.
By kexecChristian Brauner patches ext4, ntfs3, tracefs, casefold, and related code so superblock data outlives concurrent RCU lookups after lazy unmount.
By oopsThe architecture was one of the last without the BPF sandboxing Docker, systemd, and Flatpak rely on.
By kexecKernel support for compiler-emitted cleanup tables would let bpf_unwind() run Drop-style release instead of discarding frames.
By oopsGary Guo’s series lets pinned Rust structs borrow between fields without allocation, landing advanced variance tools under a tight-use agreement.
By kexecPavel Begunkov's eighth revision lets apps register a DMA-buf against a file and issue fixed reads and writes, with early IOMMU benchmarks climbing into multi-million IOPS.
By renderKernel maintainers and Emacs developers are drawing the same line at once: undisclosed LLM help is not a process detail, it is a trust and philosophy problem.
By kexecJosef Bacik's net-next work replaces 17 hard panics in packet buffer code with WARN_ON_ONCE and existing error returns, after dozens of real-world crashes including some reachable from user namespaces.
By kexecA 20-patch series aims to close a decade-plus gap between the out-of-tree module and the single-peer code still shipped in-tree.
By kexecXin Long’s v16 series adds sockets, streams, paths, crypto, and congestion control so kernel services and user space can speak QUIC without a userspace transport.
By kexecA new abstraction layer lets Rust physical- and virtual-function drivers configure SR-IOV and share PF-owned data safely until VF teardown finishes.
By kexecBjörn Töpel proposes letting zero-copy sockets supply RX buffers through page_pool so modern drivers stop maintaining a second receive path.
By oopsAn eighth revision adds a per-connector property with compositor support already landing, while maintainers still contest naming, sysfs takeover, and DPMS coupling.
By renderJim Cromie's three-patch series cuts bulk symbol attach from hundreds of milliseconds to tens, after production stalls in fleet observability tools.
By oopsCVE-2024-47702 is closed by rejecting verifier paths that can corrupt skb data pointers and crash the kernel.
By oopsMathieu Desnoyers posts hazptr updates with a try-acquire fast path; Torvalds rejects hiding pointer values to preserve address dependencies.
By kexecA nested push from kretprobe NMI context could publish past an unfinished entry, letting another CPU pop a NULL or stale pointer.
By oopsMaxime Ripard’s generic DRM bridge would load panel init sequences from userspace, echoing HID-BPF, but reviewers flag early-boot and upstream risks.
By kexecA second KVM module would share arm64 code and drive the Start Arm Execution instruction so s390 hosts can accelerate ARM virtual machines.
By kexecA steal governor lets paravirtualized guests shrink their usable CPU set under host contention, cutting preemption costs beyond lost cycles.
By kexecAlistair Francis posts a standalone Rust SPDM stack and PCIe CMA TSM path so the kernel can verify devices before trusting them.
By oopsEduard Zingerman proposes algebraic loop analysis so induction variables can be treated as ranges instead of enumerated values.
By kexecKernel and libbpf support for compiler-emitted cleanup tables lets bpf_unwind() release locks and Drop-owned state instead of discarding frames.
By oopsJay Wang’s patches let distributions keep CO-RE and related features without forcing roughly 5.4 MB of type data into every system’s RAM from boot.
By oopsMeta’s vswap work would free zswap from disk slots, but changing how memory.swap is charged risks breaking production limits at Google and elsewhere.
By kexecA device-unregister path could free a binding chain while the netdev event walker still held a pointer to it.
By kexecA patch series for bpf-next would give JITed programs on x86-64 and arm64 four times the stack while keeping verifier memory in check.
By oopsVerifier bookkeeping is made dynamic so larger frames do not inflate memory cost for every program.
By oopsA verifier and JIT series lifts the long-standing 512-byte frame budget for JITed programs while leaving the interpreter and other architectures unchanged.
By kexecAlexei Starovoitov’s series stops the verifier from walking every iteration of simple loops, cutting work sharply while keeping today’s accepted programs valid.
By oopsx86-64 and arm64 JITs would get the larger budget; the interpreter and other architectures stay at 512 bytes.
By kexecA fourteenth revision unifies fault handling with device-page migration, but automated review flagged livelocks, notifier imbalances, and missing TLB flushes.
By renderA patch series converts remaining architectures so userspace page tables are always freed after an RCU grace period, unlocking lockless walks.
By oopsUnconfirmed entries could leave stale expectation pointers after extension realloc, reported against Open vSwitch and TC conntrack.
By oopsA proposed frame-owned reference type would stop helpers from handing programs pointers that outlive the call, after reports of stack exposure via ringbuf drain and array map iteration.
By oopsGoogle's v5 series preserves Intel VT-d and iommufd domain state so assigned devices can survive a kernel live update without dropping translations.
By oopsPasha Tatashin’s early OrphanVM proof of concept preserves physical CPUs so vCPUs keep executing while the host kernel is replaced.
By oopsHost and target support for Rapid Path Failure Recovery lets multipath NVMe fence a dead path before failover, avoiding double completion and data corruption.
By kexecYonghong Song's bpf-next series lets bpf_throw() run compiler-emitted landing pads so frames can release locks and owned objects on the way out.
By kexecIan Rogers's 49-patch series finishes moving perf analysis scripts onto a C extension module, cutting overhead and build complexity.
By kexecKairui Song’s cleanup series separates mixed folio-split logic so swap-cache restrictions can be lifted later.
By oopsA 15-patch net-next series enables NIC acceleration for TLS 1.3, including KeyUpdate, starting with Mellanox ConnectX-6 Dx and newer.
By oopsLorenzo Stoakes’s v3 patches claim up to 36% faster full allmodconfig builds, roughly 70% faster incrementals, and about 90% faster no-op rebuilds.
By oopsNVIDIA’s Manish Honap posts work that lets guests drive a virtual HDM decoder and device reset while the host keeps the physical mapping.
By kexecA C-based variant driver for nova-core draws a full Rust counter-proposal and VFIO maintainer pushback on long-term review capacity.
By kexecA kernel series lets Rust physical-function drivers publish lifetime-checked payloads that both Rust and C virtual-function drivers can borrow safely.
By oopsA third try at letting BPF apply userspace Landlock rulesets at exec hits the same wall: where kfuncs may live, and whether BPF should call into Landlock at all.
By oopsA malicious process could overwrite shared UMEM metadata between check and use, bypassing bounds validation.
By kexecMaintainers warn the design duplicates midlayer work and may struggle for UFS contributor adoption.
By kexecA verifier and JIT series lets global functions and kfuncs take small scalar aggregates without the old rejections and register miscounts.
By oopsInstead of always punting blockable ops to io-wq, the series runs them inline and migrates only the user-visible identity if the submitter sleeps.
By oopsCostly high-order folio attempts that already had smaller-order fallbacks were still paying for full direct compaction under fragmentation.
By oopsJosef Bacik proposes trampoline nesting so PREEMPT_LAZY kernels stop stalling BPF and kprobe teardown behind long-running kthreads.
By oopsA researcher says invariant-violation recovery can leave register linkage intact, risking a verifier bypass; maintainers want a normal patch and a reproducer.
By oopsAndrea Righi’s v13 series would end the build-time ban that forced kernels to pick one feature or the other.
By kexecIndirect-jump handling could stall loading for hours and, on a CFG mismatch, leave callee-saved registers under BPF control.
By kexecCgroup writeback cleanup can run for minutes without a Tasks-RCU quiescent state on lazy-preempt kernels, blocking ftrace and BPF unlinks until the hung-task detector fires.
By kexecA sleepable SYSCALL-only helper lets policy programs reclaim from chosen cgroups without writing memory.reclaim.
By kexecSeveral paths let programs pass verification then fault on a null dereference at runtime.
By kexecA core use-after-free in timeline-name handling still hits amdxdna, nouveau, and msm, and a proposed cache fix was pulled after lifetime objections.
By kexec