]>
Commit | Line | Data |
---|---|---|
26c8a533 | 1 | /* |
3a429d3b | 2 | * Utilities for paths and pathnames |
26c8a533 LT |
3 | */ |
4 | #include "cache.h" | |
395de250 | 5 | #include "strbuf.h" |
a5ccdbe4 | 6 | #include "string-list.h" |
77a6d840 | 7 | #include "dir.h" |
26c8a533 | 8 | |
f66450ae | 9 | static int get_st_mode_bits(const char *path, int *mode) |
0117c2f0 TB |
10 | { |
11 | struct stat st; | |
12 | if (lstat(path, &st) < 0) | |
13 | return -1; | |
14 | *mode = st.st_mode; | |
15 | return 0; | |
16 | } | |
0117c2f0 | 17 | |
26c8a533 LT |
18 | static char bad_path[] = "/bad-path/"; |
19 | ||
4ef9caf5 | 20 | static struct strbuf *get_pathname(void) |
e7676d2f | 21 | { |
4ef9caf5 NTND |
22 | static struct strbuf pathname_array[4] = { |
23 | STRBUF_INIT, STRBUF_INIT, STRBUF_INIT, STRBUF_INIT | |
24 | }; | |
e7676d2f | 25 | static int index; |
4ef9caf5 NTND |
26 | struct strbuf *sb = &pathname_array[3 & ++index]; |
27 | strbuf_reset(sb); | |
28 | return sb; | |
e7676d2f LT |
29 | } |
30 | ||
26c8a533 LT |
31 | static char *cleanup_path(char *path) |
32 | { | |
33 | /* Clean it up */ | |
34 | if (!memcmp(path, "./", 2)) { | |
35 | path += 2; | |
36 | while (*path == '/') | |
37 | path++; | |
38 | } | |
39 | return path; | |
40 | } | |
41 | ||
4ef9caf5 NTND |
42 | static void strbuf_cleanup_path(struct strbuf *sb) |
43 | { | |
44 | char *path = cleanup_path(sb->buf); | |
45 | if (path > sb->buf) | |
46 | strbuf_remove(sb, 0, path - sb->buf); | |
47 | } | |
48 | ||
108bebea AR |
49 | char *mksnpath(char *buf, size_t n, const char *fmt, ...) |
50 | { | |
51 | va_list args; | |
52 | unsigned len; | |
53 | ||
54 | va_start(args, fmt); | |
55 | len = vsnprintf(buf, n, fmt, args); | |
56 | va_end(args); | |
57 | if (len >= n) { | |
9db56f71 | 58 | strlcpy(buf, bad_path, n); |
108bebea AR |
59 | return buf; |
60 | } | |
61 | return cleanup_path(buf); | |
62 | } | |
63 | ||
557bd833 | 64 | static int dir_prefix(const char *buf, const char *dir) |
fe2d7776 | 65 | { |
557bd833 NTND |
66 | int len = strlen(dir); |
67 | return !strncmp(buf, dir, len) && | |
68 | (is_dir_sep(buf[len]) || buf[len] == '\0'); | |
69 | } | |
fe2d7776 | 70 | |
557bd833 NTND |
71 | /* $buf =~ m|$dir/+$file| but without regex */ |
72 | static int is_dir_file(const char *buf, const char *dir, const char *file) | |
73 | { | |
74 | int len = strlen(dir); | |
75 | if (strncmp(buf, dir, len) || !is_dir_sep(buf[len])) | |
76 | return 0; | |
77 | while (is_dir_sep(buf[len])) | |
78 | len++; | |
79 | return !strcmp(buf + len, file); | |
80 | } | |
81 | ||
82 | static void replace_dir(struct strbuf *buf, int len, const char *newdir) | |
83 | { | |
84 | int newlen = strlen(newdir); | |
85 | int need_sep = (buf->buf[len] && !is_dir_sep(buf->buf[len])) && | |
86 | !is_dir_sep(newdir[newlen - 1]); | |
87 | if (need_sep) | |
88 | len--; /* keep one char, to be replaced with '/' */ | |
89 | strbuf_splice(buf, 0, len, newdir, newlen); | |
90 | if (need_sep) | |
91 | buf->buf[newlen] = '/'; | |
92 | } | |
93 | ||
0701530c DT |
94 | struct common_dir { |
95 | /* Not considered garbage for report_linked_checkout_garbage */ | |
96 | unsigned ignore_garbage:1; | |
97 | unsigned is_dir:1; | |
98 | /* Not common even though its parent is */ | |
99 | unsigned exclude:1; | |
100 | const char *dirname; | |
101 | }; | |
102 | ||
103 | static struct common_dir common_list[] = { | |
104 | { 0, 1, 0, "branches" }, | |
105 | { 0, 1, 0, "hooks" }, | |
106 | { 0, 1, 0, "info" }, | |
107 | { 0, 0, 1, "info/sparse-checkout" }, | |
108 | { 1, 1, 0, "logs" }, | |
109 | { 1, 1, 1, "logs/HEAD" }, | |
ce414b33 | 110 | { 0, 1, 1, "logs/refs/bisect" }, |
0701530c DT |
111 | { 0, 1, 0, "lost-found" }, |
112 | { 0, 1, 0, "objects" }, | |
113 | { 0, 1, 0, "refs" }, | |
ce414b33 | 114 | { 0, 1, 1, "refs/bisect" }, |
0701530c DT |
115 | { 0, 1, 0, "remotes" }, |
116 | { 0, 1, 0, "worktrees" }, | |
117 | { 0, 1, 0, "rr-cache" }, | |
118 | { 0, 1, 0, "svn" }, | |
119 | { 0, 0, 0, "config" }, | |
120 | { 1, 0, 0, "gc.pid" }, | |
121 | { 0, 0, 0, "packed-refs" }, | |
122 | { 0, 0, 0, "shallow" }, | |
123 | { 0, 0, 0, NULL } | |
c7b3a3d2 NTND |
124 | }; |
125 | ||
4e09cf2a DT |
126 | /* |
127 | * A compressed trie. A trie node consists of zero or more characters that | |
128 | * are common to all elements with this prefix, optionally followed by some | |
129 | * children. If value is not NULL, the trie node is a terminal node. | |
130 | * | |
131 | * For example, consider the following set of strings: | |
132 | * abc | |
133 | * def | |
134 | * definite | |
135 | * definition | |
136 | * | |
137 | * The trie would look look like: | |
138 | * root: len = 0, children a and d non-NULL, value = NULL. | |
139 | * a: len = 2, contents = bc, value = (data for "abc") | |
140 | * d: len = 2, contents = ef, children i non-NULL, value = (data for "def") | |
141 | * i: len = 3, contents = nit, children e and i non-NULL, value = NULL | |
142 | * e: len = 0, children all NULL, value = (data for "definite") | |
143 | * i: len = 2, contents = on, children all NULL, | |
144 | * value = (data for "definition") | |
145 | */ | |
146 | struct trie { | |
147 | struct trie *children[256]; | |
148 | int len; | |
149 | char *contents; | |
150 | void *value; | |
151 | }; | |
152 | ||
153 | static struct trie *make_trie_node(const char *key, void *value) | |
c7b3a3d2 | 154 | { |
4e09cf2a DT |
155 | struct trie *new_node = xcalloc(1, sizeof(*new_node)); |
156 | new_node->len = strlen(key); | |
157 | if (new_node->len) { | |
158 | new_node->contents = xmalloc(new_node->len); | |
159 | memcpy(new_node->contents, key, new_node->len); | |
160 | } | |
161 | new_node->value = value; | |
162 | return new_node; | |
163 | } | |
c7b3a3d2 | 164 | |
4e09cf2a DT |
165 | /* |
166 | * Add a key/value pair to a trie. The key is assumed to be \0-terminated. | |
167 | * If there was an existing value for this key, return it. | |
168 | */ | |
169 | static void *add_to_trie(struct trie *root, const char *key, void *value) | |
170 | { | |
171 | struct trie *child; | |
172 | void *old; | |
173 | int i; | |
174 | ||
175 | if (!*key) { | |
176 | /* we have reached the end of the key */ | |
177 | old = root->value; | |
178 | root->value = value; | |
179 | return old; | |
180 | } | |
181 | ||
182 | for (i = 0; i < root->len; i++) { | |
183 | if (root->contents[i] == key[i]) | |
184 | continue; | |
185 | ||
186 | /* | |
187 | * Split this node: child will contain this node's | |
188 | * existing children. | |
189 | */ | |
190 | child = malloc(sizeof(*child)); | |
191 | memcpy(child->children, root->children, sizeof(root->children)); | |
192 | ||
193 | child->len = root->len - i - 1; | |
194 | if (child->len) { | |
195 | child->contents = xstrndup(root->contents + i + 1, | |
196 | child->len); | |
c7b3a3d2 | 197 | } |
4e09cf2a DT |
198 | child->value = root->value; |
199 | root->value = NULL; | |
200 | root->len = i; | |
201 | ||
202 | memset(root->children, 0, sizeof(root->children)); | |
203 | root->children[(unsigned char)root->contents[i]] = child; | |
204 | ||
205 | /* This is the newly-added child. */ | |
206 | root->children[(unsigned char)key[i]] = | |
207 | make_trie_node(key + i + 1, value); | |
208 | return NULL; | |
209 | } | |
210 | ||
211 | /* We have matched the entire compressed section */ | |
212 | if (key[i]) { | |
213 | child = root->children[(unsigned char)key[root->len]]; | |
214 | if (child) { | |
215 | return add_to_trie(child, key + root->len + 1, value); | |
216 | } else { | |
217 | child = make_trie_node(key + root->len + 1, value); | |
218 | root->children[(unsigned char)key[root->len]] = child; | |
219 | return NULL; | |
c7b3a3d2 NTND |
220 | } |
221 | } | |
4e09cf2a DT |
222 | |
223 | old = root->value; | |
224 | root->value = value; | |
225 | return old; | |
226 | } | |
227 | ||
228 | typedef int (*match_fn)(const char *unmatched, void *data, void *baton); | |
229 | ||
230 | /* | |
231 | * Search a trie for some key. Find the longest /-or-\0-terminated | |
232 | * prefix of the key for which the trie contains a value. Call fn | |
233 | * with the unmatched portion of the key and the found value, and | |
234 | * return its return value. If there is no such prefix, return -1. | |
235 | * | |
236 | * The key is partially normalized: consecutive slashes are skipped. | |
237 | * | |
238 | * For example, consider the trie containing only [refs, | |
239 | * refs/worktree] (both with values). | |
240 | * | |
241 | * | key | unmatched | val from node | return value | | |
242 | * |-----------------|------------|---------------|--------------| | |
243 | * | a | not called | n/a | -1 | | |
244 | * | refs | \0 | refs | as per fn | | |
245 | * | refs/ | / | refs | as per fn | | |
246 | * | refs/w | /w | refs | as per fn | | |
247 | * | refs/worktree | \0 | refs/worktree | as per fn | | |
248 | * | refs/worktree/ | / | refs/worktree | as per fn | | |
249 | * | refs/worktree/a | /a | refs/worktree | as per fn | | |
250 | * |-----------------|------------|---------------|--------------| | |
251 | * | |
252 | */ | |
253 | static int trie_find(struct trie *root, const char *key, match_fn fn, | |
254 | void *baton) | |
255 | { | |
256 | int i; | |
257 | int result; | |
258 | struct trie *child; | |
259 | ||
260 | if (!*key) { | |
261 | /* we have reached the end of the key */ | |
262 | if (root->value && !root->len) | |
263 | return fn(key, root->value, baton); | |
264 | else | |
265 | return -1; | |
266 | } | |
267 | ||
268 | for (i = 0; i < root->len; i++) { | |
269 | /* Partial path normalization: skip consecutive slashes. */ | |
270 | if (key[i] == '/' && key[i+1] == '/') { | |
271 | key++; | |
272 | continue; | |
273 | } | |
274 | if (root->contents[i] != key[i]) | |
275 | return -1; | |
276 | } | |
277 | ||
278 | /* Matched the entire compressed section */ | |
279 | key += i; | |
280 | if (!*key) | |
281 | /* End of key */ | |
282 | return fn(key, root->value, baton); | |
283 | ||
284 | /* Partial path normalization: skip consecutive slashes */ | |
285 | while (key[0] == '/' && key[1] == '/') | |
286 | key++; | |
287 | ||
288 | child = root->children[(unsigned char)*key]; | |
289 | if (child) | |
290 | result = trie_find(child, key + 1, fn, baton); | |
291 | else | |
292 | result = -1; | |
293 | ||
294 | if (result >= 0 || (*key != '/' && *key != 0)) | |
295 | return result; | |
296 | if (root->value) | |
297 | return fn(key, root->value, baton); | |
298 | else | |
299 | return -1; | |
300 | } | |
301 | ||
302 | static struct trie common_trie; | |
303 | static int common_trie_done_setup; | |
304 | ||
305 | static void init_common_trie(void) | |
306 | { | |
307 | struct common_dir *p; | |
308 | ||
309 | if (common_trie_done_setup) | |
310 | return; | |
311 | ||
312 | for (p = common_list; p->dirname; p++) | |
313 | add_to_trie(&common_trie, p->dirname, p); | |
314 | ||
315 | common_trie_done_setup = 1; | |
316 | } | |
317 | ||
318 | /* | |
319 | * Helper function for update_common_dir: returns 1 if the dir | |
320 | * prefix is common. | |
321 | */ | |
322 | static int check_common(const char *unmatched, void *value, void *baton) | |
323 | { | |
324 | struct common_dir *dir = value; | |
325 | ||
326 | if (!dir) | |
327 | return 0; | |
328 | ||
329 | if (dir->is_dir && (unmatched[0] == 0 || unmatched[0] == '/')) | |
330 | return !dir->exclude; | |
331 | ||
332 | if (!dir->is_dir && unmatched[0] == 0) | |
333 | return !dir->exclude; | |
334 | ||
335 | return 0; | |
336 | } | |
337 | ||
1c630bad JH |
338 | static void update_common_dir(struct strbuf *buf, int git_dir_len, |
339 | const char *common_dir) | |
4e09cf2a DT |
340 | { |
341 | char *base = buf->buf + git_dir_len; | |
342 | init_common_trie(); | |
1c630bad JH |
343 | if (!common_dir) |
344 | common_dir = get_git_common_dir(); | |
4e09cf2a | 345 | if (trie_find(&common_trie, base, check_common, NULL) > 0) |
1c630bad | 346 | replace_dir(buf, git_dir_len, common_dir); |
c7b3a3d2 NTND |
347 | } |
348 | ||
77a6d840 NTND |
349 | void report_linked_checkout_garbage(void) |
350 | { | |
351 | struct strbuf sb = STRBUF_INIT; | |
0701530c | 352 | const struct common_dir *p; |
77a6d840 NTND |
353 | int len; |
354 | ||
355 | if (!git_common_dir_env) | |
356 | return; | |
357 | strbuf_addf(&sb, "%s/", get_git_dir()); | |
358 | len = sb.len; | |
0701530c DT |
359 | for (p = common_list; p->dirname; p++) { |
360 | const char *path = p->dirname; | |
361 | if (p->ignore_garbage) | |
77a6d840 NTND |
362 | continue; |
363 | strbuf_setlen(&sb, len); | |
364 | strbuf_addstr(&sb, path); | |
365 | if (file_exists(sb.buf)) | |
0a489b06 | 366 | report_garbage(PACKDIR_FILE_GARBAGE, sb.buf); |
77a6d840 NTND |
367 | } |
368 | strbuf_release(&sb); | |
fe2d7776 AR |
369 | } |
370 | ||
557bd833 NTND |
371 | static void adjust_git_path(struct strbuf *buf, int git_dir_len) |
372 | { | |
373 | const char *base = buf->buf + git_dir_len; | |
374 | if (git_graft_env && is_dir_file(base, "info", "grafts")) | |
375 | strbuf_splice(buf, 0, buf->len, | |
376 | get_graft_file(), strlen(get_graft_file())); | |
377 | else if (git_index_env && !strcmp(base, "index")) | |
378 | strbuf_splice(buf, 0, buf->len, | |
379 | get_index_file(), strlen(get_index_file())); | |
380 | else if (git_db_env && dir_prefix(base, "objects")) | |
381 | replace_dir(buf, git_dir_len + 7, get_object_directory()); | |
c7b3a3d2 | 382 | else if (git_common_dir_env) |
11f9dd71 | 383 | update_common_dir(buf, git_dir_len, NULL); |
557bd833 NTND |
384 | } |
385 | ||
8afdaf39 | 386 | static void do_git_path(struct strbuf *buf, const char *fmt, va_list args) |
fe2d7776 | 387 | { |
557bd833 NTND |
388 | int gitdir_len; |
389 | strbuf_addstr(buf, get_git_dir()); | |
4ef9caf5 NTND |
390 | if (buf->len && !is_dir_sep(buf->buf[buf->len - 1])) |
391 | strbuf_addch(buf, '/'); | |
557bd833 | 392 | gitdir_len = buf->len; |
4ef9caf5 | 393 | strbuf_vaddf(buf, fmt, args); |
557bd833 | 394 | adjust_git_path(buf, gitdir_len); |
4ef9caf5 | 395 | strbuf_cleanup_path(buf); |
fe2d7776 AR |
396 | } |
397 | ||
bb3788ce JK |
398 | char *git_path_buf(struct strbuf *buf, const char *fmt, ...) |
399 | { | |
400 | va_list args; | |
401 | strbuf_reset(buf); | |
402 | va_start(args, fmt); | |
403 | do_git_path(buf, fmt, args); | |
404 | va_end(args); | |
405 | return buf->buf; | |
406 | } | |
407 | ||
1a83c240 | 408 | void strbuf_git_path(struct strbuf *sb, const char *fmt, ...) |
aba13e7c AR |
409 | { |
410 | va_list args; | |
411 | va_start(args, fmt); | |
8afdaf39 | 412 | do_git_path(sb, fmt, args); |
aba13e7c | 413 | va_end(args); |
aba13e7c AR |
414 | } |
415 | ||
57a23b77 | 416 | const char *git_path(const char *fmt, ...) |
aba13e7c | 417 | { |
57a23b77 | 418 | struct strbuf *pathname = get_pathname(); |
aba13e7c AR |
419 | va_list args; |
420 | va_start(args, fmt); | |
57a23b77 | 421 | do_git_path(pathname, fmt, args); |
aba13e7c | 422 | va_end(args); |
57a23b77 | 423 | return pathname->buf; |
aba13e7c AR |
424 | } |
425 | ||
aba13e7c | 426 | char *git_pathdup(const char *fmt, ...) |
21cf3227 | 427 | { |
4ef9caf5 | 428 | struct strbuf path = STRBUF_INIT; |
21cf3227 | 429 | va_list args; |
21cf3227 | 430 | va_start(args, fmt); |
8afdaf39 | 431 | do_git_path(&path, fmt, args); |
21cf3227 | 432 | va_end(args); |
4ef9caf5 | 433 | return strbuf_detach(&path, NULL); |
21cf3227 HKNN |
434 | } |
435 | ||
21cf3227 | 436 | char *mkpathdup(const char *fmt, ...) |
26c8a533 | 437 | { |
21cf3227 | 438 | struct strbuf sb = STRBUF_INIT; |
26c8a533 | 439 | va_list args; |
26c8a533 | 440 | va_start(args, fmt); |
21cf3227 | 441 | strbuf_vaddf(&sb, fmt, args); |
26c8a533 | 442 | va_end(args); |
4ef9caf5 NTND |
443 | strbuf_cleanup_path(&sb); |
444 | return strbuf_detach(&sb, NULL); | |
26c8a533 LT |
445 | } |
446 | ||
dcf69262 | 447 | const char *mkpath(const char *fmt, ...) |
26c8a533 | 448 | { |
26c8a533 | 449 | va_list args; |
4ef9caf5 | 450 | struct strbuf *pathname = get_pathname(); |
26c8a533 | 451 | va_start(args, fmt); |
4ef9caf5 | 452 | strbuf_vaddf(pathname, fmt, args); |
26c8a533 | 453 | va_end(args); |
4ef9caf5 | 454 | return cleanup_path(pathname->buf); |
26c8a533 | 455 | } |
f2db68ed | 456 | |
f5895fd3 JK |
457 | static void do_submodule_path(struct strbuf *buf, const char *path, |
458 | const char *fmt, va_list args) | |
0bad611b | 459 | { |
0bad611b | 460 | const char *git_dir; |
11f9dd71 MK |
461 | struct strbuf git_submodule_common_dir = STRBUF_INIT; |
462 | struct strbuf git_submodule_dir = STRBUF_INIT; | |
0bad611b | 463 | |
4ef9caf5 | 464 | strbuf_addstr(buf, path); |
00b6c178 | 465 | strbuf_complete(buf, '/'); |
4ef9caf5 | 466 | strbuf_addstr(buf, ".git"); |
0bad611b | 467 | |
4ef9caf5 | 468 | git_dir = read_gitfile(buf->buf); |
0bad611b | 469 | if (git_dir) { |
4ef9caf5 NTND |
470 | strbuf_reset(buf); |
471 | strbuf_addstr(buf, git_dir); | |
0bad611b | 472 | } |
4ef9caf5 | 473 | strbuf_addch(buf, '/'); |
11f9dd71 | 474 | strbuf_addstr(&git_submodule_dir, buf->buf); |
0bad611b | 475 | |
4ef9caf5 | 476 | strbuf_vaddf(buf, fmt, args); |
11f9dd71 MK |
477 | |
478 | if (get_common_dir_noenv(&git_submodule_common_dir, git_submodule_dir.buf)) | |
479 | update_common_dir(buf, git_submodule_dir.len, git_submodule_common_dir.buf); | |
480 | ||
4ef9caf5 | 481 | strbuf_cleanup_path(buf); |
11f9dd71 MK |
482 | |
483 | strbuf_release(&git_submodule_dir); | |
484 | strbuf_release(&git_submodule_common_dir); | |
f5895fd3 JK |
485 | } |
486 | ||
f5895fd3 JK |
487 | char *git_pathdup_submodule(const char *path, const char *fmt, ...) |
488 | { | |
489 | va_list args; | |
490 | struct strbuf buf = STRBUF_INIT; | |
491 | va_start(args, fmt); | |
492 | do_submodule_path(&buf, path, fmt, args); | |
493 | va_end(args); | |
494 | return strbuf_detach(&buf, NULL); | |
495 | } | |
496 | ||
497 | void strbuf_git_path_submodule(struct strbuf *buf, const char *path, | |
498 | const char *fmt, ...) | |
499 | { | |
500 | va_list args; | |
501 | va_start(args, fmt); | |
502 | do_submodule_path(buf, path, fmt, args); | |
503 | va_end(args); | |
504 | } | |
505 | ||
c847f537 | 506 | int validate_headref(const char *path) |
0870ca7f JH |
507 | { |
508 | struct stat st; | |
509 | char *buf, buffer[256]; | |
c847f537 | 510 | unsigned char sha1[20]; |
0104ca09 HO |
511 | int fd; |
512 | ssize_t len; | |
0870ca7f JH |
513 | |
514 | if (lstat(path, &st) < 0) | |
515 | return -1; | |
516 | ||
517 | /* Make sure it is a "refs/.." symlink */ | |
518 | if (S_ISLNK(st.st_mode)) { | |
519 | len = readlink(path, buffer, sizeof(buffer)-1); | |
222b1673 | 520 | if (len >= 5 && !memcmp("refs/", buffer, 5)) |
0870ca7f JH |
521 | return 0; |
522 | return -1; | |
523 | } | |
524 | ||
525 | /* | |
526 | * Anything else, just open it and try to see if it is a symbolic ref. | |
527 | */ | |
528 | fd = open(path, O_RDONLY); | |
529 | if (fd < 0) | |
530 | return -1; | |
93d26e4c | 531 | len = read_in_full(fd, buffer, sizeof(buffer)-1); |
0870ca7f JH |
532 | close(fd); |
533 | ||
534 | /* | |
535 | * Is it a symbolic ref? | |
536 | */ | |
c847f537 | 537 | if (len < 4) |
0870ca7f | 538 | return -1; |
c847f537 JH |
539 | if (!memcmp("ref:", buffer, 4)) { |
540 | buf = buffer + 4; | |
541 | len -= 4; | |
542 | while (len && isspace(*buf)) | |
543 | buf++, len--; | |
222b1673 | 544 | if (len >= 5 && !memcmp("refs/", buf, 5)) |
c847f537 JH |
545 | return 0; |
546 | } | |
547 | ||
548 | /* | |
549 | * Is this a detached HEAD? | |
550 | */ | |
551 | if (!get_sha1_hex(buffer, sha1)) | |
0870ca7f | 552 | return 0; |
c847f537 | 553 | |
0870ca7f JH |
554 | return -1; |
555 | } | |
556 | ||
395de250 | 557 | static struct passwd *getpw_str(const char *username, size_t len) |
54f4b874 | 558 | { |
d79374c7 | 559 | struct passwd *pw; |
5c0b13f8 | 560 | char *username_z = xmemdupz(username, len); |
395de250 MM |
561 | pw = getpwnam(username_z); |
562 | free(username_z); | |
563 | return pw; | |
564 | } | |
54f4b874 | 565 | |
395de250 MM |
566 | /* |
567 | * Return a string with ~ and ~user expanded via getpw*. If buf != NULL, | |
568 | * then it is a newly allocated string. Returns NULL on getpw failure or | |
569 | * if path is NULL. | |
570 | */ | |
571 | char *expand_user_path(const char *path) | |
572 | { | |
573 | struct strbuf user_path = STRBUF_INIT; | |
395de250 MM |
574 | const char *to_copy = path; |
575 | ||
576 | if (path == NULL) | |
577 | goto return_null; | |
578 | if (path[0] == '~') { | |
53ec551c | 579 | const char *first_slash = strchrnul(path, '/'); |
395de250 MM |
580 | const char *username = path + 1; |
581 | size_t username_len = first_slash - username; | |
df2a79f4 MM |
582 | if (username_len == 0) { |
583 | const char *home = getenv("HOME"); | |
79bf1490 JN |
584 | if (!home) |
585 | goto return_null; | |
cedc61a9 | 586 | strbuf_addstr(&user_path, home); |
5ca6b7bb JS |
587 | #ifdef GIT_WINDOWS_NATIVE |
588 | convert_slashes(user_path.buf); | |
589 | #endif | |
df2a79f4 MM |
590 | } else { |
591 | struct passwd *pw = getpw_str(username, username_len); | |
592 | if (!pw) | |
593 | goto return_null; | |
cedc61a9 | 594 | strbuf_addstr(&user_path, pw->pw_dir); |
54f4b874 | 595 | } |
395de250 | 596 | to_copy = first_slash; |
d79374c7 | 597 | } |
cedc61a9 | 598 | strbuf_addstr(&user_path, to_copy); |
395de250 MM |
599 | return strbuf_detach(&user_path, NULL); |
600 | return_null: | |
601 | strbuf_release(&user_path); | |
602 | return NULL; | |
54f4b874 AE |
603 | } |
604 | ||
d79374c7 JH |
605 | /* |
606 | * First, one directory to try is determined by the following algorithm. | |
607 | * | |
608 | * (0) If "strict" is given, the path is used as given and no DWIM is | |
609 | * done. Otherwise: | |
610 | * (1) "~/path" to mean path under the running user's home directory; | |
611 | * (2) "~user/path" to mean path under named user's home directory; | |
612 | * (3) "relative/path" to mean cwd relative directory; or | |
613 | * (4) "/absolute/path" to mean absolute directory. | |
614 | * | |
c8c3f1d0 PT |
615 | * Unless "strict" is given, we check "%s/.git", "%s", "%s.git/.git", "%s.git" |
616 | * in this order. We select the first one that is a valid git repository, and | |
617 | * chdir() to it. If none match, or we fail to chdir, we return NULL. | |
d79374c7 JH |
618 | * |
619 | * If all goes well, we return the directory we used to chdir() (but | |
620 | * before ~user is expanded), avoiding getcwd() resolving symbolic | |
621 | * links. User relative paths are also returned as they are given, | |
622 | * except DWIM suffixing. | |
623 | */ | |
1c64b48e | 624 | const char *enter_repo(const char *path, int strict) |
54f4b874 | 625 | { |
e9ba6781 JK |
626 | static struct strbuf validated_path = STRBUF_INIT; |
627 | static struct strbuf used_path = STRBUF_INIT; | |
d79374c7 JH |
628 | |
629 | if (!path) | |
54f4b874 AE |
630 | return NULL; |
631 | ||
d79374c7 JH |
632 | if (!strict) { |
633 | static const char *suffix[] = { | |
b3256eb8 | 634 | "/.git", "", ".git/.git", ".git", NULL, |
d79374c7 | 635 | }; |
03106768 | 636 | const char *gitfile; |
d79374c7 JH |
637 | int len = strlen(path); |
638 | int i; | |
1c64b48e | 639 | while ((1 < len) && (path[len-1] == '/')) |
d79374c7 | 640 | len--; |
1c64b48e | 641 | |
e9ba6781 JK |
642 | /* |
643 | * We can handle arbitrary-sized buffers, but this remains as a | |
644 | * sanity check on untrusted input. | |
645 | */ | |
d79374c7 | 646 | if (PATH_MAX <= len) |
54f4b874 | 647 | return NULL; |
1c64b48e | 648 | |
e9ba6781 JK |
649 | strbuf_reset(&used_path); |
650 | strbuf_reset(&validated_path); | |
651 | strbuf_add(&used_path, path, len); | |
652 | strbuf_add(&validated_path, path, len); | |
653 | ||
654 | if (used_path.buf[0] == '~') { | |
655 | char *newpath = expand_user_path(used_path.buf); | |
656 | if (!newpath) | |
d79374c7 | 657 | return NULL; |
e9ba6781 JK |
658 | strbuf_attach(&used_path, newpath, strlen(newpath), |
659 | strlen(newpath)); | |
d79374c7 | 660 | } |
d79374c7 | 661 | for (i = 0; suffix[i]; i++) { |
b3256eb8 | 662 | struct stat st; |
e9ba6781 JK |
663 | size_t baselen = used_path.len; |
664 | strbuf_addstr(&used_path, suffix[i]); | |
665 | if (!stat(used_path.buf, &st) && | |
b3256eb8 | 666 | (S_ISREG(st.st_mode) || |
e9ba6781 JK |
667 | (S_ISDIR(st.st_mode) && is_git_directory(used_path.buf)))) { |
668 | strbuf_addstr(&validated_path, suffix[i]); | |
d79374c7 JH |
669 | break; |
670 | } | |
e9ba6781 | 671 | strbuf_setlen(&used_path, baselen); |
d79374c7 | 672 | } |
03106768 PH |
673 | if (!suffix[i]) |
674 | return NULL; | |
78891795 | 675 | gitfile = read_gitfile(used_path.buf); |
e9ba6781 JK |
676 | if (gitfile) { |
677 | strbuf_reset(&used_path); | |
678 | strbuf_addstr(&used_path, gitfile); | |
679 | } | |
680 | if (chdir(used_path.buf)) | |
0870ca7f | 681 | return NULL; |
e9ba6781 | 682 | path = validated_path.buf; |
0870ca7f | 683 | } |
1f5fbe1f NTND |
684 | else { |
685 | const char *gitfile = read_gitfile(path); | |
686 | if (gitfile) | |
687 | path = gitfile; | |
688 | if (chdir(path)) | |
689 | return NULL; | |
690 | } | |
54f4b874 | 691 | |
0f64cc40 | 692 | if (is_git_directory(".")) { |
717c3972 | 693 | set_git_dir("."); |
1644162a | 694 | check_repository_format(); |
d79374c7 | 695 | return path; |
54f4b874 AE |
696 | } |
697 | ||
698 | return NULL; | |
699 | } | |
138086a7 | 700 | |
cbe43b84 | 701 | static int calc_shared_perm(int mode) |
138086a7 | 702 | { |
cbe43b84 | 703 | int tweak; |
138086a7 | 704 | |
7875acb6 JK |
705 | if (get_shared_repository() < 0) |
706 | tweak = -get_shared_repository(); | |
5a688fe4 | 707 | else |
7875acb6 | 708 | tweak = get_shared_repository(); |
5a688fe4 JH |
709 | |
710 | if (!(mode & S_IWUSR)) | |
711 | tweak &= ~0222; | |
712 | if (mode & S_IXUSR) | |
713 | /* Copy read bits to execute bits */ | |
714 | tweak |= (tweak & 0444) >> 2; | |
7875acb6 | 715 | if (get_shared_repository() < 0) |
5a688fe4 JH |
716 | mode = (mode & ~0777) | tweak; |
717 | else | |
8c6202d8 | 718 | mode |= tweak; |
06cbe855 | 719 | |
cbe43b84 TB |
720 | return mode; |
721 | } | |
722 | ||
723 | ||
724 | int adjust_shared_perm(const char *path) | |
725 | { | |
726 | int old_mode, new_mode; | |
727 | ||
7875acb6 | 728 | if (!get_shared_repository()) |
cbe43b84 TB |
729 | return 0; |
730 | if (get_st_mode_bits(path, &old_mode) < 0) | |
731 | return -1; | |
732 | ||
733 | new_mode = calc_shared_perm(old_mode); | |
734 | if (S_ISDIR(old_mode)) { | |
06cbe855 | 735 | /* Copy read bits to execute bits */ |
cbe43b84 TB |
736 | new_mode |= (new_mode & 0444) >> 2; |
737 | new_mode |= FORCE_DIR_SET_GID; | |
06cbe855 HO |
738 | } |
739 | ||
cbe43b84 TB |
740 | if (((old_mode ^ new_mode) & ~S_IFMT) && |
741 | chmod(path, (new_mode & ~S_IFMT)) < 0) | |
138086a7 JH |
742 | return -2; |
743 | return 0; | |
744 | } | |
e5392c51 | 745 | |
eb33876c DT |
746 | void safe_create_dir(const char *dir, int share) |
747 | { | |
748 | if (mkdir(dir, 0777) < 0) { | |
749 | if (errno != EEXIST) { | |
750 | perror(dir); | |
751 | exit(1); | |
752 | } | |
753 | } | |
754 | else if (share && adjust_shared_perm(dir)) | |
755 | die(_("Could not make %s writable by group"), dir); | |
756 | } | |
757 | ||
7fbd4221 JX |
758 | static int have_same_root(const char *path1, const char *path2) |
759 | { | |
760 | int is_abs1, is_abs2; | |
761 | ||
762 | is_abs1 = is_absolute_path(path1); | |
763 | is_abs2 = is_absolute_path(path2); | |
764 | return (is_abs1 && is_abs2 && tolower(path1[0]) == tolower(path2[0])) || | |
765 | (!is_abs1 && !is_abs2); | |
766 | } | |
767 | ||
e02ca72f JX |
768 | /* |
769 | * Give path as relative to prefix. | |
770 | * | |
771 | * The strbuf may or may not be used, so do not assume it contains the | |
772 | * returned path. | |
773 | */ | |
774 | const char *relative_path(const char *in, const char *prefix, | |
775 | struct strbuf *sb) | |
044bbbcb | 776 | { |
e02ca72f JX |
777 | int in_len = in ? strlen(in) : 0; |
778 | int prefix_len = prefix ? strlen(prefix) : 0; | |
779 | int in_off = 0; | |
780 | int prefix_off = 0; | |
288123f0 JH |
781 | int i = 0, j = 0; |
782 | ||
e02ca72f JX |
783 | if (!in_len) |
784 | return "./"; | |
785 | else if (!prefix_len) | |
786 | return in; | |
787 | ||
2f36eed9 | 788 | if (have_same_root(in, prefix)) |
7fbd4221 | 789 | /* bypass dos_drive, for "c:" is identical to "C:" */ |
2f36eed9 JS |
790 | i = j = has_dos_drive_prefix(in); |
791 | else { | |
7fbd4221 JX |
792 | return in; |
793 | } | |
794 | ||
e02ca72f JX |
795 | while (i < prefix_len && j < in_len && prefix[i] == in[j]) { |
796 | if (is_dir_sep(prefix[i])) { | |
797 | while (is_dir_sep(prefix[i])) | |
288123f0 | 798 | i++; |
e02ca72f JX |
799 | while (is_dir_sep(in[j])) |
800 | j++; | |
801 | prefix_off = i; | |
802 | in_off = j; | |
803 | } else { | |
804 | i++; | |
805 | j++; | |
806 | } | |
807 | } | |
808 | ||
809 | if ( | |
810 | /* "prefix" seems like prefix of "in" */ | |
811 | i >= prefix_len && | |
812 | /* | |
813 | * but "/foo" is not a prefix of "/foobar" | |
814 | * (i.e. prefix not end with '/') | |
815 | */ | |
816 | prefix_off < prefix_len) { | |
817 | if (j >= in_len) { | |
818 | /* in="/a/b", prefix="/a/b" */ | |
819 | in_off = in_len; | |
820 | } else if (is_dir_sep(in[j])) { | |
821 | /* in="/a/b/c", prefix="/a/b" */ | |
822 | while (is_dir_sep(in[j])) | |
288123f0 | 823 | j++; |
e02ca72f JX |
824 | in_off = j; |
825 | } else { | |
826 | /* in="/a/bbb/c", prefix="/a/b" */ | |
827 | i = prefix_off; | |
828 | } | |
829 | } else if ( | |
830 | /* "in" is short than "prefix" */ | |
831 | j >= in_len && | |
832 | /* "in" not end with '/' */ | |
833 | in_off < in_len) { | |
834 | if (is_dir_sep(prefix[i])) { | |
835 | /* in="/a/b", prefix="/a/b/c/" */ | |
836 | while (is_dir_sep(prefix[i])) | |
837 | i++; | |
838 | in_off = in_len; | |
839 | } | |
840 | } | |
841 | in += in_off; | |
842 | in_len -= in_off; | |
843 | ||
844 | if (i >= prefix_len) { | |
845 | if (!in_len) | |
846 | return "./"; | |
847 | else | |
848 | return in; | |
849 | } | |
850 | ||
851 | strbuf_reset(sb); | |
852 | strbuf_grow(sb, in_len); | |
853 | ||
854 | while (i < prefix_len) { | |
855 | if (is_dir_sep(prefix[i])) { | |
856 | strbuf_addstr(sb, "../"); | |
857 | while (is_dir_sep(prefix[i])) | |
858 | i++; | |
288123f0 | 859 | continue; |
288123f0 JH |
860 | } |
861 | i++; | |
288123f0 | 862 | } |
e02ca72f JX |
863 | if (!is_dir_sep(prefix[prefix_len - 1])) |
864 | strbuf_addstr(sb, "../"); | |
865 | ||
866 | strbuf_addstr(sb, in); | |
867 | ||
868 | return sb->buf; | |
044bbbcb | 869 | } |
ae299be0 | 870 | |
41894ae3 JX |
871 | /* |
872 | * A simpler implementation of relative_path | |
873 | * | |
874 | * Get relative path by removing "prefix" from "in". This function | |
875 | * first appears in v1.5.6-1-g044bbbc, and makes git_dir shorter | |
876 | * to increase performance when traversing the path to work_tree. | |
877 | */ | |
878 | const char *remove_leading_path(const char *in, const char *prefix) | |
879 | { | |
46357688 | 880 | static struct strbuf buf = STRBUF_INIT; |
41894ae3 JX |
881 | int i = 0, j = 0; |
882 | ||
883 | if (!prefix || !prefix[0]) | |
884 | return in; | |
885 | while (prefix[i]) { | |
886 | if (is_dir_sep(prefix[i])) { | |
887 | if (!is_dir_sep(in[j])) | |
888 | return in; | |
889 | while (is_dir_sep(prefix[i])) | |
890 | i++; | |
891 | while (is_dir_sep(in[j])) | |
892 | j++; | |
893 | continue; | |
894 | } else if (in[j] != prefix[i]) { | |
895 | return in; | |
896 | } | |
897 | i++; | |
898 | j++; | |
899 | } | |
900 | if ( | |
901 | /* "/foo" is a prefix of "/foo" */ | |
902 | in[j] && | |
903 | /* "/foo" is not a prefix of "/foobar" */ | |
904 | !is_dir_sep(prefix[i-1]) && !is_dir_sep(in[j]) | |
905 | ) | |
906 | return in; | |
907 | while (is_dir_sep(in[j])) | |
908 | j++; | |
46357688 JK |
909 | |
910 | strbuf_reset(&buf); | |
41894ae3 | 911 | if (!in[j]) |
46357688 | 912 | strbuf_addstr(&buf, "."); |
41894ae3 | 913 | else |
46357688 JK |
914 | strbuf_addstr(&buf, in + j); |
915 | return buf.buf; | |
41894ae3 JX |
916 | } |
917 | ||
ae299be0 | 918 | /* |
f2a782b8 | 919 | * It is okay if dst == src, but they should not overlap otherwise. |
ae299be0 | 920 | * |
f2a782b8 JS |
921 | * Performs the following normalizations on src, storing the result in dst: |
922 | * - Ensures that components are separated by '/' (Windows only) | |
923 | * - Squashes sequences of '/'. | |
ae299be0 DR |
924 | * - Removes "." components. |
925 | * - Removes ".." components, and the components the precede them. | |
f2a782b8 JS |
926 | * Returns failure (non-zero) if a ".." component appears as first path |
927 | * component anytime during the normalization. Otherwise, returns success (0). | |
ae299be0 DR |
928 | * |
929 | * Note that this function is purely textual. It does not follow symlinks, | |
930 | * verify the existence of the path, or make any system calls. | |
645a29c4 NTND |
931 | * |
932 | * prefix_len != NULL is for a specific case of prefix_pathspec(): | |
933 | * assume that src == dst and src[0..prefix_len-1] is already | |
934 | * normalized, any time "../" eats up to the prefix_len part, | |
935 | * prefix_len is reduced. In the end prefix_len is the remaining | |
936 | * prefix that has not been overridden by user pathspec. | |
b2a7123b RD |
937 | * |
938 | * NEEDSWORK: This function doesn't perform normalization w.r.t. trailing '/'. | |
939 | * For everything but the root folder itself, the normalized path should not | |
940 | * end with a '/', then the callers need to be fixed up accordingly. | |
941 | * | |
ae299be0 | 942 | */ |
645a29c4 | 943 | int normalize_path_copy_len(char *dst, const char *src, int *prefix_len) |
ae299be0 | 944 | { |
f3cad0ad | 945 | char *dst0; |
2f36eed9 | 946 | int i; |
ae299be0 | 947 | |
2f36eed9 | 948 | for (i = has_dos_drive_prefix(src); i > 0; i--) |
f3cad0ad | 949 | *dst++ = *src++; |
f3cad0ad | 950 | dst0 = dst; |
ae299be0 | 951 | |
f3cad0ad | 952 | if (is_dir_sep(*src)) { |
ae299be0 | 953 | *dst++ = '/'; |
f3cad0ad JS |
954 | while (is_dir_sep(*src)) |
955 | src++; | |
956 | } | |
957 | ||
958 | for (;;) { | |
959 | char c = *src; | |
960 | ||
961 | /* | |
962 | * A path component that begins with . could be | |
963 | * special: | |
964 | * (1) "." and ends -- ignore and terminate. | |
965 | * (2) "./" -- ignore them, eat slash and continue. | |
966 | * (3) ".." and ends -- strip one and terminate. | |
967 | * (4) "../" -- strip one, eat slash and continue. | |
968 | */ | |
969 | if (c == '.') { | |
970 | if (!src[1]) { | |
971 | /* (1) */ | |
972 | src++; | |
973 | } else if (is_dir_sep(src[1])) { | |
974 | /* (2) */ | |
975 | src += 2; | |
976 | while (is_dir_sep(*src)) | |
977 | src++; | |
978 | continue; | |
979 | } else if (src[1] == '.') { | |
980 | if (!src[2]) { | |
981 | /* (3) */ | |
982 | src += 2; | |
983 | goto up_one; | |
984 | } else if (is_dir_sep(src[2])) { | |
985 | /* (4) */ | |
986 | src += 3; | |
987 | while (is_dir_sep(*src)) | |
988 | src++; | |
989 | goto up_one; | |
990 | } | |
991 | } | |
992 | } | |
ae299be0 | 993 | |
f3cad0ad JS |
994 | /* copy up to the next '/', and eat all '/' */ |
995 | while ((c = *src++) != '\0' && !is_dir_sep(c)) | |
996 | *dst++ = c; | |
997 | if (is_dir_sep(c)) { | |
998 | *dst++ = '/'; | |
999 | while (is_dir_sep(c)) | |
1000 | c = *src++; | |
1001 | src--; | |
1002 | } else if (!c) | |
1003 | break; | |
1004 | continue; | |
1005 | ||
1006 | up_one: | |
1007 | /* | |
1008 | * dst0..dst is prefix portion, and dst[-1] is '/'; | |
1009 | * go up one level. | |
1010 | */ | |
f42302b4 JS |
1011 | dst--; /* go to trailing '/' */ |
1012 | if (dst <= dst0) | |
f3cad0ad | 1013 | return -1; |
f42302b4 JS |
1014 | /* Windows: dst[-1] cannot be backslash anymore */ |
1015 | while (dst0 < dst && dst[-1] != '/') | |
1016 | dst--; | |
645a29c4 NTND |
1017 | if (prefix_len && *prefix_len > dst - dst0) |
1018 | *prefix_len = dst - dst0; | |
f3cad0ad | 1019 | } |
ae299be0 | 1020 | *dst = '\0'; |
f3cad0ad | 1021 | return 0; |
ae299be0 | 1022 | } |
0454dd93 | 1023 | |
645a29c4 NTND |
1024 | int normalize_path_copy(char *dst, const char *src) |
1025 | { | |
1026 | return normalize_path_copy_len(dst, src, NULL); | |
1027 | } | |
1028 | ||
0454dd93 DR |
1029 | /* |
1030 | * path = Canonical absolute path | |
9e2326c7 MH |
1031 | * prefixes = string_list containing normalized, absolute paths without |
1032 | * trailing slashes (except for the root directory, which is denoted by "/"). | |
0454dd93 | 1033 | * |
9e2326c7 | 1034 | * Determines, for each path in prefixes, whether the "prefix" |
0454dd93 DR |
1035 | * is an ancestor directory of path. Returns the length of the longest |
1036 | * ancestor directory, excluding any trailing slashes, or -1 if no prefix | |
31171d9e MH |
1037 | * is an ancestor. (Note that this means 0 is returned if prefixes is |
1038 | * ["/"].) "/foo" is not considered an ancestor of "/foobar". Directories | |
0454dd93 DR |
1039 | * are not considered to be their own ancestors. path must be in a |
1040 | * canonical form: empty components, or "." or ".." components are not | |
9e2326c7 | 1041 | * allowed. |
0454dd93 | 1042 | */ |
31171d9e | 1043 | int longest_ancestor_length(const char *path, struct string_list *prefixes) |
0454dd93 | 1044 | { |
a5ccdbe4 | 1045 | int i, max_len = -1; |
0454dd93 | 1046 | |
31171d9e | 1047 | if (!strcmp(path, "/")) |
0454dd93 DR |
1048 | return -1; |
1049 | ||
31171d9e MH |
1050 | for (i = 0; i < prefixes->nr; i++) { |
1051 | const char *ceil = prefixes->items[i].string; | |
a5ccdbe4 MH |
1052 | int len = strlen(ceil); |
1053 | ||
9e2326c7 MH |
1054 | if (len == 1 && ceil[0] == '/') |
1055 | len = 0; /* root matches anything, with length 0 */ | |
1056 | else if (!strncmp(path, ceil, len) && path[len] == '/') | |
1057 | ; /* match of length len */ | |
1058 | else | |
1059 | continue; /* no match */ | |
0454dd93 | 1060 | |
9e2326c7 | 1061 | if (len > max_len) |
0454dd93 | 1062 | max_len = len; |
0454dd93 DR |
1063 | } |
1064 | ||
1065 | return max_len; | |
1066 | } | |
4fcc86b0 JS |
1067 | |
1068 | /* strip arbitrary amount of directory separators at end of path */ | |
1069 | static inline int chomp_trailing_dir_sep(const char *path, int len) | |
1070 | { | |
1071 | while (len && is_dir_sep(path[len - 1])) | |
1072 | len--; | |
1073 | return len; | |
1074 | } | |
1075 | ||
1076 | /* | |
1077 | * If path ends with suffix (complete path components), returns the | |
1078 | * part before suffix (sans trailing directory separators). | |
1079 | * Otherwise returns NULL. | |
1080 | */ | |
1081 | char *strip_path_suffix(const char *path, const char *suffix) | |
1082 | { | |
1083 | int path_len = strlen(path), suffix_len = strlen(suffix); | |
1084 | ||
1085 | while (suffix_len) { | |
1086 | if (!path_len) | |
1087 | return NULL; | |
1088 | ||
1089 | if (is_dir_sep(path[path_len - 1])) { | |
1090 | if (!is_dir_sep(suffix[suffix_len - 1])) | |
1091 | return NULL; | |
1092 | path_len = chomp_trailing_dir_sep(path, path_len); | |
1093 | suffix_len = chomp_trailing_dir_sep(suffix, suffix_len); | |
1094 | } | |
1095 | else if (path[--path_len] != suffix[--suffix_len]) | |
1096 | return NULL; | |
1097 | } | |
1098 | ||
1099 | if (path_len && !is_dir_sep(path[path_len - 1])) | |
1100 | return NULL; | |
1101 | return xstrndup(path, chomp_trailing_dir_sep(path, path_len)); | |
1102 | } | |
34b6cb8b SP |
1103 | |
1104 | int daemon_avoid_alias(const char *p) | |
1105 | { | |
1106 | int sl, ndot; | |
1107 | ||
1108 | /* | |
1109 | * This resurrects the belts and suspenders paranoia check by HPA | |
1110 | * done in <435560F7.4080006@zytor.com> thread, now enter_repo() | |
9517e6b8 | 1111 | * does not do getcwd() based path canonicalization. |
34b6cb8b SP |
1112 | * |
1113 | * sl becomes true immediately after seeing '/' and continues to | |
1114 | * be true as long as dots continue after that without intervening | |
1115 | * non-dot character. | |
1116 | */ | |
1117 | if (!p || (*p != '/' && *p != '~')) | |
1118 | return -1; | |
1119 | sl = 1; ndot = 0; | |
1120 | p++; | |
1121 | ||
1122 | while (1) { | |
1123 | char ch = *p++; | |
1124 | if (sl) { | |
1125 | if (ch == '.') | |
1126 | ndot++; | |
1127 | else if (ch == '/') { | |
1128 | if (ndot < 3) | |
1129 | /* reject //, /./ and /../ */ | |
1130 | return -1; | |
1131 | ndot = 0; | |
1132 | } | |
1133 | else if (ch == 0) { | |
1134 | if (0 < ndot && ndot < 3) | |
1135 | /* reject /.$ and /..$ */ | |
1136 | return -1; | |
1137 | return 0; | |
1138 | } | |
1139 | else | |
1140 | sl = ndot = 0; | |
1141 | } | |
1142 | else if (ch == 0) | |
1143 | return 0; | |
1144 | else if (ch == '/') { | |
1145 | sl = 1; | |
1146 | ndot = 0; | |
1147 | } | |
1148 | } | |
1149 | } | |
4bb43de2 | 1150 | |
1d1d69bc JS |
1151 | static int only_spaces_and_periods(const char *path, size_t len, size_t skip) |
1152 | { | |
1153 | if (len < skip) | |
1154 | return 0; | |
1155 | len -= skip; | |
1156 | path += skip; | |
1157 | while (len-- > 0) { | |
1158 | char c = *(path++); | |
1159 | if (c != ' ' && c != '.') | |
1160 | return 0; | |
1161 | } | |
1162 | return 1; | |
1163 | } | |
1164 | ||
1165 | int is_ntfs_dotgit(const char *name) | |
1166 | { | |
1167 | int len; | |
1168 | ||
1169 | for (len = 0; ; len++) | |
1170 | if (!name[len] || name[len] == '\\' || is_dir_sep(name[len])) { | |
1171 | if (only_spaces_and_periods(name, len, 4) && | |
1172 | !strncasecmp(name, ".git", 4)) | |
1173 | return 1; | |
1174 | if (only_spaces_and_periods(name, len, 5) && | |
1175 | !strncasecmp(name, "git~1", 5)) | |
1176 | return 1; | |
1177 | if (name[len] != '\\') | |
1178 | return 0; | |
1179 | name += len + 1; | |
1180 | len = -1; | |
1181 | } | |
1182 | } | |
ea19289b PT |
1183 | |
1184 | char *xdg_config_home(const char *filename) | |
1185 | { | |
1186 | const char *home, *config_home; | |
1187 | ||
1188 | assert(filename); | |
1189 | config_home = getenv("XDG_CONFIG_HOME"); | |
1190 | if (config_home && *config_home) | |
1191 | return mkpathdup("%s/git/%s", config_home, filename); | |
1192 | ||
1193 | home = getenv("HOME"); | |
1194 | if (home) | |
1195 | return mkpathdup("%s/.config/git/%s", home, filename); | |
1196 | return NULL; | |
1197 | } | |
f932729c JK |
1198 | |
1199 | GIT_PATH_FUNC(git_path_cherry_pick_head, "CHERRY_PICK_HEAD") | |
1200 | GIT_PATH_FUNC(git_path_revert_head, "REVERT_HEAD") | |
1201 | GIT_PATH_FUNC(git_path_squash_msg, "SQUASH_MSG") | |
1202 | GIT_PATH_FUNC(git_path_merge_msg, "MERGE_MSG") | |
1203 | GIT_PATH_FUNC(git_path_merge_rr, "MERGE_RR") | |
1204 | GIT_PATH_FUNC(git_path_merge_mode, "MERGE_MODE") | |
1205 | GIT_PATH_FUNC(git_path_merge_head, "MERGE_HEAD") | |
1206 | GIT_PATH_FUNC(git_path_fetch_head, "FETCH_HEAD") | |
1207 | GIT_PATH_FUNC(git_path_shallow, "shallow") |