簡體   English   中英

執行期間出現分段錯誤

[英]getting segmentation fault during execution

我正在嘗試為特定目錄制作樹形結構。 目錄的路徑由用戶輸入,並傳遞給opendir func。 readdir func讀取當前目錄,並遞歸讀取子目錄。 我無法調試該程序。

#include<stdio.h>
#include<dirent.h>
#include<string.h>
#include<malloc.h>
#include<sys/stat.h>
#include<limits.h> 
#include<stdlib.h>
#define _GNU_SOURCE
struct tree{
    char dname[100];
    char fname[200];
    int i;
    struct tree *openf[100];

};

void getinto(char [],char [],struct tree*);
struct dirent *dpointer;
int found=0;
int k=0;

_Bool is_dir(const char* path) {
    struct stat buf;
    stat(path, &buf);
    return S_ISDIR(buf.st_mode);
}

int main() {
char path[100]=".";
DIR *dr;
struct tree *rootnode;
rootnode=(struct tree*)malloc(sizeof(struct tree));
printf("enter path :: ");
scanf("%s",path);
//printf("helllo\n");
rootnode->i=0;
dr=opendir(path);
//printf("helllo\n");
strcpy(rootnode->dname,path);
if((dpointer=readdir(dr))==NULL){
    printf("current directory is empty !!");


}
while ((dpointer=readdir(dr))!=NULL){
    struct tree *rootchild;
    rootchild=(struct tree*)malloc(sizeof(struct tree));
    rootnode->openf[rootnode->i++]=rootchild;
    if (strcmp(dpointer->d_name,"..")==0 || strcmp(dpointer->d_name,".")==0 ) 
    continue;
    //printf("helllo\n");
    if(is_dir(dpointer->d_name)){
        printf("%s is directory \n",dpointer->d_name);
        getinto(dpointer->d_name,path,rootchild);
        //printf("helllo loop\n");
        printf("%s is directory \n",dpointer->d_name);

    }
    else{
        strcpy(rootchild->dname,dpointer->d_name);
        //printf("helllo loop\n");
        printf("%s is file \n",dpointer->d_name);
    }
}
closedir(dr);
return 0;
}

void getinto(char sfilename[],char spath[],struct tree* this){
char filename[100],currentpath[100],temp[100];
DIR *d=opendir(currentpath);
strcpy(filename,sfilename);
strcpy(currentpath,spath);
strcat(currentpath,"/");
strcat(currentpath,filename);
printf("helllo function\n");
d=opendir(currentpath);
//printf("helllo function\n");
this->i=0;
while((dpointer=readdir(d))!=NULL){
    struct tree *child;
    child=(struct tree*)malloc(sizeof(struct tree));
    this->openf[this->i++]=child;
    if (strcmp(dpointer->d_name,"..")==0 || strcmp(dpointer->d_name,".")==0 ) 
    continue;
    //printf("helllo function loop\n");
    if(is_dir(dpointer->d_name)){
        printf("%s is directory \n",dpointer->d_name);
        getinto(dpointer->d_name,currentpath,child);
        //printf("helllo loop\n");
        printf("%s is directory \n",dpointer->d_name);

    }
    else{
        strcpy(child->dname,dpointer->d_name);
        //printf("helllo loop\n");
        printf("%s is file \n",dpointer->d_name);
    }
}
closedir(d);

}

每次執行時,都會出現分段錯誤:分段錯誤(核心已轉儲)

我期望它可以干凈地創建一個動態樹,並將每個節點的數據作為文件或目錄的名稱。

_Bool is_dir(const char* path) {
    struct stat buf;
    stat(path, &buf);
    return S_ISDIR(buf.st_mode);
}

stat需要使用char*類型的路徑名。

句法:

int stat(const char *pathname, struct stat *statbuf);

但是你過去了

if(is_dir((const char*)dr))

DIR類型的dr

只需如下更改is_dir調用即可。

is_dir(dpointer->d_name) //in main as well as in getinto function

同樣, readdir將返回以下條目:

.   //current dir
..  //parent dir

因此,您需要跳過main這兩個條目,否則getinfoopendir將失敗,從而導致getinfo崩潰時的readdir

因此,如下跳過main這些條目。

while ((dpointer=readdir(dr))!=NULL){
    if (strcmp(dpointer->d_name,"..")==0 || strcmp(dpointer->d_name,".")==0 ) 
    continue;
   .....
   .....
  }

這段代碼最終對我來說非常完美'

#include<stdio.h>
#include<dirent.h>
#include<string.h>
#include<malloc.h>
#include<sys/stat.h>
#include<limits.h> 
#include<stdlib.h>
#define _GNU_SOURCE
struct tree{
    char dname[1000];
    char fname[2000];
    int i;
    struct tree *openf[1000];

};

void getinto(char [],char [],struct tree*);
struct dirent *dpointer;
int found=0;
int k=0;

_Bool is_dir(const char* path) {
    struct stat buf;
    stat(path, &buf);
    return S_ISDIR(buf.st_mode);
}

int main() {
char path[1000]=".";
DIR *dr;
struct tree *rootnode;
rootnode=(struct tree*)malloc(sizeof(struct tree));
printf("enter path :: ");
scanf("%s",path);
//printf("helllo\n");
rootnode->i=0;
dr=opendir(path);
//printf("helllo\n");
strcpy(rootnode->dname,path);
if((dpointer=readdir(dr))==NULL){
    printf("current directory is empty !!");


}
while ((dpointer=readdir(dr))!=NULL){
    struct tree *rootchild;
    rootchild=(struct tree*)malloc(sizeof(struct tree));
    rootnode->openf[rootnode->i++]=rootchild;
    if (strcmp(dpointer->d_name,"..")==0 || strcmp(dpointer->d_name,".")==0 ) 
    continue;
    //printf("helllo\n");
    if(is_dir(dpointer->d_name)){
        printf("%s is directory \n",dpointer->d_name);
        getinto(dpointer->d_name,path,rootchild);
        //printf("helllo loop\n");
        //printf("%s is directory \n",dpointer->d_name);

    }
    else{
        strcpy(rootchild->dname,dpointer->d_name);
        //printf("helllo loop\n");
        printf("%s is file \n",dpointer->d_name);
    }
}
closedir(dr);
return 0;
}

void getinto(char sfilename[],char spath[],struct tree* this){
char filename[1000],currentpath[1000],temp[1000];
DIR *d=opendir(currentpath);
strcpy(filename,sfilename);
strcpy(currentpath,spath);
strcat(currentpath,"/");
strcat(currentpath,filename);
printf("%s",currentpath);
printf("\nhelllo function\n");
d=opendir(currentpath);
//printf("helllo function\n");
this->i=0;
while((dpointer=readdir(d))!=NULL){
    struct tree *child;
    child=(struct tree*)malloc(sizeof(struct tree));
    this->openf[this->i++]=child;
     if (strcmp(dpointer->d_name,"..")==0 || strcmp(dpointer->d_name,".")==0 ) 
     continue;
    //printf("helllo function loop\n");
    if(is_dir(dpointer->d_name)){
        printf("%s is directory \n",dpointer->d_name);
        //getinto(dpointer->d_name,currentpath,child);
        //printf("helllo loop\n");
        printf("%s is directory \n",dpointer->d_name);

    }
    else{
        strcpy(child->dname,dpointer->d_name);
        //printf("helllo loop\n");
        printf("%s is file \n",dpointer->d_name);
    }
}
printf("\niits over!!");
closedir(d);
return ;

}

謝謝大家的幫助!

暫無
暫無

聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.

 
粵ICP備18138465號  © 2020-2024 STACKOOM.COM