1

/* $Id$ */

     2

    22

#include "stdafx.h"

    23

#include "openttd.h"

    24

#include "currency.h"

    25

#include "functions.h"

    26

#include "macros.h"

    27

#include "screenshot.h"

    28

#include "sound.h"

    29

#include "string.h"

    30

#include "variables.h"

    31

#include "network.h"

    32

#include "settings.h"

    33

#include "command.h"

    34

#include "console.h"

    35

#include "saveload.h"

    36

#include "npf.h"

    37

    38

/** The patch values that are used for new games and/or modified in config file */

    39

Patches _patches_newgame;

    40

    41

typedef struct IniFile IniFile;

    42

typedef struct IniItem IniItem;

    43

typedef struct IniGroup IniGroup;

    44

typedef struct SettingsMemoryPool SettingsMemoryPool;

    45

    46

static void pool_init(SettingsMemoryPool **pool);

    47

static void *pool_alloc(SettingsMemoryPool **pool, uint size);

    48

static void *pool_strdup(SettingsMemoryPool **pool, const char *mem, uint size);

    49

static void pool_free(SettingsMemoryPool **pool);

    50

    51

struct SettingsMemoryPool {

    52

	uint pos,size;

    53

	SettingsMemoryPool *next;

    54

	byte mem[1];

    55

};

    56

    57

static SettingsMemoryPool *pool_new(uint minsize)

    58

{

    59

	SettingsMemoryPool *p;

    60

	if (minsize < 4096 - 12) minsize = 4096 - 12;

    61

    62

	p = malloc(sizeof(SettingsMemoryPool) - 1 + minsize);

    63

	p->pos = 0;

    64

	p->size = minsize;

    65

	p->next = NULL;

    66

	return p;

    67

}

    68

    69

static void pool_init(SettingsMemoryPool **pool)

    70

{

    71

	*pool = pool_new(0);

    72

}

    73

    74

static void *pool_alloc(SettingsMemoryPool **pool, uint size)

    75

{

    76

	uint pos;

    77

	SettingsMemoryPool *p = *pool;

    78

    79

	size = ALIGN(size, sizeof(void*));

    80

    81

	// first check if there's memory in the next pool

    82

	if (p->next && p->next->pos + size <= p->next->size) {

    83

		p = p->next;

    84

	// then check if there's not memory in the cur pool

    85

	} else if (p->pos + size > p->size) {

    86

		SettingsMemoryPool *n = pool_new(size);

    87

		*pool = n;

    88

		n->next = p;

    89

		p = n;

    90

	}

    91

    92

	pos = p->pos;

    93

	p->pos += size;

    94

	return p->mem + pos;

    95

}

    96

    97

static void *pool_strdup(SettingsMemoryPool **pool, const char *mem, uint size)

    98

{

    99

	byte *p = pool_alloc(pool, size + 1);

   100

	p[size] = 0;

   101

	memcpy(p, mem, size);

   102

	return p;

   103

}

   104

   105

static void pool_free(SettingsMemoryPool **pool)

   106

{

   107

	SettingsMemoryPool *p = *pool, *n;

   108

	*pool = NULL;

   109

	while (p) {

   110

		n = p->next;

   111

		free(p);

   112

		p = n;

   113

	}

   114

}

   115

   116

// structs describing the ini format.

   117

struct IniItem {

   118

	char *name;

   119

	char *value;

   120

	char *comment;

   121

	IniItem *next;

   122

};

   123

   124

struct IniGroup {

   125

	char *name; // name of group

   126

	char *comment; //comment for group

   127

	IniItem *item, **last_item;

   128

	IniGroup *next;

   129

	IniFile *ini;

   130

	IniGroupType type; // type of group

   131

};

   132

   133

struct IniFile {

   134

	SettingsMemoryPool *pool;

   135

	IniGroup *group, **last_group;

   136

	char *comment; // last comment in file

   137

};

   138

   139

// allocate an inifile object

   140

static IniFile *ini_alloc(void)

   141

{

   142

	IniFile *ini;

   143

	SettingsMemoryPool *pool;

   144

	pool_init(&pool);

   145

	ini = (IniFile*)pool_alloc(&pool, sizeof(IniFile));

   146

	ini->pool = pool;

   147

	ini->group = NULL;

   148

	ini->last_group = &ini->group;

   149

	ini->comment = NULL;

   150

	return ini;

   151

}

   152

   153

// allocate an ini group object

   154

static IniGroup *ini_group_alloc(IniFile *ini, const char *grpt, int len)

   155

{

   156

	IniGroup *grp = pool_alloc(&ini->pool, sizeof(IniGroup));

   157

	grp->ini = ini;

   158

	grp->name = pool_strdup(&ini->pool, grpt, len);

   159

	if (!strcmp(grp->name, "newgrf") || !strcmp(grp->name, "servers") || !strcmp(grp->name, "bans")) {

   160

		grp->type = IGT_LIST;

   161

	} else {

   162

		grp->type = IGT_VARIABLES;

   163

	}

   164

	grp->next = NULL;

   165

	grp->item = NULL;

   166

	grp->comment = NULL;

   167

	grp->last_item = &grp->item;

   168

	*ini->last_group = grp;

   169

	ini->last_group = &grp->next;

   170

	return grp;

   171

}

   172

   173

static IniItem *ini_item_alloc(IniGroup *group, const char *name, int len)

   174

{

   175

	IniItem *item = pool_alloc(&group->ini->pool, sizeof(IniItem));

   176

	item->name = pool_strdup(&group->ini->pool, name, len);

   177

	item->next = NULL;

   178

	item->comment = NULL;

   179

	item->value = NULL;

   180

	*group->last_item = item;

   181

	group->last_item = &item->next;

   182

	return item;

   183

}

   184

   185

// load an ini file into the "abstract" format

   186

static IniFile *ini_load(const char *filename)

   187

{

   188

	char buffer[1024], c, *s, *t, *e;

   189

	FILE *in;

   190

	IniFile *ini;

   191

	IniGroup *group = NULL;

   192

	IniItem *item;

   193

   194

	char *comment = NULL;

   195

	uint comment_size = 0;

   196

	uint comment_alloc = 0;

   197

   198

	ini = ini_alloc();

   199

   200

	in = fopen(filename, "r");

   201

	if (in == NULL) return ini;

   202

   203

	// for each line in the file

   204

	while (fgets(buffer, sizeof(buffer), in)) {

   205

   206

		// trim whitespace from the left side

   207

		for (s = buffer; *s == ' ' || *s == '\t'; s++);

   208

   209

		// trim whitespace from right side.

   210

		e = s + strlen(s);

   211

		while (e > s && ((c=e[-1]) == '\n' || c == '\r' || c == ' ' || c == '\t')) e--;

   212

		*e = '\0';

   213

   214

		// skip comments and empty lines

   215

		if (*s == '#' || *s == '\0') {

   216

			uint ns = comment_size + (e - s + 1);

   217

			uint a = comment_alloc;

   218

			uint pos;

   219

			// add to comment

   220

			if (ns > a) {

   221

				a = max(a, 128);

   222

				do a*=2; while (a < ns);

   223

				comment = realloc(comment, comment_alloc = a);

   224

			}

   225

			pos = comment_size;

   226

			comment_size += (e - s + 1);

   227

			comment[pos + e - s] = '\n'; // comment newline

   228

			memcpy(comment + pos, s, e - s); // copy comment contents

   229

			continue;

   230

		}

   231

   232

		// it's a group?

   233

		if (s[0] == '[') {

   234

			if (e[-1] != ']')

   235

				ShowInfoF("ini: invalid group name '%s'\n", buffer);

   236

			else

   237

				e--;

   238

			s++; // skip [

   239

			group = ini_group_alloc(ini, s, e - s);

   240

			if (comment_size) {

   241

				group->comment = pool_strdup(&ini->pool, comment, comment_size);

   242

				comment_size = 0;

   243

			}

   244

		} else if (group) {

   245

			// find end of keyname

   246

			for (t = s; *t != '\0' && *t != '=' && *t != '\t' && *t != ' '; t++);

   247

   248

			// it's an item in an existing group

   249

			item = ini_item_alloc(group, s, t-s);

   250

			if (comment_size) {

   251

				item->comment = pool_strdup(&ini->pool, comment, comment_size);

   252

				comment_size = 0;

   253

			}

   254

   255

			// find start of parameter

   256

			while (*t == '=' || *t == ' ' || *t == '\t') t++;

   257

   258

   259

			// remove starting quotation marks

   260

			if (*t == '\"') t++;

   261

			// remove ending quotation marks

   262

			e = t + strlen(t);

   263

			if (e > t && e[-1] == '\"') e--;

   264

			*e = '\0';

   265

   266

			item->value = pool_strdup(&ini->pool, t, e - t);

   267

		} else {

   268

			// it's an orphan item

   269

			ShowInfoF("ini: '%s' outside of group\n", buffer);

   270

		}

   271

	}

   272

   274

		ini->comment = pool_strdup(&ini->pool, comment, comment_size);

   275

		comment_size = 0;

   276

	}

   277

   278

	free(comment);

   279

	fclose(in);

   280

   281

	return ini;

   282

}

   283

   284

// lookup a group or make a new one

   285

static IniGroup *ini_getgroup(IniFile *ini, const char *name, int len)

   286

{

   287

	IniGroup *group;

   288

   289

	if (len == -1) len = strlen(name);

   290

   291

	// does it exist already?

   292

	for (group = ini->group; group; group = group->next)

   293

		if (!memcmp(group->name, name, len) && group->name[len] == 0)

   294

			return group;

   295

   296

	// otherwise make a new one

   297

	group = ini_group_alloc(ini, name, len);

   298

	group->comment = pool_strdup(&ini->pool, "\n", 1);

   299

	return group;

   300

}

   301

   302

// lookup an item or make a new one

   303

static IniItem *ini_getitem(IniGroup *group, const char *name, bool create)

   304

{

   305

	IniItem *item;

   306

	uint len = strlen(name);

   307

   308

	for (item = group->item; item; item = item->next)

   309

		if (strcmp(item->name, name) == 0) return item;

   310

   311

	if (!create) return NULL;

   312

   313

	// otherwise make a new one

   314

	return ini_item_alloc(group, name, len);

   315

}

   316

   317

// save ini file from the "abstract" format.

   318

static bool ini_save(const char *filename, IniFile *ini)

   319

{

   320

	FILE *f;

   321

	IniGroup *group;

   322

	IniItem *item;

   323

   324

	f = fopen(filename, "w");

   325

	if (f == NULL) return false;

   326

   327

	for (group = ini->group; group != NULL; group = group->next) {

   328

		if (group->comment) fputs(group->comment, f);

   329

		fprintf(f, "[%s]\n", group->name);

   330

		for (item = group->item; item != NULL; item = item->next) {

   331

			assert(item->value != NULL);

   332

			if (item->comment != NULL) fputs(item->comment, f);

   333

   334

			//*Don't give an equal sign to list items that don't have a parameter */

   335

			if (group->type == IGT_LIST && *item->value == '\0') {

   336

				fprintf(f, "%s\n", item->name);

   337

			} else

   338

				fprintf(f, "%s = %s\n", item->name, item->value);

   339

		}

   340

	}

   341

	if (ini->comment) fputs(ini->comment, f);

   342

   343

	fclose(f);

   344

	return true;

   345

}

   346

   347

static void ini_free(IniFile *ini)

   348

{

   349

	pool_free(&ini->pool);

   350

}

   351

   353

 * @param many full domain of values the ONEofMANY setting can have

   354

 * @param one the current value of the setting for which a value needs found

   355

 * @param onelen force calculation of the *one parameter

   356

 * @return the integer index of the full-list, or -1 if not found */

   357

static int lookup_oneofmany(const char *many, const char *one, int onelen)

   358

{

   359

	const char *s;

   360

	int idx;

   361

   362

	if (onelen == -1) onelen = strlen(one);

   363

   364

	// check if it's an integer

   365

	if (*one >= '0' && *one <= '9')

   366

		return strtoul(one, NULL, 0);

   367

   368

	idx = 0;

   369

	for (;;) {

   370

		// find end of item

   371

		s = many;

   372

		while (*s != '|' && *s != 0) s++;

   373

		if (s - many == onelen && !memcmp(one, many, onelen)) return idx;

   374

		if (*s == 0) return -1;

   375

		many = s + 1;

   376

		idx++;

   377

	}

   378

}

   379

   381

 * @param many full domain of values the MANYofMANY setting can have

   382

 * @param str the current string value of the setting, each individual

   383

 * of seperated by a whitespace\tab or | character

   384

 * @return the 'fully' set integer, or -1 if a set is not found */

   385

static uint32 lookup_manyofmany(const char *many, const char *str)

   386

{

   387

	const char *s;

   388

	int r;

   389

	uint32 res = 0;

   390

   391

	for (;;) {

   392

		// skip "whitespace"

   393

		while (*str == ' ' || *str == '\t' || *str == '|') str++;

   394

		if (*str == 0) break;

   395

   396

		s = str;

   397

		while (*s != 0 && *s != ' ' && *s != '\t' && *s != '|') s++;

   398

   399

		r = lookup_oneofmany(many, str, s - str);

   400

		if (r == -1) return (uint32)-1;

   401

   402

		SETBIT(res, r); // value found, set it

   403

		if (*s == 0) break;

   404

		str = s + 1;

   405

	}

   406

	return res;

   407

}

   408

   409

/** Parse an integerlist string and set each found value

   412

 * @param items pointer to the integerlist-array that will be filled with values

   413

 * @param maxitems the maximum number of elements the integerlist-array has

   414

 * @return returns the number of items found, or -1 on an error */

   415

static int parse_intlist(const char *p, int *items, int maxitems)

   416

{

   417

	int n = 0, v;

   418

	char *end;

   419

   420

	for (;;) {

   421

		v = strtol(p, &end, 0);

   422

		if (p == end || n == maxitems) return -1;

   423

		p = end;

   424

		items[n++] = v;

   425

		if (*p == '\0') break;

   426

		if (*p != ',' && *p != ' ') return -1;

   427

		p++;

   428

	}

   429

   430

	return n;

   431

}

   432

   434

 * @param str the string that contains the values (and will be parsed)

   435

 * @param array pointer to the integer-arrays that will be filled

   436

 * @param nelems the number of elements the array holds. Maximum is 64 elements

   437

 * @param type the type of elements the array holds (eg INT8, UINT16, etc.)

   438

 * @return return true on success and false on error */

   439

static bool load_intlist(const char *str, void *array, int nelems, VarType type)

   440

{

   441

	int items[64];

   442

	int i, nitems;

   443

   444

	if (str == NULL) {

   445

		memset(items, 0, sizeof(items));

   446

		nitems = nelems;

   447

	} else {

   448

		nitems = parse_intlist(str, items, lengthof(items));

   449

		if (nitems != nelems) return false;

   450

	}

   451

   452

	switch (type) {

   453

	case SLE_VAR_BL:

   454

	case SLE_VAR_I8:

   455

	case SLE_VAR_U8:

   456

		for (i = 0; i != nitems; i++) ((byte*)array)[i] = items[i];

   457

		break;

   458

	case SLE_VAR_I16:

   459

	case SLE_VAR_U16:

   460

		for (i = 0; i != nitems; i++) ((uint16*)array)[i] = items[i];

   461

		break;

   462

	case SLE_VAR_I32:

   463

	case SLE_VAR_U32:

   464

		for (i = 0; i != nitems; i++) ((uint32*)array)[i] = items[i];

   465

		break;

   466

	default: NOT_REACHED();

   467

	}

   468

   469

	return true;

   470

}

   471

   474

 * @param buf output buffer where the string-representation will be stored

   475

 * @param array pointer to the integer-arrays that is read from

   476

 * @param nelems the number of elements the array holds.

   477

 * @param type the type of elements the array holds (eg INT8, UINT16, etc.) */

   478

static void make_intlist(char *buf, const void *array, int nelems, VarType type)

   479

{

   480

	int i, v = 0;

   481

	const byte *p = (const byte*)array;

   482

   483

	for (i = 0; i != nelems; i++) {

   484

		switch (type) {

   485

		case SLE_VAR_BL:

   486

		case SLE_VAR_I8:  v = *(int8*)p;   p += 1; break;

   487

		case SLE_VAR_U8:  v = *(byte*)p;   p += 1; break;

   488

		case SLE_VAR_I16: v = *(int16*)p;  p += 2; break;

   489

		case SLE_VAR_U16: v = *(uint16*)p; p += 2; break;

   490

		case SLE_VAR_I32: v = *(int32*)p;  p += 4; break;

   491

		case SLE_VAR_U32: v = *(uint32*)p; p += 4; break;

   492

		default: NOT_REACHED();

   493

		}

   494

		buf += sprintf(buf, (i == 0) ? "%d" : ",%d", v);

   495

	}

   496

}

   497

   499

 * @param buf output buffer where the string-representation will be stored

   500

 * @param many the full-domain string of possible values

   501

 * @param id the value of the variable and whose string-representation must be found */

   502

static void make_oneofmany(char *buf, const char *many, int id)

   503

{

   504

	int orig_id = id;

   505

   506

	// Look for the id'th element

   507

	while (--id >= 0) {