I just managed to get through an ordinary make of a real program (zenity, which for some reason is my standard test) using gcc as a server. Yay! It is, as predicted, about twice as fast as an ordinary make.
Now pile on the caveats.
I just managed to get through an ordinary make of a real program (zenity, which for some reason is my standard test) using gcc as a server. Yay! It is, as predicted, about twice as fast as an ordinary make.
Now pile on the caveats.
3 Comments
Does that then make it twice as fast as itself? 😛
Hey Tromey boy, did you get my mail with the music?
Congratulations on getting the server working! I just read your interview with Anthony Green, which pointed me here. I realized another item that the server indexer could provide: similar functions. Since you use checksums, it doen’t quite fit, but here we have a mess of code (literally, it’s a mess) that has a minimum of six, yes SIX separate implementations of a crc32 checksum! I’m sure there are others, perhaps even more ridiculous. If we had a way of mechanically producing a list of all functions that are similar, we could eliminate so much cruft! That’s a pipe dream, right now. Still I’m very encouraged by your project. I look forward to it being reality some day! Thanks!