-
Notifications
You must be signed in to change notification settings - Fork 0
/
list_disk.c
225 lines (179 loc) · 3.92 KB
/
list_disk.c
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <fcntl.h>
#include <errno.h>
#include <dirent.h>
#include <linux/fs.h>
#include <sys/ioctl.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/queue.h>
struct blkdev_disk {
LIST_ENTRY(blkdev_disk) node;
char *name;
int maj;
int min;
unsigned long long size;
};
struct blkdev_part {
LIST_ENTRY(blkdev_part) node;
char *disk_name;
char *part_name;
int maj;
int min;
};
LIST_HEAD(disk_list, blkdev_disk);
LIST_HEAD(part_list, blkdev_part);
static struct disk_list d_list = LIST_HEAD_INITIALIZER(d_list);
static struct part_list p_list = LIST_HEAD_INITIALIZER(p_list);
static const char * PATH_SYS_BLOCK = "/sys/block";
int add_partition(const char *disk_name, const char *part_name)
{
struct stat st;
struct blkdev_part *part;
char dev_path[64];
snprintf(dev_path, sizeof(dev_path), "/dev/%s" , part_name);
if (stat(dev_path, &st))
{
perror("[ERROR] stat");
return -1;
}
part = (struct blkdev_part *)calloc(1, sizeof(struct blkdev_part));
part->disk_name = strdup(disk_name);
part->part_name = strdup(dev_path);
part->maj = major(st.st_rdev);
part->min = minor(st.st_rdev);
LIST_INSERT_HEAD(&p_list, part, node);
return 0;
}
int set_partitions(const char *disk_name)
{
char disk_path[256];
DIR *dir;
struct dirent *d;
snprintf(disk_path, sizeof(disk_path), "%s/%s", PATH_SYS_BLOCK, disk_name);
if (!(dir = opendir(disk_path)))
{
perror("[ERROR] opendir");
return -1;
}
while ((d = readdir(dir))!= NULL) {
if (!strcmp(d->d_name, ".") ||
!strcmp(d->d_name, ".."))
continue;
if (!strncmp(disk_name, d->d_name, strlen(disk_name)))
add_partition(disk_name, d->d_name);
}
closedir(dir);
return 0;
}
int set_disk(const char *dir_name)
{
struct stat st;
struct blkdev_disk *disk;
char dev_path[64];
int fd;
unsigned long long size;
snprintf(dev_path, sizeof(dev_path), "/dev/%s" , dir_name);
if (stat(dev_path, &st))
{
perror("[ERROR] stat");
return -1;
}
if ((fd = open(dev_path, O_RDONLY)) < 0)
{
if (errno == ENOMEDIUM)
;
else
perror("[ERROR] open");
return -1;
}
if (ioctl(fd, BLKGETSIZE64, &size) < 0)
{
perror("[ERROR] ioctl:BLKGETSIZE64");
return -1;
}
if (size == 0)
return -1;
disk = (struct blkdev_disk *)calloc(1, sizeof(struct blkdev_disk));
disk->name = strdup(dev_path);
disk->maj = major(st.st_rdev);
disk->min = minor(st.st_rdev);
disk->size =size;
LIST_INSERT_HEAD(&d_list, disk, node);
set_partitions(dir_name);
return 0;
}
int find_blkdev_disks(void)
{
DIR *dir;
struct dirent *d;
if (!(dir = opendir(PATH_SYS_BLOCK)))
{
perror("[ERROR] opendir");
return -1;
}
while ((d = readdir(dir))!= NULL) {
if (!strcmp(d->d_name, ".") ||
!strcmp(d->d_name, ".."))
continue;
if (set_disk(d->d_name))
continue;
}
closedir(dir);
return 0;
}
void free_part_list(struct part_list *list)
{
struct blkdev_part *p;
while (!LIST_EMPTY(list)) {
p = LIST_FIRST(list);
free(p->disk_name);
free(p->part_name);
LIST_REMOVE(p, node);
free(p);
}
}
void free_disk_list(struct disk_list *list)
{
struct blkdev_disk *d;
while (!LIST_EMPTY(list)) {
d = LIST_FIRST(list);
free(d->name);
LIST_REMOVE(d, node);
free(d);
}
}
void print_part_list(struct part_list *list)
{
struct blkdev_part *p;
LIST_FOREACH(p, list, node) {
printf("disk name : %s\n", p->disk_name);
printf("part name : %s\n", p->part_name);
printf("maj : %d\n", p->maj);
printf("min : %d\n", p->min);
printf("\n");
}
}
void print_disk_list(struct disk_list *list)
{
struct blkdev_disk *d;
LIST_FOREACH(d, list, node) {
printf("name : %s\n", d->name);
printf("maj : %d\n", d->maj);
printf("min : %d\n", d->min);
printf("size : %llu\n", d->size);
printf("\n");
}
}
int main()
{
find_blkdev_disks();
print_disk_list(&d_list);
print_part_list(&p_list);
free_disk_list(&d_list);
free_part_list(&p_list);
return 0;
}