caching building_type in economy code

This commit is contained in:
Enno Rehling 2016-09-19 04:15:12 +02:00
parent 640ba05876
commit d139ee08d1
1 changed files with 38 additions and 10 deletions

View File

@ -1709,7 +1709,11 @@ static void buy(unit * u, request ** buyorders, struct order *ord)
/* ...oder in der Region muß es eine Burg geben. */ /* ...oder in der Region muß es eine Burg geben. */
building *b = 0; building *b = 0;
if (r->buildings) { if (r->buildings) {
const struct building_type *bt_castle = bt_find("castle"); static int cache;
static const struct building_type *bt_castle;
if (bt_changed(&cache)) {
bt_castle = bt_find("castle");
}
for (b = r->buildings; b; b = b->next) { for (b = r->buildings; b; b = b->next) {
if (b->type == bt_castle && b->size >= 2) { if (b->type == bt_castle && b->size >= 2) {
@ -1795,8 +1799,14 @@ static void expandselling(region * r, request * sellorders, int limit)
unit *hafenowner; unit *hafenowner;
static int counter[MAXLUXURIES]; static int counter[MAXLUXURIES];
static int ncounter = 0; static int ncounter = 0;
const struct building_type *castle_bt; static int bt_cache;
static const struct building_type *castle_bt, *harbour_bt, *caravan_bt;
if (bt_changed(&bt_cache)) {
castle_bt = bt_find("castle");
harbour_bt = bt_find("harbour");
caravan_bt = bt_find("caravan");
}
if (ncounter == 0) { if (ncounter == 0) {
const luxury_type *ltype; const luxury_type *ltype;
for (ltype = luxurytypes; ltype; ltype = ltype->next) { for (ltype = luxurytypes; ltype; ltype = ltype->next) {
@ -1811,7 +1821,6 @@ static void expandselling(region * r, request * sellorders, int limit)
} }
/* Stelle Eigentümer der größten Burg fest. Bekommt Steuern aus jedem /* Stelle Eigentümer der größten Burg fest. Bekommt Steuern aus jedem
* Verkauf. Wenn zwei Burgen gleicher Größe bekommt gar keiner etwas. */ * Verkauf. Wenn zwei Burgen gleicher Größe bekommt gar keiner etwas. */
castle_bt = bt_find("castle");
for (b = rbuildings(r); b; b = b->next) { for (b = rbuildings(r); b; b = b->next) {
if (b->size > maxsize && building_owner(b) != NULL if (b->size > maxsize && building_owner(b) != NULL
&& b->type == castle_bt) { && b->type == castle_bt) {
@ -1825,7 +1834,7 @@ static void expandselling(region * r, request * sellorders, int limit)
} }
} }
hafenowner = owner_buildingtyp(r, bt_find("harbour")); hafenowner = owner_buildingtyp(r, harbour_bt);
if (maxb != (building *)NULL && maxowner != (unit *)NULL) { if (maxb != (building *)NULL && maxowner != (unit *)NULL) {
maxeffsize = buildingeffsize(maxb, false); maxeffsize = buildingeffsize(maxb, false);
@ -1847,7 +1856,7 @@ static void expandselling(region * r, request * sellorders, int limit)
return; return;
if (r->terrain == newterrain(T_DESERT) if (r->terrain == newterrain(T_DESERT)
&& buildingtype_exists(r, bt_find("caravan"), true)) { && buildingtype_exists(r, caravan_bt, true)) {
max_products = rpeasants(r) * 2 / TRADE_FRACTION; max_products = rpeasants(r) * 2 / TRADE_FRACTION;
} }
/* Verkauf: so programmiert, dass er leicht auf mehrere Gueter pro /* Verkauf: so programmiert, dass er leicht auf mehrere Gueter pro
@ -1974,6 +1983,13 @@ static bool sell(unit * u, request ** sellorders, struct order *ord)
region *r = u->region; region *r = u->region;
const char *s; const char *s;
keyword_t kwd; keyword_t kwd;
static int bt_cache;
static const struct building_type *castle_bt, *caravan_bt;
if (bt_changed(&bt_cache)) {
castle_bt = bt_find("castle");
caravan_bt = bt_find("caravan");
}
if (u->ship && is_guarded(r, u, GUARD_CREWS)) { if (u->ship && is_guarded(r, u, GUARD_CREWS)) {
cmistake(u, ord, 69, MSG_INCOME); cmistake(u, ord, 69, MSG_INCOME);
@ -1990,7 +2006,7 @@ static bool sell(unit * u, request ** sellorders, struct order *ord)
unlimited = false; unlimited = false;
n = rpeasants(r) / TRADE_FRACTION; n = rpeasants(r) / TRADE_FRACTION;
if (r->terrain == newterrain(T_DESERT) if (r->terrain == newterrain(T_DESERT)
&& buildingtype_exists(r, bt_find("caravan"), true)) && buildingtype_exists(r, caravan_bt, true))
n *= 2; n *= 2;
if (n == 0) { if (n == 0) {
cmistake(u, ord, 303, MSG_COMMERCE); cmistake(u, ord, 303, MSG_COMMERCE);
@ -2023,9 +2039,8 @@ static bool sell(unit * u, request ** sellorders, struct order *ord)
/* ...oder in der Region muß es eine Burg geben. */ /* ...oder in der Region muß es eine Burg geben. */
building *b = 0; building *b = 0;
if (r->buildings) { if (r->buildings) {
const struct building_type *bt_castle = bt_find("castle");
for (b = r->buildings; b; b = b->next) { for (b = r->buildings; b; b = b->next) {
if (b->type == bt_castle && b->size >= 2) break; if (b->type == castle_bt && b->size >= 2) break;
} }
} }
if (!b) { if (!b) {
@ -2340,9 +2355,15 @@ static void breedhorses(unit * u)
int n, c, breed = 0; int n, c, breed = 0;
const struct resource_type *rhorse = get_resourcetype(R_HORSE); const struct resource_type *rhorse = get_resourcetype(R_HORSE);
int horses, effsk; int horses, effsk;
static int bt_cache;
static const struct building_type *stables_bt;
if (bt_changed(&bt_cache)) {
stables_bt = bt_find("stables");
}
assert(rhorse && rhorse->itype); assert(rhorse && rhorse->itype);
if (!active_building(u, bt_find("stables"))) { if (!active_building(u, stables_bt)) {
cmistake(u, u->thisorder, 122, MSG_PRODUCE); cmistake(u, u->thisorder, 122, MSG_PRODUCE);
return; return;
} }
@ -3079,6 +3100,13 @@ void produce(struct region *r)
unit *u; unit *u;
bool limited = true; bool limited = true;
request *nextworker = workers; request *nextworker = workers;
static int bt_cache;
static const struct building_type *caravan_bt;
if (bt_changed(&bt_cache)) {
caravan_bt = bt_find("caravan");
}
assert(r); assert(r);
/* das sind alles befehle, die 30 tage brauchen, und die in thisorder /* das sind alles befehle, die 30 tage brauchen, und die in thisorder
@ -3228,7 +3256,7 @@ void produce(struct region *r)
if (sellorders) { if (sellorders) {
int limit = rpeasants(r) / TRADE_FRACTION; int limit = rpeasants(r) / TRADE_FRACTION;
if (r->terrain == newterrain(T_DESERT) if (r->terrain == newterrain(T_DESERT)
&& buildingtype_exists(r, bt_find("caravan"), true)) && buildingtype_exists(r, caravan_bt, true))
limit *= 2; limit *= 2;
expandselling(r, sellorders, limited ? limit : INT_MAX); expandselling(r, sellorders, limited ? limit : INT_MAX);
} }