1

/* $Id$ */

     2

     3

#include "stdafx.h"

     4

#include "openttd.h"

     5

#include "currency.h"

     6

#include "functions.h"

     7

#include "macros.h"

     8

#include "screenshot.h"

     9

#include "sound.h"

    10

#include "string.h"

    11

#include "variables.h"

    12

#include "network.h"

    13

#include "settings.h"

    14

    15

typedef struct IniFile IniFile;

    16

typedef struct IniItem IniItem;

    17

typedef struct IniGroup IniGroup;

    18

typedef struct SettingsMemoryPool SettingsMemoryPool;

    19

    20

static void pool_init(SettingsMemoryPool **pool);

    21

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

    22

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

    23

static void pool_free(SettingsMemoryPool **pool);

    24

    25

struct SettingsMemoryPool {

    26

	uint pos,size;

    27

	SettingsMemoryPool *next;

    28

	byte mem[1];

    29

};

    30

    31

static SettingsMemoryPool *pool_new(uint minsize)

    32

{

    33

	SettingsMemoryPool *p;

    34

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

    35

    36

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

    37

	p->pos = 0;

    38

	p->size = minsize;

    39

	p->next = NULL;

    40

	return p;

    41

}

    42

    43

static void pool_init(SettingsMemoryPool **pool)

    44

{

    45

	*pool = pool_new(0);

    46

}

    47

    48

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

    49

{

    50

	uint pos;

    51

	SettingsMemoryPool *p = *pool;

    52

    53

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

    54

    55

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

    56

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

    57

		p = p->next;

    58

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

    59

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

    60

		SettingsMemoryPool *n = pool_new(size);

    61

		*pool = n;

    62

		n->next = p;

    63

		p = n;

    64

	}

    65

    66

	pos = p->pos;

    67

	p->pos += size;

    68

	return p->mem + pos;

    69

}

    70

    71

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

    72

{

    73

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

    74

	p[size] = 0;

    75

	memcpy(p, mem, size);

    76

	return p;

    77

}

    78

    79

static void pool_free(SettingsMemoryPool **pool)

    80

{

    81

	SettingsMemoryPool *p = *pool, *n;

    82

	*pool = NULL;

    83

	while (p) {

    84

		n = p->next;

    85

		free(p);

    86

		p = n;

    87

	}

    88

}

    89

    90

// structs describing the ini format.

    91

struct IniItem {

    92

	char *name;

    93

	char *value;

    94

	char *comment;

    95

	IniItem *next;

    96

};

    97

    98

struct IniGroup {

    99

	char *name; // name of group

   100

	char *comment; //comment for group

   101

	IniItem *item, **last_item;

   102

	IniGroup *next;

   103

	IniFile *ini;

   104

	IniGroupType type; // type of group

   105

};

   106

   107

struct IniFile {

   108

	SettingsMemoryPool *pool;

   109

	IniGroup *group, **last_group;

   110

	char *comment; // last comment in file

   111

};

   112

   113

// allocate an inifile object

   114

static IniFile *ini_alloc(void)

   115

{

   116

	IniFile *ini;

   117

	SettingsMemoryPool *pool;

   118

	pool_init(&pool);

   119

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

   120

	ini->pool = pool;

   121

	ini->group = NULL;

   122

	ini->last_group = &ini->group;

   123

	ini->comment = NULL;

   124

	return ini;

   125

}

   126

   127

// allocate an ini group object

   128

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

   129

{

   130

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

   131

	grp->ini = ini;

   132

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

   133

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

   134

		grp->type = IGT_LIST;

   135

	else

   136

		grp->type = IGT_VARIABLES;

   137

	grp->next = NULL;

   138

	grp->item = NULL;

   139

	grp->comment = NULL;

   140

	grp->last_item = &grp->item;

   141

	*ini->last_group = grp;

   142

	ini->last_group = &grp->next;

   143

	return grp;

   144

}

   145

   146

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

   147

{

   148

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

   149

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

   150

	item->next = NULL;

   151

	item->comment = NULL;

   152

	item->value = NULL;

   153

	*group->last_item = item;

   154

	group->last_item = &item->next;

   155

	return item;

   156

}

   157

   158

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

   159

static IniFile *ini_load(const char *filename)

   160

{

   161

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

   162

	FILE *in;

   163

	IniFile *ini;

   164

	IniGroup *group = NULL;

   165

	IniItem *item;

   166

   167

	char *comment = NULL;

   168

	uint comment_size = 0;

   169

	uint comment_alloc = 0;

   170

   171

	ini = ini_alloc();

   172

   173

	in = fopen(filename, "r");

   174

	if (in == NULL) return ini;

   175

   176

	// for each line in the file

   177

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

   178

   179

		// trim whitespace from the left side

   180

		for(s=buffer; s[0] == ' ' || s[0] == '\t'; s++);

   181

   182

		// trim whitespace from right side.

   183

		e = s + strlen(s);

   184

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

   185

		*e = 0;

   186

   187

		// skip comments and empty lines

   188

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

   189

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

   190

			uint a = comment_alloc;

   191

			uint pos;

   192

			// add to comment

   193

			if (ns > a) {

   194

				a = max(a, 128);

   195

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

   196

				comment = realloc(comment, comment_alloc = a);

   197

			}

   198

			pos = comment_size;

   199

			comment_size += (e - s + 1);

   200

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

   201

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

   202

			continue;

   203

		}

   204

   205

		// it's a group?

   206

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

   207

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

   208

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

   209

			else

   210

				e--;

   211

			s++; // skip [

   212

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

   213

			if (comment_size) {

   214

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

   215

				comment_size = 0;

   216

			}

   217

		} else if (group) {

   218

			// find end of keyname

   219

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

   220

   221

			// it's an item in an existing group

   222

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

   223

			if (comment_size) {

   224

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

   225

				comment_size = 0;

   226

			}

   227

   228

			// for list items, the name and value are the same:

   229

			if( group->type == IGT_LIST ) {

   230

				item->value = item->name;

   231

				continue;

   232

			}

   233

   234

			// find start of parameter

   235

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

   236

   237

   238

			// remove starting quotation marks

   239

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

   240

			// remove ending quotation marks

   241

			e = t + strlen(t);

   242

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

   243

			*e = 0;

   244

   245

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

   246

		} else {

   247

			// it's an orphan item

   248

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

   249

		}

   250

	}

   251

   252

	if (comment_size) {

   253

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

   254

		comment_size = 0;

   255

	}

   256

   257

	free(comment);

   258

	fclose(in);

   259

   260

	return ini;

   261

}

   262

   263

// lookup a group or make a new one

   264

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

   265

{

   266

	IniGroup *group;

   267

   268

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

   269

   270

	// does it exist already?

   271

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

   272

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

   273

			return group;

   274

   275

	// otherwise make a new one

   276

	group = ini_group_alloc(ini, name, len);

   277

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

   278

	return group;

   279

}

   280

   281

// lookup an item or make a new one

   282

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

   283

{

   284

	IniItem *item;

   285

	uint len = strlen(name);

   286

   287

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

   288

		if (!strcmp(item->name, name))

   289

			return item;

   290

   291

	if (!create) return NULL;

   292

   293

	// otherwise make a new one

   294

	item = ini_item_alloc(group, name, len);

   295

	return item;

   296

}

   297

   298

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

   299

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

   300

{

   301

	FILE *f;

   302

	IniGroup *group;

   303

	IniItem *item;

   304

   305

	f = fopen(filename, "w");

   306

	if (f == NULL) return false;

   307

   308

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

   309

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

   310

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

   311

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

   312

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

   313

			if(group->type==IGT_LIST)

   314

				fprintf(f, "%s\n", item->value ? item->value : "");

   315

			else

   316

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

   317

		}

   318

	}

   319

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

   320

   321

	fclose(f);

   322

	return true;

   323

}

   324

   325

static void ini_free(IniFile *ini)

   326

{

   327

	pool_free(&ini->pool);

   328

}

   329

   330

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

   331

{

   332

	const char *s;

   333

	int idx;

   334

   335

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

   336

   337

	// check if it's an integer

   338

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

   339

		return strtoul(one, NULL, 0);

   340

   341

	idx = 0;

   342

	for(;;) {

   343

		// find end of item

   344

		s = many;

   345

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

   346

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

   347

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

   348

		many = s + 1;

   349

		idx++;

   350

	}

   351

}

   352

   353

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

   354

{

   355

	const char *s;

   356

	int r;

   357

	uint32 res = 0;

   358

   359

	for(;;) {

   360

		// skip "whitespace"

   361

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

   362

		if (*str == 0) break;

   363

   364

		s = str;

   365

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

   366

   367

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

   368

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

   369

   370

		res |= (1 << r);

   371

		if (*s == 0) break;

   372

		str = s + 1;

   373

	}

   374

	return res;

   375

}

   376

   377

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

   378

{

   379

	int n = 0, v;

   380

	char *end;

   381

   382

	for(;;) {

   383

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

   384

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

   385

		p = end;

   386

		items[n++] = v;

   387

		if (*p == 0) break;

   388

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

   389

		p++;

   390

	}

   391

   392

	return n;

   393

}

   394

   395

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

   396

{

   397

	int items[64];

   398

	int i,nitems;

   399

   400

	if (str == NULL) {

   401

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

   402

		nitems = nelems;

   403

	} else {

   404

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

   405

		if (nitems != nelems)

   406

			return false;

   407

	}

   408

   409

	switch(type) {

   410

	case SDT_INT8 >> 4:

   411

	case SDT_UINT8 >> 4:

   412

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

   413

		break;

   414

	case SDT_INT16 >> 4:

   415

	case SDT_UINT16 >> 4:

   416

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

   417

		break;

   418

	case SDT_INT32 >> 4:

   419

	case SDT_UINT32 >> 4:

   420

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

   421

		break;

   422

	default:

   423

		NOT_REACHED();

   424

	}

   425

   426

	return true;

   427

}

   428

   429

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

   430

{

   431

	int i, v = 0;

   432

	byte *p = (byte*)array;

   433

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

   434

		switch(type) {

   435

		case SDT_INT8 >> 4: v = *(int8*)p; p += 1; break;

   436

		case SDT_UINT8 >> 4:v = *(byte*)p; p += 1; break;

   437

		case SDT_INT16 >> 4:v = *(int16*)p; p += 2; break;

   438

		case SDT_UINT16 >> 4:v = *(uint16*)p; p += 2; break;

   439

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

   440

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

   441

		default: NOT_REACHED();

   442

		}

   443

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

   444

	}

   445

}

   446

   447

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

   448

{

   449

	int orig_i = i;

   450

	char c;

   451

   452

	while (--i >= 0) {

   453

		do {

   454

			many++;

   455

			if (many[-1] == 0) {

   456

				sprintf(buf, "%d", orig_i);

   457

				return;

   458

			}

   459

		} while (many[-1] != '|');

   460

	}

   461

   462

	// copy until | or 0

   463

	while ((c=*many++) != 0 && c != '|')

   464

		*buf++ = c;

   465

	*buf = 0;

   466

}

   467

   468

static void make_manyofmany(char *buf, const char *many, uint32 x)

   469

{

   470

	const char *start;

   471

	int i = 0;

   472

	bool init = true;

   473

   474

	do {

   475

		start = many;

   476

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

   477

		if (x & 1) {

   478

			if (!init) *buf++ = '|';

   479

			init = false;

   480

			if (start == many) {

   481

				buf += sprintf(buf, "%d", i);

   482

			} else {

   483

				memcpy(buf, start, many - start);

   484

				buf += many - start;

   485

			}

   486

		}

   487

		if (*many == '|') many++;

   488

	} while (++i, x>>=1);

   489

	*buf = 0;

   490

}

   491

   492

static const void *string_to_val(const SettingDesc *desc, const char *str)

   493

{

   494

	unsigned long val;

   495

	char *end;

   496

   497

	switch(desc->flags & 0xF) {

   498

	case SDT_INTX:

   499

		val = strtoul(str, &end, 0);

   500

		if (*end != 0) ShowInfoF("ini: trailing characters at end of setting '%s'", desc->name);

   501

		return (void*)val;

   502

	case SDT_ONEOFMANY: {

   503

		long r = lookup_oneofmany((const char*)desc->b, str, -1);

   504

		if (r != -1) return (void*)r;

   505

		ShowInfoF("ini: invalid value '%s' for '%s'", str, desc->name);

   506

		return 0;

   507

	}

   508

	case SDT_MANYOFMANY: {

   509

		unsigned long r = lookup_manyofmany(desc->b, str);

   510

		if (r != (unsigned long)-1) return (void*)r;

   511

		ShowInfoF("ini: invalid value '%s' for '%s'", str, desc->name);

   512

		return 0;

   513

	}

   514

	case SDT_BOOLX:

   515

		if (!strcmp(str, "true") || !strcmp(str, "on") || !strcmp(str, "1"))

   516

			return (void*)true;

   517

		if (!strcmp(str, "false") || !strcmp(str, "off") || !strcmp(str, "0"))

   518

			return (void*)false;