File: defs.cpp

package info (click to toggle)
dds 2.1.2%2Bddd105-1
  • links: PTS, VCS
  • area: main
  • in suites: wheezy
  • size: 1,896 kB
  • sloc: cpp: 8,095; ansic: 281; python: 89; makefile: 87
file content (244 lines) | stat: -rw-r--r-- 6,585 bytes parent folder | download | duplicates (4)
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
/* **************************************************************************
   defs.cpp  bridge definitions for C/C++ programs
             PM Cronje June 2006

   Copyright 2006 P.M.Cronje

   This file is part of the Double Dummer Driver (DDD).

   DDD 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.

   DDD 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 DDD; if not, write to the Free Software
   Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA

   ************************************************************************** */

#include <string.h>
#include <stdio.h>
#include <ctype.h>

#include "defs.h"

const char *szPLAYER[4]   = {"west", "north", "east", "south"};
const char  chPLAYER[4]   = {'W', 'N', 'E', 'S'};
const char *szSUIT[4]     = {"spades", "hearts", "diamonds", "clubs"};
const char  chSUIT[4]     = {'S', 'H', 'D', 'C'};
const char *szCONTRACT[5] = {"spades","hearts","diamonds","clubs","notrump"};
const char chCARD[13]     = {'A','K','Q','J','T','9','8','7','6','5','4','3','2'};

const ushort usMASK[16]
  = { 0x0001, 0x0002, 0x0004, 0x0008,
      0x0010, 0x0020, 0x0040, 0x0080,
      0x0100, 0x0200, 0x0400, 0x0800,
      0x1000, 0x2000, 0x4000, 0x8000
    };
const ushort usNotMASK[16]
  = { 0xfffe, 0xfffd, 0xfffb, 0xfff7,
      0xffef, 0xffdf, 0xffbf, 0xff7f,
      0xfeff, 0xfdff, 0xfbff, 0xf7ff,
      0xefff, 0xdfff, 0xbfff, 0x7fff
    };

const unsigned int ulMASK[32]
  = { 0x00000001, 0x00000002, 0x00000004, 0x00000008,
      0x00000010, 0x00000020, 0x00000040, 0x00000080,
      0x00000100, 0x00000200, 0x00000400, 0x00000800,
      0x00001000, 0x00002000, 0x00004000, 0x00008000,
      0x00010000, 0x00020000, 0x00040000, 0x00080000,
      0x00100000, 0x00200000, 0x00400000, 0x00800000,
      0x01000000, 0x02000000, 0x04000000, 0x08000000,
      0x10000000, 0x20000000, 0x40000000, 0x80000000
    };
const unsigned int ulNotMASK[32]
  = { 0xfffffffe, 0xfffffffd, 0xfffffffb, 0xfffffff7,
      0xffffffef, 0xffffffdf, 0xffffffbf, 0xffffff7f,
      0xfffffeff, 0xfffffdff, 0xfffffbff, 0xfffff7ff,
      0xffffefff, 0xffffdfff, 0xffffbfff, 0xffff7fff,
      0xfffeffff, 0xfffdffff, 0xfffbffff, 0xfff7ffff,
      0xffefffff, 0xffdfffff, 0xffbfffff, 0xff7fffff,
      0xfeffffff, 0xfdffffff, 0xfbffffff, 0xf7ffffff,
      0xefffffff, 0xdfffffff, 0xbfffffff, 0x7fffffff
    };

// *****************************************************************************

int fromHex(char ch)
{
  if(isdigit(ch))
    return ((int)tolower(ch) - (int)'0');
  else
    return ((int)tolower(ch) - (int)'a' + 10);

} // fromHex
// *****************************************************************************

char toHex(int i)
{
  if(i < 10)
    return (char)(i + '0');
  else
    return toupper((char)(i - 10 + (int)'a'));

} // toHex
// *****************************************************************************

// initialization of static arrays
//   - BitsInByte[256]
//     count of 1-bits in byte
//   - MSBitInByte[256]
//     most significant bit in byte

static bool initBitsInByte(int bits[256], int msb[256])
{
  int i, n, m;

  bits[0] = msb[0] = 0;

  // set bits in byte
  for(i=1; i<256; i++)
  { n = 0;
    m = i;
    while(m)
    { n++;
      m = (m & (m-1));  // strip right-most bit
    };
    bits[i] = n;
  }

  // most significant bit in byte
  for(i=1; i<256; i++)
  { n = 0;
    m = i;
    while(m)
    { n++;
      m >>= 1;
    };
    msb[i] = n-1;
  }

  return true;

} // initBitsInChar
// *****************************************************************************

static int BitsInByte[256];
static int MSBitInByte[256];
static bool bInitBitsInByte = initBitsInByte(BitsInByte,MSBitInByte);

// *****************************************************************************

int bitCount(ushort m)
{
  return (BitsInByte[m & 0x00ff] + BitsInByte[(m >> 8) & 0x00ff]);

} // bitCount
// *****************************************************************************

int leastSignificant1Bit(ushort m)
{
  m = (ushort)((ushort)m ^ ((ushort)m - 1));

  return bitCount(m) - 1;

} // leastSignificant1Bit
// *****************************************************************************

int mostSignificant1Bit(ushort m)
{
/*
  if(m & 0xff00)
    return (8 + MSBitInByte[(m >> 8) & 0x00ff]);
  else
    return MSBitInByte[m];
*/
  register unsigned int x = (m | (m >> 1));
  x |= (x >> 2);
  x |= (x >> 4);
  x |= (x >> 8);

  //x = (x & (~(x >> 1)));
  return bitCount(x) - 1;

} // mostSignificant1Bit
// *****************************************************************************
void clearBit(ushort &m, int ibit) { m &= usNotMASK[ibit];}
bool    isBit(ushort m, int ibit)  { return (m & usMASK[ibit]);}
void   setBit(ushort &m, int ibit) { m |= usMASK[ibit];}
/* ************************************************************************** */

char *format(char str[], char sz[]);

char *format64(unsigned long long number, char sz[])
{
  char str[32];

  snprintf(str,31,"%llu",number);
  format(str,sz);

  return sz;

} // format64
/* ************************************************************************** */

char *format(unsigned int number, char sz[])
{
  char str[32];

  snprintf(str,31,"%u",number);
  format(str,sz);

  return sz;

} // format
/* ************************************************************************** */

char *format(char str[], char sz[])
{
  int len, n, istart, ndigit, i, pos;

  len = strlen(str);
  n = len / 3;
  if(3*n != len)
    n++;
  istart = pos = 0;
  for(i=0; i<n; i++)
  { if(i==0)
      ndigit = len - 3*(n-1);
    else
      ndigit = 3;
    strncpy(sz+pos,str+istart,ndigit);
    istart += ndigit;
    pos += ndigit;
    if(i < n-1)
    { sz[pos] = ',';
      pos++;
    }
  }
  sz[pos] = '\0';

  return sz;

} // format
// *****************************************************************************

char *mPerSec(unsigned int count, double elapsed, char sz[])
{
  if(elapsed >= 0.01)
    sprintf(sz,"%0.3lfm/s",1.0e-6*(double)count/elapsed);
  else
    strcpy(sz,"-.---m/s");

  return sz;

} // mPerSec
/* ************************************************************************** */