#include <folly/Range.h>
-#include <folly/portability/Stdlib.h>
+#include <folly/portability/GTest.h>
+#include <folly/portability/Memory.h>
+#include <folly/portability/SysMman.h>
-#include <sys/mman.h>
#include <array>
#include <iterator>
#include <limits>
#include <vector>
#include <boost/range/concepts.hpp>
#include <boost/algorithm/string/trim.hpp>
-#include <gtest/gtest.h>
using namespace folly;
+using namespace folly::detail;
using namespace std;
static_assert(std::is_literal_type<StringPiece>::value, "");
EXPECT_THROW(a.subpiece(6), std::out_of_range);
}
-constexpr char helloArray[] = "hello";
-
TEST(StringPiece, Constexpr) {
+ constexpr const char* helloArray = "hello";
+
constexpr StringPiece hello1("hello");
EXPECT_EQ("hello", hello1);
+ static_assert(hello1.size() == 5, "hello size should be 5 at compile time");
constexpr StringPiece hello2(helloArray);
EXPECT_EQ("hello", hello2);
+ static_assert(hello2.size() == 5, "hello size should be 5 at compile time");
}
TEST(StringPiece, Prefix) {
const auto maxValue = std::numeric_limits<StringPiece::value_type>::max();
// make the size ~big to avoid any edge-case branches for tiny haystacks
const int haystackSize = 50;
- for (size_t i = minValue; i <= maxValue; i++) { // <=
+ for (int i = minValue; i <= maxValue; i++) { // <=
needles.push_back(i);
}
EXPECT_EQ(StringPiece::npos, this->find_first_byte_of("", needles));
- for (size_t i = minValue; i <= maxValue; i++) {
+ for (int i = minValue; i <= maxValue; i++) {
EXPECT_EQ(0, this->find_first_byte_of(string(haystackSize, i), needles));
}
needles.append("these are redundant characters");
EXPECT_EQ(StringPiece::npos, this->find_first_byte_of("", needles));
- for (size_t i = minValue; i <= maxValue; i++) {
+ for (int i = minValue; i <= maxValue; i++) {
EXPECT_EQ(0, this->find_first_byte_of(string(haystackSize, i), needles));
}
}
void createProtectedBuf(StringPiece& contents, char** buf) {
ASSERT_LE(contents.size(), kPageSize);
const size_t kSuccess = 0;
- if (kSuccess != posix_memalign((void**)buf, kPageSize, 4 * kPageSize)) {
+ char* pageAlignedBuf = (char*)aligned_malloc(2 * kPageSize, kPageSize);
+ if (pageAlignedBuf == nullptr) {
ASSERT_FALSE(true);
}
- mprotect(*buf + kPageSize, kPageSize, PROT_NONE);
+ // Protect the page after the first full page-aligned region of the
+ // malloc'ed buffer
+ mprotect(pageAlignedBuf + kPageSize, kPageSize, PROT_NONE);
size_t newBegin = kPageSize - contents.size();
- memcpy(*buf + newBegin, contents.data(), contents.size());
- contents.reset(*buf + newBegin, contents.size());
+ memcpy(pageAlignedBuf + newBegin, contents.data(), contents.size());
+ contents.reset(pageAlignedBuf + newBegin, contents.size());
+ *buf = pageAlignedBuf;
}
void freeProtectedBuf(char* buf) {
mprotect(buf + kPageSize, kPageSize, PROT_READ | PROT_WRITE);
- free(buf);
+ aligned_free(buf);
}
TYPED_TEST(NeedleFinderTest, NoSegFault) {
}
}
+// Similar to the begin() template functions, but instread of returing
+// an iterator, return a pointer to data.
+template <class Container>
+typename Container::value_type* dataPtr(Container& cont) {
+ // NOTE: &cont[0] is undefined if cont is empty (it creates a
+ // reference to nullptr - which is not dereferenced, but still UBSAN).
+ return cont.data();
+}
+template <class T, size_t N>
+constexpr T* dataPtr(T (&arr)[N]) noexcept {
+ return &arr[0];
+}
+
template<class C>
void testRangeFunc(C&& x, size_t n) {
const auto& cx = x;
Range<const int*> r2 = range(std::forward<C>(x));
Range<const int*> r3 = range(cx);
Range<const int*> r5 = range(std::move(cx));
- EXPECT_EQ(r1.begin(), &x[0]);
- EXPECT_EQ(r1.end(), &x[n]);
+ EXPECT_EQ(r1.begin(), dataPtr(x));
+ EXPECT_EQ(r1.end(), dataPtr(x) + n);
EXPECT_EQ(n, r1.size());
EXPECT_EQ(n, r2.size());
EXPECT_EQ(n, r3.size());
testRangeFunc(x, 3);
}
+// MSVC doesn't like it when you try to std::move C arrays:
+// https://developercommunity.visualstudio.com/content/problem/2441/
+#ifndef _MSC_VER
TEST(RangeFunc, CArray) {
int x[] {1, 2, 3, 4};
testRangeFunc(x, 4);
}
+#endif
+
+TEST(RangeFunc, ConstexprCArray) {
+ static constexpr const int numArray[4] = {3, 17, 1, 9};
+ constexpr const auto numArrayRange = range(numArray);
+ EXPECT_EQ(17, numArrayRange[1]);
+ constexpr const auto numArrayRangeSize = numArrayRange.size();
+ EXPECT_EQ(4, numArrayRangeSize);
+}
+
+TEST(RangeFunc, ConstexprStdArray) {
+ static constexpr const std::array<int, 4> numArray = {3, 17, 1, 9};
+ constexpr const auto numArrayRange = range(numArray);
+ EXPECT_EQ(17, numArrayRange[1]);
+ constexpr const auto numArrayRangeSize = numArrayRange.size();
+ EXPECT_EQ(4, numArrayRangeSize);
+}
+
+TEST(RangeFunc, ConstexprStdArrayZero) {
+ static constexpr const std::array<int, 0> numArray = {};
+ constexpr const auto numArrayRange = range(numArray);
+ constexpr const auto numArrayRangeSize = numArrayRange.size();
+ EXPECT_EQ(0, numArrayRangeSize);
+}
+
+TEST(RangeFunc, ConstexprIteratorPair) {
+ static constexpr const int numArray[4] = {3, 17, 1, 9};
+ constexpr const auto numPtr = static_cast<const int*>(numArray);
+ constexpr const auto numIterRange = range(numPtr + 1, numPtr + 3);
+ EXPECT_EQ(1, numIterRange[1]);
+ constexpr const auto numIterRangeSize = numIterRange.size();
+ EXPECT_EQ(2, numIterRangeSize);
+}
+
+TEST(RangeFunc, ConstexprCollection) {
+ class IntCollection {
+ public:
+ constexpr IntCollection(const int* d, size_t s) : data_(d), size_(s) {}
+ constexpr const int* data() const {
+ return data_;
+ }
+ constexpr size_t size() const {
+ return size_;
+ }
+
+ private:
+ const int* data_;
+ size_t size_;
+ };
+ static constexpr const int numArray[4] = {3, 17, 1, 9};
+ constexpr const auto numPtr = static_cast<const int*>(numArray);
+ constexpr const auto numColl = IntCollection(numPtr + 1, 2);
+ constexpr const auto numCollRange = range(numColl);
+ EXPECT_EQ(1, numCollRange[1]);
+ constexpr const auto numCollRangeSize = numCollRange.size();
+ EXPECT_EQ(2, numCollRangeSize);
+}
std::string get_rand_str(size_t size,
std::uniform_int_distribution<>& dist,
projects / folly.git / blobdiff