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
|
/*++
Module Name:
Util.cpp
Abstract:
Generic support routines that don't seem to belong elsewhere.
Authors:
Bill Bolosky, March, 2013
Environment:
User mode service.
Revision History:
Factored from other places
--*/
#include "stdafx.h"
#include "Util.h"
#include "Error.h"
_int64 FirstPowerOf2GreaterThanOrEqualTo(_int64 value)
{
int highestBitSet;
for (highestBitSet = 0; highestBitSet <= 62; highestBitSet++) { // Only go to 63, since this is signed
if (!(value & ~((((_int64)1) << highestBitSet) - 1))) {
highestBitSet -= 1;
break;
}
}
if (((_int64)1) << highestBitSet == value) return value;
return ((_int64)1) << (highestBitSet + 1);
}
int cheezyLogBase2(_int64 value)
{
int retVal = 0;
value /= 2; // Since 2^0 = 1; we'll also define cheezyLogBase2(x) = 0 where x<= 0.
while (value > 0) {
retVal++;
value /= 2;
}
return retVal;
}
void
util::memrevcpy(
void* dst,
const void* src,
size_t bytes)
{
size_t dwords = bytes >> 3;
_uint64* p = (_uint64*) dst;
const _uint64* q = (const _uint64*) ((const char*)src + bytes - 8);
for (size_t i = 0; i < dwords; i++) {
*p++ = ByteSwapUI64(*q--);
}
int left = (int) (bytes & 7);
if (left > 0) {
char* p2 = (char*) p;
const char* q2 = (left - 1) + (const char*) src;
for (int i = 0; i < left; i++) {
*p2++ = *q2--;
}
}
}
NWaiter::NWaiter(size_t n)
{
_signalsRequired = n;
_signalsReceived = 0;
InitializeExclusiveLock(&_lock);
CreateEventObject(&_waiter);
}
NWaiter::~NWaiter()
{
DestroyExclusiveLock(&_lock);
DestroyEventObject(&_waiter);
}
void NWaiter::wait()
{
while (true) {
bool done;
AcquireExclusiveLock(&_lock);
done = (_signalsReceived >= _signalsRequired);
ReleaseExclusiveLock(&_lock);
if (done)
return;
else {
WaitForEvent(&_waiter);
}
}
}
void NWaiter::signal()
{
AcquireExclusiveLock(&_lock);
_signalsReceived += 1;
ReleaseExclusiveLock(&_lock);
AllowEventWaitersToProceed(&_waiter);
}
char *FormatUIntWithCommas(_uint64 val, char *outputBuffer, size_t outputBufferSize)
{
//
// First, figure out the number of digits.
//
unsigned nDigits = 0;
_uint64 x = val;
while (x > 0) {
nDigits++;
x = x / 10;
}
if (0 == nDigits) {
//
// Special case for the value 0 (which, I suppose if the world was rational, would be represented by the empty string. :-))
//
_ASSERT(0 == val);
nDigits = 1;
}
int nCommas = (nDigits - 1) / 3;
if (outputBufferSize < nDigits + nCommas + 1) {
WriteErrorMessage("Internal error: too small buffer for FormatUIntWithCommas, value %lld, outputBufferSize %lld\n", val, outputBufferSize);
if (outputBufferSize > 0) {
*outputBuffer = 0;
} else {
soft_exit(1);
}
return outputBuffer;
}
//
// Now build up the string backwards.
//
size_t offset = nDigits + nCommas;
outputBuffer[offset] = '\0';
if (0 == val) {
outputBuffer[0] = '0';
return outputBuffer;
}
x = val;
while (x > 0) {
char tempBuf[5];
if (x > 999) {
sprintf(tempBuf, ",%03lld", x % 1000);
_ASSERT(strlen(tempBuf) == 4);
} else {
sprintf(tempBuf, "%d", x);
}
_ASSERT(offset >= strlen(tempBuf));
offset -= strlen(tempBuf);
memcpy(outputBuffer + offset, tempBuf, strlen(tempBuf));
x /= 1000;
}
return outputBuffer;
}
|
