不带表头节点的冒泡排序算法

 InStream_linklist InStream_BubbleSort(InStream_linklist lhead){
   InStream_linklist q,tail,p=(InStream_linklist)malloc(sizeof(InStreaLNode));;
    p->next = lhead;
    lhead = p;
    tail = NULL;
    while(tail != lhead->next){ 
        p = lhead;
        q = p->next;
        while(tail != q->next){
            if((p->next->dstport> q->next->dstport)&&(p->next->moduleId==q->next->moduleId)){
                p->next = q->next;
                q->next = q->next->next;
                p->next->next = q;
            }/*fi*/
            p = p->next;
            q = p->next;
        }/*while in*/
        tail = q;
    }/*while out*/
    p = lhead->next;
    free(lhead);
    return p;
}