1

#include "stdafx.h"

     2

#include "ttd.h"

     3

#include "table/strings.h"

     4

#include "vehicle.h"

     5

#include "command.h"

     6

#include "station.h"

     7

#include "player.h"

     8

#include "news.h"

     9

#include "saveload.h"

    10

    11

enum {

    12

	/* Max orders: 64000 (64 * 1000) */

    13

	ORDER_POOL_BLOCK_SIZE_BITS = 6,       /* In bits, so (1 << 6) == 64 */

    14

	ORDER_POOL_MAX_BLOCKS      = 1000,

    15

};

    16

    17

/**

    18

 * Called if a new block is added to the order-pool

    19

 */

    20

static void OrderPoolNewBlock(uint start_item)

    21

{

    22

	Order *order;

    23

    24

	FOR_ALL_ORDERS_FROM(order, start_item)

    25

		order->index = start_item++;

    26

}

    27

    28

/* Initialize the order-pool */

    29

MemoryPool _order_pool = { "Orders", ORDER_POOL_MAX_BLOCKS, ORDER_POOL_BLOCK_SIZE_BITS, sizeof(Order), &OrderPoolNewBlock, 0, 0, NULL };

    30

    31

/**

    32

 *

    33

 * Unpacks a order from savegames made with TTD(Patch)

    34

 *

    35

 */

    36

Order UnpackOldOrder(uint16 packed)

    37

{

    38

	Order order;

    39

	order.type    = (packed & 0x000F);

    40

	order.flags   = (packed & 0x00F0) >> 4;

    41

	order.station = (packed & 0xFF00) >> 8;

    42

	order.next    = NULL;

    43

    44

	// Sanity check

    45

	// TTD stores invalid orders as OT_NOTHING with non-zero flags/station

    46

	if (order.type == OT_NOTHING && (order.flags != 0 || order.station != 0)) {

    47

		order.type = OT_DUMMY;

    48

		order.flags = 0;

    49

	}

    50

    51

	return order;

    52

}

    53

    54

/**

    55

 *

    56

 * Unpacks a order from savegames with version 4 and lower

    57

 *

    58

 */

    59

Order UnpackVersion4Order(uint16 packed)

    60

{

    61

	Order order;

    62

	order.type    = (packed & 0x000F);

    63

	order.flags   = (packed & 0x00F0) >> 4;

    64

	order.station = (packed & 0xFF00) >> 8;

    65

	order.next    = NULL;

    66

	return order;

    67

}

    68

    69

/**

    70

 *

    71

 * Updates the widgets of a vehicle which contains the order-data

    72

 *

    73

 */

    74

void InvalidateVehicleOrder(const Vehicle *v)

    75

{

    76

	InvalidateWindow(WC_VEHICLE_VIEW,   v->index);

    77

	InvalidateWindow(WC_VEHICLE_ORDERS, v->index);

    78

}

    79

    80

/**

    81

 *

    82

 * Swap two orders

    83

 *

    84

 */

    85

static void SwapOrders(Order *order1, Order *order2)

    86

{

    87

	Order temp_order;

    88

    89

	temp_order = *order1;

    90

	AssignOrder(order1, *order2);

    91

	order1->next = order2->next;

    92

	AssignOrder(order2, temp_order);

    93

	order2->next = temp_order.next;

    94

}

    95

    96

/**

    97

 *

    98

 * Allocate a new order

    99

 *

   100

 * @return Order* if a free space is found, else NULL.

   101

 *

   102

 */

   103

static Order *AllocateOrder(void)

   104

{

   105

	Order *order;

   106

   107

	FOR_ALL_ORDERS(order) {

   108

		if (order->type == OT_NOTHING) {

   109

			uint index = order->index;

   110

   111

			memset(order, 0, sizeof(Order));

   112

			order->index = index;

   113

			order->next = NULL;

   114

   115

			return order;

   116

		}

   117

	}

   118

   119

	/* Check if we can add a block to the pool */

   120

	if (AddBlockToPool(&_order_pool))

   121

		return AllocateOrder();

   122

   123

	return NULL;

   124

}

   125

   126

/**

   127

 *

   128

 * Assign data to an order (from an other order)

   129

 *   This function makes sure that the index is maintained correctly

   130

 *

   131

 */

   132

void AssignOrder(Order *order, Order data)

   133

{

   134

	order->type    = data.type;

   135

	order->flags   = data.flags;

   136

	order->station = data.station;

   137

}

   138

   139

/**

   140

 *

   141

 * Add an order to the orderlist of a vehicle

   142

 *

   143

 * @param veh_sel      First 16 bits are the ID of the vehicle. The next 16 are the selected order (if any)

   144

 *                       If the lastone is given, order will be inserted above thatone

   145

 * @param packed_order Packed order to insert

   146

 *

   147

 */

   148

int32 CmdInsertOrder(int x, int y, uint32 flags, uint32 veh_sel, uint32 packed_order)

   149

{

   150

	Vehicle *v      = GetVehicle(veh_sel & 0xFFFF);

   151

	int sel         = veh_sel >> 16;

   152

	Order new_order = UnpackOrder(packed_order);

   153

   154

	if (sel > v->num_orders)

   155

		return_cmd_error(STR_EMPTY);

   156

   157

	if (IsOrderPoolFull())

   158

		return_cmd_error(STR_8831_NO_MORE_SPACE_FOR_ORDERS);

   159

   160

	/* XXX - This limit is only here because the backuppedorders can't

   161

	    handle any more then this.. */

   162

	if (v->num_orders >= 40)

   163

		return_cmd_error(STR_8832_TOO_MANY_ORDERS);

   164

   165

	/* For ships, make sure that the station is not too far away from the

   166

	 * previous destination, for human players with new pathfinding disabled */

   167

	if (v->type == VEH_Ship && IS_HUMAN_PLAYER(v->owner) &&

   168

		sel != 0 && GetVehicleOrder(v, sel - 1)->type == OT_GOTO_STATION

   169

		&& !_patches.new_pathfinding_all) {

   170

   171

		int dist = DistanceManhattan(

   172

			GetStation(GetVehicleOrder(v, sel - 1)->station)->xy,

   173

			GetStation(new_order.station)->xy

   174

		);

   175

		if (dist >= 130)

   176

			return_cmd_error(STR_0210_TOO_FAR_FROM_PREVIOUS_DESTINATIO);

   177

	}

   178

   179

	if (flags & DC_EXEC) {

   180

		Order *new;

   181

		Vehicle *u;

   182

   183

		new = AllocateOrder();

   184

		AssignOrder(new, new_order);

   185

   186

		/* Create new order and link in list */

   187

		if (v->orders == NULL) {

   188

			v->orders = new;

   189

		} else {

   190

			/* Try to get the previous item (we are inserting above the

   191

			    selected) */

   192

			Order *order = GetVehicleOrder(v, sel - 1);

   193

   194

			if (order == NULL && GetVehicleOrder(v, sel) != NULL) {

   195

				/* There is no previous item, so we are altering v->orders itself

   196

				    But because the orders can be shared, we copy the info over

   197

				    the v->orders, so we don't have to change the pointers of

   198

				    all vehicles */

   199

				SwapOrders(v->orders, new);

   200

				/* Now update the next pointers */

   201

				v->orders->next = new;

   202

			} else if (order == NULL) {

   203

				/* 'sel' is a non-existing order, add him to the end */

   204

				order = GetLastVehicleOrder(v);

   205

				order->next = new;

   206

			} else {

   207

				/* Put the new order in between */

   208

				new->next = order->next;

   209

				order->next = new;

   210

			}

   211

		}

   212

   213

		u = GetFirstVehicleFromSharedList(v);

   214

		while (u != NULL) {

   215

			/* Increase amount of orders */

   216

			u->num_orders++;

   217

   218

			/* If the orderlist was empty, assign it */

   219

			if (u->orders == NULL)

   220

				u->orders = v->orders;

   221

   222

			assert(v->orders == u->orders);

   223

   224

			/* If there is added an order before the current one, we need

   225

			to update the selected order */

   226

			if (sel <= u->cur_order_index) {

   227

				uint cur = u->cur_order_index + 1;

   228

				/* Check if we don't go out of bound */

   229

				if (cur < u->num_orders)

   230

					u->cur_order_index = cur;

   231

			}

   232

			/* Update any possible open window of the vehicle */

   233

			InvalidateVehicleOrder(u);

   234

   235

			u = u->next_shared;

   236

		}

   237

   238

		/* Make sure to rebuild the whole list */

   239

		RebuildVehicleLists();

   240

	}

   241

   242

	return 0;

   243

}

   244

   245

/**

   246

 *

   247

 * Declone an order-list

   248

 *

   249

 */

   250

static int32 DecloneOrder(Vehicle *dst, uint32 flags)

   251

{

   252

	if (flags & DC_EXEC) {

   253

		/* Delete orders from vehicle */

   254

		DeleteVehicleOrders(dst);

   255

   256

		InvalidateVehicleOrder(dst);

   257

		RebuildVehicleLists();

   258

	}

   259

	return 0;

   260

}

   261

   262

/**

   263

 *

   264

 * Delete an order from the orderlist of a vehicle

   265

 *

   266

 * @param vehicle_id The ID of the vehicle

   267

 * @param selected   The order to delete

   268

 *

   269

 */

   270

int32 CmdDeleteOrder(int x, int y, uint32 flags, uint32 vehicle_id, uint32 selected)

   271

{

   272

	Vehicle *v = GetVehicle(vehicle_id), *u;

   273

	uint sel   = selected;

   274

	Order *order;

   275

   276

	/* XXX -- Why is this here? :s */

   277

	_error_message = STR_EMPTY;

   278

   279

	/* If we did not select an order, we maybe want to de-clone the orders */

   280

	if (sel >= v->num_orders)

   281

		return DecloneOrder(v, flags);

   282

   283

	order = GetVehicleOrder(v, sel);

   284

	if (order == NULL)

   285

		return CMD_ERROR;

   286

   287

	if (flags & DC_EXEC) {

   288

		if (GetVehicleOrder(v, sel - 1) == NULL) {

   289

			if (GetVehicleOrder(v, sel + 1) != NULL) {

   290

				/* First item, but not the last, so we need to alter v->orders

   291

				    Because we can have shared order, we copy the data

   292

				    from the next item over the deleted */

   293

				order = GetVehicleOrder(v, sel + 1);

   294

				SwapOrders(v->orders, order);

   295

			} else {

   296

				/* Last item, so clean the list */

   297

				v->orders = NULL;

   298

			}

   299

		} else {

   300

			GetVehicleOrder(v, sel - 1)->next = order->next;

   301

		}

   302

   303

		/* Give the item free */

   304

		order->type = OT_NOTHING;

   305

		order->next = NULL;

   306

   307

		u = GetFirstVehicleFromSharedList(v);

   308

		while (u != NULL) {

   309

			u->num_orders--;

   310

   311

			if (sel < u->cur_order_index)

   312

				u->cur_order_index--;

   313

   314

			/* If we removed the last order, make sure the shared vehicles

   315

			    also set their orders to NULL */

   316

			if (v->orders == NULL)

   317

				u->orders = NULL;

   318

   319

			assert(v->orders == u->orders);

   320

   321

			/* NON-stop flag is misused to see if a train is in a station that is

   322

			    on his order list or not */

   323

			if (sel == u->cur_order_index &&

   324

					u->current_order.type == OT_LOADING &&

   325

					HASBIT(u->current_order.flags, OFB_NON_STOP)) {

   326

				u->current_order.flags = 0;

   327

			}

   328

   329

			/* Update any possible open window of the vehicle */

   330

			InvalidateVehicleOrder(u);

   331

   332

			u = u->next_shared;

   333

		}

   334

   335

		RebuildVehicleLists();

   336

	}

   337

   338

	return 0;

   339

}

   340

   341

/**

   342

 *

   343

 * Goto next order of order-list

   344

 *

   345

 * @param vehicle_id The ID of the vehicle

   346

 *

   347

 */

   348

int32 CmdSkipOrder(int x, int y, uint32 flags, uint32 vehicle_id, uint32 not_used)

   349

{

   350

	Vehicle *v = GetVehicle(vehicle_id);

   351

   352

	if (flags & DC_EXEC) {

   353

		/* Goto next order */

   354

		{

   355

			byte b = v->cur_order_index + 1;

   356

			if (b >= v->num_orders)

   357

				b = 0;

   358

   359

			v->cur_order_index = b;

   360

   361

			if (v->type == VEH_Train)

   362

				v->u.rail.days_since_order_progr = 0;

   363

   364

			if (v->type == VEH_Road && v->u.road.slot != NULL) {

   365

				//Clear the slot

   366

				v->u.road.slot->slot[v->u.road.slotindex] = 0;

   367

				v->u.road.slot = NULL;

   368

			}

   369

		}

   370

   371

		/* NON-stop flag is misused to see if a train is in a station that is

   372

		    on his order list or not */

   373

		if (v->current_order.type == OT_LOADING &&

   374

				HASBIT(v->current_order.flags, OFB_NON_STOP)) {

   375

			v->current_order.flags = 0;

   376

		}

   377

   378

		InvalidateVehicleOrder(v);

   379

	}

   380

   381

	/* We have an aircraft/ship, they have a mini-schedule, so update them all */

   382

	if (v->type == VEH_Aircraft) InvalidateWindowClasses(WC_AIRCRAFT_LIST);

   383

	if (v->type == VEH_Ship) InvalidateWindowClasses(WC_SHIPS_LIST);

   384

   385

	return 0;

   386

}

   387

   388

   389

/**

   390

 *

   391

 * Add an order to the orderlist of a vehicle

   392

 *

   393

 * @param veh_sel      First 16 bits are the ID of the vehicle. The next 16 are the selected order (if any)

   394

 *                       If the lastone is given, order will be inserted above thatone

   395

 * @param mode         Mode to change the order to

   396

 *

   397

 */

   398

int32 CmdModifyOrder(int x, int y, uint32 flags, uint32 veh_sel, uint32 mode)

   399

{

   400

	Vehicle *v = GetVehicle(veh_sel & 0xFFFF);

   401

	byte sel = veh_sel >> 16;

   402

	Order *order;

   403

   404

	/* Is it a valid order? */

   405

	if (sel >= v->num_orders)

   406

		return CMD_ERROR;

   407

   408

	order = GetVehicleOrder(v, sel);

   409

	if (order->type != OT_GOTO_STATION &&

   410

			(order->type != OT_GOTO_DEPOT || mode == OFB_UNLOAD) &&

   411

			(order->type != OT_GOTO_WAYPOINT || mode != OFB_NON_STOP))

   412

		return CMD_ERROR;

   413

   414

	if (flags & DC_EXEC) {

   415

		switch (mode) {

   416

		case OFB_FULL_LOAD:

   417

			TOGGLEBIT(order->flags, OFB_FULL_LOAD);

   418

			if (order->type != OT_GOTO_DEPOT)

   419

				CLRBIT(order->flags, OFB_UNLOAD);

   420

			break;

   421

		case OFB_UNLOAD:

   422

			TOGGLEBIT(order->flags, OFB_UNLOAD);

   423

			CLRBIT(order->flags, OFB_FULL_LOAD);

   424

			break;

   425

		case OFB_NON_STOP:

   426

			TOGGLEBIT(order->flags, OFB_NON_STOP);

   427

			break;

   428

		}

   429

   430

		/* Update the windows, also for vehicles that share the same order list */

   431

		{

   432

			Vehicle *u = GetFirstVehicleFromSharedList(v);

   433

			while (u != NULL) {

   434

				InvalidateVehicleOrder(u);

   435

				u = u->next_shared;

   436

			}

   437

		}

   438

	}

   439

   440

	return 0;

   441

}

   442

   443

/**

   444

 *

   445

 * Clone/share/copy an order-list of an other vehicle

   446

 *

   447

 * @param veh1_veh2 First 16 bits are of destination vehicle, last 16 of source vehicle

   448

 * @param mode      Mode of cloning (CO_SHARE, CO_COPY, CO_UNSHARE)

   449

 *

   450

 */

   451

int32 CmdCloneOrder(int x, int y, uint32 flags, uint32 veh1_veh2, uint32 mode)

   452

{

   453

	Vehicle *dst = GetVehicle(veh1_veh2 & 0xFFFF);

   454

   455

	if (dst->type == 0 || dst->owner != _current_player)

   456

		return CMD_ERROR;

   457

   458

	switch(mode) {

   459

		case CO_SHARE: {

   460

			Vehicle *src = GetVehicle(veh1_veh2 >> 16);

   461

   462

			/* Sanity checks */

   463

			if (src->type == 0 || src->owner != _current_player || dst->type != src->type || dst == src)

   464

				return CMD_ERROR;

   465

   466

			/* Trucks can't share orders with busses (and visa versa) */

   467

			if (src->type == VEH_Road) {

   468

				if (src->cargo_type != dst->cargo_type && (src->cargo_type == CT_PASSENGERS || dst->cargo_type == CT_PASSENGERS))

   469

					return CMD_ERROR;

   470

			}

   471

   472

			/* Is the vehicle already in the shared list? */

   473

			{

   474

				Vehicle *u = GetFirstVehicleFromSharedList(src);

   475

				while (u != NULL) {

   476

					if (u == dst)

   477

						return CMD_ERROR;

   478

					u = u->next_shared;

   479

				}

   480

			}

   481

   482

			if (flags & DC_EXEC) {

   483

				/* If the destination vehicle had a OrderList, destroy it */

   484

				DeleteVehicleOrders(dst);

   485

   486

				dst->orders = src->orders;

   487

				dst->num_orders = src->num_orders;

   488

   489

				/* Link this vehicle in the shared-list */

   490

				dst->next_shared = src->next_shared;

   491

				dst->prev_shared = src;

   492

				if (src->next_shared != NULL)

   493