#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include <dirent.h>
struct Node
{
char path_name[1024];
struct Node *next;
struct Node *pre;
};
struct ListHead
{
struct Node *first;
struct Node *last;
int num;
};
//创建一个带头节点单链表
struct ListHead* create_list_head(void)
{
struct ListHead *listhead = malloc(sizeof(struct ListHead));
listhead->first = listhead->last = NULL;
listhead->num = 0;
return listhead;
}
//增加一个节点
struct ListHead* add_one_node(struct ListHead* listhead,char* path)
{
struct Node* pnew = malloc(sizeof(struct Node));
pnew->next = pnew->pre = NULL;
strncpy(pnew->path_name,path,strlen(path));
if (listhead->first == NULL)
{
listhead->first = pnew;
listhead->last = pnew;
listhead->first->pre = listhead->last->pre = NULL;
}
else //尾插
{
listhead->last->next = pnew;
pnew->pre = listhead->last;
listhead->last = pnew;
}
listhead->num++;
return listhead;
}
//打印一条带头节点单链表
void printf_list_head(struct ListHead* list)
{
if(list == NULL || list->first == NULL)
{
printf("this is empty list\n");
return;
}
struct Node* p = list->first;
int times = list->num;
while(times--)
{
printf("%s \n",p->path_name);
p = p->next;
}
printf(" 链表中节点数量 %d\n",list->num);
}
//释放内存
void free_lish(struct ListHead* list)
{
if(list == NULL)
{
return;
}
struct Node* p = list->first;
while(list->first)
{
p = list->first;
list->first = list->first->next;
p->next = NULL;
free(p);
}
free(list);
}
// 遍历目录A的子文件
struct ListHead* traver_dir(char* dirnameA,struct ListHead* list1)
{
//打开目录
DIR* d = opendir(dirnameA);
if (d == NULL)
{
perror(" open dirname A error");
return NULL;
}
while(1)
{
struct dirent* p = readdir(d); //读取目录项
if(p == NULL)
{
break;
}
//判断目录项中文件是否是 . .. 如果是便要跳过
if(strcmp(".",p->d_name) == 0 || strcmp("..",p->d_name) == 0)
{
continue;
}
//不是. .. 要进一步处理 判断是目录还是文件
struct stat statbuf;
//因为进程的工作路劲的问题,只能直接访问当前目录下的文件
char cbuf[512] = {0};
strcpy(cbuf,dirnameA);
cbuf[strlen(cbuf)] = '/';
strncat(cbuf, p->d_name,strlen(p->d_name));
stat(cbuf,&statbuf); //这个文件所在的路径 dirnameA => dirnameA/p->d_name
//截取后缀
int need = strlen(cbuf) - 2; //.c .cpp
if(strcmp(".c",cbuf + need) == 0)
{
list1 = add_one_node(list1,cbuf);
}
if(strcmp(".cpp",cbuf + need -2) == 0)
{
list1 = add_one_node(list1,cbuf);
}
if(strcmp(".h",cbuf + need) == 0)
{
list1 = add_one_node(list1,cbuf);
}
if( S_ISDIR(statbuf.st_mode)) //如果是目录则要递归
{
traver_dir(cbuf, list1);
}
}
closedir(d); //关闭目录
return list1;
}
//寻找目标接口程序
struct ListHead* find_dir(char* dirnameA)
{
if(dirnameA == NULL)
{
perror("dirnameA error");
return NULL;
}
struct ListHead* list1;
list1 = create_list_head();
list1 = traver_dir(dirnameA, list1);
return list1;
}
void goto_target_road(struct ListHead* list1,char* target)
{
if (list1 == NULL || list1->first == NULL )
{
printf("list is empty\n");
return;
}
struct Node* p = list1->first;
int number = 0;
while(p)
{
char command[2048] = {0};
char command2[2048] = {0};
if ( strstr(p->path_name,target) != NULL) //判断是否是子集
{
printf("find target road is\n");
sprintf(command,"%s",p->path_name);
strncpy(command2,command,strlen(command)-(strlen(target)+1));
printf("%s\n",command2);
//scanf("%d",&number);
/* //下面代码只能使程序指针改变所在目录 终端位置不会改变
if ( number == 1 )
{
number = chdir(command2);
system("pwd");
printf("number = %d\n",number);
}*/
}
p = p->next;
}
}
int main(int argc, char* argv[])
{
if(argc < 3)
{
printf(" ./a.out road target\n");
exit(EXIT_FAILURE);
}
system("date");
struct ListHead* list1 = find_dir(argv[1]);
//printf_list_head(list1);//打印链表信息
goto_target_road(list1,argv[2]);
free_lish(list1);
system("date");
return 0;
}