双链表不起作用

Question

我正在尝试按升序对双向链表进行排序。我一次又一次地通过代码，我找不到它的任何逻辑缺陷，所以我认为问题出在其他地方。当我尝试打印排序列表时，控制台返回0而不打印任何内容（打印功能不应该受到责备，因为它已经过测试）

以下是我正在运行的代码：

typedef struct dados_temp{
    float temp;
    float incerteza;
    char pais[100];
    char cidade[100];
    float angle;
    int hemisferio;
    int dia;
    int mes;
    int ano;
}   dados_temp;

typedef struct Node{
    dados_temp payload;
    struct Node *next;
    struct Node *prev;
}   Node;



//receives the original head pointer
//returns sorted list's head pointer    
Node** SortDate(struct Node** head)
{
    struct Node *i, *j;

    for( i = head; i != NULL; i = i->next )//iterates over the entire list
    {
        //if the data value of the next node is bigger
        if ( i->payload.ano > i->next->payload.ano )
        {
            //swaps the data value between i and i->next
            //SwapNodes was tested and  it is working
            SwapNodes(i, i->next);

            //the current value of i->next (former value of i)
            //is compared to all the previous values
            //and keeps swapping until a smaller value is found
            for (j = i->next; j->payload.ano < j->prev->payload.ano;)
            {
                SwapNodes(j, j->prev);
            }
        }

    }
return head;

}//sort

我知道可能有更简单的方法来对双向链表进行排序，但我想弄清楚为什么这个链表不起作用。

提前谢谢！

编辑： 显示所有涉及的功能：

#include <stdio.h>
#include <stdlib.h>


typedef struct dados_temp{
    float temp;
    float incerteza;
    char pais[100];
    char cidade[100];
    float angle;
    int hemisferio;
    int dia;
    int mes;
    int ano;
}   dados_temp;

typedef struct Node{
    dados_temp payload;
    struct Node *next;
    struct Node *prev;
}   Node;


Node * CreateCitiesList();
Node * CreateCountriesList();
Node * Intervalos(struct Node*, int[]);
void PrintBack(struct Node*);

struct Node* CreateNode (dados_temp x)
{
    struct Node* NewNode = (struct Node*)malloc(sizeof(struct Node));

    NewNode->payload = x;
    NewNode->next = NULL;
    NewNode->prev = NULL;

    return NewNode;
}

}


void Print (struct Node* head)
{
    struct Node* temp = head;

    while ( temp != NULL)
    {
        printf("%d-%d-%d \n", temp->payload.ano, temp->payload.mes, 
               temp>payload.dia);
        fflush(stdout);
        temp = temp->next;
    }
    printf("\n");
}

Node* SortDate (struct Node*);

void SwapNodes (struct Node*, struct Node*);

int main(int argc, char* argv[])
{
    CreateCountriesList();
}


Node* CreateCountriesList()
{
    char linha[150] = {NULL};
    char cabecalho[100] = {NULL};
    int i = 0;
    dados_temp New_Entry;
    dados_temp tail;
    int *ptr_head_co;

    struct Node* head_countries = NULL;
    struct Node* Node = NULL;

    FILE *inputf;
    inputf = fopen("tempcountries_all.csv", "r");

    if (inputf == NULL)
    {
        printf("Nao da pa abrir o fitchas boi");
        exit(EXIT_FAILURE);
    }
    //gets rid of the first line
    fgets(cabecalho, 100, inputf);

    for (i = 0; i <  577462 ; i++)
    {
        fgets(linha, 150, inputf);

        //scans the date(amongst other things) from file (yyyy-mm-dd)    
        sscanf(linha, "%d-%d-%d,%f,%f,%[^,]s", &New_Entry.ano, 
            &New_Entry.mes,&New_Entry.dia, &New_Entry.temp, &New_Entry.incerteza,  
            &New_Entry.pais);

        if (head_countries == NULL)
        {
            head_countries = CreateNode(New_Entry);
            Node = CreateNode(New_Entry);
        }
        else
        {
            head_countries = InsertHead(head_countries, New_Entry);
        }
    }

    fclose(inputf);
    head_countries = RemoveNodes(Node);

    SortDate(head_countries);

    Print(head_countries);

    return head_countries;
}

Node* SortDate(struct Node* head)
{
    struct Node *i, *j;

    for( i = head; i != NULL; i = i->next )
    {
        if ( i->payload.ano > i->next->payload.ano )
        {
            SwapNodes(i, i->next);

            for (j = i->next; j->payload.ano < j->prev->payload.ano;)
            {
                SwapNodes(j, j->prev);
            }
        }
    }
}//sort


void SwapNodes(struct Node* node1, struct Node* node2)
{
    dados_temp temp = node1->payload;
    node1->payload = node2->payload;
    node2->payload = temp;
}