src/list/lsort.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Defines
#define	DECL_SORT1   static
#define	DECL_SORT   static
#define	COMPTYPE   void *
Functions
DECL_SORT TYPE *	SORT (TYPE *list_in, int(*compare)(COMPTYPE, COMPTYPE), int cnt)

---

Define Documentation

#define COMPTYPE   void *

Definition at line 70 of file lsort.h.

#define DECL_SORT   static

Definition at line 66 of file lsort.h.

#define DECL_SORT1   static

Definition at line 62 of file lsort.h.

---

Function Documentation

DECL_SORT TYPE * SORT	(	TYPE *	list_in,
		int(*)(COMPTYPE, COMPTYPE)	compare,
		int	cnt
	)

Definition at line 96 of file lsort.h.

{
    register TYPE *p, **plast, *list1, *list2;
    register int i;

    if (cnt > 1) {
        /* break the list in half */
        for(p = list_in, i = cnt/2-1; i > 0; p = p->NEXT, i--)
            ;
        list1 = list_in;
        list2 = p->NEXT;
        p->NEXT = 0;

        /* Recursively sort the sub-lists (unless only 1 element) */
        if ((i = cnt/2) > 1) {
            list1 = SORT(list1, compare, i);
        }
        if ((i = cnt - i) > 1) {
            list2 = SORT(list2, compare, i);
        }

        /* Merge the two sorted sub-lists */
        plast = &list_in;
        for(;;) {
#ifdef FIELD
#ifdef DIRECT_COMPARE
            if (list1->FIELD < list2->FIELD) {
#else
            if ((*compare)(list1->FIELD, list2->FIELD) <= 0) {
#endif
#else
            if ((*compare)(list1, list2) <= 0) {
#endif
                *plast = list1;
                plast = &(list1->NEXT);
                if ((list1 = list1->NEXT) == 0) {
                    *plast = list2;
                    break;
                }
            } else {
                *plast = list2;
                plast = &(list2->NEXT);
                if ((list2 = list2->NEXT) == 0) {
                    *plast = list1;
                    break;
                }
            }
        }
    }

    return list_in;
}