mirror of git://gcc.gnu.org/git/gcc.git
109 lines
2.7 KiB
C++
109 lines
2.7 KiB
C++
// Copyright (C) 2016-2019 Free Software Foundation, Inc.
|
|
//
|
|
// This file is part of the GNU ISO C++ Library. This library is free
|
|
// software; you can redistribute it and/or modify it under the
|
|
// terms of the GNU General Public License as published by the
|
|
// Free Software Foundation; either version 3, or (at your option)
|
|
// any later version.
|
|
|
|
// This library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License along
|
|
// with this library; see the file COPYING3. If not see
|
|
// <http://www.gnu.org/licenses/>.
|
|
|
|
// { dg-options "-DUSE_FILESYSTEM_TS -lstdc++fs" }
|
|
// { dg-do run { target c++11 } }
|
|
// { dg-require-filesystem-ts "" }
|
|
|
|
#include <experimental/filesystem>
|
|
#include <testsuite_hooks.h>
|
|
#include <testsuite_fs.h>
|
|
|
|
namespace fs = std::experimental::filesystem;
|
|
|
|
void
|
|
test01()
|
|
{
|
|
std::error_code ec;
|
|
fs::recursive_directory_iterator dir;
|
|
dir.pop(ec); // This is undefined, but our implementation
|
|
VERIFY( ec ); // checks and returns an error.
|
|
VERIFY( dir == end(dir) );
|
|
|
|
std::error_code ec2;
|
|
try
|
|
{
|
|
dir.pop();
|
|
}
|
|
catch (const fs::filesystem_error& ex)
|
|
{
|
|
ec2 = ex.code();
|
|
}
|
|
VERIFY( ec2 == ec );
|
|
}
|
|
|
|
void
|
|
test02()
|
|
{
|
|
std::error_code ec = make_error_code(std::errc::interrupted);
|
|
const auto p = __gnu_test::nonexistent_path();
|
|
create_directories(p / "d1/d2/d3");
|
|
for (int i = 0; i < 3; ++i)
|
|
{
|
|
fs::recursive_directory_iterator dir(p);
|
|
std::advance(dir, i);
|
|
VERIFY( dir.depth() == i );
|
|
dir.pop(ec);
|
|
VERIFY( !ec );
|
|
VERIFY( dir == end(dir) );
|
|
|
|
dir = fs::recursive_directory_iterator(p);
|
|
std::advance(dir, i);
|
|
VERIFY( dir.depth() == i );
|
|
dir.pop();
|
|
VERIFY( dir == end(dir) );
|
|
}
|
|
remove_all(p, ec);
|
|
}
|
|
|
|
void
|
|
test03()
|
|
{
|
|
std::error_code ec = make_error_code(std::errc::interrupted);
|
|
const auto p = __gnu_test::nonexistent_path();
|
|
create_directories(p / "d1/d2/d3");
|
|
create_directories(p / "d1/d2/e3");
|
|
create_directories(p / "d1/e2/d3");
|
|
for (int i = 0; i < 3; ++i)
|
|
{
|
|
fs::recursive_directory_iterator dir(p);
|
|
std::advance(dir, i);
|
|
int expected_depth = i;
|
|
VERIFY( dir.depth() == expected_depth );
|
|
dir.pop(ec);
|
|
VERIFY( !ec );
|
|
if (dir != end(dir))
|
|
VERIFY( dir.depth() == (expected_depth - 1) );
|
|
|
|
dir = fs::recursive_directory_iterator(p);
|
|
std::advance(dir, i);
|
|
VERIFY( dir.depth() == i );
|
|
dir.pop();
|
|
if (dir != end(dir))
|
|
VERIFY( dir.depth() == (i -1) );
|
|
}
|
|
remove_all(p, ec);
|
|
}
|
|
|
|
int
|
|
main()
|
|
{
|
|
test01();
|
|
test02();
|
|
test03();
|
|
}
|