* SOFTWARE.
*/
#include <string.h>
-#include <ctype.h>
+#include <stdlib.h>
#include "gmqcc.h"
size_t util_strtocmd(const char *in, char *out, size_t outsz) {
size_t sz = 1;
for (; *in && sz < outsz; ++in, ++out, ++sz)
- *out = (*in == '-') ? '_' : (isalpha(*in) && !isupper(*in)) ? *in + 'A' - 'a': *in;
+ *out = (*in == '-') ? '_' : (util_isalpha(*in) && !util_isupper(*in)) ? *in + 'A' - 'a': *in;
*out = 0;
return sz-1;
}
size_t util_strtononcmd(const char *in, char *out, size_t outsz) {
size_t sz = 1;
for (; *in && sz < outsz; ++in, ++out, ++sz)
- *out = (*in == '_') ? '-' : (isalpha(*in) && isupper(*in)) ? *in + 'a' - 'A' : *in;
+ *out = (*in == '_') ? '-' : (util_isalpha(*in) && util_isupper(*in)) ? *in + 'a' - 'A' : *in;
*out = 0;
return sz-1;
}
allocated = (char*)mem_a(4096); /* A page must be enough */
strerror_s(allocated, 4096, num);
-
+
vec_push(vector, allocated);
return (const char *)allocated;
}
static uint32_t mt_state[MT_SIZE];
static size_t mt_index = 0;
-static GMQCC_INLINE void mt_generate() {
+static GMQCC_INLINE void mt_generate(void) {
/*
* The loop has been unrolled here: the original paper and implemenation
* Called for the following code:
* Said loop has been unrolled for MT_SPACE (226 iterations), opposed
* to [0, MT_SIZE) (634 iterations).
*/
- for (i = 0; i < MT_SPACE; ++i) {
+ for (i = 0; i < MT_SPACE-1; ++i) {
y = (0x80000000 & mt_state[i]) | (0x7FFFFFF & mt_state[i + 1]);
mt_state[i] = mt_state[i + MT_PERIOD] ^ (y >> 1) ^ matrix[y & 1];
* = 2*2*3*3*11])
*/
i = MT_SPACE;
- while (i < MT_SIZE - 1) {
+ while (i < MT_SIZE-2) {
/*
* We expand this 11 times .. manually, no macros are required
* here. This all fits in the CPU cache.