mirror of
https://github.com/Zygo/bees.git
synced 2025-05-17 21:35:45 +02:00
trivial: mass purge of whitespace errors
Signed-off-by: Zygo Blaxell <bees@furryterror.org>
This commit is contained in:
parent
22e601912e
commit
e8eaa7e471
@ -130,7 +130,7 @@
|
|||||||
};
|
};
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#ifndef BTRFS_IOC_CLONE_RANGE
|
#ifndef BTRFS_IOC_CLONE_RANGE
|
||||||
|
|
||||||
struct btrfs_ioctl_clone_range_args {
|
struct btrfs_ioctl_clone_range_args {
|
||||||
|
@ -77,7 +77,7 @@ namespace crucible {
|
|||||||
void
|
void
|
||||||
TimeQueue<Task>::push(const Task &task, double delay)
|
TimeQueue<Task>::push(const Task &task, double delay)
|
||||||
{
|
{
|
||||||
Timestamp time = chrono::high_resolution_clock::now() +
|
Timestamp time = chrono::high_resolution_clock::now() +
|
||||||
chrono::duration_cast<chrono::high_resolution_clock::duration>(chrono::duration<double>(delay));
|
chrono::duration_cast<chrono::high_resolution_clock::duration>(chrono::duration<double>(delay));
|
||||||
unique_lock<mutex> lock(m_mutex);
|
unique_lock<mutex> lock(m_mutex);
|
||||||
while (m_set.size() > m_max_queue_depth) {
|
while (m_set.size() > m_max_queue_depth) {
|
||||||
@ -91,7 +91,7 @@ namespace crucible {
|
|||||||
void
|
void
|
||||||
TimeQueue<Task>::push_nowait(const Task &task, double delay)
|
TimeQueue<Task>::push_nowait(const Task &task, double delay)
|
||||||
{
|
{
|
||||||
Timestamp time = chrono::high_resolution_clock::now() +
|
Timestamp time = chrono::high_resolution_clock::now() +
|
||||||
chrono::duration_cast<chrono::high_resolution_clock::duration>(chrono::duration<double>(delay));
|
chrono::duration_cast<chrono::high_resolution_clock::duration>(chrono::duration<double>(delay));
|
||||||
unique_lock<mutex> lock(m_mutex);
|
unique_lock<mutex> lock(m_mutex);
|
||||||
m_set.insert(Item(time, task));
|
m_set.insert(Item(time, task));
|
||||||
|
@ -913,7 +913,7 @@ namespace crucible {
|
|||||||
ostream &
|
ostream &
|
||||||
operator<<(ostream &os, const BtrfsIoctlSearchHeader &hdr)
|
operator<<(ostream &os, const BtrfsIoctlSearchHeader &hdr)
|
||||||
{
|
{
|
||||||
os << "BtrfsIoctlSearchHeader { "
|
os << "BtrfsIoctlSearchHeader { "
|
||||||
<< static_cast<const btrfs_ioctl_search_header &>(hdr)
|
<< static_cast<const btrfs_ioctl_search_header &>(hdr)
|
||||||
<< ", data = ";
|
<< ", data = ";
|
||||||
hexdump(os, hdr.m_data);
|
hexdump(os, hdr.m_data);
|
||||||
@ -923,7 +923,7 @@ namespace crucible {
|
|||||||
ostream &
|
ostream &
|
||||||
operator<<(ostream &os, const BtrfsIoctlSearchKey &key)
|
operator<<(ostream &os, const BtrfsIoctlSearchKey &key)
|
||||||
{
|
{
|
||||||
os << "BtrfsIoctlSearchKey { "
|
os << "BtrfsIoctlSearchKey { "
|
||||||
<< static_cast<const btrfs_ioctl_search_key &>(key)
|
<< static_cast<const btrfs_ioctl_search_key &>(key)
|
||||||
<< ", buf_size = " << key.m_buf_size
|
<< ", buf_size = " << key.m_buf_size
|
||||||
<< ", buf[" << key.m_result.size() << "] = {";
|
<< ", buf[" << key.m_result.size() << "] = {";
|
||||||
|
@ -262,8 +262,8 @@ BeesHashTable::prefetch_loop()
|
|||||||
graph_blob << "Uptime: " << m_ctx->total_timer().age() << " seconds\n";
|
graph_blob << "Uptime: " << m_ctx->total_timer().age() << " seconds\n";
|
||||||
graph_blob << "Version: " << BEES_VERSION << "\n";
|
graph_blob << "Version: " << BEES_VERSION << "\n";
|
||||||
|
|
||||||
graph_blob
|
graph_blob
|
||||||
<< "\nHash table page occupancy histogram (" << occupied_count << "/" << total_count << " cells occupied, " << (occupied_count * 100 / total_count) << "%)\n"
|
<< "\nHash table page occupancy histogram (" << occupied_count << "/" << total_count << " cells occupied, " << (occupied_count * 100 / total_count) << "%)\n"
|
||||||
<< out.str() << "0% | 25% | 50% | 75% | 100% page fill\n"
|
<< out.str() << "0% | 25% | 50% | 75% | 100% page fill\n"
|
||||||
<< "compressed " << compressed_count << " (" << percent(compressed_count, occupied_count) << ")"
|
<< "compressed " << compressed_count << " (" << percent(compressed_count, occupied_count) << ")"
|
||||||
<< " new-style " << compressed_offset_count << " (" << percent(compressed_offset_count, occupied_count) << ")"
|
<< " new-style " << compressed_offset_count << " (" << percent(compressed_offset_count, occupied_count) << ")"
|
||||||
|
@ -105,7 +105,7 @@ BeesResolver::adjust_offset(const BeesFileRange &haystack, const BeesBlockData &
|
|||||||
bool is_legacy = false;
|
bool is_legacy = false;
|
||||||
if (m_addr.is_compressed()) {
|
if (m_addr.is_compressed()) {
|
||||||
BtrfsExtentWalker ew(haystack.fd(), haystack.begin(), m_ctx->root_fd());
|
BtrfsExtentWalker ew(haystack.fd(), haystack.begin(), m_ctx->root_fd());
|
||||||
BEESTRACE("haystack extent data " << ew);
|
BEESTRACE("haystack extent data " << ew);
|
||||||
Extent e = ew.current();
|
Extent e = ew.current();
|
||||||
if (m_addr.has_compressed_offset()) {
|
if (m_addr.has_compressed_offset()) {
|
||||||
off_t coff = m_addr.get_compressed_offset();
|
off_t coff = m_addr.get_compressed_offset();
|
||||||
|
@ -462,7 +462,7 @@ BeesTempFile::BeesTempFile(shared_ptr<BeesContext> ctx) :
|
|||||||
|
|
||||||
void
|
void
|
||||||
BeesTempFile::realign()
|
BeesTempFile::realign()
|
||||||
{
|
{
|
||||||
if (m_end_offset > BLOCK_SIZE_MAX_TEMP_FILE) {
|
if (m_end_offset > BLOCK_SIZE_MAX_TEMP_FILE) {
|
||||||
BEESLOG("temporary file size " << to_hex(m_end_offset) << " > max " << BLOCK_SIZE_MAX_TEMP_FILE);
|
BEESLOG("temporary file size " << to_hex(m_end_offset) << " > max " << BLOCK_SIZE_MAX_TEMP_FILE);
|
||||||
BEESCOUNT(tmp_trunc);
|
BEESCOUNT(tmp_trunc);
|
||||||
|
@ -607,7 +607,7 @@ friend ostream & operator<<(ostream &os, const BeesRangePair &brp);
|
|||||||
};
|
};
|
||||||
|
|
||||||
class BeesWorkQueueBase {
|
class BeesWorkQueueBase {
|
||||||
string m_name;
|
string m_name;
|
||||||
|
|
||||||
protected:
|
protected:
|
||||||
static mutex s_mutex;
|
static mutex s_mutex;
|
||||||
@ -622,7 +622,7 @@ public:
|
|||||||
|
|
||||||
virtual size_t active_size() const = 0;
|
virtual size_t active_size() const = 0;
|
||||||
virtual list<string> peek_active(size_t count) const = 0;
|
virtual list<string> peek_active(size_t count) const = 0;
|
||||||
|
|
||||||
static void for_each_work_queue(function<void(BeesWorkQueueBase *)> f);
|
static void for_each_work_queue(function<void(BeesWorkQueueBase *)> f);
|
||||||
};
|
};
|
||||||
|
|
||||||
|
@ -21,7 +21,7 @@ LDFLAGS = -L../lib -Wl,-rpath=$(shell realpath ../lib)
|
|||||||
depends.mk: *.cc
|
depends.mk: *.cc
|
||||||
for x in *.cc; do $(CXX) $(CXXFLAGS) -M "$$x"; done >> depends.mk.new
|
for x in *.cc; do $(CXX) $(CXXFLAGS) -M "$$x"; done >> depends.mk.new
|
||||||
mv -fv depends.mk.new depends.mk
|
mv -fv depends.mk.new depends.mk
|
||||||
|
|
||||||
-include depends.mk
|
-include depends.mk
|
||||||
|
|
||||||
%.o: %.cc %.h ../makeflags
|
%.o: %.cc %.h ../makeflags
|
||||||
|
Loading…
x
Reference in New Issue
Block a user