universe@4: #include "dlist.h"
universe@4: 
universe@18: UcxDlist *ucx_dlist_clone(UcxDlist *l, copy_func fnc, void *data) {
universe@18:     UcxDlist *ret = NULL;
universe@18:     while (l != NULL) {
universe@18:         if (fnc != NULL) {
universe@18:             ret = ucx_dlist_append(ret, fnc(l->data, data));
universe@18:         } else {
universe@18:             ret = ucx_dlist_append(ret, l->data);
universe@18:         }
universe@18:         l = l->next;
universe@18:     }
universe@18:     return ret;
universe@18: }
universe@18: 
universe@18: int ucx_dlist_equals(UcxDlist *l1, UcxDlist *l2, cmp_func fnc, void* data) {
universe@18:     if (l1 == l2) return 1;
universe@18:     
universe@18:     while (l1 != NULL && l2 != NULL) {
universe@18:         if (fnc == NULL) {
universe@18:             if (l1->data != l2->data) return 0;
universe@18:         } else {
universe@18:             if (fnc(l1->data, l2->data, data) != 0) return 0;
universe@18:         }
universe@18:         l1 = l1->next;
universe@18:         l2 = l2->next;
universe@18:     }
universe@18:     
universe@18:     return (l1 == NULL && l2 == NULL);
universe@18: }
universe@18: 
universe@8: void ucx_dlist_free(UcxDlist *l) {
universe@8:     UcxDlist *e = l, *f;
universe@8:     while (e != NULL) {
universe@8:         f = e;
universe@8:         e = e->next;
universe@8:         free(f);
universe@8:     }
universe@8: }
universe@8: 
universe@7: UcxDlist *ucx_dlist_append(UcxDlist *l, void *data)  {
universe@8:     UcxDlist *nl = (UcxDlist*) malloc(sizeof(UcxDlist));
universe@8:     if (nl == NULL) return NULL;
universe@7:     
universe@8:     nl->data = data;
universe@8:     nl->next = NULL;
universe@8:     if (l == NULL) {
universe@22:         nl->prev = NULL;
universe@8:         return nl;
universe@8:     } else {
universe@8:         UcxDlist *t = ucx_dlist_last(l);
universe@8:         t->next = nl;
universe@8:         nl->prev = t;
universe@8:         return l;
universe@8:     }
universe@7: }
universe@7: 
universe@7: UcxDlist *ucx_dlist_prepend(UcxDlist *l, void *data) {
universe@8:     UcxDlist *nl = ucx_dlist_append(NULL, data);
universe@8:     if (nl == NULL) return NULL;
universe@7:     
universe@8:     if (l != NULL) {
universe@8:         nl->next = l;
universe@8:         l->prev = nl;
universe@8:     }
universe@8:     return nl;
universe@7: }
universe@7: 
universe@7: UcxDlist *ucx_dlist_concat(UcxDlist *l1, UcxDlist *l2) {
universe@8:     if (l1 == NULL) {
universe@8:         return l2;
universe@8:     } else {
universe@8:         UcxDlist *last = ucx_dlist_last(l1);
universe@8:         last->next = l2;
universe@8:         l2->prev = last;
universe@8:         return l1;
universe@8:     }
universe@7: }
universe@7: 
universe@7: UcxDlist *ucx_dlist_last(UcxDlist *l) {
universe@7:     if (l == NULL) return NULL;
universe@7:     
universe@7:     UcxDlist *e = l;
universe@7:     while (e->next != NULL) {
universe@7:         e = e->next;
universe@7:     }
universe@7:     return e;
universe@7: }
universe@7: 
universe@7: UcxDlist *ucx_dlist_get(UcxDlist *l, int index) {
universe@8:     if (l == NULL) return NULL;
universe@8: 
universe@8:     UcxDlist *e = l;
universe@8:     while (e->next != NULL && index > 0) {
universe@8:         e = e->next;
universe@8:         index--;
universe@8:     }
universe@7:     
universe@8:     return index == 0 ? e : NULL;
universe@7: }
universe@7: 
universe@7: size_t ucx_dlist_size(UcxDlist *l) {
universe@7:     if (l == NULL) return 0;
universe@7:     
universe@7:     UcxDlist *e = l;
universe@7:     size_t s = 1;
universe@7:     while (e->next != NULL) {
universe@7:         e = e->next;
universe@7:         s++;
universe@7:     }
universe@7: 
universe@7:     return s;
universe@7: }
universe@7: 
universe@37: UcxDlist *ucx_dlist_sort_merge(int length,
universe@37:         UcxDlist* ls, UcxDlist* rs, UcxDlist* le, UcxDlist* re,
universe@37:         cmp_func fnc, void* data) {
universe@37:     UcxDlist *sorted[length];
universe@37:     UcxDlist *rc, *lc;
universe@35: 
universe@37:     lc = ls; rc = rs;
universe@37:     int n = 0;
universe@37:     while (lc != le && rc != re) {
universe@37:         if (fnc(lc->data, rc->data, data) <= 0) {
universe@37:             sorted[n] = lc;
universe@37:             lc = lc->next;
universe@37:         } else {
universe@37:             sorted[n] = rc;
universe@37:             rc = rc->next;
universe@35:         }
universe@37:         n++;
universe@37:     }
universe@37:     while (lc != le) {
universe@37:         sorted[n] = lc;
universe@37:         lc = lc->next;
universe@37:         n++;
universe@37:     }
universe@37:     while (rc != re) {
universe@37:         sorted[n] = rc;
universe@37:         rc = rc->next;
universe@37:         n++;
universe@35:     }
universe@35: 
universe@37:     // Update pointer
universe@37:     sorted[0]->prev = NULL;
universe@37:     for (int i = 0 ; i < length-1 ; i++) {
universe@37:         sorted[i]->next = sorted[i+1];
universe@37:         sorted[i+1]->prev = sorted[i];
universe@37:     }
universe@37:     sorted[length-1]->next = NULL;
universe@35: 
universe@37:     return sorted[0];
universe@35: }
universe@35: 
universe@36: UcxDlist *ucx_dlist_sort(UcxDlist *l, cmp_func fnc, void *data) {
universe@35:     if (l == NULL) {
universe@35:         return NULL;
universe@35:     }
universe@37: 
universe@37:     UcxDlist *lc;
universe@37:     int ln = 1;
universe@37: 
universe@37:     UcxDlist *ls = l, *le;
universe@37:     lc = ls;
universe@37:     while (lc->next != NULL && fnc(lc->next->data, lc->data, data) > 0) {
universe@37:         lc = lc->next;
universe@37:         ln++;
universe@37:     }
universe@37:     le = lc->next;
universe@37: 
universe@37:     UcxDlist *rs = le, *re;
universe@37:     if (rs == NULL) {
universe@37:         return l; // this list is already sorted :)
universe@37:     } else {
universe@37:         UcxDlist *rc;
universe@37:         int rn = 1;
universe@37:         rc = rs;
universe@37:         while (rc->next != NULL && fnc(rc->next->data, rc->data, data) > 0) {
universe@37:             rc = rc->next;
universe@37:             rn++;
universe@37:         }
universe@37:         re = rc->next;
universe@37: 
universe@37:         // Something left? Sort it!
universe@37:         UcxDlist *remainder = re;
universe@37:         size_t remainder_length = ucx_dlist_size(remainder);
universe@37:         if (remainder != NULL) {
universe@37:             remainder = ucx_dlist_sort(remainder, fnc, data);
universe@37:         }
universe@37: 
universe@37:         // {ls,...,le->prev} and {rs,...,re->prev} are sorted - merge them
universe@37:         UcxDlist *sorted = ucx_dlist_sort_merge(ln+rn,
universe@37:                 ls, rs, le, re,
universe@37:                 fnc, data);
universe@37: 
universe@37:         // merge sorted list with (also sorted) remainder
universe@37:         l = ucx_dlist_sort_merge(ln+rn+remainder_length,
universe@37:                 sorted, remainder, NULL, NULL,
universe@37:                 fnc, data);
universe@37: 
universe@35:         return l;
universe@35:     }
universe@35: }
universe@35: 
universe@7: /* dlist specific functions */
universe@7: UcxDlist *ucx_dlist_first(UcxDlist *l) {
universe@8:     if (l == NULL) return NULL;
universe@7:     
universe@8:     UcxDlist *e = l;
universe@8:     while (e->prev != NULL) {
universe@8:         e = e->prev;
universe@8:     }
universe@8:     return e;
olaf@13: }
universe@22: 
universe@22: UcxDlist *ucx_dlist_remove(UcxDlist *l, UcxDlist *e) {
universe@22:     if (e->prev == NULL) {
olaf@31:         if(e->next != NULL) {
olaf@31:             e->next->prev = NULL;
olaf@31:             l = e->next;
olaf@31:         } else {
olaf@31:             l = NULL;
olaf@31:         }
olaf@31:         
universe@22:     } else {
universe@22:         e->prev->next = e->next;
universe@22:         e->next->prev = e->prev;
universe@22:     }
universe@22:     free(e);
universe@22:     return l;
universe@22: }