20 |
|
|
21 |
#include "Path.h" |
#include "Path.h" |
22 |
|
|
23 |
|
// for function hexsToNumber() |
24 |
|
#include "global_private.h" |
25 |
|
|
26 |
|
#include <sstream> |
27 |
|
|
28 |
namespace LinuxSampler { |
namespace LinuxSampler { |
29 |
|
|
30 |
|
Path::Path() : drive(0) { |
31 |
|
} |
32 |
|
|
33 |
void Path::appendNode(std::string Name) { |
void Path::appendNode(std::string Name) { |
34 |
if (!Name.size()) return; |
if (!Name.size()) return; |
35 |
elements.push_back(Name); |
elements.push_back(Name); |
36 |
} |
} |
37 |
|
|
38 |
std::string Path::toPosix() { |
void Path::setDrive(const char& Drive) { |
39 |
|
drive = Drive; |
40 |
|
} |
41 |
|
|
42 |
|
std::string Path::toPosix() const { |
43 |
// POSIX paths consist of forward slash separators and requires forward |
// POSIX paths consist of forward slash separators and requires forward |
44 |
// slashes in path and file names to be encoded as "%2f", the file names |
// slashes in path and file names to be encoded as "%2f", the file names |
45 |
// "." and ".." have special meanings |
// "." and ".." have special meanings |
65 |
return result; |
return result; |
66 |
} |
} |
67 |
|
|
68 |
|
std::string Path::toDbPath() const { |
69 |
|
std::string result; |
70 |
|
for (int iElement = 0; iElement < elements.size(); iElement++) { |
71 |
|
// replace all slashes with '\0' |
72 |
|
std::string e = elements[iElement]; |
73 |
|
for (int i = 0; i < e.length(); i++) { |
74 |
|
if (e.at(i) == '/') e.at(i) = '\0'; |
75 |
|
} |
76 |
|
// append encoded node to full encoded path |
77 |
|
result += "/" + e; |
78 |
|
} |
79 |
|
if (!result.size()) result = "/"; |
80 |
|
return result; |
81 |
|
} |
82 |
|
|
83 |
|
std::string Path::toLscp() const { |
84 |
|
std::string result; |
85 |
|
for (int iElement = 0; iElement < elements.size(); iElement++) { |
86 |
|
// replace "special characters" by LSCP escape sequences |
87 |
|
std::string e = elements[iElement]; |
88 |
|
for (int i = 0; i < e.length(); i++) { |
89 |
|
const char c = e.c_str()[i]; |
90 |
|
if ( |
91 |
|
!(c >= '0' && c <= '9') && |
92 |
|
!(c >= 'a' && c <= 'z') && |
93 |
|
!(c >= 'A' && c <= 'Z') && |
94 |
|
!(c == '!') && !(c == '#') && !(c == '$') && !(c == '%') && |
95 |
|
!(c == '&') && !(c == '(') && !(c == ')') && !(c == '*') && |
96 |
|
!(c == '+') && !(c == ',') && !(c == '-') && !(c == '.') && |
97 |
|
!(c == ':') && !(c == ';') && !(c == '<') && !(c == '=') && |
98 |
|
!(c == '>') && !(c == '?') && !(c == '@') && !(c == '[') && |
99 |
|
!(c == ']') && !(c == '^') && !(c == '_') && !(c == '`') && |
100 |
|
!(c == '{') && !(c == '|') && !(c == '}') && !(c == '~') |
101 |
|
) { |
102 |
|
// convert the "special" character into a "\xHH" LSCP escape sequence |
103 |
|
char buf[5]; |
104 |
|
snprintf(buf, sizeof(buf), "\\x%02x", static_cast<unsigned char>(c)); |
105 |
|
e.replace(i, 1, buf); |
106 |
|
i += 3; |
107 |
|
} |
108 |
|
} |
109 |
|
// append encoded node to full encoded path |
110 |
|
result += "/" + e; |
111 |
|
} |
112 |
|
if (!result.size()) result = "/"; |
113 |
|
return result; |
114 |
|
} |
115 |
|
|
116 |
|
std::string Path::toWindows() const { |
117 |
|
std::stringstream result; |
118 |
|
const char cDrive = |
119 |
|
((drive >= 'A' && drive <= 'Z') || (drive >= 'a' && drive <= 'z')) |
120 |
|
? drive : '?'; |
121 |
|
result << cDrive; |
122 |
|
result << ':'; |
123 |
|
for (int iElement = 0; iElement < elements.size(); iElement++) { |
124 |
|
// append encoded node to full encoded path |
125 |
|
result << "\\" << elements[iElement]; |
126 |
|
} |
127 |
|
return result.str(); |
128 |
|
} |
129 |
|
|
130 |
Path Path::operator+(const Path& p) { |
Path Path::operator+(const Path& p) { |
131 |
Path result = *this; |
Path result = *this; |
132 |
for (int i = 0; i < p.elements.size(); i++) |
for (int i = 0; i < p.elements.size(); i++) |
138 |
return *this + *p; |
return *this + *p; |
139 |
} |
} |
140 |
|
|
141 |
|
Path Path::fromPosix(std::string path) { |
142 |
|
Path result; |
143 |
|
// first split the nodes |
144 |
|
{ |
145 |
|
int nodeEnd; |
146 |
|
for ( |
147 |
|
int nodeBegin = path.find_first_not_of('/'); |
148 |
|
nodeBegin != std::string::npos; |
149 |
|
nodeBegin = path.find_first_not_of('/', nodeEnd) |
150 |
|
) { |
151 |
|
nodeEnd = path.find_first_of('/', nodeBegin); |
152 |
|
result.appendNode( |
153 |
|
(nodeEnd != std::string::npos) ? |
154 |
|
path.substr(nodeBegin, nodeEnd - nodeBegin) : |
155 |
|
path.substr(nodeBegin) |
156 |
|
); |
157 |
|
} |
158 |
|
} |
159 |
|
// resolve POSIX escape sequences in all nodes |
160 |
|
for (int iNode = 0; iNode < result.elements.size(); iNode++) { |
161 |
|
std::string& s = result.elements[iNode]; |
162 |
|
for (int pos = s.find('%'); pos < s.length(); pos = s.find('%', ++pos)) { |
163 |
|
if (pos+1 >= s.length()) { // unexpected character |
164 |
|
//TODO: we might want to throw an exception here, for now we simply replace the character by '?' |
165 |
|
s.replace(pos, 1, "?"); |
166 |
|
continue; |
167 |
|
} |
168 |
|
if (s.c_str()[pos+1] == '%') { |
169 |
|
s.replace(pos, 2, "%"); |
170 |
|
continue; |
171 |
|
} |
172 |
|
if (pos+2 >= s.length()) { |
173 |
|
//TODO: we might want to throw an exception here, for now we simply replace the character by '?' |
174 |
|
s.replace(pos, 2, "?"); |
175 |
|
continue; |
176 |
|
} |
177 |
|
// expecting a "%HH" sequence here, convert it into the respective character |
178 |
|
const std::string sHex = s.substr(pos+1, 2); |
179 |
|
char cAscii = hexsToNumber(sHex.c_str()[1], sHex.c_str()[0]); |
180 |
|
char pcAscii[] = { cAscii, 0 }; |
181 |
|
s.replace(pos, 3, pcAscii); |
182 |
|
} |
183 |
|
} |
184 |
|
return result; |
185 |
|
} |
186 |
|
|
187 |
|
Path Path::fromDbPath(std::string path) { |
188 |
|
Path result; |
189 |
|
// first split the nodes |
190 |
|
{ |
191 |
|
int nodeEnd; |
192 |
|
for ( |
193 |
|
int nodeBegin = path.find_first_not_of('/'); |
194 |
|
nodeBegin != std::string::npos; |
195 |
|
nodeBegin = path.find_first_not_of('/', nodeEnd) |
196 |
|
) { |
197 |
|
nodeEnd = path.find_first_of('/', nodeBegin); |
198 |
|
|
199 |
|
std::string s = (nodeEnd != std::string::npos) ? |
200 |
|
path.substr(nodeBegin, nodeEnd - nodeBegin) : |
201 |
|
path.substr(nodeBegin); |
202 |
|
|
203 |
|
for (int i = 0; i < s.length(); i++) if (s.at(i) == '\0') s.at(i) = '/'; |
204 |
|
result.appendNode(s); |
205 |
|
} |
206 |
|
} |
207 |
|
return result; |
208 |
|
} |
209 |
|
|
210 |
|
Path Path::fromWindows(std::string path) { |
211 |
|
Path result; |
212 |
|
|
213 |
|
int nodeEnd = 0; |
214 |
|
|
215 |
|
// first retrieve drive |
216 |
|
if (path.size() >= 2 && path.c_str()[1] == ':') { |
217 |
|
result.setDrive(path.c_str()[0]); |
218 |
|
nodeEnd = 2; |
219 |
|
} |
220 |
|
|
221 |
|
// split the nodes |
222 |
|
{ |
223 |
|
for ( |
224 |
|
int nodeBegin = path.find_first_not_of('\\', nodeEnd); |
225 |
|
nodeBegin != std::string::npos; |
226 |
|
nodeBegin = path.find_first_not_of('\\', nodeEnd) |
227 |
|
) { |
228 |
|
nodeEnd = path.find_first_of('\\', nodeBegin); |
229 |
|
result.appendNode( |
230 |
|
(nodeEnd != std::string::npos) ? |
231 |
|
path.substr(nodeBegin, nodeEnd - nodeBegin) : |
232 |
|
path.substr(nodeBegin) |
233 |
|
); |
234 |
|
} |
235 |
|
} |
236 |
|
|
237 |
|
return result; |
238 |
|
} |
239 |
|
|
240 |
} // namespace LinuxSampler |
} // namespace LinuxSampler |