🌐 AI搜索 & 代理 主页
blob: fe3c4d96c6d82b2c8f4e1553f1a52e410c8c02d3 [file] [log] [blame]
Linus Torvalds26c8a532005-07-08 23:20:591/*
Torsten Bögershausen3a429d32013-03-30 09:53:322 * Utilities for paths and pathnames
Linus Torvalds26c8a532005-07-08 23:20:593 */
4#include "cache.h"
Matthieu Moy395de252009-11-17 17:24:255#include "strbuf.h"
Michael Haggertya5ccdbe2012-10-28 16:16:236#include "string-list.h"
Nguyễn Thái Ngọc Duy77a6d842014-11-30 08:24:547#include "dir.h"
Nguyễn Thái Ngọc Duy2e641d52016-04-22 13:01:298#include "worktree.h"
Linus Torvalds26c8a532005-07-08 23:20:599
Ramsay Jonesf66450a2013-06-22 19:42:4710static int get_st_mode_bits(const char *path, int *mode)
Torsten Bögershausen0117c2f2013-03-23 12:40:2911{
12 struct stat st;
13 if (lstat(path, &st) < 0)
14 return -1;
15 *mode = st.st_mode;
16 return 0;
17}
Torsten Bögershausen0117c2f2013-03-23 12:40:2918
Linus Torvalds26c8a532005-07-08 23:20:5919static char bad_path[] = "/bad-path/";
20
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:2621static struct strbuf *get_pathname(void)
Linus Torvaldse7676d22006-09-11 19:03:1522{
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:2623 static struct strbuf pathname_array[4] = {
24 STRBUF_INIT, STRBUF_INIT, STRBUF_INIT, STRBUF_INIT
25 };
Linus Torvaldse7676d22006-09-11 19:03:1526 static int index;
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:2627 struct strbuf *sb = &pathname_array[3 & ++index];
28 strbuf_reset(sb);
29 return sb;
Linus Torvaldse7676d22006-09-11 19:03:1530}
31
Linus Torvalds26c8a532005-07-08 23:20:5932static char *cleanup_path(char *path)
33{
34 /* Clean it up */
35 if (!memcmp(path, "./", 2)) {
36 path += 2;
37 while (*path == '/')
38 path++;
39 }
40 return path;
41}
42
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:2643static void strbuf_cleanup_path(struct strbuf *sb)
44{
45 char *path = cleanup_path(sb->buf);
46 if (path > sb->buf)
47 strbuf_remove(sb, 0, path - sb->buf);
48}
49
Alex Riesen108bebe2008-10-26 21:59:1350char *mksnpath(char *buf, size_t n, const char *fmt, ...)
51{
52 va_list args;
53 unsigned len;
54
55 va_start(args, fmt);
56 len = vsnprintf(buf, n, fmt, args);
57 va_end(args);
58 if (len >= n) {
Daniel Lowe9db56f72008-11-10 21:07:5259 strlcpy(buf, bad_path, n);
Alex Riesen108bebe2008-10-26 21:59:1360 return buf;
61 }
62 return cleanup_path(buf);
63}
64
Nguyễn Thái Ngọc Duy557bd832014-11-30 08:24:3165static int dir_prefix(const char *buf, const char *dir)
Alex Riesenfe2d7772008-10-27 09:22:2166{
Nguyễn Thái Ngọc Duy557bd832014-11-30 08:24:3167 int len = strlen(dir);
68 return !strncmp(buf, dir, len) &&
69 (is_dir_sep(buf[len]) || buf[len] == '\0');
Alex Riesenfe2d7772008-10-27 09:22:2170}
71
Nguyễn Thái Ngọc Duy557bd832014-11-30 08:24:3172/* $buf =~ m|$dir/+$file| but without regex */
73static int is_dir_file(const char *buf, const char *dir, const char *file)
Alex Riesenaba13e72008-10-27 10:17:5174{
Nguyễn Thái Ngọc Duy557bd832014-11-30 08:24:3175 int len = strlen(dir);
76 if (strncmp(buf, dir, len) || !is_dir_sep(buf[len]))
77 return 0;
78 while (is_dir_sep(buf[len]))
79 len++;
80 return !strcmp(buf + len, file);
81}
82
83static void replace_dir(struct strbuf *buf, int len, const char *newdir)
84{
85 int newlen = strlen(newdir);
86 int need_sep = (buf->buf[len] && !is_dir_sep(buf->buf[len])) &&
87 !is_dir_sep(newdir[newlen - 1]);
88 if (need_sep)
89 len--; /* keep one char, to be replaced with '/' */
90 strbuf_splice(buf, 0, len, newdir, newlen);
91 if (need_sep)
92 buf->buf[newlen] = '/';
93}
94
David Turner07015302015-09-01 02:13:0995struct common_dir {
96 /* Not considered garbage for report_linked_checkout_garbage */
97 unsigned ignore_garbage:1;
98 unsigned is_dir:1;
99 /* Not common even though its parent is */
100 unsigned exclude:1;
101 const char *dirname;
102};
103
104static struct common_dir common_list[] = {
105 { 0, 1, 0, "branches" },
106 { 0, 1, 0, "hooks" },
107 { 0, 1, 0, "info" },
108 { 0, 0, 1, "info/sparse-checkout" },
109 { 1, 1, 0, "logs" },
110 { 1, 1, 1, "logs/HEAD" },
David Turnerce414b32015-09-01 02:13:11111 { 0, 1, 1, "logs/refs/bisect" },
David Turner07015302015-09-01 02:13:09112 { 0, 1, 0, "lost-found" },
113 { 0, 1, 0, "objects" },
114 { 0, 1, 0, "refs" },
David Turnerce414b32015-09-01 02:13:11115 { 0, 1, 1, "refs/bisect" },
David Turner07015302015-09-01 02:13:09116 { 0, 1, 0, "remotes" },
117 { 0, 1, 0, "worktrees" },
118 { 0, 1, 0, "rr-cache" },
119 { 0, 1, 0, "svn" },
120 { 0, 0, 0, "config" },
121 { 1, 0, 0, "gc.pid" },
122 { 0, 0, 0, "packed-refs" },
123 { 0, 0, 0, "shallow" },
124 { 0, 0, 0, NULL }
Nguyễn Thái Ngọc Duyc7b3a3d2014-11-30 08:24:36125};
126
David Turner4e09cf22015-09-01 02:13:10127/*
128 * A compressed trie. A trie node consists of zero or more characters that
129 * are common to all elements with this prefix, optionally followed by some
130 * children. If value is not NULL, the trie node is a terminal node.
131 *
132 * For example, consider the following set of strings:
133 * abc
134 * def
135 * definite
136 * definition
137 *
Li Peng832c0e52016-05-06 12:36:46138 * The trie would look like:
David Turner4e09cf22015-09-01 02:13:10139 * root: len = 0, children a and d non-NULL, value = NULL.
140 * a: len = 2, contents = bc, value = (data for "abc")
141 * d: len = 2, contents = ef, children i non-NULL, value = (data for "def")
142 * i: len = 3, contents = nit, children e and i non-NULL, value = NULL
143 * e: len = 0, children all NULL, value = (data for "definite")
144 * i: len = 2, contents = on, children all NULL,
145 * value = (data for "definition")
146 */
147struct trie {
148 struct trie *children[256];
149 int len;
150 char *contents;
151 void *value;
152};
153
154static struct trie *make_trie_node(const char *key, void *value)
155{
156 struct trie *new_node = xcalloc(1, sizeof(*new_node));
157 new_node->len = strlen(key);
158 if (new_node->len) {
159 new_node->contents = xmalloc(new_node->len);
160 memcpy(new_node->contents, key, new_node->len);
161 }
162 new_node->value = value;
163 return new_node;
164}
165
166/*
167 * Add a key/value pair to a trie. The key is assumed to be \0-terminated.
168 * If there was an existing value for this key, return it.
169 */
170static void *add_to_trie(struct trie *root, const char *key, void *value)
171{
172 struct trie *child;
173 void *old;
174 int i;
175
176 if (!*key) {
177 /* we have reached the end of the key */
178 old = root->value;
179 root->value = value;
180 return old;
181 }
182
183 for (i = 0; i < root->len; i++) {
184 if (root->contents[i] == key[i])
185 continue;
186
187 /*
188 * Split this node: child will contain this node's
189 * existing children.
190 */
191 child = malloc(sizeof(*child));
192 memcpy(child->children, root->children, sizeof(root->children));
193
194 child->len = root->len - i - 1;
195 if (child->len) {
196 child->contents = xstrndup(root->contents + i + 1,
197 child->len);
198 }
199 child->value = root->value;
200 root->value = NULL;
201 root->len = i;
202
203 memset(root->children, 0, sizeof(root->children));
204 root->children[(unsigned char)root->contents[i]] = child;
205
206 /* This is the newly-added child. */
207 root->children[(unsigned char)key[i]] =
208 make_trie_node(key + i + 1, value);
209 return NULL;
210 }
211
212 /* We have matched the entire compressed section */
213 if (key[i]) {
214 child = root->children[(unsigned char)key[root->len]];
215 if (child) {
216 return add_to_trie(child, key + root->len + 1, value);
217 } else {
218 child = make_trie_node(key + root->len + 1, value);
219 root->children[(unsigned char)key[root->len]] = child;
220 return NULL;
221 }
222 }
223
224 old = root->value;
225 root->value = value;
226 return old;
227}
228
229typedef int (*match_fn)(const char *unmatched, void *data, void *baton);
230
231/*
232 * Search a trie for some key. Find the longest /-or-\0-terminated
233 * prefix of the key for which the trie contains a value. Call fn
234 * with the unmatched portion of the key and the found value, and
235 * return its return value. If there is no such prefix, return -1.
236 *
237 * The key is partially normalized: consecutive slashes are skipped.
238 *
239 * For example, consider the trie containing only [refs,
240 * refs/worktree] (both with values).
241 *
242 * | key | unmatched | val from node | return value |
243 * |-----------------|------------|---------------|--------------|
244 * | a | not called | n/a | -1 |
245 * | refs | \0 | refs | as per fn |
246 * | refs/ | / | refs | as per fn |
247 * | refs/w | /w | refs | as per fn |
248 * | refs/worktree | \0 | refs/worktree | as per fn |
249 * | refs/worktree/ | / | refs/worktree | as per fn |
250 * | refs/worktree/a | /a | refs/worktree | as per fn |
251 * |-----------------|------------|---------------|--------------|
252 *
253 */
254static int trie_find(struct trie *root, const char *key, match_fn fn,
255 void *baton)
256{
257 int i;
258 int result;
259 struct trie *child;
260
261 if (!*key) {
262 /* we have reached the end of the key */
263 if (root->value && !root->len)
264 return fn(key, root->value, baton);
265 else
266 return -1;
267 }
268
269 for (i = 0; i < root->len; i++) {
270 /* Partial path normalization: skip consecutive slashes. */
271 if (key[i] == '/' && key[i+1] == '/') {
272 key++;
273 continue;
274 }
275 if (root->contents[i] != key[i])
276 return -1;
277 }
278
279 /* Matched the entire compressed section */
280 key += i;
281 if (!*key)
282 /* End of key */
283 return fn(key, root->value, baton);
284
285 /* Partial path normalization: skip consecutive slashes */
286 while (key[0] == '/' && key[1] == '/')
287 key++;
288
289 child = root->children[(unsigned char)*key];
290 if (child)
291 result = trie_find(child, key + 1, fn, baton);
292 else
293 result = -1;
294
295 if (result >= 0 || (*key != '/' && *key != 0))
296 return result;
297 if (root->value)
298 return fn(key, root->value, baton);
299 else
300 return -1;
301}
302
303static struct trie common_trie;
304static int common_trie_done_setup;
305
306static void init_common_trie(void)
307{
308 struct common_dir *p;
309
310 if (common_trie_done_setup)
311 return;
312
313 for (p = common_list; p->dirname; p++)
314 add_to_trie(&common_trie, p->dirname, p);
315
316 common_trie_done_setup = 1;
317}
318
319/*
320 * Helper function for update_common_dir: returns 1 if the dir
321 * prefix is common.
322 */
323static int check_common(const char *unmatched, void *value, void *baton)
324{
325 struct common_dir *dir = value;
326
327 if (!dir)
328 return 0;
329
330 if (dir->is_dir && (unmatched[0] == 0 || unmatched[0] == '/'))
331 return !dir->exclude;
332
333 if (!dir->is_dir && unmatched[0] == 0)
334 return !dir->exclude;
335
336 return 0;
337}
338
Junio C Hamano1c630ba2015-10-15 22:43:31339static void update_common_dir(struct strbuf *buf, int git_dir_len,
340 const char *common_dir)
Nguyễn Thái Ngọc Duyc7b3a3d2014-11-30 08:24:36341{
342 char *base = buf->buf + git_dir_len;
David Turner4e09cf22015-09-01 02:13:10343 init_common_trie();
Junio C Hamano1c630ba2015-10-15 22:43:31344 if (!common_dir)
345 common_dir = get_git_common_dir();
David Turner4e09cf22015-09-01 02:13:10346 if (trie_find(&common_trie, base, check_common, NULL) > 0)
Junio C Hamano1c630ba2015-10-15 22:43:31347 replace_dir(buf, git_dir_len, common_dir);
Nguyễn Thái Ngọc Duyc7b3a3d2014-11-30 08:24:36348}
349
Nguyễn Thái Ngọc Duy77a6d842014-11-30 08:24:54350void report_linked_checkout_garbage(void)
351{
352 struct strbuf sb = STRBUF_INIT;
David Turner07015302015-09-01 02:13:09353 const struct common_dir *p;
Nguyễn Thái Ngọc Duy77a6d842014-11-30 08:24:54354 int len;
355
356 if (!git_common_dir_env)
357 return;
358 strbuf_addf(&sb, "%s/", get_git_dir());
359 len = sb.len;
David Turner07015302015-09-01 02:13:09360 for (p = common_list; p->dirname; p++) {
361 const char *path = p->dirname;
362 if (p->ignore_garbage)
Nguyễn Thái Ngọc Duy77a6d842014-11-30 08:24:54363 continue;
364 strbuf_setlen(&sb, len);
365 strbuf_addstr(&sb, path);
366 if (file_exists(sb.buf))
Junio C Hamano0a489b02015-08-13 18:02:52367 report_garbage(PACKDIR_FILE_GARBAGE, sb.buf);
Nguyễn Thái Ngọc Duy77a6d842014-11-30 08:24:54368 }
369 strbuf_release(&sb);
370}
371
Nguyễn Thái Ngọc Duy557bd832014-11-30 08:24:31372static void adjust_git_path(struct strbuf *buf, int git_dir_len)
373{
374 const char *base = buf->buf + git_dir_len;
375 if (git_graft_env && is_dir_file(base, "info", "grafts"))
376 strbuf_splice(buf, 0, buf->len,
377 get_graft_file(), strlen(get_graft_file()));
378 else if (git_index_env && !strcmp(base, "index"))
379 strbuf_splice(buf, 0, buf->len,
380 get_index_file(), strlen(get_index_file()));
381 else if (git_db_env && dir_prefix(base, "objects"))
382 replace_dir(buf, git_dir_len + 7, get_object_directory());
Johannes Schindelin9445b492016-08-16 13:14:27383 else if (git_hooks_path && dir_prefix(base, "hooks"))
384 replace_dir(buf, git_dir_len + 5, git_hooks_path);
Nguyễn Thái Ngọc Duyc7b3a3d2014-11-30 08:24:36385 else if (git_common_dir_env)
Max Kirillov11f9dd72015-09-13 22:17:42386 update_common_dir(buf, git_dir_len, NULL);
Nguyễn Thái Ngọc Duy557bd832014-11-30 08:24:31387}
388
Nguyễn Thái Ngọc Duy2e641d52016-04-22 13:01:29389static void do_git_path(const struct worktree *wt, struct strbuf *buf,
390 const char *fmt, va_list args)
Alex Riesenfe2d7772008-10-27 09:22:21391{
Nguyễn Thái Ngọc Duy557bd832014-11-30 08:24:31392 int gitdir_len;
Nguyễn Thái Ngọc Duy2e641d52016-04-22 13:01:29393 strbuf_addstr(buf, get_worktree_git_dir(wt));
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26394 if (buf->len && !is_dir_sep(buf->buf[buf->len - 1]))
395 strbuf_addch(buf, '/');
Nguyễn Thái Ngọc Duy557bd832014-11-30 08:24:31396 gitdir_len = buf->len;
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26397 strbuf_vaddf(buf, fmt, args);
Nguyễn Thái Ngọc Duy557bd832014-11-30 08:24:31398 adjust_git_path(buf, gitdir_len);
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26399 strbuf_cleanup_path(buf);
Alex Riesenfe2d7772008-10-27 09:22:21400}
401
Jeff Kingbb3788c2015-09-24 21:05:40402char *git_path_buf(struct strbuf *buf, const char *fmt, ...)
403{
404 va_list args;
405 strbuf_reset(buf);
406 va_start(args, fmt);
Nguyễn Thái Ngọc Duy2e641d52016-04-22 13:01:29407 do_git_path(NULL, buf, fmt, args);
Jeff Kingbb3788c2015-09-24 21:05:40408 va_end(args);
409 return buf->buf;
410}
411
Nguyễn Thái Ngọc Duy1a83c242014-11-30 08:24:28412void strbuf_git_path(struct strbuf *sb, const char *fmt, ...)
Alex Riesenaba13e72008-10-27 10:17:51413{
Alex Riesenaba13e72008-10-27 10:17:51414 va_list args;
415 va_start(args, fmt);
Nguyễn Thái Ngọc Duy2e641d52016-04-22 13:01:29416 do_git_path(NULL, sb, fmt, args);
Alex Riesenaba13e72008-10-27 10:17:51417 va_end(args);
Alex Riesenaba13e72008-10-27 10:17:51418}
419
Nguyễn Thái Ngọc Duy57a23b72014-11-30 08:24:30420const char *git_path(const char *fmt, ...)
421{
422 struct strbuf *pathname = get_pathname();
423 va_list args;
424 va_start(args, fmt);
Nguyễn Thái Ngọc Duy2e641d52016-04-22 13:01:29425 do_git_path(NULL, pathname, fmt, args);
Nguyễn Thái Ngọc Duy57a23b72014-11-30 08:24:30426 va_end(args);
427 return pathname->buf;
Alex Riesenaba13e72008-10-27 10:17:51428}
429
430char *git_pathdup(const char *fmt, ...)
431{
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26432 struct strbuf path = STRBUF_INIT;
Alex Riesenaba13e72008-10-27 10:17:51433 va_list args;
434 va_start(args, fmt);
Nguyễn Thái Ngọc Duy2e641d52016-04-22 13:01:29435 do_git_path(NULL, &path, fmt, args);
Alex Riesenaba13e72008-10-27 10:17:51436 va_end(args);
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26437 return strbuf_detach(&path, NULL);
Alex Riesenaba13e72008-10-27 10:17:51438}
439
Huynh Khoi Nguyen Nguyen21cf3222012-06-22 09:03:23440char *mkpathdup(const char *fmt, ...)
441{
Huynh Khoi Nguyen Nguyen21cf3222012-06-22 09:03:23442 struct strbuf sb = STRBUF_INIT;
443 va_list args;
Huynh Khoi Nguyen Nguyen21cf3222012-06-22 09:03:23444 va_start(args, fmt);
445 strbuf_vaddf(&sb, fmt, args);
446 va_end(args);
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26447 strbuf_cleanup_path(&sb);
448 return strbuf_detach(&sb, NULL);
Huynh Khoi Nguyen Nguyen21cf3222012-06-22 09:03:23449}
450
Nguyễn Thái Ngọc Duydcf69262014-11-30 08:24:27451const char *mkpath(const char *fmt, ...)
Linus Torvalds26c8a532005-07-08 23:20:59452{
453 va_list args;
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26454 struct strbuf *pathname = get_pathname();
Linus Torvalds26c8a532005-07-08 23:20:59455 va_start(args, fmt);
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26456 strbuf_vaddf(pathname, fmt, args);
Linus Torvalds26c8a532005-07-08 23:20:59457 va_end(args);
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26458 return cleanup_path(pathname->buf);
Linus Torvalds26c8a532005-07-08 23:20:59459}
Holger Eitzenbergerf2db68e2005-08-04 20:43:03460
Nguyễn Thái Ngọc Duy2e641d52016-04-22 13:01:29461const char *worktree_git_path(const struct worktree *wt, const char *fmt, ...)
462{
463 struct strbuf *pathname = get_pathname();
464 va_list args;
465 va_start(args, fmt);
466 do_git_path(wt, pathname, fmt, args);
467 va_end(args);
468 return pathname->buf;
469}
470
Jeff Kingf5895fd2015-08-10 09:32:22471static void do_submodule_path(struct strbuf *buf, const char *path,
472 const char *fmt, va_list args)
Heiko Voigt0bad6112010-07-07 13:39:11473{
Heiko Voigt0bad6112010-07-07 13:39:11474 const char *git_dir;
Max Kirillov11f9dd72015-09-13 22:17:42475 struct strbuf git_submodule_common_dir = STRBUF_INIT;
476 struct strbuf git_submodule_dir = STRBUF_INIT;
Heiko Voigt0bad6112010-07-07 13:39:11477
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26478 strbuf_addstr(buf, path);
Jeff King00b6c172015-09-24 21:08:35479 strbuf_complete(buf, '/');
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26480 strbuf_addstr(buf, ".git");
Heiko Voigt0bad6112010-07-07 13:39:11481
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26482 git_dir = read_gitfile(buf->buf);
Heiko Voigt0bad6112010-07-07 13:39:11483 if (git_dir) {
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26484 strbuf_reset(buf);
485 strbuf_addstr(buf, git_dir);
Heiko Voigt0bad6112010-07-07 13:39:11486 }
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26487 strbuf_addch(buf, '/');
René Scharfe81099842016-07-19 18:36:29488 strbuf_addbuf(&git_submodule_dir, buf);
Heiko Voigt0bad6112010-07-07 13:39:11489
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26490 strbuf_vaddf(buf, fmt, args);
Max Kirillov11f9dd72015-09-13 22:17:42491
492 if (get_common_dir_noenv(&git_submodule_common_dir, git_submodule_dir.buf))
493 update_common_dir(buf, git_submodule_dir.len, git_submodule_common_dir.buf);
494
Nguyễn Thái Ngọc Duy4ef9caf2014-11-30 08:24:26495 strbuf_cleanup_path(buf);
Max Kirillov11f9dd72015-09-13 22:17:42496
497 strbuf_release(&git_submodule_dir);
498 strbuf_release(&git_submodule_common_dir);
Jeff Kingf5895fd2015-08-10 09:32:22499}
500
Jeff Kingf5895fd2015-08-10 09:32:22501char *git_pathdup_submodule(const char *path, const char *fmt, ...)
502{
503 va_list args;
504 struct strbuf buf = STRBUF_INIT;
505 va_start(args, fmt);
506 do_submodule_path(&buf, path, fmt, args);
507 va_end(args);
508 return strbuf_detach(&buf, NULL);
509}
510
511void strbuf_git_path_submodule(struct strbuf *buf, const char *path,
512 const char *fmt, ...)
513{
514 va_list args;
515 va_start(args, fmt);
516 do_submodule_path(buf, path, fmt, args);
517 va_end(args);
518}
519
Nguyễn Thái Ngọc Duy15cdfea2016-04-22 13:01:25520static void do_git_common_path(struct strbuf *buf,
521 const char *fmt,
522 va_list args)
523{
524 strbuf_addstr(buf, get_git_common_dir());
525 if (buf->len && !is_dir_sep(buf->buf[buf->len - 1]))
526 strbuf_addch(buf, '/');
527 strbuf_vaddf(buf, fmt, args);
528 strbuf_cleanup_path(buf);
529}
530
531const char *git_common_path(const char *fmt, ...)
532{
533 struct strbuf *pathname = get_pathname();
534 va_list args;
535 va_start(args, fmt);
536 do_git_common_path(pathname, fmt, args);
537 va_end(args);
538 return pathname->buf;
539}
540
541void strbuf_git_common_path(struct strbuf *sb, const char *fmt, ...)
542{
543 va_list args;
544 va_start(args, fmt);
545 do_git_common_path(sb, fmt, args);
546 va_end(args);
547}
548
Junio C Hamanoc847f532007-01-02 07:31:08549int validate_headref(const char *path)
Junio C Hamano0870ca72005-11-18 22:59:34550{
551 struct stat st;
552 char *buf, buffer[256];
Junio C Hamanoc847f532007-01-02 07:31:08553 unsigned char sha1[20];
Heikki Orsila0104ca02008-04-27 18:21:58554 int fd;
555 ssize_t len;
Junio C Hamano0870ca72005-11-18 22:59:34556
557 if (lstat(path, &st) < 0)
558 return -1;
559
560 /* Make sure it is a "refs/.." symlink */
561 if (S_ISLNK(st.st_mode)) {
562 len = readlink(path, buffer, sizeof(buffer)-1);
Junio C Hamano222b1672009-02-12 21:02:09563 if (len >= 5 && !memcmp("refs/", buffer, 5))
Junio C Hamano0870ca72005-11-18 22:59:34564 return 0;
565 return -1;
566 }
567
568 /*
569 * Anything else, just open it and try to see if it is a symbolic ref.
570 */
571 fd = open(path, O_RDONLY);
572 if (fd < 0)
573 return -1;
Andy Whitcroft93d26e42007-01-08 15:58:08574 len = read_in_full(fd, buffer, sizeof(buffer)-1);
Junio C Hamano0870ca72005-11-18 22:59:34575 close(fd);
576
577 /*
578 * Is it a symbolic ref?
579 */
Junio C Hamanoc847f532007-01-02 07:31:08580 if (len < 4)
Junio C Hamano0870ca72005-11-18 22:59:34581 return -1;
Junio C Hamanoc847f532007-01-02 07:31:08582 if (!memcmp("ref:", buffer, 4)) {
583 buf = buffer + 4;
584 len -= 4;
585 while (len && isspace(*buf))
586 buf++, len--;
Junio C Hamano222b1672009-02-12 21:02:09587 if (len >= 5 && !memcmp("refs/", buf, 5))
Junio C Hamanoc847f532007-01-02 07:31:08588 return 0;
589 }
590
591 /*
592 * Is this a detached HEAD?
593 */
594 if (!get_sha1_hex(buffer, sha1))
Junio C Hamano0870ca72005-11-18 22:59:34595 return 0;
Junio C Hamanoc847f532007-01-02 07:31:08596
Junio C Hamano0870ca72005-11-18 22:59:34597 return -1;
598}
599
Matthieu Moy395de252009-11-17 17:24:25600static struct passwd *getpw_str(const char *username, size_t len)
Andreas Ericsson54f4b872005-11-17 19:37:14601{
Junio C Hamanod79374c2005-12-03 09:45:57602 struct passwd *pw;
René Scharfe5c0b13f2014-07-19 15:35:34603 char *username_z = xmemdupz(username, len);
Matthieu Moy395de252009-11-17 17:24:25604 pw = getpwnam(username_z);
605 free(username_z);
606 return pw;
607}
Andreas Ericsson54f4b872005-11-17 19:37:14608
Matthieu Moy395de252009-11-17 17:24:25609/*
610 * Return a string with ~ and ~user expanded via getpw*. If buf != NULL,
611 * then it is a newly allocated string. Returns NULL on getpw failure or
612 * if path is NULL.
613 */
614char *expand_user_path(const char *path)
615{
616 struct strbuf user_path = STRBUF_INIT;
Matthieu Moy395de252009-11-17 17:24:25617 const char *to_copy = path;
618
619 if (path == NULL)
620 goto return_null;
621 if (path[0] == '~') {
Jeff King53ec5512014-01-28 01:36:12622 const char *first_slash = strchrnul(path, '/');
Matthieu Moy395de252009-11-17 17:24:25623 const char *username = path + 1;
624 size_t username_len = first_slash - username;
Matthieu Moydf2a79f2009-11-19 15:21:15625 if (username_len == 0) {
626 const char *home = getenv("HOME");
Jonathan Nieder79bf1492010-07-26 15:06:51627 if (!home)
628 goto return_null;
René Scharfecedc61a2014-07-16 23:38:18629 strbuf_addstr(&user_path, home);
Johannes Schindelin5ca6b7b2016-03-23 10:55:00630#ifdef GIT_WINDOWS_NATIVE
631 convert_slashes(user_path.buf);
632#endif
Matthieu Moydf2a79f2009-11-19 15:21:15633 } else {
634 struct passwd *pw = getpw_str(username, username_len);
635 if (!pw)
636 goto return_null;
René Scharfecedc61a2014-07-16 23:38:18637 strbuf_addstr(&user_path, pw->pw_dir);
Junio C Hamanod79374c2005-12-03 09:45:57638 }
Matthieu Moy395de252009-11-17 17:24:25639 to_copy = first_slash;
Junio C Hamano0870ca72005-11-18 22:59:34640 }
René Scharfecedc61a2014-07-16 23:38:18641 strbuf_addstr(&user_path, to_copy);
Matthieu Moy395de252009-11-17 17:24:25642 return strbuf_detach(&user_path, NULL);
643return_null:
644 strbuf_release(&user_path);
645 return NULL;
Junio C Hamanod79374c2005-12-03 09:45:57646}
Andreas Ericsson54f4b872005-11-17 19:37:14647
Junio C Hamanod79374c2005-12-03 09:45:57648/*
649 * First, one directory to try is determined by the following algorithm.
650 *
651 * (0) If "strict" is given, the path is used as given and no DWIM is
652 * done. Otherwise:
653 * (1) "~/path" to mean path under the running user's home directory;
654 * (2) "~user/path" to mean path under named user's home directory;
655 * (3) "relative/path" to mean cwd relative directory; or
656 * (4) "/absolute/path" to mean absolute directory.
657 *
Paul Tanc8c3f1d2015-03-31 13:39:27658 * Unless "strict" is given, we check "%s/.git", "%s", "%s.git/.git", "%s.git"
659 * in this order. We select the first one that is a valid git repository, and
660 * chdir() to it. If none match, or we fail to chdir, we return NULL.
Junio C Hamanod79374c2005-12-03 09:45:57661 *
662 * If all goes well, we return the directory we used to chdir() (but
663 * before ~user is expanded), avoiding getcwd() resolving symbolic
664 * links. User relative paths are also returned as they are given,
665 * except DWIM suffixing.
666 */
Erik Faye-Lund1c64b482011-10-04 20:02:00667const char *enter_repo(const char *path, int strict)
Junio C Hamanod79374c2005-12-03 09:45:57668{
Jeff Kinge9ba6782015-09-24 21:07:45669 static struct strbuf validated_path = STRBUF_INIT;
670 static struct strbuf used_path = STRBUF_INIT;
Junio C Hamanod79374c2005-12-03 09:45:57671
672 if (!path)
673 return NULL;
674
675 if (!strict) {
676 static const char *suffix[] = {
Jeff Kingb3256eb2012-02-02 21:59:13677 "/.git", "", ".git/.git", ".git", NULL,
Junio C Hamanod79374c2005-12-03 09:45:57678 };
Phil Hord03106762011-10-04 20:05:17679 const char *gitfile;
Junio C Hamanod79374c2005-12-03 09:45:57680 int len = strlen(path);
681 int i;
Erik Faye-Lund1c64b482011-10-04 20:02:00682 while ((1 < len) && (path[len-1] == '/'))
Junio C Hamanod79374c2005-12-03 09:45:57683 len--;
Erik Faye-Lund1c64b482011-10-04 20:02:00684
Jeff Kinge9ba6782015-09-24 21:07:45685 /*
686 * We can handle arbitrary-sized buffers, but this remains as a
687 * sanity check on untrusted input.
688 */
Junio C Hamanod79374c2005-12-03 09:45:57689 if (PATH_MAX <= len)
690 return NULL;
Erik Faye-Lund1c64b482011-10-04 20:02:00691
Jeff Kinge9ba6782015-09-24 21:07:45692 strbuf_reset(&used_path);
693 strbuf_reset(&validated_path);
694 strbuf_add(&used_path, path, len);
695 strbuf_add(&validated_path, path, len);
696
697 if (used_path.buf[0] == '~') {
698 char *newpath = expand_user_path(used_path.buf);
699 if (!newpath)
Junio C Hamanod79374c2005-12-03 09:45:57700 return NULL;
Jeff Kinge9ba6782015-09-24 21:07:45701 strbuf_attach(&used_path, newpath, strlen(newpath),
702 strlen(newpath));
Junio C Hamanod79374c2005-12-03 09:45:57703 }
Junio C Hamanod79374c2005-12-03 09:45:57704 for (i = 0; suffix[i]; i++) {
Jeff Kingb3256eb2012-02-02 21:59:13705 struct stat st;
Jeff Kinge9ba6782015-09-24 21:07:45706 size_t baselen = used_path.len;
707 strbuf_addstr(&used_path, suffix[i]);
708 if (!stat(used_path.buf, &st) &&
Jeff Kingb3256eb2012-02-02 21:59:13709 (S_ISREG(st.st_mode) ||
Jeff Kinge9ba6782015-09-24 21:07:45710 (S_ISDIR(st.st_mode) && is_git_directory(used_path.buf)))) {
711 strbuf_addstr(&validated_path, suffix[i]);
Junio C Hamanod79374c2005-12-03 09:45:57712 break;
713 }
Jeff Kinge9ba6782015-09-24 21:07:45714 strbuf_setlen(&used_path, baselen);
Junio C Hamanod79374c2005-12-03 09:45:57715 }
Phil Hord03106762011-10-04 20:05:17716 if (!suffix[i])
717 return NULL;
Junio C Hamano78891792015-10-20 22:24:00718 gitfile = read_gitfile(used_path.buf);
Jeff Kinge9ba6782015-09-24 21:07:45719 if (gitfile) {
720 strbuf_reset(&used_path);
721 strbuf_addstr(&used_path, gitfile);
722 }
723 if (chdir(used_path.buf))
Junio C Hamanod79374c2005-12-03 09:45:57724 return NULL;
Jeff Kinge9ba6782015-09-24 21:07:45725 path = validated_path.buf;
Junio C Hamanod79374c2005-12-03 09:45:57726 }
Nguyễn Thái Ngọc Duy1f5fbe12015-09-28 13:06:14727 else {
728 const char *gitfile = read_gitfile(path);
729 if (gitfile)
730 path = gitfile;
731 if (chdir(path))
732 return NULL;
733 }
Junio C Hamanod79374c2005-12-03 09:45:57734
Nguyễn Thái Ngọc Duy0f64cc42015-09-28 13:06:13735 if (is_git_directory(".")) {
René Scharfe717c3972010-02-06 09:35:19736 set_git_dir(".");
Junio C Hamano16441622005-11-25 18:48:26737 check_repository_format();
Junio C Hamanod79374c2005-12-03 09:45:57738 return path;
Andreas Ericsson54f4b872005-11-17 19:37:14739 }
740
741 return NULL;
742}
Junio C Hamano138086a2006-06-10 05:07:23743
Torsten Bögershausencbe43b82013-03-30 09:53:47744static int calc_shared_perm(int mode)
Junio C Hamano138086a2006-06-10 05:07:23745{
Torsten Bögershausencbe43b82013-03-30 09:53:47746 int tweak;
Junio C Hamano138086a2006-06-10 05:07:23747
Jeff King7875acb2016-03-11 22:36:49748 if (get_shared_repository() < 0)
749 tweak = -get_shared_repository();
Junio C Hamano5a688fe2009-03-25 23:19:36750 else
Jeff King7875acb2016-03-11 22:36:49751 tweak = get_shared_repository();
Junio C Hamano94df2502006-06-10 06:09:49752
Junio C Hamano5a688fe2009-03-25 23:19:36753 if (!(mode & S_IWUSR))
754 tweak &= ~0222;
755 if (mode & S_IXUSR)
756 /* Copy read bits to execute bits */
757 tweak |= (tweak & 0444) >> 2;
Jeff King7875acb2016-03-11 22:36:49758 if (get_shared_repository() < 0)
Junio C Hamano5a688fe2009-03-25 23:19:36759 mode = (mode & ~0777) | tweak;
760 else
Petr Baudis8c6202d2008-07-12 01:15:03761 mode |= tweak;
Junio C Hamano94df2502006-06-10 06:09:49762
Torsten Bögershausencbe43b82013-03-30 09:53:47763 return mode;
764}
765
766
767int adjust_shared_perm(const char *path)
768{
769 int old_mode, new_mode;
770
Jeff King7875acb2016-03-11 22:36:49771 if (!get_shared_repository())
Torsten Bögershausencbe43b82013-03-30 09:53:47772 return 0;
773 if (get_st_mode_bits(path, &old_mode) < 0)
774 return -1;
775
776 new_mode = calc_shared_perm(old_mode);
777 if (S_ISDIR(old_mode)) {
Heikki Orsila06cbe852008-04-16 08:34:24778 /* Copy read bits to execute bits */
Torsten Bögershausencbe43b82013-03-30 09:53:47779 new_mode |= (new_mode & 0444) >> 2;
780 new_mode |= FORCE_DIR_SET_GID;
Heikki Orsila06cbe852008-04-16 08:34:24781 }
782
Torsten Bögershausencbe43b82013-03-30 09:53:47783 if (((old_mode ^ new_mode) & ~S_IFMT) &&
784 chmod(path, (new_mode & ~S_IFMT)) < 0)
Junio C Hamano138086a2006-06-10 05:07:23785 return -2;
786 return 0;
787}
Johannes Schindeline5392c52007-08-01 00:28:59788
David Turnereb338762015-11-10 11:42:38789void safe_create_dir(const char *dir, int share)
790{
791 if (mkdir(dir, 0777) < 0) {
792 if (errno != EEXIST) {
793 perror(dir);
794 exit(1);
795 }
796 }
797 else if (share && adjust_shared_perm(dir))
798 die(_("Could not make %s writable by group"), dir);
799}
800
Jiang Xin7fbd4222013-10-14 02:29:39801static int have_same_root(const char *path1, const char *path2)
802{
803 int is_abs1, is_abs2;
804
805 is_abs1 = is_absolute_path(path1);
806 is_abs2 = is_absolute_path(path2);
807 return (is_abs1 && is_abs2 && tolower(path1[0]) == tolower(path2[0])) ||
808 (!is_abs1 && !is_abs2);
809}
810
Jiang Xine02ca722013-06-25 15:53:43811/*
812 * Give path as relative to prefix.
813 *
814 * The strbuf may or may not be used, so do not assume it contains the
815 * returned path.
816 */
817const char *relative_path(const char *in, const char *prefix,
818 struct strbuf *sb)
Linus Torvalds044bbbc2008-06-19 19:34:06819{
Jiang Xine02ca722013-06-25 15:53:43820 int in_len = in ? strlen(in) : 0;
821 int prefix_len = prefix ? strlen(prefix) : 0;
822 int in_off = 0;
823 int prefix_off = 0;
Junio C Hamano288123f2010-01-22 03:05:19824 int i = 0, j = 0;
825
Jiang Xine02ca722013-06-25 15:53:43826 if (!in_len)
827 return "./";
828 else if (!prefix_len)
829 return in;
830
Johannes Schindelin2f36eed2016-01-12 07:57:22831 if (have_same_root(in, prefix))
Jiang Xin7fbd4222013-10-14 02:29:39832 /* bypass dos_drive, for "c:" is identical to "C:" */
Johannes Schindelin2f36eed2016-01-12 07:57:22833 i = j = has_dos_drive_prefix(in);
834 else {
Jiang Xin7fbd4222013-10-14 02:29:39835 return in;
836 }
837
Jiang Xine02ca722013-06-25 15:53:43838 while (i < prefix_len && j < in_len && prefix[i] == in[j]) {
839 if (is_dir_sep(prefix[i])) {
840 while (is_dir_sep(prefix[i]))
Junio C Hamano288123f2010-01-22 03:05:19841 i++;
Jiang Xine02ca722013-06-25 15:53:43842 while (is_dir_sep(in[j]))
Junio C Hamano288123f2010-01-22 03:05:19843 j++;
Jiang Xine02ca722013-06-25 15:53:43844 prefix_off = i;
845 in_off = j;
846 } else {
847 i++;
848 j++;
849 }
850 }
851
852 if (
853 /* "prefix" seems like prefix of "in" */
854 i >= prefix_len &&
855 /*
856 * but "/foo" is not a prefix of "/foobar"
857 * (i.e. prefix not end with '/')
858 */
859 prefix_off < prefix_len) {
860 if (j >= in_len) {
861 /* in="/a/b", prefix="/a/b" */
862 in_off = in_len;
863 } else if (is_dir_sep(in[j])) {
864 /* in="/a/b/c", prefix="/a/b" */
865 while (is_dir_sep(in[j]))
866 j++;
867 in_off = j;
868 } else {
869 /* in="/a/bbb/c", prefix="/a/b" */
870 i = prefix_off;
871 }
872 } else if (
873 /* "in" is short than "prefix" */
874 j >= in_len &&
875 /* "in" not end with '/' */
876 in_off < in_len) {
877 if (is_dir_sep(prefix[i])) {
878 /* in="/a/b", prefix="/a/b/c/" */
879 while (is_dir_sep(prefix[i]))
880 i++;
881 in_off = in_len;
882 }
883 }
884 in += in_off;
885 in_len -= in_off;
886
887 if (i >= prefix_len) {
888 if (!in_len)
889 return "./";
890 else
891 return in;
892 }
893
894 strbuf_reset(sb);
895 strbuf_grow(sb, in_len);
896
897 while (i < prefix_len) {
898 if (is_dir_sep(prefix[i])) {
899 strbuf_addstr(sb, "../");
900 while (is_dir_sep(prefix[i]))
901 i++;
Junio C Hamano288123f2010-01-22 03:05:19902 continue;
Junio C Hamano288123f2010-01-22 03:05:19903 }
904 i++;
Junio C Hamano288123f2010-01-22 03:05:19905 }
Jiang Xine02ca722013-06-25 15:53:43906 if (!is_dir_sep(prefix[prefix_len - 1]))
907 strbuf_addstr(sb, "../");
908
909 strbuf_addstr(sb, in);
910
911 return sb->buf;
Linus Torvalds044bbbc2008-06-19 19:34:06912}
David Reissae299be2008-05-20 06:48:54913
914/*
Jiang Xin41894ae2013-10-14 02:29:40915 * A simpler implementation of relative_path
916 *
917 * Get relative path by removing "prefix" from "in". This function
918 * first appears in v1.5.6-1-g044bbbc, and makes git_dir shorter
919 * to increase performance when traversing the path to work_tree.
920 */
921const char *remove_leading_path(const char *in, const char *prefix)
922{
Jeff King46357682015-09-24 21:07:47923 static struct strbuf buf = STRBUF_INIT;
Jiang Xin41894ae2013-10-14 02:29:40924 int i = 0, j = 0;
925
926 if (!prefix || !prefix[0])
927 return in;
928 while (prefix[i]) {
929 if (is_dir_sep(prefix[i])) {
930 if (!is_dir_sep(in[j]))
931 return in;
932 while (is_dir_sep(prefix[i]))
933 i++;
934 while (is_dir_sep(in[j]))
935 j++;
936 continue;
937 } else if (in[j] != prefix[i]) {
938 return in;
939 }
940 i++;
941 j++;
942 }
943 if (
944 /* "/foo" is a prefix of "/foo" */
945 in[j] &&
946 /* "/foo" is not a prefix of "/foobar" */
947 !is_dir_sep(prefix[i-1]) && !is_dir_sep(in[j])
948 )
949 return in;
950 while (is_dir_sep(in[j]))
951 j++;
Jeff King46357682015-09-24 21:07:47952
953 strbuf_reset(&buf);
Jiang Xin41894ae2013-10-14 02:29:40954 if (!in[j])
Jeff King46357682015-09-24 21:07:47955 strbuf_addstr(&buf, ".");
Jiang Xin41894ae2013-10-14 02:29:40956 else
Jeff King46357682015-09-24 21:07:47957 strbuf_addstr(&buf, in + j);
958 return buf.buf;
Jiang Xin41894ae2013-10-14 02:29:40959}
960
961/*
Johannes Sixtf2a782b2009-02-07 15:08:31962 * It is okay if dst == src, but they should not overlap otherwise.
David Reissae299be2008-05-20 06:48:54963 *
Johannes Sixtf2a782b2009-02-07 15:08:31964 * Performs the following normalizations on src, storing the result in dst:
965 * - Ensures that components are separated by '/' (Windows only)
966 * - Squashes sequences of '/'.
David Reissae299be2008-05-20 06:48:54967 * - Removes "." components.
968 * - Removes ".." components, and the components the precede them.
Johannes Sixtf2a782b2009-02-07 15:08:31969 * Returns failure (non-zero) if a ".." component appears as first path
970 * component anytime during the normalization. Otherwise, returns success (0).
David Reissae299be2008-05-20 06:48:54971 *
972 * Note that this function is purely textual. It does not follow symlinks,
973 * verify the existence of the path, or make any system calls.
Nguyễn Thái Ngọc Duy645a29c2013-07-14 08:36:03974 *
975 * prefix_len != NULL is for a specific case of prefix_pathspec():
976 * assume that src == dst and src[0..prefix_len-1] is already
977 * normalized, any time "../" eats up to the prefix_len part,
978 * prefix_len is reduced. In the end prefix_len is the remaining
979 * prefix that has not been overridden by user pathspec.
Ray Donnellyb2a71232015-10-01 19:04:17980 *
981 * NEEDSWORK: This function doesn't perform normalization w.r.t. trailing '/'.
982 * For everything but the root folder itself, the normalized path should not
983 * end with a '/', then the callers need to be fixed up accordingly.
984 *
David Reissae299be2008-05-20 06:48:54985 */
Nguyễn Thái Ngọc Duy645a29c2013-07-14 08:36:03986int normalize_path_copy_len(char *dst, const char *src, int *prefix_len)
David Reissae299be2008-05-20 06:48:54987{
Johannes Sixtf3cad0a2009-02-07 15:08:28988 char *dst0;
Johannes Schindelin2f36eed2016-01-12 07:57:22989 int i;
David Reissae299be2008-05-20 06:48:54990
Johannes Schindelin2f36eed2016-01-12 07:57:22991 for (i = has_dos_drive_prefix(src); i > 0; i--)
Johannes Sixtf3cad0a2009-02-07 15:08:28992 *dst++ = *src++;
Johannes Sixtf3cad0a2009-02-07 15:08:28993 dst0 = dst;
David Reissae299be2008-05-20 06:48:54994
Johannes Sixtf3cad0a2009-02-07 15:08:28995 if (is_dir_sep(*src)) {
996 *dst++ = '/';
997 while (is_dir_sep(*src))
998 src++;
David Reissae299be2008-05-20 06:48:54999 }
1000
Johannes Sixtf3cad0a2009-02-07 15:08:281001 for (;;) {
1002 char c = *src;
David Reissae299be2008-05-20 06:48:541003
Johannes Sixtf3cad0a2009-02-07 15:08:281004 /*
1005 * A path component that begins with . could be
1006 * special:
1007 * (1) "." and ends -- ignore and terminate.
1008 * (2) "./" -- ignore them, eat slash and continue.
1009 * (3) ".." and ends -- strip one and terminate.
1010 * (4) "../" -- strip one, eat slash and continue.
1011 */
1012 if (c == '.') {
1013 if (!src[1]) {
1014 /* (1) */
1015 src++;
1016 } else if (is_dir_sep(src[1])) {
1017 /* (2) */
1018 src += 2;
1019 while (is_dir_sep(*src))
1020 src++;
1021 continue;
1022 } else if (src[1] == '.') {
1023 if (!src[2]) {
1024 /* (3) */
1025 src += 2;
1026 goto up_one;
1027 } else if (is_dir_sep(src[2])) {
1028 /* (4) */
1029 src += 3;
1030 while (is_dir_sep(*src))
1031 src++;
1032 goto up_one;
1033 }
1034 }
1035 }
1036
1037 /* copy up to the next '/', and eat all '/' */
1038 while ((c = *src++) != '\0' && !is_dir_sep(c))
1039 *dst++ = c;
1040 if (is_dir_sep(c)) {
1041 *dst++ = '/';
1042 while (is_dir_sep(c))
1043 c = *src++;
1044 src--;
1045 } else if (!c)
1046 break;
1047 continue;
1048
1049 up_one:
1050 /*
1051 * dst0..dst is prefix portion, and dst[-1] is '/';
1052 * go up one level.
1053 */
Johannes Sixtf42302b2009-02-07 15:08:301054 dst--; /* go to trailing '/' */
1055 if (dst <= dst0)
Johannes Sixtf3cad0a2009-02-07 15:08:281056 return -1;
Johannes Sixtf42302b2009-02-07 15:08:301057 /* Windows: dst[-1] cannot be backslash anymore */
1058 while (dst0 < dst && dst[-1] != '/')
1059 dst--;
Nguyễn Thái Ngọc Duy645a29c2013-07-14 08:36:031060 if (prefix_len && *prefix_len > dst - dst0)
1061 *prefix_len = dst - dst0;
Johannes Sixtf3cad0a2009-02-07 15:08:281062 }
David Reissae299be2008-05-20 06:48:541063 *dst = '\0';
Johannes Sixtf3cad0a2009-02-07 15:08:281064 return 0;
David Reissae299be2008-05-20 06:48:541065}
David Reiss0454dd92008-05-20 06:49:261066
Nguyễn Thái Ngọc Duy645a29c2013-07-14 08:36:031067int normalize_path_copy(char *dst, const char *src)
1068{
1069 return normalize_path_copy_len(dst, src, NULL);
1070}
1071
David Reiss0454dd92008-05-20 06:49:261072/*
1073 * path = Canonical absolute path
Michael Haggerty9e2326c2012-10-28 16:16:251074 * prefixes = string_list containing normalized, absolute paths without
1075 * trailing slashes (except for the root directory, which is denoted by "/").
David Reiss0454dd92008-05-20 06:49:261076 *
Michael Haggerty9e2326c2012-10-28 16:16:251077 * Determines, for each path in prefixes, whether the "prefix"
David Reiss0454dd92008-05-20 06:49:261078 * is an ancestor directory of path. Returns the length of the longest
1079 * ancestor directory, excluding any trailing slashes, or -1 if no prefix
Michael Haggerty31171d92012-10-28 16:16:241080 * is an ancestor. (Note that this means 0 is returned if prefixes is
1081 * ["/"].) "/foo" is not considered an ancestor of "/foobar". Directories
David Reiss0454dd92008-05-20 06:49:261082 * are not considered to be their own ancestors. path must be in a
1083 * canonical form: empty components, or "." or ".." components are not
Michael Haggerty9e2326c2012-10-28 16:16:251084 * allowed.
David Reiss0454dd92008-05-20 06:49:261085 */
Michael Haggerty31171d92012-10-28 16:16:241086int longest_ancestor_length(const char *path, struct string_list *prefixes)
David Reiss0454dd92008-05-20 06:49:261087{
Michael Haggertya5ccdbe2012-10-28 16:16:231088 int i, max_len = -1;
David Reiss0454dd92008-05-20 06:49:261089
Michael Haggerty31171d92012-10-28 16:16:241090 if (!strcmp(path, "/"))
David Reiss0454dd92008-05-20 06:49:261091 return -1;
1092
Michael Haggerty31171d92012-10-28 16:16:241093 for (i = 0; i < prefixes->nr; i++) {
1094 const char *ceil = prefixes->items[i].string;
Michael Haggertya5ccdbe2012-10-28 16:16:231095 int len = strlen(ceil);
1096
Michael Haggerty9e2326c2012-10-28 16:16:251097 if (len == 1 && ceil[0] == '/')
1098 len = 0; /* root matches anything, with length 0 */
1099 else if (!strncmp(path, ceil, len) && path[len] == '/')
1100 ; /* match of length len */
1101 else
1102 continue; /* no match */
David Reiss0454dd92008-05-20 06:49:261103
Michael Haggerty9e2326c2012-10-28 16:16:251104 if (len > max_len)
David Reiss0454dd92008-05-20 06:49:261105 max_len = len;
David Reiss0454dd92008-05-20 06:49:261106 }
1107
1108 return max_len;
1109}
Johannes Schindelin4fcc86b2009-02-19 19:10:491110
1111/* strip arbitrary amount of directory separators at end of path */
1112static inline int chomp_trailing_dir_sep(const char *path, int len)
1113{
1114 while (len && is_dir_sep(path[len - 1]))
1115 len--;
1116 return len;
1117}
1118
1119/*
1120 * If path ends with suffix (complete path components), returns the
1121 * part before suffix (sans trailing directory separators).
1122 * Otherwise returns NULL.
1123 */
1124char *strip_path_suffix(const char *path, const char *suffix)
1125{
1126 int path_len = strlen(path), suffix_len = strlen(suffix);
1127
1128 while (suffix_len) {
1129 if (!path_len)
1130 return NULL;
1131
1132 if (is_dir_sep(path[path_len - 1])) {
1133 if (!is_dir_sep(suffix[suffix_len - 1]))
1134 return NULL;
1135 path_len = chomp_trailing_dir_sep(path, path_len);
1136 suffix_len = chomp_trailing_dir_sep(suffix, suffix_len);
1137 }
1138 else if (path[--path_len] != suffix[--suffix_len])
1139 return NULL;
1140 }
1141
1142 if (path_len && !is_dir_sep(path[path_len - 1]))
1143 return NULL;
1144 return xstrndup(path, chomp_trailing_dir_sep(path, path_len));
1145}
Shawn O. Pearce34b6cb82009-11-09 19:26:431146
1147int daemon_avoid_alias(const char *p)
1148{
1149 int sl, ndot;
1150
1151 /*
1152 * This resurrects the belts and suspenders paranoia check by HPA
1153 * done in <435560F7.4080006@zytor.com> thread, now enter_repo()
Junio C Hamano9517e6b2010-02-04 05:23:181154 * does not do getcwd() based path canonicalization.
Shawn O. Pearce34b6cb82009-11-09 19:26:431155 *
1156 * sl becomes true immediately after seeing '/' and continues to
1157 * be true as long as dots continue after that without intervening
1158 * non-dot character.
1159 */
1160 if (!p || (*p != '/' && *p != '~'))
1161 return -1;
1162 sl = 1; ndot = 0;
1163 p++;
1164
1165 while (1) {
1166 char ch = *p++;
1167 if (sl) {
1168 if (ch == '.')
1169 ndot++;
1170 else if (ch == '/') {
1171 if (ndot < 3)
1172 /* reject //, /./ and /../ */
1173 return -1;
1174 ndot = 0;
1175 }
1176 else if (ch == 0) {
1177 if (0 < ndot && ndot < 3)
1178 /* reject /.$ and /..$ */
1179 return -1;
1180 return 0;
1181 }
1182 else
1183 sl = ndot = 0;
1184 }
1185 else if (ch == 0)
1186 return 0;
1187 else if (ch == '/') {
1188 sl = 1;
1189 ndot = 0;
1190 }
1191 }
1192}
Nguyễn Thái Ngọc Duy4bb43de2010-02-16 05:22:081193
Johannes Schindelin1d1d69b2014-12-16 22:31:031194static int only_spaces_and_periods(const char *path, size_t len, size_t skip)
1195{
1196 if (len < skip)
1197 return 0;
1198 len -= skip;
1199 path += skip;
1200 while (len-- > 0) {
1201 char c = *(path++);
1202 if (c != ' ' && c != '.')
1203 return 0;
1204 }
1205 return 1;
1206}
1207
1208int is_ntfs_dotgit(const char *name)
1209{
1210 int len;
1211
1212 for (len = 0; ; len++)
1213 if (!name[len] || name[len] == '\\' || is_dir_sep(name[len])) {
1214 if (only_spaces_and_periods(name, len, 4) &&
1215 !strncasecmp(name, ".git", 4))
1216 return 1;
1217 if (only_spaces_and_periods(name, len, 5) &&
1218 !strncasecmp(name, "git~1", 5))
1219 return 1;
1220 if (name[len] != '\\')
1221 return 0;
1222 name += len + 1;
1223 len = -1;
1224 }
1225}
Paul Tanea192892015-04-21 04:06:271226
1227char *xdg_config_home(const char *filename)
1228{
1229 const char *home, *config_home;
1230
1231 assert(filename);
1232 config_home = getenv("XDG_CONFIG_HOME");
1233 if (config_home && *config_home)
1234 return mkpathdup("%s/git/%s", config_home, filename);
1235
1236 home = getenv("HOME");
1237 if (home)
1238 return mkpathdup("%s/.config/git/%s", home, filename);
1239 return NULL;
1240}
Jeff Kingf9327292015-08-10 09:38:571241
1242GIT_PATH_FUNC(git_path_cherry_pick_head, "CHERRY_PICK_HEAD")
1243GIT_PATH_FUNC(git_path_revert_head, "REVERT_HEAD")
1244GIT_PATH_FUNC(git_path_squash_msg, "SQUASH_MSG")
1245GIT_PATH_FUNC(git_path_merge_msg, "MERGE_MSG")
1246GIT_PATH_FUNC(git_path_merge_rr, "MERGE_RR")
1247GIT_PATH_FUNC(git_path_merge_mode, "MERGE_MODE")
1248GIT_PATH_FUNC(git_path_merge_head, "MERGE_HEAD")
1249GIT_PATH_FUNC(git_path_fetch_head, "FETCH_HEAD")
1250GIT_PATH_FUNC(git_path_shallow, "shallow")