Tim Mayberry
b02fb1dbea
I'm not sure how boost/regex.h is relevant but it doesn't enable the build to succeed in on Linux or using Mingw so if this is not an error and required for msvc build then fix it
151 lines
3.4 KiB
C++
151 lines
3.4 KiB
C++
/*
|
|
Copyright (C) 2013 Paul Davis
|
|
|
|
This program 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 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program 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 program; if not, write to the Free Software
|
|
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
*/
|
|
|
|
#include <vector>
|
|
#include <iostream>
|
|
#include <climits>
|
|
#include <cerrno>
|
|
#include <cstdlib>
|
|
|
|
#include <regex.h>
|
|
|
|
#include <glibmm/miscutils.h>
|
|
|
|
#include "pbd/pathexpand.h"
|
|
#include "pbd/strsplit.h"
|
|
|
|
using std::string;
|
|
using std::vector;
|
|
|
|
string
|
|
PBD::canonical_path (const std::string& path)
|
|
{
|
|
#ifdef COMPILER_MINGW
|
|
return path;
|
|
#else
|
|
char buf[PATH_MAX+1];
|
|
|
|
if (!realpath (path.c_str(), buf) && (errno != ENOENT)) {
|
|
return path;
|
|
}
|
|
|
|
return string (buf);
|
|
#endif
|
|
}
|
|
|
|
string
|
|
PBD::path_expand (string path)
|
|
{
|
|
if (path.empty()) {
|
|
return path;
|
|
}
|
|
|
|
/* tilde expansion */
|
|
|
|
if (path[0] == '~') {
|
|
if (path.length() == 1) {
|
|
return Glib::get_home_dir();
|
|
}
|
|
|
|
if (path[1] == '/') {
|
|
path.replace (0, 1, Glib::get_home_dir());
|
|
} else {
|
|
/* can't handle ~roger, so just leave it */
|
|
}
|
|
}
|
|
|
|
/* now do $VAR substitution, since wordexp isn't reliable */
|
|
|
|
regex_t compiled_pattern;
|
|
const int nmatches = 100;
|
|
regmatch_t matches[nmatches];
|
|
|
|
if (regcomp (&compiled_pattern, "\\$([a-zA-Z_][a-zA-Z0-9_]*|\\{[a-zA-Z_][a-zA-Z0-9_]*\\})", REG_EXTENDED)) {
|
|
std::cerr << "bad regcomp\n";
|
|
return path;
|
|
}
|
|
|
|
while (true) {
|
|
|
|
if (regexec (&compiled_pattern, path.c_str(), nmatches, matches, 0)) {
|
|
break;
|
|
}
|
|
|
|
/* matches[0] gives the entire match */
|
|
|
|
string match = path.substr (matches[0].rm_so, matches[0].rm_eo - matches[0].rm_so);
|
|
|
|
/* try to get match from the environment */
|
|
|
|
if (match[1] == '{') {
|
|
/* ${FOO} form */
|
|
match = match.substr (2, match.length() - 3);
|
|
}
|
|
|
|
char* matched_value = getenv (match.c_str());
|
|
|
|
if (matched_value) {
|
|
path.replace (matches[0].rm_so, matches[0].rm_eo - matches[0].rm_so, matched_value);
|
|
} else {
|
|
path.replace (matches[0].rm_so, matches[0].rm_eo - matches[0].rm_so, string());
|
|
}
|
|
|
|
/* go back and do it again with whatever remains after the
|
|
* substitution
|
|
*/
|
|
}
|
|
|
|
regfree (&compiled_pattern);
|
|
|
|
/* canonicalize */
|
|
|
|
return canonical_path (path);
|
|
}
|
|
|
|
string
|
|
PBD::search_path_expand (string path)
|
|
{
|
|
if (path.empty()) {
|
|
return path;
|
|
}
|
|
|
|
vector<string> s;
|
|
vector<string> n;
|
|
|
|
split (path, s, ':');
|
|
|
|
for (vector<string>::iterator i = s.begin(); i != s.end(); ++i) {
|
|
string exp = path_expand (*i);
|
|
if (!exp.empty()) {
|
|
n.push_back (exp);
|
|
}
|
|
}
|
|
|
|
string r;
|
|
|
|
for (vector<string>::iterator i = n.begin(); i != n.end(); ++i) {
|
|
if (!r.empty()) {
|
|
r += ':';
|
|
}
|
|
r += *i;
|
|
}
|
|
|
|
return r;
|
|
}
|