tree is a list :P
* anyway, some changes here
-> a struct T consumes sizeof(struct T) of memory
-> actual wasn't really needed here. thrown away.
committer: Markus Bröker <mbroeker@largo.homelinux.org>
/**
* test/demos/tokenpasting.c
* Copyright (C) 2008 Markus Broeker
*/
#include <stdio.h>
#include <stdlib.h>
#define a(a,b) { tsb.fd##a = b; }
struct {
int fd1;
int fd2;
int fd3;
} tsb;
int main (int argc, char **argv)
{
a (1, 10);
a (2, 20);
a (3, 30);
printf ("1=[%d] 2=[%d] 3=[%d]\n", tsb.fd1, tsb.fd2, tsb.fd3);
return EXIT_SUCCESS;
}