JFFS3 document / wiki [OT]

[Jörn Engel]

On Thu, 27 January 2005 17:38:45 +0100, Jörn Engel wrote:
> 
> Various bits of information on this were spread all over the place:
> o Code examples of mysql - tons of buffer overflows.
> o Code examples of php - same.

Didn't find a video, but here are some slides:
http://www.ccc.de/congress/2004/fahrplan/files/363-literarisches-code-quartett-slides.pdf

Jörn

-- 
Fancy algorithms are slow when n is small, and n is usually small.
Fancy algorithms have big constants. Until you know that n is
frequently going to be big, don't get fancy.
-- Rob Pike