*/
#include <cerrno>
+#include <cstdio>
#include <msp/core/except.h>
#ifndef WIN32
#include <fnmatch.h>
#include <msp/strings/utils.h>
#include "dir.h"
#include "path.h"
+#include "stat.h"
#include "utils.h"
using namespace std;
namespace Msp {
namespace FS {
-/**
-Fixes the case of the given path to match files / directories on the
-filesystem. Intended to be used in programs that need to interact with
-emulated Windows programs.
-*/
+string basename(const Path &p)
+{
+ return p[-1];
+}
+
+Path dirname(const Path &p)
+{
+ if(p.size()==1)
+ {
+ if(p.is_absolute())
+ return p;
+ return ".";
+ }
+ return p.subpath(0, p.size()-1);
+}
+
+string basepart(const string &fn)
+{
+ unsigned dot = fn.rfind('.');
+ return fn.substr(0, dot);
+}
+
+string extpart(const string &fn)
+{
+ string::size_type dot = fn.rfind('.');
+ if(dot==string::npos)
+ return string();
+ return fn.substr(dot);
+}
+
Path fix_case(const Path &path)
{
- bool found=true;
+ bool found = true;
Path result;
for(Path::Iterator i=path.begin(); i!=path.end(); ++i)
{
if(!found || *i=="/")
- result/=*i;
+ result /= *i;
else
{
list<string> files;
if(result.size())
- files=list_files(result);
+ files = list_files(result);
else
- files=list_files(".");
+ files = list_files(".");
- found=false;
+ found = false;
for(list<string>::iterator j=files.begin(); (j!=files.end() && !found); ++j)
if(!strcasecmp(*j,*i))
{
- result/=*j;
- found=true;
+ result /= *j;
+ found = true;
}
if(!found)
- result/=*i;
+ result /= *i;
}
}
return result;
}
-void unlink(const Path &path)
-{
- if(::unlink(path.str().c_str())==-1)
- throw SystemError("unlink failed", errno);
-}
-
-Filename splitext(const string &fn)
+Path readlink(const Path &link)
{
- Filename result;
- unsigned dot=fn.rfind('.');
- result.base=fn.substr(0, dot);
- if(dot!=string::npos)
- result.ext=fn.substr(dot);
- return result;
+#ifdef WIN32
+ (void)link;
+ throw Exception("No symbolic links on win32");
+#else
+ char buf[4096];
+ int len = ::readlink(link.str().c_str(), buf, sizeof(buf));
+ if(len==-1)
+ throw SystemError("readlink failed", errno);
+ return string(buf, len);
+#endif
}
-int fnmatch(const string &pat, const Path &fn)
+Path realpath(const Path &path)
{
#ifdef WIN32
- return globcasematch(pat, fn.str());
+ if(path.is_absolute())
+ return path;
+ else
+ return getcwd()/path;
#else
- return ::fnmatch(pat.c_str(), fn.str().c_str(), FNM_PATHNAME);
+ list<string> queue(path.begin(), path.end());
+ if(!path.is_absolute())
+ {
+ Path cwd = getcwd();
+ queue.insert(queue.begin(), cwd.begin(), cwd.end());
+ }
+
+ Path real;
+ unsigned n_links = 0;
+ while(!queue.empty())
+ {
+ Path next = real/queue.front();
+ queue.pop_front();
+
+ struct stat st = lstat(next);
+ if(S_ISLNK(st.st_mode))
+ {
+ if(++n_links>64)
+ throw Exception("Ludicrous amount of symlinks detected in realpath, giving up");
+ Path link = readlink(next);
+ queue.insert(queue.begin(), link.begin(), link.end());
+ }
+ else
+ real = next;
+ }
+
+ return real;
#endif
}
+void rename(const Path &from, const Path &to)
+{
+ if(::rename(from.str().c_str(), to.str().c_str())==-1)
+ throw SystemError("rename failed", errno);
+}
+
+void unlink(const Path &path)
+{
+ if(::unlink(path.str().c_str())==-1)
+ throw SystemError("unlink failed", errno);
+}
+
Path relative(const Path &path, const Path &base)
{
- Path::Iterator i=path.begin();
- Path::Iterator j=base.begin();
+ Path::Iterator i = path.begin();
+ Path::Iterator j = base.begin();
for(; (i!=path.end() && j!=base.end() && *i==*j); ++i, ++j) ;
Path result;
for(; j!=base.end(); ++j)
- result/="..";
+ result /= "..";
for(; i!=path.end(); ++i)
- result/=*i;
+ result /= *i;
return result;
}
-/**
-Extracts the basename from the given path. Same thing as Path::Path(p)[-1],
-but faster.
-*/
-string basename(const std::string &p)
+int descendant_depth(const Path &path, const Path &parent)
{
- unsigned slash=p.rfind(DIRCHAR);
- if(slash==string::npos)
- return p;
- else
- return p.substr(slash+1);
+ Path::Iterator i = path.begin();
+ Path::Iterator j = parent.begin();
+ for(; (i!=path.end() && j!=parent.end() && *i==*j); ++i, ++j) ;
+
+ if(j!=parent.end())
+ return -1;
+
+ int result = 0;
+ for(; i!=path.end(); ++i)
+ ++result;
+
+ return result;
}
} // namespace FS