Fix MacOS errors
This commit is contained in:
parent
2fa5d41ba3
commit
040657aec9
@ -7,6 +7,8 @@
|
|||||||
// Use of this source code is governed by a BSD-style license that can be
|
// Use of this source code is governed by a BSD-style license that can be
|
||||||
// found in the LICENSE file.
|
// found in the LICENSE file.
|
||||||
|
|
||||||
|
#define __STDC_FORMAT_MACROS
|
||||||
|
#include <inttypes.h>
|
||||||
#include <algorithm>
|
#include <algorithm>
|
||||||
#include <string>
|
#include <string>
|
||||||
#include <stdint.h>
|
#include <stdint.h>
|
||||||
@ -126,7 +128,7 @@ Status DBImpl::GetSortedWalFiles(VectorLogPtr& files) {
|
|||||||
uint64_t latest_archived_log_number = 0;
|
uint64_t latest_archived_log_number = 0;
|
||||||
if (!files.empty()) {
|
if (!files.empty()) {
|
||||||
latest_archived_log_number = files.back()->LogNumber();
|
latest_archived_log_number = files.back()->LogNumber();
|
||||||
Log(options_.info_log, "Latest Archived log: %lu",
|
Log(options_.info_log, "Latest Archived log: %" PRIu64,
|
||||||
latest_archived_log_number);
|
latest_archived_log_number);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -3,6 +3,8 @@
|
|||||||
// LICENSE file in the root directory of this source tree. An additional grant
|
// LICENSE file in the root directory of this source tree. An additional grant
|
||||||
// of patent rights can be found in the PATENTS file in the same directory.
|
// of patent rights can be found in the PATENTS file in the same directory.
|
||||||
|
|
||||||
|
#define __STDC_FORMAT_MACROS
|
||||||
|
#include <inttypes.h>
|
||||||
#include <algorithm>
|
#include <algorithm>
|
||||||
#include <gflags/gflags.h>
|
#include <gflags/gflags.h>
|
||||||
|
|
||||||
@ -134,7 +136,7 @@ TEST(DynamicBloomTest, perf) {
|
|||||||
|
|
||||||
for (uint64_t m = 1; m <= 8; ++m) {
|
for (uint64_t m = 1; m <= 8; ++m) {
|
||||||
const uint64_t num_keys = m * 8 * 1024 * 1024;
|
const uint64_t num_keys = m * 8 * 1024 * 1024;
|
||||||
fprintf(stderr, "testing %luM keys\n", m * 8);
|
fprintf(stderr, "testing %" PRIu64 "M keys\n", m * 8);
|
||||||
|
|
||||||
DynamicBloom std_bloom(num_keys * 10, 0, FLAGS_num_probes);
|
DynamicBloom std_bloom(num_keys * 10, 0, FLAGS_num_probes);
|
||||||
|
|
||||||
@ -144,7 +146,7 @@ TEST(DynamicBloomTest, perf) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
uint64_t elapsed = timer.ElapsedNanos();
|
uint64_t elapsed = timer.ElapsedNanos();
|
||||||
fprintf(stderr, "standard bloom, avg add latency %lu\n",
|
fprintf(stderr, "standard bloom, avg add latency %" PRIu64 "\n",
|
||||||
elapsed / num_keys);
|
elapsed / num_keys);
|
||||||
|
|
||||||
uint64_t count = 0;
|
uint64_t count = 0;
|
||||||
@ -155,7 +157,7 @@ TEST(DynamicBloomTest, perf) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
elapsed = timer.ElapsedNanos();
|
elapsed = timer.ElapsedNanos();
|
||||||
fprintf(stderr, "standard bloom, avg query latency %lu\n",
|
fprintf(stderr, "standard bloom, avg query latency %" PRIu64 "\n",
|
||||||
elapsed / count);
|
elapsed / count);
|
||||||
ASSERT_TRUE(count == num_keys);
|
ASSERT_TRUE(count == num_keys);
|
||||||
|
|
||||||
@ -169,7 +171,7 @@ TEST(DynamicBloomTest, perf) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
uint64_t elapsed = timer.ElapsedNanos();
|
uint64_t elapsed = timer.ElapsedNanos();
|
||||||
fprintf(stderr, "blocked bloom(%d), avg add latency %lu\n",
|
fprintf(stderr, "blocked bloom(%d), avg add latency %" PRIu64 "\n",
|
||||||
cl_per_block, elapsed / num_keys);
|
cl_per_block, elapsed / num_keys);
|
||||||
|
|
||||||
uint64_t count = 0;
|
uint64_t count = 0;
|
||||||
@ -182,7 +184,7 @@ TEST(DynamicBloomTest, perf) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
elapsed = timer.ElapsedNanos();
|
elapsed = timer.ElapsedNanos();
|
||||||
fprintf(stderr, "blocked bloom(%d), avg query latency %lu\n",
|
fprintf(stderr, "blocked bloom(%d), avg query latency %" PRIu64 "\n",
|
||||||
cl_per_block, elapsed / count);
|
cl_per_block, elapsed / count);
|
||||||
ASSERT_TRUE(count == num_keys);
|
ASSERT_TRUE(count == num_keys);
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user