mirror of https://github.com/oxen-io/lokinet
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
82 lines
2.1 KiB
C++
82 lines
2.1 KiB
C++
/* Copyright (c) 2016, Pollard Banknote Limited
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without modification,
|
|
are permitted provided that the following conditions are met:
|
|
|
|
1. Redistributions of source code must retain the above copyright notice, this
|
|
list of conditions and the following disclaimer.
|
|
|
|
2. Redistributions in binary form must reproduce the above copyright notice,
|
|
this list of conditions and the following disclaimer in the documentation and/or
|
|
other materials provided with the distribution.
|
|
|
|
3. Neither the name of the copyright holder nor the names of its contributors
|
|
may be used to endorse or promote products derived from this software without
|
|
specific prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
#include "current_path.h"
|
|
|
|
#include <cerrno>
|
|
|
|
#include <unistd.h>
|
|
|
|
namespace cpp17
|
|
{
|
|
namespace filesystem
|
|
{
|
|
path current_path()
|
|
{
|
|
char buf[4096];
|
|
|
|
if ( ::getcwd( buf, sizeof( buf ) ) )
|
|
{
|
|
return buf;
|
|
}
|
|
|
|
// Dynamically allocate larger buffers until cwd fits
|
|
std::size_t size = 2 * sizeof( buf );
|
|
|
|
while ( true )
|
|
{
|
|
char* q = new char[size];
|
|
|
|
if ( ::getcwd(q, size) )
|
|
{
|
|
path p = q;
|
|
delete[] q;
|
|
|
|
return p;
|
|
}
|
|
else
|
|
{
|
|
if ( errno == ERANGE )
|
|
{
|
|
delete[] q;
|
|
size *= 2;
|
|
}
|
|
else
|
|
{
|
|
delete[] q;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
return path();
|
|
}
|
|
|
|
}
|
|
}
|