2006-04-21 03:00:20 +00:00
|
|
|
/* $Id$ */
|
|
|
|
|
2009-08-21 20:21:05 +00:00
|
|
|
/*
|
|
|
|
* This file is part of OpenTTD.
|
|
|
|
* 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.
|
|
|
|
* 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.
|
|
|
|
* 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/>.
|
|
|
|
*/
|
|
|
|
|
2010-08-01 19:22:34 +00:00
|
|
|
/**
|
|
|
|
* @file newgrf_text.cpp
|
2006-04-21 03:00:20 +00:00
|
|
|
* Implementation of Action 04 "universal holder" structure and functions.
|
|
|
|
* This file implements a linked-lists of strings,
|
|
|
|
* holding everything that the newgrf action 04 will send over to OpenTTD.
|
|
|
|
* One of the biggest problems is that Dynamic lang Array uses ISO codes
|
|
|
|
* as way to identifying current user lang, while newgrf uses bit shift codes
|
|
|
|
* not related to ISO. So equivalence functionnality had to be set.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "stdafx.h"
|
2006-12-26 17:36:18 +00:00
|
|
|
#include "newgrf.h"
|
2007-12-21 19:49:27 +00:00
|
|
|
#include "strings_func.h"
|
2008-01-07 14:02:26 +00:00
|
|
|
#include "newgrf_storage.h"
|
2010-11-16 12:35:16 +00:00
|
|
|
#include "newgrf_text.h"
|
2008-01-07 14:23:25 +00:00
|
|
|
#include "string_func.h"
|
2008-03-31 06:42:26 +00:00
|
|
|
#include "date_type.h"
|
2009-09-20 10:21:00 +00:00
|
|
|
#include "debug.h"
|
2010-11-16 16:58:19 +00:00
|
|
|
#include "core/alloc_type.hpp"
|
|
|
|
#include "core/smallmap_type.hpp"
|
2010-11-16 14:00:02 +00:00
|
|
|
#include "language.h"
|
2006-04-21 03:00:20 +00:00
|
|
|
|
2008-01-13 01:21:35 +00:00
|
|
|
#include "table/strings.h"
|
|
|
|
#include "table/control_codes.h"
|
|
|
|
|
2006-04-21 03:00:20 +00:00
|
|
|
#define GRFTAB 28
|
|
|
|
#define TABSIZE 11
|
|
|
|
|
2009-09-20 10:21:00 +00:00
|
|
|
/**
|
|
|
|
* Perform a mapping from TTDPatch's string IDs to OpenTTD's
|
|
|
|
* string IDs, but only for the ones we are aware off; the rest
|
|
|
|
* like likely unused and will show a warning.
|
|
|
|
* @param str the string ID to convert
|
|
|
|
* @return the converted string ID
|
|
|
|
*/
|
|
|
|
StringID TTDPStringIDToOTTDStringIDMapping(StringID str)
|
|
|
|
{
|
|
|
|
/* StringID table for TextIDs 0x4E->0x6D */
|
|
|
|
static const StringID units_volume[] = {
|
2010-11-17 18:04:11 +00:00
|
|
|
STR_ITEMS, STR_PASSENGERS, STR_TONS, STR_BAGS,
|
2009-09-20 10:21:00 +00:00
|
|
|
STR_LITERS, STR_ITEMS, STR_CRATES, STR_TONS,
|
|
|
|
STR_TONS, STR_TONS, STR_TONS, STR_BAGS,
|
|
|
|
STR_TONS, STR_TONS, STR_TONS, STR_BAGS,
|
|
|
|
STR_TONS, STR_TONS, STR_BAGS, STR_LITERS,
|
2010-11-17 18:04:11 +00:00
|
|
|
STR_TONS, STR_LITERS, STR_TONS, STR_ITEMS,
|
|
|
|
STR_BAGS, STR_LITERS, STR_TONS, STR_ITEMS,
|
|
|
|
STR_TONS, STR_ITEMS, STR_LITERS, STR_ITEMS
|
2009-09-20 10:21:00 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/* A string straight from a NewGRF; no need to remap this as it's already mapped. */
|
2011-09-03 16:10:42 +00:00
|
|
|
if (IsInsideMM(str, 0xD000, 0xD7FF)) return str;
|
2009-09-20 10:21:00 +00:00
|
|
|
|
2011-09-23 19:27:08 +00:00
|
|
|
#define TEXTID_TO_STRINGID(begin, end, stringid, stringend) \
|
|
|
|
assert_compile(stringend - stringid == end - begin); \
|
|
|
|
if (str >= begin && str <= end) return str + (stringid - begin)
|
|
|
|
|
2009-09-20 10:21:00 +00:00
|
|
|
/* We have some changes in our cargo strings, resulting in some missing. */
|
2011-09-23 19:27:08 +00:00
|
|
|
TEXTID_TO_STRINGID(0x000E, 0x002D, STR_CARGO_PLURAL_NOTHING, STR_CARGO_PLURAL_FIZZY_DRINKS);
|
|
|
|
TEXTID_TO_STRINGID(0x002E, 0x004D, STR_CARGO_SINGULAR_NOTHING, STR_CARGO_SINGULAR_FIZZY_DRINK);
|
2009-09-20 10:21:00 +00:00
|
|
|
if (str >= 0x004E && str <= 0x006D) return units_volume[str - 0x004E];
|
2011-09-23 19:27:08 +00:00
|
|
|
TEXTID_TO_STRINGID(0x006E, 0x008D, STR_QUANTITY_NOTHING, STR_QUANTITY_FIZZY_DRINKS);
|
|
|
|
TEXTID_TO_STRINGID(0x008E, 0x00AD, STR_ABBREV_NOTHING, STR_ABBREV_FIZZY_DRINKS);
|
|
|
|
TEXTID_TO_STRINGID(0x00D1, 0x00E0, STR_COLOUR_DARK_BLUE, STR_COLOUR_WHITE);
|
2009-09-20 10:21:00 +00:00
|
|
|
|
|
|
|
/* Map building names according to our lang file changes. There are several
|
|
|
|
* ranges of house ids, all of which need to be remapped to allow newgrfs
|
|
|
|
* to use original house names. */
|
2011-09-23 19:27:08 +00:00
|
|
|
TEXTID_TO_STRINGID(0x200F, 0x201F, STR_TOWN_BUILDING_NAME_TALL_OFFICE_BLOCK_1, STR_TOWN_BUILDING_NAME_OLD_HOUSES_1);
|
|
|
|
TEXTID_TO_STRINGID(0x2036, 0x2041, STR_TOWN_BUILDING_NAME_COTTAGES_1, STR_TOWN_BUILDING_NAME_SHOPPING_MALL_1);
|
|
|
|
TEXTID_TO_STRINGID(0x2059, 0x205C, STR_TOWN_BUILDING_NAME_IGLOO_1, STR_TOWN_BUILDING_NAME_PIGGY_BANK_1);
|
2009-09-20 10:21:00 +00:00
|
|
|
|
|
|
|
/* Same thing for industries */
|
2011-09-23 19:27:08 +00:00
|
|
|
TEXTID_TO_STRINGID(0x4802, 0x4826, STR_INDUSTRY_NAME_COAL_MINE, STR_INDUSTRY_NAME_SUGAR_MINE);
|
|
|
|
TEXTID_TO_STRINGID(0x482D, 0x482E, STR_NEWS_INDUSTRY_CONSTRUCTION, STR_NEWS_INDUSTRY_PLANTED);
|
|
|
|
TEXTID_TO_STRINGID(0x4832, 0x4834, STR_NEWS_INDUSTRY_CLOSURE_GENERAL, STR_NEWS_INDUSTRY_CLOSURE_LACK_OF_TREES);
|
|
|
|
TEXTID_TO_STRINGID(0x4835, 0x4838, STR_NEWS_INDUSTRY_PRODUCTION_INCREASE_GENERAL, STR_NEWS_INDUSTRY_PRODUCTION_INCREASE_FARM);
|
|
|
|
TEXTID_TO_STRINGID(0x4839, 0x483A, STR_NEWS_INDUSTRY_PRODUCTION_DECREASE_GENERAL, STR_NEWS_INDUSTRY_PRODUCTION_DECREASE_FARM);
|
2009-09-20 10:21:00 +00:00
|
|
|
|
|
|
|
switch (str) {
|
|
|
|
case 0x4830: return STR_ERROR_CAN_T_CONSTRUCT_THIS_INDUSTRY;
|
|
|
|
case 0x4831: return STR_ERROR_FOREST_CAN_ONLY_BE_PLANTED;
|
|
|
|
case 0x483B: return STR_ERROR_CAN_ONLY_BE_POSITIONED;
|
|
|
|
}
|
|
|
|
#undef TEXTID_TO_STRINGID
|
|
|
|
|
|
|
|
if (str == STR_NULL) return STR_EMPTY;
|
|
|
|
|
|
|
|
DEBUG(grf, 0, "Unknown StringID 0x%04X remapped to STR_EMPTY. Please open a Feature Request if you need it", str);
|
|
|
|
|
|
|
|
return STR_EMPTY;
|
|
|
|
}
|
|
|
|
|
2006-04-21 03:00:20 +00:00
|
|
|
/**
|
2009-12-13 21:12:36 +00:00
|
|
|
* Explains the newgrf shift bit positioning.
|
2006-04-21 03:00:20 +00:00
|
|
|
* the grf base will not be used in order to find the string, but rather for
|
|
|
|
* jumping from standard langID scheme to the new one.
|
|
|
|
*/
|
2009-03-13 00:30:26 +00:00
|
|
|
enum GRFBaseLanguages {
|
2006-04-21 03:00:20 +00:00
|
|
|
GRFLB_AMERICAN = 0x01,
|
|
|
|
GRFLB_ENGLISH = 0x02,
|
|
|
|
GRFLB_GERMAN = 0x04,
|
|
|
|
GRFLB_FRENCH = 0x08,
|
|
|
|
GRFLB_SPANISH = 0x10,
|
|
|
|
GRFLB_GENERIC = 0x80,
|
2007-03-07 12:11:48 +00:00
|
|
|
};
|
2006-04-21 03:00:20 +00:00
|
|
|
|
2009-03-13 00:30:26 +00:00
|
|
|
enum GRFExtendedLanguages {
|
2006-04-21 03:00:20 +00:00
|
|
|
GRFLX_AMERICAN = 0x00,
|
|
|
|
GRFLX_ENGLISH = 0x01,
|
|
|
|
GRFLX_GERMAN = 0x02,
|
|
|
|
GRFLX_FRENCH = 0x03,
|
|
|
|
GRFLX_SPANISH = 0x04,
|
2006-04-23 18:27:53 +00:00
|
|
|
GRFLX_UNSPECIFIED = 0x7F,
|
2007-03-07 12:11:48 +00:00
|
|
|
};
|
2006-04-21 03:00:20 +00:00
|
|
|
|
2006-08-19 16:30:05 +00:00
|
|
|
/**
|
|
|
|
* Element of the linked list.
|
|
|
|
* Each of those elements represent the string,
|
|
|
|
* but according to a different lang.
|
|
|
|
*/
|
2007-01-14 08:37:16 +00:00
|
|
|
struct GRFText {
|
2009-11-11 20:43:06 +00:00
|
|
|
public:
|
2010-11-16 11:25:19 +00:00
|
|
|
/**
|
|
|
|
* Allocate, and assign a new GRFText with the given text.
|
2010-11-16 11:34:19 +00:00
|
|
|
* As these strings can have string terminations in them, e.g.
|
|
|
|
* due to "choice lists" we (sometimes) cannot rely on detecting
|
|
|
|
* the length by means of strlen. Also, if the length of already
|
|
|
|
* known not scanning the whole string is more efficient.
|
2010-11-16 11:25:19 +00:00
|
|
|
* @param langid The language of the text.
|
|
|
|
* @param text The text to store in the new GRFText.
|
2010-11-16 11:34:19 +00:00
|
|
|
* @param len The length of the text.
|
2010-11-16 11:25:19 +00:00
|
|
|
*/
|
2010-11-17 19:43:15 +00:00
|
|
|
static GRFText *New(byte langid, const char *text, size_t len)
|
2009-11-11 20:43:06 +00:00
|
|
|
{
|
2010-11-16 11:34:19 +00:00
|
|
|
return new (len) GRFText(langid, text, len);
|
2009-11-11 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2010-07-31 09:33:39 +00:00
|
|
|
/**
|
|
|
|
* Create a copy of this GRFText.
|
2010-11-16 11:25:19 +00:00
|
|
|
* @param orig the grftext to copy.
|
|
|
|
* @return an exact copy of the given text.
|
2010-07-31 09:33:39 +00:00
|
|
|
*/
|
|
|
|
static GRFText *Copy(GRFText *orig)
|
|
|
|
{
|
2010-11-16 11:34:19 +00:00
|
|
|
return GRFText::New(orig->langid, orig->text, orig->len);
|
2010-07-31 09:33:39 +00:00
|
|
|
}
|
|
|
|
|
2009-11-11 21:15:58 +00:00
|
|
|
/**
|
|
|
|
* Helper allocation function to disallow something.
|
|
|
|
* Don't allow simple 'news'; they wouldn't have enough memory.
|
2010-11-16 11:25:19 +00:00
|
|
|
* @param size the amount of space not to allocate.
|
2009-11-11 21:15:58 +00:00
|
|
|
*/
|
|
|
|
void *operator new(size_t size)
|
|
|
|
{
|
|
|
|
NOT_REACHED();
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-11-16 11:25:19 +00:00
|
|
|
* Free the memory we allocated.
|
|
|
|
* @param p memory to free.
|
2009-11-11 21:15:58 +00:00
|
|
|
*/
|
|
|
|
void operator delete(void *p)
|
|
|
|
{
|
|
|
|
free(p);
|
|
|
|
}
|
2009-11-11 20:43:06 +00:00
|
|
|
private:
|
2010-11-16 11:25:19 +00:00
|
|
|
/**
|
|
|
|
* Actually construct the GRFText.
|
|
|
|
* @param langid_ The language of the text.
|
|
|
|
* @param text_ The text to store in this GRFText.
|
2010-11-16 11:34:19 +00:00
|
|
|
* @param len_ The length of the text to store.
|
2010-11-16 11:25:19 +00:00
|
|
|
*/
|
2010-11-17 19:43:15 +00:00
|
|
|
GRFText(byte langid_, const char *text_, size_t len_) : next(NULL), len(len_), langid(langid_)
|
2009-11-11 20:43:06 +00:00
|
|
|
{
|
2010-11-16 11:34:19 +00:00
|
|
|
/* We need to use memcpy instead of strcpy due to
|
|
|
|
* the possibility of "choice lists" and therefor
|
|
|
|
* intermediate string terminators. */
|
|
|
|
memcpy(this->text, text_, len);
|
2009-11-11 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2009-11-11 21:15:58 +00:00
|
|
|
/**
|
|
|
|
* Allocate memory for this class.
|
|
|
|
* @param size the size of the instance
|
|
|
|
* @param extra the extra memory for the text
|
|
|
|
* @return the requested amount of memory for both the instance and the text
|
|
|
|
*/
|
2009-11-11 20:43:06 +00:00
|
|
|
void *operator new(size_t size, size_t extra)
|
|
|
|
{
|
2009-11-11 21:15:58 +00:00
|
|
|
return MallocT<byte>(size + extra);
|
2009-11-11 20:43:06 +00:00
|
|
|
}
|
2007-01-14 08:37:16 +00:00
|
|
|
|
2007-01-14 13:21:02 +00:00
|
|
|
public:
|
2010-11-16 11:25:19 +00:00
|
|
|
GRFText *next; ///< The next GRFText in this chain.
|
2010-11-17 19:43:15 +00:00
|
|
|
size_t len; ///< The length of the stored string, used for copying.
|
2010-11-16 11:25:19 +00:00
|
|
|
byte langid; ///< The language associated with this GRFText.
|
|
|
|
char text[]; ///< The actual (translated) text.
|
2007-01-14 08:37:16 +00:00
|
|
|
};
|
2006-08-19 16:30:05 +00:00
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Holder of the above structure.
|
|
|
|
* Putting both grfid and stringid together allows us to avoid duplicates,
|
|
|
|
* since it is NOT SUPPOSED to happen.
|
|
|
|
*/
|
2007-03-07 12:11:48 +00:00
|
|
|
struct GRFTextEntry {
|
2006-08-19 16:30:05 +00:00
|
|
|
uint32 grfid;
|
|
|
|
uint16 stringid;
|
|
|
|
StringID def_string;
|
|
|
|
GRFText *textholder;
|
2007-03-07 12:11:48 +00:00
|
|
|
};
|
2006-08-19 16:30:05 +00:00
|
|
|
|
|
|
|
|
2006-04-21 03:00:20 +00:00
|
|
|
static uint _num_grf_texts = 0;
|
|
|
|
static GRFTextEntry _grf_text[(1 << TABSIZE) * 3];
|
2007-03-21 03:06:21 +00:00
|
|
|
static byte _currentLangID = GRFLX_ENGLISH; ///< by default, english is used.
|
2006-04-21 03:00:20 +00:00
|
|
|
|
2010-11-16 14:00:02 +00:00
|
|
|
/**
|
|
|
|
* Get the mapping from the NewGRF supplied ID to OpenTTD's internal ID.
|
|
|
|
* @param newgrf_id The NewGRF ID to map.
|
|
|
|
* @param gender Whether to map genders or cases.
|
|
|
|
* @return The, to OpenTTD's internal ID, mapped index, or -1 if there is no mapping.
|
|
|
|
*/
|
|
|
|
int LanguageMap::GetMapping(int newgrf_id, bool gender) const
|
|
|
|
{
|
|
|
|
const SmallVector<Mapping, 1> &map = gender ? this->gender_map : this->case_map;
|
|
|
|
for (const Mapping *m = map.Begin(); m != map.End(); m++) {
|
|
|
|
if (m->newgrf_id == newgrf_id) return m->openttd_id;
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
2006-04-21 03:00:20 +00:00
|
|
|
|
2010-11-16 16:58:19 +00:00
|
|
|
/**
|
|
|
|
* Get the mapping from OpenTTD's internal ID to the NewGRF supplied ID.
|
|
|
|
* @param openttd_id The OpenTTD ID to map.
|
|
|
|
* @param gender Whether to map genders or cases.
|
|
|
|
* @return The, to the NewGRF supplied ID, mapped index, or -1 if there is no mapping.
|
|
|
|
*/
|
|
|
|
int LanguageMap::GetReverseMapping(int openttd_id, bool gender) const
|
|
|
|
{
|
|
|
|
const SmallVector<Mapping, 1> &map = gender ? this->gender_map : this->case_map;
|
|
|
|
for (const Mapping *m = map.Begin(); m != map.End(); m++) {
|
|
|
|
if (m->openttd_id == openttd_id) return m->newgrf_id;
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Helper structure for mapping choice lists. */
|
|
|
|
struct UnmappedChoiceList : ZeroedMemoryAllocator {
|
|
|
|
/** Clean everything up. */
|
|
|
|
~UnmappedChoiceList()
|
|
|
|
{
|
|
|
|
for (SmallPair<byte, char *> *p = this->strings.Begin(); p < this->strings.End(); p++) {
|
|
|
|
free(p->second);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Initialise the mapping.
|
|
|
|
* @param type The type of mapping.
|
|
|
|
* @param old_d The old begin of the string, i.e. from where to start writing again.
|
2010-11-16 21:03:39 +00:00
|
|
|
* @param offset The offset to get the plural/gender from.
|
2010-11-16 16:58:19 +00:00
|
|
|
*/
|
|
|
|
UnmappedChoiceList(StringControlCode type, char *old_d, int offset) :
|
|
|
|
type(type), old_d(old_d), offset(offset)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
StringControlCode type; ///< The type of choice list.
|
|
|
|
char *old_d; ///< The old/original location of the "d" local variable.
|
2010-11-16 21:03:39 +00:00
|
|
|
int offset; ///< The offset for the plural/gender form.
|
2010-11-16 16:58:19 +00:00
|
|
|
|
|
|
|
/** Mapping of NewGRF supplied ID to the different strings in the choice list. */
|
|
|
|
SmallMap<byte, char *> strings;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Flush this choice list into the old d variable.
|
|
|
|
* @param lm The current language mapping.
|
|
|
|
* @return The new location of the output string.
|
|
|
|
*/
|
|
|
|
char *Flush(const LanguageMap *lm)
|
|
|
|
{
|
|
|
|
if (!this->strings.Contains(0)) {
|
|
|
|
/* In case of a (broken) NewGRF without a default,
|
|
|
|
* assume an empty string. */
|
|
|
|
grfmsg(1, "choice list misses default value");
|
|
|
|
this->strings[0] = strdup("");
|
|
|
|
}
|
|
|
|
|
|
|
|
char *d = old_d;
|
2010-11-16 21:03:39 +00:00
|
|
|
if (lm == NULL && this->type != SCC_PLURAL_LIST) {
|
2011-08-12 18:14:15 +00:00
|
|
|
/* In case there is no mapping, just ignore everything but the default.
|
|
|
|
* A probable cause for this happening is when the language file has
|
|
|
|
* been removed by the user and as such no mapping could be made. */
|
2010-11-17 19:43:15 +00:00
|
|
|
size_t len = strlen(this->strings[0]);
|
2010-11-16 16:58:19 +00:00
|
|
|
memcpy(d, this->strings[0], len);
|
|
|
|
return d + len;
|
|
|
|
}
|
|
|
|
|
|
|
|
d += Utf8Encode(d, this->type);
|
|
|
|
|
|
|
|
if (this->type == SCC_SWITCH_CASE) {
|
|
|
|
/*
|
|
|
|
* Format for case switch:
|
|
|
|
* <NUM CASES> <CASE1> <LEN1> <STRING1> <CASE2> <LEN2> <STRING2> <CASE3> <LEN3> <STRING3> <STRINGDEFAULT>
|
|
|
|
* Each LEN is printed using 2 bytes in big endian order.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* "<NUM CASES>" */
|
|
|
|
int count = 0;
|
|
|
|
for (uint8 i = 0; i < _current_language->num_cases; i++) {
|
|
|
|
/* Count the ones we have a mapped string for. */
|
|
|
|
if (this->strings.Contains(lm->GetReverseMapping(i, false))) count++;
|
|
|
|
}
|
|
|
|
*d++ = count;
|
|
|
|
|
|
|
|
for (uint8 i = 0; i < _current_language->num_cases; i++) {
|
|
|
|
/* Resolve the string we're looking for. */
|
|
|
|
int idx = lm->GetReverseMapping(i, false);
|
|
|
|
if (!this->strings.Contains(idx)) continue;
|
|
|
|
char *str = this->strings[idx];
|
|
|
|
|
|
|
|
/* "<CASEn>" */
|
2010-11-25 23:14:25 +00:00
|
|
|
*d++ = i + 1;
|
2010-11-16 16:58:19 +00:00
|
|
|
|
|
|
|
/* "<LENn>" */
|
2010-11-25 23:10:35 +00:00
|
|
|
size_t len = strlen(str) + 1;
|
2010-11-16 16:58:19 +00:00
|
|
|
*d++ = GB(len, 8, 8);
|
|
|
|
*d++ = GB(len, 0, 8);
|
|
|
|
|
|
|
|
/* "<STRINGn>" */
|
|
|
|
memcpy(d, str, len);
|
|
|
|
d += len;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* "<STRINGDEFAULT>" */
|
2010-11-25 23:10:35 +00:00
|
|
|
size_t len = strlen(this->strings[0]) + 1;
|
2010-11-16 16:58:19 +00:00
|
|
|
memcpy(d, this->strings[0], len);
|
|
|
|
d += len;
|
|
|
|
} else {
|
2010-11-16 21:03:39 +00:00
|
|
|
if (this->type == SCC_PLURAL_LIST) {
|
|
|
|
*d++ = lm->plural_form;
|
|
|
|
}
|
|
|
|
|
2010-11-16 16:58:19 +00:00
|
|
|
/*
|
|
|
|
* Format for choice list:
|
|
|
|
* <OFFSET> <NUM CHOICES> <LENs> <STRINGs>
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* "<OFFSET>" */
|
|
|
|
*d++ = this->offset - 0x80;
|
|
|
|
|
|
|
|
/* "<NUM CHOICES>" */
|
2010-11-16 21:03:39 +00:00
|
|
|
int count = (this->type == SCC_GENDER_LIST ? _current_language->num_genders : LANGUAGE_MAX_PLURAL_FORMS);
|
2010-11-16 16:58:19 +00:00
|
|
|
*d++ = count;
|
|
|
|
|
|
|
|
/* "<LENs>" */
|
|
|
|
for (int i = 0; i < count; i++) {
|
2010-11-16 21:03:39 +00:00
|
|
|
int idx = (this->type == SCC_GENDER_LIST ? lm->GetReverseMapping(i, true) : i + 1);
|
2010-11-16 16:58:19 +00:00
|
|
|
const char *str = this->strings[this->strings.Contains(idx) ? idx : 0];
|
2010-11-17 19:43:15 +00:00
|
|
|
size_t len = strlen(str) + 1;
|
2010-11-16 16:58:19 +00:00
|
|
|
if (len > 0xFF) grfmsg(1, "choice list string is too long");
|
2010-11-17 19:43:15 +00:00
|
|
|
*d++ = GB(len, 0, 8);
|
2010-11-16 16:58:19 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* "<STRINGs>" */
|
|
|
|
for (int i = 0; i < count; i++) {
|
2010-11-16 21:03:39 +00:00
|
|
|
int idx = (this->type == SCC_GENDER_LIST ? lm->GetReverseMapping(i, true) : i + 1);
|
2010-11-16 16:58:19 +00:00
|
|
|
const char *str = this->strings[this->strings.Contains(idx) ? idx : 0];
|
2011-09-23 12:26:25 +00:00
|
|
|
/* Limit the length of the string we copy to 0xFE. The length is written above
|
|
|
|
* as a byte and we need room for the final '\0'. */
|
2011-10-29 20:56:58 +00:00
|
|
|
size_t len = min<size_t>(0xFE, strlen(str));
|
2010-11-16 16:58:19 +00:00
|
|
|
memcpy(d, str, len);
|
|
|
|
d += len;
|
|
|
|
*d++ = '\0';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return d;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2010-11-13 19:15:26 +00:00
|
|
|
/**
|
|
|
|
* Translate TTDPatch string codes into something OpenTTD can handle (better).
|
2011-10-01 20:31:21 +00:00
|
|
|
* @param grfid The (NewGRF) ID associated with this string
|
|
|
|
* @param language_id The (NewGRF) language ID associated with this string.
|
|
|
|
* @param allow_newlines Whether newlines are allowed in the string or not.
|
|
|
|
* @param str The string to translate.
|
|
|
|
* @param [out] olen The length of the final string.
|
2010-11-13 19:15:26 +00:00
|
|
|
* @return The translated string.
|
|
|
|
*/
|
2011-10-01 20:31:21 +00:00
|
|
|
char *TranslateTTDPatchCodes(uint32 grfid, uint8 language_id, bool allow_newlines, const char *str, int *olen)
|
2006-04-23 21:52:54 +00:00
|
|
|
{
|
2007-03-21 03:06:21 +00:00
|
|
|
char *tmp = MallocT<char>(strlen(str) * 10 + 1); // Allocate space to allow for expansion
|
2006-11-16 22:05:33 +00:00
|
|
|
char *d = tmp;
|
|
|
|
bool unicode = false;
|
2006-12-02 09:34:18 +00:00
|
|
|
WChar c;
|
|
|
|
size_t len = Utf8Decode(&c, str);
|
2006-11-16 22:05:33 +00:00
|
|
|
|
2010-11-16 16:58:19 +00:00
|
|
|
/* Helper variable for a possible (string) mapping. */
|
|
|
|
UnmappedChoiceList *mapping = NULL;
|
|
|
|
|
2010-11-16 12:35:16 +00:00
|
|
|
if (c == NFO_UTF8_IDENTIFIER) {
|
2006-11-16 22:05:33 +00:00
|
|
|
unicode = true;
|
2006-12-02 09:34:18 +00:00
|
|
|
str += len;
|
2006-11-16 22:05:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
for (;;) {
|
2007-12-11 21:25:48 +00:00
|
|
|
if (unicode && Utf8EncodedCharLen(*str) != 0) {
|
|
|
|
c = Utf8Consume(&str);
|
|
|
|
/* 'Magic' range of control codes. */
|
2009-05-22 12:05:28 +00:00
|
|
|
if (GB(c, 8, 8) == 0xE0) {
|
|
|
|
c = GB(c, 0, 8);
|
|
|
|
} else if (c >= 0x20) {
|
|
|
|
if (!IsValidChar(c, CS_ALPHANUMERAL)) c = '?';
|
|
|
|
d += Utf8Encode(d, c);
|
|
|
|
continue;
|
|
|
|
}
|
2007-12-11 21:25:48 +00:00
|
|
|
} else {
|
|
|
|
c = (byte)*str++;
|
|
|
|
}
|
2010-12-07 22:34:30 +00:00
|
|
|
if (c == '\0') break;
|
2006-11-16 22:05:33 +00:00
|
|
|
|
|
|
|
switch (c) {
|
|
|
|
case 0x01:
|
2010-12-07 22:34:30 +00:00
|
|
|
if (str[0] == '\0') goto string_end;
|
2006-11-16 22:05:33 +00:00
|
|
|
d += Utf8Encode(d, SCC_SETX);
|
|
|
|
*d++ = *str++;
|
|
|
|
break;
|
2006-12-20 17:03:14 +00:00
|
|
|
case 0x0A: break;
|
2011-10-01 20:31:21 +00:00
|
|
|
case 0x0D:
|
|
|
|
if (allow_newlines) {
|
|
|
|
*d++ = 0x0A;
|
|
|
|
} else {
|
|
|
|
grfmsg(1, "Detected newline in string that does not allow one");
|
|
|
|
}
|
|
|
|
break;
|
2006-11-16 22:05:33 +00:00
|
|
|
case 0x0E: d += Utf8Encode(d, SCC_TINYFONT); break;
|
|
|
|
case 0x0F: d += Utf8Encode(d, SCC_BIGFONT); break;
|
|
|
|
case 0x1F:
|
2010-12-07 22:34:30 +00:00
|
|
|
if (str[0] == '\0' || str[1] == '\0') goto string_end;
|
2006-11-16 22:05:33 +00:00
|
|
|
d += Utf8Encode(d, SCC_SETXY);
|
|
|
|
*d++ = *str++;
|
|
|
|
*d++ = *str++;
|
|
|
|
break;
|
2006-04-23 21:52:54 +00:00
|
|
|
case 0x7B:
|
|
|
|
case 0x7C:
|
|
|
|
case 0x7D:
|
2007-09-22 23:55:34 +00:00
|
|
|
case 0x7E:
|
|
|
|
case 0x7F:
|
2011-08-20 22:06:38 +00:00
|
|
|
case 0x80: d += Utf8Encode(d, SCC_NEWGRF_PRINT_DWORD_SIGNED + c - 0x7B); break;
|
2006-11-16 22:05:33 +00:00
|
|
|
case 0x81: {
|
2010-12-07 22:34:30 +00:00
|
|
|
if (str[0] == '\0' || str[1] == '\0') goto string_end;
|
2006-11-16 22:05:33 +00:00
|
|
|
StringID string;
|
2008-08-16 21:48:28 +00:00
|
|
|
string = ((uint8)*str++);
|
|
|
|
string |= ((uint8)*str++) << 8;
|
2011-01-21 23:10:02 +00:00
|
|
|
d += Utf8Encode(d, SCC_NEWGRF_STRINL);
|
2008-02-29 08:48:01 +00:00
|
|
|
d += Utf8Encode(d, MapGRFStringID(grfid, string));
|
2006-11-16 22:05:33 +00:00
|
|
|
break;
|
|
|
|
}
|
2007-09-22 23:55:34 +00:00
|
|
|
case 0x82:
|
|
|
|
case 0x83:
|
2011-08-20 22:06:38 +00:00
|
|
|
case 0x84: d += Utf8Encode(d, SCC_NEWGRF_PRINT_WORD_DATE_LONG + c - 0x82); break;
|
2007-09-22 23:55:34 +00:00
|
|
|
case 0x85: d += Utf8Encode(d, SCC_NEWGRF_DISCARD_WORD); break;
|
|
|
|
case 0x86: d += Utf8Encode(d, SCC_NEWGRF_ROTATE_TOP_4_WORDS); break;
|
2011-10-29 20:56:58 +00:00
|
|
|
case 0x87: d += Utf8Encode(d, SCC_NEWGRF_PRINT_WORD_VOLUME_LONG); break;
|
2006-11-16 22:05:33 +00:00
|
|
|
case 0x88: d += Utf8Encode(d, SCC_BLUE); break;
|
|
|
|
case 0x89: d += Utf8Encode(d, SCC_SILVER); break;
|
|
|
|
case 0x8A: d += Utf8Encode(d, SCC_GOLD); break;
|
|
|
|
case 0x8B: d += Utf8Encode(d, SCC_RED); break;
|
|
|
|
case 0x8C: d += Utf8Encode(d, SCC_PURPLE); break;
|
|
|
|
case 0x8D: d += Utf8Encode(d, SCC_LTBROWN); break;
|
|
|
|
case 0x8E: d += Utf8Encode(d, SCC_ORANGE); break;
|
|
|
|
case 0x8F: d += Utf8Encode(d, SCC_GREEN); break;
|
|
|
|
case 0x90: d += Utf8Encode(d, SCC_YELLOW); break;
|
|
|
|
case 0x91: d += Utf8Encode(d, SCC_DKGREEN); break;
|
|
|
|
case 0x92: d += Utf8Encode(d, SCC_CREAM); break;
|
|
|
|
case 0x93: d += Utf8Encode(d, SCC_BROWN); break;
|
|
|
|
case 0x94: d += Utf8Encode(d, SCC_WHITE); break;
|
|
|
|
case 0x95: d += Utf8Encode(d, SCC_LTBLUE); break;
|
|
|
|
case 0x96: d += Utf8Encode(d, SCC_GRAY); break;
|
|
|
|
case 0x97: d += Utf8Encode(d, SCC_DKBLUE); break;
|
|
|
|
case 0x98: d += Utf8Encode(d, SCC_BLACK); break;
|
2010-11-16 14:00:02 +00:00
|
|
|
case 0x9A: {
|
|
|
|
int code = *str++;
|
|
|
|
switch (code) {
|
2010-12-07 22:34:30 +00:00
|
|
|
case 0x00: goto string_end;
|
2010-11-16 11:50:26 +00:00
|
|
|
case 0x01: d += Utf8Encode(d, SCC_NEWGRF_PRINT_QWORD_CURRENCY); break;
|
2010-11-16 12:18:35 +00:00
|
|
|
/* 0x02: ignore next colour byte is not supported. It works on the final
|
|
|
|
* string and as such hooks into the string drawing routine. At that
|
|
|
|
* point many things already happened, such as splitting up of strings
|
|
|
|
* when drawn over multiple lines or right-to-left translations, which
|
|
|
|
* make the behaviour peculiar, e.g. only happening at specific width
|
|
|
|
* of windows. Or we need to add another pass over the string to just
|
|
|
|
* support this. As such it is not implemented in OpenTTD. */
|
2010-11-16 11:50:26 +00:00
|
|
|
case 0x03: {
|
2010-12-07 22:34:30 +00:00
|
|
|
if (str[0] == '\0' || str[1] == '\0') goto string_end;
|
2008-08-16 21:48:28 +00:00
|
|
|
uint16 tmp = ((uint8)*str++);
|
|
|
|
tmp |= ((uint8)*str++) << 8;
|
|
|
|
d += Utf8Encode(d, SCC_NEWGRF_PUSH_WORD);
|
|
|
|
d += Utf8Encode(d, tmp);
|
2010-08-01 18:53:30 +00:00
|
|
|
break;
|
|
|
|
}
|
2010-11-16 11:50:26 +00:00
|
|
|
case 0x04:
|
2010-12-07 22:34:30 +00:00
|
|
|
if (str[0] == '\0') goto string_end;
|
2008-08-16 21:48:28 +00:00
|
|
|
d += Utf8Encode(d, SCC_NEWGRF_UNPRINT);
|
|
|
|
d += Utf8Encode(d, *str++);
|
|
|
|
break;
|
2011-08-20 22:06:38 +00:00
|
|
|
case 0x06: d += Utf8Encode(d, SCC_NEWGRF_PRINT_BYTE_HEX); break;
|
|
|
|
case 0x07: d += Utf8Encode(d, SCC_NEWGRF_PRINT_WORD_HEX); break;
|
|
|
|
case 0x08: d += Utf8Encode(d, SCC_NEWGRF_PRINT_DWORD_HEX); break;
|
2010-11-16 11:50:26 +00:00
|
|
|
/* 0x09, 0x0A are TTDPatch internal use only string codes. */
|
2011-08-20 22:06:38 +00:00
|
|
|
case 0x0B: d += Utf8Encode(d, SCC_NEWGRF_PRINT_QWORD_HEX); break;
|
2010-11-16 11:50:26 +00:00
|
|
|
case 0x0C: d += Utf8Encode(d, SCC_NEWGRF_PRINT_WORD_STATION_NAME); break;
|
2011-10-29 20:56:58 +00:00
|
|
|
case 0x0D: d += Utf8Encode(d, SCC_NEWGRF_PRINT_WORD_WEIGHT_LONG); break;
|
2010-11-16 14:00:02 +00:00
|
|
|
case 0x0E:
|
|
|
|
case 0x0F: {
|
2010-12-07 22:34:30 +00:00
|
|
|
if (str[0] == '\0') goto string_end;
|
2010-11-16 14:00:02 +00:00
|
|
|
const LanguageMap *lm = LanguageMap::GetLanguageMap(grfid, language_id);
|
|
|
|
int index = *str++;
|
|
|
|
int mapped = lm != NULL ? lm->GetMapping(index, code == 0x0E) : -1;
|
|
|
|
if (mapped >= 0) {
|
2011-11-19 22:15:44 +00:00
|
|
|
d += Utf8Encode(d, code == 0x0E ? SCC_GENDER_INDEX : SCC_SET_CASE);
|
2011-10-14 16:51:30 +00:00
|
|
|
d += Utf8Encode(d, code == 0x0E ? mapped : mapped + 1);
|
2010-11-16 14:00:02 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
2008-09-14 14:31:37 +00:00
|
|
|
|
2010-11-16 16:58:19 +00:00
|
|
|
case 0x10:
|
|
|
|
case 0x11:
|
2010-12-07 22:34:30 +00:00
|
|
|
if (str[0] == '\0') goto string_end;
|
2010-11-16 16:58:19 +00:00
|
|
|
if (mapping == NULL) {
|
|
|
|
if (code == 0x10) str++; // Skip the index
|
|
|
|
grfmsg(1, "choice list %s marker found when not expected", code == 0x10 ? "next" : "default");
|
|
|
|
break;
|
|
|
|
} else {
|
|
|
|
/* Terminate the previous string. */
|
|
|
|
*d = '\0';
|
|
|
|
int index = (code == 0x10 ? *str++ : 0);
|
|
|
|
if (mapping->strings.Contains(index)) {
|
|
|
|
grfmsg(1, "duplicate choice list string, ignoring");
|
|
|
|
d++;
|
|
|
|
} else {
|
|
|
|
d = mapping->strings[index] = MallocT<char>(strlen(str) * 10 + 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 0x12:
|
|
|
|
if (mapping == NULL) {
|
|
|
|
grfmsg(1, "choice list end marker found when not expected");
|
|
|
|
} else {
|
|
|
|
/* Terminate the previous string. */
|
|
|
|
*d = '\0';
|
|
|
|
|
|
|
|
/* Now we can start flushing everything and clean everything up. */
|
|
|
|
d = mapping->Flush(LanguageMap::GetLanguageMap(grfid, language_id));
|
|
|
|
delete mapping;
|
|
|
|
mapping = NULL;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 0x13:
|
|
|
|
case 0x14:
|
2010-11-16 21:03:39 +00:00
|
|
|
case 0x15:
|
2010-12-07 22:34:30 +00:00
|
|
|
if (str[0] == '\0') goto string_end;
|
2010-11-16 16:58:19 +00:00
|
|
|
if (mapping != NULL) {
|
|
|
|
grfmsg(1, "choice lists can't be stacked, it's going to get messy now...");
|
|
|
|
if (code != 0x14) str++;
|
|
|
|
} else {
|
2010-11-16 21:03:39 +00:00
|
|
|
static const StringControlCode mp[] = { SCC_GENDER_LIST, SCC_SWITCH_CASE, SCC_PLURAL_LIST };
|
2010-11-16 16:58:19 +00:00
|
|
|
mapping = new UnmappedChoiceList(mp[code - 0x13], d, code == 0x14 ? 0 : *str++);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2011-08-20 22:35:11 +00:00
|
|
|
case 0x16:
|
2011-08-20 23:07:37 +00:00
|
|
|
case 0x17:
|
2011-10-29 20:56:58 +00:00
|
|
|
case 0x18:
|
|
|
|
case 0x19:
|
2011-10-29 21:00:11 +00:00
|
|
|
case 0x1A: d += Utf8Encode(d, SCC_NEWGRF_PRINT_DWORD_DATE_LONG + code - 0x16); break;
|
2011-08-20 22:35:11 +00:00
|
|
|
|
2008-08-16 21:48:28 +00:00
|
|
|
default:
|
|
|
|
grfmsg(1, "missing handler for extended format code");
|
|
|
|
break;
|
2007-09-22 23:55:34 +00:00
|
|
|
}
|
|
|
|
break;
|
2010-11-16 14:00:02 +00:00
|
|
|
}
|
2007-09-22 23:55:34 +00:00
|
|
|
|
2011-11-19 22:15:44 +00:00
|
|
|
case 0x9E: d += Utf8Encode(d, 0x20AC); break; // Euro
|
|
|
|
case 0x9F: d += Utf8Encode(d, 0x0178); break; // Y with diaeresis
|
|
|
|
case 0xA0: d += Utf8Encode(d, SCC_UP_ARROW); break;
|
|
|
|
case 0xAA: d += Utf8Encode(d, SCC_DOWN_ARROW); break;
|
|
|
|
case 0xAC: d += Utf8Encode(d, SCC_CHECKMARK); break;
|
|
|
|
case 0xAD: d += Utf8Encode(d, SCC_CROSS); break;
|
|
|
|
case 0xAF: d += Utf8Encode(d, SCC_RIGHT_ARROW); break;
|
|
|
|
case 0xB4: d += Utf8Encode(d, SCC_TRAIN); break;
|
|
|
|
case 0xB5: d += Utf8Encode(d, SCC_LORRY); break;
|
|
|
|
case 0xB6: d += Utf8Encode(d, SCC_BUS); break;
|
|
|
|
case 0xB7: d += Utf8Encode(d, SCC_PLANE); break;
|
|
|
|
case 0xB8: d += Utf8Encode(d, SCC_SHIP); break;
|
|
|
|
case 0xB9: d += Utf8Encode(d, SCC_SUPERSCRIPT_M1); break;
|
|
|
|
case 0xBC: d += Utf8Encode(d, SCC_SMALL_UP_ARROW); break;
|
|
|
|
case 0xBD: d += Utf8Encode(d, SCC_SMALL_DOWN_ARROW); break;
|
2006-04-23 21:52:54 +00:00
|
|
|
default:
|
|
|
|
/* Validate any unhandled character */
|
2006-11-16 22:05:33 +00:00
|
|
|
if (!IsValidChar(c, CS_ALPHANUMERAL)) c = '?';
|
|
|
|
d += Utf8Encode(d, c);
|
2006-04-23 21:52:54 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2006-11-16 22:05:33 +00:00
|
|
|
|
2010-12-07 22:34:30 +00:00
|
|
|
string_end:
|
2010-11-16 16:58:19 +00:00
|
|
|
if (mapping != NULL) {
|
|
|
|
grfmsg(1, "choice list was incomplete, the whole list is ignored");
|
|
|
|
delete mapping;
|
|
|
|
}
|
|
|
|
|
2006-11-16 22:05:33 +00:00
|
|
|
*d = '\0';
|
2010-11-16 11:34:19 +00:00
|
|
|
if (olen != NULL) *olen = d - tmp + 1;
|
|
|
|
tmp = ReallocT(tmp, d - tmp + 1);
|
2007-01-10 18:56:51 +00:00
|
|
|
return tmp;
|
2006-04-23 21:52:54 +00:00
|
|
|
}
|
|
|
|
|
2010-02-25 20:00:11 +00:00
|
|
|
/**
|
|
|
|
* Add a GRFText to a GRFText list.
|
|
|
|
* @param list The list where the text should be added to.
|
|
|
|
* @param text_to_add The GRFText to add to the list.
|
|
|
|
*/
|
|
|
|
void AddGRFTextToList(GRFText **list, GRFText *text_to_add)
|
|
|
|
{
|
|
|
|
GRFText **ptext, *text;
|
|
|
|
|
|
|
|
/* Loop through all languages and see if we can replace a string */
|
|
|
|
for (ptext = list; (text = *ptext) != NULL; ptext = &text->next) {
|
|
|
|
if (text->langid == text_to_add->langid) {
|
|
|
|
text_to_add->next = text->next;
|
|
|
|
*ptext = text_to_add;
|
|
|
|
delete text;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* If a string wasn't replaced, then we must append the new string */
|
|
|
|
*ptext = text_to_add;
|
|
|
|
}
|
2006-04-23 21:52:54 +00:00
|
|
|
|
2010-07-31 09:33:39 +00:00
|
|
|
/**
|
|
|
|
* Add a string to a GRFText list.
|
|
|
|
* @param list The list where the text should be added to.
|
|
|
|
* @param langid The language of the new text.
|
|
|
|
* @param grfid The grfid where this string is defined.
|
2011-10-01 20:31:21 +00:00
|
|
|
* @param allow_newlines Whether newlines are allowed in this string.
|
2010-07-31 09:33:39 +00:00
|
|
|
* @param text_to_add The text to add to the list.
|
|
|
|
* @note All text-codes will be translated.
|
|
|
|
*/
|
2011-10-01 20:31:21 +00:00
|
|
|
void AddGRFTextToList(struct GRFText **list, byte langid, uint32 grfid, bool allow_newlines, const char *text_to_add)
|
2010-07-31 09:33:39 +00:00
|
|
|
{
|
2010-11-16 11:34:19 +00:00
|
|
|
int len;
|
2011-10-01 20:31:21 +00:00
|
|
|
char *translatedtext = TranslateTTDPatchCodes(grfid, langid, allow_newlines, text_to_add, &len);
|
2010-11-16 11:34:19 +00:00
|
|
|
GRFText *newtext = GRFText::New(langid, translatedtext, len);
|
2010-07-31 09:33:39 +00:00
|
|
|
free(translatedtext);
|
|
|
|
|
|
|
|
AddGRFTextToList(list, newtext);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Add a GRFText to a GRFText list. The text should not contain any text-codes.
|
|
|
|
* The text will be added as a 'default language'-text.
|
|
|
|
* @param list The list where the text should be added to.
|
|
|
|
* @param text_to_add The text to add to the list.
|
|
|
|
*/
|
|
|
|
void AddGRFTextToList(struct GRFText **list, const char *text_to_add)
|
|
|
|
{
|
2010-11-16 11:34:19 +00:00
|
|
|
AddGRFTextToList(list, GRFText::New(0x7F, text_to_add, strlen(text_to_add) + 1));
|
2010-07-31 09:33:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Create a copy of this GRFText list.
|
|
|
|
* @param orig The GRFText list to copy.
|
|
|
|
* @return A duplicate of the given GRFText.
|
|
|
|
*/
|
|
|
|
GRFText *DuplicateGRFText(GRFText *orig)
|
|
|
|
{
|
|
|
|
GRFText *newtext = NULL;
|
|
|
|
GRFText **ptext = &newtext;
|
|
|
|
for (; orig != NULL; orig = orig->next) {
|
|
|
|
*ptext = GRFText::Copy(orig);
|
|
|
|
ptext = &(*ptext)->next;
|
|
|
|
}
|
|
|
|
return newtext;
|
|
|
|
}
|
|
|
|
|
2006-04-21 03:00:20 +00:00
|
|
|
/**
|
2006-04-23 18:27:53 +00:00
|
|
|
* Add the new read string into our structure.
|
2006-04-21 03:00:20 +00:00
|
|
|
*/
|
2011-10-01 20:31:21 +00:00
|
|
|
StringID AddGRFString(uint32 grfid, uint16 stringid, byte langid_to_add, bool new_scheme, bool allow_newlines, const char *text_to_add, StringID def_string)
|
2006-04-21 03:00:20 +00:00
|
|
|
{
|
2006-11-16 22:05:33 +00:00
|
|
|
char *translatedtext;
|
2006-04-21 03:00:20 +00:00
|
|
|
uint id;
|
|
|
|
|
2006-04-23 18:27:53 +00:00
|
|
|
/* When working with the old language scheme (grf_version is less than 7) and
|
2006-04-21 07:03:37 +00:00
|
|
|
* English or American is among the set bits, simply add it as English in
|
|
|
|
* the new scheme, i.e. as langid = 1.
|
|
|
|
* If English is set, it is pretty safe to assume the translations are not
|
|
|
|
* actually translated.
|
|
|
|
*/
|
2006-04-23 18:27:53 +00:00
|
|
|
if (!new_scheme) {
|
2009-06-01 15:01:54 +00:00
|
|
|
if (langid_to_add & (GRFLB_AMERICAN | GRFLB_ENGLISH)) {
|
2006-04-21 07:03:37 +00:00
|
|
|
langid_to_add = GRFLX_ENGLISH;
|
|
|
|
} else {
|
|
|
|
StringID ret = STR_EMPTY;
|
2011-10-01 20:31:21 +00:00
|
|
|
if (langid_to_add & GRFLB_GERMAN) ret = AddGRFString(grfid, stringid, GRFLX_GERMAN, true, allow_newlines, text_to_add, def_string);
|
|
|
|
if (langid_to_add & GRFLB_FRENCH) ret = AddGRFString(grfid, stringid, GRFLX_FRENCH, true, allow_newlines, text_to_add, def_string);
|
|
|
|
if (langid_to_add & GRFLB_SPANISH) ret = AddGRFString(grfid, stringid, GRFLX_SPANISH, true, allow_newlines, text_to_add, def_string);
|
2006-04-21 07:03:37 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
}
|
2006-04-21 03:00:20 +00:00
|
|
|
|
|
|
|
for (id = 0; id < _num_grf_texts; id++) {
|
|
|
|
if (_grf_text[id].grfid == grfid && _grf_text[id].stringid == stringid) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Too many strings allocated, return empty */
|
|
|
|
if (id == lengthof(_grf_text)) return STR_EMPTY;
|
|
|
|
|
2010-11-16 11:34:19 +00:00
|
|
|
int len;
|
2011-10-01 20:31:21 +00:00
|
|
|
translatedtext = TranslateTTDPatchCodes(grfid, langid_to_add, allow_newlines, text_to_add, &len);
|
2006-11-16 22:05:33 +00:00
|
|
|
|
2010-11-16 11:34:19 +00:00
|
|
|
GRFText *newtext = GRFText::New(langid_to_add, translatedtext, len);
|
2006-05-16 15:37:00 +00:00
|
|
|
|
2006-11-16 22:05:33 +00:00
|
|
|
free(translatedtext);
|
2006-05-16 15:37:00 +00:00
|
|
|
|
2006-04-21 07:03:37 +00:00
|
|
|
/* If we didn't find our stringid and grfid in the list, allocate a new id */
|
2006-04-21 03:00:20 +00:00
|
|
|
if (id == _num_grf_texts) _num_grf_texts++;
|
|
|
|
|
|
|
|
if (_grf_text[id].textholder == NULL) {
|
|
|
|
_grf_text[id].grfid = grfid;
|
|
|
|
_grf_text[id].stringid = stringid;
|
2006-05-11 16:27:46 +00:00
|
|
|
_grf_text[id].def_string = def_string;
|
2006-04-21 03:00:20 +00:00
|
|
|
}
|
2010-02-25 20:00:11 +00:00
|
|
|
AddGRFTextToList(&_grf_text[id].textholder, newtext);
|
2006-04-21 03:00:20 +00:00
|
|
|
|
2006-12-26 17:36:18 +00:00
|
|
|
grfmsg(3, "Added 0x%X: grfid %08X string 0x%X lang 0x%X string '%s'", id, grfid, stringid, newtext->langid, newtext->text);
|
2006-04-21 03:00:20 +00:00
|
|
|
|
|
|
|
return (GRFTAB << TABSIZE) + id;
|
|
|
|
}
|
|
|
|
|
2006-10-03 09:25:42 +00:00
|
|
|
/* Used to remember the grfid that the last retrieved string came from */
|
|
|
|
static uint32 _last_grfid = 0;
|
2006-04-21 03:00:20 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns the index for this stringid associated with its grfID
|
|
|
|
*/
|
|
|
|
StringID GetGRFStringID(uint32 grfid, uint16 stringid)
|
|
|
|
{
|
|
|
|
uint id;
|
2006-10-03 09:25:42 +00:00
|
|
|
|
|
|
|
/* grfid is zero when we're being called via an include */
|
|
|
|
if (grfid == 0) grfid = _last_grfid;
|
|
|
|
|
2006-04-21 03:00:20 +00:00
|
|
|
for (id = 0; id < _num_grf_texts; id++) {
|
|
|
|
if (_grf_text[id].grfid == grfid && _grf_text[id].stringid == stringid) {
|
|
|
|
return (GRFTAB << TABSIZE) + id;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return STR_UNDEFINED;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-02-25 20:00:11 +00:00
|
|
|
/**
|
|
|
|
* Get a C-string from a GRFText-list. If there is a translation for the
|
|
|
|
* current language it is returned, otherwise the default translation
|
|
|
|
* is returned. If there is neither a default nor a translation for the
|
|
|
|
* current language NULL is returned.
|
|
|
|
* @param text The GRFText to get the string from.
|
|
|
|
*/
|
|
|
|
const char *GetGRFStringFromGRFText(const GRFText *text)
|
2006-04-21 03:00:20 +00:00
|
|
|
{
|
2010-02-25 20:00:11 +00:00
|
|
|
const char *default_text = NULL;
|
2006-10-03 09:25:42 +00:00
|
|
|
|
2009-03-15 00:32:18 +00:00
|
|
|
/* Search the list of lang-strings of this stringid for current lang */
|
2010-02-25 20:00:11 +00:00
|
|
|
for (; text != NULL; text = text->next) {
|
|
|
|
if (text->langid == _currentLangID) return text->text;
|
2006-05-11 16:27:46 +00:00
|
|
|
|
|
|
|
/* If the current string is English or American, set it as the
|
|
|
|
* fallback language if the specific language isn't available. */
|
2010-02-25 20:00:11 +00:00
|
|
|
if (text->langid == GRFLX_UNSPECIFIED || (default_text == NULL && (text->langid == GRFLX_ENGLISH || text->langid == GRFLX_AMERICAN))) {
|
|
|
|
default_text = text->text;
|
2006-05-11 16:27:46 +00:00
|
|
|
}
|
2006-04-21 03:00:20 +00:00
|
|
|
}
|
|
|
|
|
2010-02-25 20:00:11 +00:00
|
|
|
return default_text;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Get a C-string from a stringid set by a newgrf.
|
|
|
|
*/
|
|
|
|
const char *GetGRFStringPtr(uint16 stringid)
|
|
|
|
{
|
|
|
|
assert(_grf_text[stringid].grfid != 0);
|
|
|
|
|
|
|
|
/* Remember this grfid in case the string has included text */
|
|
|
|
_last_grfid = _grf_text[stringid].grfid;
|
|
|
|
|
|
|
|
const char *str = GetGRFStringFromGRFText(_grf_text[stringid].textholder);
|
|
|
|
if (str != NULL) return str;
|
2006-05-11 16:27:46 +00:00
|
|
|
|
|
|
|
/* Use the default string ID if the fallback string isn't available */
|
2008-01-29 17:09:00 +00:00
|
|
|
return GetStringPtr(_grf_text[stringid].def_string);
|
2006-04-21 03:00:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Equivalence Setter function between game and newgrf langID.
|
|
|
|
* This function will adjust _currentLangID as to what is the LangID
|
|
|
|
* of the current language set by the user.
|
|
|
|
* This function is called after the user changed language,
|
2007-04-17 20:23:13 +00:00
|
|
|
* from strings.cpp:ReadLanguagePack
|
2009-09-19 09:51:14 +00:00
|
|
|
* @param language_id iso code of current selection
|
2006-04-21 03:00:20 +00:00
|
|
|
*/
|
2009-03-13 00:30:26 +00:00
|
|
|
void SetCurrentGrfLangID(byte language_id)
|
2006-04-21 03:00:20 +00:00
|
|
|
{
|
2009-03-13 00:30:26 +00:00
|
|
|
_currentLangID = language_id;
|
2006-04-21 03:00:20 +00:00
|
|
|
}
|
|
|
|
|
2007-06-12 13:22:14 +00:00
|
|
|
bool CheckGrfLangID(byte lang_id, byte grf_version)
|
|
|
|
{
|
|
|
|
if (grf_version < 7) {
|
|
|
|
switch (_currentLangID) {
|
|
|
|
case GRFLX_GERMAN: return (lang_id & GRFLB_GERMAN) != 0;
|
|
|
|
case GRFLX_FRENCH: return (lang_id & GRFLB_FRENCH) != 0;
|
|
|
|
case GRFLX_SPANISH: return (lang_id & GRFLB_SPANISH) != 0;
|
|
|
|
default: return (lang_id & (GRFLB_ENGLISH | GRFLB_AMERICAN)) != 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return (lang_id == _currentLangID || lang_id == GRFLX_UNSPECIFIED);
|
|
|
|
}
|
|
|
|
|
2010-02-25 20:00:11 +00:00
|
|
|
/**
|
|
|
|
* Delete all items of a linked GRFText list.
|
|
|
|
* @param grftext the head of the list to delete
|
|
|
|
*/
|
|
|
|
void CleanUpGRFText(GRFText *grftext)
|
|
|
|
{
|
|
|
|
while (grftext != NULL) {
|
|
|
|
GRFText *grftext2 = grftext->next;
|
|
|
|
delete grftext;
|
|
|
|
grftext = grftext2;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-04-21 03:00:20 +00:00
|
|
|
/**
|
|
|
|
* House cleaning.
|
2006-04-21 06:55:47 +00:00
|
|
|
* Remove all strings and reset the text counter.
|
2006-04-21 03:00:20 +00:00
|
|
|
*/
|
2007-03-07 11:47:46 +00:00
|
|
|
void CleanUpStrings()
|
2006-04-21 03:00:20 +00:00
|
|
|
{
|
|
|
|
uint id;
|
|
|
|
|
|
|
|
for (id = 0; id < _num_grf_texts; id++) {
|
2010-02-25 20:00:11 +00:00
|
|
|
CleanUpGRFText(_grf_text[id].textholder);
|
2006-04-21 06:55:47 +00:00
|
|
|
_grf_text[id].grfid = 0;
|
|
|
|
_grf_text[id].stringid = 0;
|
|
|
|
_grf_text[id].textholder = NULL;
|
2006-04-21 03:00:20 +00:00
|
|
|
}
|
2006-04-21 06:55:47 +00:00
|
|
|
|
|
|
|
_num_grf_texts = 0;
|
2006-04-21 03:00:20 +00:00
|
|
|
}
|
2007-09-22 23:55:34 +00:00
|
|
|
|
|
|
|
struct TextRefStack {
|
|
|
|
byte stack[0x30];
|
|
|
|
byte position;
|
|
|
|
bool used;
|
|
|
|
|
|
|
|
TextRefStack() : used(false) {}
|
|
|
|
|
2010-12-08 13:44:01 +00:00
|
|
|
TextRefStack(const TextRefStack &stack) :
|
|
|
|
position(stack.position),
|
|
|
|
used(stack.used)
|
|
|
|
{
|
|
|
|
memcpy(this->stack, stack.stack, sizeof(this->stack));
|
|
|
|
}
|
|
|
|
|
2007-09-22 23:55:34 +00:00
|
|
|
uint8 PopUnsignedByte() { assert(this->position < lengthof(this->stack)); return this->stack[this->position++]; }
|
|
|
|
int8 PopSignedByte() { return (int8)this->PopUnsignedByte(); }
|
|
|
|
|
2007-12-13 02:04:09 +00:00
|
|
|
uint16 PopUnsignedWord()
|
|
|
|
{
|
|
|
|
uint16 val = this->PopUnsignedByte();
|
|
|
|
return val | (this->PopUnsignedByte() << 8);
|
|
|
|
}
|
2007-09-22 23:55:34 +00:00
|
|
|
int16 PopSignedWord() { return (int32)this->PopUnsignedWord(); }
|
|
|
|
|
2007-12-13 02:04:09 +00:00
|
|
|
uint32 PopUnsignedDWord()
|
|
|
|
{
|
|
|
|
uint32 val = this->PopUnsignedWord();
|
|
|
|
return val | (this->PopUnsignedWord() << 16);
|
|
|
|
}
|
2007-09-22 23:55:34 +00:00
|
|
|
int32 PopSignedDWord() { return (int32)this->PopUnsignedDWord(); }
|
|
|
|
|
2007-12-13 02:04:09 +00:00
|
|
|
uint64 PopUnsignedQWord()
|
|
|
|
{
|
|
|
|
uint64 val = this->PopUnsignedDWord();
|
|
|
|
return val | (((uint64)this->PopUnsignedDWord()) << 32);
|
|
|
|
}
|
2007-09-22 23:55:34 +00:00
|
|
|
int64 PopSignedQWord() { return (int64)this->PopUnsignedQWord(); }
|
|
|
|
|
|
|
|
/** Rotate the top four words down: W1, W2, W3, W4 -> W4, W1, W2, W3 */
|
|
|
|
void RotateTop4Words()
|
|
|
|
{
|
|
|
|
byte tmp[2];
|
|
|
|
for (int i = 0; i < 2; i++) tmp[i] = this->stack[this->position + i + 6];
|
|
|
|
for (int i = 5; i >= 0; i--) this->stack[this->position + i + 2] = this->stack[this->position + i];
|
|
|
|
for (int i = 0; i < 2; i++) this->stack[this->position + i] = tmp[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
void PushWord(uint16 word)
|
|
|
|
{
|
|
|
|
if (this->position >= 2) {
|
|
|
|
this->position -= 2;
|
|
|
|
} else {
|
2008-08-12 22:12:14 +00:00
|
|
|
for (int i = lengthof(stack) - 1; i >= this->position + 2; i--) {
|
|
|
|
this->stack[i] = this->stack[i - 2];
|
2007-09-22 23:55:34 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
this->stack[this->position] = GB(word, 0, 8);
|
|
|
|
this->stack[this->position + 1] = GB(word, 8, 8);
|
|
|
|
}
|
|
|
|
|
2007-10-17 20:09:16 +00:00
|
|
|
void ResetStack() { this->position = 0; this->used = true; }
|
|
|
|
void RewindStack() { this->position = 0; }
|
2007-09-22 23:55:34 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/** The stack that is used for TTDP compatible string code parsing */
|
2011-07-03 14:33:17 +00:00
|
|
|
static TextRefStack _newgrf_textrefstack;
|
2007-09-22 23:55:34 +00:00
|
|
|
|
2010-12-08 13:44:01 +00:00
|
|
|
/**
|
|
|
|
* Check whether the NewGRF text stack is in use.
|
|
|
|
* @return True iff the NewGRF text stack is used.
|
|
|
|
*/
|
|
|
|
bool UsingNewGRFTextStack()
|
|
|
|
{
|
2011-07-03 14:33:17 +00:00
|
|
|
return _newgrf_textrefstack.used;
|
2010-12-08 13:44:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Create a backup of the current NewGRF text stack.
|
|
|
|
* @return A copy of the current text stack.
|
|
|
|
*/
|
|
|
|
struct TextRefStack *CreateTextRefStackBackup()
|
|
|
|
{
|
2011-07-03 14:33:17 +00:00
|
|
|
return new TextRefStack(_newgrf_textrefstack);
|
2010-12-08 13:44:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Restore a copy of the text stack to the used stack.
|
|
|
|
* @param backup The copy to restore.
|
|
|
|
*/
|
|
|
|
void RestoreTextRefStackBackup(struct TextRefStack *backup)
|
|
|
|
{
|
2011-07-03 14:33:17 +00:00
|
|
|
_newgrf_textrefstack = *backup;
|
2010-12-08 13:44:01 +00:00
|
|
|
delete backup;
|
|
|
|
}
|
|
|
|
|
2007-10-17 20:09:16 +00:00
|
|
|
/**
|
2011-07-03 13:49:29 +00:00
|
|
|
* Start using the TTDP compatible string code parsing.
|
|
|
|
*
|
|
|
|
* On start a number of values is copied on the #TextRefStack.
|
|
|
|
* You can then use #GetString() and the normal string drawing functions,
|
|
|
|
* and they will use the #TextRefStack for NewGRF string codes.
|
|
|
|
*
|
|
|
|
* However, when you want to draw a string multiple times using the same stack,
|
|
|
|
* you have to call #RewindTextRefStack() between draws.
|
|
|
|
*
|
|
|
|
* After you are done with drawing, you must disable usage of the #TextRefStack
|
|
|
|
* by calling #StopTextRefStackUsage(), so NewGRF string codes operate on the
|
|
|
|
* normal string parameters again.
|
|
|
|
*
|
2007-10-17 20:09:16 +00:00
|
|
|
* @param numEntries number of entries to copy from the registers
|
2011-07-03 13:53:42 +00:00
|
|
|
* @param values values to copy onto the stack; if NULL the temporary NewGRF registers will be used instead
|
2007-10-17 20:09:16 +00:00
|
|
|
*/
|
2011-07-03 13:53:42 +00:00
|
|
|
void StartTextRefStackUsage(byte numEntries, const uint32 *values)
|
2007-09-22 23:55:34 +00:00
|
|
|
{
|
2010-03-21 11:05:39 +00:00
|
|
|
extern TemporaryStorageArray<int32, 0x110> _temp_store;
|
2007-09-22 23:55:34 +00:00
|
|
|
|
2011-07-03 14:33:17 +00:00
|
|
|
_newgrf_textrefstack.ResetStack();
|
2007-09-22 23:55:34 +00:00
|
|
|
|
2011-07-03 14:33:17 +00:00
|
|
|
byte *p = _newgrf_textrefstack.stack;
|
2007-10-17 20:09:16 +00:00
|
|
|
for (uint i = 0; i < numEntries; i++) {
|
2011-07-03 13:53:42 +00:00
|
|
|
uint32 value = values != NULL ? values[i] : _temp_store.GetValue(0x100 + i);
|
2007-09-22 23:55:34 +00:00
|
|
|
for (uint j = 0; j < 32; j += 8) {
|
2011-07-03 13:53:42 +00:00
|
|
|
*p = GB(value, j, 8);
|
2007-09-22 23:55:34 +00:00
|
|
|
p++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Stop using the TTDP compatible string code parsing */
|
2010-06-26 14:51:27 +00:00
|
|
|
void StopTextRefStackUsage()
|
|
|
|
{
|
2011-07-03 14:33:17 +00:00
|
|
|
_newgrf_textrefstack.used = false;
|
2007-10-17 20:09:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void RewindTextRefStack()
|
|
|
|
{
|
2011-07-03 14:33:17 +00:00
|
|
|
_newgrf_textrefstack.RewindStack();
|
2007-10-17 20:09:16 +00:00
|
|
|
}
|
2007-09-22 23:55:34 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* FormatString for NewGRF specific "magic" string control codes
|
|
|
|
* @param scc the string control code that has been read
|
2009-09-19 09:51:14 +00:00
|
|
|
* @param buff the buffer we're writing to
|
|
|
|
* @param str the string that we need to write
|
|
|
|
* @param argv the OpenTTD stack of values
|
2011-10-12 19:25:52 +00:00
|
|
|
* @param modify_argv When true, modify the OpenTTD stack.
|
2007-09-22 23:55:34 +00:00
|
|
|
* @return the string control code to "execute" now
|
|
|
|
*/
|
2011-10-12 19:25:52 +00:00
|
|
|
uint RemapNewGRFStringControlCode(uint scc, char *buf_start, char **buff, const char **str, int64 *argv, bool modify_argv)
|
2007-09-22 23:55:34 +00:00
|
|
|
{
|
2011-10-12 19:25:52 +00:00
|
|
|
if (_newgrf_textrefstack.used && modify_argv) {
|
2007-09-22 23:55:34 +00:00
|
|
|
switch (scc) {
|
|
|
|
default: NOT_REACHED();
|
2011-08-20 22:06:38 +00:00
|
|
|
case SCC_NEWGRF_PRINT_BYTE_SIGNED: *argv = _newgrf_textrefstack.PopSignedByte(); break;
|
2011-08-20 22:14:27 +00:00
|
|
|
case SCC_NEWGRF_PRINT_QWORD_CURRENCY: *argv = _newgrf_textrefstack.PopSignedQWord(); break;
|
2007-09-22 23:55:34 +00:00
|
|
|
|
|
|
|
case SCC_NEWGRF_PRINT_DWORD_CURRENCY:
|
2011-08-20 22:06:38 +00:00
|
|
|
case SCC_NEWGRF_PRINT_DWORD_SIGNED: *argv = _newgrf_textrefstack.PopSignedDWord(); break;
|
2007-09-22 23:55:34 +00:00
|
|
|
|
2011-08-20 22:06:38 +00:00
|
|
|
case SCC_NEWGRF_PRINT_BYTE_HEX: *argv = _newgrf_textrefstack.PopUnsignedByte(); break;
|
2011-08-20 22:14:27 +00:00
|
|
|
case SCC_NEWGRF_PRINT_QWORD_HEX: *argv = _newgrf_textrefstack.PopUnsignedQWord(); break;
|
2008-09-14 14:31:37 +00:00
|
|
|
|
2007-09-22 23:55:34 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_SPEED:
|
2011-10-29 20:56:58 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_VOLUME_LONG:
|
|
|
|
case SCC_NEWGRF_PRINT_WORD_VOLUME_SHORT:
|
2011-08-20 23:16:49 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_SIGNED: *argv = _newgrf_textrefstack.PopSignedWord(); break;
|
|
|
|
|
|
|
|
case SCC_NEWGRF_PRINT_WORD_HEX:
|
2011-10-29 20:56:58 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_WEIGHT_LONG:
|
|
|
|
case SCC_NEWGRF_PRINT_WORD_WEIGHT_SHORT:
|
2011-08-20 23:07:37 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_POWER:
|
2010-11-05 13:34:39 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_STATION_NAME:
|
2011-08-20 22:06:38 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_UNSIGNED: *argv = _newgrf_textrefstack.PopUnsignedWord(); break;
|
2007-09-22 23:55:34 +00:00
|
|
|
|
2011-08-20 22:35:11 +00:00
|
|
|
case SCC_NEWGRF_PRINT_DWORD_DATE_LONG:
|
|
|
|
case SCC_NEWGRF_PRINT_DWORD_DATE_SHORT:
|
|
|
|
case SCC_NEWGRF_PRINT_DWORD_HEX: *argv = _newgrf_textrefstack.PopUnsignedDWord(); break;
|
|
|
|
|
2011-08-20 22:06:38 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_DATE_LONG:
|
|
|
|
case SCC_NEWGRF_PRINT_WORD_DATE_SHORT: *argv = _newgrf_textrefstack.PopUnsignedWord() + DAYS_TILL_ORIGINAL_BASE_YEAR; break;
|
2007-09-22 23:55:34 +00:00
|
|
|
|
2011-08-20 22:06:38 +00:00
|
|
|
case SCC_NEWGRF_DISCARD_WORD: _newgrf_textrefstack.PopUnsignedWord(); break;
|
2007-09-22 23:55:34 +00:00
|
|
|
|
2011-08-20 22:06:38 +00:00
|
|
|
case SCC_NEWGRF_ROTATE_TOP_4_WORDS: _newgrf_textrefstack.RotateTop4Words(); break;
|
|
|
|
case SCC_NEWGRF_PUSH_WORD: _newgrf_textrefstack.PushWord(Utf8Consume(str)); break;
|
|
|
|
case SCC_NEWGRF_UNPRINT: *buff = max(*buff - Utf8Consume(str), buf_start); break;
|
2007-09-22 23:55:34 +00:00
|
|
|
|
2011-08-20 22:06:38 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_STRING_ID:
|
2011-07-03 14:33:17 +00:00
|
|
|
*argv = TTDPStringIDToOTTDStringIDMapping(_newgrf_textrefstack.PopUnsignedWord());
|
2007-09-22 23:55:34 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (scc) {
|
|
|
|
default: NOT_REACHED();
|
2011-08-20 22:06:38 +00:00
|
|
|
case SCC_NEWGRF_PRINT_DWORD_SIGNED:
|
|
|
|
case SCC_NEWGRF_PRINT_WORD_SIGNED:
|
|
|
|
case SCC_NEWGRF_PRINT_BYTE_SIGNED:
|
|
|
|
case SCC_NEWGRF_PRINT_WORD_UNSIGNED:
|
2008-03-30 23:24:18 +00:00
|
|
|
return SCC_COMMA;
|
2007-09-22 23:55:34 +00:00
|
|
|
|
2011-08-20 22:06:38 +00:00
|
|
|
case SCC_NEWGRF_PRINT_BYTE_HEX:
|
|
|
|
case SCC_NEWGRF_PRINT_WORD_HEX:
|
|
|
|
case SCC_NEWGRF_PRINT_DWORD_HEX:
|
|
|
|
case SCC_NEWGRF_PRINT_QWORD_HEX:
|
2008-09-14 14:31:37 +00:00
|
|
|
return SCC_HEX;
|
|
|
|
|
2007-09-22 23:55:34 +00:00
|
|
|
case SCC_NEWGRF_PRINT_DWORD_CURRENCY:
|
|
|
|
case SCC_NEWGRF_PRINT_QWORD_CURRENCY:
|
2011-11-19 22:15:44 +00:00
|
|
|
return SCC_CURRENCY_LONG;
|
2007-09-22 23:55:34 +00:00
|
|
|
|
2011-08-20 22:06:38 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_STRING_ID:
|
|
|
|
return SCC_NEWGRF_PRINT_WORD_STRING_ID;
|
2007-09-22 23:55:34 +00:00
|
|
|
|
2011-08-20 22:06:38 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_DATE_LONG:
|
2011-08-20 22:35:11 +00:00
|
|
|
case SCC_NEWGRF_PRINT_DWORD_DATE_LONG:
|
2007-09-22 23:55:34 +00:00
|
|
|
return SCC_DATE_LONG;
|
|
|
|
|
2011-08-20 22:06:38 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_DATE_SHORT:
|
2011-08-20 22:35:11 +00:00
|
|
|
case SCC_NEWGRF_PRINT_DWORD_DATE_SHORT:
|
2011-08-20 21:42:05 +00:00
|
|
|
return SCC_DATE_SHORT;
|
2007-09-22 23:55:34 +00:00
|
|
|
|
|
|
|
case SCC_NEWGRF_PRINT_WORD_SPEED:
|
|
|
|
return SCC_VELOCITY;
|
|
|
|
|
2011-10-29 20:56:58 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_VOLUME_LONG:
|
2011-11-19 22:15:44 +00:00
|
|
|
return SCC_VOLUME_LONG;
|
2007-09-22 23:55:34 +00:00
|
|
|
|
2011-10-29 20:56:58 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_VOLUME_SHORT:
|
|
|
|
return SCC_VOLUME_SHORT;
|
|
|
|
|
|
|
|
case SCC_NEWGRF_PRINT_WORD_WEIGHT_LONG:
|
2011-11-19 22:15:44 +00:00
|
|
|
return SCC_WEIGHT_LONG;
|
2010-11-05 13:40:18 +00:00
|
|
|
|
2011-10-29 20:56:58 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_WEIGHT_SHORT:
|
|
|
|
return SCC_WEIGHT_SHORT;
|
|
|
|
|
2011-08-20 23:07:37 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_POWER:
|
|
|
|
return SCC_POWER;
|
|
|
|
|
2010-11-05 13:34:39 +00:00
|
|
|
case SCC_NEWGRF_PRINT_WORD_STATION_NAME:
|
|
|
|
return SCC_STATION_NAME;
|
|
|
|
|
2007-09-22 23:55:34 +00:00
|
|
|
case SCC_NEWGRF_DISCARD_WORD:
|
|
|
|
case SCC_NEWGRF_ROTATE_TOP_4_WORDS:
|
|
|
|
case SCC_NEWGRF_PUSH_WORD:
|
|
|
|
case SCC_NEWGRF_UNPRINT:
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|