mirror of
https://github.com/llvm-mirror/libcxx.git
synced 2025-10-22 16:37:40 +08:00
880e38b206
This patch fixes the following bugs, all of which were discovered while testing a 32 bit build on a 64 bit machine. * path.itr/iterator.pass.cpp has undefined behavior. 'path::iterator' stashes the value of the element inside the iterator. This violates the BiDirIterator requirements but is allowed for path::iterator. However this means that using reverse_iterator<path::iterator> has undefined behavior because it assumes that 'Iter tmp = it; return *tmp' will not create a dangling reference. However it does, and this caused this particular test to fail. * path.native.obs/string_alloc.pass.cpp tested the SSO with a long string. On 32 bit builds std::wstring only has the SSO for strings of size 2. The test was using a string of size 4. * fs.op.space/space.pass.cpp had overflows while calculating the expected values. The fix here is to convert the statvfs data members to std::uintmax_t before multiplying them. The internal implementation already does this but the tests needed to do it as well. git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@273078 91177308-0d34-0410-b5e6-96231b3b80d8
107 lines
3.1 KiB
C++
107 lines
3.1 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// UNSUPPORTED: c++98, c++03
|
|
|
|
// <experimental/filesystem>
|
|
|
|
// class path
|
|
|
|
// template <class Source>
|
|
// path(const Source& source);
|
|
// template <class InputIterator>
|
|
// path(InputIterator first, InputIterator last);
|
|
|
|
|
|
#include <experimental/filesystem>
|
|
#include <iterator>
|
|
#include <type_traits>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
#include "filesystem_test_helper.hpp"
|
|
|
|
namespace fs = std::experimental::filesystem;
|
|
|
|
|
|
template <class It>
|
|
std::reverse_iterator<It> mkRev(It it) {
|
|
return std::reverse_iterator<It>(it);
|
|
}
|
|
|
|
void checkIteratorConcepts() {
|
|
using namespace fs;
|
|
using It = path::iterator;
|
|
using Traits = std::iterator_traits<It>;
|
|
ASSERT_SAME_TYPE(Traits::iterator_category, std::bidirectional_iterator_tag);
|
|
ASSERT_SAME_TYPE(Traits::value_type, path);
|
|
ASSERT_SAME_TYPE(Traits::pointer, path const*);
|
|
ASSERT_SAME_TYPE(Traits::reference, path const&);
|
|
{
|
|
It it;
|
|
ASSERT_SAME_TYPE(It&, decltype(++it));
|
|
ASSERT_SAME_TYPE(It, decltype(it++));
|
|
ASSERT_SAME_TYPE(It&, decltype(--it));
|
|
ASSERT_SAME_TYPE(It, decltype(it--));
|
|
ASSERT_SAME_TYPE(Traits::reference, decltype(*it));
|
|
ASSERT_SAME_TYPE(Traits::pointer, decltype(it.operator->()));
|
|
ASSERT_SAME_TYPE(std::string const&, decltype(it->native()));
|
|
ASSERT_SAME_TYPE(bool, decltype(it == it));
|
|
ASSERT_SAME_TYPE(bool, decltype(it != it));
|
|
}
|
|
{
|
|
path const p;
|
|
ASSERT_SAME_TYPE(It, decltype(p.begin()));
|
|
ASSERT_SAME_TYPE(It, decltype(p.end()));
|
|
assert(p.begin() == p.end());
|
|
}
|
|
}
|
|
|
|
void checkBeginEndBasic() {
|
|
using namespace fs;
|
|
using It = path::iterator;
|
|
{
|
|
path const p;
|
|
ASSERT_SAME_TYPE(It, decltype(p.begin()));
|
|
ASSERT_SAME_TYPE(It, decltype(p.end()));
|
|
assert(p.begin() == p.end());
|
|
}
|
|
{
|
|
path const p("foo");
|
|
It default_constructed;
|
|
default_constructed = p.begin();
|
|
assert(default_constructed == p.begin());
|
|
assert(default_constructed != p.end());
|
|
default_constructed = p.end();
|
|
assert(default_constructed == p.end());
|
|
assert(default_constructed != p.begin());
|
|
}
|
|
{
|
|
path p("//root_name//first_dir////second_dir");
|
|
const path expect[] = {"//root_name", "/", "first_dir", "second_dir"};
|
|
assert(checkCollectionsEqual(p.begin(), p.end(), std::begin(expect), std::end(expect)));
|
|
assert(checkCollectionsEqualBackwards(p.begin(), p.end(), std::begin(expect), std::end(expect)));
|
|
|
|
}
|
|
{
|
|
path p("////foo/bar/baz///");
|
|
const path expect[] = {"/", "foo", "bar", "baz", "."};
|
|
assert(checkCollectionsEqual(p.begin(), p.end(), std::begin(expect), std::end(expect)));
|
|
assert(checkCollectionsEqualBackwards(p.begin(), p.end(), std::begin(expect), std::end(expect)));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
int main() {
|
|
using namespace fs;
|
|
checkIteratorConcepts();
|
|
checkBeginEndBasic(); // See path.decompose.pass.cpp for more tests.
|
|
}
|