Freeciv-3.3
Loading...
Searching...
No Matches
traderoutes.c
Go to the documentation of this file.
1/****************************************************************************
2 Freeciv - Copyright (C) 2004 - The Freeciv Team
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/* utility */
19#include "log.h"
20#include "rand.h"
21
22/* common */
23#include "city.h"
24#include "effects.h"
25#include "game.h"
26#include "map.h"
27#include "tile.h"
28#include "unittype.h"
29
30#include "traderoutes.h"
31
32const char *trade_route_type_names[] = {
33 "National", "NationalIC", "IN", "INIC", "Ally", "AllyIC",
34 "Enemy", "EnemyIC", "Team", "TeamIC"
35};
36
38 "Active", "Inactive", "Cancel"
39};
40
42
44
45/*********************************************************************/
48unsigned max_trade_routes(const struct city *pcity)
49{
51
52 return CLIP(0, eft, MAX_TRADE_ROUTES);
53}
54
55/*********************************************************************/
59 const struct city *pcity2)
60{
61 struct player *plr1 = city_owner(pcity1);
62 struct player *plr2 = city_owner(pcity2);
63
64 if (plr1 != plr2) {
65 struct player_diplstate *ds = player_diplstate_get(plr1, plr2);
66
67 if (city_tile(pcity1)->continent != city_tile(pcity2)->continent) {
68 switch (ds->type) {
69 case DS_ALLIANCE:
70 return TRT_ALLY_IC;
71 case DS_WAR:
72 return TRT_ENEMY_IC;
73 case DS_TEAM:
74 return TRT_TEAM_IC;
75 case DS_ARMISTICE:
76 case DS_CEASEFIRE:
77 case DS_PEACE:
78 case DS_NO_CONTACT:
79 return TRT_IN_IC;
80 case DS_LAST:
81 fc_assert(ds->type != DS_LAST);
82 return TRT_IN_IC;
83 }
85
86 return TRT_IN_IC;
87 } else {
88 switch (ds->type) {
89 case DS_ALLIANCE:
90 return TRT_ALLY;
91 case DS_WAR:
92 return TRT_ENEMY;
93 case DS_TEAM:
94 return TRT_TEAM;
95 case DS_ARMISTICE:
96 case DS_CEASEFIRE:
97 case DS_PEACE:
98 case DS_NO_CONTACT:
99 return TRT_IN;
100 case DS_LAST:
101 fc_assert(ds->type != DS_LAST);
102 return TRT_IN;
103 }
105
106 return TRT_IN;
107 }
108 } else {
109 if (city_tile(pcity1)->continent != city_tile(pcity2)->continent) {
110 return TRT_NATIONAL_IC;
111 } else {
112 return TRT_NATIONAL;
113 }
114 }
115
116 return TRT_LAST;
117}
118
119/*********************************************************************/
123{
124 if (type >= TRT_LAST) {
125 return 0;
126 }
127
128 return trtss[type].trade_pct;
129}
130
131/*********************************************************************/
135{
137
138 for (type = TRT_NATIONAL; type < TRT_LAST; type++) {
140
141 set->trade_pct = 100;
142 }
143}
144
145/*********************************************************************/
154
155/*********************************************************************/
159{
161
162 for (type = TRT_NATIONAL; type < TRT_LAST; type++) {
164 return type;
165 }
166 }
167
168 return TRT_LAST;
169}
170
171/*********************************************************************/
180
181/*********************************************************************/
196
197/*********************************************************************/
207
208/*********************************************************************/
214bool can_cities_trade(const struct city *pc1, const struct city *pc2)
215{
216 /* If you change the logic here, make sure to update the help in
217 * helptext_unit(). */
218 return (pc1 && pc2 && pc1 != pc2
220 || map_distance(pc1->tile, pc2->tile)
223 > 0));
224}
225
226/*********************************************************************/
233{
235 int num, i, j;
236
237 /* Sort trade route values. */
238 num = 0;
240 if (proute->goods->replace_priority <= priority) {
241 for (j = num;
242 j > 0 && proute->goods->replace_priority > sorted[j - 1]->goods->replace_priority;
243 j--) ;
244
245 /* Search place amoung same priority ones. */
246 for (; j > 0
247 && (proute->value < sorted[j - 1]->value)
248 && (proute->goods->replace_priority == sorted[j - 1]->goods->replace_priority) ;
249 j--) {
250 sorted[j] = sorted[j - 1];
251 }
252 sorted[j] = proute;
253 num++;
254 }
256
257 /* No trade routes at all. */
258 if (num == 0) {
259 return 0;
260 }
261
262 /* Adjust number of concerned trade routes. */
263 num += 1 - max_trade_routes(pcity);
264 if (num < 0) {
265 num = 1;
266 }
267
268 /* Return values. */
269 for (i = j = 0; i < num; i++) {
270 j += sorted[i]->value;
271 if (NULL != would_remove) {
273 }
274 }
275
276 return j;
277}
278
279/*********************************************************************/
284bool can_establish_trade_route(const struct city *pc1, const struct city *pc2,
285 int priority)
286{
287 int trade = -1;
288 int maxpc1;
289 int maxpc2;
290
291 if (!pc1 || !pc2 || pc1 == pc2
294 return FALSE;
295 }
296
297 /* First check if cities can have trade routes at all. */
299 if (maxpc1 <= 0) {
300 return FALSE;
301 }
303 if (maxpc2 <= 0) {
304 return FALSE;
305 }
306
309 /* Can we replace trade route? */
310 if (city_trade_removable(pc1, priority, NULL) >= trade) {
311 return FALSE;
312 }
313 }
314
316 if (trade == -1) {
318 }
319 /* Can we replace trade route? */
320 if (city_trade_removable(pc2, priority, NULL) >= trade) {
321 return FALSE;
322 }
323 }
324
325 return TRUE;
326}
327
328/*********************************************************************/
332int trade_base_between_cities(const struct city *pc1, const struct city *pc2)
333{
334 int bonus = 0;
335
336 if (NULL == pc1 || NULL == pc1->tile || NULL == pc2 || NULL == pc2->tile) {
337 return 0;
338 }
339
341 /* Classic Freeciv */
342 int real_dist = real_map_distance(pc1->tile, pc2->tile);
347
348 bonus = weighted_distance
350 } else if (game.info.trade_revenue_style == TRS_SIMPLE) {
351 /* Simple revenue style */
352 bonus = (pc1->citizen_base[O_TRADE] + pc2->citizen_base[O_TRADE] + 4)
353 * 3;
354 }
355
356 bonus = bonus
358 / 100;
359
360 bonus /= 12;
361
362 return bonus;
363}
364
365/*********************************************************************/
368int trade_from_route(const struct city *pc1, const struct trade_route *route,
369 int base)
370{
371 int val;
372
373 if (route->dir == RDIR_TO) {
374 val = base * route->goods->to_pct / 100;
375
376 if (route->goods->to_pct > 0) {
377 val = MAX(val, game.info.min_trade_route_val);
378 }
379 } else {
380 val = base * route->goods->from_pct / 100;
381
382 if (route->goods->from_pct > 0) {
383 val = MAX(val, game.info.min_trade_route_val);
384 }
385 }
386
387 return val;
388}
389
390/*********************************************************************/
394{
395 return trade_route_list_size(pcity->routes);
396}
397
398/*********************************************************************/
401static int best_value(const void *a, const void *b)
402{
403 return *(int *)a < *(int *)b;
404}
405
406/*********************************************************************/
409static int max_tile_trade(const struct city *pcity)
410{
411 int i, total = 0;
412 int radius_sq = city_map_radius_sq_get(pcity);
413 int tile_trade[city_map_tiles(radius_sq)];
414 size_t size = 0;
416 const struct civ_map *nmap = &(wld.map);
417
418 if (pcity->tile == NULL) {
419 return 0;
420 }
421
422 city_map_iterate(radius_sq, cindex, cx, cy) {
423 struct tile *ptile = city_map_to_tile(nmap, pcity->tile, radius_sq, cx, cy);
424
425 if (ptile == NULL) {
426 continue;
427 }
428
429 if (is_free_worked_index(cindex)) {
430 total += city_tile_output(pcity, ptile, is_celebrating, O_TRADE);
431 continue;
432 }
433
434 if (!city_can_work_tile(pcity, ptile)) {
435 continue;
436 }
437
439 O_TRADE);
441
443
444 for (i = 0; i < pcity->size && i < size; i++) {
445 total += tile_trade[i];
446 }
447
448 return total;
449}
450
451/*********************************************************************/
454int max_trade_prod(const struct city *pcity)
455{
456 /* Trade tile base */
458
459 /* Add trade routes values */
460 trade_partners_iterate(pcity, partner) {
463
464 return trade_prod;
465}
466
467/*********************************************************************/
478 const struct city *pc2,
479 const struct unit_type *ut,
480 struct goods_type *pgood,
481 const bool establish_trade)
482{
483 int tb = 0, bonus = 0;
485
486 if (trtss[trtype].bonus_type == TBONUS_NONE) {
487 return 0;
488 }
489
491 /* Should this be real_map_distance? */
492 int distance = map_distance(pc1->tile, pc2->tile);
494 = ((100 - game.info.trade_world_rel_pct) * distance
496 * (distance * 40 / MAX(MAP_NATIVE_WIDTH, MAP_NATIVE_HEIGHT))) / 100;
497
498 tb = weighted_distance + 10;
499 tb = (tb * (pc1->surplus[O_TRADE] + pc2->surplus[O_TRADE])) / 24;
501 /* Logarithmic bonus */
502 int distance = real_map_distance(pc1->tile, pc2->tile);
504 = ((100 - game.info.trade_world_rel_pct) * distance
506 * (distance * 40 / MAX(MAP_NATIVE_WIDTH, MAP_NATIVE_HEIGHT))) / 100;
507
509 + max_trade_prod(pc1) + max_trade_prod(pc2)) * 2, 2);
510 }
511
512 if (pgood != NULL) {
513 tb = tb * pgood->onetime_pct / 100;
514 }
515
516 /* Trade_revenue_bonus increases revenue by power of 2 in milimes */
518 &(const struct req_context) {
519 .player = city_owner(pc1),
520 .city = pc1,
521 .tile = city_tile(pc1),
522 /* Putting .unit things like unit veterancy
523 * in the scope give little gameplay
524 * and overcomplicate the AI logic */
525 .unittype = ut,
526 /* Could be used to reduce the one time
527 * bonus if no trade route is
528 * established. */
529 .action = action_by_number(
533 ),
534 },
535 &(const struct req_context) {
536 .player = city_owner(pc2),
537 .city = pc2,
538 .tile = city_tile(pc2),
539 },
541
542 /* Be mercy full to players with small amounts. Round up. */
543 tb = ceil((float)tb * pow(2.0, (double)bonus / 1000.0));
544
545 return tb;
546}
547
548/*********************************************************************/
551bool have_cities_trade_route(const struct city *pc1, const struct city *pc2)
552{
554 if (route_to->id == pc2->id) {
555 return TRUE;
556 }
558
559 return FALSE;
560}
561
562/*********************************************************************/
565void goods_init(void)
566{
567 int i;
568
569 for (i = 0; i < MAX_GOODS_TYPES; i++) {
570 goods[i].id = i;
571
574 goods[i].helptext = NULL;
575 }
576}
577
578/*********************************************************************/
581void goods_free(void)
582{
583 int i;
584
585 for (i = 0; i < MAX_GOODS_TYPES; i++) {
587
588 if (NULL != goods[i].helptext) {
589 strvec_destroy(goods[i].helptext);
590 goods[i].helptext = NULL;
591 }
592 }
593}
594
595/*********************************************************************/
599{
601
602 return pgood->id;
603}
604
605/*********************************************************************/
612{
614
615 return pgood - goods;
616}
617
618/*********************************************************************/
622{
624
625 return &goods[id];
626}
627
628/*********************************************************************/
632{
633 return name_translation_get(&pgood->name);
634}
635
636/*********************************************************************/
639const char *goods_rule_name(struct goods_type *pgood)
640{
641 return rule_name_get(&pgood->name);
642}
643
644/*********************************************************************/
649{
650 const char *qs;
651
652 if (name == NULL) {
653 return NULL;
654 }
655
656 qs = Qn_(name);
657
660 return pgood;
661 }
663
664 return NULL;
665}
666
667/*********************************************************************/
672{
675 return pgood;
676 }
678
679 return NULL;
680}
681
682/*********************************************************************/
685bool goods_has_flag(const struct goods_type *pgood, enum goods_flag_id flag)
686{
687 return BV_ISSET(pgood->flags, flag);
688}
689
690/*********************************************************************/
694 const struct goods_type *pgood,
695 const struct unit *punit)
696{
697 return are_reqs_active(&(const struct req_context) {
698 .player = city_owner(pcity),
699 .city = pcity,
700 .tile = city_tile(pcity),
701 .unit = punit,
702 .unittype = punit ? unit_type_get(punit) : NULL,
703 },
704 NULL,
705 &pgood->reqs, RPT_CERTAIN);
706}
707
708/*********************************************************************/
711bool city_receives_goods(const struct city *pcity,
712 const struct goods_type *pgood)
713{
715 if (proute->goods == pgood
716 && (proute->dir == RDIR_TO || proute->dir == RDIR_BIDIRECTIONAL)) {
717 struct city *tcity = game_city_by_number(proute->partner);
720
722 return TRUE;
723 }
724
727
728 if (settings->cancelling == TRI_ACTIVE) {
729 return TRUE;
730 }
731 }
733
734 return FALSE;
735}
736
737/*********************************************************************/
744struct goods_type *goods_from_city_to_unit(const struct city *src,
745 const struct unit *punit)
746{
747 int i = 0;
748 int prio = -1;
750
752 if (goods_can_be_provided(src, pgood, punit)) {
753 if (pgood->select_priority >= prio) {
754 if (pgood->select_priority > prio) {
755 /* New highest priority */
756 i = 0;
758 }
759
760 potential[i++] = pgood;
761 }
762 }
764
765 if (i == 0) {
766 return NULL;
767 }
768
769 return potential[fc_rand(i)];
770}
771
772/*********************************************************************/
780 const struct city *homecity)
781{
783 return goods_from_city_to_unit(homecity, punit);
784 }
785
786 return punit->carrying;
787}
static struct action * action_by_number(action_id act_id)
Definition actions.h:396
#define BV_ISSET(bv, bit)
Definition bitvector.h:86
bool base_city_celebrating(const struct city *pcity)
Definition city.c:1637
struct tile * city_map_to_tile(const struct civ_map *nmap, const struct tile *city_center, int city_radius_sq, int city_map_x, int city_map_y)
Definition city.c:305
int city_map_radius_sq_get(const struct city *pcity)
Definition city.c:137
int city_tile_output(const struct city *pcity, const struct tile *ptile, bool is_celebrating, Output_type_id otype)
Definition city.c:1283
int city_map_tiles(int city_radius_sq)
Definition city.c:171
bool city_can_work_tile(const struct city *pcity, const struct tile *ptile)
Definition city.c:1456
#define city_tile(_pcity_)
Definition city.h:561
static citizens city_size_get(const struct city *pcity)
Definition city.h:566
#define city_owner(_pcity_)
Definition city.h:560
#define city_map_iterate_end
Definition city.h:174
#define city_map_iterate(_radius_sq, _index, _x, _y)
Definition city.h:170
#define is_free_worked_index(city_tile_index)
Definition city.h:877
char * incite_cost
Definition comments.c:76
static void base(QVariant data1, QVariant data2)
Definition dialogs.cpp:2956
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
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 int const struct action *paction struct unit struct city * pcity
Definition dialogs_g.h:78
int int id
Definition editgui_g.h:28
struct @22::@23 reqs
int get_city_bonus(const struct city *pcity, enum effect_type effect_type)
Definition effects.c:842
int get_target_bonus_effects(struct effect_list *plist, const struct req_context *context, const struct req_context *other_context, enum effect_type effect_type)
Definition effects.c:744
#define MAX_TRADE_ROUTES
Definition fc_types.h:967
int Goods_type_id
Definition fc_types.h:246
#define MAX_GOODS_TYPES
Definition fc_types.h:51
@ RPT_CERTAIN
Definition fc_types.h:533
@ O_TRADE
Definition fc_types.h:101
#define Qn_(String)
Definition fcintl.h:89
struct civ_game game
Definition game.c:61
struct world wld
Definition game.c:62
struct city * game_city_by_number(int id)
Definition game.c:106
GType type
Definition repodlgs.c:1313
const char * name
Definition inputfile.c:127
#define fc_assert(condition)
Definition log.h:177
#define fc_assert_ret_val(condition, val)
Definition log.h:195
int real_map_distance(const struct tile *tile0, const struct tile *tile1)
Definition map.c:675
int map_distance(const struct tile *tile0, const struct tile *tile1)
Definition map.c:699
static const char * rule_name_get(const struct name_translation *ptrans)
static const char * name_translation_get(const struct name_translation *ptrans)
struct player_diplstate * player_diplstate_get(const struct player *plr1, const struct player *plr2)
Definition player.c:324
#define fc_rand(_size)
Definition rand.h:56
bool are_reqs_active(const struct req_context *context, const struct req_context *other_context, const struct requirement_vector *reqs, const enum req_problem_type prob_type)
static struct setting settings[]
Definition settings.c:1474
#define CLIP(lower, current, upper)
Definition shared.h:57
#define MAX(x, y)
Definition shared.h:54
SPECPQ_PRIORITY_TYPE priority
Definition specpq.h:86
size_t size
Definition specvec.h:72
void strvec_destroy(struct strvec *psv)
Definition city.h:317
struct packet_ruleset_control control
Definition game.h:83
struct packet_game_info info
Definition game.h:89
bool ruledit_disabled
int select_priority
struct strvec * helptext
enum goods_selection_method goods_selection
enum trade_revenue_style trade_revenue_style
enum caravan_bonus_style caravan_bonus_style
Definition tile.h:50
Definition unit.h:140
struct tile * tile
Definition unit.h:142
struct goods_type * carrying
Definition unit.h:189
struct civ_map map
int fc_strcasecmp(const char *str0, const char *str1)
Definition support.c:186
#define TRUE
Definition support.h:46
#define FALSE
Definition support.h:47
int max_trade_prod(const struct city *pcity)
bool can_cities_trade(const struct city *pc1, const struct city *pc2)
enum trade_route_type cities_trade_route_type(const struct city *pcity1, const struct city *pcity2)
Definition traderoutes.c:58
const char * trade_route_cancelling_type_names[]
Definition traderoutes.c:37
int trade_route_type_trade_pct(enum trade_route_type type)
int trade_base_between_cities(const struct city *pc1, const struct city *pc2)
bool goods_can_be_provided(const struct city *pcity, const struct goods_type *pgood, const struct unit *punit)
int city_num_trade_routes(const struct city *pcity)
Goods_type_id goods_number(const struct goods_type *pgood)
static struct goods_type goods[MAX_GOODS_TYPES]
Definition traderoutes.c:43
bool goods_has_flag(const struct goods_type *pgood, enum goods_flag_id flag)
enum trade_route_illegal_cancelling trade_route_cancelling_type_by_name(const char *name)
const char * trade_route_type_name(enum trade_route_type type)
static int max_tile_trade(const struct city *pcity)
struct trade_route_settings * trade_route_settings_by_type(enum trade_route_type type)
struct trade_route_settings trtss[TRT_LAST]
Definition traderoutes.c:41
struct goods_type * goods_by_rule_name(const char *name)
int trade_from_route(const struct city *pc1, const struct trade_route *route, int base)
const char * goods_rule_name(struct goods_type *pgood)
struct goods_type * goods_from_city_to_unit(const struct city *src, const struct unit *punit)
struct goods_type * unit_current_goods(const struct unit *punit, const struct city *homecity)
unsigned max_trade_routes(const struct city *pcity)
Definition traderoutes.c:48
const char * goods_name_translation(struct goods_type *pgood)
void trade_route_types_init(void)
Goods_type_id goods_index(const struct goods_type *pgood)
static int best_value(const void *a, const void *b)
struct goods_type * goods_by_translated_name(const char *name)
int city_trade_removable(const struct city *pcity, int priority, struct trade_route_list *would_remove)
bool can_establish_trade_route(const struct city *pc1, const struct city *pc2, int priority)
struct goods_type * goods_by_number(Goods_type_id id)
const char * trade_route_cancelling_type_name(enum trade_route_illegal_cancelling type)
void goods_init(void)
bool city_receives_goods(const struct city *pcity, const struct goods_type *pgood)
void goods_free(void)
const char * trade_route_type_names[]
Definition traderoutes.c:32
enum trade_route_type trade_route_type_by_name(const char *name)
bool have_cities_trade_route(const struct city *pc1, const struct city *pc2)
int get_caravan_enter_city_trade_bonus(const struct city *pc1, const struct city *pc2, const struct unit_type *ut, struct goods_type *pgood, const bool establish_trade)
#define goods_type_iterate_end
trade_route_illegal_cancelling
Definition traderoutes.h:29
@ TRI_LAST
Definition traderoutes.h:33
@ TRI_ACTIVE
Definition traderoutes.h:30
#define goods_type_iterate(_p)
#define trade_routes_iterate_end
#define trade_partners_iterate_end
#define trade_routes_iterate(c, proute)
#define trade_partners_iterate(c, p)
trade_route_type
Definition traderoutes.h:37
@ TRT_NATIONAL_IC
Definition traderoutes.h:39
@ TRT_TEAM_IC
Definition traderoutes.h:47
@ TRT_ALLY_IC
Definition traderoutes.h:43
@ TRT_IN_IC
Definition traderoutes.h:41
@ TRT_NATIONAL
Definition traderoutes.h:38
@ TRT_LAST
Definition traderoutes.h:48
@ TRT_IN
Definition traderoutes.h:40
@ TRT_TEAM
Definition traderoutes.h:46
@ TRT_ALLY
Definition traderoutes.h:42
@ TRT_ENEMY_IC
Definition traderoutes.h:45
@ TRT_ENEMY
Definition traderoutes.h:44
const struct unit_type * unit_type_get(const struct unit *punit)
Definition unittype.c:123
#define MAP_NATIVE_WIDTH
#define MAP_NATIVE_HEIGHT