On Wed, 2009-04-15 at 17:31 -0400, Michael Scheidell wrote:
> > Is there a method of speeding this beast up? I can build four entire
> > kernels and their modules from scratch in the same time it takes this
> > thing to compile (45mins) is it really worth using this method?
> > Last time I tried without it, I noticed next to no difference, opinions?
>
> Same here, sought rules take an extra 30mins (normally is 2mins)
Wonder why that is -- due to the excessively long metas? The sub-rules'
REs are quite trivial.
Would constructing it using a binary (or n-ary, with small upper bound
of n) tree speed the compilation up?
--
char *t="\10pse\0r\0dtu...@ghno\x4e\xc8\x79\xf4\xab\x51\x8a\x10\xf4\xf4\xc4";
main(){ char h,m=h=*t++,*x=t+2*h,c,i,l=*x,s=0; for (i=0;i<l;i++){ i%8? c<<=1:
(c=*++x); c&128 && (s+=h); if (!(h>>=1)||!t[s+h]){ putchar(t[s]);h=m;s=0; }}}
