1 /*
2  * Copyright (C) 2010 The Android Open Source Project
3  *
4  * Licensed under the Apache License, Version 2.0 (the "License");
5  * you may not use this file except in compliance with the License.
6  * You may obtain a copy of the License at
7  *
8  *      http://www.apache.org/licenses/LICENSE-2.0
9  *
10  * Unless required by applicable law or agreed to in writing, software
11  * distributed under the License is distributed on an "AS IS" BASIS,
12  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13  * See the License for the specific language governing permissions and
14  * limitations under the License.
15  */
16 
17 #include <errno.h>
18 #include <libgen.h>
19 #include <stdio.h>
20 #include <stdlib.h>
21 #include <string.h>
22 #include <sys/stat.h>
23 #include <sys/statfs.h>
24 #include <unistd.h>
25 #include <dirent.h>
26 #include <ctype.h>
27 
28 #include <memory>
29 #include <set>
30 #include <string>
31 
32 #include <android-base/parseint.h>
33 #include <android-base/stringprintf.h>
34 
35 #include "applypatch/applypatch.h"
36 #include "otautil/cache_location.h"
37 
EliminateOpenFiles(std::set<std::string> * files)38 static int EliminateOpenFiles(std::set<std::string>* files) {
39   std::unique_ptr<DIR, decltype(&closedir)> d(opendir("/proc"), closedir);
40   if (!d) {
41     printf("error opening /proc: %s\n", strerror(errno));
42     return -1;
43   }
44   struct dirent* de;
45   while ((de = readdir(d.get())) != 0) {
46     unsigned int pid;
47     if (!android::base::ParseUint(de->d_name, &pid)) {
48         continue;
49     }
50     std::string path = android::base::StringPrintf("/proc/%s/fd/", de->d_name);
51 
52     struct dirent* fdde;
53     std::unique_ptr<DIR, decltype(&closedir)> fdd(opendir(path.c_str()), closedir);
54     if (!fdd) {
55       printf("error opening %s: %s\n", path.c_str(), strerror(errno));
56       continue;
57     }
58     while ((fdde = readdir(fdd.get())) != 0) {
59       std::string fd_path = path + fdde->d_name;
60       char link[FILENAME_MAX];
61 
62       int count = readlink(fd_path.c_str(), link, sizeof(link)-1);
63       if (count >= 0) {
64         link[count] = '\0';
65         if (strncmp(link, "/cache/", 7) == 0) {
66           if (files->erase(link) > 0) {
67             printf("%s is open by %s\n", link, de->d_name);
68           }
69         }
70       }
71     }
72   }
73   return 0;
74 }
75 
FindExpendableFiles()76 static std::set<std::string> FindExpendableFiles() {
77   std::set<std::string> files;
78   // We're allowed to delete unopened regular files in any of these
79   // directories.
80   const char* dirs[2] = {"/cache", "/cache/recovery/otatest"};
81 
82   for (size_t i = 0; i < sizeof(dirs)/sizeof(dirs[0]); ++i) {
83     std::unique_ptr<DIR, decltype(&closedir)> d(opendir(dirs[i]), closedir);
84     if (!d) {
85       printf("error opening %s: %s\n", dirs[i], strerror(errno));
86       continue;
87     }
88 
89     // Look for regular files in the directory (not in any subdirectories).
90     struct dirent* de;
91     while ((de = readdir(d.get())) != 0) {
92       std::string path = std::string(dirs[i]) + "/" + de->d_name;
93 
94       // We can't delete cache_temp_source; if it's there we might have restarted during
95       // installation and could be depending on it to be there.
96       if (path == CacheLocation::location().cache_temp_source()) {
97         continue;
98       }
99 
100       struct stat st;
101       if (stat(path.c_str(), &st) == 0 && S_ISREG(st.st_mode)) {
102         files.insert(path);
103       }
104     }
105   }
106 
107   printf("%zu regular files in deletable directories\n", files.size());
108   if (EliminateOpenFiles(&files) < 0) {
109     return std::set<std::string>();
110   }
111   return files;
112 }
113 
MakeFreeSpaceOnCache(size_t bytes_needed)114 int MakeFreeSpaceOnCache(size_t bytes_needed) {
115 #ifndef __ANDROID__
116   // TODO (xunchang) implement a heuristic cache size check during host simulation.
117   printf("Skip making (%zu) bytes free space on cache; program is running on host\n", bytes_needed);
118   return 0;
119 #endif
120 
121   size_t free_now = FreeSpaceForFile("/cache");
122   printf("%zu bytes free on /cache (%zu needed)\n", free_now, bytes_needed);
123 
124   if (free_now >= bytes_needed) {
125     return 0;
126   }
127   std::set<std::string> files = FindExpendableFiles();
128   if (files.empty()) {
129     // nothing we can delete to free up space!
130     printf("no files can be deleted to free space on /cache\n");
131     return -1;
132   }
133 
134   // We could try to be smarter about which files to delete:  the
135   // biggest ones?  the smallest ones that will free up enough space?
136   // the oldest?  the newest?
137   //
138   // Instead, we'll be dumb.
139 
140   for (const auto& file : files) {
141     unlink(file.c_str());
142     free_now = FreeSpaceForFile("/cache");
143     printf("deleted %s; now %zu bytes free\n", file.c_str(), free_now);
144     if (free_now < bytes_needed) {
145         break;
146     }
147   }
148   return (free_now >= bytes_needed) ? 0 : -1;
149 }
150