Home
last modified time | relevance | path

Searched refs:num_in (Results 1 – 6 of 6) sorted by relevance

/dragonfly/games/monop/
H A Dhouses.c72 for (i = 0; i < mp->num_in; i++) { in buy_houses()
140 for (i = 0; i < mp->num_in; i++) { in buy_h()
159 if (mp->num_in == 3 && in buy_h()
173 for (i = 0; i < mp->num_in; i++) { in buy_h()
202 for (i = 0; i < mp->num_in; i++) in buy_h()
273 for (i = 0; i < mp->num_in; i++) { in sell_h()
296 if (mp->num_in == 3 && (abs(temp[0] - temp[1]) > 1 || in sell_h()
303 for (tot = i = 0; i < mp->num_in; i++) in sell_h()
310 for (tot = i = 0; i < mp->num_in; i++) in sell_h()
322 for (i = 0; i < mp->num_in; i++) { in list_cur()
[all …]
H A Dprop.c153 int i, num_in, cur_max; in bid() local
162 num_in = num_play; in bid()
163 while (num_in > 1 || (cur_max == 0 && num_in > 0)) { in bid()
172 if (--num_in == 0) in bid()
H A Dmisc.c216 printf("orig->num_in = %d\n", orig->num_in); in set_ownlist()
218 if (num == orig->num_in) in set_ownlist()
236 mp->num_own = mp->num_in; in is_monop()
237 for (i = 0; i < mp->num_in; i++) in is_monop()
251 for (i = 0; i < mp->num_in; i++) in is_not_monop()
H A Dmonop.c120 #define MONINIT(num_in, h_cost, not_m, mon_n, sq1,sq2,sq3) \ argument
121 {0, -1, num_in, 0, h_cost, not_m, mon_n, {sq1,sq2,sq3}, {0,0,0}}
345 for (i = 0; i < mp->num_in; i++) in init_monops()
H A Dmonop.h85 short num_in; /* # in monopoly */ member
/dragonfly/crypto/libressl/crypto/pem/
H A Dpem_info.c108 int num_in, ptype, raw; in STACK_OF() local
118 num_in = sk_X509_INFO_num(ret); in STACK_OF()
278 while (sk_X509_INFO_num(ret) > num_in) in STACK_OF()