Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(781)

Side by Side Diff: runtime/bin/directory_linux.cc

Issue 16813006: Make Directory.list pull-based, making it possible to pause, resume and cancel directory listing. (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart
Patch Set: Macos and Android version. Created 7 years, 6 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file
2 // for details. All rights reserved. Use of this source code is governed by a 2 // for details. All rights reserved. Use of this source code is governed by a
3 // BSD-style license that can be found in the LICENSE file. 3 // BSD-style license that can be found in the LICENSE file.
4 4
5 #include "platform/globals.h" 5 #include "platform/globals.h"
6 #if defined(TARGET_OS_LINUX) 6 #if defined(TARGET_OS_LINUX)
7 7
8 #include "bin/directory.h" 8 #include "bin/directory.h"
9 9
10 #include <dirent.h> // NOLINT 10 #include <dirent.h> // NOLINT
11 #include <errno.h> // NOLINT 11 #include <errno.h> // NOLINT
12 #include <string.h> // NOLINT 12 #include <string.h> // NOLINT
13 #include <sys/param.h> // NOLINT 13 #include <sys/param.h> // NOLINT
14 #include <sys/stat.h> // NOLINT 14 #include <sys/stat.h> // NOLINT
15 #include <unistd.h> // NOLINT 15 #include <unistd.h> // NOLINT
16 16
17 #include "bin/file.h" 17 #include "bin/file.h"
18 #include "bin/platform.h" 18 #include "bin/platform.h"
19 19
20 20
21 namespace dart { 21 namespace dart {
22 namespace bin { 22 namespace bin {
23 23
24 class PathBuffer { 24
25 public: 25 PathBuffer::PathBuffer() : length_(0) {
26 PathBuffer() : length(0) { 26 data_ = new char[PATH_MAX + 1];
27 data = new char[PATH_MAX + 1]; 27 }
28
29 char* PathBuffer::AsString() const {
30 return reinterpret_cast<char*>(data_);
31 }
32
33 bool PathBuffer::Add(const char* name) {
34 char* data = AsString();
35 int written = snprintf(data + length_,
36 PATH_MAX - length_,
37 "%s",
38 name);
39 data[PATH_MAX] = '\0';
40 if (written <= PATH_MAX - length_ &&
41 written >= 0 &&
42 static_cast<size_t>(written) == strnlen(name, PATH_MAX + 1)) {
43 length_ += written;
44 return true;
45 } else {
46 errno = ENAMETOOLONG;
47 return false;
28 } 48 }
49 }
29 50
30 ~PathBuffer() { 51 void PathBuffer::Reset(int new_length) {
31 delete[] data; 52 length_ = new_length;
32 } 53 AsString()[length_] = '\0';
33 54 }
34 char* data;
35 int length;
36
37 bool Add(const char* name) {
38 int written = snprintf(data + length,
39 PATH_MAX - length,
40 "%s",
41 name);
42 data[PATH_MAX] = '\0';
43 if (written <= PATH_MAX - length &&
44 written >= 0 &&
45 static_cast<size_t>(written) == strnlen(name, PATH_MAX + 1)) {
46 length += written;
47 return true;
48 } else {
49 errno = ENAMETOOLONG;
50 return false;
51 }
52 }
53
54 void Reset(int new_length) {
55 length = new_length;
56 data[length] = '\0';
57 }
58 };
59 55
60 56
61 // A linked list of symbolic links, with their unique file system identifiers. 57 // A linked list of symbolic links, with their unique file system identifiers.
62 // These are scanned to detect loops while doing a recursive directory listing. 58 // These are scanned to detect loops while doing a recursive directory listing.
63 struct LinkList { 59 struct LinkList {
64 dev_t dev; 60 dev_t dev;
65 ino_t ino; 61 ino_t ino;
66 LinkList* next; 62 LinkList* next;
67 }; 63 };
68 64
69 65
70 // Forward declarations. 66 ListType DirectoryListingEntry::Next(DirectoryListing* listing) {
71 static bool ListRecursively(PathBuffer* path, 67 if (done_) {
72 bool recursive, 68 return kListDone;
73 bool follow_links, 69 }
74 LinkList* seen,
75 DirectoryListing* listing);
76 static bool DeleteRecursively(PathBuffer* path);
77 70
71 if (lister_ == 0) {
72 if (!listing->path_buffer().Add(File::PathSeparator())) {
73 done_ = true;
74 return kListError;
75 }
76 path_length_ = listing->path_buffer().length();
77 do {
78 lister_ = reinterpret_cast<intptr_t>(
79 opendir(listing->path_buffer().AsString()));
80 } while (lister_ == 0 && errno == EINTR);
78 81
79 static void PostError(DirectoryListing *listing, 82 if (lister_ == 0) {
80 const char* dir_name) { 83 done_ = true;
81 listing->HandleError(dir_name); 84 return kListError;
82 } 85 }
83
84
85 static bool HandleDir(char* dir_name,
86 PathBuffer* path,
87 bool recursive,
88 bool follow_links,
89 LinkList* seen,
90 DirectoryListing *listing) {
91 if (strcmp(dir_name, ".") == 0) return true;
92 if (strcmp(dir_name, "..") == 0) return true;
93 if (!path->Add(dir_name)) {
94 PostError(listing, path->data);
95 return false;
96 } 86 }
97 return listing->HandleDirectory(path->data) && 87 // Reset.
98 (!recursive || 88 listing->path_buffer().Reset(path_length_);
99 ListRecursively(path, recursive, follow_links, seen, listing)); 89 ResetLink();
100 }
101
102
103 static bool HandleFile(char* file_name,
104 PathBuffer* path,
105 DirectoryListing *listing) {
106 if (!path->Add(file_name)) {
107 PostError(listing, path->data);
108 return false;
109 }
110 return listing->HandleFile(path->data);
111 }
112
113
114 static bool HandleLink(char* link_name,
115 PathBuffer* path,
116 DirectoryListing *listing) {
117 if (!path->Add(link_name)) {
118 PostError(listing, path->data);
119 return false;
120 }
121 return listing->HandleLink(path->data);
122 }
123
124
125 static bool ListRecursively(PathBuffer* path,
126 bool recursive,
127 bool follow_links,
128 LinkList* seen,
129 DirectoryListing *listing) {
130 if (!path->Add(File::PathSeparator())) {
131 PostError(listing, path->data);
132 return false;
133 }
134 DIR* dir_pointer;
135 do {
136 dir_pointer = opendir(path->data);
137 } while (dir_pointer == NULL && errno == EINTR);
138 if (dir_pointer == NULL) {
139 PostError(listing, path->data);
140 return false;
141 }
142 90
143 // Iterate the directory and post the directories and files to the 91 // Iterate the directory and post the directories and files to the
144 // ports. 92 // ports.
145 int path_length = path->length;
146 int status = 0; 93 int status = 0;
147 bool success = true;
148 dirent entry; 94 dirent entry;
149 dirent* result; 95 dirent* result;
150 while ((status = TEMP_FAILURE_RETRY(readdir_r(dir_pointer, 96 if ((status = TEMP_FAILURE_RETRY(readdir_r(reinterpret_cast<DIR*>(lister_),
151 &entry, 97 &entry,
152 &result))) == 0 && 98 &result))) == 0 &&
153 result != NULL) { 99 result != NULL) {
100 if (!listing->path_buffer().Add(entry.d_name)) {
101 done_ = true;
102 return kListError;
103 }
154 switch (entry.d_type) { 104 switch (entry.d_type) {
155 case DT_DIR: 105 case DT_DIR:
156 success = HandleDir(entry.d_name, 106 if (strcmp(entry.d_name, ".") == 0) return Next(listing);
157 path, 107 if (strcmp(entry.d_name, "..") == 0) return Next(listing);
158 recursive, 108 return kListDirectory;
159 follow_links,
160 seen,
161 listing) && success;
162 break;
163 case DT_REG: 109 case DT_REG:
164 success = HandleFile(entry.d_name, 110 return kListFile;
165 path,
166 listing) && success;
167 break;
168 case DT_LNK: 111 case DT_LNK:
169 if (!follow_links) { 112 if (!listing->follow_links()) {
170 success = HandleLink(entry.d_name, 113 return kListLink;
171 path,
172 listing) && success;
173 break;
174 } 114 }
175 // Else fall through to next case. 115 // Else fall through to next case.
176 // Fall through. 116 // Fall through.
177 case DT_UNKNOWN: { 117 case DT_UNKNOWN: {
178 // On some file systems the entry type is not determined by 118 // On some file systems the entry type is not determined by
179 // readdir_r. For those and for links we use stat to determine 119 // readdir_r. For those and for links we use stat to determine
180 // the actual entry type. Notice that stat returns the type of 120 // the actual entry type. Notice that stat returns the type of
181 // the file pointed to. 121 // the file pointed to.
182 struct stat entry_info; 122 struct stat entry_info;
183 if (!path->Add(entry.d_name)) { 123 int stat_success;
184 success = false; 124 stat_success = TEMP_FAILURE_RETRY(
185 break; 125 lstat(listing->path_buffer().AsString(), &entry_info));
126 if (stat_success == -1) {
127 return kListError;
186 } 128 }
187 int stat_success; 129 if (listing->follow_links() && S_ISLNK(entry_info.st_mode)) {
188 stat_success = TEMP_FAILURE_RETRY(lstat(path->data, &entry_info));
189 if (stat_success == -1) {
190 success = false;
191 PostError(listing, path->data);
192 break;
193 }
194 if (follow_links && S_ISLNK(entry_info.st_mode)) {
195 // Check to see if we are in a loop created by a symbolic link. 130 // Check to see if we are in a loop created by a symbolic link.
131 LinkList* previous = reinterpret_cast<LinkList*>(link_);
196 LinkList current_link = { entry_info.st_dev, 132 LinkList current_link = { entry_info.st_dev,
197 entry_info.st_ino, 133 entry_info.st_ino,
198 seen }; 134 previous };
199 LinkList* previous = seen;
200 bool looping_link = false;
201 while (previous != NULL) { 135 while (previous != NULL) {
202 if (previous->dev == current_link.dev && 136 if (previous->dev == current_link.dev &&
203 previous->ino == current_link.ino) { 137 previous->ino == current_link.ino) {
204 // Report the looping link as a link, rather than following it. 138 // Report the looping link as a link, rather than following it.
205 path->Reset(path_length); 139 return kListLink;
206 success = HandleLink(entry.d_name,
207 path,
208 listing) && success;
209 looping_link = true;
210 break;
211 } 140 }
212 previous = previous->next; 141 previous = previous->next;
213 } 142 }
214 if (looping_link) break; 143 stat_success = TEMP_FAILURE_RETRY(
215 stat_success = TEMP_FAILURE_RETRY(stat(path->data, &entry_info)); 144 stat(listing->path_buffer().AsString(), &entry_info));
216 if (stat_success == -1) { 145 if (stat_success == -1) {
217 // Report a broken link as a link, even if follow_links is true. 146 // Report a broken link as a link, even if follow_links is true.
218 path->Reset(path_length); 147 return kListLink;
219 success = HandleLink(entry.d_name,
220 path,
221 listing) && success;
222 break;
223 } 148 }
224 if (S_ISDIR(entry_info.st_mode)) { 149 if (S_ISDIR(entry_info.st_mode)) {
225 // Recurse into the subdirectory with current_link added to the 150 // Recurse into the subdirectory with current_link added to the
226 // linked list of seen file system links. 151 // linked list of seen file system links.
227 path->Reset(path_length); 152 link_ = new LinkList(current_link);
228 success = HandleDir(entry.d_name, 153 if (strcmp(entry.d_name, ".") == 0) return Next(listing);
229 path, 154 if (strcmp(entry.d_name, "..") == 0) return Next(listing);
230 recursive, 155 return kListDirectory;
231 follow_links,
232 &current_link,
233 listing) && success;
234 break;
235 } 156 }
236 } 157 }
237 path->Reset(path_length);
238 if (S_ISDIR(entry_info.st_mode)) { 158 if (S_ISDIR(entry_info.st_mode)) {
239 success = HandleDir(entry.d_name, 159 if (strcmp(entry.d_name, ".") == 0) return Next(listing);
240 path, 160 if (strcmp(entry.d_name, "..") == 0) return Next(listing);
241 recursive, 161 return kListDirectory;
242 follow_links,
243 seen,
244 listing) && success;
245 } else if (S_ISREG(entry_info.st_mode)) { 162 } else if (S_ISREG(entry_info.st_mode)) {
246 success = HandleFile(entry.d_name, 163 return kListFile;
247 path,
248 listing) && success;
249 } else if (S_ISLNK(entry_info.st_mode)) { 164 } else if (S_ISLNK(entry_info.st_mode)) {
250 success = HandleLink(entry.d_name, 165 return kListLink;
251 path,
252 listing) && success;
253 } 166 }
254 break;
255 } 167 }
168
256 default: 169 default:
257 break; 170 break;
258 } 171 }
259 path->Reset(path_length);
260 } 172 }
173 done_ = true;
261 174
262 if (status != 0) { 175 if (status != 0) {
263 errno = status; 176 errno = status;
264 success = false; 177 return kListError;
265 PostError(listing, path->data);
266 } 178 }
267 179
268 if (closedir(dir_pointer) == -1) { 180 if (closedir(reinterpret_cast<DIR*>(lister_)) == -1) {
269 success = false; 181 return kListError;
270 PostError(listing, path->data);
271 } 182 }
272 183
273 return success; 184 return kListDone;
274 } 185 }
275 186
276 187
188 static bool DeleteRecursively(PathBuffer* path);
189
190
277 static bool DeleteFile(char* file_name, 191 static bool DeleteFile(char* file_name,
278 PathBuffer* path) { 192 PathBuffer* path) {
279 return path->Add(file_name) && unlink(path->data) == 0; 193 return path->Add(file_name) && unlink(path->AsString()) == 0;
280 } 194 }
281 195
282 196
283 static bool DeleteDir(char* dir_name, 197 static bool DeleteDir(char* dir_name,
284 PathBuffer* path) { 198 PathBuffer* path) {
285 if (strcmp(dir_name, ".") == 0) return true; 199 if (strcmp(dir_name, ".") == 0) return true;
286 if (strcmp(dir_name, "..") == 0) return true; 200 if (strcmp(dir_name, "..") == 0) return true;
287 return path->Add(dir_name) && DeleteRecursively(path); 201 return path->Add(dir_name) && DeleteRecursively(path);
288 } 202 }
289 203
290 204
291 static bool DeleteRecursively(PathBuffer* path) { 205 static bool DeleteRecursively(PathBuffer* path) {
292 // Do not recurse into links for deletion. Instead delete the link. 206 // Do not recurse into links for deletion. Instead delete the link.
293 // If it's a file, delete it. 207 // If it's a file, delete it.
294 struct stat st; 208 struct stat st;
295 if (TEMP_FAILURE_RETRY(lstat(path->data, &st)) == -1) { 209 if (TEMP_FAILURE_RETRY(lstat(path->AsString(), &st)) == -1) {
296 return false; 210 return false;
297 } else if (S_ISREG(st.st_mode) || S_ISLNK(st.st_mode)) { 211 } else if (S_ISREG(st.st_mode) || S_ISLNK(st.st_mode)) {
298 return (unlink(path->data) == 0); 212 return (unlink(path->AsString()) == 0);
299 } 213 }
300 214
301 if (!path->Add(File::PathSeparator())) return false; 215 if (!path->Add(File::PathSeparator())) return false;
302 216
303 // Not a link. Attempt to open as a directory and recurse into the 217 // Not a link. Attempt to open as a directory and recurse into the
304 // directory. 218 // directory.
305 DIR* dir_pointer; 219 DIR* dir_pointer;
306 do { 220 do {
307 dir_pointer = opendir(path->data); 221 dir_pointer = opendir(path->AsString());
308 } while (dir_pointer == NULL && errno == EINTR); 222 } while (dir_pointer == NULL && errno == EINTR);
309 223
310 if (dir_pointer == NULL) { 224 if (dir_pointer == NULL) {
311 return false; 225 return false;
312 } 226 }
313 227
314 // Iterate the directory and delete all files and directories. 228 // Iterate the directory and delete all files and directories.
315 int path_length = path->length; 229 int path_length = path->length();
316 int read = 0; 230 int read = 0;
317 bool success = true; 231 bool success = true;
318 dirent entry; 232 dirent entry;
319 dirent* result; 233 dirent* result;
320 while ((read = TEMP_FAILURE_RETRY(readdir_r(dir_pointer, 234 while ((read = TEMP_FAILURE_RETRY(readdir_r(dir_pointer,
321 &entry, 235 &entry,
322 &result))) == 0 && 236 &result))) == 0 &&
323 result != NULL && 237 result != NULL &&
324 success) { 238 success) {
325 switch (entry.d_type) { 239 switch (entry.d_type) {
326 case DT_DIR: 240 case DT_DIR:
327 success = success && DeleteDir(entry.d_name, path); 241 success = success && DeleteDir(entry.d_name, path);
328 break; 242 break;
329 case DT_REG: 243 case DT_REG:
330 case DT_LNK: 244 case DT_LNK:
331 // Treat all links as files. This will delete the link which 245 // Treat all links as files. This will delete the link which
332 // is what we want no matter if the link target is a file or a 246 // is what we want no matter if the link target is a file or a
333 // directory. 247 // directory.
334 success = success && DeleteFile(entry.d_name, path); 248 success = success && DeleteFile(entry.d_name, path);
335 break; 249 break;
336 case DT_UNKNOWN: { 250 case DT_UNKNOWN: {
337 // On some file systems the entry type is not determined by 251 // On some file systems the entry type is not determined by
338 // readdir_r. For those we use lstat to determine the entry 252 // readdir_r. For those we use lstat to determine the entry
339 // type. 253 // type.
340 struct stat entry_info; 254 struct stat entry_info;
341 if (!path->Add(entry.d_name)) { 255 if (!path->Add(entry.d_name)) {
342 success = false; 256 success = false;
343 break; 257 break;
344 } 258 }
345 int lstat_success = TEMP_FAILURE_RETRY(lstat(path->data, &entry_info)); 259 int lstat_success = TEMP_FAILURE_RETRY(
260 lstat(path->AsString(), &entry_info));
346 if (lstat_success == -1) { 261 if (lstat_success == -1) {
347 success = false; 262 success = false;
348 break; 263 break;
349 } 264 }
350 path->Reset(path_length); 265 path->Reset(path_length);
351 if (S_ISDIR(entry_info.st_mode)) { 266 if (S_ISDIR(entry_info.st_mode)) {
352 success = success && DeleteDir(entry.d_name, path); 267 success = success && DeleteDir(entry.d_name, path);
353 } else if (S_ISREG(entry_info.st_mode) || S_ISLNK(entry_info.st_mode)) { 268 } else if (S_ISREG(entry_info.st_mode) || S_ISLNK(entry_info.st_mode)) {
354 // Treat links as files. This will delete the link which is 269 // Treat links as files. This will delete the link which is
355 // what we want no matter if the link target is a file or a 270 // what we want no matter if the link target is a file or a
356 // directory. 271 // directory.
357 success = success && DeleteFile(entry.d_name, path); 272 success = success && DeleteFile(entry.d_name, path);
358 } 273 }
359 break; 274 break;
360 } 275 }
361 default: 276 default:
362 break; 277 break;
363 } 278 }
364 path->Reset(path_length); 279 path->Reset(path_length);
365 } 280 }
366 281
367 if ((read != 0) || 282 if ((read != 0) ||
368 (closedir(dir_pointer) == -1) || 283 (closedir(dir_pointer) == -1) ||
369 (remove(path->data) == -1)) { 284 (remove(path->AsString()) == -1)) {
370 return false; 285 return false;
371 } 286 }
372 return success; 287 return success;
373 } 288 }
374 289
375 290
376 bool Directory::List(const char* dir_name,
377 bool recursive,
378 bool follow_links,
379 DirectoryListing *listing) {
380 PathBuffer path;
381 if (!path.Add(dir_name)) {
382 PostError(listing, dir_name);
383 return false;
384 }
385 return ListRecursively(&path, recursive, follow_links, NULL, listing);
386 }
387
388
389 Directory::ExistsResult Directory::Exists(const char* dir_name) { 291 Directory::ExistsResult Directory::Exists(const char* dir_name) {
390 struct stat entry_info; 292 struct stat entry_info;
391 int success = TEMP_FAILURE_RETRY(stat(dir_name, &entry_info)); 293 int success = TEMP_FAILURE_RETRY(stat(dir_name, &entry_info));
392 if (success == 0) { 294 if (success == 0) {
393 if (S_ISDIR(entry_info.st_mode)) { 295 if (S_ISDIR(entry_info.st_mode)) {
394 return EXISTS; 296 return EXISTS;
395 } else { 297 } else {
396 return DOES_NOT_EXIST; 298 return DOES_NOT_EXIST;
397 } 299 }
398 } else { 300 } else {
(...skipping 50 matching lines...) Expand 10 before | Expand all | Expand 10 after
449 } 351 }
450 352
451 353
452 char* Directory::CreateTemp(const char* const_template) { 354 char* Directory::CreateTemp(const char* const_template) {
453 // Returns a new, unused directory name, modifying the contents of 355 // Returns a new, unused directory name, modifying the contents of
454 // dir_template. Creates the directory with the permissions specified 356 // dir_template. Creates the directory with the permissions specified
455 // by the process umask. 357 // by the process umask.
456 // The return value must be freed by the caller. 358 // The return value must be freed by the caller.
457 PathBuffer path; 359 PathBuffer path;
458 path.Add(const_template); 360 path.Add(const_template);
459 if (path.length == 0) { 361 if (path.length() == 0) {
460 path.Add("/tmp/temp_dir1_"); 362 path.Add("/tmp/temp_dir1_");
461 } else if ((path.data)[path.length - 1] == '/') { 363 } else if ((path.AsString())[path.length() - 1] == '/') {
462 path.Add("temp_dir_"); 364 path.Add("temp_dir_");
463 } 365 }
464 if (!path.Add("XXXXXX")) { 366 if (!path.Add("XXXXXX")) {
465 // Pattern has overflowed. 367 // Pattern has overflowed.
466 return NULL; 368 return NULL;
467 } 369 }
468 char* result; 370 char* result;
469 do { 371 do {
470 result = mkdtemp(path.data); 372 result = mkdtemp(path.AsString());
471 } while (result == NULL && errno == EINTR); 373 } while (result == NULL && errno == EINTR);
472 if (result == NULL) { 374 if (result == NULL) {
473 return NULL; 375 return NULL;
474 } 376 }
475 int length = strnlen(path.data, PATH_MAX); 377 int length = strnlen(path.AsString(), PATH_MAX);
476 result = static_cast<char*>(malloc(length + 1)); 378 result = static_cast<char*>(malloc(length + 1));
477 strncpy(result, path.data, length); 379 strncpy(result, path.AsString(), length);
478 result[length] = '\0'; 380 result[length] = '\0';
479 return result; 381 return result;
480 } 382 }
481 383
482 384
483 bool Directory::Delete(const char* dir_name, bool recursive) { 385 bool Directory::Delete(const char* dir_name, bool recursive) {
484 if (!recursive) { 386 if (!recursive) {
485 if (File::GetType(dir_name, false) == File::kIsLink && 387 if (File::GetType(dir_name, false) == File::kIsLink &&
486 File::GetType(dir_name, true) == File::kIsDirectory) { 388 File::GetType(dir_name, true) == File::kIsDirectory) {
487 return (TEMP_FAILURE_RETRY(unlink(dir_name)) == 0); 389 return (TEMP_FAILURE_RETRY(unlink(dir_name)) == 0);
(...skipping 12 matching lines...) Expand all
500 bool Directory::Rename(const char* path, const char* new_path) { 402 bool Directory::Rename(const char* path, const char* new_path) {
501 ExistsResult exists = Exists(path); 403 ExistsResult exists = Exists(path);
502 if (exists != EXISTS) return false; 404 if (exists != EXISTS) return false;
503 return (TEMP_FAILURE_RETRY(rename(path, new_path)) == 0); 405 return (TEMP_FAILURE_RETRY(rename(path, new_path)) == 0);
504 } 406 }
505 407
506 } // namespace bin 408 } // namespace bin
507 } // namespace dart 409 } // namespace dart
508 410
509 #endif // defined(TARGET_OS_LINUX) 411 #endif // defined(TARGET_OS_LINUX)
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698