combo_t resolve_pool(card_t** pool, byte_t pool_size) {
combo_t result;
char str[255];
result = pok_resolve(pool, pool_size);
printf(" %s, rank ", card_kind_to_text(result.kind));
print_pool(result.rank, RANK_CARDS_COUNT);
printf(" kickers ");
print_pool(result.kickers, KICKERS_COUNT);
printf("\n");
card_combo_to_text(str, result);
printf("card_combo_to_text: %s\n", str);
return result;
}
void
dopool_sysctl(void)
{
int mib[4], npools, i;
long total = 0, inuse = 0;
struct pool pool;
size_t size;
mib[0] = CTL_KERN;
mib[1] = KERN_POOL;
mib[2] = KERN_POOL_NPOOLS;
size = sizeof(npools);
if (sysctl(mib, 3, &npools, &size, NULL, 0) < 0) {
warn("can't figure out number of pools in kernel");
return;
}
for (i = 1; npools; i++) {
char name[32];
mib[0] = CTL_KERN;
mib[1] = KERN_POOL;
mib[2] = KERN_POOL_POOL;
mib[3] = i;
size = sizeof(struct pool);
if (sysctl(mib, 4, &pool, &size, NULL, 0) < 0) {
if (errno == ENOENT)
continue;
warn("error getting pool");
return;
}
npools--;
mib[2] = KERN_POOL_NAME;
size = sizeof(name);
if (sysctl(mib, 4, &name, &size, NULL, 0) < 0) {
warn("error getting pool name");
return;
}
print_pool(&pool, name);
inuse += (pool.pr_nget - pool.pr_nput) * pool.pr_size;
total += pool.pr_npages * getpagesize(); /* XXX */
}
inuse /= 1024;
total /= 1024;
printf("\nIn use %ldK, total allocated %ldK; utilization %.1f%%\n",
inuse, total, (double)(100 * inuse) / total);
}
void test(void) {
card_t pool_cards[POOL_SIZE];
card_t* pool[POOL_SIZE];
card_t pool_cards2[POOL_SIZE];
card_t* pool2[POOL_SIZE];
card_t** compare_result;
int i, j;
byte_t random_size;
printf("\nresolve tests:\n\n");
printf("\nrandom pools:\n");
for (i = 0; i < CASES_COUNT; ++i) {
clear_pool(pool);
randomize_pool(pool, pool_cards);
printf("pool: "); print_pool(pool, POOL_SIZE);
resolve_pool(pool, POOL_SIZE);
}
printf("\npre-defined pools:\n\n");
for (i = 0; i < (sizeof(resolve_data)/(sizeof(char*))) / POOL_SIZE; i++) {
for (j = 0; j < POOL_SIZE; ++j) {
card_fill(pool_cards[j], resolve_data[i][j]);
pool[j] = &pool_cards[j];
}
printf("pool: "); print_pool(pool, POOL_SIZE);
sort_by_rank(pool, POOL_SIZE);
printf(" sorted: "); print_pool(pool, POOL_SIZE);
resolve_pool(pool, POOL_SIZE);
}
printf("\ncomparison tests:\n\n");
for (i = 0; i < CASES_COUNT; ++i) {
clear_pool(pool);
randomize_pool(pool, pool_cards);
printf("pool1: "); print_pool(pool, POOL_SIZE);
resolve_pool(pool, POOL_SIZE);
clear_pool(pool2);
randomize_pool(pool2, pool_cards2);
printf("pool2: "); print_pool(pool2, POOL_SIZE);
resolve_pool(pool2, POOL_SIZE);
compare_result = pok_compare(pool, pool2);
if (compare_result == pool)
printf("pool 1 is stronger\n");
else if (compare_result == pool2)
printf("pool 2 is stronger\n");
else {
printf("tie!\n");
}
}
printf("\nincomplete pools:\n\n");
for (i = 0; i < CASES_COUNT; ++i) {
random_size = rand() % POOL_SIZE + 1;
clear_pool(pool);
randomize_pool(pool, pool_cards);
printf("pool: "); print_pool(pool, random_size);
resolve_pool(pool, random_size);
}
/*while(1) {
clear_pool(pool);
randomize_pool(pool, pool_cards);
result = pok_resolve(pool);
sort_by_rank(pool);
if (result.kind == STRAIGHTF) {
print_pool(pool, POOL_SIZE);
resolve_pool(pool);
}
}*/
}
int main(int argn, char** argv) {
int xsize, ysize;
char c, c2;
int i, i2;
int x, y;
WINDOW* wnd;
char buf[50];
tile* temp_tile;
/* Inicjalizacja generatora liczb losowych */
srand(time(0));
wnd = initscr();
start_color();
if(has_colors()) {
enable_tile_colors();
use_default_colors();
/* Przyporządkuj każdej płytce kolor */
init_pair(1, COLOR_YELLOW, -1);
init_pair(2, COLOR_GREEN, -1);
init_pair(3, COLOR_RED, -1);
init_pair(4, COLOR_YELLOW, -1);
init_pair(5, COLOR_WHITE, -1);
init_pair(6, COLOR_RED, -1);
init_pair(7, COLOR_GREEN, -1);
init_pair(8, COLOR_BLUE, -1);
init_pair(9, COLOR_CYAN, -1);
init_pair(10, COLOR_MAGENTA, -1);
}
else {
disable_tile_colors();
}
cbreak();
echo();
nonl();
intrflush(stdscr, FALSE);
keypad(stdscr, TRUE);
getmaxyx(wnd, ysize, xsize);
/* Pobierz docelowy rozmiar */
while(1) {
werase(wnd);
draw_frame(wnd);
wmove(wnd, ysize/2-(MAX_SIZE-MIN_SIZE+2), 20);
wprintw(wnd, "Available pool size:");
for(i=MIN_SIZE;i<=MAX_SIZE;i++) {
wmove(wnd, ysize/2-(MAX_SIZE-MIN_SIZE+2)+(i-MIN_SIZE+1), 20);
attron(COLOR_PAIR(5) | A_BOLD);
wprintw(wnd, "%d", i);
attroff(COLOR_PAIR(5) | A_BOLD);
wprintw(wnd, " for %dx%d", i, i);
}
wmove(wnd, ysize-2, 2);
wprintw(wnd, "Saephir (c), 2010");
wmove(wnd, ysize/2+1, 20);
wprintw(wnd, "Type the desired number: ");
c = getch();
buf[0] = c;
buf[1] = 0;
i2 = atoi(buf);
if(i2 >= MIN_SIZE && i2 <= MAX_SIZE) {
TILES_COUNT = i2;
init();
break;
}
}
while(1) {
werase(wnd);
draw_frame(wnd);
/* Wygrana gra */
if(verify()) {
print_game(wnd);
wmove(wnd, ysize/2, 40);
wprintw(wnd, "Well done!");
wmove(wnd, ysize/2+1, 40);
wprintw(wnd, "Press ENTER to exit...");
getch();
break;
}
print_game(wnd);
print_pool(wnd);
wmove(wnd, ysize-2, 1);
wgetnstr(wnd, buf, 49);
buf[49] = 0;
if(strcmp(buf, "exit") == 0 || strcmp(buf, "quit") == 0 || strcmp(buf, "q") == 0) {
break;
}
else if(strcmp(buf, "help") == 0 || strcmp(buf, "?") == 0) {
wmove(wnd, ysize-2, 1);
wclrtoeol(wnd);
draw_frame(wnd);
wmove(wnd, ysize-2, 1);
wprintw(wnd, HELP_LINE);
getch();
wmove(wnd, ysize-2, 1);
wclrtoeol(wnd);
draw_frame(wnd);
wmove(wnd, ysize-2, 1);
wprintw(wnd, HELP_LINE2);
getch();
}
else if(strcmp(buf, "<<") == 0) {
push_left();
}
else if(strcmp(buf, ">>") == 0) {
push_right();
}
else if(strcmp(buf, "^^") == 0) {
push_top();
}
else if(strcmp(buf, "vv") == 0) {
push_bottom();
}
else if(sscanf(buf, "%c%d<%c%d", &c, &i, &c2, &i2) == 4) {
i--;
i2--;
if(c == c2 && i == i2)
continue;
if(c-'a' < 0 || c-'a' >= 2*TILES_COUNT)
continue;
if(c2-'a' < 0 || c2-'a' >= 2*TILES_COUNT)
continue;
if(i < 0 || i >= TILES_COUNT)
continue;
if(i2 < 0 || i2 >= TILES_COUNT)
continue;
/* Przesuwamy na pole gry */
if(c-'a' < TILES_COUNT) {
temp_tile = &game[i][c-'a'];
/* Miejsce musi być puste */
if(!is_empty(temp_tile))
continue;
/* przesuwamy z puli do gry */
if(c2-'a' >= TILES_COUNT)
temp_tile = &pool[i2][c2-'a'-TILES_COUNT];
/* przesuwamy z gry do gry */
else
temp_tile = &game[i2][c2-'a'];
/* Żródło nie może być puste */
if(is_empty(temp_tile))
continue;
move_tile(&game[i][c-'a'], temp_tile);
}
/* Przesuwamy do puli */
else {
temp_tile = &pool[i][c-'a'-TILES_COUNT];
/* Miejsce musi być puste */
if(!is_empty(temp_tile))
continue;
/* Przesuwamy z pola gry do puli */
if(c2-'a' < TILES_COUNT)
temp_tile = &game[i2][c2-'a'];
/* Przesuwamy z puli do puli */
else
temp_tile = &pool[i2][c2-'a'-TILES_COUNT];
/* Żródło nie może być puste */
if(is_empty(temp_tile))
continue;
move_tile(&pool[i][c-'a'-TILES_COUNT], temp_tile);
}
}
else if(sscanf(buf, "%c%d>%c%d", &c, &i, &c2, &i2) == 4) {
i--;
i2--;
if(c == c2 && i == i2)
continue;
if(c-'a' < 0 || c-'a' >= 2*TILES_COUNT)
continue;
if(c2-'a' < 0 || c2-'a' >= 2*TILES_COUNT)
continue;
if(i < 0 || i >= TILES_COUNT)
continue;
if(i2 < 0 || i2 >= TILES_COUNT)
continue;
/* Przesuwamy do puli */
if(c2-'a' >= TILES_COUNT) {
temp_tile = &pool[i2][c2-'a'-TILES_COUNT];
/* Miejsce musi być puste */
if(!is_empty(temp_tile))
continue;
/* Przesuwamy z pola gry */
if(c-'a' < TILES_COUNT)
temp_tile = &game[i][c-'a'];
/* Przesuwamy z puli */
else
temp_tile = &pool[i][c-'a'-TILES_COUNT];
/* Żródło nie może być puste */
if(is_empty(temp_tile))
continue;
move_tile(&pool[i2][c2-'a'-TILES_COUNT], temp_tile);
}
/* Przesuwamy na pole gry */
else {
temp_tile = &game[i2][c2-'a'];
/* Miejsce musi być puste */
if(!is_empty(temp_tile))
continue;
/* Przesuwamy z puli na pole gry */
if(c-'a' >= TILES_COUNT)
temp_tile = &pool[i][c-'a'-TILES_COUNT];
/* Przesuwamy z pola gry na pole gry */
else
temp_tile = &game[i][c-'a'];
/* Żródło nie może być puste */
if(is_empty(temp_tile))
continue;
move_tile(&game[i2][c2-'a'], temp_tile);
}
}
else if(sscanf(buf, "%c%d>pool", &c, &i) == 2 || sscanf(buf, "pool<%c%d", &c, &i) == 2) {
i--;
if(strcmp(&buf[2], ">pool") != 0) {
buf[5] = 0;
if(strcmp(buf, "pool<") != 0)
continue;
}
if(c-'a' < 0 || c-'a' >= TILES_COUNT)
continue;
if(i < 0 || i >= TILES_COUNT)
continue;
/* Żródło nie może być puste */
if(is_empty(&game[i][c-'a']))
continue;
/* Jeżeli źródło nie jest puste, to istnieją wolne miejsca w puli */
/* znajdujemy więc pierwsze wolne miejsce */
for(y=0;y<TILES_COUNT;y++) {
for(x=0;x<TILES_COUNT;x++) {
if(is_empty(&pool[x][y])) {
move_tile(&pool[x][y], &game[i][c-'a']);
break;
}
}
}
}
}
endwin();
return 0;
}
