> This is an implementation of the merge sort algorithm for SLIST in > queue(3).
Sorting is something you do in an algorithm when you need it, specific to that algorithm, exactly where you need it. queue.h is supposed to be a minimal API, general access so that the specifics remain in the code using it. It is supposed to be approachable, not heavy with cross-purposes. I see you did not document it, nor show a specific case where it is absolutely neccessary. That says a lot.
