Freeciv-3.3: /fast/freeciv/nightly/main/server/advisors/autoworkers.c Source File

Freeciv-3.3

Loading...
Searching...
No Matches
autoworkers.c
Go to the documentation of this file.
1/***********************************************************************
2 Freeciv - Copyright (C) 1996 - A Kjeldberg, L Gregersen, P Unold
3 This program is free software; you can redistribute it and/or modify
4 it under the terms of the GNU General Public License as published by
5 the Free Software Foundation; either version 2, or (at your option)
6 any later version.
7
8 This program is distributed in the hope that it will be useful,
9 but WITHOUT ANY WARRANTY; without even the implied warranty of
10 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 GNU General Public License for more details.
12***********************************************************************/
13
14#ifdef HAVE_CONFIG_H
15#include <fc_config.h>
16#endif
17
18#include <math.h>
19#include <stdio.h>
20#include <string.h>
21
22/* utility */
23#include "log.h"
24#include "mem.h"
25#include "support.h"
26#include "timing.h"
27
28/* common */
29#include "ai.h"
30#include "city.h"
31#include "game.h"
32#include "government.h"
33#include "map.h"
34#include "movement.h"
35#include "nation.h"
36#include "packets.h"
37#include "unitlist.h"
38
39/* common/aicore */
40#include "citymap.h"
41#include "path_finding.h"
42#include "pf_tools.h"
43
44/* server */
45#include "citytools.h"
46#include "maphand.h"
47#include "plrhand.h"
48#include "srv_log.h"
49#include "unithand.h"
50#include "unittools.h"
51
52/* server/advisors */
53#include "advbuilding.h"
54#include "advdata.h"
55#include "advgoto.h"
56#include "advtools.h"
57#include "infracache.h"
58
59/* ai */
60#include "handicaps.h"
61
62#include "autoworkers.h"
63
64/* This factor is multiplied on when calculating the want. This is done
65 * to avoid rounding errors in comparisons when looking for the best
66 * possible work. However before returning the final want we have to
67 * divide by it again. This loses accuracy but is needed since the want
68 * values are used for comparison by the AI in trying to calculate the
69 * goodness of building worker units. */
70#define WORKER_FACTOR 1024
71
72 struct workermap {
73 int enroute; /* Unit ID of worker en route to this tile */
74 int eta; /* Estimated number of turns until enroute arrives */
75};
76
77 action_id aw_actions_transform[MAX_NUM_ACTIONS];
78 action_id aw_actions_extra[MAX_NUM_ACTIONS];
79 action_id aw_actions_rmextra[MAX_NUM_ACTIONS];
80
81 static struct timer *aw_timer = NULL;
82
83/**********************************************************************/
86 void adv_workers_free(void)
87{
88 timer_destroy(aw_timer);
89 aw_timer = NULL;
90}
91
92/**********************************************************************/
95 void auto_workers_ruleset_init(void)
96{
97 int i;
98
99 i = 0;
100 action_array_add_all_by_result(aw_actions_transform, &i,
101 ACTRES_CULTIVATE);
102 action_array_add_all_by_result(aw_actions_transform, &i,
103 ACTRES_PLANT);
104 action_array_add_all_by_result(aw_actions_transform, &i,
105 ACTRES_TRANSFORM_TERRAIN);
106 action_array_end(aw_actions_transform, i);
107
108 i = 0;
109 action_array_add_all_by_result(aw_actions_extra, &i,
110 ACTRES_IRRIGATE);
111 action_array_add_all_by_result(aw_actions_extra, &i,
112 ACTRES_MINE);
113 action_array_add_all_by_result(aw_actions_extra, &i,
114 ACTRES_ROAD);
115 action_array_add_all_by_result(aw_actions_extra, &i,
116 ACTRES_BASE);
117 action_array_end(aw_actions_extra, i);
118
119 i = 0;
120 action_array_add_all_by_result(aw_actions_rmextra, &i,
121 ACTRES_CLEAN);
122 /* We could have ACTRES_PILLAGE here, but currently we don't */
123 action_array_end(aw_actions_rmextra, i);
124}
125
126/**********************************************************************/
132 adv_want adv_workers_road_bonus(const struct civ_map *nmap,
133 struct tile *ptile, struct road_type *proad)
134{
135#define MAX_DEP_ROADS 5
136
137 int bonus = 0, i;
138 bool potential_road[12], real_road[12], is_slow[12];
139 int dx[12] = {-1, 0, 1, -1, 1, -1, 0, 1, 0, -2, 2, 0};
140 int dy[12] = {-1, -1, -1, 0, 0, 1, 1, 1, -2, 0, 0, 2};
141 int x, y;
142 int rnbr;
143 struct road_type *pdep_roads[MAX_DEP_ROADS];
144 int dep_rnbr[MAX_DEP_ROADS];
145 int dep_count = 0;
146 struct extra_type *pextra;
147
148 if (proad == NULL) {
149 return 0;
150 }
151
152 rnbr = road_number(proad);
153 pextra = road_extra_get(proad);
154
155 road_deps_iterate(&(pextra->reqs), pdep) {
156 if (dep_count < MAX_DEP_ROADS) {
157 pdep_roads[dep_count] = pdep;
158 dep_rnbr[dep_count++] = road_number(pdep);
159 }
160 } road_deps_iterate_end;
161
162 index_to_map_pos(&x, &y, tile_index(ptile));
163 for (i = 0; i < 12; i++) {
164 struct tile *tile1 = map_pos_to_tile(nmap, x + dx[i], y + dy[i]);
165
166 if (!tile1) {
167 real_road[i] = FALSE;
168 potential_road[i] = FALSE;
169 is_slow[i] = FALSE; /* FIXME: should be TRUE? */
170 } else {
171 int build_time = terrain_extra_build_time(tile_terrain(tile1), ACTIVITY_GEN_ROAD, pextra);
172 int j;
173
174 real_road[i] = tile_has_road(tile1, proad);
175 potential_road[i] = real_road[i];
176 for (j = 0 ; !potential_road[i] && j < dep_count ; j++) {
177 potential_road[i] = tile_has_road(tile1, pdep_roads[j]);
178 }
179
180 /* If TRUE, this value indicates that this tile does not need
181 * a road connector. This is set for terrains which cannot have
182 * road or where road takes "too long" to build. */
183 is_slow[i] = (build_time == 0 || build_time > 5);
184
185 if (!real_road[i]) {
186 unit_list_iterate(tile1->units, punit) {
187 if (punit->activity == ACTIVITY_GEN_ROAD) {
188 /* If a road, or its dependency is being built here, consider as if it's already
189 * built. */
190 int build_rnbr;
191
192 fc_assert(punit->activity_target != NULL);
193
194 build_rnbr = road_number(extra_road_get(punit->activity_target));
195
196 if (build_rnbr == rnbr) {
197 real_road[i] = TRUE;
198 potential_road[i] = TRUE;
199 }
200 for (j = 0 ; !potential_road[i] && j < dep_count ; j++) {
201 if (build_rnbr == dep_rnbr[j]) {
202 potential_road[i] = TRUE;
203 }
204 }
205 }
206 } unit_list_iterate_end;
207 }
208 }
209 }
210
211 if (current_topo_has_flag(TF_HEX)) {
212 /* On hex map, road is always a benefit */
213 bonus += 20; /* Later divided by 20 */
214
215 /* Road is more valuable when even longer road around does not exist. */
216 for (i = 0; i < 12; i++) {
217 if (!real_road[i]) {
218 bonus += 3;
219 }
220 }
221
222 /* Scale down the bonus. */
223 bonus /= 20;
224 } else {
225 /*
226 * Consider the following tile arrangement (numbered in hex):
227 *
228 * 8
229 * 012
230 * 93 4A
231 * 567
232 * B
233 *
234 * these are the tiles defined by the (dx,dy) arrays above.
235 *
236 * Then the following algorithm is supposed to determine if it's a good
237 * idea to build a road here. Note this won't work well for hex maps
238 * since the (dx,dy) arrays will not cover the same tiles.
239 *
240 * FIXME: if you can understand the algorithm below please rewrite this
241 * explanation!
242 */
243 if (potential_road[0]
244 && !real_road[1] && !real_road[3]
245 && (!real_road[2] || !real_road[8])
246 && (!is_slow[2] || !is_slow[4] || !is_slow[7]
247 || !is_slow[6] || !is_slow[5])) {
248 bonus++;
249 }
250 if (potential_road[2]
251 && !real_road[1] && !real_road[4]
252 && (!real_road[7] || !real_road[10])
253 && (!is_slow[0] || !is_slow[3] || !is_slow[7]
254 || !is_slow[6] || !is_slow[5])) {
255 bonus++;
256 }
257 if (potential_road[5]
258 && !real_road[6] && !real_road[3]
259 && (!real_road[5] || !real_road[11])
260 && (!is_slow[2] || !is_slow[4] || !is_slow[7]
261 || !is_slow[1] || !is_slow[0])) {
262 bonus++;
263 }
264 if (potential_road[7]
265 && !real_road[6] && !real_road[4]
266 && (!real_road[0] || !real_road[9])
267 && (!is_slow[2] || !is_slow[3] || !is_slow[0]
268 || !is_slow[1] || !is_slow[5])) {
269 bonus++;
270 }
271
272 /* A
273 * B*B
274 * CCC
275 *
276 * We are at tile *. If tile A has a road, and neither B tile does, and
277 * one C tile is a valid destination, then we might want a road here.
278 *
279 * Of course the same logic applies if you rotate the diagram.
280 */
281 if (potential_road[1] && !real_road[4] && !real_road[3]
282 && (!is_slow[5] || !is_slow[6] || !is_slow[7])) {
283 bonus++;
284 }
285 if (potential_road[3] && !real_road[1] && !real_road[6]
286 && (!is_slow[2] || !is_slow[4] || !is_slow[7])) {
287 bonus++;
288 }
289 if (potential_road[4] && !real_road[1] && !real_road[6]
290 && (!is_slow[0] || !is_slow[3] || !is_slow[5])) {
291 bonus++;
292 }
293 if (potential_road[6] && !real_road[4] && !real_road[3]
294 && (!is_slow[0] || !is_slow[1] || !is_slow[2])) {
295 bonus++;
296 }
297 }
298
299 return bonus;
300}
301
302/**********************************************************************/
308 static void consider_worker_action(const struct player *pplayer,
309 enum unit_activity act,
310 struct extra_type *target,
311 adv_want extra,
312 adv_want new_tile_value,
313 adv_want old_tile_value,
314 bool in_use, int delay,
315 adv_want *best_value,
316 adv_want *best_old_tile_value,
317 int *best_extra,
318 bool *improve_worked,
319 int *best_delay,
320 enum unit_activity *best_act,
321 struct extra_type **best_target,
322 struct tile **best_tile,
323 struct tile *ptile)
324{
325 bool improves;
326 adv_want total_value = 0;
327 adv_want base_value = 0;
328 int old_improvement_value;
329
330 fc_assert(act != ACTIVITY_LAST);
331
332 if (extra < 0) {
333 extra = 0;
334 }
335
336 if (new_tile_value > old_tile_value) {
337 improves = TRUE;
338 } else if (ADV_WANTS_EQ(new_tile_value, old_tile_value) && extra > 0) {
339 improves = TRUE;
340 } else {
341 improves = FALSE;
342 }
343
344 /* find the present value of the future benefit of this action */
345 if (improves || extra > 0) {
346 if (!(*improve_worked) && !in_use) {
347 /* Going to improve tile that is not yet in use.
348 * Getting the best possible total for next citizen to work on is more
349 * important than amount tile gets improved. */
350 if (improves && (new_tile_value > *best_value
351 || (ADV_WANTS_EQ(new_tile_value, *best_value)
352 && old_tile_value < *best_old_tile_value))) {
353 *best_value = new_tile_value;
354 *best_old_tile_value = old_tile_value;
355 *best_extra = extra;
356 *best_act = act;
357 *best_target = target;
358 *best_tile = ptile;
359 *best_delay = delay;
360 }
361
362 return;
363 }
364
365 /* At least one of the previous best or current tile is in use
366 * Prefer the tile that gets improved more, regardless of
367 * the resulting total */
368
369 base_value = new_tile_value - old_tile_value;
370 total_value = base_value * WORKER_FACTOR;
371 if (!in_use) {
372 total_value /= 2;
373 }
374 total_value += extra * WORKER_FACTOR;
375
376 /* Use factor to prevent rounding errors */
377 total_value = amortize(total_value, delay);
378
379 if (*improve_worked) {
380 old_improvement_value = *best_value;
381 } else {
382 /* Convert old best_value to improvement value compatible with in_use
383 * tile value */
384 old_improvement_value = amortize((*best_value - *best_old_tile_value) * WORKER_FACTOR / 2,
385 *best_delay);
386 }
387
388 if (total_value > old_improvement_value
389 || (ADV_WANTS_EQ(total_value, old_improvement_value)
390 && old_tile_value > *best_old_tile_value)) {
391 if (in_use) {
392 *best_value = total_value;
393 *improve_worked = TRUE;
394 } else {
395 *best_value = new_tile_value;
396 *improve_worked = FALSE;
397 }
398 *best_old_tile_value = old_tile_value;
399 *best_extra = extra;
400 *best_act = act;
401 *best_target = target;
402 *best_tile = ptile;
403 *best_delay = delay;
404 }
405 }
406}
407
408/**********************************************************************/
411static enum tile_behavior
412autoworker_tile_behavior(const struct tile *ptile,
413 enum known_type known,
414 const struct pf_parameter *param)
415{
416 const struct player *owner = tile_owner(ptile);
417
418 if (NULL != owner && !pplayers_allied(owner, param->owner)) {
419 return TB_IGNORE;
420 }
421
422 return TB_NORMAL;
423}
424
425/**********************************************************************/
442 adv_want worker_evaluate_improvements(const struct civ_map *nmap,
443 struct unit *punit,
444 enum unit_activity *best_act,
445 struct extra_type **best_target,
446 struct tile **best_tile,
447 struct pf_path **path,
448 struct workermap *state)
449{
450 const struct player *pplayer = unit_owner(punit);
451 struct pf_parameter parameter;
452 struct pf_map *pfm;
453 struct pf_position pos;
454 adv_want oldv; /* Current value of consideration tile. */
455 adv_want best_oldv = 9999; /* oldv of best target so far; compared if
456 * newv == best_newv; not initialized to zero,
457 * so that newv = 0 activities are not chosen. */
458 adv_want best_newv = 0;
459 bool improve_worked = FALSE;
460 int best_extra = 0;
461 int best_delay = 0;
462
463 /* Closest worker, if any, headed towards target tile */
464 struct unit *enroute = NULL;
465
466 pft_fill_unit_parameter(&parameter, nmap, punit);
467 parameter.omniscience = !has_handicap(pplayer, H_MAP);
468 parameter.get_TB = autoworker_tile_behavior;
469 pfm = pf_map_new(&parameter);
470
471 city_list_iterate(pplayer->cities, pcity) {
472 struct tile *pcenter = city_tile(pcity);
473
474 /* Try to work near the city */
475 city_tile_iterate_index(nmap, city_map_radius_sq_get(pcity), pcenter, ptile,
476 cindex) {
477 bool consider = TRUE;
478 bool in_use = (tile_worked(ptile) == pcity);
479
480 if (!in_use && !city_can_work_tile(pcity, ptile)) {
481 /* Don't risk bothering with this tile. */
482 continue;
483 }
484
485 if (!adv_worker_safe_tile(nmap, pplayer, punit, ptile)) {
486 /* Too dangerous place */
487 continue;
488 }
489
490 /* Do not go to tiles that already have workers there. */
491 unit_list_iterate(ptile->units, aunit) {
492 if (unit_owner(aunit) == pplayer
493 && aunit->id != punit->id
494 && unit_has_type_flag(aunit, UTYF_WORKERS)) {
495 consider = FALSE;
496 }
497 } unit_list_iterate_end;
498
499 if (!consider) {
500 continue;
501 }
502
503 if (state) {
504 enroute = player_unit_by_number(pplayer,
505 state[tile_index(ptile)].enroute);
506 }
507
508 if (pf_map_position(pfm, ptile, &pos)) {
509 int eta = FC_INFINITY, inbound_distance = FC_INFINITY, turns;
510
511 if (enroute) {
512 eta = state[tile_index(ptile)].eta;
513 inbound_distance = real_map_distance(ptile, unit_tile(enroute));
514 }
515
516 /* Only consider this tile if we are closer in time and space to
517 * it than our other worker (if any) travelling to the site. */
518 if ((enroute && enroute->id == punit->id)
519 || pos.turn < eta
520 || (pos.turn == eta
521 && (real_map_distance(ptile, unit_tile(punit))
522 < inbound_distance))) {
523
524 if (enroute) {
525 UNIT_LOG(LOG_DEBUG, punit,
526 "Considering (%d, %d) because we're closer "
527 "(%d, %d) than %d (%d, %d)",
528 TILE_XY(ptile), pos.turn,
529 real_map_distance(ptile, unit_tile(punit)),
530 enroute->id, eta, inbound_distance);
531 }
532
533 oldv = city_tile_value(pcity, ptile, 0, 0);
534
535 /* Now, consider various activities... */
536 aw_transform_action_iterate(act) {
537 struct extra_type *target = NULL;
538 enum extra_cause cause =
539 activity_to_extra_cause(action_id_get_activity(act));
540 enum extra_rmcause rmcause =
541 activity_to_extra_rmcause(action_id_get_activity(act));
542
543 if (cause != EC_NONE) {
544 target = next_extra_for_tile(ptile, cause, pplayer,
545 punit);
546 } else if (rmcause != ERM_NONE) {
547 target = prev_extra_in_tile(ptile, rmcause, pplayer,
548 punit);
549 }
550
551 if (adv_city_worker_act_get(pcity, cindex,
552 action_id_get_activity(act)) >= 0
553 && action_prob_possible(
554 action_speculate_unit_on_tile(act,
555 punit, unit_home(punit),
556 ptile,
557 parameter.omniscience,
558 ptile, target))) {
559 adv_want base_value
560 = adv_city_worker_act_get(pcity, cindex,
561 action_id_get_activity(act));
562
563 turns = pos.turn
564 + get_turns_for_activity_at(punit,
565 action_id_get_activity(act),
566 ptile, target);
567 if (pos.moves_left == 0) {
568 /* We need moves left to begin activity immediately. */
569 turns++;
570 }
571
572 consider_worker_action(pplayer,
573 action_id_get_activity(act),
574 target, 0.0, base_value,
575 oldv, in_use, turns,
576 &best_newv, &best_oldv, &best_extra,
577 &improve_worked,
578 &best_delay, best_act, best_target,
579 best_tile, ptile);
580
581 } /* endif: can the worker perform this action */
582 } aw_transform_action_iterate_end;
583
584 extra_type_iterate(pextra) {
585 enum unit_activity act = ACTIVITY_LAST;
586 enum unit_activity eval_act = ACTIVITY_LAST;
587 adv_want base_value;
588 bool removing = tile_has_extra(ptile, pextra);
589
590 if (removing) {
591 aw_rmextra_action_iterate(try_act) {
592 struct action *taction = action_by_number(try_act);
593 if (is_extra_removed_by_action(pextra, taction)) {
594 /* We do not even evaluate actions we can't do.
595 * Removal is not considered prerequisite for anything */
596 if (action_prob_possible(
597 action_speculate_unit_on_tile(try_act,
598 punit,
599 unit_home(punit),
600 ptile,
601 parameter.omniscience,
602 ptile, pextra))) {
603 act = action_get_activity(taction);
604 eval_act = action_get_activity(taction);
605 break;
606 }
607 }
608 } aw_rmextra_action_iterate_end;
609 } else {
610 aw_extra_action_iterate(try_act) {
611 struct action *taction = action_by_number(try_act);
612 if (is_extra_caused_by_action(pextra, taction)) {
613 eval_act = action_id_get_activity(try_act);
614 if (action_prob_possible(
615 action_speculate_unit_on_tile(try_act,
616 punit,
617 unit_home(punit),
618 ptile,
619 parameter.omniscience,
620 ptile, pextra))) {
621 act = action_get_activity(taction);
622 break;
623 }
624 }
625 } aw_extra_action_iterate_end;
626 }
627
628 if (eval_act == ACTIVITY_LAST) {
629 /* No activity can provide (or remove) the extra */
630 continue;
631 }
632
633 if (removing) {
634 base_value = adv_city_worker_rmextra_get(pcity, cindex, pextra);
635 } else {
636 base_value = adv_city_worker_extra_get(pcity, cindex, pextra);
637 }
638
639 if (base_value >= 0) {
640 adv_want extra;
641 struct road_type *proad;
642
643 turns = pos.turn + get_turns_for_activity_at(punit, eval_act,
644 ptile, pextra);
645 if (pos.moves_left == 0) {
646 /* We need moves left to begin activity immediately. */
647 turns++;
648 }
649
650 proad = extra_road_get(pextra);
651
652 if (proad != NULL && road_provides_move_bonus(proad)) {
653 int mc_multiplier = 1;
654 int mc_divisor = 1;
655 int old_move_cost = tile_terrain(ptile)->movement_cost * SINGLE_MOVE;
656
657 /* Here 'old' means actually 'without the evaluated': In case of
658 * removal activity it's the value after the removal. */
659
660 extra_type_by_cause_iterate(EC_ROAD, pold) {
661 if (tile_has_extra(ptile, pold) && pold != pextra) {
662 struct road_type *po_road = extra_road_get(pold);
663
664 /* This ignores the fact that new road may be native to units that
665 * old road is not. */
666 if (po_road->move_cost < old_move_cost) {
667 old_move_cost = po_road->move_cost;
668 }
669 }
670 } extra_type_by_cause_iterate_end;
671
672 if (proad->move_cost < old_move_cost) {
673 if (proad->move_cost >= terrain_control.move_fragments) {
674 mc_divisor = proad->move_cost / terrain_control.move_fragments;
675 } else {
676 if (proad->move_cost == 0) {
677 mc_multiplier = 2;
678 } else {
679 mc_multiplier = 1 - proad->move_cost;
680 }
681 mc_multiplier += old_move_cost;
682 }
683 }
684
685 extra = adv_workers_road_bonus(nmap, ptile, proad)
686 * mc_multiplier / mc_divisor;
687
688 } else {
689 extra = 0;
690 }
691
692 if (extra_has_flag(pextra, EF_GLOBAL_WARMING)) {
693 extra -= pplayer->ai_common.warmth;
694 }
695 if (extra_has_flag(pextra, EF_NUCLEAR_WINTER)) {
696 extra -= pplayer->ai_common.frost;
697 }
698
699 if (removing) {
700 extra = -extra;
701 }
702
703 if (act != ACTIVITY_LAST) {
704 consider_worker_action(pplayer, act, pextra, extra, base_value,
705 oldv, in_use, turns,
706 &best_newv, &best_oldv, &best_extra,
707 &improve_worked,
708 &best_delay, best_act, best_target,
709 best_tile, ptile);
710 } else {
711 fc_assert(!removing);
712
713 road_deps_iterate(&(pextra->reqs), pdep) {
714 struct extra_type *dep_tgt;
715
716 dep_tgt = road_extra_get(pdep);
717
718 if (action_prob_possible(
719 action_speculate_unit_on_tile(ACTION_ROAD,
720 punit, unit_home(punit), ptile,
721 parameter.omniscience,
722 ptile, dep_tgt))) {
723 /* Consider building dependency road for later upgrade to target extra.
724 * Here we set value to be sum of dependency
725 * road and target extra values, which increases want, and turns is sum
726 * of dependency and target build turns, which decreases want. This can
727 * result in either bigger or lesser want than when checking dependency
728 * road for the sake of itself when its turn in extra_type_iterate() is. */
729 int dep_turns
730 = turns + get_turns_for_activity_at(punit,
731 ACTIVITY_GEN_ROAD,
732 ptile, dep_tgt);
733 adv_want dep_value
734 = base_value + adv_city_worker_extra_get(pcity, cindex,
735 dep_tgt);
736
737 consider_worker_action(pplayer, ACTIVITY_GEN_ROAD,
738 dep_tgt, extra, dep_value,
739 oldv, in_use, dep_turns,
740 &best_newv, &best_oldv, &best_extra,
741 &improve_worked,
742 &best_delay, best_act, best_target,
743 best_tile, ptile);
744 }
745 } road_deps_iterate_end;
746
747 extra_deps_iterate(&(pextra->reqs), pdep) {
748 /* Roads handled above already */
749 if (!is_extra_caused_by(pdep, EC_ROAD)) {
750 enum unit_activity eval_dep_act = ACTIVITY_LAST;
751 action_id eval_dep_action;
752
753 aw_extra_action_iterate(try_act) {
754 struct action *taction = action_by_number(try_act);
755
756 if (is_extra_caused_by_action(pdep, taction)) {
757 eval_dep_action = try_act;
758 eval_dep_act = action_id_get_activity(try_act);
759 break;
760 }
761 } aw_extra_action_iterate_end;
762
763 if (eval_dep_act != ACTIVITY_LAST) {
764 if (action_prob_possible(
765 action_speculate_unit_on_tile(eval_dep_action,
766 punit, unit_home(punit), ptile,
767 parameter.omniscience,
768 ptile, pdep))) {
769 /* Consider building dependency extra for later upgrade to
770 * target extra. See similar road implementation above for
771 * extended commentary. */
772 int dep_turns
773 = turns + get_turns_for_activity_at(punit,
774 eval_dep_act,
775 ptile, pdep);
776 adv_want dep_value
777 = base_value + adv_city_worker_extra_get(pcity,
778 cindex,
779 pdep);
780
781 consider_worker_action(pplayer, eval_dep_act, pdep,
782 0.0, dep_value, oldv, in_use,
783 dep_turns, &best_newv,
784 &best_oldv,
785 &best_extra, &improve_worked,
786 &best_delay,
787 best_act, best_target,
788 best_tile, ptile);
789 }
790 }
791 }
792 } extra_deps_iterate_end;
793 }
794 }
795 } extra_type_iterate_end;
796 } /* endif: can we arrive sooner than current worker, if any? */
797 } /* endif: are we travelling to a legal destination? */
798 } city_tile_iterate_index_end;
799 } city_list_iterate_end;
800
801 if (!improve_worked) {
802 /* best_newv contains total value of improved tile. Check amount
803 * of improvement instead. */
804 best_newv = amortize((best_newv - best_oldv + best_extra) * WORKER_FACTOR,
805 best_delay);
806 }
807 best_newv /= WORKER_FACTOR;
808
809 best_newv = MAX(best_newv, 0); /* sanity */
810
811 if (best_newv > 0) {
812 log_debug("Worker %d@(%d,%d) wants to %s at (%d,%d) with desire "
813 ADV_WANT_PRINTF,
814 punit->id, TILE_XY(unit_tile(punit)),
815 get_activity_text(*best_act), TILE_XY(*best_tile), best_newv);
816 } else {
817 /* Fill in dummy values. The callers should check if the return value
818 * is > 0 but this will avoid confusing them. */
819 *best_act = ACTIVITY_IDLE;
820 *best_tile = NULL;
821 }
822
823 if (path) {
824 *path = *best_tile ? pf_map_path(pfm, *best_tile) : NULL;
825 }
826
827 pf_map_destroy(pfm);
828
829 return best_newv;
830}
831
832/**********************************************************************/
835 struct city *worker_evaluate_city_requests(struct unit *punit,
836 struct worker_task **best_task,
837 struct pf_path **path,
838 struct workermap *state)
839{
840 const struct player *pplayer = unit_owner(punit);
841 struct pf_parameter parameter;
842 struct pf_map *pfm;
843 struct pf_position pos;
844 int best_value = -1;
845 struct worker_task *best = NULL;
846 struct city *taskcity = NULL;
847 int dist = FC_INFINITY;
848 const struct civ_map *nmap = &(wld.map);
849
850 pft_fill_unit_parameter(&parameter, nmap, punit);
851 parameter.omniscience = !has_handicap(pplayer, H_MAP);
852 parameter.get_TB = autoworker_tile_behavior;
853 pfm = pf_map_new(&parameter);
854
855 /* Have nearby cities requests? */
856 city_list_iterate(pplayer->cities, pcity) {
857 worker_task_list_iterate(pcity->task_reqs, ptask) {
858 bool consider = TRUE;
859
860 /* Do not go to tiles that already have workers there. */
861 unit_list_iterate(ptask->ptile->units, aunit) {
862 if (unit_owner(aunit) == pplayer
863 && aunit->id != punit->id
864 && unit_has_type_flag(aunit, UTYF_WORKERS)) {
865 consider = FALSE;
866 }
867 } unit_list_iterate_end;
868
869 if (consider
870 && auto_workers_speculate_can_act_at(punit, ptask->act,
871 parameter.omniscience,
872 ptask->tgt, ptask->ptile)) {
873 /* Closest worker, if any, headed towards target tile */
874 struct unit *enroute = NULL;
875
876 if (state) {
877 enroute = player_unit_by_number(pplayer,
878 state[tile_index(ptask->ptile)].enroute);
879 }
880
881 if (pf_map_position(pfm, ptask->ptile, &pos)) {
882 int value = (ptask->want + 1) * 10 / (pos.turn + 1);
883
884 if (value > best_value) {
885 int eta = FC_INFINITY, inbound_distance = FC_INFINITY;
886
887 if (enroute) {
888 eta = state[tile_index(ptask->ptile)].eta;
889 inbound_distance = real_map_distance(ptask->ptile, unit_tile(enroute));
890 }
891
892 /* Only consider this tile if we are closer in time and space to
893 * it than our other worker (if any) travelling to the site. */
894 if (pos.turn < dist
895 && ((enroute && enroute->id == punit->id)
896 || pos.turn < eta
897 || (pos.turn == eta
898 && (real_map_distance(ptask->ptile, unit_tile(punit))
899 < inbound_distance)))) {
900 dist = pos.turn;
901 best = ptask;
902 best_value = value;
903 taskcity = pcity;
904 }
905 }
906 }
907 }
908 } worker_task_list_iterate_end;
909 } city_list_iterate_end;
910
911 *best_task = best;
912
913 if (path != NULL) {
914 *path = best ? pf_map_path(pfm, best->ptile) : NULL;
915 }
916
917 pf_map_destroy(pfm);
918
919 return taskcity;
920}
921
922/**********************************************************************/
925#define LOG_WORKER LOG_DEBUG
926 void auto_worker_findwork(const struct civ_map *nmap,
927 struct player *pplayer,
928 struct unit *punit,
929 struct workermap *state,
930 int recursion)
931{
932 struct worker_task *best_task;
933 enum unit_activity best_act;
934 struct tile *best_tile = NULL;
935 struct extra_type *best_target;
936 struct pf_path *path = NULL;
937 struct city *taskcity;
938
939 /* Time it will take worker to complete its given task */
940 int completion_time = 0;
941
942 /* Terminate what might be an inifite recursion of two units
943 * displacing each other, but leave enough space for
944 * finite recursion. */
945 if (recursion > 5
946 && recursion > unit_list_size(pplayer->units) * 1.5) {
947 log_warn("Workers displacing each other recursing too much.");
948
949 adv_unit_new_task(punit, AUT_NONE, NULL);
950 set_unit_activity(punit, ACTIVITY_IDLE, ACTION_NONE);
951 send_unit_info(NULL, punit);
952
953 return; /* Avoid further recursion. */
954 }
955
956 CHECK_UNIT(punit);
957
958 fc_assert_ret(pplayer && punit);
959 fc_assert_ret(unit_is_cityfounder(punit)
960 || unit_has_type_flag(punit, UTYF_WORKERS));
961
962 /* Have nearby cities requests? */
963
964 taskcity = worker_evaluate_city_requests(punit, &best_task, &path, state);
965
966 if (taskcity != NULL) {
967 if (path != NULL) {
968 completion_time = pf_path_last_position(path)->turn;
969 }
970
971 adv_unit_new_task(punit, AUT_AUTO_WORKER, best_tile);
972
973 best_target = best_task->tgt;
974
975 if (auto_worker_setup_work(nmap, pplayer, punit, state, recursion,
976 path, best_task->ptile, best_task->act,
977 &best_target, completion_time)) {
978 clear_worker_task(taskcity, best_task);
979 }
980
981 if (path != NULL) {
982 pf_path_destroy(path);
983 }
984
985 return;
986 }
987
988 /*** Try find some work ***/
989
990 if (unit_has_type_flag(punit, UTYF_WORKERS)) {
991 TIMING_LOG(AIT_WORKERS, TIMER_START);
992 worker_evaluate_improvements(nmap, punit, &best_act, &best_target,
993 &best_tile, &path, state);
994 if (path) {
995 completion_time = pf_path_last_position(path)->turn;
996 }
997 TIMING_LOG(AIT_WORKERS, TIMER_STOP);
998
999 adv_unit_new_task(punit, AUT_AUTO_WORKER, best_tile);
1000
1001 auto_worker_setup_work(nmap, pplayer, punit, state, recursion, path,
1002 best_tile, best_act, &best_target,
1003 completion_time);
1004
1005 if (NULL != path) {
1006 pf_path_destroy(path);
1007 }
1008 }
1009}
1010
1011/**********************************************************************/
1015 bool auto_worker_setup_work(const struct civ_map *nmap,
1016 struct player *pplayer, struct unit *punit,
1017 struct workermap *state, int recursion,
1018 struct pf_path *path,
1019 struct tile *best_tile,
1020 enum unit_activity best_act,
1021 struct extra_type **best_target,
1022 int completion_time)
1023{
1024 /* Run the "autoworker" program */
1025 if (punit->server.adv->task == AUT_AUTO_WORKER) {
1026 struct pf_map *pfm = NULL;
1027 struct pf_parameter parameter;
1028 bool working = FALSE;
1029 struct unit *displaced;
1030
1031 if (!best_tile) {
1032 UNIT_LOG(LOG_DEBUG, punit, "giving up trying to improve terrain");
1033 return FALSE; /* We cannot do anything */
1034 }
1035
1036 /* Mark the square as taken. */
1037 displaced = player_unit_by_number(pplayer,
1038 state[tile_index(best_tile)].enroute);
1039
1040 if (displaced) {
1041 fc_assert(state[tile_index(best_tile)].enroute == displaced->id);
1042 fc_assert(state[tile_index(best_tile)].eta > completion_time
1043 || (state[tile_index(best_tile)].eta == completion_time
1044 && (real_map_distance(best_tile, unit_tile(punit))
1045 < real_map_distance(best_tile,
1046 unit_tile(displaced)))));
1047 UNIT_LOG(displaced->server.debug ? LOG_AI_TEST : LOG_DEBUG, punit,
1048 "%d (%d,%d) has displaced %d (%d,%d) for worksite %d,%d",
1049 punit->id, completion_time,
1050 real_map_distance(best_tile, unit_tile(punit)),
1051 displaced->id, state[tile_index(best_tile)].eta,
1052 real_map_distance(best_tile, unit_tile(displaced)),
1053 TILE_XY(best_tile));
1054 }
1055
1056 state[tile_index(best_tile)].enroute = punit->id;
1057 state[tile_index(best_tile)].eta = completion_time;
1058
1059 if (displaced) {
1060 struct tile *goto_tile = punit->goto_tile;
1061 int saved_id = punit->id;
1062 struct tile *old_pos = unit_tile(punit);
1063
1064 displaced->goto_tile = NULL;
1065 auto_worker_findwork(nmap, pplayer, displaced, state, recursion + 1);
1066 if (NULL == player_unit_by_number(pplayer, saved_id)) {
1067 /* Actions of the displaced worker somehow caused this worker
1068 * to die. (maybe by recursively giving control back to this unit)
1069 */
1070 return FALSE;
1071 }
1072 if (goto_tile != punit->goto_tile || old_pos != unit_tile(punit)
1073 || punit->activity != ACTIVITY_IDLE) {
1074 /* Actions of the displaced worker somehow caused this worker
1075 * to get a new job, or to already move toward current job.
1076 * (A displaced B, B displaced C, C displaced A)
1077 */
1078 UNIT_LOG(LOG_DEBUG, punit,
1079 "%d itself acted due to displacement recursion. "
1080 "Was going from (%d, %d) to (%d, %d). "
1081 "Now heading from (%d, %d) to (%d, %d).",
1082 punit->id,
1083 TILE_XY(old_pos), TILE_XY(goto_tile),
1084 TILE_XY(unit_tile(punit)), TILE_XY(punit->goto_tile));
1085 return FALSE;
1086 }
1087 }
1088
1089 UNIT_LOG(LOG_DEBUG, punit,
1090 "is heading to do %s(%s) at (%d, %d)",
1091 unit_activity_name(best_act),
1092 best_target && *best_target ? extra_rule_name(*best_target) : "-",
1093 TILE_XY(best_tile));
1094
1095 if (!path) {
1096 pft_fill_unit_parameter(&parameter, nmap, punit);
1097 parameter.omniscience = !has_handicap(pplayer, H_MAP);
1098 parameter.get_TB = autoworker_tile_behavior;
1099 pfm = pf_map_new(&parameter);
1100 path = pf_map_path(pfm, best_tile);
1101 }
1102
1103 if (path) {
1104 bool alive;
1105
1106 alive = adv_follow_path(punit, path, best_tile);
1107
1108 if (alive && same_pos(unit_tile(punit), best_tile)
1109 && punit->moves_left > 0) {
1110 enum gen_action action = activity_default_action(best_act);
1111
1112 /* Reached destination and can start working immediately */
1113 if (activity_requires_target(best_act)) {
1114 unit_activity_handling_targeted(punit, best_act, best_target,
1115 action);
1116 } else {
1117 unit_activity_handling(punit, best_act, action);
1118 }
1119 send_unit_info(NULL, punit); /* FIXME: Probably duplicate */
1120
1121 UNIT_LOG(LOG_DEBUG, punit,
1122 "reached its worksite and started work");
1123 working = TRUE;
1124 } else if (alive) {
1125 UNIT_LOG(LOG_DEBUG, punit,
1126 "didn't start work yet; got to (%d, %d) with "
1127 "%d move frags left", TILE_XY(unit_tile(punit)),
1128 punit->moves_left);
1129 }
1130 } else {
1131 UNIT_LOG(LOG_DEBUG, punit,
1132 "does not find path (%d, %d) -> (%d, %d)",
1133 TILE_XY(unit_tile(punit)), TILE_XY(best_tile));
1134 }
1135
1136 if (pfm) {
1137 pf_map_destroy(pfm);
1138 }
1139
1140 return working;
1141 }
1142
1143 return FALSE;
1144}
1145#undef LOG_WORKER
1146
1147/**********************************************************************/
1150 bool adv_worker_safe_tile(const struct civ_map *nmap,
1151 const struct player *pplayer, struct unit *punit,
1152 struct tile *ptile)
1153{
1154 unit_list_iterate(ptile->units, defender) {
1155 if (is_guard_unit(defender)) {
1156 return TRUE;
1157 }
1158 } unit_list_iterate_end;
1159
1160 if (is_square_threatened(nmap, pplayer, ptile,
1161 !has_handicap(pplayer, H_FOG))) {
1162 return FALSE;
1163 }
1164
1165 return TRUE;
1166}
1167
1168/**********************************************************************/
1172 void auto_workers_player(struct player *pplayer)
1173{
1174 struct workermap *state;
1175 const struct civ_map *nmap = &(wld.map);
1176
1177 state = fc_calloc(MAP_INDEX_SIZE, sizeof(*state));
1178
1179 aw_timer = timer_renew(aw_timer, TIMER_CPU, TIMER_DEBUG,
1180 aw_timer != NULL ? NULL : "autoworkers");
1181 timer_start(aw_timer);
1182
1183 if (is_ai(pplayer)) {
1184 /* Set up our city map. */
1185 citymap_turn_init(pplayer);
1186 }
1187
1188 whole_map_iterate(nmap, ptile) {
1189 state[tile_index(ptile)].enroute = -1;
1190 state[tile_index(ptile)].eta = FC_INFINITY;
1191 } whole_map_iterate_end;
1192
1193 /* Initialize the infrastructure cache, which is used shortly. */
1194 initialize_infrastructure_cache(pplayer);
1195
1196 /* An extra consideration for the benefit of cleaning up pollution/fallout.
1197 * This depends heavily on the calculations in update_environmental_upset.
1198 * Aside from that it's more or less a WAG that simply grows incredibly
1199 * large as an environmental disaster approaches. */
1200 pplayer->ai_common.warmth
1201 = (WARMING_FACTOR * game.info.heating / ((game.info.warminglevel + 1) / 2)
1202 + game.info.globalwarming);
1203 pplayer->ai_common.frost
1204 = (COOLING_FACTOR * game.info.cooling / ((game.info.coolinglevel + 1) / 2)
1205 + game.info.nuclearwinter);
1206
1207 log_debug("Warmth = %d, game.globalwarming=%d",
1208 pplayer->ai_common.warmth, game.info.globalwarming);
1209 log_debug("Frost = %d, game.nuclearwinter=%d",
1210 pplayer->ai_common.frost, game.info.nuclearwinter);
1211
1212 /* Auto-work with a worker unit if it's under AI control (e.g. human
1213 * player autoworker mode) or if the player is an AI. But don't
1214 * autowork with a unit under orders even for an AI player - these come
1215 * from the human player and take precedence. */
1216 unit_list_iterate_safe(pplayer->units, punit) {
1217 if ((punit->ssa_controller == SSA_AUTOWORKER || is_ai(pplayer))
1218 && (unit_type_get(punit)->adv.worker
1219 || unit_is_cityfounder(punit))
1220 && !unit_has_orders(punit)
1221 && punit->moves_left > 0) {
1222 log_debug("%s %s at (%d, %d) is controlled by server side agent %s.",
1223 nation_rule_name(nation_of_player(pplayer)),
1224 unit_rule_name(punit),
1225 TILE_XY(unit_tile(punit)),
1226 server_side_agent_name(SSA_AUTOWORKER));
1227 if (punit->activity == ACTIVITY_SENTRY) {
1228 unit_activity_handling(punit, ACTIVITY_IDLE, ACTION_NONE);
1229 }
1230 if (punit->activity == ACTIVITY_GOTO && punit->moves_left > 0) {
1231 unit_activity_handling(punit, ACTIVITY_IDLE, ACTION_NONE);
1232 }
1233 if (punit->activity != ACTIVITY_IDLE) {
1234 if (!is_ai(pplayer)) {
1235 if (!adv_worker_safe_tile(nmap, pplayer, punit,
1236 unit_tile(punit))) {
1237 unit_activity_handling(punit, ACTIVITY_IDLE, ACTION_NONE);
1238 }
1239 } else {
1240 CALL_PLR_AI_FUNC(settler_cont, pplayer, pplayer, punit, state);
1241 }
1242 }
1243 if (punit->activity == ACTIVITY_IDLE) {
1244 if (!is_ai(pplayer)) {
1245 auto_worker_findwork(nmap, pplayer, punit, state, 0);
1246 } else {
1247 CALL_PLR_AI_FUNC(settler_run, pplayer, pplayer, punit, state);
1248 }
1249 }
1250 }
1251 } unit_list_iterate_safe_end;
1252 /* Reset auto worker state for the next run. */
1253 if (is_ai(pplayer)) {
1254 CALL_PLR_AI_FUNC(settler_reset, pplayer, pplayer);
1255 }
1256
1257 if (timer_in_use(aw_timer)) {
1258
1259#ifdef LOG_TIMERS
1260 log_verbose("%s autoworkers consumed %g milliseconds.",
1261 nation_rule_name(nation_of_player(pplayer)),
1262 1000.0 * timer_read_seconds(aw_timer));
1263#else
1264 log_verbose("%s autoworkers finished",
1265 nation_rule_name(nation_of_player(pplayer)));
1266#endif
1267
1268 }
1269
1270 FC_FREE(state);
1271}
1272
1273/**********************************************************************/
1276 void adv_unit_new_task(struct unit *punit, enum adv_unit_task task,
1277 struct tile *ptile)
1278{
1279 if (punit->server.adv->task == task) {
1280 /* Already that task */
1281 return;
1282 }
1283
1284 punit->server.adv->task = task;
1285
1286 CALL_PLR_AI_FUNC(unit_task, unit_owner(punit), punit, task, ptile);
1287}
1288
1289/**********************************************************************/
1293 bool auto_workers_speculate_can_act_at(const struct unit *punit,
1294 enum unit_activity activity,
1295 bool omniscient_cheat,
1296 struct extra_type *target,
1297 const struct tile *ptile)
1298{
1299 action_by_activity_iterate(paction, activity) {
1300 if (action_get_actor_kind(paction) != AAK_UNIT) {
1301 /* Not relevant. */
1302 continue;
1303 }
1304
1305 switch (action_get_target_kind(paction)) {
1306 case ATK_CITY:
1307 return action_prob_possible(action_speculate_unit_on_city(
1308 paction->id,
1309 punit, unit_home(punit), ptile,
1310 omniscient_cheat,
1311 tile_city(ptile)));
1312 case ATK_UNIT:
1313 fc_assert_ret_val(action_get_target_kind(paction) != ATK_UNIT,
1314 FALSE);
1315 break;
1316 case ATK_UNITS:
1317 return action_prob_possible(action_speculate_unit_on_stack(
1318 paction->id,
1319 punit, unit_home(punit), ptile,
1320 omniscient_cheat,
1321 ptile));
1322 case ATK_TILE:
1323 return action_prob_possible(action_speculate_unit_on_tile(
1324 paction->id,
1325 punit, unit_home(punit), ptile,
1326 omniscient_cheat,
1327 ptile, target));
1328 case ATK_EXTRAS:
1329 return action_prob_possible(action_speculate_unit_on_extras(
1330 paction->id,
1331 punit, unit_home(punit), ptile,
1332 omniscient_cheat,
1333 ptile, target));
1334 case ATK_SELF:
1335 return action_prob_possible(action_speculate_unit_on_self(
1336 paction->id,
1337 punit, unit_home(punit), ptile,
1338 omniscient_cheat));
1339 case ATK_COUNT:
1340 fc_assert_ret_val(action_get_target_kind(paction) != ATK_COUNT,
1341 FALSE);
1342 break;
1343 }
1344 } action_by_activity_iterate_end;
1345
1346 log_debug("No action found for activity %d", activity);
1347
1348 return FALSE;
1349}
action_get_actor_kind
enum action_actor_kind action_get_actor_kind(const struct action *paction)
Definition actions.c:1073
action_prob_possible
bool action_prob_possible(const struct act_prob probability)
Definition actions.c:5044
action_array_add_all_by_result
void action_array_add_all_by_result(action_id *act_array, int *position, enum action_result result)
Definition actions.c:5740
action_array_end
void action_array_end(action_id *act_array, int size)
Definition actions.c:5723
action_speculate_unit_on_self
struct act_prob action_speculate_unit_on_self(action_id act_id, const struct unit *actor, const struct city *actor_home, const struct tile *actor_tile, bool omniscient_cheat)
Definition actions.c:4965
action_speculate_unit_on_stack
struct act_prob action_speculate_unit_on_stack(action_id act_id, const struct unit *actor, const struct city *actor_home, const struct tile *actor_tile, bool omniscient_cheat, const struct tile *target)
Definition actions.c:4864
action_speculate_unit_on_extras
struct act_prob action_speculate_unit_on_extras(action_id act_id, const struct unit *actor, const struct city *actor_home, const struct tile *actor_tile, bool omniscient_cheat, const struct tile *target_tile, const struct extra_type *target_extra)
Definition actions.c:4931
action_speculate_unit_on_city
struct act_prob action_speculate_unit_on_city(const action_id act_id, const struct unit *actor, const struct city *actor_home, const struct tile *actor_tile, const bool omniscient_cheat, const struct city *target)
Definition actions.c:4796
action_get_target_kind
enum action_target_kind action_get_target_kind(const struct action *paction)
Definition actions.c:1083
action_speculate_unit_on_tile
struct act_prob action_speculate_unit_on_tile(action_id act_id, const struct unit *actor, const struct city *actor_home, const struct tile *actor_tile, bool omniscient_cheat, const struct tile *target_tile, const struct extra_type *target_extra)
Definition actions.c:4897
action_by_activity_iterate
#define action_by_activity_iterate(_paction_, _activity_)
Definition actions.h:244
action_by_number
static struct action * action_by_number(action_id act_id)
Definition actions.h:390
action_by_activity_iterate_end
#define action_by_activity_iterate_end
Definition actions.h:248
MAX_NUM_ACTIONS
#define MAX_NUM_ACTIONS
Definition actions.h:58
action_get_activity
#define action_get_activity(_pact_)
Definition actions.h:454
action_id_get_activity
#define action_id_get_activity(act_id)
Definition actions.h:456
ACTION_NONE
#define ACTION_NONE
Definition actions.h:55
advbuilding.h
COOLING_FACTOR
#define COOLING_FACTOR
Definition advbuilding.h:31
WARMING_FACTOR
#define WARMING_FACTOR
Definition advbuilding.h:30
advdata.h
adv_follow_path
bool adv_follow_path(struct unit *punit, struct pf_path *path, struct tile *ptile)
Definition advgoto.c:47
advgoto.h
amortize
adv_want amortize(adv_want benefit, int delay)
Definition advtools.c:29
advtools.h
ADV_WANTS_EQ
#define ADV_WANTS_EQ(_w1, _w2)
Definition advtools.h:23
ai.h
CALL_PLR_AI_FUNC
#define CALL_PLR_AI_FUNC(_func, _player,...)
Definition ai.h:377
adv_unit_new_task
void adv_unit_new_task(struct unit *punit, enum adv_unit_task task, struct tile *ptile)
Definition autoworkers.c:1276
consider_worker_action
static void consider_worker_action(const struct player *pplayer, enum unit_activity act, struct extra_type *target, adv_want extra, adv_want new_tile_value, adv_want old_tile_value, bool in_use, int delay, adv_want *best_value, adv_want *best_old_tile_value, int *best_extra, bool *improve_worked, int *best_delay, enum unit_activity *best_act, struct extra_type **best_target, struct tile **best_tile, struct tile *ptile)
Definition autoworkers.c:308
autoworker_tile_behavior
static enum tile_behavior autoworker_tile_behavior(const struct tile *ptile, enum known_type known, const struct pf_parameter *param)
Definition autoworkers.c:412
auto_worker_findwork
void auto_worker_findwork(const struct civ_map *nmap, struct player *pplayer, struct unit *punit, struct workermap *state, int recursion)
Definition autoworkers.c:926
adv_worker_safe_tile
bool adv_worker_safe_tile(const struct civ_map *nmap, const struct player *pplayer, struct unit *punit, struct tile *ptile)
Definition autoworkers.c:1150
aw_timer
static struct timer * aw_timer
Definition autoworkers.c:81
adv_workers_free
void adv_workers_free(void)
Definition autoworkers.c:86
aw_actions_rmextra
action_id aw_actions_rmextra[MAX_NUM_ACTIONS]
Definition autoworkers.c:79
adv_workers_road_bonus
adv_want adv_workers_road_bonus(const struct civ_map *nmap, struct tile *ptile, struct road_type *proad)
Definition autoworkers.c:132
auto_workers_speculate_can_act_at
bool auto_workers_speculate_can_act_at(const struct unit *punit, enum unit_activity activity, bool omniscient_cheat, struct extra_type *target, const struct tile *ptile)
Definition autoworkers.c:1293
auto_workers_player
void auto_workers_player(struct player *pplayer)
Definition autoworkers.c:1172
worker_evaluate_city_requests
struct city * worker_evaluate_city_requests(struct unit *punit, struct worker_task **best_task, struct pf_path **path, struct workermap *state)
Definition autoworkers.c:835
auto_worker_setup_work
bool auto_worker_setup_work(const struct civ_map *nmap, struct player *pplayer, struct unit *punit, struct workermap *state, int recursion, struct pf_path *path, struct tile *best_tile, enum unit_activity best_act, struct extra_type **best_target, int completion_time)
Definition autoworkers.c:1015
aw_actions_extra
action_id aw_actions_extra[MAX_NUM_ACTIONS]
Definition autoworkers.c:78
aw_actions_transform
action_id aw_actions_transform[MAX_NUM_ACTIONS]
Definition autoworkers.c:77
worker_evaluate_improvements
adv_want worker_evaluate_improvements(const struct civ_map *nmap, struct unit *punit, enum unit_activity *best_act, struct extra_type **best_target, struct tile **best_tile, struct pf_path **path, struct workermap *state)
Definition autoworkers.c:442
auto_workers_ruleset_init
void auto_workers_ruleset_init(void)
Definition autoworkers.c:95
WORKER_FACTOR
#define WORKER_FACTOR
Definition autoworkers.c:70
MAX_DEP_ROADS
#define MAX_DEP_ROADS
autoworkers.h
aw_extra_action_iterate
#define aw_extra_action_iterate(_act_)
Definition autoworkers.h:84
aw_transform_action_iterate
#define aw_transform_action_iterate(_act_)
Definition autoworkers.h:74
aw_rmextra_action_iterate_end
#define aw_rmextra_action_iterate_end
Definition autoworkers.h:98
aw_extra_action_iterate_end
#define aw_extra_action_iterate_end
Definition autoworkers.h:88
aw_transform_action_iterate_end
#define aw_transform_action_iterate_end
Definition autoworkers.h:78
aw_rmextra_action_iterate
#define aw_rmextra_action_iterate(_act_)
Definition autoworkers.h:94
city_map_radius_sq_get
int city_map_radius_sq_get(const struct city *pcity)
Definition city.c:137
city_can_work_tile
bool city_can_work_tile(const struct city *pcity, const struct tile *ptile)
Definition city.c:1452
city.h
city_list_iterate
#define city_list_iterate(citylist, pcity)
Definition city.h:508
city_tile
#define city_tile(_pcity_)
Definition city.h:564
city_tile_iterate_index
#define city_tile_iterate_index(_nmap, _radius_sq, _city_tile, _tile, _index)
Definition city.h:201
city_tile_iterate_index_end
#define city_tile_iterate_index_end
Definition city.h:209
city_list_iterate_end
#define city_list_iterate_end
Definition city.h:510
citymap_turn_init
void citymap_turn_init(struct player *pplayer)
Definition citymap.c:61
citymap.h
clear_worker_task
void clear_worker_task(struct city *pcity, struct worker_task *ptask)
Definition citytools.c:3564
citytools.h
incite_cost
char * incite_cost
Definition comments.c:74
punit
struct unit struct city struct unit struct tile struct extra_type const struct act_prob *act_probs int actor_unit_id struct unit struct unit * punit
Definition dialogs_g.h:74
next_extra_for_tile
struct extra_type * next_extra_for_tile(const struct tile *ptile, enum extra_cause cause, const struct player *pplayer, const struct unit *punit)
Definition extras.c:779
extra_has_flag
bool extra_has_flag(const struct extra_type *pextra, enum extra_flag_id flag)
Definition extras.c:875
prev_extra_in_tile
struct extra_type * prev_extra_in_tile(const struct tile *ptile, enum extra_rmcause rmcause, const struct player *pplayer, const struct unit *punit)
Definition extras.c:804
activity_to_extra_cause
enum extra_cause activity_to_extra_cause(enum unit_activity act)
Definition extras.c:1090
is_extra_caused_by_action
bool is_extra_caused_by_action(const struct extra_type *pextra, const struct action *paction)
Definition extras.c:1070
extra_rule_name
const char * extra_rule_name(const struct extra_type *pextra)
Definition extras.c:203
is_extra_removed_by_action
bool is_extra_removed_by_action(const struct extra_type *pextra, const struct action *paction)
Definition extras.c:1080
activity_to_extra_rmcause
enum extra_rmcause activity_to_extra_rmcause(enum unit_activity act)
Definition extras.c:1111
extra_type_iterate
#define extra_type_iterate(_p)
Definition extras.h:315
extra_deps_iterate
#define extra_deps_iterate(_reqs, _dep)
Definition extras.h:371
extra_type_iterate_end
#define extra_type_iterate_end
Definition extras.h:321
is_extra_caused_by
#define is_extra_caused_by(e, c)
Definition extras.h:203
extra_deps_iterate_end
#define extra_deps_iterate_end
Definition extras.h:379
extra_road_get
#define extra_road_get(_e_)
Definition extras.h:191
extra_type_by_cause_iterate_end
#define extra_type_by_cause_iterate_end
Definition extras.h:339
extra_type_by_cause_iterate
#define extra_type_by_cause_iterate(_cause, _extra)
Definition extras.h:333
adv_want
float adv_want
Definition fc_types.h:1335
adv_unit_task
adv_unit_task
Definition fc_types.h:374
AUT_NONE
@ AUT_NONE
Definition fc_types.h:374
AUT_AUTO_WORKER
@ AUT_AUTO_WORKER
Definition fc_types.h:374
action_id
int action_id
Definition fc_types.h:393
EC_NONE
#define EC_NONE
Definition fc_types.h:1093
ERM_NONE
#define ERM_NONE
Definition fc_types.h:1116
ADV_WANT_PRINTF
#define ADV_WANT_PRINTF
Definition fc_types.h:1336
game
struct civ_game game
Definition game.c:61
wld
struct world wld
Definition game.c:62
game.h
government.h
owner
struct city * owner
Definition citydlg.c:226
pos
static struct tile * pos
Definition finddlg.c:53
has_handicap
bool has_handicap(const struct player *pplayer, enum handicap_type htype)
Definition handicaps.c:66
handicaps.h
H_MAP
@ H_MAP
Definition handicaps.h:28
H_FOG
@ H_FOG
Definition handicaps.h:26
adv_city_worker_act_get
adv_want adv_city_worker_act_get(const struct city *pcity, int city_tile_index, enum unit_activity act_id)
Definition infracache.c:360
adv_city_worker_extra_get
int adv_city_worker_extra_get(const struct city *pcity, int city_tile_index, const struct extra_type *pextra)
Definition infracache.c:430
initialize_infrastructure_cache
void initialize_infrastructure_cache(struct player *pplayer)
Definition infracache.c:250
adv_city_worker_rmextra_get
int adv_city_worker_rmextra_get(const struct city *pcity, int city_tile_index, const struct extra_type *pextra)
Definition infracache.c:447
city_tile_value
adv_want city_tile_value(const struct city *pcity, const struct tile *ptile, int foodneed, int prodneed)
Definition infracache.c:303
infracache.h
log.h
fc_assert_ret
#define fc_assert_ret(condition)
Definition log.h:191
log_warn
#define log_warn(message,...)
Definition log.h:105
log_verbose
#define log_verbose(message,...)
Definition log.h:109
fc_assert
#define fc_assert(condition)
Definition log.h:176
fc_assert_ret_val
#define fc_assert_ret_val(condition, val)
Definition log.h:194
log_debug
#define log_debug(message,...)
Definition log.h:115
LOG_DEBUG
@ LOG_DEBUG
Definition log.h:34
map_pos_to_tile
struct tile * map_pos_to_tile(const struct civ_map *nmap, int map_x, int map_y)
Definition map.c:425
same_pos
bool same_pos(const struct tile *tile1, const struct tile *tile2)
Definition map.c:950
real_map_distance
int real_map_distance(const struct tile *tile0, const struct tile *tile1)
Definition map.c:636
terrain_control
struct terrain_misc terrain_control
Definition map.c:68
map.h
current_topo_has_flag
#define current_topo_has_flag(flag)
Definition map.h:43
whole_map_iterate
#define whole_map_iterate(_map, _tile)
Definition map.h:531
whole_map_iterate_end
#define whole_map_iterate_end
Definition map.h:540
index_to_map_pos
#define index_to_map_pos(pmap_x, pmap_y, mindex)
Definition map.h:218
maphand.h
mem.h
fc_calloc
#define fc_calloc(n, esz)
Definition mem.h:38
FC_FREE
#define FC_FREE(ptr)
Definition mem.h:41
movement.h
SINGLE_MOVE
#define SINGLE_MOVE
Definition movement.h:26
nation_rule_name
const char * nation_rule_name(const struct nation_type *pnation)
Definition nation.c:138
nation_of_player
struct nation_type * nation_of_player(const struct player *pplayer)
Definition nation.c:444
nation.h
packets.h
pf_path_last_position
const struct pf_position * pf_path_last_position(const struct pf_path *path)
Definition path_finding.c:3531
pf_path_destroy
void pf_path_destroy(struct pf_path *path)
Definition path_finding.c:3411
pf_map_new
struct pf_map * pf_map_new(const struct pf_parameter *parameter)
Definition path_finding.c:3182
pf_map_path
struct pf_path * pf_map_path(struct pf_map *pfm, struct tile *ptile)
Definition path_finding.c:3235
pf_map_position
bool pf_map_position(struct pf_map *pfm, struct tile *ptile, struct pf_position *pos)
Definition path_finding.c:3267
pf_map_destroy
void pf_map_destroy(struct pf_map *pfm)
Definition path_finding.c:3206
path_finding.h
tile_behavior
tile_behavior
Definition path_finding.h:308
TB_NORMAL
@ TB_NORMAL
Definition path_finding.h:309
TB_IGNORE
@ TB_IGNORE
Definition path_finding.h:310
pft_fill_unit_parameter
void pft_fill_unit_parameter(struct pf_parameter *parameter, const struct civ_map *nmap, const struct unit *punit)
Definition pf_tools.c:843
pf_tools.h
player_unit_by_number
struct unit * player_unit_by_number(const struct player *pplayer, int unit_id)
Definition player.c:1229
pplayers_allied
bool pplayers_allied(const struct player *pplayer, const struct player *pplayer2)
Definition player.c:1409
is_ai
#define is_ai(plr)
Definition player.h:232
plrhand.h
road_extra_get
struct extra_type * road_extra_get(const struct road_type *proad)
Definition road.c:42
road_number
Road_type_id road_number(const struct road_type *proad)
Definition road.c:32
road_provides_move_bonus
bool road_provides_move_bonus(const struct road_type *proad)
Definition road.c:505
road_deps_iterate
#define road_deps_iterate(_reqs, _dep)
Definition road.h:155
road_deps_iterate_end
#define road_deps_iterate_end
Definition road.h:164
FC_INFINITY
#define FC_INFINITY
Definition shared.h:36
MAX
#define MAX(x, y)
Definition shared.h:54
y
struct sprite int int y
Definition sprite_g.h:31
x
struct sprite int x
Definition sprite_g.h:31
recursion
static int recursion[AIT_LAST]
Definition srv_log.c:45
srv_log.h
UNIT_LOG
#define UNIT_LOG(loglevel, punit, msg,...)
Definition srv_log.h:98
LOG_AI_TEST
#define LOG_AI_TEST
Definition srv_log.h:38
AIT_WORKERS
@ AIT_WORKERS
Definition srv_log.h:45
TIMER_STOP
@ TIMER_STOP
Definition srv_log.h:76
TIMER_START
@ TIMER_START
Definition srv_log.h:76
TIMING_LOG
#define TIMING_LOG(timer, activity)
Definition srv_log.h:125
action
Definition actions.h:106
city
Definition city.h:320
civ_game::info
struct packet_game_info info
Definition game.h:89
civ_map
Definition map_types.h:71
extra_type
Definition extras.h:88
extra_type::reqs
struct requirement_vector reqs
Definition extras.h:106
packet_game_info::coolinglevel
int coolinglevel
Definition packets_gen.h:151
packet_game_info::globalwarming
int globalwarming
Definition packets_gen.h:168
packet_game_info::nuclearwinter
int nuclearwinter
Definition packets_gen.h:209
packet_game_info::cooling
int cooling
Definition packets_gen.h:150
packet_game_info::warminglevel
int warminglevel
Definition packets_gen.h:246
packet_game_info::heating
int heating
Definition packets_gen.h:182
pf_map
Definition path_finding.c:78
pf_parameter
Definition path_finding.h:357
pf_parameter::get_TB
enum tile_behavior(* get_TB)(const struct tile *ptile, enum known_type known, const struct pf_parameter *param)
Definition path_finding.h:398
pf_parameter::owner
const struct player * owner
Definition path_finding.h:374
pf_parameter::omniscience
bool omniscience
Definition path_finding.h:376
pf_path
Definition path_finding.h:344
pf_position
Definition path_finding.h:327
pf_position::turn
int turn
Definition path_finding.h:329
player_ai::warmth
int warmth
Definition player.h:121
player_ai::frost
int frost
Definition player.h:121
player
Definition player.h:249
player::cities
struct city_list * cities
Definition player.h:281
player::ai_common
struct player_ai ai_common
Definition player.h:288
player::units
struct unit_list * units
Definition player.h:282
road_type
Definition road.h:71
tile
Definition tile.h:50
tile::units
struct unit_list * units
Definition tile.h:58
timer
Definition timing.c:81
unit_adv::task
enum adv_unit_task task
Definition unit.h:90
unit_type::worker
bool worker
Definition unittype.h:582
unit
Definition unit.h:140
unit::activity
enum unit_activity activity
Definition unit.h:159
unit::moves_left
int moves_left
Definition unit.h:152
unit::id
int id
Definition unit.h:147
unit::server
struct unit::@81::@84 server
unit::activity_target
struct extra_type * activity_target
Definition unit.h:167
unit::adv
struct unit_adv * adv
Definition unit.h:239
unit::goto_tile
struct tile * goto_tile
Definition unit.h:157
unit::ssa_controller
enum server_side_agent ssa_controller
Definition unit.h:175
worker_task
Definition workertask.h:21
worker_task::ptile
struct tile * ptile
Definition workertask.h:22
workermap
Definition autoworkers.c:72
workermap::enroute
int enroute
Definition autoworkers.c:73
workermap::eta
int eta
Definition autoworkers.c:74
world::map
struct civ_map map
Definition world_object.h:38
support.h
TRUE
#define TRUE
Definition support.h:46
FALSE
#define FALSE
Definition support.h:47
terrain_extra_build_time
int terrain_extra_build_time(const struct terrain *pterrain, enum unit_activity activity, const struct extra_type *tgt)
Definition terrain.c:699
tile_has_road
bool tile_has_road(const struct tile *ptile, const struct road_type *proad)
Definition tile.c:844
tile_city
struct city * tile_city(const struct tile *ptile)
Definition tile.c:83
tile_index
#define tile_index(_pt_)
Definition tile.h:89
tile_worked
#define tile_worked(_tile)
Definition tile.h:115
known_type
known_type
Definition tile.h:35
tile_terrain
#define tile_terrain(_tile)
Definition tile.h:111
TILE_XY
#define TILE_XY(ptile)
Definition tile.h:43
tile_has_extra
#define tile_has_extra(ptile, pextra)
Definition tile.h:148
tile_owner
#define tile_owner(_tile)
Definition tile.h:97
timer_in_use
bool timer_in_use(struct timer *t)
Definition timing.c:242
timer_destroy
void timer_destroy(struct timer *t)
Definition timing.c:208
timer_start
void timer_start(struct timer *t)
Definition timing.c:264
timer_read_seconds
double timer_read_seconds(struct timer *t)
Definition timing.c:384
timer_renew
struct timer * timer_renew(struct timer *t, enum timer_timetype type, enum timer_use use, const char *name)
Definition timing.c:180
timing.h
TIMER_DEBUG
#define TIMER_DEBUG
Definition timing.h:61
TIMER_CPU
@ TIMER_CPU
Definition timing.h:41
best_value
static int best_value(const void *a, const void *b)
Definition traderoutes.c:400
get_turns_for_activity_at
int get_turns_for_activity_at(const struct unit *punit, enum unit_activity activity, const struct tile *ptile, struct extra_type *tgt)
Definition unit.c:566
unit_is_cityfounder
bool unit_is_cityfounder(const struct unit *punit)
Definition unit.c:2699
activity_default_action
enum gen_action activity_default_action(enum unit_activity act)
Definition unit.c:2911
get_activity_text
const char * get_activity_text(enum unit_activity activity)
Definition unit.c:638
set_unit_activity
void set_unit_activity(struct unit *punit, enum unit_activity new_activity, enum gen_action trigger_action)
Definition unit.c:1115
is_square_threatened
bool is_square_threatened(const struct civ_map *nmap, const struct player *pplayer, const struct tile *ptile, bool omniscient)
Definition unit.c:415
is_guard_unit
bool is_guard_unit(const struct unit *punit)
Definition unit.c:343
unit_has_orders
bool unit_has_orders(const struct unit *punit)
Definition unit.c:205
activity_requires_target
bool activity_requires_target(enum unit_activity activity)
Definition unit.c:590
unit_tile
#define unit_tile(_pu)
Definition unit.h:397
CHECK_UNIT
#define CHECK_UNIT(punit)
Definition unit.h:273
unit_owner
#define unit_owner(_pu)
Definition unit.h:396
unit_home
#define unit_home(_pu_)
Definition unit.h:394
unit_activity_handling_targeted
bool unit_activity_handling_targeted(struct unit *punit, enum unit_activity new_activity, struct extra_type **new_target, enum gen_action trigger_action)
Definition unithand.c:6685
unit_activity_handling
bool unit_activity_handling(struct unit *punit, enum unit_activity new_activity, enum gen_action trigger_action)
Definition unithand.c:6613
unithand.h
unitlist.h
unit_list_iterate
#define unit_list_iterate(unitlist, punit)
Definition unitlist.h:31
unit_list_iterate_safe
#define unit_list_iterate_safe(unitlist, _unit)
Definition unitlist.h:39
unit_list_iterate_end
#define unit_list_iterate_end
Definition unitlist.h:33
unit_list_iterate_safe_end
#define unit_list_iterate_safe_end
Definition unitlist.h:61
send_unit_info
void send_unit_info(struct conn_list *dest, struct unit *punit)
Definition unittools.c:2878
unittools.h
unit_type_get
const struct unit_type * unit_type_get(const struct unit *punit)
Definition unittype.c:123
unit_rule_name
const char * unit_rule_name(const struct unit *punit)
Definition unittype.c:1587
unit_has_type_flag
bool unit_has_type_flag(const struct unit *punit, enum unit_type_flag_id flag)
Definition unittype.c:190
worker_task_list_iterate
#define worker_task_list_iterate(tasklist, ptask)
Definition workertask.h:33
worker_task_list_iterate_end
#define worker_task_list_iterate_end
Definition workertask.h:35
MAP_INDEX_SIZE
#define MAP_INDEX_SIZE
Definition world_object.h:52