如何用copendir实现Linux目录的递归遍历

#include <stdio.h>
#include <stdlib.h>
#include <dirent.h>
#include <string.h>
#include <sys/stat.h>

void traversedirectory(const char *path) {
    dir *dir;
    struct dirent *entry;
    struct stat path_stat;

    // 打开目录
    dir = opendir(path);
    if (dir == null) {
        perror("opendir");
        return;
    }

    // 遍历目录条目
    while ((entry = readdir(dir)) != null) {
        // 跳过"."和".."
        if (strcmp(entry->d_name, ".") == 0 || strcmp(entry->d_name, "..") == 0) continue;

        // 构建完整路径
        char fullpath[path_max];
        snprintf(fullpath, sizeof(fullpath), "%s/%s", path, entry->d_name);

        // 获取文件/目录信息
        if (stat(fullpath, &path_stat) == -1) {
            perror("stat");
            continue;
        }

        // 递归处理子目录
        if (s_isdir(path_stat.st_mode)) {
            printf("目录: %s\n", fullpath);
            traversedirectory(fullpath);
        } else {
            // 打印文件
            printf("文件: %s\n", fullpath);
        }
    }

    // 关闭目录
    closedir(dir);
}

int main(int argc, char *argv[]) {
    if (argc != 2) {
        fprintf(stderr, "用法: %s <目录路径>\n", argv[0]);
        return exit_failure;
    }

    traversedirectory(argv[1]);
    return exit_success;
}

gcc -o recursive_traversal recursive_traversal.c
./recursive_traversal /path/to/your/directory