|
|
1.1 ! root 1: int r = 22; ! 2: int array[] = { 5, 4, 3, 2, 1}; ! 3: char s[] = "abcdefg"; ! 4: ! 5: ignore(){ ! 6: int i; ! 7: i++; ! 8: } ! 9: ! 10: main(argc, argv, envp) ! 11: char **argv, **envp; { ! 12: char *p; ! 13: p = s; ! 14: test(); ! 15: } ! 16: ! 17: test() { ! 18: int a,b,c; ! 19: a = 1; ! 20: b = 2; ! 21: c = 3; ! 22: sub (a,b, 14); ! 23: } ! 24: sub(x,y) { ! 25: x = 2; ! 26: r = 22; ! 27: final(y); ! 28: } ! 29: ! 30: final(z) ! 31: register int z; { ! 32: register p,q,a; ! 33: int f,g; ! 34: int x[10]; ! 35: struct { ! 36: int aa; ! 37: int bb; ! 38: } d, *pd; ! 39: pd = &d; ! 40: d.aa=23; ! 41: d.bb=34; ! 42: p = 1; ! 43: q = 2; ! 44: a = 3; ! 45: f = 4; ! 46: { ! 47: int i, j, k; ! 48: i = 2; ! 49: g = 5; ! 50: x[10000] = 2; ! 51: g = 0; ! 52: } ! 53: g = 1; ! 54: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.