int main(int argc,char **argv)
{
TYPE_DEF tmp;
if(argc < 2)
{
printf("Error Para!\n");
exit(0);
}
tmp.num32 = strtol(argv[1],NULL,0);
if(tmp.num32 > 0xffffffff)
{
printf("Data is too big!(0--0xffffffff)\n");
exit(0);
}
printf("\n0x%x\n",tmp.num32);
if(isLitteOrder())
printf("Litte Order:\n\tlow\t->\t->\tHigh\n");
else
printf("Big Order:\n\thigh\t->\t->\tlow\n");
printf("%d--->%d\n",sizeof(TYPE_DEF),sizeof(tmp));
printf("\ta\tb\tc\td\n");
printf("\t%x\t%x\t%x\t%x\n",tmp.s_num.a,tmp.s_num.b,tmp.s_num.c,tmp.s_num.d);
printf("\n%x\n",tmp.s_num.e);
print_pv(tmp);
return 0;
}
static void print_uci_info(app_t *app, int depth, int score)
{
ms_time_t tm;
u64 i, s;
get_current_tick(&tm);
i = get_interval(&app->search.start, &tm);
s = i / 1000;
printf("info depth %d score cp %d time %lld nodes %lld nps %lld pv ",
depth, score,
i, app->search.nodes,
/* we are calculating average nps here - to calculate true nps we should
only consider the nodes searched and time interval for this depth */
(s != 0 ? app->search.nodes / s : app->search.nodes));
print_pv(app, depth);
printf("\n");
}
