newgrf_town.cpp

Go to the documentation of this file.
00001 /* $Id: newgrf_town.cpp 24228 2012-05-12 07:31:25Z rubidium $ */
00002 
00003 /*
00004  * This file is part of OpenTTD.
00005  * OpenTTD is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, version 2.
00006  * OpenTTD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
00007  * See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with OpenTTD. If not, see <http://www.gnu.org/licenses/>.
00008  */
00009 
00012 #include "stdafx.h"
00013 #include "debug.h"
00014 #include "town.h"
00015 #include "newgrf_spritegroup.h"
00016 
00026 uint32 TownGetVariable(byte variable, uint32 parameter, bool *available, Town *t, const GRFFile *caller_grffile)
00027 {
00028   switch (variable) {
00029     /* Larger towns */
00030     case 0x40:
00031       if (_settings_game.economy.larger_towns == 0) return 2;
00032       if (t->larger_town) return 1;
00033       return 0;
00034 
00035     /* Town index */
00036     case 0x41: return t->index;
00037 
00038     /* Get a variable from the persistent storage */
00039     case 0x7C: {
00040       /* Check the persistent storage for the GrfID stored in register 100h. */
00041       uint32 grfid = GetRegister(0x100);
00042       if (grfid == 0xFFFFFFFF) {
00043         if (caller_grffile == NULL) return 0;
00044         grfid = caller_grffile->grfid;
00045       }
00046 
00047       std::list<PersistentStorage *>::iterator iter;
00048       for (iter = t->psa_list.begin(); iter != t->psa_list.end(); iter++) {
00049         if ((*iter)->grfid == grfid) return (*iter)->GetValue(parameter);
00050       }
00051 
00052       return 0;
00053     }
00054 
00055     /* Town properties */
00056     case 0x80: return t->xy;
00057     case 0x81: return GB(t->xy, 8, 8);
00058     case 0x82: return ClampToU16(t->cache.population);
00059     case 0x83: return GB(ClampToU16(t->cache.population), 8, 8);
00060     case 0x8A: return t->grow_counter;
00061     case 0x92: return t->flags;  // In original game, 0x92 and 0x93 are really one word. Since flags is a byte, this is to adjust
00062     case 0x93: return 0;
00063     case 0x94: return ClampToU16(t->cache.squared_town_zone_radius[0]);
00064     case 0x95: return GB(ClampToU16(t->cache.squared_town_zone_radius[0]), 8, 8);
00065     case 0x96: return ClampToU16(t->cache.squared_town_zone_radius[1]);
00066     case 0x97: return GB(ClampToU16(t->cache.squared_town_zone_radius[1]), 8, 8);
00067     case 0x98: return ClampToU16(t->cache.squared_town_zone_radius[2]);
00068     case 0x99: return GB(ClampToU16(t->cache.squared_town_zone_radius[2]), 8, 8);
00069     case 0x9A: return ClampToU16(t->cache.squared_town_zone_radius[3]);
00070     case 0x9B: return GB(ClampToU16(t->cache.squared_town_zone_radius[3]), 8, 8);
00071     case 0x9C: return ClampToU16(t->cache.squared_town_zone_radius[4]);
00072     case 0x9D: return GB(ClampToU16(t->cache.squared_town_zone_radius[4]), 8, 8);
00073     case 0x9E: return t->ratings[0];
00074     case 0x9F: return GB(t->ratings[0], 8, 8);
00075     case 0xA0: return t->ratings[1];
00076     case 0xA1: return GB(t->ratings[1], 8, 8);
00077     case 0xA2: return t->ratings[2];
00078     case 0xA3: return GB(t->ratings[2], 8, 8);
00079     case 0xA4: return t->ratings[3];
00080     case 0xA5: return GB(t->ratings[3], 8, 8);
00081     case 0xA6: return t->ratings[4];
00082     case 0xA7: return GB(t->ratings[4], 8, 8);
00083     case 0xA8: return t->ratings[5];
00084     case 0xA9: return GB(t->ratings[5], 8, 8);
00085     case 0xAA: return t->ratings[6];
00086     case 0xAB: return GB(t->ratings[6], 8, 8);
00087     case 0xAC: return t->ratings[7];
00088     case 0xAD: return GB(t->ratings[7], 8, 8);
00089     case 0xAE: return t->have_ratings;
00090     case 0xB2: return t->statues;
00091     case 0xB6: return ClampToU16(t->cache.num_houses);
00092     case 0xB9: return t->growth_rate & (~TOWN_GROW_RATE_CUSTOM);
00093     case 0xBA: return ClampToU16(t->supplied[CT_PASSENGERS].new_max);
00094     case 0xBB: return GB(ClampToU16(t->supplied[CT_PASSENGERS].new_max), 8, 8);
00095     case 0xBC: return ClampToU16(t->supplied[CT_MAIL].new_max);
00096     case 0xBD: return GB(ClampToU16(t->supplied[CT_MAIL].new_max), 8, 8);
00097     case 0xBE: return ClampToU16(t->supplied[CT_PASSENGERS].new_act);
00098     case 0xBF: return GB(ClampToU16(t->supplied[CT_PASSENGERS].new_act), 8, 8);
00099     case 0xC0: return ClampToU16(t->supplied[CT_MAIL].new_act);
00100     case 0xC1: return GB(ClampToU16(t->supplied[CT_MAIL].new_act), 8, 8);
00101     case 0xC2: return ClampToU16(t->supplied[CT_PASSENGERS].old_max);
00102     case 0xC3: return GB(ClampToU16(t->supplied[CT_PASSENGERS].old_max), 8, 8);
00103     case 0xC4: return ClampToU16(t->supplied[CT_MAIL].old_max);
00104     case 0xC5: return GB(ClampToU16(t->supplied[CT_MAIL].old_max), 8, 8);
00105     case 0xC6: return ClampToU16(t->supplied[CT_PASSENGERS].old_act);
00106     case 0xC7: return GB(ClampToU16(t->supplied[CT_PASSENGERS].old_act), 8, 8);
00107     case 0xC8: return ClampToU16(t->supplied[CT_MAIL].old_act);
00108     case 0xC9: return GB(ClampToU16(t->supplied[CT_MAIL].old_act), 8, 8);
00109     case 0xCA: return t->GetPercentTransported(CT_PASSENGERS);
00110     case 0xCB: return t->GetPercentTransported(CT_MAIL);
00111     case 0xCC: return t->received[TE_FOOD].new_act;
00112     case 0xCD: return GB(t->received[TE_FOOD].new_act, 8, 8);
00113     case 0xCE: return t->received[TE_WATER].new_act;
00114     case 0xCF: return GB(t->received[TE_WATER].new_act, 8, 8);
00115     case 0xD0: return t->received[TE_FOOD].old_act;
00116     case 0xD1: return GB(t->received[TE_FOOD].old_act, 8, 8);
00117     case 0xD2: return t->received[TE_WATER].old_act;
00118     case 0xD3: return GB(t->received[TE_WATER].old_act, 8, 8);
00119     case 0xD4: return t->road_build_months;
00120     case 0xD5: return t->fund_buildings_months;
00121   }
00122 
00123   DEBUG(grf, 1, "Unhandled town variable 0x%X", variable);
00124 
00125   *available = false;
00126   return UINT_MAX;
00127 }
00128 
00137 void TownStorePSA(Town *t, const GRFFile *caller_grffile, uint pos, int32 value)
00138 {
00139   assert(t != NULL);
00140   /* We can't store anything if the caller has no #GRFFile. */
00141   if (caller_grffile == NULL) return;
00142 
00143   /* Check the persistent storage for the GrfID stored in register 100h. */
00144   uint32 grfid = GetRegister(0x100);
00145 
00146   /* A NewGRF can only write in the persistent storage associated to its own GRFID. */
00147   if (grfid == 0xFFFFFFFF) grfid = caller_grffile->grfid;
00148   if (grfid != caller_grffile->grfid) return;
00149 
00150   /* Check if the storage exists. */
00151   std::list<PersistentStorage *>::iterator iter;
00152   for (iter = t->psa_list.begin(); iter != t->psa_list.end(); iter++) {
00153     if ((*iter)->grfid == grfid) {
00154       (*iter)->StoreValue(pos, value);
00155       return;
00156     }
00157   }
00158 
00159   /* Create a new storage. */
00160   assert(PersistentStorage::CanAllocateItem());
00161   PersistentStorage *psa = new PersistentStorage(grfid);
00162   psa->StoreValue(pos, value);
00163   t->psa_list.push_back(psa);
00164 }