789                 winner_ll_node* newnode = malloc(sizeof(winner_ll_node));  in insertWinner()  local
790                 if(newnode == NULL) {  in insertWinner()
793                 newnode->res = cur_node->res;  in insertWinner()
795                 newnode->next = cur_node->next;  in insertWinner()
796                 cur_node->next = newnode;  in insertWinner()
816             winner_ll_node* newnode = malloc(sizeof(winner_ll_node));  in insertWinner()  local
817             if(newnode == NULL) {  in insertWinner()
820             newnode->res = w;  in insertWinner()
821             newnode->next = NULL;  in insertWinner()
822             cur_node->next = newnode;  in insertWinner()
827             winner_ll_node* newnode = malloc(sizeof(winner_ll_node));  in insertWinner()  local
828             if(newnode == NULL) {  in insertWinner()
831             newnode->res = cur_node->res;  in insertWinner()
833             newnode->next = cur_node->next;  in insertWinner()
834             cur_node->next = newnode;  in insertWinner()