Home
last modified time | relevance | path

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

/openbsd/games/monop/
H A Dhouses.c74 for (i = 0; i < mp->num_in; i++) { in buy_houses()
136 for (i = 0; i < mp->num_in; i++) { in buy_h()
155 if (mp->num_in == 3 && (abs(temp[0] - temp[1]) > 1 || in buy_h()
162 for (tot = tot2 = i = 0; i < mp->num_in; i++) { in buy_h()
190 for (tot = i = 0; i < mp->num_in; i++) in buy_h()
258 for (i = 0; i < mp->num_in; i++) { in sell_h()
279 if (mp->num_in == 3 && (abs(temp[0] - temp[1]) > 1 || in sell_h()
286 for (tot = i = 0; i < mp->num_in; i++) in sell_h()
293 for (tot = i = 0; i < mp->num_in; i++) in sell_h()
305 for (i = 0; i < mp->num_in; i++) { in list_cur()
[all …]
H A Dprop.c147 int i, num_in, cur_max; in bid() local
156 num_in = num_play; in bid()
157 while (num_in > 1 || (cur_max == 0 && num_in > 0)) { in bid()
165 if (--num_in == 0) in bid()
H A Dmisc.c223 printf("orig->num_in = %d\n", orig->num_in); in set_ownlist()
225 if (num == orig->num_in) in set_ownlist()
242 mp->num_own = mp->num_in; in is_monop()
243 for (i = 0; i < mp->num_in; i++) in is_monop()
256 for (i = 0; i < mp->num_in; i++) in isnot_monop()
H A Dmonop.h86 shrt num_in; /* # in monopoly */ member
H A Dmonop.c166 for (i = 0; i < mp->num_in; i++) in init_monops()
H A Dmon.dat35 /* name owner num_in num_own h_cost not_m mon_n sq */
/openbsd/lib/libcrypto/pem/
H A Dpem_info.c109 int num_in, ptype, raw; in STACK_OF() local
119 num_in = sk_X509_INFO_num(ret); in STACK_OF()
279 while (sk_X509_INFO_num(ret) > num_in) in STACK_OF()