2012-07-08 100 views
1

这只是一个粗略的代码,所以目前还没有免费的。 我只是想弄清楚它搞乱了我的链表。链接列表不打印/在C中正确添加

以下功能的目的是接受这样的:

add 1 2 

add 1 "some quote" maybe more stuff 

,并与元素链表.. 在第一种情况:

[add]->[1]->[2] 

第二种情况:

[add]->[1]->["some quote" maybe more stuff] 

我知道它实际上是在做这些步骤,因为'count/total'在输出中是正确的。但是,当我尝试迭代链表时,它只打印第一个元素。

typedef struct command{ 
    char* args; 
    struct command *next; 
}command; 
typedef struct commands_list{ 
    command *head; /*Start of the queue*/ 
    int total; /*Total commands passed*/ 
}commands_list; 

commands_list* process_command(char *command){ 
    char curr_char;     /*Keeps track of current character*/ 
    int start_pos; 
    int i; 
    int len;  

    /*Length of user input*/ 
    int quote=0; 
    int empty =1; 
    commands_list *commands; 
    struct command *conductor; 

    len = strlen(command);    /*Calculate length*/  
    /*Initialize the List*/ 
    commands=malloc(sizeof(commands_list));   /*Allocate memory for the linked list*/ 
    commands->head = malloc(sizeof(struct command)); 
    conductor = commands->head; 

    for(i=0,start_pos=0;i<strlen(command);i++){ 
     curr_char = command[i]; 
     if (empty==0){ 
      conductor = malloc(sizeof(struct command)); 
     } 
     if (curr_char == ' '){  /*If there was a space found copy the stuff before the space*/ 
      if (i>0 && command[i-1]==' ') { 
       start_pos++; 
       continue; 
      } 
      conductor->args = malloc(i-start_pos+1*(sizeof(char))); /*Allocate memory for the word to be copied*/ 
      strncpy(conductor->args,command+start_pos,i-start_pos); /*Copy the word/command to the memory allocated*/ 
      conductor->args[i-start_pos+1]='\0';   /*Add null terminator at end*/ 
      commands->total++;    /*Increase total # of commands*/ 
      conductor=conductor->next;   /*Conductor points to the first element now*/ 
      start_pos =i+1; 
      if (empty==1){ 
       empty=0; 
      } 
     } 
     else if (curr_char == '\"'){  /*If a quote was found, copy the rest of the string and exit loop*/ 
      conductor->args = malloc(len-i+1*(sizeof(char))); 
      strncpy(conductor->args,command+i,len-i); 
      conductor->args[len-i+1]='\0'; 
      conductor->next=NULL; 
      commands->total++; 
      quote=1; 
      //empty_queue = 0; 
      conductor = conductor->next; 
      if (empty==1){ 
       empty=0; 
      } 
      break; 
     } 
    } 
    if (quote==0){     /*If there was no quote in the string, get the last element*/ 
     if (empty==0){ 
      conductor = malloc(sizeof(struct command)); 
     } 
     conductor->args = malloc(len-start_pos+1*(sizeof (char))); 
     strncpy(conductor->args,command+start_pos,len-start_pos); 
     conductor->args[len-start_pos+1]='\0'; 
     conductor->next=NULL; 
     commands->total++; 
    } /*Finish find quote*/ 
    printf("%d commands found\n",commands->total); 
    //free(conductor); 
    return commands;  
} 

而且我是用打印链表的临时方法:

int print_list(commands_list **headNode){ 
    commands_list *top = *headNode; 
    struct command *temp = top->head;   /*Temporary variable for command*/ 
    while(temp!=NULL){ 
     printf("I was here to print: [%s]\n",temp->args); 
     temp = temp->next; 
    } 
    printf("It was all null\n"); 

    free(temp); 
} 

感谢

回答

1

代码中有许多问题使得它很难调试。

主要问题是如何将结构命令*添加到列表的末尾。该行

 conductor=conductor->next; 

将只是指定NULL(或任何malloc做)。你永远不会分配指挥 - >旁边的任何东西。

当你malloc一个新的struct命令*时,你需要更新旧的conductor-> next到新分配的元素。因此,而不是:

 conductor = malloc(sizeof(struct command)); 

你需要的东西,如:

 struct command *tmp = malloc(sizeof(struct command)); 
     conductor->next = tmp; 
     conductor = tmp; 

此外,它可以帮助你调试,如果你增加了行 举办商> ARGS = “未分配尚未#1” ;上面最后一行之后的 。这是严重的,不应该出现在生产代码中,但会帮助你调试你的问题。

1

如果只打印的第一要素,必须得出这样的结论的的next成员第一个元素是NULL; conductor被分配为conductor->next,但conductor->next本身从不被分配NULL以外的任何内容。

添加到最后时,必须为当前结尾的next成员分配新项目的地址。似乎并没有发生这种情况。

我强烈建议您使用符号调试器来分析此代码。它将允许您在监视变量状态的同时遍历每一行。