Re: [Algorithms] Complexity of new hardware
Brought to you by:
vexxed72
|
From: Mike S. <mik...@gm...> - 2009-04-18 15:18:24
|
On Sat, Apr 18, 2009 at 10:27 AM, Jon Watte <jw...@gm...> wrote: > Yes; the only thing that is annoying is the repeating-yourself problem. > I find I usually need to repeat myself one and a half time. > First, it's the declaration. > Then, it's the repeat of the declaration, in macro form. > Finally, it's some small bits of macro that builds the > helpers/visitors/registration needed to make it all "go." With a full C++ parser available, you could generate a lot of that from just the declaration, right? https://developer.mozilla.org/en/Dehydra Requires a GCC plugin, so the code you want to scan has to be compilable by GCC, but that's not a very large burden considering the benefits you get. We use Dehydra analyses to ensure that certain classes are only ever allocated on the stack, and to ensure that certain transitive invariants hold (like locks-not-held, etc.) with simple annotations in the source code. Mike |