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
|
/* Cydia - iPhone UIKit Front-End for Debian APT
* Copyright (C) 2008-2014 Jay Freeman (saurik)
*/
/* GNU General Public License, Version 3 {{{ */
/*
* Cydia is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published
* by the Free Software Foundation, either version 3 of the License,
* or (at your option) any later version.
*
* Cydia is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Cydia. If not, see <http://www.gnu.org/licenses/>.
**/
/* }}} */
#include <fcntl.h>
#include <dirent.h>
#include <unistd.h>
#include <stdio.h>
#include <errno.h>
#include <string.h>
#include <sys/stat.h>
#define _syscall(expr) ({ decltype(expr) _value; for (;;) { \
_value = (expr); \
if ((long) _value != -1) \
break; \
if (errno != EINTR) { \
perror(#expr); \
return -1; \
} \
} _value; })
extern "C" int __getdirentries64(int, char *, int, long *);
enum Recurse {
RecurseYes,
RecurseNo,
RecurseMaybe,
};
struct File {
int fd_;
File(int fd);
~File();
operator int() const;
};
File::File(int fd) :
fd_(fd)
{
}
File::~File() {
close(fd_);
}
File::operator int() const {
return fd_;
}
static bool DiskUsage(size_t &total, const char *path, size_t before, Recurse recurse) {
File fd(_syscall(open_dprotected_np(path, O_RDONLY | O_SYMLINK, 0, O_DP_GETRAWENCRYPTED)));
struct stat stat;
_syscall(fstat(fd, &stat));
total += stat.st_blocks * 512;
if (recurse == RecurseMaybe)
switch (stat.st_mode & S_IFMT) {
case S_IFLNK:
return true;
default:
return false;
case S_IFDIR:
recurse = RecurseYes;
break;
case S_IFREG:
recurse = RecurseNo;
break;
}
if (recurse == RecurseNo) {
} else for (long address(0);;) {
char buffer[4096];
int size(_syscall(__getdirentries64(fd, buffer, sizeof(buffer), &address)));
if (size == 0)
break;
const char *next(buffer), *stop(next + size);
while (next != stop) {
const dirent *dir(reinterpret_cast<const dirent *>(next));
const char *name(dir->d_name);
size_t after(strlen(name));
if (dir->d_ino == 0);
else if (after == 1 && name[0] == '.');
else if (after == 2 && name[0] == '.' && name[1] == '.');
else {
size_t both(before + 1 + after);
char sub[both + 1];
memcpy(sub, path, before);
sub[before] = '/';
memcpy(sub + before + 1, name, after);
sub[both] = '\0';
switch (dir->d_type) {
case DT_DIR:
if (!DiskUsage(total, sub, both, RecurseYes))
return false;
break;
case DT_LNK:
case DT_REG:
if (!DiskUsage(total, sub, both, RecurseNo))
return false;
break;
default:
return false;
}
}
next += dir->d_reclen;
}
}
return true;
}
ssize_t DiskUsage(const char *path) {
size_t total(0);
if (!DiskUsage(total, path, strlen(path), RecurseMaybe))
return -1;
return total;
}
|
