2 * Copyright 2014 Facebook, Inc.
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
8 * http://www.apache.org/licenses/LICENSE-2.0
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.
17 #ifndef FOLLY_FILEUTIL_H_
18 #define FOLLY_FILEUTIL_H_
20 #include <folly/Conv.h>
21 #include <folly/Portability.h>
22 #include <folly/ScopeGuard.h>
27 #include <sys/types.h>
35 * Convenience wrappers around some commonly used system calls. The *NoInt
36 * wrappers retry on EINTR. The *Full wrappers retry on EINTR and also loop
37 * until all data is written. Note that *Full wrappers weaken the thread
38 * semantics of underlying system calls.
40 int openNoInt(const char* name, int flags, mode_t mode = 0666);
41 int closeNoInt(int fd);
43 int dup2NoInt(int oldfd, int newfd);
44 int fsyncNoInt(int fd);
45 int fdatasyncNoInt(int fd);
46 int ftruncateNoInt(int fd, off_t len);
47 int truncateNoInt(const char* path, off_t len);
48 int flockNoInt(int fd, int operation);
49 int shutdownNoInt(int fd, int how);
51 ssize_t readNoInt(int fd, void* buf, size_t n);
52 ssize_t preadNoInt(int fd, void* buf, size_t n, off_t offset);
53 ssize_t readvNoInt(int fd, const iovec* iov, int count);
55 ssize_t writeNoInt(int fd, const void* buf, size_t n);
56 ssize_t pwriteNoInt(int fd, const void* buf, size_t n, off_t offset);
57 ssize_t writevNoInt(int fd, const iovec* iov, int count);
60 * Wrapper around read() (and pread()) that, in addition to retrying on
61 * EINTR, will loop until all data is read.
63 * This wrapper is only useful for blocking file descriptors (for non-blocking
64 * file descriptors, you have to be prepared to deal with incomplete reads
65 * anyway), and only exists because POSIX allows read() to return an incomplete
66 * read if interrupted by a signal (instead of returning -1 and setting errno
69 * Note that this wrapper weakens the thread safety of read(): the file pointer
70 * is shared between threads, but the system call is atomic. If multiple
71 * threads are reading from a file at the same time, you don't know where your
72 * data came from in the file, but you do know that the returned bytes were
73 * contiguous. You can no longer make this assumption if using readFull().
74 * You should probably use pread() when reading from the same file descriptor
75 * from multiple threads simultaneously, anyway.
77 * Note that readvFull and preadvFull require iov to be non-const, unlike
78 * readv and preadv. The contents of iov after these functions return
81 ssize_t readFull(int fd, void* buf, size_t n);
82 ssize_t preadFull(int fd, void* buf, size_t n, off_t offset);
83 ssize_t readvFull(int fd, iovec* iov, int count);
85 ssize_t preadvFull(int fd, iovec* iov, int count, off_t offset);
89 * Similar to readFull and preadFull above, wrappers around write() and
90 * pwrite() that loop until all data is written.
92 * Generally, the write() / pwrite() system call may always write fewer bytes
93 * than requested, just like read(). In certain cases (such as when writing to
94 * a pipe), POSIX provides stronger guarantees, but not in the general case.
95 * For example, Linux (even on a 64-bit platform) won't write more than 2GB in
96 * one write() system call.
98 * Note that writevFull and pwritevFull require iov to be non-const, unlike
99 * writev and pwritev. The contents of iov after these functions return
102 ssize_t writeFull(int fd, const void* buf, size_t n);
103 ssize_t pwriteFull(int fd, const void* buf, size_t n, off_t offset);
104 ssize_t writevFull(int fd, iovec* iov, int count);
105 #if FOLLY_HAVE_PWRITEV
106 ssize_t pwritevFull(int fd, iovec* iov, int count, off_t offset);
110 * Read entire file (if num_bytes is defaulted) or no more than
111 * num_bytes (otherwise) into container *out. The container is assumed
112 * to be contiguous, with element size equal to 1, and offer size(),
113 * reserve(), and random access (e.g. std::vector<char>, std::string,
116 * Returns: true on success or false on failure. In the latter case
117 * errno will be set appropriately by the failing system primitive.
119 template <class Container>
120 bool readFile(const char* file_name, Container& out,
121 size_t num_bytes = std::numeric_limits<size_t>::max()) {
122 static_assert(sizeof(out[0]) == 1,
123 "readFile: only containers with byte-sized elements accepted");
126 const auto fd = openNoInt(file_name, O_RDONLY);
127 if (fd == -1) return false;
129 size_t soFar = 0; // amount of bytes successfully read
131 assert(out.size() >= soFar); // resize better doesn't throw
133 // Ignore errors when closing the file
139 if (fstat(fd, &buf) == -1) return false;
140 // Some files (notably under /proc and /sys on Linux) lie about
141 // their size, so treat the size advertised by fstat under advise
142 // but don't rely on it. In particular, if the size is zero, we
143 // should attempt to read stuff. If not zero, we'll attempt to read
145 constexpr size_t initialAlloc = 1024 * 4;
148 buf.st_size > 0 ? folly::to<size_t>(buf.st_size + 1) : initialAlloc,
151 while (soFar < out.size()) {
152 const auto actual = readFull(fd, &out[soFar], out.size() - soFar);
157 if (soFar < out.size()) {
161 // Ew, allocate more memory. Use exponential growth to avoid
162 // quadratic behavior. Cap size to num_bytes.
163 out.resize(std::min(out.size() * 3 / 2, num_bytes));
171 #endif /* FOLLY_FILEUTIL_H_ */