#include <usual/mbuf.h>
#include <usual/crypto/md5.h>
#include <usual/misc.h>
-//#include <usual/pgsocket.h>
#include <usual/safeio.h>
#include <usual/shlist.h>
#include <usual/signal.h>
-/FFS/s,^,//,
-/FLS/s,^,//,
-/STRLCPY/s,^,//,
-/STRLCAT/s,^,//,
-/BASENAME/s,^,//,
-/DIRNAME/s,^,//,
-/REGCOMP/s,^,//,
-/GETADDRINFO_A/s,^,//,
-/INET_NTOP/s,^,//,
-/INET_PTON/s,^,//,
-/GETOPT/s,^,//,
-/CTYPE_ON_CHAR/s,^,//,
-/FNMATCH/s,^,//,
+/^#define.*FFS/s,.*,/* & */,
+/^#define.*FLS/s,.*,/* & */,
+/^#define.*STRLCPY/s,.*,/* & */,
+/^#define.*STRLCAT/s,.*,/* & */,
+/^#define.*BASENAME/s,.*,/* & */,
+/^#define.*DIRNAME/s,.*,/* & */,
+/^#define.*REGCOMP/s,.*,/* & */,
+/^#define.*GETADDRINFO_A/s,.*,/* & */,
+/^#define.*INET_NTOP/s,.*,/* & */,
+/^#define.*INET_PTON/s,.*,/* & */,
+/^#define.*GETOPT/s,.*,/* & */,
+/^#define.*CTYPE_ON_CHAR/s,.*,/* & */,
+/^#define.*FNMATCH/s,.*,/* & */,
static void test_aatree_random(void *p)
{
bool is_added[RSIZE];
- int prefer_remove = 0; // 0 - insert, 1 - delete
+ int prefer_remove = 0; /* 0 - insert, 1 - delete */
int n;
- int op; // 0 - insert, 1 - delete
+ int op; /* 0 - insert, 1 - delete */
struct AATree tree[1];
unsigned long long total = 0;
- //printf("\n\n*** rand test ***\n\n");
srandom(123123);
memset(is_added, 0, sizeof(is_added));
op = r > 5;
else
op = r > 10;
- //op = 0;
+ /* op = 0; */
n = get_next(op, is_added);
if (n < 0) {
- //break;
if (prefer_remove == op) {
prefer_remove = !prefer_remove;
- //printf("** toggling remove to %d\n", prefer_remove);
}
continue;
}
static void test_cbtree_random(void *p)
{
bool is_added[RSIZE];
- int prefer_remove = 0; // 0 - insert, 1 - delete
+ int prefer_remove = 0; /* 0 - insert, 1 - delete */
int n;
- int op; // 0 - insert, 1 - delete
+ int op; /* 0 - insert, 1 - delete */
struct CBTree *tree;
unsigned long long total = 0;
- //printf("\n\n*** rand test ***\n\n");
srandom(123123);
memset(is_added, 0, sizeof(is_added));
op = r > 5;
else
op = r > 10;
- //op = 0;
+ /* op = 0; */
n = get_next(op, is_added);
if (n < 0) {
- //break;
if (prefer_remove == op) {
prefer_remove = !prefer_remove;
- //printf("** toggling remove to %d\n", prefer_remove);
}
continue;
}
va_start(ap, fmt);
vsnprintf(logbuf + len, sizeof(logbuf) - len, fmt, ap);
va_end(ap);
-
- //printf("\n%s: delta=%d\n", logbuf + len, delta);
}
static void *log_alloc(void *ctx, size_t len)
cx_destroy(cx1);
- //str_check(logbuf, "A(16)R(500)F()");
+ /* str_check(logbuf, "A(16)R(500)F()"); */
int_check(delta, 0);
end:
reset();
static void test_aatree_random(void *p)
{
bool is_added[RSIZE];
- int prefer_remove = 0; // 0 - insert, 1 - delete
+ int prefer_remove = 0; /* 0 - insert, 1 - delete */
int n;
- int op; // 0 - insert, 1 - delete
+ int op; /* 0 - insert, 1 - delete */
struct AATree tree[1];
unsigned long long total = 0;
- //printf("\n\n*** rand test ***\n\n");
srandom(123123);
memset(is_added, 0, sizeof(is_added));
op = r > 5;
else
op = r > 10;
- //op = 0;
+ /* op = 0; */
n = get_next(op, is_added);
if (n < 0) {
- //break;
if (prefer_remove == op) {
prefer_remove = !prefer_remove;
- //printf("** toggling remove to %d\n", prefer_remove);
}
continue;
}
struct testcase_t heap_tests[] = {
{ "basic", test_heap_basic },
- //{ "random", test_aatree_random },
+ /* { "random", test_aatree_random }, */
END_OF_TESTCASES
};
struct testcase_t list_tests[] = {
{ "sort", test_list_sort },
- //{ "sort2", test_list_sort2 },
- //{ "sort3", test_list_sort3 },
+#if 0
+ { "sort2", test_list_sort2 },
+ { "sort3", test_list_sort3 },
+#endif
END_OF_TESTCASES
};
str_check(e_rx("foo(x)?.*", "foobar", 0), "(0,6)(?,?)");
str_check(e_rx("foo", "bar", 0), "NOMATCH");
str_check(e_rx("foo{5,1}", "bar", 0), "BADBR");
- //str_check(e_rx("(|)", "bar", 0), "BADPAT");
+ /* str_check(e_rx("(|)", "bar", 0), "BADPAT"); */
str_check(e_rx("*", "bar", 0), "BADRPT");
str_check(e_rx("foo{", "bar", 0), "EBRACE");
str_check(e_rx("fo[o", "bar", 0), "EBRACK");
return false;
}
if (!s) s = "NULL";
- //printf("writing: <%s>\n", s);
return mbuf_write(mb, s, strlen(s));
}
#define ECONNABORTED WSAECONNABORTED
#define EMSGSIZE WSAEMSGSIZE
-#define EINPROGRESS WSAEWOULDBLOCK // WSAEINPROGRESS
+#define EINPROGRESS WSAEWOULDBLOCK /* WSAEINPROGRESS */
#undef EAGAIN
-#define EAGAIN WSAEWOULDBLOCK // WSAEAGAIN
+#define EAGAIN WSAEWOULDBLOCK /* WSAEAGAIN */
#ifndef EAFNOSUPPORT
#define EAFNOSUPPORT ENOSYS
#include <limits.h>
#include <string.h>
-//#define KECCAK_64BIT
-
/*
* Decide whether to use 64- or 32-bit implementation.
*/
/* track wait state */
enum WType wait_type;
- uint8_t wait_event; // EV_READ / EV_WRITE
+ /* EV_READ / EV_WRITE */
+ uint8_t wait_event;
/* should connect after sleep */
bool reconnect;