int main(int argc, char *argv[])
{
printf("command argument: %s\n", argv[1]);
// io_tools
//gpchar();
// data_type
printf("------------ data_type example ------------\n");
print_sizeof ();
// pointer
printf("\n------------ pointer example --------------\n");
address();
// string
printf("\n------------ string example ---------------\n");
char_to_string();
// struct
printf("\n------------ struct example ---------------\n");
structure();
// union
printf("\n------------ union example ----------------\n");
union_test();
// bit_field
printf("\n------------ bit_field example -----------\n");
bit_field_test();
// file_io
printf("\n------------ file_io example -------------\n");
file_io_test();
// recursion
printf("\n------------ recusion example -------------\n");
recursion_test();
// variable_args
printf("\n------------ valist example -------------\n");
varargs_test();
// memory
printf("\n------------ memory example -------------\n");
memory_mgmt_test();
return 0;
}
static void test_swap_double() {
union {
double d;
uint64_t u;
} ud = {
.u = 0x7856341283C0F33F
};
double x = 1.2344999991522893623141499119810760021209716796875;
ud.u = BSWAP_64(ud.u);
double r = ud.d;
if (r == x) {
printf("%.64f\n", ud.d);
printf("swap okay\n");
} else {
printf("swap failed\n");
printf("%.64f\n", ud.d);
}
double td = 1.2344999991522893623141499119810760021209716796875;
if (memcmp(&td, "\x78\x56\x34\x12\x83\xC0\xF3\x3F", 8) == 0) {
printf("little endian double\n");
} else if (memcmp(&td, "\x3F\xF3\xC0\x83\x12\x34\x56\x78", 8) == 0) {
printf("big endian double\n");
} else {
printf("not support number format to dump!");
}
}
int main(int argc, char const* argv[]) {
test_swap_double();
test_b32();
union_test();
uint64_t i = 0x123456789abcdeff;
measure_time(test_mc, i, "memory copy");
measure_time(test_mc2, i, "memory copy 2");
measure_time(test_bo, i, "bitwise operation");
return 0;
}
int main() {
int repeat = 500;
int size = TESTSIZE;
tellmeall();
printf("array container benchmarks\n");
array_container_t* B = array_container_create();
BEST_TIME(add_test(B), 0, repeat, size);
int answer = contains_test(B);
size = 1 << 16;
BEST_TIME(contains_test(B), answer, repeat, size);
size = (1 << 16) / 3;
BEST_TIME(remove_test(B), 0, repeat, size);
array_container_free(B);
for (int howmany = 32; howmany <= (1 << 16); howmany *= 8) {
array_container_t* Bt = array_container_create();
for (int j = 0; j < howmany; ++j) {
array_container_add(Bt, (uint16_t)pcg32_random());
}
size_t nbrtestvalues = 1024;
uint16_t* testvalues = malloc(nbrtestvalues * sizeof(uint16_t));
printf("\n number of values in container = %d\n", Bt->cardinality);
int card = array_container_cardinality(Bt);
uint32_t* out = malloc(sizeof(uint32_t) * (unsigned long)card);
BEST_TIME(array_container_to_uint32_array(out, Bt, 1234), card, repeat,
card);
free(out);
BEST_TIME_PRE_ARRAY(Bt, array_container_contains, array_cache_prefetch,
testvalues, nbrtestvalues);
BEST_TIME_PRE_ARRAY(Bt, array_container_contains, array_cache_flush,
testvalues, nbrtestvalues);
free(testvalues);
array_container_free(Bt);
}
printf("\n");
array_container_t* B1 = array_container_create();
for (int x = 0; x < 1 << 16; x += 3) {
array_container_add(B1, (uint16_t)x);
}
array_container_t* B2 = array_container_create();
for (int x = 0; x < 1 << 16; x += 5) {
array_container_add(B2, (uint16_t)x);
}
int32_t inputsize = B1->cardinality + B2->cardinality;
array_container_t* BO = array_container_create();
printf("\nUnion and intersections...\n");
printf("\nNote:\n");
printf(
"union times are expressed in cycles per number of input elements "
"(both arrays)\n");
printf(
"intersection times are expressed in cycles per number of output "
"elements\n\n");
printf("==intersection and union test 1 \n");
printf("input 1 cardinality = %d, input 2 cardinality = %d \n",
B1->cardinality, B2->cardinality);
answer = union_test(B1, B2, BO);
printf("union cardinality = %d \n", answer);
printf("B1 card = %d B2 card = %d \n", B1->cardinality, B2->cardinality);
BEST_TIME(union_test(B1, B2, BO), answer, repeat, inputsize);
answer = intersection_test(B1, B2, BO);
printf("intersection cardinality = %d \n", answer);
BEST_TIME(intersection_test(B1, B2, BO), answer, repeat, answer);
printf("==intersection and union test 2 \n");
array_container_clear(B1);
array_container_clear(B2);
for (int x = 0; x < 1 << 16; x += 16) {
array_container_add(B1, (uint16_t)x);
}
for (int x = 1; x < 1 << 16; x += x) {
array_container_add(B2, (uint16_t)x);
}
printf("input 1 cardinality = %d, input 2 cardinality = %d \n",
B1->cardinality, B2->cardinality);
answer = union_test(B1, B2, BO);
printf("union cardinality = %d \n", answer);
printf("B1 card = %d B2 card = %d \n", B1->cardinality, B2->cardinality);
BEST_TIME(union_test(B1, B2, BO), answer, repeat, inputsize);
answer = intersection_test(B1, B2, BO);
printf("intersection cardinality = %d \n", answer);
BEST_TIME(intersection_test(B1, B2, BO), answer, repeat, answer);
array_container_free(B1);
array_container_free(B2);
array_container_free(BO);
return 0;
}
