forked from jviki/dtree
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdtree.c
103 lines (77 loc) · 1.63 KB
/
dtree.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
#include "dtree.h"
#include "dtree_error.h"
#include "dtree_procfs.h"
#include <string.h>
int dtree_open(const char *rootd)
{
int err = dtree_procfs_open(rootd);
if(err == 0) {
dtree_error_clear();
return 0;
}
dtree_procfs_close();
return err;
}
void dtree_close(void)
{
dtree_procfs_close();
}
struct dtree_dev_t *dtree_next(void)
{
return dtree_procfs_next();
}
void dtree_dev_free(struct dtree_dev_t *dev)
{
dtree_procfs_dev_free(dev);
}
int dtree_reset(void)
{
return dtree_procfs_reset();
}
struct dtree_dev_t *dtree_byname(const char *name)
{
struct dtree_dev_t *curr = NULL;
if(name == NULL || strlen(name) == 0)
return NULL;
while((curr = dtree_next()) != NULL) {
if(!strcmp(name, curr->name))
break;
dtree_dev_free(curr);
}
return curr;
}
struct dtree_dev_t *dtree_byname_prefix(const char *name_prefix)
{
struct dtree_dev_t *curr = NULL;
int string_length = strlen(name_prefix);
if(name_prefix == NULL || string_length == 0)
return NULL;
while((curr = dtree_next()) != NULL) {
if(!strncmp(name_prefix, curr->name, string_length))
break;
dtree_dev_free(curr);
}
return curr;
}
static
int is_compatible(const struct dtree_dev_t *dev, const char *compat)
{
const char **dev_compat = dtree_dev_compat(dev);
for(int i = 0; dev_compat[i] != NULL; ++i) {
if(!strcmp(dev_compat[i], compat))
return 1;
}
return 0;
}
struct dtree_dev_t *dtree_bycompat(const char *compat)
{
struct dtree_dev_t *curr = NULL;
if(compat == NULL || strlen(compat) == 0)
return NULL;
while((curr = dtree_next()) != NULL) {
if(is_compatible(curr, compat))
break;
dtree_dev_free(curr);
}
return curr;
}