]>
Commit | Line | Data |
---|---|---|
0fcfd160 LT |
1 | /* |
2 | * GIT - The information manager from hell | |
3 | * | |
4 | * Copyright (C) Linus Torvalds, 2005 | |
5 | */ | |
4050c0df | 6 | #include "git-compat-util.h" |
3bc4181f | 7 | #include "cache.h" |
0fcfd160 | 8 | |
ebaa79f4 | 9 | void vreportf(const char *prefix, const char *err, va_list params) |
0fcfd160 | 10 | { |
b5a9e435 | 11 | char msg[4096]; |
116d1fa6 JS |
12 | char *p, *pend = msg + sizeof(msg); |
13 | size_t prefix_len = strlen(prefix); | |
f4c3edc0 | 14 | |
116d1fa6 JS |
15 | if (sizeof(msg) <= prefix_len) { |
16 | fprintf(stderr, "BUG!!! too long a prefix '%s'\n", prefix); | |
17 | abort(); | |
18 | } | |
19 | memcpy(msg, prefix, prefix_len); | |
20 | p = msg + prefix_len; | |
21 | if (vsnprintf(p, pend - p, err, params) < 0) | |
22 | *p = '\0'; /* vsnprintf() failed, clip at prefix */ | |
23 | ||
24 | for (; p != pend - 1 && *p; p++) { | |
f2900898 JK |
25 | if (iscntrl(*p) && *p != '\t' && *p != '\n') |
26 | *p = '?'; | |
f4c3edc0 | 27 | } |
116d1fa6 JS |
28 | |
29 | *(p++) = '\n'; /* we no longer need a NUL */ | |
30 | fflush(stderr); | |
31 | write_in_full(2, msg, p - msg); | |
3bc4181f CB |
32 | } |
33 | ||
64b1cb74 | 34 | static NORETURN void usage_builtin(const char *err, va_list params) |
0fcfd160 | 35 | { |
ebaa79f4 | 36 | vreportf("usage: ", err, params); |
ee4512ed JH |
37 | |
38 | /* | |
39 | * When we detect a usage error *before* the command dispatch in | |
40 | * cmd_main(), we don't know what verb to report. Force it to this | |
41 | * to facilitate post-processing. | |
42 | */ | |
43 | trace2_cmd_name("_usage_"); | |
44 | ||
45 | /* | |
46 | * Currently, the (err, params) are usually just the static usage | |
47 | * string which isn't very useful here. Usually, the call site | |
48 | * manually calls fprintf(stderr,...) with the actual detailed | |
49 | * syntax error before calling usage(). | |
50 | * | |
51 | * TODO It would be nice to update the call sites to pass both | |
52 | * the static usage string and the detailed error message. | |
53 | */ | |
54 | ||
5d1a5c02 | 55 | exit(129); |
0fcfd160 LT |
56 | } |
57 | ||
ce88ac5b | 58 | static NORETURN void die_builtin(const char *err, va_list params) |
39a3f5ea | 59 | { |
ee4512ed JH |
60 | /* |
61 | * We call this trace2 function first and expect it to va_copy 'params' | |
62 | * before using it (because an 'ap' can only be walked once). | |
63 | */ | |
64 | trace2_cmd_error_va(err, params); | |
65 | ||
ebaa79f4 | 66 | vreportf("fatal: ", err, params); |
ee4512ed | 67 | |
39a3f5ea PB |
68 | exit(128); |
69 | } | |
70 | ||
ce88ac5b | 71 | static void error_builtin(const char *err, va_list params) |
39a3f5ea | 72 | { |
ee4512ed JH |
73 | /* |
74 | * We call this trace2 function first and expect it to va_copy 'params' | |
75 | * before using it (because an 'ap' can only be walked once). | |
76 | */ | |
77 | trace2_cmd_error_va(err, params); | |
78 | ||
ebaa79f4 | 79 | vreportf("error: ", err, params); |
39a3f5ea PB |
80 | } |
81 | ||
fa39b6b5 SP |
82 | static void warn_builtin(const char *warn, va_list params) |
83 | { | |
0ee10fd1 JT |
84 | /* |
85 | * We call this trace2 function first and expect it to va_copy 'params' | |
86 | * before using it (because an 'ap' can only be walked once). | |
87 | */ | |
88 | trace2_cmd_error_va(warn, params); | |
89 | ||
ebaa79f4 | 90 | vreportf("warning: ", warn, params); |
fa39b6b5 | 91 | } |
39a3f5ea | 92 | |
c19a490e JK |
93 | static int die_is_recursing_builtin(void) |
94 | { | |
95 | static int dying; | |
2d3c02f5 ÆAB |
96 | /* |
97 | * Just an arbitrary number X where "a < x < b" where "a" is | |
98 | * "maximum number of pthreads we'll ever plausibly spawn" and | |
99 | * "b" is "something less than Inf", since the point is to | |
100 | * prevent infinite recursion. | |
101 | */ | |
102 | static const int recursion_limit = 1024; | |
103 | ||
104 | dying++; | |
105 | if (dying > recursion_limit) { | |
106 | return 1; | |
107 | } else if (dying == 2) { | |
108 | warning("die() called many times. Recursion error or racy threaded death!"); | |
109 | return 0; | |
110 | } else { | |
111 | return 0; | |
112 | } | |
c19a490e JK |
113 | } |
114 | ||
39a3f5ea PB |
115 | /* If we are in a dlopen()ed .so write to a global variable would segfault |
116 | * (ugh), so keep things static. */ | |
5710dcce JK |
117 | static NORETURN_PTR report_fn usage_routine = usage_builtin; |
118 | static NORETURN_PTR report_fn die_routine = die_builtin; | |
119 | static report_fn error_routine = error_builtin; | |
120 | static report_fn warn_routine = warn_builtin; | |
c19a490e | 121 | static int (*die_is_recursing)(void) = die_is_recursing_builtin; |
39a3f5ea | 122 | |
5710dcce | 123 | void set_die_routine(NORETURN_PTR report_fn routine) |
39a3f5ea PB |
124 | { |
125 | die_routine = routine; | |
126 | } | |
127 | ||
5710dcce | 128 | void set_error_routine(report_fn routine) |
3bc4181f CB |
129 | { |
130 | error_routine = routine; | |
131 | } | |
132 | ||
5710dcce | 133 | report_fn get_error_routine(void) |
725149be CC |
134 | { |
135 | return error_routine; | |
136 | } | |
137 | ||
5710dcce | 138 | void set_warn_routine(report_fn routine) |
b83f108b CC |
139 | { |
140 | warn_routine = routine; | |
141 | } | |
142 | ||
5710dcce | 143 | report_fn get_warn_routine(void) |
725149be CC |
144 | { |
145 | return warn_routine; | |
146 | } | |
147 | ||
c19a490e JK |
148 | void set_die_is_recursing_routine(int (*routine)(void)) |
149 | { | |
150 | die_is_recursing = routine; | |
151 | } | |
152 | ||
c2e86add | 153 | void NORETURN usagef(const char *err, ...) |
64b1cb74 JN |
154 | { |
155 | va_list params; | |
156 | ||
157 | va_start(params, err); | |
158 | usage_routine(err, params); | |
159 | va_end(params); | |
160 | } | |
161 | ||
c2e86add | 162 | void NORETURN usage(const char *err) |
39a3f5ea | 163 | { |
64b1cb74 | 164 | usagef("%s", err); |
39a3f5ea PB |
165 | } |
166 | ||
c2e86add | 167 | void NORETURN die(const char *err, ...) |
0fcfd160 LT |
168 | { |
169 | va_list params; | |
170 | ||
c19a490e | 171 | if (die_is_recursing()) { |
cd163d4b BC |
172 | fputs("fatal: recursion detected in die handler\n", stderr); |
173 | exit(128); | |
174 | } | |
cd163d4b | 175 | |
0fcfd160 | 176 | va_start(params, err); |
39a3f5ea | 177 | die_routine(err, params); |
0fcfd160 | 178 | va_end(params); |
0fcfd160 LT |
179 | } |
180 | ||
58e4e511 | 181 | static const char *fmt_with_err(char *buf, int n, const char *fmt) |
b875036e | 182 | { |
f8b5a8e1 JH |
183 | char str_error[256], *err; |
184 | int i, j; | |
185 | ||
186 | err = strerror(errno); | |
187 | for (i = j = 0; err[i] && j < sizeof(str_error) - 1; ) { | |
188 | if ((str_error[j++] = err[i++]) != '%') | |
189 | continue; | |
190 | if (j < sizeof(str_error) - 1) { | |
191 | str_error[j++] = '%'; | |
192 | } else { | |
193 | /* No room to double the '%', so we overwrite it with | |
194 | * '\0' below */ | |
195 | j--; | |
196 | break; | |
197 | } | |
198 | } | |
199 | str_error[j] = 0; | |
ac4896f0 | 200 | /* Truncation is acceptable here */ |
58e4e511 NTND |
201 | snprintf(buf, n, "%s: %s", fmt, str_error); |
202 | return buf; | |
203 | } | |
204 | ||
205 | void NORETURN die_errno(const char *fmt, ...) | |
206 | { | |
207 | char buf[1024]; | |
208 | va_list params; | |
209 | ||
210 | if (die_is_recursing()) { | |
211 | fputs("fatal: recursion detected in die_errno handler\n", | |
212 | stderr); | |
213 | exit(128); | |
214 | } | |
b875036e TR |
215 | |
216 | va_start(params, fmt); | |
58e4e511 | 217 | die_routine(fmt_with_err(buf, sizeof(buf), fmt), params); |
b875036e TR |
218 | va_end(params); |
219 | } | |
220 | ||
4df5e918 | 221 | #undef error_errno |
fd1d6723 NTND |
222 | int error_errno(const char *fmt, ...) |
223 | { | |
224 | char buf[1024]; | |
225 | va_list params; | |
226 | ||
227 | va_start(params, fmt); | |
228 | error_routine(fmt_with_err(buf, sizeof(buf), fmt), params); | |
229 | va_end(params); | |
230 | return -1; | |
231 | } | |
232 | ||
e208f9cc | 233 | #undef error |
0fcfd160 LT |
234 | int error(const char *err, ...) |
235 | { | |
236 | va_list params; | |
237 | ||
238 | va_start(params, err); | |
39a3f5ea | 239 | error_routine(err, params); |
0fcfd160 LT |
240 | va_end(params); |
241 | return -1; | |
242 | } | |
fa39b6b5 | 243 | |
fd1d6723 NTND |
244 | void warning_errno(const char *warn, ...) |
245 | { | |
246 | char buf[1024]; | |
247 | va_list params; | |
248 | ||
249 | va_start(params, warn); | |
250 | warn_routine(fmt_with_err(buf, sizeof(buf), warn), params); | |
251 | va_end(params); | |
252 | } | |
253 | ||
46efd2d9 | 254 | void warning(const char *warn, ...) |
fa39b6b5 SP |
255 | { |
256 | va_list params; | |
257 | ||
258 | va_start(params, warn); | |
259 | warn_routine(warn, params); | |
260 | va_end(params); | |
261 | } | |
d8193743 | 262 | |
a86303cb JS |
263 | /* Only set this, ever, from t/helper/, when verifying that bugs are caught. */ |
264 | int BUG_exit_code; | |
265 | ||
d8193743 JK |
266 | static NORETURN void BUG_vfl(const char *file, int line, const char *fmt, va_list params) |
267 | { | |
268 | char prefix[256]; | |
269 | ||
270 | /* truncation via snprintf is OK here */ | |
271 | if (file) | |
272 | snprintf(prefix, sizeof(prefix), "BUG: %s:%d: ", file, line); | |
273 | else | |
274 | snprintf(prefix, sizeof(prefix), "BUG: "); | |
275 | ||
276 | vreportf(prefix, fmt, params); | |
a86303cb JS |
277 | if (BUG_exit_code) |
278 | exit(BUG_exit_code); | |
d8193743 JK |
279 | abort(); |
280 | } | |
281 | ||
282 | #ifdef HAVE_VARIADIC_MACROS | |
3d7dd2d3 | 283 | NORETURN void BUG_fl(const char *file, int line, const char *fmt, ...) |
d8193743 JK |
284 | { |
285 | va_list ap; | |
286 | va_start(ap, fmt); | |
287 | BUG_vfl(file, line, fmt, ap); | |
288 | va_end(ap); | |
289 | } | |
290 | #else | |
3d7dd2d3 | 291 | NORETURN void BUG(const char *fmt, ...) |
d8193743 JK |
292 | { |
293 | va_list ap; | |
294 | va_start(ap, fmt); | |
295 | BUG_vfl(NULL, 0, fmt, ap); | |
296 | va_end(ap); | |
297 | } | |
298 | #endif | |
0e5bba53 JK |
299 | |
300 | #ifdef SUPPRESS_ANNOTATED_LEAKS | |
301 | void unleak_memory(const void *ptr, size_t len) | |
302 | { | |
303 | static struct suppressed_leak_root { | |
304 | struct suppressed_leak_root *next; | |
305 | char data[FLEX_ARRAY]; | |
306 | } *suppressed_leaks; | |
307 | struct suppressed_leak_root *root; | |
308 | ||
309 | FLEX_ALLOC_MEM(root, data, ptr, len); | |
310 | root->next = suppressed_leaks; | |
311 | suppressed_leaks = root; | |
312 | } | |
313 | #endif |