Hi, I have been play with sparse to add more Stanford checker style of checking. The paper is "Checking System Rules Using System- Specific, Programmer-Written Compiler Extensions" by Dawson Engler etc. Unlike the Stanford checker and smatch, this checker is working on the linearization level instead of AST level. Linearization code can be very convenient (when it works) to trace the data flow because pseudo is in SSA form. There is define/user chain to avoid scan every instruction. I write the demo of checking null pointer and irq checking. It is mostly an example. The checking seems very fast. It adds about 10 seconds to the whole make C=1 run. We might able to add it to stander sparse checking. The some of the patch I send it to the list before. I post it again to make it easy for the people who want to try it out. As always, comments and suggestions are welcome. Chris - To unsubscribe from this list: send the line "unsubscribe linux-sparse" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
