用callback增强链表模块来实现命令行菜单小程序V2.8

来源：互联网发布：吉首大学网络授课编辑：程序博客网时间：2024/05/22 12:06

【网易云课堂昵称：JaYiFen+ 《软件工程（C编码实践篇）》MOOC课程作业http://mooc.study.163.com/course/USTC-1000002006 】

实验五：用callback增强链表模块来实现命令行菜单小程序V2.8

新创建一个目录lab5完成实验。

然后将lab5-1.tar.gz中的代码（即解压后lab5.1/目录下的源文件）直接放到lab5/目录下继续完成后面的实验内容

实验要求（参照视频中的具体实验过程）

本实验在提供的代码基础上进行

给lab5-1.tar.gz找bug，quit命令无法运行的bug
利用callback函数参数使Linktable的查询接口更加通用
注意接口的信息隐藏

实验步骤：

1.找出quit错误的bug；
在调试运行代码的时候，前面的指令是没有出错的，加之此为一个顺序链表，可以大致推测出应该是链表的结尾判断出出了错误；如图：

2.修改代码使之符合要求：

将cmd指令设为全局变量，更改函数的接口，隐藏信息等操作，下面直接上代码，故不一一指出。

3.测试运行

4.提交代码

实验代码

1.menu.c

/**************************************************************************************************//* Copyright (C) mc2lab.com, SSE@USTC, 2014-2015                                                  *//*                                                                                                *//*  FILE NAME             :  menu.c                                                               *//*  PRINCIPAL AUTHOR      :  Mengning                                                             *//*  SUBSYSTEM NAME        :  menu                                                                 *//*  MODULE NAME           :  menu                                                                 *//*  LANGUAGE              :  C                                                                    *//*  TARGET ENVIRONMENT    :  ANY                                                                  *//*  DATE OF FIRST RELEASE :  2014/08/31                                                           *//*  DESCRIPTION           :  This is a menu program                                               *//**************************************************************************************************//* * Revision log: * * Created by Mengning, 2014/08/31 * */#include <stdio.h>#include <stdlib.h>#include "linktable.h"int Help();int Quit();#define CMD_MAX_LEN 128#define DESC_LEN    1024#define CMD_NUM     10char cmd[CMD_MAX_LEN];/* data struct and its operations */typedef struct DataNode{    tLinkTableNode * pNext;    char*   cmd;    char*   desc;    int     (*handler)();} tDataNode;int SearchCondition(tLinkTableNode * pLinkTableNode,void *args){char *cmd=(char*)args;    tDataNode * pNode = (tDataNode *)pLinkTableNode;    if(strcmp(pNode->cmd, cmd) == 0)    {        return  SUCCESS;      }    return FAILURE;       }/* find a cmd in the linklist and return the datanode pointer */tDataNode* FindCmd(tLinkTable * head, char * cmd){    return  (tDataNode*)SearchLinkTableNode(head,SearchCondition,(void*)cmd);}/* show all cmd in listlist */int ShowAllCmd(tLinkTable * head){    tDataNode * pNode = (tDataNode*)GetLinkTableHead(head);    while(pNode != NULL)    {        printf("%s - %s\n", pNode->cmd, pNode->desc);        pNode = (tDataNode*)GetNextLinkTableNode(head,(tLinkTableNode *)pNode);    }    return 0;}int InitMenuData(tLinkTable ** ppLinktable){    *ppLinktable = CreateLinkTable();    tDataNode* pNode = (tDataNode*)malloc(sizeof(tDataNode));    pNode->cmd = "help";    pNode->desc = "Menu List:";    pNode->handler = Help;    AddLinkTableNode(*ppLinktable,(tLinkTableNode *)pNode);    pNode = (tDataNode*)malloc(sizeof(tDataNode));    pNode->cmd = "version";    pNode->desc = "Menu Program V1.0";    pNode->handler = NULL;     AddLinkTableNode(*ppLinktable,(tLinkTableNode *)pNode);    pNode = (tDataNode*)malloc(sizeof(tDataNode));    pNode->cmd = "quit";    pNode->desc = "Quit from Menu Program V1.0";    pNode->handler = Quit;     AddLinkTableNode(*ppLinktable,(tLinkTableNode *)pNode);     return 0; }/* menu program */tLinkTable * head = NULL;int main(){    InitMenuData(&head);    /* cmd line begins */    while(1)    {        printf("Input a cmd number > ");        scanf("%s", cmd);        tDataNode *p = FindCmd(head, cmd);        if( p == NULL)        {            printf("This is a wrong cmd!\n ");            continue;        }        printf("%s - %s\n", p->cmd, p->desc);         if(p->handler != NULL)         {             p->handler();        }       }}int Help(){    ShowAllCmd(head);    return 0; }int Quit(){    exit(0);}

2.linktable.h

/********************************************************************//* Copyright (C) SSE-USTC, 2012-2013                                *//*                                                                  *//*  FILE NAME             :  linktabe.h                             *//*  PRINCIPAL AUTHOR      :  Mengning                               *//*  SUBSYSTEM NAME        :  LinkTable                              *//*  MODULE NAME           :  LinkTable                              *//*  LANGUAGE              :  C                                      *//*  TARGET ENVIRONMENT    :  ANY                                    *//*  DATE OF FIRST RELEASE :  2012/12/30                             *//*  DESCRIPTION           :  interface of Link Table                *//********************************************************************//* * Revision log: * * Created by Mengning,2012/12/30 * */#ifndef _LINK_TABLE_H_#define _LINK_TABLE_H_#include <pthread.h>#define SUCCESS 0#define FAILURE (-1)/* * LinkTable Node Type */typedef struct LinkTableNode{    struct LinkTableNode * pNext;}tLinkTableNode;/* * LinkTable Type */typedef struct LinkTable tLinkTable;/* * Create a LinkTable */tLinkTable * CreateLinkTable();/* * Delete a LinkTable */int DeleteLinkTable(tLinkTable *pLinkTable);/* * Add a LinkTableNode to LinkTable */int AddLinkTableNode(tLinkTable *pLinkTable,tLinkTableNode * pNode);/* * Delete a LinkTableNode from LinkTable */int DelLinkTableNode(tLinkTable *pLinkTable,tLinkTableNode * pNode);/* * Search a LinkTableNode from LinkTable * int Conditon(tLinkTableNode * pNode); */tLinkTableNode * SearchLinkTableNode(tLinkTable *pLinkTable, int Conditon(tLinkTableNode * pNode,void *args),void *args);/* * get LinkTableHead */tLinkTableNode * GetLinkTableHead(tLinkTable *pLinkTable);/* * get next LinkTableNode */tLinkTableNode * GetNextLinkTableNode(tLinkTable *pLinkTable,tLinkTableNode * pNode);#endif /* _LINK_TABLE_H_ */

3.linktable.c

/********************************************************************//* Copyright (C) SSE-USTC, 2012-2013                                *//*                                                                  *//*  FILE NAME             :  linktabe.c                             *//*  PRINCIPAL AUTHOR      :  Mengning                               *//*  SUBSYSTEM NAME        :  LinkTable                              *//*  MODULE NAME           :  LinkTable                              *//*  LANGUAGE              :  C                                      *//*  TARGET ENVIRONMENT    :  ANY                                    *//*  DATE OF FIRST RELEASE :  2012/12/30                             *//*  DESCRIPTION           :  interface of Link Table                *//********************************************************************//* * Revision log: * * Created by Mengning,2012/12/30 * Provide right Callback interface by Mengning,2012/09/17 * */#include<stdio.h>#include<stdlib.h>#include"linktable.h"/* * Create a LinkTable */struct LinkTable{    tLinkTableNode *pHead;    tLinkTableNode *pTail;    intSumOfNode;    pthread_mutex_t mutex;};tLinkTable * CreateLinkTable(){    tLinkTable * pLinkTable = (tLinkTable *)malloc(sizeof(tLinkTable));    if(pLinkTable == NULL)    {        return NULL;    }    pLinkTable->pHead = NULL;    pLinkTable->pTail = NULL;    pLinkTable->SumOfNode = 0;    pthread_mutex_init(&(pLinkTable->mutex), NULL);    return pLinkTable;}/* * Delete a LinkTable */int DeleteLinkTable(tLinkTable *pLinkTable){    if(pLinkTable == NULL)    {        return FAILURE;    }    while(pLinkTable->pHead != NULL)    {        tLinkTableNode * p = pLinkTable->pHead;        pthread_mutex_lock(&(pLinkTable->mutex));        pLinkTable->pHead = pLinkTable->pHead->pNext;        pLinkTable->SumOfNode -= 1 ;        pthread_mutex_unlock(&(pLinkTable->mutex));        free(p);    }    pLinkTable->pHead = NULL;    pLinkTable->pTail = NULL;    pLinkTable->SumOfNode = 0;    pthread_mutex_destroy(&(pLinkTable->mutex));    free(pLinkTable);    return SUCCESS;}/* * Add a LinkTableNode to LinkTable */int AddLinkTableNode(tLinkTable *pLinkTable,tLinkTableNode * pNode){    if(pLinkTable == NULL || pNode == NULL)    {        return FAILURE;    }    pNode->pNext = NULL;    pthread_mutex_lock(&(pLinkTable->mutex));    if(pLinkTable->pHead == NULL)    {        pLinkTable->pHead = pNode;    }    if(pLinkTable->pTail == NULL)    {        pLinkTable->pTail = pNode;    }    else    {        pLinkTable->pTail->pNext = pNode;        pLinkTable->pTail = pNode;    }    pLinkTable->SumOfNode += 1 ;    pthread_mutex_unlock(&(pLinkTable->mutex));    return SUCCESS;}/* * Delete a LinkTableNode from LinkTable */int DelLinkTableNode(tLinkTable *pLinkTable,tLinkTableNode * pNode){    if(pLinkTable == NULL || pNode == NULL)    {        return FAILURE;    }    pthread_mutex_lock(&(pLinkTable->mutex));    if(pLinkTable->pHead == pNode)    {        pLinkTable->pHead = pLinkTable->pHead->pNext;        pLinkTable->SumOfNode -= 1 ;        if(pLinkTable->SumOfNode == 0)        {            pLinkTable->pTail = NULL;        }        pthread_mutex_unlock(&(pLinkTable->mutex));        return SUCCESS;    }    tLinkTableNode * pTempNode = pLinkTable->pHead;    while(pTempNode != NULL)    {            if(pTempNode->pNext == pNode)        {            pTempNode->pNext = pTempNode->pNext->pNext;            pLinkTable->SumOfNode -= 1 ;            if(pLinkTable->SumOfNode == 0)            {                pLinkTable->pTail = NULL;            }            pthread_mutex_unlock(&(pLinkTable->mutex));            return SUCCESS;            }        pTempNode = pTempNode->pNext;    }    pthread_mutex_unlock(&(pLinkTable->mutex));    return FAILURE;}/* * Search a LinkTableNode from LinkTable * int Conditon(tLinkTableNode * pNode); */tLinkTableNode * SearchLinkTableNode(tLinkTable *pLinkTable, int Conditon(tLinkTableNode * pNode,void *args),void *args){    if(pLinkTable == NULL || Conditon == NULL)    {        return NULL;    }    tLinkTableNode * pNode = pLinkTable->pHead;    while(pNode)    {            if(Conditon(pNode,args) == SUCCESS)        {            return pNode;            }        pNode = pNode->pNext;    }    return NULL;}/* * get LinkTableHead */tLinkTableNode * GetLinkTableHead(tLinkTable *pLinkTable){    if(pLinkTable == NULL)    {        return NULL;    }        return pLinkTable->pHead;}/* * get next LinkTableNode */tLinkTableNode * GetNextLinkTableNode(tLinkTable *pLinkTable,tLinkTableNode * pNode){    if(pLinkTable == NULL || pNode == NULL)    {        return NULL;    }    tLinkTableNode * pTempNode = pLinkTable->pHead;    while(pTempNode != NULL)    {            if(pTempNode == pNode)        {            return pTempNode->pNext;            }        pTempNode = pTempNode->pNext;    }    return NULL;}


GitHub 地址：点击

如有疑问错误，欢迎讨论！

阅读全文

0 0