374 /**

   375  * Simple sorter for GRFS

   376  * @param p1 the first GRFConfig *

   377  * @param p2 the second GRFConfig *

   378  * @return the same strcmp would return for the name of the NewGRF.

   379  */

   380 static int CDECL GRFSorter(const void *p1, const void *p2)

   381 {

   382 	const GRFConfig *c1 = *(const GRFConfig **)p1;

   383 	const GRFConfig *c2 = *(const GRFConfig **)p2;

   384 

   385 	return strcmp(c1->name != NULL ? c1->name : c1->filename,

   386 		c2->name != NULL ? c2->name : c2->filename);

   387 }

   388 

   407 

   409 	if (num == 0 || _all_grfs == NULL) return;

   410 

   411 	/* Sort the linked list using quicksort.

   412 	 * For that we first have to make an array, the qsort and

   413 	 * then remake the linked list. */

   414 	GRFConfig **to_sort = MallocT<GRFConfig*>(num);

   415 	if (to_sort == NULL) return; // No memory, then don't sort

   416 

   417 	uint i = 0;

   418 	for (GRFConfig *p = _all_grfs; p != NULL; p = p->next, i++) {

   419 		to_sort[i] = p;

   420 	}

   421 	/* Number of files is not necessarily right */

   422 	num = i;

   423 

   424 	qsort(to_sort, num, sizeof(GRFConfig*), GRFSorter);

   425 

   426 	for (i = 1; i < num; i++) {

   427 		to_sort[i - 1]->next = to_sort[i];

   428 	}

   429 	to_sort[num - 1]->next = NULL;

   430 	_all_grfs = to_sort[0];