Lines Matching refs:mp
62 MON *mp;
75 mp = op->sqr->desc->mon_desc;
76 names[num_mon] = (monops[num_mon]=mp)->name;
79 for (i = 0; i < mp->num_in; i++) {
118 MON *mp;
127 mp = mnp;
128 price = mp->h_cost * 50;
144 list_cur(mp);
147 for (i = 0; i < mp->num_in; i++) {
148 pp = mp->sq[i]->desc;
151 printf("%s (H):\n", mp->sq[i]->name);
157 mp->sq[i]->name, pp->houses);
166 if (mp->num_in == 3 &&
173 else if (mp->num_in == 2 && abs(result[0] - result[1]) > 1)
180 for (i = 0; i < mp->num_in; i++) {
209 for (i = 0; i < mp->num_in; i++)
210 mp->sq[i]->desc->houses = result[i];
222 MON *mp;
232 mp = op->sqr->desc->mon_desc;
233 names[num_mon] = (monops[num_mon]=mp)->name;
239 while (op->next && op->sqr->desc->mon_desc == mp
268 MON *mp;
274 mp = mnp;
275 price = mp->h_cost * 25;
278 list_cur(mp);
280 for (i = 0; i < mp->num_in; i++) {
281 pp = mp->sq[i]->desc;
284 printf("%s (0):\n", mp->sq[i]->name);
290 mp->sq[i]->name,pp->houses);
293 mp->sq[i]->name);
303 if (mp->num_in == 3 && (abs(temp[0] - temp[1]) > 1 ||
308 else if (mp->num_in == 2 && abs(temp[0] - temp[1]) > 1)
310 for (tot = i = 0; i < mp->num_in; i++)
317 for (tot = i = 0; i < mp->num_in; i++)
318 mp->sq[i]->desc->houses = temp[i];
324 list_cur(MON *mp)
329 for (i = 0; i < mp->num_in; i++) {
330 sqp = mp->sq[i];
378 ready_for_hotels(MON *mp)
382 for (i = 0; i < mp->num_in; i++) {
383 if (mp->sq[i]->desc->houses < 4)