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