File: printstats.cpp

package info (click to toggle)
enigma 1.20-dfsg.1-2
  • links: PTS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 64,620 kB
  • ctags: 16,428
  • sloc: xml: 153,614; cpp: 63,581; ansic: 31,088; sh: 4,825; makefile: 1,858; yacc: 288; perl: 84; sed: 16
file content (302 lines) | stat: -rw-r--r-- 9,058 bytes parent folder | download | duplicates (5)
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
// Copyright 2003 Jeremy Sawicki
//
// This file is part of OxydLib.
//
// OxydLib is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// OxydLib is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with OxydLib; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

#include <stdio.h>
#include "OxydVersion.h"
#include <string>
#include <cassert>
#include "VecUtils.h"
#include "FileUtils.h"
#include "DatFile.h"
#include "Level.h"

#include "EnigmaNames.cpp"

using namespace std;
using namespace OxydLib;
using namespace enigma_names;

void usage()
{
  printf("Usage:\n");
  printf("  printstats [options] <datfile>\n");
  printf("\n");
  printf("Description:\n");
  printf("  The printstats program parses the Oxyd data file specified by <datfile>\n");
  printf("  and displays statistics about the contents of the levels.  For each\n");
  printf("  type of surface, piece, or object, printstats displays the level\n");
  printf("  numbers where it is used, as well as the level numbers where it is used\n");
  printf("  as a signal sender or recipient (pieces and objects only).\n");
  printf("\n");
  printf("Options:\n");
  printf("  -v1  Oxyd 1\n");
  printf("  -vm  Oxyd Magnum\n");
  printf("  -vg  Oxyd Magnum Gold\n");
  printf("  -vp  PerOxyd (default)\n");
  printf("  -ve  Oxyd Extra\n");
  printf("  -n   Use enigma names for objects\n");
  printf("\n");
}

void printObjectValue(int num, Mapping *m, GridType type) {
    if (m) {
        static int max_length[GridType_Count] = { -1, -1, -1 };

        if (max_length[type]<0) {
            for (int t = GridType_First; t <= GridType_Last; ++t) {
                const char *(Mapping::*getName)(int) const = 0;

                switch (t) {
                    case GridType_Surfaces: getName = &Mapping::floorName; break;
                    case GridType_Pieces:   getName = &Mapping::stoneName; break;
                    case GridType_Objects:  getName = &Mapping::itemName; break;
                    default : assert(0); break;
                }

                int max = -1;
                for (int i = 0; i<256; ++i) {
                    const char *name = (m->*getName)(i);
                    if (name) {
                        int len          = strlen(name);
                        if (len>max) max = len;
                    }
                }
                max_length[t] = max;
            }
        }

        const char *name = 0;

        switch (type) {
            case GridType_Surfaces: name = m->floorName(num); break;
            case GridType_Pieces:   name = m->stoneName(num); break;
            case GridType_Objects:  name = m->itemName(num); break;
            default : assert(0); break;
        }
        printf("%-*s ", max_length[type], name ? name : "");
    }
    printf("%02x:", num);
}

int main(int argc, char *argv[])
{
  OxydVersion ver            = OxydVersion_PerOxyd;
  bool        bGotDatFile    = false;
  bool        useEnigmaNames = false;
  string      strDatFile;

  int nArg = 1;
  while (nArg < argc) {
    string strArg(argv[nArg]);
    nArg++;

    if (strArg.compare("-v1") == 0) {
      ver = OxydVersion_Oxyd1;
    } else if (strArg.compare("-vm") == 0) {
      ver = OxydVersion_OxydMagnum;
    } else if (strArg.compare("-vg") == 0) {
      ver = OxydVersion_OxydMagnumGold;
    } else if (strArg.compare("-vp") == 0) {
      ver = OxydVersion_PerOxyd;
    } else if (strArg.compare("-ve") == 0) {
      ver = OxydVersion_OxydExtra;
    } else if (strArg.compare("-n") == 0) {
      useEnigmaNames = true;
    } else if (!bGotDatFile) {
      strDatFile = strArg;
      bGotDatFile = true;
    } else {
      usage();
      exit(1);
    }
  }

  if (!bGotDatFile) {
    usage();
    exit(1);
  }

  Mapping *enigmaMapping = 0;
  if (useEnigmaNames) enigmaMapping = new Mapping(ver);

  OxydLib::ByteVec fileData;
  bool success = readFile(strDatFile, &fileData);
  if (!success) {
    printf("Error reading DAT file.\n");
    exit(1);
  }

  DatFile datFile;
  string msg;
  success = parseDatFile(fileData, ver, &datFile, &msg);
  if (!success) {
    printf("Error parsing DAT file:\n");
    printf("%s\n", msg.c_str());
    exit(1);
  }

  set<int> used[GridType_Count][256];
  set<int> usedAsSender[GridType_Count][256];
  set<int> usedAsRecipient[GridType_Count][256];

  for (int nLevel = 0; nLevel < 200; nLevel++) {
    OxydLib::Level level;
    success = parseLevel(datFile.getLevel(nLevel), &level, &msg);
    if (!success) {
      printf("Error parsing level %d:\n", nLevel + 1);
      printf("%s\n", msg.c_str());
      continue;
//       exit(1);
    }

    if (level.isEmpty()) {
      continue;
    }

    {
      for (int gridTypeInt = GridType_First;
           gridTypeInt <= GridType_Last;
           gridTypeInt++) {
        GridType gridType = GridType(gridTypeInt);

        for (unsigned int y = 0; y < level.getHeight(); y++) {
          for (unsigned int x = 0; x < level.getWidth(); x++) {
            unsigned char byteVal = level.getGrid(gridType).get(x, y);
            used[gridType][byteVal].insert(nLevel);
          }
        }

        if (gridType == GridType_Surfaces) {
          continue;
        }
      }
    }

    {
      set<SignalLocation> senders;
      level.getSenders(&senders);
      set<SignalLocation>::const_iterator senderIter = senders.begin();
      set<SignalLocation>::const_iterator senderEnd = senders.end();
      for (; senderIter != senderEnd; ++senderIter) {
        const SignalLocation &sender = *senderIter;

        unsigned char senderByteVal =
          level.getGrid(sender.getGridType()).get(sender.getX(),
                                                  sender.getY());
        usedAsSender[sender.getGridType()][senderByteVal].insert(nLevel);

        int numRecipients = level.getNumRecipients(sender);
        for (int nRecipient = 0;
             nRecipient < numRecipients;
             nRecipient++) {
          const SignalLocation &recipient =
            level.getRecipient(sender, nRecipient);

          unsigned char recipientByteVal =
            level.getGrid(recipient.getGridType()).get(recipient.getX(),
                                                       recipient.getY());
          usedAsRecipient[recipient.getGridType()][recipientByteVal]
            .insert(nLevel);
        }
      }
    }
  }

  {
    for (int gridTypeInt = GridType_First;
         gridTypeInt <= GridType_Last;
         gridTypeInt++) {
      GridType gridType = GridType(gridTypeInt);

      switch (gridType) {
      case GridType_Surfaces: printf("Surfaces:\n"); break;
      case GridType_Pieces:   printf("Pieces:\n");   break;
      case GridType_Objects:  printf("Objects:\n");  break;
      default: exit(1);
      }

      for (int byteValInt = 0; byteValInt < 256; byteValInt++) {
        printObjectValue(byteValInt, enigmaMapping, gridType);
        // printf("%02x:", byteValInt);

        const set<int> &intSet = used[gridType][byteValInt];
        set<int>::const_iterator iter = intSet.begin();
        set<int>::const_iterator end = intSet.end();
        for (; iter != end; ++iter) {
          int nLevel = *iter;
          printf(" %d", nLevel + 1);
        }

        printf("\n");
      }

      printf("\n");
    }
  }

  {
    for (int gridTypeInt = GridType_First;
         gridTypeInt <= GridType_Last;
         gridTypeInt++) {
      GridType gridType = GridType(gridTypeInt);

      if (gridType == GridType_Surfaces) {
        continue;
      }

      for (int useType = 1; useType <= 2; useType++) {
        switch (gridType) {
        case GridType_Pieces:   printf("Pieces (");   break;
        case GridType_Objects:  printf("Objects (");  break;
        default: exit(1);
        }

        switch (useType) {
        case 1: printf("senders"); break;
        case 2: printf("recipients"); break;
        default: exit(1);
        }

        printf("):\n");

        for (int byteValInt = 0; byteValInt < 256; byteValInt++) {
          printObjectValue(byteValInt, enigmaMapping, gridType);
          // printf("%02x:", byteValInt);

          const set<int> &intSet =
            (useType == 1 ? usedAsSender : usedAsRecipient)
            [gridType][byteValInt];
          set<int>::const_iterator iter = intSet.begin();
          set<int>::const_iterator end = intSet.end();
          for (; iter != end; ++iter) {
            int nLevel = *iter;
            printf(" %d", nLevel + 1);
          }

          printf("\n");
        }

        printf("\n");
      }
    }
  }

  delete enigmaMapping;

  return 0;
}