summaryrefslogtreecommitdiff
path: root/cacount.cpp
blob: bd8f1a6f0a1edfb5bdf7224a9409f74ba92fee11 (plain)
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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
#include <assert.h>
#include <stdlib.h>
#include <string.h>

#include <array>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <set>

#include <sys/mman.h>

using namespace std;

typedef uint32_t State;
const State logState = 31;
const State maxState = 1 << logState;

bitset<8> rule(110);

State update(State s) {
  State r(0);
  bitset<logState> b(s);
  for (unsigned i=0; i<logState; i++)
    r |= rule[1 * b[(i + logState - 1) % logState]
	    + 2 * b[i]                
	    + 4 * b[(i + 1) % logState]] << i;
  return r;
}

typedef array<State, maxState> Trans;

void iterState(function<void(int)> f) {
  for (State s=0; s<maxState; s++)
    f(s);
}

void iterTrans(int times, function<void(int)> f, bool verbose=false) {
  if (verbose) cerr << times << " left\r";
  while (times--) {
    iterState(f);
    if (verbose) cerr << times << " left\r";
  }
  if (verbose) cerr << "           \r";
}

void init(Trans &t) {
  iterState([&](int s) { 
      t[s] = update(s); });
}

void findCycle(Trans &t, Trans &c) {
  // forward to t=maxState; now every state is in a cycle
  iterTrans(logState, [&](int s) {
      t[s] = t[t[s]]; }, true);
  // compute loop id (lowest occuring state no): go through the loop again and
  // record the lowest occuring state number
  iterState([&](int s) { 
      c[s] = t[s]; });
  iterTrans(logState, [&](int s) {
      c[s] = min(c[s], c[t[s]]);
      t[s] = t[t[s]]; }, true);
}

void cycleStat(Trans &c) {
  struct Stat {
    State basin, len, minState;
    Stat() : basin(0), len(0), minState(maxState) {}
  };
  map<State, Stat> cyc;

  // how big is the basin of attraction?
  iterState([&](int s) { cyc[c[s]].basin++; });

  // how long is the cycle, what is the actual minimal state
  for (auto i : cyc) {
    Stat &s = cyc[i.first];
    State cur, start;
    cur = start = c[i.first]; 
    do {
      s.len++;
      s.minState = min(s.minState, cur);
      cur=update(cur);
    } while (cur != start);
  }

  // find duplicates cycles (only bitshifted)
  auto canonize = [](State s) {
    State cs = s;
    for (State i=0; i<logState; i++)
      cs = min(cs, (((s<<i) | (s>>(logState-i))) & (maxState - 1)));
    return cs;
  };
  map<State, set<State>> ccyc;
  for (auto i : cyc) {
    ccyc[canonize(i.second.minState)].insert(i.first);
  }

  // print it
  for (auto i : ccyc) {
    Stat &s = cyc[*(i.second.begin())];
    cout << bitset<logState>(i.first) << "\t"
	 << i.second.size() << "\t"
	 << s.len << "\t"
	 << s.basin << "\t"
	 << i.first << endl;
  }
}

void print(Trans &t) {
  for (auto s : t)
    cout << bitset<logState>(s) << endl;
}

void printTraj(State s, int count) {
  while (count--) {
    cout << bitset<logState>(s) << endl;
    s = update(s);
  }
}

template<typename T>
T* mmalloc() {
  void *p = MAP_FAILED;
  for (auto flag : {MAP_POPULATE | MAP_HUGETLB, MAP_POPULATE, 0})
    if (p == MAP_FAILED)
      p = mmap(NULL, sizeof(Trans), PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS | flag, -1, 0);
  assert(p != MAP_FAILED);
  return (T*) p;
}

int main(int argc, char **argv) {
  assert(argc >= 2);
  rule = atoi(argv[1]);
  if (!strcmp(argv[2], "traj")) {
    assert(argc == 5);
    printTraj(atoi(argv[3]), atoi(argv[4]));
  }
  if (!strcmp(argv[2], "cycle")) {
    Trans *t = mmalloc<Trans>(),
      *c = mmalloc<Trans>();
    init(*t);
    findCycle(*t, *c);
    cycleStat(*c);
  }
  return 0;
}
contact: Jan Huwald // Impressum