838 right = j; |
838 right = j; |
839 } else { |
839 } else { |
840 left = j; |
840 left = j; |
841 right = i; |
841 right = i; |
842 } |
842 } |
843 cx_linked_list_node *nleft, *nright; |
843 cx_linked_list_node *nleft = NULL, *nright = NULL; |
844 if (left < mid && right < mid) { |
844 if (left < mid && right < mid) { |
845 // case 1: both items left from mid |
845 // case 1: both items left from mid |
846 nleft = cx_ll_node_at(ll, left); |
846 nleft = cx_ll_node_at(ll, left); |
847 assert(nleft != NULL); |
847 assert(nleft != NULL); |
848 nright = nleft; |
848 nright = nleft; |