Blog

Use page_owner to identify allocation call paths retaining pages at equivalent workload checkpoints, then investigate the ownership contract behind the growing path. The largest allocation stack is not automatically a leak. Growth can reflect a bounded cache, an unfinished operation, or a genuine missing release; the experiment must distinguish them. This procedure uses upstream Linux…

Translate an ODEBUG warning into the attempted operation and the object’s recorded lifecycle state. Then find the code path that allowed those two to disagree. Reinitializing an active timer, freeing a container with live work, and using an object after destruction are different failures even when all eventually crash in a callback. The baseline is…

Enable only the SLUB checks needed for a verified suspect cache, then interpret the corruption marker together with allocation and free history. A stack printed when an object is checked usually identifies where corruption was discovered. It may be far from the instruction that originally wrote the bad byte. The baseline is upstream Linux v6.12…

Read the UBSAN check category, source location and operand conditions before treating a kernel warning as evidence of defective hardware. The report says that an instrumented operation violated a condition checked by that build. The next step is to reconstruct the operation’s types and inputs, then test the boundary that should have rejected or safely…

A kmemleak entry identifies an allocation that the scanner could not reach through the references it recognizes; it is a leak suspect, not an instruction to free the printed address. Investigate the allocation’s owner and complete cleanup boundary, then repeat a controlled operation to see which suspects persist or accumulate. Total free memory alone cannot…

Treat a KCSAN report as evidence about conflicting accesses, then write down the ownership or ordering rule those accesses were supposed to obey. The first useful question is not which line should receive an annotation. It is whether the reader may overlap the writer, what state each expects, and which synchronization makes those expectations valid….

Reconstruct the reported lock-class cycle before changing a lock or increasing a timeout. A circular-dependency warning describes acquisition orders that can combine into a deadlock. It need not mean the system reached that deadlock during the observed run. The useful result is a graph whose every edge has a source path, execution context and reproduction…