1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
// Copyright 2012 Google Inc. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include "includes_normalize.h"
#include "string_piece.h"
#include "string_piece_util.h"
#include "util.h"
#include <algorithm>
#include <iterator>
#include <sstream>
#include <windows.h>
namespace {
bool IsPathSeparator(char c) {
return c == '/' || c == '\\';
}
// Return true if paths a and b are on the same windows drive.
// Return false if this funcation cannot check
// whether or not on the same windows drive.
bool SameDriveFast(StringPiece a, StringPiece b) {
if (a.size() < 3 || b.size() < 3) {
return false;
}
if (!islatinalpha(a[0]) || !islatinalpha(b[0])) {
return false;
}
if (ToLowerASCII(a[0]) != ToLowerASCII(b[0])) {
return false;
}
if (a[1] != ':' || b[1] != ':') {
return false;
}
return IsPathSeparator(a[2]) && IsPathSeparator(b[2]);
}
// Return true if paths a and b are on the same Windows drive.
bool SameDrive(StringPiece a, StringPiece b) {
if (SameDriveFast(a, b)) {
return true;
}
char a_absolute[_MAX_PATH];
char b_absolute[_MAX_PATH];
GetFullPathName(a.AsString().c_str(), sizeof(a_absolute), a_absolute, NULL);
GetFullPathName(b.AsString().c_str(), sizeof(b_absolute), b_absolute, NULL);
char a_drive[_MAX_DIR];
char b_drive[_MAX_DIR];
_splitpath(a_absolute, a_drive, NULL, NULL, NULL);
_splitpath(b_absolute, b_drive, NULL, NULL, NULL);
return _stricmp(a_drive, b_drive) == 0;
}
// Check path |s| is FullPath style returned by GetFullPathName.
// This ignores difference of path separator.
// This is used not to call very slow GetFullPathName API.
bool IsFullPathName(StringPiece s) {
if (s.size() < 3 ||
!islatinalpha(s[0]) ||
s[1] != ':' ||
!IsPathSeparator(s[2])) {
return false;
}
// Check "." or ".." is contained in path.
for (size_t i = 2; i < s.size(); ++i) {
if (!IsPathSeparator(s[i])) {
continue;
}
// Check ".".
if (i + 1 < s.size() && s[i+1] == '.' &&
(i + 2 >= s.size() || IsPathSeparator(s[i+2]))) {
return false;
}
// Check "..".
if (i + 2 < s.size() && s[i+1] == '.' && s[i+2] == '.' &&
(i + 3 >= s.size() || IsPathSeparator(s[i+3]))) {
return false;
}
}
return true;
}
} // anonymous namespace
IncludesNormalize::IncludesNormalize(const string& relative_to) {
relative_to_ = AbsPath(relative_to);
split_relative_to_ = SplitStringPiece(relative_to_, '/');
}
string IncludesNormalize::AbsPath(StringPiece s) {
if (IsFullPathName(s)) {
string result = s.AsString();
for (size_t i = 0; i < result.size(); ++i) {
if (result[i] == '\\') {
result[i] = '/';
}
}
return result;
}
char result[_MAX_PATH];
GetFullPathName(s.AsString().c_str(), sizeof(result), result, NULL);
for (char* c = result; *c; ++c)
if (*c == '\\')
*c = '/';
return result;
}
string IncludesNormalize::Relativize(
StringPiece path, const vector<StringPiece>& start_list) {
string abs_path = AbsPath(path);
vector<StringPiece> path_list = SplitStringPiece(abs_path, '/');
int i;
for (i = 0; i < static_cast<int>(min(start_list.size(), path_list.size()));
++i) {
if (!EqualsCaseInsensitiveASCII(start_list[i], path_list[i])) {
break;
}
}
vector<StringPiece> rel_list;
rel_list.reserve(start_list.size() - i + path_list.size() - i);
for (int j = 0; j < static_cast<int>(start_list.size() - i); ++j)
rel_list.push_back("..");
for (int j = i; j < static_cast<int>(path_list.size()); ++j)
rel_list.push_back(path_list[j]);
if (rel_list.size() == 0)
return ".";
return JoinStringPiece(rel_list, '/');
}
bool IncludesNormalize::Normalize(const string& input,
string* result, string* err) const {
char copy[_MAX_PATH + 1];
size_t len = input.size();
if (len > _MAX_PATH) {
*err = "path too long";
return false;
}
strncpy(copy, input.c_str(), input.size() + 1);
uint64_t slash_bits;
if (!CanonicalizePath(copy, &len, &slash_bits, err))
return false;
StringPiece partially_fixed(copy, len);
string abs_input = AbsPath(partially_fixed);
if (!SameDrive(abs_input, relative_to_)) {
*result = partially_fixed.AsString();
return true;
}
*result = Relativize(abs_input, split_relative_to_);
return true;
}
|
