File: reservoir-mg-interp.c

package info (click to toggle)
llvm-toolchain-15 1%3A15.0.6-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,554,644 kB
  • sloc: cpp: 5,922,452; ansic: 1,012,136; asm: 674,362; python: 191,568; objc: 73,855; f90: 42,327; lisp: 31,913; pascal: 11,973; javascript: 10,144; sh: 9,421; perl: 7,447; ml: 5,527; awk: 3,523; makefile: 2,520; xml: 885; cs: 573; fortran: 567
file content (83 lines) | stat: -rw-r--r-- 2,460 bytes parent folder | download | duplicates (34)
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
71
72
73
74
75
76
77
78
79
80
81
82
83
if (N >= 2)
  for (int c0 = 1; c0 < O; c0 += 1) {
    for (int c3 = 1; c3 <= M; c3 += 1)
      S1(c0, 1, c3);
    for (int c3 = 1; c3 < M; c3 += 1) {
      S6(c0, 1, c3);
      S7(c0, 1, c3);
    }
    if (N >= 3) {
      for (int c3 = 1; c3 <= M; c3 += 1)
        S3(c0, 1, c3);
      for (int c3 = 1; c3 <= M; c3 += 1)
        S1(c0, 2, c3);
      for (int c3 = 1; c3 < M; c3 += 1) {
        S6(c0, 2, c3);
        S7(c0, 2, c3);
      }
      for (int c3 = 1; c3 < M; c3 += 1)
        S11(c0, 1, c3);
    } else {
      for (int c3 = 1; c3 <= M; c3 += 1)
        S3(c0, 1, c3);
      for (int c3 = 1; c3 < M; c3 += 1)
        S11(c0, 1, c3);
    }
    for (int c1 = 3; c1 < 2 * N - 4; c1 += 2) {
      for (int c3 = 1; c3 < M; c3 += 1)
        S10(c0, (c1 - 1) / 2, c3);
      for (int c3 = 1; c3 <= M; c3 += 1)
        S3(c0, (c1 + 1) / 2, c3);
      for (int c3 = 1; c3 <= M; c3 += 1)
        S1(c0, (c1 + 3) / 2, c3);
      for (int c3 = 1; c3 < M; c3 += 1) {
        S6(c0, (c1 + 3) / 2, c3);
        S7(c0, (c1 + 3) / 2, c3);
      }
      for (int c3 = 1; c3 < M; c3 += 1)
        S11(c0, (c1 + 1) / 2, c3);
    }
    if (N >= 3) {
      for (int c3 = 1; c3 < M; c3 += 1)
        S10(c0, N - 2, c3);
      for (int c3 = 1; c3 <= M; c3 += 1)
        S3(c0, N - 1, c3);
      for (int c3 = 1; c3 < M; c3 += 1)
        S11(c0, N - 1, c3);
    }
    for (int c3 = 1; c3 < M; c3 += 1)
      S10(c0, N - 1, c3);
  }
for (int c0 = 1; c0 < O; c0 += 1)
  for (int c1 = 1; c1 < N; c1 += 1) {
    for (int c3 = 1; c3 <= M; c3 += 1)
      S2(c0, c1, c3);
    for (int c3 = 1; c3 < M; c3 += 1)
      S8(c0, c1, c3);
    for (int c3 = 1; c3 < M; c3 += 1)
      S9(c0, c1, c3);
  }
for (int c0 = 1; c0 < O; c0 += 1)
  for (int c1 = 1; c1 < N; c1 += 1)
    for (int c2 = 1; c2 < M; c2 += 1)
      S4(c0, c1, c2);
for (int c0 = 1; c0 < O; c0 += 1)
  for (int c1 = 1; c1 < N; c1 += 1)
    for (int c2 = 1; c2 < M; c2 += 1)
      S5(c0, c1, c2);
for (int c0 = R; c0 < O; c0 += 1)
  for (int c1 = Q; c1 < N; c1 += 1)
    for (int c2 = P; c2 < M; c2 += 1)
      S12(c0, c1, c2);
for (int c0 = R; c0 < O; c0 += 1)
  for (int c1 = Q; c1 < N; c1 += 1)
    for (int c2 = 1; c2 < M; c2 += 1)
      S13(c0, c1, c2);
for (int c0 = R; c0 < O; c0 += 1)
  for (int c1 = 1; c1 < N; c1 += 1)
    for (int c2 = P; c2 < M; c2 += 1)
      S14(c0, c1, c2);
for (int c0 = R; c0 < O; c0 += 1)
  for (int c1 = 1; c1 < N; c1 += 1)
    for (int c2 = 1; c2 < M; c2 += 1)
      S15(c0, c1, c2);