/*
- * Copyright 2012 Facebook, Inc.
+ * Copyright 2017 Facebook, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* limitations under the License.
*/
+#ifndef __STDC_FORMAT_MACROS
+#define __STDC_FORMAT_MACROS 1
+#endif
+
#include <cstdio>
+#include <cinttypes>
#include <string>
#include <glog/logging.h>
-#include <gflags/gflags.h>
-#include "folly/Format.h"
+#include <folly/Format.h>
+#include <folly/portability/GFlags.h>
-#include "folly/detail/FingerprintPolynomial.h"
+#include <folly/detail/FingerprintPolynomial.h>
using namespace folly;
using namespace folly::detail;
// whose coefficients are the bits of q.
for (int x = 0; x < 256; x++) {
FingerprintPolynomial<DEG> t;
- t.setHigh8Bits(x);
+ t.setHigh8Bits(uint8_t(x));
for (int i = 0; i < 8; i++) {
t.mulXkmod(8, poly);
t.write(&(table[i][x][0]));
"const uint64_t FingerprintTable<%d>::poly[%d] = {",
DEG+1, FingerprintPolynomial<DEG>::size()));
for (int j = 0; j < FingerprintPolynomial<DEG>::size(); j++) {
- CHECK_ERR(fprintf(file, "%s%luLU", j ? ", " : "", poly_val[j]));
+ CHECK_ERR(fprintf(file, "%s%" PRIu64 "LU", j ? ", " : "", poly_val[j]));
}
CHECK_ERR(fprintf(file, "};\n\n"));
for (int x = 0; x < 256; x++) {
CHECK_ERR(fprintf(file, " {"));
for (int j = 0; j < FingerprintPolynomial<DEG>::size(); j++) {
- CHECK_ERR(fprintf(file, "%s%luLU", (j ? ", " : ""), table[i][x][j]));
+ CHECK_ERR(fprintf(
+ file, "%s%" PRIu64 "LU", (j ? ", " : ""), table[i][x][j]));
}
CHECK_ERR(fprintf(file, "},\n"));
}
} // namespace
int main(int argc, char *argv[]) {
- google::ParseCommandLineFlags(&argc, &argv, true);
+ gflags::ParseCommandLineFlags(&argc, &argv, true);
google::InitGoogleLogging(argv[0]);
std::string name = folly::format("{}/{}", FLAGS_install_dir,
" * AUTOMATICALLY GENERATED. DO NOT EDIT.\n"
" */\n"
"\n"
- "#include \"folly/Fingerprint.h\"\n"
+ "#include <folly/Fingerprint.h>\n"
"\n"
"namespace folly {\n"
"namespace detail {\n"