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
|
/* These functions find the absolute path to the current working directory. */
#include <stdlib.h>
#include <errno.h>
#include <sys/stat.h>
#include <dirent.h>
#include <string.h>
#include <sys/syscall.h>
/* if the syscall is not present, we have to recurse up */
#ifndef __NR_getcwd
/* #undef FAST_DIR_SEARCH_POSSIBLE on Linux */
/* Routine to find the step back down */
static char *search_dir(dev_t this_dev, ino_t this_ino, char *path_buf, int path_size)
{
DIR *dp;
struct dirent *d;
char *ptr;
int slen;
struct stat st;
#ifdef FAST_DIR_SEARCH_POSSIBLE
/* The test is for ELKS lib 0.0.9, this should be fixed in the real kernel */
int slow_search = (sizeof(ino_t) != sizeof(d->d_ino));
#endif
if (stat(path_buf, &st) < 0)
return 0;
#ifdef FAST_DIR_SEARCH_POSSIBLE
if (this_dev != st.st_dev)
slow_search = 1;
#endif
slen = strlen(path_buf);
ptr = path_buf + slen - 1;
if (*ptr != '/') {
if (slen + 2 > path_size) {
__set_errno(ERANGE);
return 0;
}
strcpy(++ptr, "/");
slen++;
}
slen++;
dp = opendir(path_buf);
if (dp == 0)
return 0;
while ((d = readdir(dp)) != 0) {
#ifdef FAST_DIR_SEARCH_POSSIBLE
if (slow_search || this_ino == d->d_ino) {
#endif
if (slen + strlen(d->d_name) > path_size) {
__set_errno(ERANGE);
return 0;
}
strcpy(ptr + 1, d->d_name);
if (stat(path_buf, &st) < 0)
continue;
if (st.st_ino == this_ino && st.st_dev == this_dev) {
closedir(dp);
return path_buf;
}
#ifdef FAST_DIR_SEARCH_POSSIBLE
}
#endif
}
closedir(dp);
__set_errno(ENOENT);
return 0;
}
/* Routine to go up tree */
static char *recurser(char *path_buf, int path_size, dev_t root_dev, ino_t root_ino)
{
struct stat st;
dev_t this_dev;
ino_t this_ino;
if (stat(path_buf, &st) < 0)
return 0;
this_dev = st.st_dev;
this_ino = st.st_ino;
if (this_dev == root_dev && this_ino == root_ino) {
strcpy(path_buf, "/");
return path_buf;
}
if (strlen(path_buf) + 4 > path_size) {
__set_errno(ERANGE);
return 0;
}
strcat(path_buf, "/..");
if (recurser(path_buf, path_size, root_dev, root_ino) == 0)
return 0;
return search_dir(this_dev, this_ino, path_buf, path_size);
}
char *getcwd(char *buf, int size)
{
struct stat st;
if (size == 0) {
__set_errno(EINVAL);
return NULL;
}
if (size < 3) {
__set_errno(ERANGE);
return NULL;
}
if (buf == NULL) {
buf = malloc (size);
if (buf == NULL)
return NULL;
}
strcpy(buf, ".");
if (stat("/", &st) < 0) {
return NULL;
}
return recurser(buf, size, st.st_dev, st.st_ino);
}
#endif
|
