File: test.c

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,998,492 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (70 lines) | stat: -rw-r--r-- 1,073 bytes parent folder | download | duplicates (10)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <stdbool.h>
#include <stdio.h>

struct ForwardDecl;

typedef int MyInt;

void populate(MyInt i);

typedef enum MyEnum {
  eOne = 1,
  eTwo =2,
  eThree = 3,
} MyEnumT;

typedef union MyUnion {
    MyInt i;
    const char* s;
} MyUnionT;

typedef struct MyNestedStruct {
  MyInt i;
  const char* s;
  volatile char c;
  char a[4];
  MyEnumT e;
  MyUnionT u;
  _Bool b;
} MyNestedStructT;

typedef struct MyStruct {
  MyNestedStructT n;
  void (*f)(int);
} MyStructT;

struct LargeStruct {
  char buffer[9000];
  int b;
};

struct RecursiveStruct {
  struct RecursiveStruct *n;
};

MyStructT foo;
struct ForwardDecl *forward;
struct LargeStruct bar;
struct RecursiveStruct ke;

void populate(MyInt i) {
  foo.n.i = i;
  foo.n.s = "foo";
  foo.n.c = 'c';
  foo.n.a[0] = 'a';
  foo.n.a[1] = 'b';
  foo.n.a[2] = 'c';
  foo.n.a[3] = 'd';
  foo.n.e = eOne;
  foo.n.b = false;
  foo.f = NULL;
  forward = NULL;
  bar.b = i;
  ke.n = NULL;
}

int main(int argc, char** argv) {
  populate(argc);
  printf("foo is at address: %p\n", (void*)&foo); // Break here
  return 0;
}