File: shift2.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 (53 lines) | stat: -rw-r--r-- 2,434 bytes parent folder | download | duplicates (8)
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
for (int c0 = 0; c0 <= 1; c0 += 1) {
  for (int c1 = 0; c1 < length - 1; c1 += 32) {
    for (int c2 = c1; c2 < length; c2 += 32) {
      if (c1 == 0)
        for (int c3 = 0; c3 <= min(length, 2 * c2 - 31); c3 += 32)
          for (int c5 = 0; c5 <= min(31, length - c2 - 1); c5 += 1)
            for (int c6 = max(0, -c3 + 1); c6 <= min(31, length - c3); c6 += 1)
              S_0(c0, c2 + c5, c3 + c6 - 1);
      for (int c3 = 2 * c2; c3 <= min(2 * length - 2, 2 * c2 + 62); c3 += 32)
        for (int c4 = 0; c4 <= min(min(31, length - c1 - 2), (c3 / 2) - c1 + 14); c4 += 1) {
          if (c1 == 0 && c2 == 0 && c4 == 0)
            for (int c6 = max(0, -c3 + 1); c6 <= min(31, length - c3); c6 += 1)
              S_0(c0, 0, c3 + c6 - 1);
          if (c1 == 0 && c3 == 2 * c2 + 32 && c4 == 0)
            for (int c5 = max(0, -c2 + 1); c5 <= 15; c5 += 1)
              for (int c6 = 0; c6 <= min(31, length - 2 * c2 - 32); c6 += 1)
                S_0(c0, c2 + c5, 2 * c2 + c6 + 31);
          for (int c5 = max((c3 / 2) - c2, c1 - c2 + c4 + 1); c5 <= min(length - c2 - 1, (c3 / 2) - c2 + 15); c5 += 1) {
            if (c1 == 0 && c4 == 0)
              for (int c6 = max(0, -c3 + 1); c6 <= min(length - c3, 2 * c2 - c3 + 2 * c5 - 1); c6 += 1)
                S_0(c0, c2 + c5, c3 + c6 - 1);
            S_3(c0, c1 + c4, c2 + c5);
            if (c1 == 0 && c4 == 0 && length >= 2 * c2 + 2 * c5)
              S_0(c0, c2 + c5, 2 * c2 + 2 * c5 - 1);
            if (c1 == 0 && c4 == 0)
              for (int c6 = 2 * c2 - c3 + 2 * c5 + 1; c6 <= min(31, length - c3); c6 += 1)
                S_0(c0, c2 + c5, c3 + c6 - 1);
          }
          if (c1 == 0 && c3 == 2 * c2 && c4 == 0)
            for (int c5 = 16; c5 <= min(31, length - c2 - 1); c5 += 1)
              for (int c6 = max(0, -2 * c2 + 1); c6 <= min(31, length - 2 * c2); c6 += 1)
                S_0(c0, c2 + c5, 2 * c2 + c6 - 1);
          if (c1 == 0 && c3 + 30 >= 2 * length && c4 == 0)
            S_4(c0);
        }
      if (c1 == 0) {
        for (int c3 = 2 * c2 + 64; c3 <= length; c3 += 32)
          for (int c5 = 0; c5 <= 31; c5 += 1)
            for (int c6 = 0; c6 <= min(31, length - c3); c6 += 1)
              S_0(c0, c2 + c5, c3 + c6 - 1);
        if (c2 + 16 == length)
          S_4(c0);
      }
    }
    if (c1 == 0 && length % 32 == 0)
      S_4(c0);
  }
  if (length <= 1) {
    if (length == 1)
      S_0(c0, 0, 0);
    S_4(c0);
  }
}