blob: 074354381d0d30b9637042b9caa73532f33cd347 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
#include <stdio.h>
#include <stdlib.h>
#include <dirent.h>
#include <sys/stat.h>
#include <string.h>
#include "list.h"
void add_file_path(Node **head, char *file_path) {
Node *new = (Node *)malloc(sizeof(Node));
new->file_path = strdup(file_path);
new->next = *head;
*head = new;
}
void list_files_recursively(char *base_path, Node **head) {
char path[1000];
struct dirent *dp;
DIR *dir = opendir(base_path);
if (!dir) return;
while ((dp = readdir(dir)) != NULL) {
if (strcmp(dp->d_name, ".") != 0 && strcmp(dp->d_name, "..") != 0) {
strcpy(path, base_path);
strcat(path, "/");
strcat(path, dp->d_name);
struct stat statbuf;
if (stat(path, &statbuf) != -1) {
if (S_ISDIR(statbuf.st_mode)) {
list_files_recursively(path, head);
} else {
add_file_path(head, path);
}
}
}
}
closedir(dir);
}
void free_file_list(Node *head) {
Node *tmp;
while (head != NULL) {
tmp = head;
head = head->next;
free(tmp->file_path);
free(tmp);
}
}
int size_of_file_list(Node *head) {
int count = 0;
Node *current = head;
while (current != NULL) {
count++;
current = current->next;
}
return count;
}
|
