File: reservoir-mg-interp.c

package info (click to toggle)
llvm-toolchain-11 1%3A11.0.1-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 995,808 kB
  • sloc: cpp: 4,767,656; ansic: 760,916; asm: 477,436; python: 170,940; objc: 69,804; lisp: 29,914; sh: 23,855; f90: 18,173; pascal: 7,551; perl: 7,471; ml: 5,603; awk: 3,489; makefile: 2,573; xml: 915; cs: 573; fortran: 503; javascript: 452
file content (85 lines) | stat: -rw-r--r-- 2,630 bytes parent folder | download | duplicates (17)
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
84
85
{
  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);
}