File: f_sort.c

package info (click to toggle)
fenix 0.92a.dfsg1-12
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster, sid
  • size: 8,492 kB
  • sloc: ansic: 42,357; sh: 3,474; perl: 527; makefile: 180; cpp: 19
file content (509 lines) | stat: -rw-r--r-- 12,298 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
/*
 *  Fenix - Videogame compiler/interpreter
 *  Current release       : FENIX - PROJECT 1.0 - R 0.85
 *  Last stable release   :
 *  Project documentation : http://fenix.divsite.net
 *
 *
 *  This program 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; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program 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 this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
 *
 *  Copyright � 1999 Jos� Luis Cebri�n Pag�e
 *  Copyright � 2002 Fenix Team
 *
 */

/*
 * FILE        : f_sort.c
 * DESCRIPTION : FXI functions for array sorting
 */

#include <stdlib.h>
#include <string.h>

#ifdef USE_GETTEXT
#include <libintl.h>
#define _(String) gettext (String)
#else
#define _(String) String
#endif

#include "fxi.h"

int keyoffset = 0;

/*
 *	Comparison functions used by sort_variables
 */

int compare_int		(const Sint32 * a, const Sint32 * b)	{ return *(Sint32 *)((Uint8 *)a + keyoffset) - *(Sint32 *)((Uint8 *)b + keyoffset); }
int compare_dword	(const Uint32 * a, const Uint32 * b)	{ return *(Uint32 *)((Uint8 *)a + keyoffset) - *(Uint32 *)((Uint8 *)b + keyoffset); }
int compare_word	(const Uint16 * a, const Uint16 * b)	{ return *(Uint16 *)((Uint8 *)a + keyoffset) - *(Uint16 *)((Uint8 *)b + keyoffset); }
int compare_short   (const Sint16 * a, const Sint16 * b)	{ return *(Sint16 *)((Uint8 *)a + keyoffset) - *(Sint16 *)((Uint8 *)b + keyoffset); }
int compare_byte    (const Uint8  * a, const Uint8  * b)	{ return *(Uint8  *)((Uint8 *)a + keyoffset) - *(Uint8  *)((Uint8 *)b + keyoffset); }
int compare_sbyte   (const Sint8  * a, const Sint8  * b)	{ return *(Sint8  *)((Uint8 *)a + keyoffset) - *(Sint8  *)((Uint8 *)b + keyoffset); }
int compare_float   (const float  * a, const float  * b)	{ return *(float  *)((Uint8 *)a + keyoffset) - *(float  *)((Uint8 *)b + keyoffset); }
int compare_string  (const int    * a, const int    * b)	{ return strcmp(string_get(*(int *)((Uint8 *)a + keyoffset)), string_get(*(int *)((Uint8 *)b + keyoffset))); }

/*
 *  FUNCTION : dcb_typedef_reduce
 *
 *  Utility function to convert a DCB TYPEDEF (reduced type definition
 *  used in the DCB file instead of the full TYPEDEF of the compiler)
 *  to the definition of a pointer to itself.
 *
 *	Beware: it could cause a type to grow too much. In this case this
 *  function will fail with a gr_con_printf and with no operation performed.
 *
 *  PARAMS:
 *      type			Pointer to the type to be converted
 *
 *  RETURN VALUE:
 *		None
 *
 */

static void dcb_typedef_enlarge(DCB_TYPEDEF * type)
{
	int i;

	for (i = 0 ; i < MAX_TYPECHUNKS ; i++)
	{
		if (i != TYPE_POINTER && i != TYPE_ARRAY)
			break;
	}
	if (i >= MAX_TYPECHUNKS-1)
	{
		gr_con_printf (_("Data type too complex"));
		return;
	}
	for (i = MAX_TYPECHUNKS-1 ; i > 0 ; i--)
	{
		type->BaseType[i] = type->BaseType[i-1];
		type->Count[i]    = type->Count[i-1];
	}
	type->BaseType[0] = TYPE_POINTER;
}

/*
 *  FUNCTION : dcb_typedef_reduce
 *
 *  Utility function to convert a DCB TYPEDEF (reduced type definition
 *  used in the DCB file instead of the full TYPEDEF of the compiler)
 *  to its pointed type.
 *
 *  PARAMS:
 *      type			Pointer to the type to be converted
 *
 *  RETURN VALUE:
 *		None
 *
 */

static void dcb_typedef_reduce(DCB_TYPEDEF * type)
{
	int i;

	for (i = 0 ; i < MAX_TYPECHUNKS-1 ; i++)
	{
		type->BaseType[i] = type->BaseType[i+1];
		type->Count[i]    = type->Count[i+1];
	}
}

/*
 *  FUNCTION : dcb_typedef_size
 *
 *  Utility function to calculate the size of a variable using its
 *  DCB TYPEDEF (reduced type definition used in the DCB file)
 *
 *  PARAMS:
 *      type			Pointer to the type
 *
 *  RETURN VALUE:
 *		Size in bytes of the variable
 *
 */

static int dcb_typedef_size (const DCB_TYPEDEF * type)
{
	int i = 0;
	int count = 1;

	while (type->BaseType[i] == TYPE_ARRAY)
	{
		count *= type->Count[i];
		i++;
	}
	switch (type->BaseType[i])
	{
		case TYPE_DWORD:
		case TYPE_INT:
		case TYPE_FLOAT:
		case TYPE_STRING:
		case TYPE_POINTER:
			return 4 * count;

		case TYPE_SHORT:
		case TYPE_WORD:
			return 2 * count;

		case TYPE_CHAR:
		case TYPE_SBYTE:
		case TYPE_BYTE:
			return count;

		case TYPE_STRUCT:
		{
			unsigned int maxoffset = 0;
			unsigned int n;
			DCB_TYPEDEF * maxvar = NULL;

			for (n = 0 ; n < dcb.varspace[type->Members].NVars ; n++)
			{
				if (dcb.varspace_vars[type->Members][n].Offset > maxoffset)
				{
					maxoffset = dcb.varspace_vars[type->Members][n].Offset;
					maxvar    = &dcb.varspace_vars[type->Members][n].Type;
				}
			}
			if (maxvar == NULL)
			{
				gr_con_printf (_("Empty structure"));
				return 0;
			}

			return count * maxoffset + dcb_typedef_size(maxvar);
		}

		default:
			gr_con_printf (_("Unknown type"));
			return 0;
	}
}

/*
 *  FUNCTION : sort_variables
 *
 *  Sorting function used by all FXI variants
 *
 *  PARAMS:
 *      data			Pointer to the start of the array
 *		key_offset		Offset of the key variable inside each element
 *		key_type		Basic type (like TYPE_INT) of the key variable
 *		element_size	Size of a single element
 *		elements		Number of elements to be sorted
 *
 *  RETURN VALUE:
 *		1 if succesful, 0 if error
 *
 */

static int sort_variables (void * data, int key_offset, int key_type, int element_size, int elements)
{
	int (*compare)(const void *, const void *) = NULL;

    keyoffset = key_offset;

	switch (key_type)
	{
		case TYPE_INT:
			compare = compare_int;
			break;
		case TYPE_WORD:
			compare = compare_word;
			break;
		case TYPE_DWORD:
			compare = compare_dword;
			break;
		case TYPE_SHORT:
			compare = compare_short;
			break;
		case TYPE_BYTE:
			compare = compare_byte;
			break;
		case TYPE_SBYTE:
			compare = compare_sbyte;
			break;
		case TYPE_CHAR:
			compare = compare_byte;
			break;
		case TYPE_STRING:
			compare = compare_string;
			break;
		case TYPE_FLOAT:
			compare = compare_float;
			break;
		default:
			gr_con_printf (_("Invalid data type used as sorting key"));
			return 0;
	}

	qsort (data, elements, element_size, compare);
	return 1;
}

/**
 *	SORT (variable)
 *	Sorts an array of structs or simple values. If a struct, uses the first
 *	variable as a key for sorting order.
 **/

int fxi_sort (INSTANCE * my, int * params)
{
	// Get the description of the data to be sorted

	void *			data = (void *)params[0];
	DCB_TYPEDEF *	type = (DCB_TYPEDEF *)params[1];
	DCB_TYPEDEF     copy = *type;
	int				vars = params[2];
	int				element_size;

	// Is it valid?

	if (type->BaseType[0] != TYPE_ARRAY)
	{
		gr_con_printf (_("Only arrays of structures or values can be sorted"));
		return 0;
	}
	if (vars > 1)
	{
		gr_con_printf (_("Trying to sort a structure with just one element"));
		return 0;
	}
	if (type->Count[0] < 2)
	{
		gr_con_printf (_("Trying to sort an array with just one element"));
		return 0;
	}

	// Get the key type

	dcb_typedef_reduce(&copy);
	element_size = dcb_typedef_size(&copy);

	// If an struct or array, get its first element

	for (;;)
	{
		while (copy.BaseType[0] == TYPE_ARRAY)
			dcb_typedef_reduce(&copy);
		if (copy.BaseType[0] == TYPE_STRUCT)
			copy = dcb.varspace_vars[copy.Members][0].Type;
		else
			break;
	}

	// Do the sorting

	return sort_variables (data, 0, copy.BaseType[0], element_size, type->Count[0]);
}

/**
 *	KSORT (variable, key)
 *	Sorts an array of structs, using the given variable as a key
 **/

int fxi_ksort (INSTANCE * my, int * params)
{
	// Get the description of the data to be sorted

	void *			data = (void *)params[0];
	DCB_TYPEDEF *	type = (DCB_TYPEDEF *)params[1];
	DCB_TYPEDEF     copy = *type;
	int				vars = params[2];
	int				element_size;

	void *			key_data = (void *)params[3];
	DCB_TYPEDEF *	key_type = (DCB_TYPEDEF *)params[4];
	int				key_vars = params[5];

	// Is it valid?

	if (type->BaseType[0] != TYPE_ARRAY)
	{
		gr_con_printf (_("Only arrays of structures or values can be sorted"));
		return 0;
	}
	if (vars > 1)
	{
		gr_con_printf (_("Trying to sort a structure with just one element"));
		return 0;
	}
	if (type->Count[0] < 2)
	{
		gr_con_printf (_("Trying to sort an array with just one element"));
		return 0;
	}

	// Check the key given

	dcb_typedef_reduce(&copy);
	element_size = dcb_typedef_size(&copy);

	if ((Uint8 *)key_data > (Uint8*)data + element_size || key_data < data)
	{
		gr_con_printf (_("Trying to sort using an key external to the first element"));
		return 0;
	}

	copy = *key_type;

	// If an struct or array, get its first element

	for (;;)
	{
		while (copy.BaseType[0] == TYPE_ARRAY)
			dcb_typedef_reduce(&copy);
		if (copy.BaseType[0] == TYPE_STRUCT)
			copy = dcb.varspace_vars[copy.Members][0].Type;
		else
			break;
	}

	// Do the sorting

	return sort_variables (data, (Uint8*)key_data - (Uint8*)data, copy.BaseType[0], element_size, type->Count[0]);
}

/**
 *	SORT (variable, count)
 *	Sorts an array of structs or simple values. If a struct, uses the first
 *	variable as a key for sorting order. It accepts arrays of one element
 *  or a pointer to an array, unlike the simple SORT version.
 **/

int fxi_sort_n (INSTANCE * my, int * params)
{
	// Get the description of the data to be sorted

	void *			data = (void *)params[0];
	DCB_TYPEDEF *	type = (DCB_TYPEDEF *)params[1];
	DCB_TYPEDEF     copy = *type;
	int				vars = params[2];
	int				element_size;

	// Is it valid?

	if (type->BaseType[0] == TYPE_POINTER)
	{
		dcb_typedef_reduce(&copy);
		data = *(void **)data;
	}
	if (copy.BaseType[0] != TYPE_ARRAY)
	{
		dcb_typedef_enlarge(&copy);
		copy.BaseType[0] = TYPE_ARRAY;
		copy.Count[0]    = 1;
	}
	if (vars > 1)
	{
		gr_con_printf (_("Trying to sort a structure with just one element"));
		return 0;
	}

	// Get the key type

	dcb_typedef_reduce(&copy);
	element_size = dcb_typedef_size(&copy);

	// If an struct or array, get its first element

	for (;;)
	{
		while (copy.BaseType[0] == TYPE_ARRAY)
			dcb_typedef_reduce(&copy);
		if (copy.BaseType[0] == TYPE_STRUCT)
			copy = dcb.varspace_vars[copy.Members][0].Type;
		else
			break;
	}

	// Do the sorting

	return sort_variables (data, 0, copy.BaseType[0], element_size, params[3]);
}

/**
 *	KSORT (variable, key, elements)
 *	Sorts an array of structs, using the given variable as a key and
 *  limiting the sorting to the first n elements. Accepts pointers or
 *  single elements, unlike the previous version of KSORT above.
 **/

int fxi_ksort_n (INSTANCE * my, int * params)
{
	// Get the description of the data to be sorted

	void *			data = (void *)params[0];
	DCB_TYPEDEF *	type = (DCB_TYPEDEF *)params[1];
	DCB_TYPEDEF     copy = *type;
	int				vars = params[2];
	int				element_size;

	void *			key_data = (void *)params[3];
	DCB_TYPEDEF *	key_type = (DCB_TYPEDEF *)params[4];
	int				key_vars = params[5];

	// Is it valid?

	if (type->BaseType[0] == TYPE_POINTER)
	{
		dcb_typedef_reduce(&copy);
		data = *(void **)data;
	}
	if (copy.BaseType[0] != TYPE_ARRAY)
	{
		// If the type is not an array or a pointer, it is a
		// pointer value already reduced by the bytecode

		dcb_typedef_enlarge(&copy);
		copy.BaseType[0] = TYPE_ARRAY;
		copy.Count[0]    = 1;
	}
	if (vars > 1)
	{
		gr_con_printf (_("Trying to sort a structure with just one element"));
		return 0;
	}

	// Check the key given

	dcb_typedef_reduce(&copy);
	element_size = dcb_typedef_size(&copy);

	if ((Uint8 *)key_data > (Uint8*)data + element_size || key_data < data)
	{
		gr_con_printf (_("Trying to sort using an key external to the first element"));
		return 0;
	}

	copy = *key_type;

	// If an struct or array, get its first element

	for (;;)
	{
		while (copy.BaseType[0] == TYPE_ARRAY)
			dcb_typedef_reduce(&copy);
		if (copy.BaseType[0] == TYPE_STRUCT)
			copy = dcb.varspace_vars[copy.Members][0].Type;
		else
			break;
	}

	// Do the sorting

	return sort_variables (data, (Uint8*)key_data - (Uint8*)data, copy.BaseType[0], element_size, params[6]);
}