User blog:Redspah/My attempt at big numbers, Bignum Bakeoff style

Warning: Preprocessor abuse ahead.

Googols and other numbers, let me present to you ​​red.c! p o{w n--){m*=m;}l m;} t o{l n?a(m,p(m,n-1)):a o;} a o{l m?n?a(m-1,a(m,n-1)):a(m-1,1):n+1;} d o{l n?t(a o,t(d(m,n-1),a o)):t(a o,t o);} e o{if(m+n){int r=n*d(m,d o),z=r;w r--){z*=d(e(z-1,e(z-1,z-1)),e(z-1,e(z-1,z-1)));}l z; }l 9;} q(f44,e) v(g,f) v(h,g) v(i,h) v(j,i) v(k,j) v(l,k) v(m,l) v(n,m) v(o,n) v(p,o) v(r,p) v(s,r) v(t,s) v(u,t) v(v,u) main o{l v44(99,99);} ...and I have no clue whatsoever how big the result is.
 * 1) define o (m,n)
 * 1) define l return
 * 1) define w while(
 * 1) define q(x,n) x o{l n ( n o, n o); }
 * 1) define u(x,n) q(x##1,n##4) q(x##2,x##1) q(x##3,x##2) q(x##4,x##3)
 * 1) define v(x,n) u(x##1,n##4) u(x##2,x##1) u(x##3,x##2) u(x##4,x##3)
 * Exactly 512 non-whitespace characters!
 * Generates almost a thousand warnings with gcc!
 * (Hopefully) Is computable without any infinite loops!
 * Defines almost 250 functions!