* bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory
@ 2024-04-16 13:36 1stmil.eth via Bug reports for GNU Emacs, the Swiss army knife of text editors
2024-04-16 15:52 ` bug#70423: Possible workaround/culprit pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
` (2 more replies)
0 siblings, 3 replies; 15+ messages in thread
From: 1stmil.eth via Bug reports for GNU Emacs, the Swiss army knife of text editors @ 2024-04-16 13:36 UTC (permalink / raw)
To: 70423
[-- Attachment #1.1.1: Type: text/plain, Size: 93308 bytes --]
Among other scenarios, when clang-format runs as a hook on file save when I make any (even noop) edit in https://github.com/pillowtrucker/mir/blob/main/src/platform/graphics/drm_formats.cpp this file, for example, emacs enters an infinite loop consuming 100% of a cpu core and all memory up to gc threshold.
It is not always the regex function on the top of the stack but it is always a call around those functions
"beginning-of-defun-raw"
"beginning-of-defun"
"c-get-fallback-scan-pos"
(gdb) bt full
#0 re_match_2_internal (bufp=bufp@entry=0xbbab68 <searchbufs+1832>,
string1=string1@entry=0xe479dd0 "/*\n * Copyright © Canonical Ltd.\n *\n * This program is free software: you can redistribute it and/or modify it\n * under the terms of the GNU Lesser
General Public License version 2 or 3,\n * as publis"..., size1=size1@entry=12659,
string2=string2@entry=0xe47d713 "\n return mir_pixel_format_rgb_565;\n case DRM_FORMAT_RGB888:\n return mir_pixel_format_rgb_888;\n case DRM_FORMAT_BGR888:\n
return mir_pixel_format_bgr_888;\n case DRM_FORMAT_"..., size2=size2@entry=6251, pos=pos@entry=14819, regs=0xb2c1f8 <main_thread+152>, stop=14855) at regex-emacs.c:4674
mcnt = <optimized out>
end1 = 0xe47cf43 ""
end2 = 0xe47ef7e ""
end_match_1 = 0xe47cf43 ""
end_match_2 = 0xe47dfa7 "\n {\n", ' ' <repeats 12 times>, "if (c_str)\n", ' ' <repeats 12 times>, "{\n", ' ' <repeats 16 times>, "free (c_str);\n", ' ' <repeats 12 times>, "}
\n }\n };\n\n auto const vendor =\n [&]() -> std::string\n {\n", ' ' <repeats 12 times>, "std::unique_ptr"...
d = 0xe47df9a "(char* c_str)\n {\n", ' ' <repeats 12 times>, "if (c_str)\n", ' ' <repeats 12 times>, "{\n", ' ' <repeats 16 times>, "free (c_str);\n", ' ' <repeats 12 times>,
"}\n }\n };\n\n auto const vendor =\n [&]() -> std::string\n {\n", ' ' <repeats 12 times>, "st"...
dend = 0xe47dfa7 "\n {\n", ' ' <repeats 12 times>, "if (c_str)\n", ' ' <repeats 12 times>, "{\n", ' ' <repeats 16 times>, "free (c_str);\n", ' ' <repeats 12 times>, "}\n
}\n };\n\n auto const vendor =\n [&]() -> std::string\n {\n", ' ' <repeats 12 times>, "std::unique_ptr"...
dfail = <optimized out>
p = 0x10c1c715 "@"
pend = 0x10c1c766 ""
translate = XIL(0x7ffff243b685)
multibyte = false
target_multibyte = true
fail_stack = {
stack = 0x7fffffff04a0,
size = 320,
avail = 57,
frame = 54
}
num_regs = 18
regstart = <optimized out>
regend = <optimized out>
best_regs_set = false
best_regstart = 0x7fffffff1258
best_regend = 0x7fffffff12e0
match_end = 0x0
nchars = 93
sa_avail = 6395128
sa_count = <optimized out>
count = <optimized out>
re_nsub = 17
#1 0x000000000056ec52 in re_search_2 (bufp=bufp@entry=0xbbab68 <searchbufs+1832>,
str1=str1@entry=0xe479dd0 "/*\n * Copyright © Canonical Ltd.\n *\n * This program is free software: you can redistribute it and/or modify it\n * under the terms of the GNU Lesser Genera
l Public License version 2 or 3,\n * as publis"..., size1=size1@entry=12659,
str2=str2@entry=0xe47d713 "\n return mir_pixel_format_rgb_565;\n case DRM_FORMAT_RGB888:\n return mir_pixel_format_rgb_888;\n case DRM_FORMAT_BGR888:\n return
mir_pixel_format_bgr_888;\n case DRM_FORMAT_"..., size2=size2@entry=6251, startpos=14819, range=-14819, regs=0xb2c1f8 <main_thread+152>, stop=14855) at regex-emacs.c:3383
val = <optimized out>
string1 = 0xe479dd0 "/*\n * Copyright © Canonical Ltd.\n *\n * This program is free software: you can redistribute it and/or modify it\n * under the terms of the GNU Lesser General-
-Type <RET> for more, q to quit, c to continue without paging--c
Public License version 2 or 3,\n * as publis"...
string2 = 0xe47d713 "\n return mir_pixel_format_rgb_565;\n case DRM_FORMAT_RGB888:\n return mir_pixel_format_rgb_888;\n case DRM_FORMAT_BGR888:\n return m
ir_pixel_format_bgr_888;\n case DRM_FORMAT_"...
fastmap = 0xbbaba8 <searchbufs+1896> ""
translate = XIL(0x7ffff243b685)
total_size = 18910
endpos = <optimized out>
anchored_start = false
multibyte = true
#2 0x0000000000560e0b in search_buffer_re (string=string@entry=XIL(0x26203664), pos=pos@entry=14855, pos_byte=pos_byte@entry=14856, lim=lim@entry=1, lim_byte=lim_byte@entry=1,
n=n@entry=-1, trt=XIL(0x7ffff243b685), inverse_trt=XIL(0x7ffff1e641bd), posix=false) at search.c:1218
val = <optimized out>
p1 = 0xe479dd0 "/*\n * Copyright © Canonical Ltd.\n *\n * This program is free software: you can redistribute it and/or modify it\n * under the terms of the GNU Lesser General Publi
c License version 2 or 3,\n * as publis"...
p2 = 0xe47d713 "\n return mir_pixel_format_rgb_565;\n case DRM_FORMAT_RGB888:\n return mir_pixel_format_rgb_888;\n case DRM_FORMAT_BGR888:\n return mir_pi
xel_format_bgr_888;\n case DRM_FORMAT_"...
s1 = 12659
s2 = 6251
preserve_match_data = true
cache_entry = 0xbbab48 <searchbufs+1800>
bufp = 0xbbab68 <searchbufs+1832>
count = <optimized out>
#3 0x0000000000564b36 in search_buffer (string=string@entry=XIL(0x26203664), pos=14855, pos_byte=14856, lim=lim@entry=1, lim_byte=lim_byte@entry=1, n=n@entry=-1, RE=1,
trt=XIL(0x7ffff243b685), inverse_trt=XIL(0x7ffff1e641bd), posix=false) at search.c:1527
No locals.
#4 0x0000000000564ce6 in search_command (string=XIL(0x26203664), bound=<optimized out>, noerror=XIL(0xbc40), count=<optimized out>, direction=direction@entry=-1, RE=RE@entry=1,
posix=false) at search.c:1069
np = <optimized out>
lim = 1
lim_byte = 1
n = -1
#5 0x0000000000564e36 in Fre_search_backward (regexp=<optimized out>, bound=<optimized out>, noerror=<optimized out>, count=<optimized out>) at search.c:2263
No locals.
#6 0x0000000000595715 in funcall_subr (subr=subr@entry=0xb3df80 <Sre_search_backward>, numargs=numargs@entry=4, args=args@entry=0x7fffffff2508) at eval.c:3044
argbuf = {XIL(0x7fffffff24b0), XIL(0xf1f1a9b4), XIL(0x1), make_fixnum(1429044), XIL(0x108d4218), XIL(0x573900), XIL(0), make_fixnum(1473060)}
a = <optimized out>
fun = <optimized out>
#7 0x000000000059703e in funcall_general (fun=XIL(0xb3df85), numargs=numargs@entry=4, args=args@entry=0x7fffffff2508) at eval.c:2945
original_fun = XIL(0x7ffff12b5838)
#8 0x00000000005940c3 in Ffuncall (nargs=5, args=0x7fffffff2500) at eval.c:2999
count = {
bytes = 1696
}
val = <optimized out>
#9 0x00007ffff17973af in F626567696e6e696e672d6f662d646566756e2d726177_beginning_of_defun_raw_0 ()
from /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/bin/../lib/emacs/29.3/native-lisp/29.3-8ca456c1/preloaded/lisp-1e88867d-c35f9575.eln
No symbol table info available.
#10 0x00000000005956d3 in funcall_subr (subr=subr@entry=0x7ffff1f1aa40, numargs=numargs@entry=1, args=args@entry=0x7fffffff2678) at eval.c:3038
argbuf = {XIL(0xe471a11), XIL(0x7fffffff1830), XIL(0x7fffffff17a8), XIL(0xbbb810), XIL(0x7ffff243b685), XIL(0x640), XIL(0x640), XIL(0xb2c1f8)}
a = <optimized out>
fun = <optimized out>
#11 0x000000000059703e in funcall_general (fun=XIL(0x7ffff1f1aa45), numargs=numargs@entry=1, args=args@entry=0x7fffffff2678) at eval.c:2945
original_fun = XIL(0x7ffff13578f0)
#12 0x00000000005940c3 in Ffuncall (nargs=2, args=0x7fffffff2670) at eval.c:2999
count = {
bytes = 1664
}
val = <optimized out>
#13 0x00007ffff1796fd6 in F626567696e6e696e672d6f662d646566756e_beginning_of_defun_0 ()
from /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/bin/../lib/emacs/29.3/native-lisp/29.3-8ca456c1/preloaded/lisp-1e88867d-c35f9575.eln
No symbol table info available.
#14 0x00000000005956d3 in funcall_subr (subr=subr@entry=0x7ffff1f1ab28, numargs=numargs@entry=0, args=args@entry=0x7fffffff27a0) at eval.c:3038
argbuf = {XIL(0), XIL(0x3a07), XIL(0x108d4138), XIL(0x108d4138), XIL(0x1), XIL(0x108d4138), XIL(0x108d4138), XIL(0x57f4dd)}
a = <optimized out>
fun = <optimized out>
#15 0x000000000059703e in funcall_general (fun=XIL(0x7ffff1f1ab2d), numargs=numargs@entry=0, args=args@entry=0x7fffffff27a0) at eval.c:2945
original_fun = XIL(0x7ffff13579d8)
#16 0x00000000005940c3 in Ffuncall (nargs=1, args=0x7fffffff2798) at eval.c:2999
count = {
bytes = 1632
}
val = <optimized out>
#17 0x00007fffea8eb9e7 in F632d6765742d66616c6c6261636b2d7363616e2d706f73_c_get_fallback_scan_pos_0 ()
from /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/lib/emacs/29.3/native-lisp/29.3-8ca456c1/cc-engine-ccfcb170-ebf99546.eln
No symbol table info available.
#18 0x00000000005956d3 in funcall_subr (subr=subr@entry=0xd439a58, numargs=numargs@entry=1, args=args@entry=0x7fffffff29c8) at eval.c:3038
argbuf = {XIL(0), make_fixnum(1556976), XIL(0x13d668ed), XIL(0xf19dad), XIL(0), make_fixnum(1449128), XIL(0x13d668ed), XIL(0x58f421)}
a = <optimized out>
fun = <optimized out>
#19 0x000000000059703e in funcall_general (fun=XIL(0xd439a5d), numargs=numargs@entry=1, args=args@entry=0x7fffffff29c8) at eval.c:2945
original_fun = XIL(0xf9f6150)
#20 0x00000000005940c3 in Ffuncall (nargs=2, args=0x7fffffff29c0) at eval.c:2999
count = {
bytes = 1472
}
val = <optimized out>
#21 0x00007fffea8ebfac in F632d70617273652d73746174652d6765742d7374726174656779_c_parse_state_get_strategy_0 ()
from /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/lib/emacs/29.3/native-lisp/29.3-8ca456c1/cc-engine-ccfcb170-ebf99546.eln
No symbol table info available.
#22 0x00000000005956e5 in funcall_subr (subr=subr@entry=0xd438760, numargs=numargs@entry=2, args=args@entry=0x7fffffff2bf8) at eval.c:3040
argbuf = {XIL(0x498b), make_fixnum(18827), XIL(0x49bb), make_fixnum(18875), make_fixnum(18874), XIL(0x5f3b64), XIL(0x7fffffff2b50), XIL(0x587e79)}
a = <optimized out>
fun = <optimized out>
#23 0x000000000059703e in funcall_general (fun=XIL(0xd438765), numargs=numargs@entry=2, args=args@entry=0x7fffffff2bf8) at eval.c:2945
original_fun = XIL(0xf9f6840)
#24 0x00000000005940c3 in Ffuncall (nargs=3, args=0x7fffffff2bf0) at eval.c:2999
count = {
bytes = 1440
}
val = <optimized out>
#25 0x00007fffea8f0883 in F632d70617273652d73746174652d31_c_parse_state_1_0 ()
from /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/lib/emacs/29.3/native-lisp/29.3-8ca456c1/cc-engine-ccfcb170-ebf99546.eln
No symbol table info available.
#26 0x00000000005956c8 in funcall_subr (subr=subr@entry=0xd438a48, numargs=numargs@entry=0, args=args@entry=0x7fffffff2e18) at eval.c:3036
argbuf = {XIL(0), make_fixnum(1556976), XIL(0x13d6676d), XIL(0xf19dad), XIL(0), make_fixnum(1449128), XIL(0x13d6676d), XIL(0x58f421)}
a = <optimized out>
fun = <optimized out>
#27 0x000000000059703e in funcall_general (fun=XIL(0xd438a4d), numargs=numargs@entry=0, args=args@entry=0x7fffffff2e18) at eval.c:2945
original_fun = XIL(0xf9f6960)
#28 0x00000000005940c3 in Ffuncall (nargs=1, args=0x7fffffff2e10) at eval.c:2999
count = {
bytes = 1408
}
val = <optimized out>
#29 0x00007fffea8f173c in F632d70617273652d7374617465_c_parse_state_0 ()
from /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/lib/emacs/29.3/native-lisp/29.3-8ca456c1/cc-engine-ccfcb170-ebf99546.eln
No symbol table info available.
#30 0x00000000005956c8 in funcall_subr (subr=subr@entry=0xd437750, numargs=numargs@entry=0, args=args@entry=0x7fffffff2f80) at eval.c:3036
argbuf = {XIL(0xe471a05), XIL(0x49bb), XIL(0x13c945c0), XIL(0x13c945c0), XIL(0x1), XIL(0x13c945c0), XIL(0x13c945c0), XIL(0x5ef611)}
a = <optimized out>
fun = <optimized out>
#31 0x000000000059703e in funcall_general (fun=XIL(0xd437755), numargs=numargs@entry=0, args=args@entry=0x7fffffff2f80) at eval.c:2945
original_fun = XIL(0xf942420)
#32 0x00000000005940c3 in Ffuncall (nargs=1, args=0x7fffffff2f78) at eval.c:2999
count = {
bytes = 1344
}
val = <optimized out>
#33 0x00007fffea92e080 in F632d6c616f6d69622d696e76616c69646174652d6361636865_c_laomib_invalidate_cache_0 ()
from /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/lib/emacs/29.3/native-lisp/29.3-8ca456c1/cc-engine-ccfcb170-ebf99546.eln
No symbol table info available.
#34 0x00000000005956e5 in funcall_subr (subr=subr@entry=0xd429828, numargs=numargs@entry=2, args=args@entry=0x7fffffff3248) at eval.c:3040
argbuf = {XIL(0), XIL(0x1), XIL(0x500), XIL(0x7fffffff3060), XIL(0x7fffffff3068), XIL(0x13d279b5), XIL(0x7fffea9ff140), XIL(0x5940c3)}
a = <optimized out>
fun = <optimized out>
#35 0x000000000059703e in funcall_general (fun=XIL(0xd42982d), numargs=numargs@entry=2, args=args@entry=0x7fffffff3248) at eval.c:2945
original_fun = XIL(0xf941cc0)
#36 0x00000000005940c3 in Ffuncall (nargs=3, args=0x7fffffff3240) at eval.c:2999
count = {
bytes = 1280
}
val = <optimized out>
#37 0x00007fffea9c231c in F632d6265666f72652d6368616e6765_c_before_change_0 ()
from /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/lib/emacs/29.3/native-lisp/29.3-8ca456c1/cc-mode-515a98a5-29b249e0.eln
No symbol table info available.
#38 0x00000000005956e5 in funcall_subr (subr=subr@entry=0x10897428, numargs=numargs@entry=2, args=args@entry=0x7fffffff3598) at eval.c:3040
argbuf = {XIL(0xb), XIL(0x9360), XIL(0), XIL(0x133abed5), XIL(0xb2c370), XIL(0x73b1716450e4c200), XIL(0x3c0), XIL(0xb2c370)}
a = <optimized out>
fun = <optimized out>
#39 0x000000000059703e in funcall_general (fun=XIL(0x1089742d), numargs=numargs@entry=2, args=args@entry=0x7fffffff3598) at eval.c:2945
original_fun = XIL(0xf9407f0)
#40 0x00000000005940c3 in Ffuncall (nargs=3, args=0x7fffffff3590) at eval.c:2999
count = {
bytes = 1088
}
val = <optimized out>
#41 0x0000000000594161 in funcall_nil (nargs=<optimized out>, args=<optimized out>) at eval.c:2681
No locals.
#42 0x0000000000593739 in run_hook_with_args (nargs=3, args=0x7fffffff3590, funcall=funcall@entry=0x594158 <funcall_nil>) at eval.c:2858
global_vals = <optimized out>
sym = XIL(0x36c0)
val = XIL(0x13005973)
ret = XIL(0)
#43 0x0000000000593795 in Frun_hook_with_args (nargs=<optimized out>, args=<optimized out>) at eval.c:2723
No locals.
#44 0x00007fffec3f4ccd in F6c73702d2d6170706c792d746578742d656469742d7265706c6163652d6275666665722d636f6e74656e7473_lsp__apply_text_edit_replace_buffer_contents_0 ()
from /home/wrath/.emacs.d/eln-cache/29.3-8ca456c1/lsp-mode-f50f9720-738da13a.eln
No symbol table info available.
#45 0x00000000005956d3 in funcall_subr (subr=subr@entry=0xbfa7450, numargs=numargs@entry=1, args=args@entry=0x7ffff0c00088) at eval.c:3038
argbuf = {XIL(0x40), make_fixnum(1468386), XIL(0x7ffff1351cd0), XIL(0x5a1bb4), XIL(0x380), XIL(0x20), XIL(0x7ffff21dacb8), XIL(0x73b1716450e4c200)}
a = <optimized out>
fun = <optimized out>
#46 0x00000000005c9b39 in exec_byte_code (fun=<optimized out>, fun@entry=XIL(0x13e3d29d), args_template=<optimized out>, args_template@entry=257, nargs=<optimized out>, nargs@entry=1,
args=<optimized out>, args@entry=0x7fffffff3898) at bytecode.c:809
call_nargs = 1
call_fun = XIL(0xbfa7455)
count1 = <optimized out>
template = <optimized out>
val = <optimized out>
call_args = 0x7ffff0c00088
original_fun = XIL(0xae7e940)
bytecode = <optimized out>
op = 1
type = <optimized out>
targets = {0x5cba6f <exec_byte_code+10008>, 0x5cba8c <exec_byte_code+10037>, 0x5cbac1 <exec_byte_code+10090>, 0x5cbac3 <exec_byte_code+10092>, 0x5cbac5 <exec_byte_code+10094>,
0x5cba8c <exec_byte_code+10037>, 0x5cbac7 <exec_byte_code+10096>, 0x5cbb00 <exec_byte_code+10153>, 0x5c953c <exec_byte_code+485>, 0x5c957b <exec_byte_code+548>,
0x5c957d <exec_byte_code+550>, 0x5c957f <exec_byte_code+552>, 0x5c9581 <exec_byte_code+554>, 0x5c953c <exec_byte_code+485>, 0x5c9583 <exec_byte_code+556>,
0x5c9529 <exec_byte_code+466>, 0x5c974a <exec_byte_code+1011>, 0x5c97a3 <exec_byte_code+1100>, 0x5c97a5 <exec_byte_code+1102>, 0x5c97a7 <exec_byte_code+1104>,
0x5c97a9 <exec_byte_code+1106>, 0x5c974a <exec_byte_code+1011>, 0x5c97be <exec_byte_code+1127>, 0x5c97ab <exec_byte_code+1108>, 0x5c988a <exec_byte_code+1331>,
0x5c98d2 <exec_byte_code+1403>, 0x5c98d4 <exec_byte_code+1405>, 0x5c98d6 <exec_byte_code+1407>, 0x5c98d8 <exec_byte_code+1409>, 0x5c988a <exec_byte_code+1331>,
0x5c986d <exec_byte_code+1302>, 0x5c9877 <exec_byte_code+1312>, 0x5c98f7 <exec_byte_code+1440>, 0x5c99d3 <exec_byte_code+1660>, 0x5c99d8 <exec_byte_code+1665>,
0x5c99dd <exec_byte_code+1670>, 0x5c99e2 <exec_byte_code+1675>, 0x5c98f7 <exec_byte_code+1440>, 0x5c98da <exec_byte_code+1411>, 0x5c98e4 <exec_byte_code+1421>,
0x5c9b78 <exec_byte_code+2081>, 0x5c9bc3 <exec_byte_code+2156>, 0x5c9bc5 <exec_byte_code+2158>, 0x5c9bc7 <exec_byte_code+2160>, 0x5c9bc9 <exec_byte_code+2162>,
0x5c9b78 <exec_byte_code+2081>, 0x5c9b5b <exec_byte_code+2052>, 0x5c9b65 <exec_byte_code+2062>, 0x5ca074 <exec_byte_code+3357>, 0x5ca011 <exec_byte_code+3258>,
0x5c9fa6 <exec_byte_code+3151>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>,
0x5cba6f <exec_byte_code+10008>, 0x5ca1dd <exec_byte_code+3718>, 0x5ca257 <exec_byte_code+3840>, 0x5ca297 <exec_byte_code+3904>, 0x5ca2de <exec_byte_code+3975>,
0x5ca325 <exec_byte_code+4046>, 0x5c9681 <exec_byte_code+810>, 0x5c96cf <exec_byte_code+888>, 0x5ca370 <exec_byte_code+4121>, 0x5c9640 <exec_byte_code+745>,
0x5c9709 <exec_byte_code+946>, 0x5ca3aa <exec_byte_code+4179>, 0x5ca3e4 <exec_byte_code+4237>, 0x5ca410 <exec_byte_code+4281>, 0x5ca44a <exec_byte_code+4339>,
0x5ca483 <exec_byte_code+4396>, 0x5ca504 <exec_byte_code+4525>, 0x5ca530 <exec_byte_code+4569>, 0x5ca5e7 <exec_byte_code+4752>, 0x5ca6a0 <exec_byte_code+4937>,
0x5ca6cc <exec_byte_code+4981>, 0x5ca6f8 <exec_byte_code+5025>, 0x5ca732 <exec_byte_code+5083>, 0x5ca76c <exec_byte_code+5141>, 0x5ca7a6 <exec_byte_code+5199>,
0x5ca7e6 <exec_byte_code+5263>, 0x5ca81c <exec_byte_code+5317>, 0x5ca852 <exec_byte_code+5371>, 0x5ca8cc <exec_byte_code+5493>, 0x5ca923 <exec_byte_code+5580>,
0x5ca97a <exec_byte_code+5667>, 0x5ca9e5 <exec_byte_code+5774>, 0x5caa58 <exec_byte_code+5889>, 0x5caacb <exec_byte_code+6004>, 0x5cab3e <exec_byte_code+6119>,
0x5cabb1 <exec_byte_code+6234>, 0x5cac3b <exec_byte_code+6372>, 0x5cac9c <exec_byte_code+6469>, 0x5cad26 <exec_byte_code+6607>, 0x5cad91 <exec_byte_code+6714>,
0x5cadfc <exec_byte_code+6821>, 0x5caf9d <exec_byte_code+7238>, 0x5c9ead <exec_byte_code+2902>, 0x5cafe6 <exec_byte_code+7311>, 0x5cb012 <exec_byte_code+7355>,
0x5cb087 <exec_byte_code+7472>, 0x5cb0d0 <exec_byte_code+7545>, 0x5cb119 <exec_byte_code+7618>, 0x5cb145 <exec_byte_code+7662>, 0x5cb173 <exec_byte_code+7708>,
0x5cb1a1 <exec_byte_code+7754>, 0x5cb1d7 <exec_byte_code+7808>, 0x5cba6f <exec_byte_code+10008>, 0x5cb208 <exec_byte_code+7857>, 0x5cb236 <exec_byte_code+7903>,
0x5cb264 <exec_byte_code+7949>, 0x5cb292 <exec_byte_code+7995>, 0x5cb2c0 <exec_byte_code+8041>, 0x5cb2ee <exec_byte_code+8087>, 0x5c9ead <exec_byte_code+2902>,
0x5cba6f <exec_byte_code+10008>, 0x5cb31a <exec_byte_code+8131>, 0x5cb35b <exec_byte_code+8196>, 0x5cb387 <exec_byte_code+8240>, 0x5cb3b3 <exec_byte_code+8284>,
0x5cb3ed <exec_byte_code+8342>, 0x5cb427 <exec_byte_code+8400>, 0x5cb453 <exec_byte_code+8444>, 0x5cb47f <exec_byte_code+8488>, 0x5cb4b9 <exec_byte_code+8546>,
0x5cb4f3 <exec_byte_code+8604>, 0x5cb52d <exec_byte_code+8662>, 0x5cb55b <exec_byte_code+8708>, 0x5cba6f <exec_byte_code+10008>, 0x5c9e49 <exec_byte_code+2802>,
0x5c9bcb <exec_byte_code+2164>, 0x5c95fe <exec_byte_code+679>, 0x5c9c58 <exec_byte_code+2305>, 0x5c9c96 <exec_byte_code+2367>, 0x5c9cd4 <exec_byte_code+2429>,
0x5c9d16 <exec_byte_code+2495>, 0x5c9e27 <exec_byte_code+2768>, 0x5c9841 <exec_byte_code+1258>, 0x5c9e8b <exec_byte_code+2868>, 0x5c9ecf <exec_byte_code+2936>,
0x5c9f34 <exec_byte_code+3037>, 0x5c9f65 <exec_byte_code+3086>, 0x5ca0a7 <exec_byte_code+3408>, 0x5ca0fa <exec_byte_code+3491>, 0x5ca13a <exec_byte_code+3555>,
0x5ca180 <exec_byte_code+3625>, 0x5cba6f <exec_byte_code+10008>, 0x5cb587 <exec_byte_code+8752>, 0x5cb5c7 <exec_byte_code+8816>, 0x5cb5f3 <exec_byte_code+8860>,
0x5cb61f <exec_byte_code+8904>, 0x5cb64b <exec_byte_code+8948>, 0x5cb677 <exec_byte_code+8992>, 0x5cb6b1 <exec_byte_code+9050>, 0x5cb6eb <exec_byte_code+9108>,
0x5cb725 <exec_byte_code+9166>, 0x5cb75f <exec_byte_code+9224>, 0x5cb7dd <exec_byte_code+9350>, 0x5cb817 <exec_byte_code+9408>, 0x5cb851 <exec_byte_code+9466>,
0x5cb87d <exec_byte_code+9510>, 0x5cb8dd <exec_byte_code+9606>, 0x5cb93d <exec_byte_code+9702>, 0x5cb97b <exec_byte_code+9764>, 0x5cb9b9 <exec_byte_code+9826>,
0x5cae9e <exec_byte_code+6983>, 0x5caf2f <exec_byte_code+7128>, 0x5cb9ef <exec_byte_code+9880>, 0x5cba2f <exec_byte_code+9944>, 0x5cba6f <exec_byte_code+10008>,
0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>,
0x5ca4c0 <exec_byte_code+4457>, 0x5ca888 <exec_byte_code+5425>, 0x5cb043 <exec_byte_code+7404>, 0x5cbb42 <exec_byte_code+10219>, 0x5cbb83 <exec_byte_code+10284>,
0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cbbcf <exec_byte_code+10360>, 0x5cbc1b <exec_byte_code+10436>, 0x5cba6f <exec_byte_code+10008>,
0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>,
0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cbcb1 <exec_byte_code+10586> <repeats 64 times>}
quitcounter = 1 '\001'
bc = 0xb2c350 <main_thread+496>
top = 0x7ffff0c00080
pc = 0xb9d0c45 "\210\307\001!\203["
bytestr = <optimized out>
vector = <optimized out>
maxdepth = <optimized out>
const_length = <optimized out>
bytestr_length = <optimized out>
vectorp = 0x13e3d200
max_stack = <optimized out>
frame_base = <optimized out>
fp = <optimized out>
bytestr_data = 0xb9d0c28 "\302\301\211\242T\240\305\001\247\203\023"
rest = <optimized out>
mandatory = <optimized out>
nonrest = <optimized out>
pushedargs = <optimized out>
result = <optimized out>
#47 0x00000000005950d0 in fetch_and_exec_byte_code (fun=XIL(0x13e3d29d), args_template=args_template@entry=257, nargs=nargs@entry=1, args=args@entry=0x7fffffff3898) at eval.c:3085
No locals.
#48 0x0000000000596c59 in funcall_lambda (fun=fun@entry=XIL(0x13e3d29d), nargs=nargs@entry=1, arg_vector=arg_vector@entry=0x7fffffff3898) at eval.c:3157
val = <optimized out>
syms_left = make_fixnum(257)
next = <optimized out>
lexenv = <optimized out>
count = <optimized out>
i = <optimized out>
optional = <optimized out>
rest = <optimized out>
previous_rest = <optimized out>
#49 0x000000000059704e in funcall_general (fun=XIL(0x13e3d29d), numargs=numargs@entry=1, args=args@entry=0x7fffffff3898) at eval.c:2949
original_fun = XIL(0x13e3d29d)
#50 0x00000000005940c3 in Ffuncall (nargs=nargs@entry=2, args=args@entry=0x7fffffff3890) at eval.c:2999
count = {
bytes = 832
}
val = <optimized out>
#51 0x000000000059c723 in call1 (arg1=<optimized out>, fn=XIL(0x13e3d29d)) at /build/source/src/lisp.h:3248
No locals.
#52 mapcar1 (leni=323, vals=vals@entry=0x0, fn=fn@entry=XIL(0x13e3d29d), seq=seq@entry=XIL(0x133aae63)) at fns.c:3007
dummy = <optimized out>
i = 0
tail = XIL(0x133aae63)
#53 0x000000000059f742 in Fmapc (function=XIL(0x13e3d29d), sequence=XIL(0x133aae63)) at fns.c:3144
leni = <optimized out>
#54 0x00007fffec3f5819 in F6c73702d2d6170706c792d746578742d6564697473_lsp__apply_text_edits_0 () from /home/wrath/.emacs.d/eln-cache/29.3-8ca456c1/lsp-mode-f50f9720-738da13a.eln
No symbol table info available.
#55 0x00000000005956e5 in funcall_subr (subr=subr@entry=0xbfa75b0, numargs=numargs@entry=2, args=args@entry=0x7fffffff3bc8) at eval.c:3040
argbuf = {XIL(0x1), XIL(0x596c59), XIL(0x1), XIL(0xbfa5798), XIL(0), XIL(0x1), XIL(0x7fffffff3b98), XIL(0x2a0)}
a = <optimized out>
fun = <optimized out>
#56 0x000000000059703e in funcall_general (fun=XIL(0xbfa75b5), numargs=numargs@entry=2, args=args@entry=0x7fffffff3bc8) at eval.c:2945
original_fun = XIL(0xae7d990)
#57 0x00000000005940c3 in Ffuncall (nargs=3, args=0x7fffffff3bc0) at eval.c:2999
count = {
bytes = 640
}
val = <optimized out>
#58 0x00007fffec401c72 in F6c73702d666f726d61742d627566666572_lsp_format_buffer_0 () from /home/wrath/.emacs.d/eln-cache/29.3-8ca456c1/lsp-mode-f50f9720-738da13a.eln
No symbol table info available.
#59 0x00000000005956c8 in funcall_subr (subr=subr@entry=0xbfb3d18, numargs=numargs@entry=0, args=args@entry=0x7fffffff3d70) at eval.c:3036
argbuf = {XIL(0), XIL(0x593dff), make_fixnum(0), XIL(0x55fb3c), XIL(0xbba5a8), XIL(0), XIL(0x35), XIL(0x73b1716450e4c200)}
a = <optimized out>
fun = <optimized out>
#60 0x000000000059703e in funcall_general (fun=XIL(0xbfb3d1d), numargs=numargs@entry=0, args=args@entry=0x7fffffff3d70) at eval.c:2945
original_fun = XIL(0x34ae1e0)
#61 0x00000000005940c3 in Ffuncall (nargs=1, args=0x7fffffff3d68) at eval.c:2999
count = {
bytes = 608
}
val = <optimized out>
#62 0x0000000000594161 in funcall_nil (nargs=<optimized out>, args=<optimized out>) at eval.c:2681
No locals.
#63 0x0000000000593739 in run_hook_with_args (nargs=nargs@entry=1, args=args@entry=0x7fffffff3d68, funcall=funcall@entry=0x594158 <funcall_nil>) at eval.c:2858
global_vals = <optimized out>
sym = XIL(0x7ffff1299eb0)
val = XIL(0x109453d3)
ret = XIL(0)
#64 0x0000000000593795 in Frun_hook_with_args (nargs=nargs@entry=1, args=args@entry=0x7fffffff3d68) at eval.c:2723
No locals.
#65 0x00000000005937b2 in run_hook (hook=<optimized out>) at eval.c:2871
No locals.
#66 0x00000000005937d1 in Frun_hooks (nargs=1, args=0x7fffffff3ec0) at eval.c:2705
i = 0
#67 0x00000000005957c7 in funcall_subr (subr=subr@entry=0xb43f20 <Srun_hooks>, numargs=numargs@entry=1, args=args@entry=0x7fffffff3ec0) at eval.c:3063
fun = <optimized out>
#68 0x000000000059703e in funcall_general (fun=XIL(0xb43f25), numargs=numargs@entry=1, args=args@entry=0x7fffffff3ec0) at eval.c:2945
original_fun = XIL(0x7ffff12c3b50)
#69 0x00000000005940c3 in Ffuncall (nargs=2, args=0x7fffffff3eb8) at eval.c:2999
count = {
bytes = 576
}
val = <optimized out>
#70 0x00007ffff1a9ff18 in F62617369632d736176652d627566666572_basic_save_buffer_0 ()
from /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/bin/../lib/emacs/29.3/native-lisp/29.3-8ca456c1/preloaded/files-1e8937b2-592f65e7.eln
No symbol table info available.
#71 0x00000000005956d3 in funcall_subr (subr=subr@entry=0x7ffff21dd378, numargs=numargs@entry=1, args=args@entry=0x7fffffff4028) at eval.c:3038
argbuf = {XIL(0x13ce4674), XIL(0x469454), XIL(0x13ce4674), XIL(0x7fffffff3ff0), XIL(0), XIL(0x4695bd), XIL(0x6620676e69766153), XIL(0x6d6f682f20656c69)}
a = <optimized out>
fun = <optimized out>
#72 0x000000000059703e in funcall_general (fun=XIL(0x7ffff21dd37d), numargs=numargs@entry=1, args=args@entry=0x7fffffff4028) at eval.c:2945
original_fun = XIL(0x7ffff161a228)
#73 0x00000000005940c3 in Ffuncall (nargs=2, args=0x7fffffff4020) at eval.c:2999
count = {
bytes = 480
}
val = <optimized out>
#74 0x00007ffff1a9f63f in F736176652d627566666572_save_buffer_0 ()
from /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/bin/../lib/emacs/29.3/native-lisp/29.3-8ca456c1/preloaded/files-1e8937b2-592f65e7.eln
No symbol table info available.
#75 0x00000000005956d3 in funcall_subr (subr=subr@entry=0x7ffff1e85918, numargs=numargs@entry=1, args=args@entry=0x7fffffff4280) at eval.c:3038
argbuf = {XIL(0), XIL(0xffffffffffffffff), XIL(0xe9ac84), XIL(0xe9bce0), XIL(0), XIL(0x73b1716450e4c200), XIL(0xe9ac84), XIL(0x1)}
a = <optimized out>
fun = <optimized out>
#76 0x000000000059703e in funcall_general (fun=XIL(0x7ffff1e8591d), numargs=numargs@entry=1, args=args@entry=0x7fffffff4280) at eval.c:2945
original_fun = XIL(0x7ffff12c2748)
#77 0x00000000005940c3 in Ffuncall (nargs=nargs@entry=2, args=args@entry=0x7fffffff4278) at eval.c:2999
count = {
bytes = 416
}
val = <optimized out>
#78 0x000000000059012f in Ffuncall_interactively (nargs=2, args=0x7fffffff4278) at callint.c:250
speccount = <optimized out>
#79 0x00000000005957c7 in funcall_subr (subr=subr@entry=0xb438c0 <Sfuncall_interactively>, numargs=numargs@entry=2, args=args@entry=0x7fffffff4278) at eval.c:3063
fun = <optimized out>
#80 0x000000000059703e in funcall_general (fun=XIL(0xb438c5), numargs=numargs@entry=2, args=args@entry=0x7fffffff4278) at eval.c:2945
original_fun = XIL(0x7fe0)
#81 0x00000000005940c3 in Ffuncall (nargs=nargs@entry=3, args=args@entry=0x7fffffff4270) at eval.c:2999
count = {
bytes = 352
}
val = <optimized out>
#82 0x00000000005919f4 in Fcall_interactively (function=<optimized out>, record_flag=<optimized out>, keys=<optimized out>) at callint.c:787
speccount = <optimized out>
arg_from_tty = false
key_count = <optimized out>
record_then_fail = <optimized out>
save_this_command = <optimized out>
save_this_original_command = <optimized out>
save_real_this_command = <optimized out>
save_last_command = <optimized out>
prefix_arg = <optimized out>
enable = <optimized out>
up_event = XIL(0)
form = <optimized out>
specs = <optimized out>
sa_avail = <optimized out>
sa_count = <optimized out>
string_len = <optimized out>
string = <optimized out>
string_end = <optimized out>
next_event = 2
nargs = <optimized out>
args = <optimized out>
visargs = <optimized out>
varies = <optimized out>
tem = <optimized out>
val = <optimized out>
#83 0x00000000005956fb in funcall_subr (subr=subr@entry=0xb43860 <Scall_interactively>, numargs=numargs@entry=3, args=args@entry=0x7fffffff44e8) at eval.c:3042
argbuf = {XIL(0x1), make_fixnum(1465359), XIL(0x1ae4d6e2ef500000), XIL(0x1), XIL(0xc0), XIL(0x7fffffff4470), XIL(0x7fffffff4478), XIL(0x7fffffff45e8)}
a = <optimized out>
fun = <optimized out>
#84 0x000000000059703e in funcall_general (fun=XIL(0xb43865), numargs=numargs@entry=3, args=args@entry=0x7fffffff44e8) at eval.c:2945
original_fun = XIL(0xb43865)
#85 0x00000000005940c3 in Ffuncall (nargs=nargs@entry=4, args=args@entry=0x7fffffff44e0) at eval.c:2999
count = {
bytes = 288
}
val = <optimized out>
#86 0x000000000059445b in Fapply (nargs=<optimized out>, args=0x7fffffff45a0) at eval.c:2670
i = 4
funcall_nargs = 4
funcall_args = 0x7fffffff44e0
spread_arg = XIL(0)
fun = <optimized out>
sa_avail = <optimized out>
sa_count = <optimized out>
numargs = 3
retval = <optimized out>
#87 0x00007fffefd2008f in F63616c6c2d696e7465726163746976656c794069646f2d63722b2d7265636f72642d63757272656e742d636f6d6d616e64_call_interactivelyido_cr_record_current_command_0 ()
from /home/wrath/.emacs.d/eln-cache/29.3-8ca456c1/ido-completing-read+-105956e9-b9aaa820.eln
No symbol table info available.
#88 0x00000000005957c7 in funcall_subr (subr=subr@entry=0x1e19930, numargs=numargs@entry=4, args=args@entry=0x7fffffff46d8) at eval.c:3063
fun = <optimized out>
#89 0x000000000059703e in funcall_general (fun=XIL(0x1e19935), numargs=numargs@entry=4, args=args@entry=0x7fffffff46d8) at eval.c:2945
original_fun = XIL(0x80cd80)
#90 0x00000000005940c3 in Ffuncall (nargs=nargs@entry=5, args=args@entry=0x7fffffff46d0) at eval.c:2999
count = {
bytes = 224
}
val = <optimized out>
#91 0x000000000059445b in Fapply (nargs=<optimized out>, args=0x7ffff0c00040) at eval.c:2670
i = 5
funcall_nargs = 5
funcall_args = 0x7fffffff46d0
spread_arg = XIL(0)
fun = <optimized out>
sa_avail = <optimized out>
sa_count = <optimized out>
numargs = 4
retval = <optimized out>
#92 0x00000000005957c7 in funcall_subr (subr=subr@entry=0xb43f80 <Sapply>, numargs=numargs@entry=3, args=args@entry=0x7ffff0c00040) at eval.c:3063
fun = <optimized out>
#93 0x00000000005c9b39 in exec_byte_code (fun=<optimized out>, fun@entry=XIL(0x1e19b4d), args_template=<optimized out>, args_template@entry=128, nargs=<optimized out>, nargs@entry=3,
args=<optimized out>, args@entry=0x7fffffff49a8) at bytecode.c:809
call_nargs = 3
call_fun = XIL(0xb43f85)
count1 = <optimized out>
template = <optimized out>
val = <optimized out>
call_args = 0x7ffff0c00040
original_fun = XIL(0x31e0)
bytecode = <optimized out>
op = 3
type = <optimized out>
targets = {0x5cba6f <exec_byte_code+10008>, 0x5cba8c <exec_byte_code+10037>, 0x5cbac1 <exec_byte_code+10090>, 0x5cbac3 <exec_byte_code+10092>, 0x5cbac5 <exec_byte_code+10094>,
0x5cba8c <exec_byte_code+10037>, 0x5cbac7 <exec_byte_code+10096>, 0x5cbb00 <exec_byte_code+10153>, 0x5c953c <exec_byte_code+485>, 0x5c957b <exec_byte_code+548>,
0x5c957d <exec_byte_code+550>, 0x5c957f <exec_byte_code+552>, 0x5c9581 <exec_byte_code+554>, 0x5c953c <exec_byte_code+485>, 0x5c9583 <exec_byte_code+556>,
0x5c9529 <exec_byte_code+466>, 0x5c974a <exec_byte_code+1011>, 0x5c97a3 <exec_byte_code+1100>, 0x5c97a5 <exec_byte_code+1102>, 0x5c97a7 <exec_byte_code+1104>,
0x5c97a9 <exec_byte_code+1106>, 0x5c974a <exec_byte_code+1011>, 0x5c97be <exec_byte_code+1127>, 0x5c97ab <exec_byte_code+1108>, 0x5c988a <exec_byte_code+1331>,
0x5c98d2 <exec_byte_code+1403>, 0x5c98d4 <exec_byte_code+1405>, 0x5c98d6 <exec_byte_code+1407>, 0x5c98d8 <exec_byte_code+1409>, 0x5c988a <exec_byte_code+1331>,
0x5c986d <exec_byte_code+1302>, 0x5c9877 <exec_byte_code+1312>, 0x5c98f7 <exec_byte_code+1440>, 0x5c99d3 <exec_byte_code+1660>, 0x5c99d8 <exec_byte_code+1665>,
0x5c99dd <exec_byte_code+1670>, 0x5c99e2 <exec_byte_code+1675>, 0x5c98f7 <exec_byte_code+1440>, 0x5c98da <exec_byte_code+1411>, 0x5c98e4 <exec_byte_code+1421>,
0x5c9b78 <exec_byte_code+2081>, 0x5c9bc3 <exec_byte_code+2156>, 0x5c9bc5 <exec_byte_code+2158>, 0x5c9bc7 <exec_byte_code+2160>, 0x5c9bc9 <exec_byte_code+2162>,
0x5c9b78 <exec_byte_code+2081>, 0x5c9b5b <exec_byte_code+2052>, 0x5c9b65 <exec_byte_code+2062>, 0x5ca074 <exec_byte_code+3357>, 0x5ca011 <exec_byte_code+3258>,
0x5c9fa6 <exec_byte_code+3151>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>,
0x5cba6f <exec_byte_code+10008>, 0x5ca1dd <exec_byte_code+3718>, 0x5ca257 <exec_byte_code+3840>, 0x5ca297 <exec_byte_code+3904>, 0x5ca2de <exec_byte_code+3975>,
0x5ca325 <exec_byte_code+4046>, 0x5c9681 <exec_byte_code+810>, 0x5c96cf <exec_byte_code+888>, 0x5ca370 <exec_byte_code+4121>, 0x5c9640 <exec_byte_code+745>,
0x5c9709 <exec_byte_code+946>, 0x5ca3aa <exec_byte_code+4179>, 0x5ca3e4 <exec_byte_code+4237>, 0x5ca410 <exec_byte_code+4281>, 0x5ca44a <exec_byte_code+4339>,
0x5ca483 <exec_byte_code+4396>, 0x5ca504 <exec_byte_code+4525>, 0x5ca530 <exec_byte_code+4569>, 0x5ca5e7 <exec_byte_code+4752>, 0x5ca6a0 <exec_byte_code+4937>,
0x5ca6cc <exec_byte_code+4981>, 0x5ca6f8 <exec_byte_code+5025>, 0x5ca732 <exec_byte_code+5083>, 0x5ca76c <exec_byte_code+5141>, 0x5ca7a6 <exec_byte_code+5199>,
0x5ca7e6 <exec_byte_code+5263>, 0x5ca81c <exec_byte_code+5317>, 0x5ca852 <exec_byte_code+5371>, 0x5ca8cc <exec_byte_code+5493>, 0x5ca923 <exec_byte_code+5580>,
0x5ca97a <exec_byte_code+5667>, 0x5ca9e5 <exec_byte_code+5774>, 0x5caa58 <exec_byte_code+5889>, 0x5caacb <exec_byte_code+6004>, 0x5cab3e <exec_byte_code+6119>,
0x5cabb1 <exec_byte_code+6234>, 0x5cac3b <exec_byte_code+6372>, 0x5cac9c <exec_byte_code+6469>, 0x5cad26 <exec_byte_code+6607>, 0x5cad91 <exec_byte_code+6714>,
0x5cadfc <exec_byte_code+6821>, 0x5caf9d <exec_byte_code+7238>, 0x5c9ead <exec_byte_code+2902>, 0x5cafe6 <exec_byte_code+7311>, 0x5cb012 <exec_byte_code+7355>,
0x5cb087 <exec_byte_code+7472>, 0x5cb0d0 <exec_byte_code+7545>, 0x5cb119 <exec_byte_code+7618>, 0x5cb145 <exec_byte_code+7662>, 0x5cb173 <exec_byte_code+7708>,
0x5cb1a1 <exec_byte_code+7754>, 0x5cb1d7 <exec_byte_code+7808>, 0x5cba6f <exec_byte_code+10008>, 0x5cb208 <exec_byte_code+7857>, 0x5cb236 <exec_byte_code+7903>,
0x5cb264 <exec_byte_code+7949>, 0x5cb292 <exec_byte_code+7995>, 0x5cb2c0 <exec_byte_code+8041>, 0x5cb2ee <exec_byte_code+8087>, 0x5c9ead <exec_byte_code+2902>,
0x5cba6f <exec_byte_code+10008>, 0x5cb31a <exec_byte_code+8131>, 0x5cb35b <exec_byte_code+8196>, 0x5cb387 <exec_byte_code+8240>, 0x5cb3b3 <exec_byte_code+8284>,
0x5cb3ed <exec_byte_code+8342>, 0x5cb427 <exec_byte_code+8400>, 0x5cb453 <exec_byte_code+8444>, 0x5cb47f <exec_byte_code+8488>, 0x5cb4b9 <exec_byte_code+8546>,
0x5cb4f3 <exec_byte_code+8604>, 0x5cb52d <exec_byte_code+8662>, 0x5cb55b <exec_byte_code+8708>, 0x5cba6f <exec_byte_code+10008>, 0x5c9e49 <exec_byte_code+2802>,
0x5c9bcb <exec_byte_code+2164>, 0x5c95fe <exec_byte_code+679>, 0x5c9c58 <exec_byte_code+2305>, 0x5c9c96 <exec_byte_code+2367>, 0x5c9cd4 <exec_byte_code+2429>,
0x5c9d16 <exec_byte_code+2495>, 0x5c9e27 <exec_byte_code+2768>, 0x5c9841 <exec_byte_code+1258>, 0x5c9e8b <exec_byte_code+2868>, 0x5c9ecf <exec_byte_code+2936>,
0x5c9f34 <exec_byte_code+3037>, 0x5c9f65 <exec_byte_code+3086>, 0x5ca0a7 <exec_byte_code+3408>, 0x5ca0fa <exec_byte_code+3491>, 0x5ca13a <exec_byte_code+3555>,
0x5ca180 <exec_byte_code+3625>, 0x5cba6f <exec_byte_code+10008>, 0x5cb587 <exec_byte_code+8752>, 0x5cb5c7 <exec_byte_code+8816>, 0x5cb5f3 <exec_byte_code+8860>,
0x5cb61f <exec_byte_code+8904>, 0x5cb64b <exec_byte_code+8948>, 0x5cb677 <exec_byte_code+8992>, 0x5cb6b1 <exec_byte_code+9050>, 0x5cb6eb <exec_byte_code+9108>,
0x5cb725 <exec_byte_code+9166>, 0x5cb75f <exec_byte_code+9224>, 0x5cb7dd <exec_byte_code+9350>, 0x5cb817 <exec_byte_code+9408>, 0x5cb851 <exec_byte_code+9466>,
0x5cb87d <exec_byte_code+9510>, 0x5cb8dd <exec_byte_code+9606>, 0x5cb93d <exec_byte_code+9702>, 0x5cb97b <exec_byte_code+9764>, 0x5cb9b9 <exec_byte_code+9826>,
0x5cae9e <exec_byte_code+6983>, 0x5caf2f <exec_byte_code+7128>, 0x5cb9ef <exec_byte_code+9880>, 0x5cba2f <exec_byte_code+9944>, 0x5cba6f <exec_byte_code+10008>,
0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>,
0x5ca4c0 <exec_byte_code+4457>, 0x5ca888 <exec_byte_code+5425>, 0x5cb043 <exec_byte_code+7404>, 0x5cbb42 <exec_byte_code+10219>, 0x5cbb83 <exec_byte_code+10284>,
0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cbbcf <exec_byte_code+10360>, 0x5cbc1b <exec_byte_code+10436>, 0x5cba6f <exec_byte_code+10008>,
0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>,
0x5cba6f <exec_byte_code+10008>, 0x5cba6f <exec_byte_code+10008>, 0x5cbcb1 <exec_byte_code+10586> <repeats 64 times>}
quitcounter = 1 '\001'
bc = 0xb2c350 <main_thread+496>
top = 0x7ffff0c00038
pc = 0x7ffff27fe251 "\207"
bytestr = <optimized out>
vector = <optimized out>
maxdepth = <optimized out>
const_length = <optimized out>
bytestr_length = <optimized out>
vectorp = 0x1e19b20
max_stack = <optimized out>
frame_base = <optimized out>
fp = <optimized out>
bytestr_data = 0x7ffff27fe24c "\304\300\301\003#\207"
rest = <optimized out>
mandatory = <optimized out>
nonrest = <optimized out>
pushedargs = <optimized out>
result = <optimized out>
#94 0x00000000005950d0 in fetch_and_exec_byte_code (fun=XIL(0x1e19b4d), args_template=args_template@entry=128, nargs=nargs@entry=3, args=args@entry=0x7fffffff49a8) at eval.c:3085
No locals.
#95 0x0000000000596c59 in funcall_lambda (fun=fun@entry=XIL(0x1e19b4d), nargs=nargs@entry=3, arg_vector=arg_vector@entry=0x7fffffff49a8) at eval.c:3157
val = <optimized out>
syms_left = make_fixnum(128)
next = <optimized out>
lexenv = <optimized out>
count = <optimized out>
i = <optimized out>
optional = <optimized out>
rest = <optimized out>
previous_rest = <optimized out>
#96 0x000000000059704e in funcall_general (fun=XIL(0x1e19b4d), numargs=numargs@entry=3, args=args@entry=0x7fffffff49a8) at eval.c:2949
original_fun = XIL(0x7ffff1356898)
#97 0x00000000005940c3 in Ffuncall (nargs=4, args=0x7fffffff49a0) at eval.c:2999
count = {
bytes = 160
}
val = <optimized out>
#98 0x00007fffefd33132 in F616e6f6e796d6f75732d6c616d626461_anonymous_lambda_0 ()
from /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/lib/emacs/29.3/native-lisp/29.3-8ca456c1/subr--trampoline-63616c6c2d696e7465726163746976656c79_call_interactively_0.eln
No symbol table info available.
#99 0x00007ffff2e286b5 in F636f6d6d616e642d65786563757465_command_execute_0 ()
from /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/bin/../lib/emacs/29.3/native-lisp/29.3-8ca456c1/preloaded/simple-fab5b0cf-9ff4140c.eln
No symbol table info available.
#100 0x0000000000595715 in funcall_subr (subr=subr@entry=0x7ffff1ef99a0, numargs=numargs@entry=1, args=args@entry=0x7fffffff4b98) at eval.c:3044
argbuf = {XIL(0x7ffff12c2748), XIL(0), XIL(0), XIL(0), XIL(0), XIL(0x5929b7), XIL(0x7fffffff4b40), XIL(0x60)}
a = <optimized out>
fun = <optimized out>
#101 0x000000000059703e in funcall_general (fun=XIL(0x7ffff1ef99a5), numargs=numargs@entry=1, args=args@entry=0x7fffffff4b98) at eval.c:2945
original_fun = XIL(0x4c50)
#102 0x00000000005940c3 in Ffuncall (nargs=nargs@entry=2, args=args@entry=0x7fffffff4b90) at eval.c:2999
count = {
bytes = 128
}
val = <optimized out>
#103 0x000000000052a657 in call1 (arg1=<optimized out>, fn=XIL(0x4c50)) at /build/source/src/lisp.h:3248
No locals.
#104 command_loop_1 () at keyboard.c:1503
scount = <optimized out>
cmd = <optimized out>
keybuf = {make_fixnum(24), make_fixnum(19), XIL(0x7ffff207d4dd), XIL(0x98a0), XIL(0xbcc9c0), XIL(0), make_fixnum(0), make_fixnum(1000), XIL(0), XIL(0x58388d), XIL(0x98a0),
XIL(0x7fffffff4c60), make_fixnum(0), XIL(0), XIL(0), XIL(0x5929b7), XIL(0xcf8b30), XIL(0x60), XIL(0x30), XIL(0), XIL(0), XIL(0x593dff), XIL(0xb), XIL(0x98a0), XIL(0),
XIL(0x7ffff1e0e70d), XIL(0xbc0120), XIL(0x73b1716450e4c200), XIL(0x60), XIL(0x7ffff207d49b)}
i = <optimized out>
prev_modiff = 398
prev_buffer = 0xe471a00
#105 0x0000000000593059 in internal_condition_case (bfun=bfun@entry=0x52a183 <command_loop_1>, handlers=handlers@entry=XIL(0x90), hfun=hfun@entry=0x51f6b4 <cmd_error>) at eval.c:1474
val = <optimized out>
c = 0xe1ddd0
#106 0x000000000051a081 in command_loop_2 (handlers=handlers@entry=XIL(0x90)) at keyboard.c:1133
val = <optimized out>
#107 0x0000000000592fc7 in internal_catch (tag=tag@entry=XIL(0x10080), func=func@entry=0x51a067 <command_loop_2>, arg=arg@entry=XIL(0x90)) at eval.c:1197
val = <optimized out>
c = 0xe1dc90
#108 0x000000000051a03e in command_loop () at keyboard.c:1111
No locals.
#109 0x000000000051f25f in recursive_edit_1 () at keyboard.c:720
count = <optimized out>
val = <optimized out>
#110 0x000000000051f5ad in Frecursive_edit () at keyboard.c:803
count = <optimized out>
buffer = <optimized out>
#111 0x000000000051958a in main (argc=1, argv=<optimized out>) at emacs.c:2521
stack_bottom_variable = 0x7ffff681d2f8 <_gnutls_lib_state>
no_loadup = false
junk = 0x0
dname_arg = 0x0
ch_to_dir = 0x0
original_pwd = <optimized out>
dump_mode = <optimized out>
skip_args = 0
temacs = 0x0
attempt_load_pdump = <optimized out>
only_version = false
rlim = {
rlim_cur = 10022912,
rlim_max = 18446744073709551615
}
lc_all = <optimized out>
sockfd = -1
module_assertions = <optimized out>
Lisp Backtrace:
"re-search-backward" (0xffff2508)
"beginning-of-defun-raw" (0xffff2678)
"beginning-of-defun" (0xffff27a0)
"c-get-fallback-scan-pos" (0xffff29c8)
"c-parse-state-get-strategy" (0xffff2bf8)
"c-parse-state-1" (0xffff2e18)
"c-parse-state" (0xffff2f80)
"c-laomib-invalidate-cache" (0xffff3248)
"c-before-change" (0xffff3598)
"lsp--apply-text-edit-replace-buffer-contents" (0xf0c00088)
0x13e3d298 PVEC_COMPILED
"lsp--apply-text-edits" (0xffff3bc8)
"lsp-format-buffer" (0xffff3d70)
"run-hooks" (0xffff3ec0)
"basic-save-buffer" (0xffff4028)
"save-buffer" (0xffff4280)
"funcall-interactively" (0xffff4278)
0xb43860 PVEC_SUBR
"call-interactively@ido-cr+-record-current-command" (0xffff46d8)
"apply" (0xf0c00040)
"call-interactively" (0xffff49a8)
"command-execute" (0xffff4b98)
Inside of emacs I get something like this:
Debugger entered--Lisp error: (quit) re-search-backward("^\\s(\\|\\(?:^[ \11]*\\(template\\s-*<[^>;.{}]+>\\s-*\\)?\\(\\(\\(auto\\|const\\|explicit\\|extern\\s-+\"[^\"]+\"\\|extern\\|friend\\|inline\\|mutable\\|overload\\|register\\|static\\|typedef\\|virtual\\)\\s-+\\)*\\(\\([[<a-zA-Z][]_a-zA-Z0-9]*\\(::[]_a-zA-Z0-9]+\\)?\\s-*<[_<>a-zA-Z0-9 ,]+>\\s-*[*&]*\\|[[<a-zA-Z][]_<>a-zA-Z0-9]*\\(::[[<a-zA-Z][]_<>a-zA-Z0-9]+\\)?\\s-*[*&]*\\)[*& \11\n\15]+\\)\\)?\\(\\(::\\|[[<a-zA-Z][]_a-zA-Z0-9]*\\s-*<[^>;{}]+>\\s-*[*&]*::\\|[[<a-zA-Z][]_~<>a-zA-Z0-9]*\\s-*[*&]*::\\)\\s-*\\)?\\(operator\\s-*[^ \11\n\15:;.,?~{}]+\\(\\s-*\\[\\]\\)?\\|[_~<a-zA-Z][^][ \11:;.,~{}()\177]*\\|[*&]?\\([_~<a-zA-Z][_a-zA-Z0-9]*\\s-*<[^>;{}]+[ \11\n\15>]*>\\|[_~<a-zA-Z][_~<>a-zA-Z0-9]*\\)\\)\\s-*\\(([^{;]*)\\(\\(\\s-+const\\|\\s-+mutable\\)?\\(\\s-*[=:][^;{]+\\)?\\)?\\)\\s-*\\)\\s(" nil move 1)
beginning-of-defun-raw(nil)
beginning-of-defun()
c-get-fallback-scan-pos(18875)
c-parse-state-get-strategy(18875 13474)
c-parse-state-1()
c-parse-state()
c-laomib-invalidate-cache(18875 18880)
c-before-change(18875 18880)
lsp--apply-text-edit-replace-buffer-contents(#<hash-table equal 2/2 0x120ad92d>)
#f(compiled-function (edit) #<bytecode -0x9b8e84b9515e2ea>)(#<hash-table equal 2/2 0x120ad92d>)
lsp--apply-text-edits((#<hash-table equal 2/2 0x12062b03>) format)
lsp-format-buffer()
run-hooks(before-save-hook)
basic-save-buffer(t)
save-buffer(1)
funcall-interactively(save-buffer 1)
#<subr call-interactively>(save-buffer nil nil)
call-interactively@ido-cr+-record-current-command(#<subr call-interactively> save-buffer nil nil)
apply(call-interactively@ido-cr+-record-current-command #<subr call-interactively> (save-buffer nil nil))
call-interactively(save-buffer nil nil)
command-execute(save-buffer)
This is not the only scenario when this happens. I can also sometimes trigger the same thing by trying to jump to the definition of a symbol from a .cpp/c++-header file into a system header (all of which are on a read-only filesystem on my computer), for example one of the SDL headers. The main difference is that the buffer-switching gets mixed into the lot and emacs doesn't even respond to C-g and I have to kill -SIGUSR2 it to get it to start responding again, but I'm pretty sure it's the same bug - output from this scenario is here: https://0x0.st/X-RT.txt
I'm sorry about the <optimized out> everywhere and lack of inlined sources, but I've already rebuilt it with nixos's enableDebugging flag, which should have enabled -Og and -g3 (I think it did do the latter but failed on the optimizations and left it at O2) and I've already spent most of my day debugging this and it would take another full day to figure out how to properly override the byzantine nixpkgs emacs infrastructure with the right optimization flag and to store the right source tree.
In GNU Emacs 29.3 (build 1, x86_64-pc-linux-gnu, X toolkit, cairo
version 1.18.0, Xaw3d scroll bars)
Windowing system distributor 'The X.Org Foundation', version 11.0.12101012
System Description: NixOS 24.05 (Uakari)
Configured using:
'configure
--prefix=/nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3
--disable-build-details --with-modules --with-x-toolkit=lucid
--with-xft --with-cairo --with-compress-install
--with-toolkit-scroll-bars --with-native-compilation
--without-imagemagick --without-small-ja-dic --with-tree-sitter
--with-xinput2 --without-xwidgets --with-dbus --with-selinux'
Configured features:
CAIRO DBUS FREETYPE GIF GLIB GMP GNUTLS GPM GSETTINGS HARFBUZZ JPEG JSON
LIBOTF LIBSELINUX LIBSYSTEMD LIBXML2 M17N_FLT MODULES NATIVE_COMP NOTIFY
INOTIFY PDUMPER PNG RSVG SECCOMP SOUND SQLITE3 THREADS TIFF
TOOLKIT_SCROLL_BARS TREE_SITTER WEBP X11 XAW3D XDBE XIM XINPUT2 XPM
LUCID ZLIB
Important settings:
value of $LANG: en_GB.UTF-8
value of $XMODIFIERS: @im=fcitx
locale-coding-system: utf-8-unix
Major mode: C++//lw
Minor modes in effect:
lsp-diagnostics-mode: t
lsp-headerline-breadcrumb-mode: t
lsp-modeline-workspace-status-mode: t
lsp-modeline-diagnostics-mode: t
lsp-modeline-code-actions-mode: t
lsp-ui-mode: t
lsp-ui-doc-mode: t
lsp-ui-sideline-mode: t
lsp-treemacs-sync-mode: t
treemacs-filewatch-mode: t
treemacs-follow-mode: t
treemacs-git-mode: t
treemacs-fringe-indicator-mode: t
lsp-completion-mode: t
display-line-numbers-mode: t
subword-mode: t
company-mode: t
yas-minor-mode: t
envrc-global-mode: t
envrc-mode: t
minions-mode: t
dape-breakpoint-global-mode: t
hexl-follow-ascii: t
lsp-managed-mode: t
lsp-mode: t
helm-epa-mode: t
emms-mode-line-mode: t
emms-playing-time-display-mode: t
emms-playing-time-mode: t
helm-descbinds-mode: t
helm-top-poll-mode: t
helm-adaptive-mode: t
helm-mode: t
helm-minibuffer-history-mode: t
org-roam-db-autosync-mode: t
helm-popup-tip-mode: t
async-bytecomp-package-mode: t
override-global-mode: t
xclip-mode: t
projectile-mode: t
global-flycheck-mode: t
flycheck-mode: t
highlight-doxygen-mode: t
modern-c++-font-lock-global-mode: t
modern-c++-font-lock-mode: t
global-git-commit-mode: t
magit-auto-revert-mode: t
auto-revert-mode: t
shell-dirtrack-mode: t
windmove-mode: t
global-display-fill-column-indicator-mode: t
display-fill-column-indicator-mode: t
straight-use-package-mode: t
straight-package-neutering-mode: t
save-place-mode: t
recentf-mode: t
tooltip-mode: t
global-eldoc-mode: t
eldoc-mode: t
show-paren-mode: t
electric-indent-mode: t
mouse-wheel-mode: t
file-name-shadow-mode: t
global-font-lock-mode: t
font-lock-mode: t
blink-cursor-mode: t
column-number-mode: t
line-number-mode: t
transient-mark-mode: t
auto-composition-mode: t
auto-encryption-mode: t
auto-compression-mode: t
abbrev-mode: t
Load-path shadows:
/home/wrath/.emacs.d/straight/build/emacsql-sqlite/emacsql-sqlite hides /home/wrath/.emacs.d/straight/build/emacsql/emacsql-sqlite
/home/wrath/.emacs.d/straight/build/cmake-mode/cmake-mode hides /etc/profiles/per-user/wrath/share/emacs/site-lisp/cmake-mode
/run/current-system/sw/share/emacs/site-lisp/site-start hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/site-lisp/site-start
~/.emacs.d/custom hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/custom
/home/wrath/.emacs.d/straight/build/transient/transient hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/transient
/home/wrath/.emacs.d/straight/build/jsonrpc/jsonrpc hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/jsonrpc
/home/wrath/.emacs.d/straight/build/use-package/use-package hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/use-package/use-package
/home/wrath/.emacs.d/straight/build/bind-key/bind-key hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/use-package/bind-key
/home/wrath/.emacs.d/straight/build/use-package/use-package-ensure hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/use-package/use-package-ensure
/home/wrath/.emacs.d/straight/build/use-package/use-package-delight hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/use-package/use-package-delight
/home/wrath/.emacs.d/straight/build/use-package/use-package-lint hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/use-package/use-package-lint
/home/wrath/.emacs.d/straight/build/use-package/use-package-jump hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/use-package/use-package-jump
/home/wrath/.emacs.d/straight/build/use-package/use-package-diminish hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/use-package/use-package-diminish
/home/wrath/.emacs.d/straight/build/use-package/use-package-bind-key hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/use-package/use-package-bind-key
/home/wrath/.emacs.d/straight/build/use-package/use-package-core hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/use-package/use-package-core
/home/wrath/.emacs.d/straight/build/project/project hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/progmodes/project
/home/wrath/.emacs.d/straight/build/xref/xref hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/progmodes/xref
/home/wrath/.emacs.d/straight/build/org/org-persist hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-persist
/home/wrath/.emacs.d/straight/build/org/ox-texinfo hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ox-texinfo
/home/wrath/.emacs.d/straight/build/org/ob-groovy hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-groovy
/home/wrath/.emacs.d/straight/build/org/org-cycle hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-cycle
/home/wrath/.emacs.d/straight/build/org/ol-eww hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol-eww
/home/wrath/.emacs.d/straight/build/org/org-pcomplete hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-pcomplete
/home/wrath/.emacs.d/straight/build/org/ob-core hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-core
/home/wrath/.emacs.d/straight/build/org/ob-C hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-C
/home/wrath/.emacs.d/straight/build/org/ol hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol
/home/wrath/.emacs.d/straight/build/org/ol-bibtex hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol-bibtex
/home/wrath/.emacs.d/straight/build/org/org-datetree hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-datetree
/home/wrath/.emacs.d/straight/build/org/org-protocol hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-protocol
/home/wrath/.emacs.d/straight/build/org/ob-haskell hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-haskell
/home/wrath/.emacs.d/straight/build/org/ob-exp hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-exp
/home/wrath/.emacs.d/straight/build/org/ob-sass hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-sass
/home/wrath/.emacs.d/straight/build/org/ox-html hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ox-html
/home/wrath/.emacs.d/straight/build/org/ob-fortran hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-fortran
/home/wrath/.emacs.d/straight/build/org/ox-beamer hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ox-beamer
/home/wrath/.emacs.d/straight/build/org/ol-man hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol-man
/home/wrath/.emacs.d/straight/build/org/ob-java hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-java
/home/wrath/.emacs.d/straight/build/org/org-element hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-element
/home/wrath/.emacs.d/straight/build/org/org-timer hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-timer
/home/wrath/.emacs.d/straight/build/org/ox hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ox
/home/wrath/.emacs.d/straight/build/org/ob-comint hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-comint
/home/wrath/.emacs.d/straight/build/org/ol-eshell hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol-eshell
/home/wrath/.emacs.d/straight/build/org/ol-bbdb hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol-bbdb
/home/wrath/.emacs.d/straight/build/org/ob-calc hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-calc
/home/wrath/.emacs.d/straight/build/org/ob-ruby hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-ruby
/home/wrath/.emacs.d/straight/build/org/ob-latex hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-latex
/home/wrath/.emacs.d/straight/build/org/org-footnote hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-footnote
/home/wrath/.emacs.d/straight/build/org/ox-koma-letter hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ox-koma-letter
/home/wrath/.emacs.d/straight/build/org/ox-ascii hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ox-ascii
/home/wrath/.emacs.d/straight/build/org/org-clock hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-clock
/home/wrath/.emacs.d/straight/build/org/org-macro hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-macro
/home/wrath/.emacs.d/straight/build/org/ob-lua hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-lua
/home/wrath/.emacs.d/straight/build/org/ob-processing hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-processing
/home/wrath/.emacs.d/straight/build/org/ol-doi hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol-doi
/home/wrath/.emacs.d/straight/build/org/oc hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/oc
/home/wrath/.emacs.d/straight/build/org/ox-man hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ox-man
/home/wrath/.emacs.d/straight/build/org/ob-ref hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-ref
/home/wrath/.emacs.d/straight/build/org/oc-bibtex hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/oc-bibtex
/home/wrath/.emacs.d/straight/build/org/ob-sed hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-sed
/home/wrath/.emacs.d/straight/build/org/ox-publish hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ox-publish
/home/wrath/.emacs.d/straight/build/org/ox-md hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ox-md
/home/wrath/.emacs.d/straight/build/org/org-inlinetask hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-inlinetask
/home/wrath/.emacs.d/straight/build/org/ob-ocaml hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-ocaml
/home/wrath/.emacs.d/straight/build/org/org-compat hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-compat
/home/wrath/.emacs.d/straight/build/org/org-table hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-table
/home/wrath/.emacs.d/straight/build/org/ob-plantuml hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-plantuml
/home/wrath/.emacs.d/straight/build/org/org-indent hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-indent
/home/wrath/.emacs.d/straight/build/org/ob-sql hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-sql
/home/wrath/.emacs.d/straight/build/org/ob-shell hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-shell
/home/wrath/.emacs.d/straight/build/org/ox-latex hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ox-latex
/home/wrath/.emacs.d/straight/build/org/ob-maxima hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-maxima
/home/wrath/.emacs.d/straight/build/org/org-faces hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-faces
/home/wrath/.emacs.d/straight/build/org/ox-icalendar hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ox-icalendar
/home/wrath/.emacs.d/straight/build/org/oc-natbib hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/oc-natbib
/home/wrath/.emacs.d/straight/build/org/ol-mhe hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol-mhe
/home/wrath/.emacs.d/straight/build/org/org-attach-git hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-attach-git
/home/wrath/.emacs.d/straight/build/org/ob-js hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-js
/home/wrath/.emacs.d/straight/build/org/ox-odt hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ox-odt
/home/wrath/.emacs.d/straight/build/org/org-num hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-num
/home/wrath/.emacs.d/straight/build/org/ob-eshell hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-eshell
/home/wrath/.emacs.d/straight/build/org/org-macs hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-macs
/home/wrath/.emacs.d/straight/build/org/ob-R hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-R
/home/wrath/.emacs.d/straight/build/org/ol-info hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol-info
/home/wrath/.emacs.d/straight/build/org/org-entities hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-entities
/home/wrath/.emacs.d/straight/build/org/ol-w3m hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol-w3m
/home/wrath/.emacs.d/straight/build/org/ob-tangle hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-tangle
/home/wrath/.emacs.d/straight/build/org/ob-eval hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-eval
/home/wrath/.emacs.d/straight/build/org/org-id hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-id
/home/wrath/.emacs.d/straight/build/org/org-loaddefs hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-loaddefs
/home/wrath/.emacs.d/straight/build/org/org-archive hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-archive
/home/wrath/.emacs.d/straight/build/org/org-keys hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-keys
/home/wrath/.emacs.d/straight/build/org/org-refile hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-refile
/home/wrath/.emacs.d/straight/build/org/org-ctags hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-ctags
/home/wrath/.emacs.d/straight/build/org/ol-docview hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol-docview
/home/wrath/.emacs.d/straight/build/org/org-mobile hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-mobile
/home/wrath/.emacs.d/straight/build/org/ob-emacs-lisp hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-emacs-lisp
/home/wrath/.emacs.d/straight/build/org/ob-lisp hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-lisp
/home/wrath/.emacs.d/straight/build/org/ob-sqlite hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-sqlite
/home/wrath/.emacs.d/straight/build/org/oc-csl hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/oc-csl
/home/wrath/.emacs.d/straight/build/org/org-lint hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-lint
/home/wrath/.emacs.d/straight/build/org/ob-clojure hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-clojure
/home/wrath/.emacs.d/straight/build/org/org-mouse hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-mouse
/home/wrath/.emacs.d/straight/build/org/org-agenda hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-agenda
/home/wrath/.emacs.d/straight/build/org/ob-python hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-python
/home/wrath/.emacs.d/straight/build/org/ob hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob
/home/wrath/.emacs.d/straight/build/org/ob-perl hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-perl
/home/wrath/.emacs.d/straight/build/org/org-fold-core hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-fold-core
/home/wrath/.emacs.d/straight/build/org/oc-basic hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/oc-basic
/home/wrath/.emacs.d/straight/build/org/org-capture hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-capture
/home/wrath/.emacs.d/straight/build/org/ob-forth hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-forth
/home/wrath/.emacs.d/straight/build/org/ob-lilypond hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-lilypond
/home/wrath/.emacs.d/straight/build/org/ob-css hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-css
/home/wrath/.emacs.d/straight/build/org/ob-matlab hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-matlab
/home/wrath/.emacs.d/straight/build/org/ob-scheme hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-scheme
/home/wrath/.emacs.d/straight/build/org/org-src hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-src
/home/wrath/.emacs.d/straight/build/org/ob-ditaa hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-ditaa
/home/wrath/.emacs.d/straight/build/org/ob-lob hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-lob
/home/wrath/.emacs.d/straight/build/org/org-feed hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-feed
/home/wrath/.emacs.d/straight/build/org/org-fold hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-fold
/home/wrath/.emacs.d/straight/build/org/org-goto hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-goto
/home/wrath/.emacs.d/straight/build/org/ob-awk hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-awk
/home/wrath/.emacs.d/straight/build/org/ol-rmail hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol-rmail
/home/wrath/.emacs.d/straight/build/org/org-duration hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-duration
/home/wrath/.emacs.d/straight/build/org/ob-julia hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-julia
/home/wrath/.emacs.d/straight/build/org/ol-gnus hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol-gnus
/home/wrath/.emacs.d/straight/build/org/org hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org
/home/wrath/.emacs.d/straight/build/org/ob-octave hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-octave
/home/wrath/.emacs.d/straight/build/org/ob-table hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-table
/home/wrath/.emacs.d/straight/build/org/org-colview hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-colview
/home/wrath/.emacs.d/straight/build/org/org-tempo hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-tempo
/home/wrath/.emacs.d/straight/build/org/org-crypt hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-crypt
/home/wrath/.emacs.d/straight/build/org/org-list hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-list
/home/wrath/.emacs.d/straight/build/org/ob-dot hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-dot
/home/wrath/.emacs.d/straight/build/org/org-habit hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-habit
/home/wrath/.emacs.d/straight/build/org/ob-screen hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-screen
/home/wrath/.emacs.d/straight/build/org/ol-irc hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ol-irc
/home/wrath/.emacs.d/straight/build/org/org-plot hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-plot
/home/wrath/.emacs.d/straight/build/org/oc-biblatex hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/oc-biblatex
/home/wrath/.emacs.d/straight/build/org/ox-org hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ox-org
/home/wrath/.emacs.d/straight/build/org/ob-org hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-org
/home/wrath/.emacs.d/straight/build/org/ob-makefile hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-makefile
/home/wrath/.emacs.d/straight/build/org/ob-gnuplot hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/ob-gnuplot
/home/wrath/.emacs.d/straight/build/org/org-attach hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-attach
/home/wrath/.emacs.d/straight/build/org/org-version hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/org/org-version
/home/wrath/.emacs.d/straight/build/eldoc/eldoc hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/emacs-lisp/eldoc
/home/wrath/.emacs.d/straight/build/let-alist/let-alist hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/emacs-lisp/let-alist
/home/wrath/.emacs.d/straight/build/seq/seq hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/emacs-lisp/seq
/home/wrath/.emacs.d/straight/build/map/map hides /nix/store/p3lxifgandfpa174hfspm90wy5jqp05j-emacs-29.3/share/emacs/29.3/lisp/emacs-lisp/map
Features:
(shadow mail-extr emacsbug help-fns radix-tree cl-print helm-command
helm-elisp helm-eval edebug helm-info lsp-diagnostics lsp-headerline
lsp-icons lsp-modeline lsp-lens lsp-ui lsp-ui-flycheck lsp-ui-doc
goto-addr lsp-ui-imenu lsp-ui-peek lsp-ui-sideline lsp-ui-util
face-remap tramp-cache time-stamp tramp-sh lsp-zig lsp-yang lsp-yaml
lsp-xml lsp-wgsl lsp-volar lsp-vimscript lsp-vhdl lsp-vetur lsp-html
lsp-verilog lsp-vala lsp-v lsp-typeprof lsp-ttcn3 lsp-trunk lsp-toml
lsp-tilt lsp-tex lsp-terraform lsp-svelte lsp-steep lsp-sqls lsp-sorbet
lsp-solidity lsp-solargraph lsp-semgrep lsp-rust lsp-ruff-lsp
lsp-ruby-syntax-tree lsp-ruby-lsp lsp-rubocop lsp-rf lsp-remark
lsp-racket lsp-r lsp-qml lsp-pylsp lsp-pyls lsp-pwsh lsp-purescript
lsp-pls lsp-php lsp-perlnavigator lsp-perl lsp-openscad lsp-ocaml
lsp-nushell lsp-nix lsp-nim lsp-nginx lsp-move lsp-mojo lsp-mint lsp-mdx
lsp-marksman lsp-markdown lsp-magik lsp-lua lsp-lisp lsp-kotlin lsp-json
lsp-jq lsp-javascript lsp-idris lsp-haxe lsp-hack lsp-groovy lsp-graphql
lsp-golangci-lint lsp-glsl lsp-gleam lsp-gdscript lsp-fsharp lsp-fortran
lsp-eslint lsp-erlang lsp-emmet lsp-elm lsp-elixir lsp-dockerfile
lsp-dhall lsp-d lsp-cypher lsp-cucumber lsp-css lsp-csharp lsp-crystal
lsp-credo lsp-cobol lsp-cmake lsp-clojure lsp-treemacs
lsp-treemacs-generic lsp-treemacs-themes treemacs-treelib treemacs
treemacs-header-line treemacs-compatibility treemacs-mode
treemacs-bookmarks treemacs-tags treemacs-interface treemacs-persistence
treemacs-filewatch-mode treemacs-follow-mode treemacs-rendering
treemacs-annotations treemacs-async treemacs-workspaces treemacs-dom
treemacs-visuals treemacs-fringe-indicator treemacs-faces treemacs-icons
treemacs-scope treemacs-themes treemacs-core-utils pfuture
treemacs-logging treemacs-customization treemacs-macros lsp-clangd
lsp-bufls lsp-go lsp-completion lsp-beancount lsp-bash lsp-awk
lsp-autotools lsp-astro lsp-asm lsp-ansible lsp-angular lsp-ada
lsp-semantic-tokens lsp-actionscript display-line-numbers cap-words
superword subword cc-mode cc-fonts cc-guess cc-menus cc-cmds cc-styles
cc-align cc-engine cc-vars winner image-file image-converter char-fold
helm-external tramp-archive tramp-gvfs cus-start company-oddmuse
company-keywords company-etags company-gtags company-dabbrev-code
company-dabbrev company-files company-clang company-capf company-cmake
company-semantic company-template company-bbdb company yasnippet time
init custom.el key-assist term disp-table ehelp dired-x dired-aux
diredc-autoloads key-assist-autoloads envrc inheritenv envrc-autoloads
inheritenv-autoloads nix-mode-autoloads yaml-mode yaml-mode-autoloads
minions minions-autoloads gluon-mode dape eglot external-completion
array jsonrpc hexl gdb-mi gud repeat dape-autoloads jsonrpc-autoloads
helm-lsp-autoloads lsp-haskell haskell-mode haskell-cabal haskell-utils
haskell-font-lock haskell-indentation haskell-string
haskell-sort-imports haskell-lexeme haskell-align-imports
haskell-complete-module haskell-ghc-support flymake-proc flymake dabbrev
haskell-customize lsp-mode lsp-protocol spinner network-stream
lsp-haskell-autoloads haskell-mode-autoloads devdocs-autoloads helm-dash
dash-docs helm-dash-autoloads dash-docs-autoloads dashboard
dashboard-widgets ffap dashboard-autoloads nerd-icons nerd-icons-faces
nerd-icons-data nerd-icons-data-mdicon nerd-icons-data-flicon
nerd-icons-data-codicon nerd-icons-data-devicon nerd-icons-data-sucicon
nerd-icons-data-wicon nerd-icons-data-faicon nerd-icons-data-powerline
nerd-icons-data-octicon nerd-icons-data-pomicon nerd-icons-data-ipsicon
nerd-icons-autoloads all-the-icons all-the-icons-faces data-material
data-weathericons data-octicons data-fileicons data-faicons
data-alltheicons all-the-icons-autoloads page-break-lines
page-break-lines-autoloads go-translate gts-engine-youdao
gts-engine-stardict gts-engine-deepl gts-engine-google-rpc
gts-engine-google gts-engine-bing gts-implements posframe gts-faces
gts-core go-translate-autoloads helm-init helm-epa helm-emms
helm-emms-autoloads emms-config emms-mpris emms-librefm-stream
emms-librefm-scrobbler emms-playlist-limit emms-i18n emms-history
emms-score emms-stream-info emms-metaplaylist-mode emms-bookmarks
emms-cue emms-mode-line-icon emms-browser emms-volume
emms-volume-sndioctl emms-volume-mixerctl emms-volume-pulse
emms-volume-amixer emms-playlist-sort emms-last-played emms-player-xine
emms-player-mpd tq emms-lyrics emms-url emms-streams emms-show-all
emms-tag-editor emms-tag-tracktag emms-mark emms-mode-line emms-cache
emms-info-native emms-info-native-spc emms-info-native-mp3
emms-info-native-ogg emms-info-native-opus emms-info-native-flac
emms-info-native-vorbis emms-info-exiftool emms-info-tinytag
emms-info-metaflac emms-info-opusinfo emms-info-ogginfo
emms-info-mp3info emms-playlist-mode emms-player-vlc emms-player-mpv
emms-playing-time emms-info emms-later-do emms-player-mplayer
emms-player-simple emms-source-playlist emms-source-file emms-setup
helm-descbinds helm-descbinds-autoloads helm-wikipedia
helm-wikipedia-autoloads helm-dictionary helm-net
helm-dictionary-autoloads helm-sys helm-adaptive helm-mode helm-misc
helm-files image-dired image-dired-tags image-dired-external
image-dired-util helm-buffers helm-occur helm-tags helm-locate helm-grep
helm-regexp helm-types emms emms-compat emms-autoloads org-roam-ui
org-roam-dailies websocket bindat simple-httpd org-roam-ui-autoloads
websocket-autoloads simple-httpd-autoloads org-roam-ql
org-roam-ql-autoloads org-roam-bibtex orb-core orb-compat orb-utils
bibtex-completion biblio biblio-download biblio-dissemin biblio-ieee
biblio-hal biblio-dblp biblio-crossref biblio-arxiv biblio-doi
biblio-core parsebib bibtex org-roam-migrate org-roam-log org-roam-mode
org-roam-capture org-roam-id org-roam-node org-roam-db
emacsql-sqlite-builtin sqlite org-roam-utils org-roam-compat org-roam
org-capture org-attach org-roam-bibtex-autoloads
bibtex-completion-autoloads biblio-autoloads biblio-core-autoloads
parsebib-autoloads org-roam-autoloads hyperbole hinit hui hui-mouse
hmouse-key hsys-flymake hui-menu hyrolo-menu hui-jmenu hibtypes
hib-doc-id hyrolo sort reveal klink hmouse-tag hsys-xref hib-kbd
hui-mini hib-debbugs hsys-www eww url-queue mm-url hib-social hypb-ert
ert ewoc debug backtrace hactypes hsys-org man hargs hpath tramp
tramp-loaddefs trampver tramp-integration tramp-compat hmouse-sh
hsettings hui-em-but hbut hmouse-drv hui-window pulse hycontrol view
hui-select hbdata hgnus gnus-msg gnus-art mm-uu mml2015 mm-view
mml-smime smime dig gnus-sum gnus-group gnus-undo gnus-start gnus-dbus
dbus gnus-cloud nnimap nnmail mail-source utf7 nnoo gnus-spec gnus-int
gnus-range gnus-win gnus nnheader range hsmail hmail htz cal-julian
hbmap hmoccur hvar hypb locate hversion hload-path kotl-autoloads
hyperbole-autoloads hact set hhist helm-org-ql org-ql-search org-ql-view
magit-bookmark bookmark ov org-super-agenda helm-org helm-utils
helm-help helm helm-global-bindings helm-core async-bytecomp helm-source
helm-multi-match helm-lib async helm-org-ql-autoloads helm-org-autoloads
helm-easymenu helm-autoloads wfnames-autoloads helm-core-autoloads
async-autoloads org-ql peg ts org-habit org-agenda org-element
org-persist xdg org-id org-refile org-element-ast inline avl-tree
org-duration org-ql-autoloads peg-autoloads ov-autoloads
org-super-agenda-autoloads ts-autoloads org-contrib
org-contrib-autoloads org-journal org-crypt cal-iso
org-journal-autoloads org-edna org ob ob-tangle ob-ref ob-lob ob-table
ob-exp org-macro org-src sh-script smie treesit executable ob-comint
org-pcomplete org-list org-footnote org-faces org-entities ob-emacs-lisp
ob-core ob-eval org-cycle org-table ol org-fold org-fold-core org-keys
oc org-loaddefs cal-menu calendar cal-loaddefs org-version org-compat
org-macs org-edna-autoloads slime etags fileloop generator xref
hyperspec slime-autoloads macrostep-autoloads rmsbolt rmsbolt-split
rmsbolt-java disass cc-defs rmsbolt-autoloads git-timemachine vc-git
git-timemachine-autoloads cmake-font-lock cmake-font-lock-autoloads
cmake-mode rst cmake-mode-autoloads w3m doc-view jka-compr image-mode
exif timezone w3m-hist bookmark-w3m w3m-ems w3m-favicon w3m-image w3m-fb
tab-line w3m-proc w3m-util w3m-load w3m-autoloads code-review
code-review-actions code-review-comment code-review-section
code-review-bitbucket code-review-faces shr pixel-fill kinsoku url-file
svg dom emojify apropos tar-mode arc-mode archive-mode ht
code-review-gitlab code-review-utils code-review-parse-hunk
code-review-github code-review-db uuidgen calc-misc calc-ext calc
calc-loaddefs rect calc-macs a code-review-interfaces deferred
code-review-autoloads emojify-autoloads deferred-autoloads
uuidgen-autoloads a-autoloads emacsql-sqlite emacsql-sqlite-autoloads
forge-list forge-commands forge-semi forge-bitbucket buck forge-gogs
gogs forge-gitea gtea forge-gitlab glab forge-github ghub-graphql treepy
gsexp ghub url-http url-gw nsm url-auth let-alist gnutls forge-notify
forge-revnote forge-pullreq forge-issue forge-topic yaml parse-time
iso8601 bug-reference forge-post markdown-mode forge-repo forge
forge-core forge-db closql emacsql-sqlite-common emacsql
emacsql-compiler eieio-base forge-autoloads yaml-autoloads
ghub-autoloads treepy-autoloads closql-autoloads emacsql-autoloads
bufler pretty-hydra hydra lv bufler-group-tree f bufler-autoloads
pretty-hydra-autoloads burly-autoloads map-autoloads popup
popup-autoloads rustic-autoloads xterm-color-autoloads project-autoloads
xref-autoloads let-alist-autoloads rust-mode-autoloads
use-package-bind-key bind-key use-package-ensure xclip xclip-autoloads
gruvbox-dark-hard-theme gruvbox-theme gruvbox autothemer
gruvbox-theme-autoloads autothemer-autoloads
color-theme-sanityinc-tomorrow color
color-theme-sanityinc-tomorrow-autoloads rg files-x vc vc-dispatcher
rg-info-hack advice rg-menu rg-ibuffer rg-result wgrep-rg wgrep
rg-history rg-header rg-autoloads wgrep-autoloads ag vc-svn find-dired s
ag-autoloads projectile project lisp-mnt grep compile ibuf-ext ibuffer
ibuffer-loaddefs thingatpt projectile-autoloads lsp-treemacs-autoloads
treemacs-autoloads cfrs-autoloads posframe-autoloads hydra-autoloads
pfuture-autoloads ace-window-autoloads avy-autoloads lsp-ui-autoloads
lsp-mode-autoloads eldoc-autoloads lv-autoloads markdown-mode-autoloads
spinner-autoloads ht-autoloads f-autoloads s-autoloads flycheck
find-func flycheck-autoloads highlight-doxygen noutline outline
highlight-doxygen-autoloads clang-format xml clang-format-autoloads
modern-cpp-font-lock modern-cpp-font-lock-autoloads magit-submodule
magit-blame magit-stash magit-reflog magit-bisect magit-push magit-pull
magit-fetch magit-clone magit-remote magit-commit magit-sequence
magit-notes magit-worktree magit-tag magit-merge magit-branch
magit-reset magit-files magit-refs magit-status magit magit-repos
magit-apply magit-wip magit-log which-func imenu magit-diff smerge-mode
diff diff-mode git-commit log-edit message sendmail yank-media puny
dired dired-loaddefs rfc822 mml mml-sec epa derived epg rfc6068
epg-config gnus-util text-property-search time-date mm-decode mm-bodies
mm-encode mail-parse rfc2231 rfc2047 rfc2045 mm-util ietf-drums
mail-prsvr mailabbrev mail-utils gmm-utils mailheader pcvs-util add-log
magit-core magit-autorevert autorevert filenotify magit-margin
magit-transient magit-process with-editor shell pcomplete comint
ansi-osc ring server ansi-color magit-mode transient edmacro kmacro
magit-git magit-base magit-section format-spec cursor-sensor crm dash
magit-autoloads magit-section-autoloads git-commit-autoloads
with-editor-autoloads transient-autoloads dash-autoloads
yasnippet-autoloads finder-inf company-autoloads ido-completing-read+
memoize cus-edit pp cus-load minibuf-eldef
ido-completing-read+-autoloads memoize-autoloads which-key
which-key-autoloads smex smex-autoloads windmove comp comp-cstr warnings
icons rx easy-mmode display-fill-column-indicator hl-line no-littering
compat no-littering-autoloads compat-autoloads seq-autoloads
use-package-core use-package-autoloads info bind-key-autoloads
straight-autoloads cl-extra help-mode straight saveplace recentf
tree-widget wid-edit package browse-url url url-proxy url-privacy
url-expand url-methods url-history url-cookie generate-lisp-file
url-domsuf url-util mailcap url-handlers url-parse auth-source cl-seq
eieio eieio-core cl-macs password-cache json subr-x map byte-opt gv
bytecomp byte-compile url-vars cl-loaddefs cl-lib ido pcase early-init
rmc iso-transl tooltip cconv eldoc paren electric uniquify ediff-hook
vc-hooks lisp-float-type elisp-mode mwheel term/x-win x-win
term/common-win x-dnd tool-bar dnd fontset image regexp-opt fringe
tabulated-list replace newcomment text-mode lisp-mode prog-mode register
page tab-bar menu-bar rfn-eshadow isearch easymenu timer select
scroll-bar mouse jit-lock font-lock syntax font-core term/tty-colors
frame minibuffer nadvice seq simple cl-generic indonesian philippine
cham georgian utf-8-lang misc-lang vietnamese tibetan thai tai-viet lao
korean japanese eucjp-ms cp51932 hebrew greek romanian slovak czech
european ethiopic indian cyrillic chinese composite emoji-zwj charscript
charprop case-table epa-hook jka-cmpr-hook help abbrev obarray oclosure
cl-preloaded button loaddefs theme-loaddefs faces cus-face macroexp
files window text-properties overlay sha1 md5 base64 format env
code-pages mule custom widget keymap hashtable-print-readable backquote
threads dbusbind inotify dynamic-setting system-font-setting
font-render-setting cairo x-toolkit xinput2 x multi-tty
make-network-process native-compile emacs)
Memory information:
((conses 16 1243263 1175236)
(symbols 48 88279 1805)
(strings 32 344596 222363)
(string-bytes 1 12144394)
(vectors 16 183568)
(vector-slots 8 4145168 2453468)
(floats 8 1822 6130)
(intervals 56 4747 4613)
(buffers 984 30))
[-- Attachment #1.1.2.1: Type: text/html, Size: 448036 bytes --]
[-- Attachment #1.2: publickey - 1stmil.eth@proton.me - 0xB0C7DB1C.asc --]
[-- Type: application/pgp-keys, Size: 649 bytes --]
[-- Attachment #2: OpenPGP digital signature --]
[-- Type: application/pgp-signature, Size: 249 bytes --]
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: Possible workaround/culprit
2024-04-16 13:36 bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory 1stmil.eth via Bug reports for GNU Emacs, the Swiss army knife of text editors
@ 2024-04-16 15:52 ` pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
2024-04-16 18:31 ` Dmitry Gutov
2024-04-16 16:22 ` bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory Eli Zaretskii
2024-04-16 17:59 ` Alan Mackenzie
2 siblings, 1 reply; 15+ messages in thread
From: pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors @ 2024-04-16 15:52 UTC (permalink / raw)
To: 70423@debbugs.gnu.org
[-- Attachment #1.1.1: Type: text/plain, Size: 249 bytes --]
I have now filed a bug with hyperbole https://github.com/rswgnu/hyperbole/issues/518, as disabling that package seems to stop the hangs. Not 100% sure if it's their bug or cc-mode now, but I haven't been able to trigger the behaviour since then.
[-- Attachment #1.1.2.1: Type: text/html, Size: 655 bytes --]
[-- Attachment #1.2: publickey - pillowtrucker@proton.me - 0x40BB2176.asc --]
[-- Type: application/pgp-keys, Size: 657 bytes --]
[-- Attachment #2: OpenPGP digital signature --]
[-- Type: application/pgp-signature, Size: 249 bytes --]
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory
2024-04-16 13:36 bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory 1stmil.eth via Bug reports for GNU Emacs, the Swiss army knife of text editors
2024-04-16 15:52 ` bug#70423: Possible workaround/culprit pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
@ 2024-04-16 16:22 ` Eli Zaretskii
2024-04-16 17:05 ` Alan Mackenzie
2024-04-16 17:59 ` Alan Mackenzie
2 siblings, 1 reply; 15+ messages in thread
From: Eli Zaretskii @ 2024-04-16 16:22 UTC (permalink / raw)
To: 1stmil.eth, Alan Mackenzie; +Cc: 70423
> Date: Tue, 16 Apr 2024 13:36:16 +0000
> From: "1stmil.eth" via "Bug reports for GNU Emacs,
> the Swiss army knife of text editors" <bug-gnu-emacs@gnu.org>
>
> Among other scenarios, when clang-format runs as a hook on file save when I make any (even noop) edit in https://github.com/pillowtrucker/mir/blob/main/src/platform/graphics/drm_formats.cpp this file, for example, emacs enters an infinite loop consuming 100% of a cpu core and all memory up to gc threshold.
Adding Alan to the discussion.
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory
2024-04-16 16:22 ` bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory Eli Zaretskii
@ 2024-04-16 17:05 ` Alan Mackenzie
0 siblings, 0 replies; 15+ messages in thread
From: Alan Mackenzie @ 2024-04-16 17:05 UTC (permalink / raw)
To: Eli Zaretskii; +Cc: 1stmil.eth, 70423, acm
Hello, Eli.
On Tue, Apr 16, 2024 at 19:22:45 +0300, Eli Zaretskii wrote:
> > Date: Tue, 16 Apr 2024 13:36:16 +0000
> > From: "1stmil.eth" via "Bug reports for GNU Emacs,
> > the Swiss army knife of text editors" <bug-gnu-emacs@gnu.org>
> > Among other scenarios, when clang-format runs as a hook on file save
> > when I make any (even noop) edit in
> > https://github.com/pillowtrucker/mir/blob/main/src/platform/graphics/drm_formats.cpp
> > this file, for example, emacs enters an infinite loop consuming 100%
> > of a cpu core and all memory up to gc threshold.
> Adding Alan to the discussion.
Thanks! I'll have a look at it.
--
Alan Mackenzie (Nuremberg, Germany).
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory
2024-04-16 13:36 bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory 1stmil.eth via Bug reports for GNU Emacs, the Swiss army knife of text editors
2024-04-16 15:52 ` bug#70423: Possible workaround/culprit pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
2024-04-16 16:22 ` bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory Eli Zaretskii
@ 2024-04-16 17:59 ` Alan Mackenzie
2024-04-16 19:51 ` pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
2 siblings, 1 reply; 15+ messages in thread
From: Alan Mackenzie @ 2024-04-16 17:59 UTC (permalink / raw)
To: 1stmil.eth; +Cc: acm, Eli Zaretskii, 70423
Hello.
Thanks for taking the trouble to submit this bug report.
On Tue, Apr 16, 2024 at 13:36:16 +0000, 1stmil.eth wrote:
> Among other scenarios, when clang-format runs as a hook on file save
> when I make any (even noop) edit in
> https://github.com/pillowtrucker/mir/blob/main/src/platform/graphics/drm_formats.cpp
> this file, for example, emacs enters an infinite loop consuming 100%
> of a cpu core and all memory up to gc threshold.
> It is not always the regex function on the top of the stack but it is always a call around those functions
> "beginning-of-defun-raw"
> "beginning-of-defun"
> "c-get-fallback-scan-pos"
> (gdb) bt full
Yes. c-parse-state is known for sometimes looping - it is an awkward
spot where doing something rigorusly is likely to be (far) too slow, but
the ad hoc speed ups occasionally go wrong. That seems to be the
problem here.
[ The gdb backtrace (snipped) unfortunately isn't very helpful, here. ]
> Inside of emacs I get something like this:
> Debugger entered--Lisp error: (quit) re-search-backward("^\\s(\\|\\(?:^[ \11]*\\(template\\s-*<[^>;.{}]+>\\s-*\\)?\\(\\(\\(auto\\|const\\|explicit\\|extern\\s-+\"[^\"]+\"\\|extern\\|friend\\|inline\\|mutable\\|overload\\|register\\|static\\|typedef\\|virtual\\)\\s-+\\)*\\(\\([[<a-zA-Z][]_a-zA-Z0-9]*\\(::[]_a-zA-Z0-9]+\\)?\\s-*<[_<>a-zA-Z0-9 ,]+>\\s-*[*&]*\\|[[<a-zA-Z][]_<>a-zA-Z0-9]*\\(::[[<a-zA-Z][]_<>a-zA-Z0-9]+\\)?\\s-*[*&]*\\)[*& \11\n\15]+\\)\\)?\\(\\(::\\|[[<a-zA-Z][]_a-zA-Z0-9]*\\s-*<[^>;{}]+>\\s-*[*&]*::\\|[[<a-zA-Z][]_~<>a-zA-Z0-9]*\\s-*[*&]*::\\)\\s-*\\)?\\(operator\\s-*[^ \11\n\15:;.,?~{}]+\\(\\s-*\\[\\]\\)?\\|[_~<a-zA-Z][^][ \11:;.,~{}()\177]*\\|[*&]?\\([_~<a-zA-Z][_a-zA-Z0-9]*\\s-*<[^>;{}]+[ \11\n\15>]*>\\|[_~<a-zA-Z][_~<>a-zA-Z0-9]*\\)\\)\\s-*\\(([^{;]*)\\(\\(\\s-+const\\|
\\s-+mutable\\)?\\(\\s-*[=:][^;{]+\\)?\\)?\\)\\s-*\\)\\s(" nil move 1)
> beginning-of-defun-raw(nil)
> beginning-of-defun()
> c-get-fallback-scan-pos(18875)
> c-parse-state-get-strategy(18875 13474)
> c-parse-state-1()
> c-parse-state()
> c-laomib-invalidate-cache(18875 18880)
> c-before-change(18875 18880)
The functions thus far suggest that your file is somewhat unusual; it
has, perhaps, long stretches of text without braces, or long brace
blocks.
Could you possibly send me a copy of the above C++ file, or point me to
an open website (not github) where I could download a copy? I have no
access to github, since I am not prepared to let probably hostile
scripts controlled by Microsoft run on my machine.
> lsp--apply-text-edit-replace-buffer-contents(#<hash-table equal 2/2 0x120ad92d>)
> #f(compiled-function (edit) #<bytecode -0x9b8e84b9515e2ea>)(#<hash-table equal 2/2 0x120ad92d>)
> lsp--apply-text-edits((#<hash-table equal 2/2 0x12062b03>) format)
> lsp-format-buffer()
> run-hooks(before-save-hook)
> basic-save-buffer(t)
> save-buffer(1)
> funcall-interactively(save-buffer 1)
> #<subr call-interactively>(save-buffer nil nil)
> call-interactively@ido-cr+-record-current-command(#<subr call-interactively> save-buffer nil nil)
> apply(call-interactively@ido-cr+-record-current-command #<subr call-interactively> (save-buffer nil nil))
> call-interactively(save-buffer nil nil)
> command-execute(save-buffer)
> This is not the only scenario when this happens. I can also sometimes
> trigger the same thing by trying to jump to the definition of a symbol
> from a .cpp/c++-header file into a system header (all of which are on
> a read-only filesystem on my computer), for example one of the SDL
> headers. The main difference is that the buffer-switching gets mixed
> into the lot and emacs doesn't even respond to C-g and I have to kill
> -SIGUSR2 it to get it to start responding again, but I'm pretty sure
> it's the same bug - output from this scenario is here:
> https://0x0.st/X-RT.txt
What would be most helpful here would be a reliable recipe to reproduce
the bug without needing other libraries such as lsp, preferably starting
from emacs -Q.
> I'm sorry about the <optimized out> everywhere and lack of inlined
> sources, but I've already rebuilt it with nixos's enableDebugging
> flag, which should have enabled -Og and -g3 (I think it did do the
> latter but failed on the optimizations and left it at O2) and I've
> already spent most of my day debugging this and it would take another
> full day to figure out how to properly override the byzantine nixpkgs
> emacs infrastructure with the right optimization flag and to store the
> right source tree.
Yes, bugs are like that sometimes. I'm afraid I don't know anything
about nixos.
> In GNU Emacs 29.3 (build 1, x86_64-pc-linux-gnu, X toolkit, cairo
> version 1.18.0, Xaw3d scroll bars)
> Windowing system distributor 'The X.Org Foundation', version 11.0.12101012
> System Description: NixOS 24.05 (Uakari)
[ .... ]
--
Alan Mackenzie (Nuremberg, Germany).
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: Possible workaround/culprit
2024-04-16 15:52 ` bug#70423: Possible workaround/culprit pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
@ 2024-04-16 18:31 ` Dmitry Gutov
0 siblings, 0 replies; 15+ messages in thread
From: Dmitry Gutov @ 2024-04-16 18:31 UTC (permalink / raw)
To: pillowtrucker, 70423@debbugs.gnu.org
On 16/04/2024 18:52, pillowtrucker--- via Bug reports for GNU Emacs, the
Swiss army knife of text editors wrote:
> I have now filed a bug with hyperbole
> https://github.com/rswgnu/hyperbole/issues/518
> <https://github.com/rswgnu/hyperbole/issues/518>, as disabling that
> package seems to stop the hangs. Not 100% sure if it's their bug or
> cc-mode now, but I haven't been able to trigger the behaviour since then.
According to your link to the hyperbole repo, it indeed now seems to
have been caused by it:
https://github.com/rswgnu/hyperbole/blob/master/hui-select.el#L404
It alters defun-prompt-regexp in c++-mode-hook.
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory
2024-04-16 17:59 ` Alan Mackenzie
@ 2024-04-16 19:51 ` pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
2024-04-18 18:39 ` Alan Mackenzie
0 siblings, 1 reply; 15+ messages in thread
From: pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors @ 2024-04-16 19:51 UTC (permalink / raw)
To: Alan Mackenzie; +Cc: Eli Zaretskii, 70423
[-- Attachment #1.1: Type: text/plain, Size: 8833 bytes --]
Greetings!
I have been able to replicate a (relatively) minimum environment for this — hyperbole + clang-format.el.
I think lsp-mode aggravates the issue somehow, but is not necessary to enter the infinite loop. Without lsp-mode, however, the memory usage seems flat, as opposed to ballooning when it is present.
I would also guess that if you are able to plug in that regexp into cc-mode without installing all of hyperbole.el, you would probably get the same effect, but I didn't know how to do that.
You will need gzip and the clang-format utility for this from your linux distribution or compiled from source. Preferably version 18.1.3 of the llvm suite, but it might work with earlier versions. I don't think /how/ it's formatting the file matters as much as the fact of it being altered to some degree.
Please follow these steps:
1. start with an empty directory
$ export MYDEBUGDIR=emacs-debugging
2. use the attached init.el file as follows:
$ emacs-29.3 --init-directory=${MYDEBUGDIR} -l init.el
3. Wait for the script to reach the point where it's in an infinite loop (check top/htop for emacs with 100% usage, maybe wait a few seconds or minutes to make sure it is not just taking a long time to run the formatting) and press C-g to send "quit".
This results in a hang and the debugger should show something like this:
Debugger entered--Lisp error: (quit)
#f(compiled-function () #<bytecode -0x7e8f9110f9b66d2>)()
syntax-ppss()
beginning-of-defun-raw(nil)
beginning-of-defun()
c-get-fallback-scan-pos(18908)
c-parse-state-get-strategy(18908 1)
c-parse-state-1()
c-parse-state()
c-laomib-invalidate-cache(18908 18910)
c-before-change(18908 18910)
clang-format--replace(18908 2 "\n")
apply(clang-format--replace (18908 2 "\n"))
clang-format-region(1 18910 nil nil)
clang-format-buffer()
load-with-code-conversion("/home/wrath/emacs-debugging2/init.el" "/home/wrath/emacs-debugging2/init.el" nil t)
command-line-1(("-l" "emacs-debugging2/init.el"))
command-line()
normal-top-level()
or maybe you will see:
Debugger entered--Lisp error: (quit)
re-search-backward("^\\s(\\|\\(?:^[ \11]*\\(template\\s-*<[^>;.{}]+>\\s-*\\)?\\(..." nil move 1)
beginning-of-defun-raw(nil)
beginning-of-defun()
c-get-fallback-scan-pos(18908)
c-parse-state-get-strategy(18908 1)
c-parse-state-1()
c-parse-state()
c-laomib-invalidate-cache(18908 18910)
c-before-change(18908 18910)
clang-format--replace(18908 2 "\n")
apply(clang-format--replace (18908 2 "\n"))
clang-format-region(1 18910 nil nil)
clang-format-buffer()
load-with-code-conversion("/home/wrath/emacs-debugging2/init.el" "/home/wrath/emacs-debugging2/init.el" nil t)
command-line-1(("-l" "emacs-debugging2/init.el"))
command-line()
normal-top-level()
Either way it does seem like the problem lies somewhere in cc-mode choking either on the file itself or on that regular expression.
I license the attached init.el under the terms of the AGPL-3 or later version. The drm_formats.cpp file is part of the MIR Server project and is licensed under the terms of the GPL-v3. Both licenses attached. I'm not sure if I am allowed to re-license the MIR file as AGPL, but I believe they are in any case compatible to be distributed together.
Thank you for having a look at this issue, it has been plaguing me since november and even making rust look like an ever so slightly more pleasant alternative to dealing with constant hangs/crashes and having to restore frame/window layouts when editing C/C++..
Kind regards,
M.
On Tuesday, April 16th, 2024 at 7:59 PM, Alan Mackenzie <acm@muc.de> wrote:
> Hello.
>
> Thanks for taking the trouble to submit this bug report.
>
> On Tue, Apr 16, 2024 at 13:36:16 +0000, 1stmil.eth wrote:
>
> > Among other scenarios, when clang-format runs as a hook on file save
> > when I make any (even noop) edit in
> > https://github.com/pillowtrucker/mir/blob/main/src/platform/graphics/drm_formats.cpp
> > this file, for example, emacs enters an infinite loop consuming 100%
> > of a cpu core and all memory up to gc threshold.
>
> > It is not always the regex function on the top of the stack but it is always a call around those functions
> > "beginning-of-defun-raw"
> > "beginning-of-defun"
> > "c-get-fallback-scan-pos"
> > (gdb) bt full
>
>
> Yes. c-parse-state is known for sometimes looping - it is an awkward
> spot where doing something rigorusly is likely to be (far) too slow, but
> the ad hoc speed ups occasionally go wrong. That seems to be the
> problem here.
>
> [ The gdb backtrace (snipped) unfortunately isn't very helpful, here. ]
>
> > Inside of emacs I get something like this:
>
> > Debugger entered--Lisp error: (quit) re-search-backward("^\\s(\\|\\(?:^[ \11]\\(template\\s-<[^>;.{}]+>\\s-\\)?\\(\\(\\(auto\\|const\\|explicit\\|extern\\s-+\"[^\"]+\"\\|extern\\|friend\\|inline\\|mutable\\|overload\\|register\\|static\\|typedef\\|virtual\\)\\s-+\\)\\(\\([[<a-zA-Z][]a-zA-Z0-9]\\(::[]_a-zA-Z0-9]+\\)?\\s-<[<>a-zA-Z0-9 ,]+>\\s-[&]\\|[[<a-zA-Z][]_<>a-zA-Z0-9]\\(::[[<a-zA-Z][]<>a-zA-Z0-9]+\\)?\\s-[&]\\)[& \11\n\15]+\\)\\)?\\(\\(::\\|[[<a-zA-Z][]a-zA-Z0-9]\\s-<[^>;{}]+>\\s-[&]*::\\|[[<a-zA-Z][]~<>a-zA-Z0-9]\\s-[&]::\\)\\s-\\)?\\(operator\\s-[^ \11\n\15:;.,?~{}]+\\(\\s-*\\[\\]\\)?\\|[~<a-zA-Z][^][ \11:;.,~{}()\177]\\|[&]?\\([~<a-zA-Z][a-zA-Z0-9]\\s-<[^>;{}]+[ \11\n\15>]*>\\|[~<a-zA-Z][~<>a-zA-Z0-9]\\)\\)\\s-\\(([^{;])\\(\\(\\s-+const\\|\\s-+mutable\\)?\\(\\s-[=:][^;{]+\\)?\\)?\\)\\s-*\\)\\s(" nil move 1)
> > beginning-of-defun-raw(nil)
> > beginning-of-defun()
> > c-get-fallback-scan-pos(18875)
> > c-parse-state-get-strategy(18875 13474)
> > c-parse-state-1()
> > c-parse-state()
> > c-laomib-invalidate-cache(18875 18880)
> > c-before-change(18875 18880)
>
>
> The functions thus far suggest that your file is somewhat unusual; it
> has, perhaps, long stretches of text without braces, or long brace
> blocks.
>
> Could you possibly send me a copy of the above C++ file, or point me to
> an open website (not github) where I could download a copy? I have no
> access to github, since I am not prepared to let probably hostile
> scripts controlled by Microsoft run on my machine.
>
> > lsp--apply-text-edit-replace-buffer-contents(#<hash-table equal 2/2 0x120ad92d>)
> > #f(compiled-function (edit) #<bytecode -0x9b8e84b9515e2ea>)(#<hash-table equal 2/2 0x120ad92d>)
> > lsp--apply-text-edits((#<hash-table equal 2/2 0x12062b03>) format)
> > lsp-format-buffer()
> > run-hooks(before-save-hook)
> > basic-save-buffer(t)
> > save-buffer(1)
> > funcall-interactively(save-buffer 1)
> > #<subr call-interactively>(save-buffer nil nil)
> > call-interactively@ido-cr+-record-current-command(#<subr call-interactively> save-buffer nil nil)
> > apply(call-interactively@ido-cr+-record-current-command #<subr call-interactively> (save-buffer nil nil))
> > call-interactively(save-buffer nil nil)
> > command-execute(save-buffer)
>
> > This is not the only scenario when this happens. I can also sometimes
> > trigger the same thing by trying to jump to the definition of a symbol
> > from a .cpp/c++-header file into a system header (all of which are on
> > a read-only filesystem on my computer), for example one of the SDL
> > headers. The main difference is that the buffer-switching gets mixed
> > into the lot and emacs doesn't even respond to C-g and I have to kill
> > -SIGUSR2 it to get it to start responding again, but I'm pretty sure
> > it's the same bug - output from this scenario is here:
> > https://0x0.st/X-RT.txt
>
>
> What would be most helpful here would be a reliable recipe to reproduce
> the bug without needing other libraries such as lsp, preferably starting
> from emacs -Q.
>
> > I'm sorry about the <optimized out> everywhere and lack of inlined
> > sources, but I've already rebuilt it with nixos's enableDebugging
> > flag, which should have enabled -Og and -g3 (I think it did do the
> > latter but failed on the optimizations and left it at O2) and I've
> > already spent most of my day debugging this and it would take another
> > full day to figure out how to properly override the byzantine nixpkgs
> > emacs infrastructure with the right optimization flag and to store the
> > right source tree.
>
>
> Yes, bugs are like that sometimes. I'm afraid I don't know anything
> about nixos.
>
> > In GNU Emacs 29.3 (build 1, x86_64-pc-linux-gnu, X toolkit, cairo
> > version 1.18.0, Xaw3d scroll bars)
> > Windowing system distributor 'The X.Org Foundation', version 11.0.12101012
> > System Description: NixOS 24.05 (Uakari)
>
>
> [ .... ]
>
> --
> Alan Mackenzie (Nuremberg, Germany).
[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #1.2: init.el --]
[-- Type: text/x-emacs-lisp; filename="init.el"; name="init.el", Size: 5740 bytes --]
(defvar my-debug-dir (getenv "MYDEBUGDIR"))
(defvar problematic-file "drm_formats.cpp.gz")
;(make-directory my-debug-dir)
(require 'package)
(add-to-list 'package-archives '("melpa" . "https://melpa.org/packages/") t)
;; Comment/uncomment this line to enable MELPA Stable if desired. See
;; and . Most users will not need or want to do this.
;;(add-to-list 'package-archives '("melpa-stable" . "https://stable.melpa.org/packages/") t)
(package-initialize)
(write-region (base64-decode-string "H4sICLDKHmYAA2RybV9mb3JtYXRzLmNwcADNXOly4kgS/s9T1OCIHnC7zdhtO7zQ7Q2MMVYMhxfw
FbMTClkUoGghMTp8hIN9n32NfbLNVEmidEHJg91m3NOYyvoyv8zKOkRWV7YLZJs0zPmzpU2mDvnf
f0lDMUxDUxWdtJ3RLjSjxHCq2WRumRNLmRF4O7YoJbY5dh4Vi1bJs+kSVTGIRUea7VjavetQojlE
MUYV0yIzc6SNn+EDhHKNEbWIM6XEodbMJubY+6XVvSJtatvQ1qIGtUD/pXuvayppayo1bEoeqGVr
pkH2CUB+3UEsBYxCIXtKR+T+2QM6R9MGvmnk3AR9igP9sqgsLR4RzfAgpuYcrJsqDnJ41HSd3FPi
2nTs6p5aECY30vCidzUk9e4duan3+/Xu8K4Gws7UhFb6QBmUNpvrGiCDMZZiOM9AFxE6zX7jArrU
T6W2NLxDRufSsNscDMh5r0/q5LLeH0qNq3a9Ty6v+pe9QXOXkAFFsygCrHfX2HM8uGBEHUXT7YD/
HcTKBiP1EZkqDxRiplLtAUxUiArjQDgenv9105h4pKHP0q1gqjQmhunsEBtM/jZ1nHm1Unl8fNyd
GO6uaU0qOgOxKydoV6VQ2NIMVXdHlBRnmlUBlPlUU+3KyJrJwGSmOPbutBiVkh3T1H9oTkU1ZzMI
MLQvBb6ptjPSDOeE+4iBuZaq7k75z0GSPql0HhGeUfDeM/8JhjDywb1p2k7FmVrmo8wAcJxN5/MT
NGQ8omPSkfryRf26KZ/1O3KrOZQ7vTPpXGr25W690+SwnsbHR2CfZxg1IF8KBUOZUXuuqJTMJuQ7
AcbVauCYWqGguI4JLdXq0kfgERlHszEpucD9677sENZSJl9OiDpVLAiyYTvbhZfCFtinGZArw77U
bUnnd6UHRS+TfxcIvFQFM07RqyR8sQZ8WdRxLYNsQTvYgZ9oY1L6pcRUkU8EycI47tSH8qnUkpvd
M6neLZc90ZcQxoaBo06J360cfv7ChRm4ffHjXywUCPcC6xVXd6qRDznrilfGD8N8NNAY3wk1aLt3
NRj5Hc0iykTRwBXEoI8wyFFqShWYm+x/Fmsh6IIpXRS2cN4aL51VSPqP47rGlWucSoqkdK9NCI4D
xSgXfSdH/QVuLv1ntaNT3fgFkL8wZM6jqd7cmCeT7kNzmbUFcDGMWVd1vMEMvc89FdUq+1syxmaB
DZrYmGbYkIQ6zGS2rOjzqVKLCppz5S+XyvQvVwO/UsOJtXt9Es0wH1SrppfNiv4tZlW/ddowZ3PT
AHG0DdIq+BWyclHj8hbM9rKNPs0tBupNISwFfRI2ZDZjl8l+mTFcuG/BjgN47YSNY0W36Y6YLNdY
TzSuIfwSGSMHO/7Py2KZNAzL/ysnr9NWX5hXQpbnlWj8qbxA260or6RstLH+gXiBl4V5JWWjjR+J
VzItYI76iel1sBlWiaTIZvUeybUZVsmUyGT1Lqm1GVbJhMhk9S6JtRlWmCx7h4eHoutWVDaWWNHG
XLQOd/yfDa5bwrwSsrHU+kC8MGHAmj3RdSsqG0uuaONP5YUpI8orKRtLrw/EK5kWK9etN0+vvY2t
W6Ks3iO5NsMqmRIr1603T63NsEomxMp1680Ta2OxOjwSmt3jklyT1L2ut6Wz1zM62vAUKEgpLvlh
KYG24+NjwShFJDdG6XjH/9lclAQpxSU/LKVb5nwhUknZ2CIVbfy5vFgExHglZGPL1AfihYuPKK+k
bGyh+kC8cPkR5ZWUjS1VH4hXMi1W7gHfPL2ON7YHFGX1Hsm1GVbJlFi5B3zz1NoMq2RCrNwDvnli
bYYVJsv+3m/4n+jSlRCPpVeiPRc/6Bj+2eAalodjmngs2T4cR0wkZtO+6JKWEI+lXqL9Z3PEtMrB
MVU8logfjmNqAq1c6t4vHfc3tublYPiuybgZhqnJs3IJfL9U3AzD1NRZuRy+XyKmMcSvsJdfW3tV
JmPNGAUlJhoA8tUlWE7jVZdkemVZcoIasC6p5KF6H3/yvwevBt+Hx6tEsLSENe36hQ/fvwdqI7z8
aoVPfHEAm2cqWPVFfQWEfQc/Mqlt/OqAEQ8UWOo67+TtHWIaOqsnAy/agK3TB8VwCJjd0Symdxt4
GCOsc/L6s8Kp2Q55psCGTsjd1XVIaofYJnmkZObaDqu7UogN4dEMqmNxiEsDTPQP6p1ptq0ZE0+/
31YpcDwNV9fnjlXD+gkgyIq0HMS9dw11iuY8KJam3OtgP5YkjAgXQZlje97rkbmpoTETJKjYtqlq
ChbEcUEE7cmKIYYYVrqEo2bdWIiYsrUVBDY50HwFtUJmTVCyMCc2eGfK8z1lmqCXjx4fwXLARHwg
L8txeAB/9K51lWLTcOQnioDSvFMDMXEnBICpdT2nvd5gKA8v+r0buXnbaF4OpV63VIrIeAyxZMVy
YWDMqEwty7ReEjKhHKs7e0kpFiLFBfnMhJb1aTG3f04FLpISRI8YFIYiRFKs5qhcXJTLQfpjdsTG
w+ZGwid/JCxnMw8ca/VSx1xUAVc6h4Lxec8fCtvYxk9m64K3LmixYNnufG5amOvLgFVZxDJrC6M8
PG8zT8f8Fb7N8rFnWNVz2sun1d5agK8XXNEjpwYnt1LZDwCWOXpvsNgxSFXfl6lkUO2XkzAmGToS
hWRJhdGqsbDviW9DEOcvJwks8sv3lIe1GQMiBH7JQFvwo8Xv9LLIZBYvgfsbxOJQf4tXHGwFLa8E
MEYrrAgM+ESHAtPBlQ1meGdZ28f7JeqRtIpAbnaIaIzUCiYSxpzjGg4bgCBfVhkf7HOy4mrLWCPt
J1Om8TCXXmpPVI/GNFjbIsnBxc1bvlKeFFbjUUUT5ogfJJ5iTe5lFK2lAt0KAz2tBgpqedYDAY4i
o2g2EH4NKQiEoplAh0eHQjAyCGaCCHnHd046CHsAuh7kfmJlgwTPWAUi5eNkANWFgZQoUGJv4/fz
Bjhuj2GQB5NGRpKMLXPGp0k0Gwg/8CFzwo6JHWBqfmSP/YTJy8kvJakWtRWYT/kwb0UwQz8L2ukH
cLWd+TBvRTB9SDFEBrgSz3elGB5z5Fq8tJTPwgPZdXhsghFG9Gau9ZipE2UmJkqvxNQMWLK10RIR
zqc3lGyreOtoG47ecBieUWeqBZeHkpsE2M1bdAdvWi03r9tEp86vNh64d0nbezuDQ4CjeNe2IF1D
i/Fel6I/Ks828SzhMCrh+4yNdMr+uVh3HDqbe6d/3TR/EHfOH2+8PT8ct33axPOF37g8i6S6yq4K
maObE01dYUzMkPDBQtKSLW3snRRlWdUVYyLLwQOSBv5KFBVvMdnMnfgUQrk3H6hnO3jUooQ+TRXX
drQHCM5EVb3HKBiQ4OnFBXu04U/NBJS4QBuDifbOFRUvAkJHL7TEnGneHTt85uHZE8DYJjPhEQ7J
iqZjX3b008acWRDlbdC9zVm1G3lUklghhJ3cDBGDWR4PoTY4G28TGhPfm+ymFiJ7S0z0TpZ37VGj
VuxW1tEBnIOCtnK4I2MSeC9L6OYY6vSvzTQGjnVGITeoxS1B3sVIdUn9wYShGWwwS+WSdz4iKlrG
X70i3At39jGBpBC+vOugvmgt0so96Gdu8k+93JH5AZwI8f8eSv7x6c9Swi/pyj0J19DwBDR3rG9I
6o8/d3iXnPgKXiAkLeqwCaLju//aayqF0VjUEg5gvdd5wJ8zmfDuhMKOO8sRnHixdNX9vdu76ZLr
Zves1y/zN89K5aSv8Kj7hp5C+FQ/dfGIvcpL2FPQRyj6Cg8Fwz/dRxH/k8+kWC3C/1EVHpC2qG7T
jV54DLZ+oU+C534sebkFDewOFrUQb2lBumA5mFnS4dpSt1nvr0djcnEw6R97h7zUrTyU2s004zIk
1wHeCQPeCQKOxRHHuWyUG42BuJ0oLWqrKPI4B7Qv2mp29/blfiOn8Xy3fKo6r1PVSVUVG6ODemdw
1W3JsCp+3fe6rx/XyT6CSvaO8CefkmWfNUr+1eh1ZPhz2W8OBqmDdXWHNfDX0nW9O2xmZsIqcUHo
wdUlbC9yKuA6iaq5bEvD3GqWnXKpeR2neNc1KrvX0plUl4fNVr8uqivZR0zJ3tHp7b582u41fpd7
3abc6p0KK0vpm1/p8Kb3aqV+3/xKz3tX/VdrDTrnV9uUWhfDV+sNe+dXPJBuh81m99Wquf6viPCF
1B/e/a048whrDDjt9+pnOBVeNw5k4XkhrZeookG9e/Z1P4cO1iEP/NFBTvijgzzwe/vHOfGhRx4F
+4dHORVAD1EFV9J5DnCQXgNch1/3jm5hmWaj7wr20cNmv92E47PAUFrZfZ3qdvtG6nbFl5hYhxA+
7LnyX+Iouezb9XL4D2skv/pfhJD/B1vCPMXeSQAA
") nil problematic-file)
(package-refresh-contents)
(package-install 'hyperbole)
(package-install 'clang-format)
(custom-set-variables
;; custom-set-variables was added by Custom.
;; If you edit it by hand, you could mess it up, so be careful.
;; Your init file should contain only one such instance.
;; If there is more than one, they won't work right.
'(clang-format-style "GNU")
'(package-selected-packages '(clang-format hyperbole)))
(custom-set-faces
;; custom-set-faces was added by Custom.
;; If you edit it by hand, you could mess it up, so be careful.
;; Your init file should contain only one such instance.
;; If there is more than one, they won't work right.
)
(toggle-debug-on-quit)
(find-file problematic-file)
(switch-to-buffer (find-file-noselect problematic-file))
(clang-format-buffer)
[-- Attachment #1.3: COPYING-AGPL --]
[-- Type: application/octet-stream, Size: 34520 bytes --]
GNU AFFERO GENERAL PUBLIC LICENSE
Version 3, 19 November 2007
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU Affero General Public License is a free, copyleft license for
software and other kinds of works, specifically designed to ensure
cooperation with the community in the case of network server software.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
our General Public Licenses are intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
Developers that use our General Public Licenses protect your rights
with two steps: (1) assert copyright on the software, and (2) offer
you this License which gives you legal permission to copy, distribute
and/or modify the software.
A secondary benefit of defending all users' freedom is that
improvements made in alternate versions of the program, if they
receive widespread use, become available for other developers to
incorporate. Many developers of free software are heartened and
encouraged by the resulting cooperation. However, in the case of
software used on network servers, this result may fail to come about.
The GNU General Public License permits making a modified version and
letting the public access it on a server without ever releasing its
source code to the public.
The GNU Affero General Public License is designed specifically to
ensure that, in such cases, the modified source code becomes available
to the community. It requires the operator of a network server to
provide the source code of the modified version running there to the
users of that server. Therefore, public use of a modified version, on
a publicly accessible server, gives the public access to the source
code of the modified version.
An older license, called the Affero General Public License and
published by Affero, was designed to accomplish similar goals. This is
a different license, not a version of the Affero GPL, but Affero has
released a new version of the Affero GPL which permits relicensing under
this license.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU Affero General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Remote Network Interaction; Use with the GNU General Public License.
Notwithstanding any other provision of this License, if you modify the
Program, your modified version must prominently offer all users
interacting with it remotely through a computer network (if your version
supports such interaction) an opportunity to receive the Corresponding
Source of your version by providing access to the Corresponding Source
from a network server at no charge, through some standard or customary
means of facilitating copying of software. This Corresponding Source
shall include the Corresponding Source for any work covered by version 3
of the GNU General Public License that is incorporated pursuant to the
following paragraph.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the work with which it is combined will remain governed by version
3 of the GNU General Public License.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU Affero General Public License from time to time. Such new versions
will be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU Affero General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU Affero General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU Affero General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If your software can interact with users remotely through a computer
network, you should also make sure that it provides a way for users to
get its source. For example, if your program is a web application, its
interface could display a "Source" link that leads users to an archive
of the code. There are many ways you could offer source, and different
solutions will be better for different programs; see section 13 for the
specific requirements.
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU AGPL, see
<http://www.gnu.org/licenses/>.
[-- Attachment #1.4: COPYING.GPL3 --]
[-- Type: application/octet-stream, Size: 35068 bytes --]
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<http://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
[-- Attachment #1.5: publickey - pillowtrucker@proton.me - 0x40BB2176.asc --]
[-- Type: application/pgp-keys, Size: 657 bytes --]
[-- Attachment #2: OpenPGP digital signature --]
[-- Type: application/pgp-signature, Size: 249 bytes --]
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory
2024-04-16 19:51 ` pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
@ 2024-04-18 18:39 ` Alan Mackenzie
2024-04-19 20:49 ` pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
0 siblings, 1 reply; 15+ messages in thread
From: Alan Mackenzie @ 2024-04-18 18:39 UTC (permalink / raw)
To: pillowtrucker; +Cc: acm, Eli Zaretskii, Bob Weiner, 70423
Hello, Pillowtrucker!
On Tue, Apr 16, 2024 at 19:51:09 +0000, pillowtrucker@proton.me wrote:
> Greetings!
> I have been able to replicate a (relatively) minimum environment for
> this — hyperbole + clang-format.el. I think lsp-mode aggravates the
> issue somehow, but is not necessary to enter the infinite loop. Without
> lsp-mode, however, the memory usage seems flat, as opposed to
> ballooning when it is present. I would also guess that if you are able
> to plug in that regexp into cc-mode without installing all of
> hyperbole.el, you would probably get the same effect, but I didn't know
> how to do that.
> You will need gzip and the clang-format utility for this from your
> linux distribution or compiled from source. Preferably version 18.1.3
> of the llvm suite, but it might work with earlier versions. I don't
> think /how/ it's formatting the file matters as much as the fact of it
> being altered to some degree.
OK. I haven't actually evaluated your init.el (as I don't fully
understand it), but I have a strong hypothesis for the looping.
You're loading hyperbole as part of the initialisation. This sets up the
value of defun-prompt-regexp to a ~760 character long string, whereas
normally in C++ Mode, this variable is nil.
This variable is what is seen in the second backtrace below, although it
is bowdlerised to a very short string ending in ... . See the line below
emphasised with <=========================.
This regexp is known to be faulty, and sometimes to cause infinite
looping. By coincidence, I have recently rewritten this regexp at the
request of Bob Weiner (in the Cc:), the maintainer of hyperbole, and he
is currently testing the regexp. This faulty regexp may be the cause of
your bug, too.
So, could I ask you please to be patient, and wait for Bob to complete
his tests. If they are successful, a new version of hyperbole is the
likely outcome, and this may solve your bug.
If there is any way you can run your test without installing the
hyperbole package, please do so, and let me know whether or not the hang
still occurs.
Thanks!
> Please follow these steps:
> 1. start with an empty directory
> $ export MYDEBUGDIR=emacs-debugging
> 2. use the attached init.el file as follows:
> $ emacs-29.3 --init-directory=${MYDEBUGDIR} -l init.el
> 3. Wait for the script to reach the point where it's in an infinite loop (check top/htop for emacs with 100% usage, maybe wait a few seconds or minutes to make sure it is not just taking a long time to run the formatting) and press C-g to send "quit".
> This results in a hang and the debugger should show something like this:
[ .... ]
> or maybe you will see:
> Debugger entered--Lisp error: (quit)
> re-search-backward("^\\s(\\|\\(?:^[ \11]*\\(template\\s-*<[^>;.{}]+>\\s-*\\)?\\(..." nil move 1) <==========================================================================
> beginning-of-defun-raw(nil)
> beginning-of-defun()
> c-get-fallback-scan-pos(18908)
> c-parse-state-get-strategy(18908 1)
> c-parse-state-1()
> c-parse-state()
> c-laomib-invalidate-cache(18908 18910)
> c-before-change(18908 18910)
> clang-format--replace(18908 2 "\n")
> apply(clang-format--replace (18908 2 "\n"))
> clang-format-region(1 18910 nil nil)
> clang-format-buffer()
> load-with-code-conversion("/home/wrath/emacs-debugging2/init.el" "/home/wrath/emacs-debugging2/init.el" nil t)
> command-line-1(("-l" "emacs-debugging2/init.el"))
> command-line()
> normal-top-level()
> Either way it does seem like the problem lies somewhere in cc-mode
> choking either on the file itself or on that regular expression.
> I license the attached init.el under the terms of the AGPL-3 or later
> version. The drm_formats.cpp file is part of the MIR Server project and
> is licensed under the terms of the GPL-v3. Both licenses attached. I'm
> not sure if I am allowed to re-license the MIR file as AGPL, but I
> believe they are in any case compatible to be distributed together.
> Thank you for having a look at this issue, it has been plaguing me
> since november and even making rust look like an ever so slightly more
> pleasant alternative to dealing with constant hangs/crashes and having
> to restore frame/window layouts when editing C/C++..
> Kind regards,
> M.
--
Alan Mackenzie (Nuremberg, Germany).
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory
2024-04-18 18:39 ` Alan Mackenzie
@ 2024-04-19 20:49 ` pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
2024-04-20 9:22 ` Alan Mackenzie
0 siblings, 1 reply; 15+ messages in thread
From: pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors @ 2024-04-19 20:49 UTC (permalink / raw)
To: Alan Mackenzie; +Cc: Eli Zaretskii, Bob Weiner, 70423
[-- Attachment #1.1: Type: text/plain, Size: 6419 bytes --]
Hello again, Alan!
I've been using a git revision of hyperbole with the regex removed while Bob works on the new regex. I've hit a few other small glitches while using it, but nothing anywhere as major as the main issue at hand, and they're most definitely unrelated.
I also had a look in the other bug report and it seemed like there was also some kind of patch on the cc-mode side in emacs 30/trunk ? Or did I misunderstand that conversation ? I could try running an emacs git build if that's the case, although I'm not sure how many of my other packages will remain compatible, so it's not really a priority.
My init.el script is really innocent, although I've later asked some friends and they agree that they would also probably never run something like that. I just thought it would be a fun challenge to do everything to reproduce the issue in one init script. The base64-encoded string is just a gzipped copy of the .cpp file with which I could reproduce the issue. You should get the same string by running "gzip --stdout drm_formats.cpp|base64" on the attached .cpp file. (However, I don't know if all gzip versions produce the same output given the same input, and it will make me look even more suspicious if the strings don't match.)
Regardless, I've been productively working on other C++ code with the regexp turned off and it's been a great relief not to have to struggle with having to restart my workspace/desktop so often.
Thank you for both of yours work! And good luck with the new regexp!
If you put it in some git tag/branch that I can pull easily, I could maybe assist with testing it ? Let me know if that's an option.
Kind regards,
M
On Thursday, April 18th, 2024 at 8:39 PM, Alan Mackenzie <acm@muc.de> wrote:
> Hello, Pillowtrucker!
>
> On Tue, Apr 16, 2024 at 19:51:09 +0000, pillowtrucker@proton.me wrote:
>
> > Greetings!
>
> > I have been able to replicate a (relatively) minimum environment for
> > this — hyperbole + clang-format.el. I think lsp-mode aggravates the
> > issue somehow, but is not necessary to enter the infinite loop. Without
> > lsp-mode, however, the memory usage seems flat, as opposed to
> > ballooning when it is present. I would also guess that if you are able
> > to plug in that regexp into cc-mode without installing all of
> > hyperbole.el, you would probably get the same effect, but I didn't know
> > how to do that.
>
>
>
> > You will need gzip and the clang-format utility for this from your
> > linux distribution or compiled from source. Preferably version 18.1.3
> > of the llvm suite, but it might work with earlier versions. I don't
> > think /how/ it's formatting the file matters as much as the fact of it
> > being altered to some degree.
>
>
> OK. I haven't actually evaluated your init.el (as I don't fully
> understand it), but I have a strong hypothesis for the looping.
>
> You're loading hyperbole as part of the initialisation. This sets up the
> value of defun-prompt-regexp to a ~760 character long string, whereas
> normally in C++ Mode, this variable is nil.
>
> This variable is what is seen in the second backtrace below, although it
> is bowdlerised to a very short string ending in ... . See the line below
> emphasised with <=========================.
>
> This regexp is known to be faulty, and sometimes to cause infinite
> looping. By coincidence, I have recently rewritten this regexp at the
> request of Bob Weiner (in the Cc:), the maintainer of hyperbole, and he
> is currently testing the regexp. This faulty regexp may be the cause of
> your bug, too.
>
> So, could I ask you please to be patient, and wait for Bob to complete
> his tests. If they are successful, a new version of hyperbole is the
> likely outcome, and this may solve your bug.
>
> If there is any way you can run your test without installing the
> hyperbole package, please do so, and let me know whether or not the hang
> still occurs.
>
> Thanks!
>
> > Please follow these steps:
> > 1. start with an empty directory
> > $ export MYDEBUGDIR=emacs-debugging
> > 2. use the attached init.el file as follows:
> > $ emacs-29.3 --init-directory=${MYDEBUGDIR} -l init.el
> > 3. Wait for the script to reach the point where it's in an infinite loop (check top/htop for emacs with 100% usage, maybe wait a few seconds or minutes to make sure it is not just taking a long time to run the formatting) and press C-g to send "quit".
>
> > This results in a hang and the debugger should show something like this:
>
>
> [ .... ]
>
> > or maybe you will see:
>
> > Debugger entered--Lisp error: (quit)
> > re-search-backward("^\\s(\\|\\(?:^[ \11]\\(template\\s-<[^>;.{}]+>\\s-*\\)?\\(..." nil move 1) <==========================================================================
> > beginning-of-defun-raw(nil)
> > beginning-of-defun()
> > c-get-fallback-scan-pos(18908)
> > c-parse-state-get-strategy(18908 1)
> > c-parse-state-1()
> > c-parse-state()
> > c-laomib-invalidate-cache(18908 18910)
> > c-before-change(18908 18910)
> > clang-format--replace(18908 2 "\n")
> > apply(clang-format--replace (18908 2 "\n"))
> > clang-format-region(1 18910 nil nil)
> > clang-format-buffer()
> > load-with-code-conversion("/home/wrath/emacs-debugging2/init.el" "/home/wrath/emacs-debugging2/init.el" nil t)
> > command-line-1(("-l" "emacs-debugging2/init.el"))
> > command-line()
> > normal-top-level()
>
> > Either way it does seem like the problem lies somewhere in cc-mode
> > choking either on the file itself or on that regular expression.
>
> > I license the attached init.el under the terms of the AGPL-3 or later
> > version. The drm_formats.cpp file is part of the MIR Server project and
> > is licensed under the terms of the GPL-v3. Both licenses attached. I'm
> > not sure if I am allowed to re-license the MIR file as AGPL, but I
> > believe they are in any case compatible to be distributed together.
>
> > Thank you for having a look at this issue, it has been plaguing me
> > since november and even making rust look like an ever so slightly more
> > pleasant alternative to dealing with constant hangs/crashes and having
> > to restore frame/window layouts when editing C/C++..
>
> > Kind regards,
> > M.
>
>
> --
> Alan Mackenzie (Nuremberg, Germany).
[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #1.2: drm_formats.cpp --]
[-- Type: text/x-c++src; filename="drm_formats.cpp"; name="drm_formats.cpp", Size: 18910 bytes --]
/*
* Copyright © Canonical Ltd.
*
* This program is free software: you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License version 2 or 3,
* as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "mir/graphics/drm_formats.h"
#include "mir_toolkit/common.h"
#include <cstdint>
#include <drm_fourcc.h>
#include <stdexcept>
#include <memory>
#include <array>
#include <boost/throw_exception.hpp>
#ifdef MIR_HAVE_DRM_GET_MODIFIER_NAME
#include <xf86drm.h>
#endif
namespace mg = mir::graphics;
auto mg::drm_format_to_string(uint32_t format) -> char const*
{
#define STRINGIFY(val) \
case val: \
return #val;
if (!(format & DRM_FORMAT_BIG_ENDIAN))
{
switch (format)
{
#include "drm-formats"
default:
return "Unknown DRM format; rebuild Mir against newer DRM headers?";
}
}
#undef STRINGIFY
#define STRINGIFY_BIG_ENDIAN(val) \
case val: \
return #val " (big endian)";
switch (format & (~DRM_FORMAT_BIG_ENDIAN))
{
#include "drm-formats-big-endian"
default:
return "Unknown DRM format; rebuild Mir against newer DRM headers?";
}
#undef STRINGIFY_BIGENDIAN
}
struct mg::DRMFormat::FormatInfo
{
uint32_t format;
bool has_alpha;
uint32_t opaque_equivalent;
uint32_t alpha_equivalent;
std::optional<mg::DRMFormat::RGBComponentInfo> components;
};
namespace
{
constexpr std::array const formats = {
mg::DRMFormat::FormatInfo{
DRM_FORMAT_XRGB4444,
false,
DRM_FORMAT_XRGB4444,
DRM_FORMAT_ARGB4444,
mg::DRMFormat::RGBComponentInfo{
4, 4, 4, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_XBGR4444,
false,
DRM_FORMAT_XBGR4444,
DRM_FORMAT_ABGR4444,
mg::DRMFormat::RGBComponentInfo{
4, 4, 4, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_RGBX4444,
false,
DRM_FORMAT_RGBX4444,
DRM_FORMAT_RGBA4444,
mg::DRMFormat::RGBComponentInfo{
4, 4, 4, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_BGRX4444,
false,
DRM_FORMAT_BGRX4444,
DRM_FORMAT_BGRA4444,
mg::DRMFormat::RGBComponentInfo{
4, 4, 4, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_ARGB4444,
true,
DRM_FORMAT_XRGB4444,
DRM_FORMAT_ARGB4444,
mg::DRMFormat::RGBComponentInfo{
4, 4, 4, 4
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_ABGR4444,
true,
DRM_FORMAT_XBGR4444,
DRM_FORMAT_ABGR4444,
mg::DRMFormat::RGBComponentInfo{
4, 4, 4, 4
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_RGBA4444,
true,
DRM_FORMAT_RGBX4444,
DRM_FORMAT_RGBA4444,
mg::DRMFormat::RGBComponentInfo{
4, 4, 4, 4
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_BGRA4444,
true,
DRM_FORMAT_BGRX4444,
DRM_FORMAT_BGRA4444,
mg::DRMFormat::RGBComponentInfo{
4, 4, 4, 4
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_XRGB1555,
false,
DRM_FORMAT_XRGB1555,
DRM_FORMAT_ARGB1555,
mg::DRMFormat::RGBComponentInfo{
5, 5, 5, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_XBGR1555,
false,
DRM_FORMAT_XBGR1555,
DRM_FORMAT_ABGR1555,
mg::DRMFormat::RGBComponentInfo{
5, 5, 5, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_RGBX5551,
false,
DRM_FORMAT_RGBX5551,
DRM_FORMAT_RGBA5551,
mg::DRMFormat::RGBComponentInfo{
5, 5, 5, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_BGRX5551,
false,
DRM_FORMAT_BGRX5551,
DRM_FORMAT_BGRA5551,
mg::DRMFormat::RGBComponentInfo{
5, 5, 5, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_ARGB1555,
true,
DRM_FORMAT_XRGB1555,
DRM_FORMAT_ARGB1555,
mg::DRMFormat::RGBComponentInfo{
5, 5, 5, 1
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_ABGR1555,
true,
DRM_FORMAT_XBGR1555,
DRM_FORMAT_ABGR1555,
mg::DRMFormat::RGBComponentInfo{
5, 5, 5, 1
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_RGBA5551,
true,
DRM_FORMAT_RGBX5551,
DRM_FORMAT_RGBA5551,
mg::DRMFormat::RGBComponentInfo{
5, 5, 5, 1
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_BGRA5551,
true,
DRM_FORMAT_BGRX5551,
DRM_FORMAT_BGRA5551,
mg::DRMFormat::RGBComponentInfo{
5, 5, 5, 1
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_RGB565,
false,
DRM_FORMAT_RGB565,
DRM_FORMAT_INVALID,
mg::DRMFormat::RGBComponentInfo{
5, 6, 5, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_BGR565,
false,
DRM_FORMAT_BGR565,
DRM_FORMAT_INVALID,
mg::DRMFormat::RGBComponentInfo{
5, 6, 5, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_RGB888,
false,
DRM_FORMAT_RGB888,
DRM_FORMAT_INVALID,
mg::DRMFormat::RGBComponentInfo{
8, 8, 8, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_BGR888,
false,
DRM_FORMAT_BGR888,
DRM_FORMAT_INVALID,
mg::DRMFormat::RGBComponentInfo{
8, 8, 8, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_XRGB8888,
false,
DRM_FORMAT_XRGB8888,
DRM_FORMAT_ARGB8888,
mg::DRMFormat::RGBComponentInfo{
8, 8, 8, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_XBGR8888,
false,
DRM_FORMAT_XBGR8888,
DRM_FORMAT_ABGR8888,
mg::DRMFormat::RGBComponentInfo{
8, 8, 8, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_RGBX8888,
false,
DRM_FORMAT_RGBX8888,
DRM_FORMAT_RGBA8888,
mg::DRMFormat::RGBComponentInfo{
8, 8, 8, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_BGRX8888,
false,
DRM_FORMAT_BGRX8888,
DRM_FORMAT_BGRA8888,
mg::DRMFormat::RGBComponentInfo{
8, 8, 8, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_ARGB8888,
true,
DRM_FORMAT_XRGB8888,
DRM_FORMAT_ARGB8888,
mg::DRMFormat::RGBComponentInfo{
8, 8, 8, 8
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_ABGR8888,
true,
DRM_FORMAT_XBGR8888,
DRM_FORMAT_ABGR8888,
mg::DRMFormat::RGBComponentInfo{
8, 8, 8, 8
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_RGBA8888,
true,
DRM_FORMAT_RGBX8888,
DRM_FORMAT_RGBA8888,
mg::DRMFormat::RGBComponentInfo{
8, 8, 8, 8
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_BGRA8888,
true,
DRM_FORMAT_BGRX8888,
DRM_FORMAT_BGRA8888,
mg::DRMFormat::RGBComponentInfo{
8, 8, 8, 8
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_XRGB2101010,
false,
DRM_FORMAT_XRGB2101010,
DRM_FORMAT_ARGB2101010,
mg::DRMFormat::RGBComponentInfo{
10, 10, 10, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_XBGR2101010,
false,
DRM_FORMAT_XBGR2101010,
DRM_FORMAT_ABGR2101010,
mg::DRMFormat::RGBComponentInfo{
10, 10, 10, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_RGBX1010102,
false,
DRM_FORMAT_RGBX1010102,
DRM_FORMAT_RGBA1010102,
mg::DRMFormat::RGBComponentInfo{
10, 10, 10, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_BGRX1010102,
false,
DRM_FORMAT_BGRX1010102,
DRM_FORMAT_BGRA1010102,
mg::DRMFormat::RGBComponentInfo{
10, 10, 10, {}
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_ARGB2101010,
true,
DRM_FORMAT_XRGB2101010,
DRM_FORMAT_ARGB2101010,
mg::DRMFormat::RGBComponentInfo{
10, 10, 10, 2
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_ABGR2101010,
true,
DRM_FORMAT_XBGR2101010,
DRM_FORMAT_ABGR2101010,
mg::DRMFormat::RGBComponentInfo{
10, 10, 10, 2
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_RGBA1010102,
true,
DRM_FORMAT_RGBX1010102,
DRM_FORMAT_RGBA1010102,
mg::DRMFormat::RGBComponentInfo{
10, 10, 10, 2
},
},
mg::DRMFormat::FormatInfo{
DRM_FORMAT_BGRA1010102,
true,
DRM_FORMAT_BGRX1010102,
DRM_FORMAT_BGRA1010102,
mg::DRMFormat::RGBComponentInfo{
10, 10, 10, 2
},
},
};
constexpr auto find_format_info(uint32_t fourcc) -> mg::DRMFormat::FormatInfo const*
{
for (auto const& format: formats)
{
if (format.format == fourcc)
return &format;
}
/* The format array doesn't cover all DRM_FORMAT_*, only the ones relevant to Mir
* (and not all of them, yet: eg YUV formats), so we must have a sentinel value
* for the missing ones
*/
return nullptr;
}
/* Generate a bunch of variables named format_info_DRM_FORMAT_FOO pointing to associated FormatInfo */
#define STRINGIFY(format) \
constexpr mg::DRMFormat::FormatInfo const* format_info_##format = find_format_info(format);
#include "drm-formats"
#undef STRINGIFY
constexpr auto maybe_info_for_format(uint32_t fourcc_format) -> mg::DRMFormat::FormatInfo const*
{
switch (fourcc_format)
{
#define STRINGIFY(format) \
case format: \
return format_info_##format; \
#include "drm-formats"
#undef STRINGIFY
default:
BOOST_THROW_EXCEPTION((
std::runtime_error{
std::string{"Unknown DRM format "} + std::to_string(fourcc_format) +
" (may need to rebuild Mir against newer DRM headers?)"}));
}
}
constexpr auto info_for_format(uint32_t fourcc_format) -> mg::DRMFormat::FormatInfo const&
{
auto const info = maybe_info_for_format(fourcc_format);
if (info)
{
return *info;
}
BOOST_THROW_EXCEPTION((
std::runtime_error{
std::string{"Unsupported DRM format: "} + mg::drm_format_to_string(fourcc_format)}));
}
}
mg::DRMFormat::DRMFormat(uint32_t fourcc_format)
: info{&info_for_format(fourcc_format)}
{
}
auto mg::DRMFormat::name() const -> const char*
{
return drm_format_to_string(info->format);
}
auto mg::DRMFormat::opaque_equivalent() const -> const std::optional<DRMFormat>
{
if (info->opaque_equivalent != DRM_FORMAT_INVALID)
{
return DRMFormat{info->opaque_equivalent};
}
return {};
}
auto mg::DRMFormat::alpha_equivalent() const -> const std::optional<DRMFormat>
{
if (info->alpha_equivalent != DRM_FORMAT_INVALID)
{
return DRMFormat{info->alpha_equivalent};
}
return {};
}
bool mg::DRMFormat::has_alpha() const
{
return info->has_alpha;
}
auto mg::DRMFormat::components() const -> std::optional<RGBComponentInfo> const&
{
return info->components;
}
mg::DRMFormat::operator uint32_t() const
{
return info->format;
}
auto mg::DRMFormat::as_mir_format() const -> std::optional<MirPixelFormat>
{
switch (info->format)
{
case DRM_FORMAT_ARGB8888:
return mir_pixel_format_argb_8888;
case DRM_FORMAT_XRGB8888:
return mir_pixel_format_xrgb_8888;
case DRM_FORMAT_RGBA4444:
return mir_pixel_format_rgba_4444;
case DRM_FORMAT_RGBA5551:
return mir_pixel_format_rgba_5551;
case DRM_FORMAT_RGB565:
return mir_pixel_format_rgb_565;
case DRM_FORMAT_RGB888:
return mir_pixel_format_rgb_888;
case DRM_FORMAT_BGR888:
return mir_pixel_format_bgr_888;
case DRM_FORMAT_XBGR8888:
return mir_pixel_format_xbgr_8888;
case DRM_FORMAT_ABGR8888:
return mir_pixel_format_abgr_8888;
default:
return std::nullopt;
}
}
auto mg::DRMFormat::from_mir_format(MirPixelFormat format)
-> DRMFormat
{
switch (format)
{
case mir_pixel_format_argb_8888:
return DRMFormat{DRM_FORMAT_ARGB8888};
case mir_pixel_format_xrgb_8888:
return DRMFormat{DRM_FORMAT_XRGB8888};
case mir_pixel_format_abgr_8888:
return DRMFormat{DRM_FORMAT_ABGR8888};
case mir_pixel_format_xbgr_8888:
return DRMFormat{DRM_FORMAT_XBGR8888};
case mir_pixel_format_bgr_888:
return DRMFormat{DRM_FORMAT_BGR888};
case mir_pixel_format_rgb_888:
return DRMFormat{DRM_FORMAT_RGB888};
case mir_pixel_format_rgb_565:
return DRMFormat{DRM_FORMAT_RGB565};
case mir_pixel_format_rgba_5551:
return DRMFormat{DRM_FORMAT_RGBA5551};
case mir_pixel_format_rgba_4444:
return DRMFormat{DRM_FORMAT_RGBA4444};
case mir_pixel_format_invalid:
/* We *could* do something with DRM_FORMAT_INVALID here, but
* let's not. Let's maintain that DRMFormat is always valid
*/
BOOST_THROW_EXCEPTION((std::runtime_error{"Attempt to look up DRM format info of invalid pixel format"}));
case mir_pixel_formats:
BOOST_THROW_EXCEPTION((std::logic_error{"Attempt to look up format info of sentinel pixel format"}));
#ifndef __clang__
/* Clang accepts that the above cases are exhaustive, gcc does not
* Have a default clause here to pacify gcc, but omit it for clang
* so that we fail to build if the above is *not* exhaustive.
*/
default:
BOOST_THROW_EXCEPTION((std::logic_error{"Exhaustive switch needs updating"}));
#endif
}
}
auto mg::drm_modifier_to_string(uint64_t modifier) -> std::string
{
#ifdef MIR_HAVE_DRM_GET_MODIFIER_NAME
struct CStrDeleter
{
public:
void operator()(char* c_str)
{
if (c_str)
{
free (c_str);
}
}
};
auto const vendor =
[&]() -> std::string
{
std::unique_ptr<char[], CStrDeleter> vendor{drmGetFormatModifierVendor(modifier)};
if (vendor)
{
return vendor.get();
}
return "(UNKNOWN VENDOR)";
}();
auto const name =
[&]() -> std::string
{
std::unique_ptr<char[], CStrDeleter> name{drmGetFormatModifierName(modifier)};
if (name)
{
return name.get();
}
return "(UNKNOWN MODIFIER)";
}();
return vendor + ":" + name;
}
#else
#define STRINGIFY(val) \
case val: \
return #val;
switch (modifier)
{
#ifdef DRM_FORMAT_MOD_INVALID
STRINGIFY(DRM_FORMAT_MOD_INVALID)
#endif
#ifdef DRM_FORMAT_MOD_LINEAR
STRINGIFY(DRM_FORMAT_MOD_LINEAR)
#endif
#ifdef I915_FORMAT_MOD_X_TILED
STRINGIFY(I915_FORMAT_MOD_X_TILED)
#endif
#ifdef I915_FORMAT_MOD_Y_TILED
STRINGIFY(I915_FORMAT_MOD_Y_TILED)
#endif
#ifdef I915_FORMAT_MOD_Yf_TILED
STRINGIFY(I915_FORMAT_MOD_Yf_TILED)
#endif
#ifdef I915_FORMAT_MOD_Y_TILED_CCS
STRINGIFY(I915_FORMAT_MOD_Y_TILED_CCS)
#endif
#ifdef I915_FORMAT_MOD_Yf_TILED_CCS
STRINGIFY(I915_FORMAT_MOD_Yf_TILED_CCS)
#endif
#ifdef I915_FORMAT_MOD_Y_TILED_GEN12_RC_CCS
STRINGIFY(I915_FORMAT_MOD_Y_TILED_GEN12_RC_CCS)
#endif
#ifdef I915_FORMAT_MOD_Y_TILED_GEN12_MC_CCS
STRINGIFY(I915_FORMAT_MOD_Y_TILED_GEN12_MC_CCS)
#endif
#ifdef DRM_FORMAT_MOD_SAMSUNG_64_32_TILE
STRINGIFY(DRM_FORMAT_MOD_SAMSUNG_64_32_TILE)
#endif
#ifdef DRM_FORMAT_MOD_SAMSUNG_16_16_TILE
STRINGIFY(DRM_FORMAT_MOD_SAMSUNG_16_16_TILE)
#endif
#ifdef DRM_FORMAT_MOD_QCOM_COMPRESSED
STRINGIFY(DRM_FORMAT_MOD_QCOM_COMPRESSED)
#endif
#ifdef DRM_FORMAT_MOD_VIVANTE_TILED
STRINGIFY(DRM_FORMAT_MOD_VIVANTE_TILED)
#endif
#ifdef DRM_FORMAT_MOD_VIVANTE_SUPER_TILED
STRINGIFY(DRM_FORMAT_MOD_VIVANTE_SUPER_TILED)
#endif
#ifdef DRM_FORMAT_MOD_VIVANTE_SPLIT_TILED
STRINGIFY(DRM_FORMAT_MOD_VIVANTE_SPLIT_TILED)
#endif
#ifdef DRM_FORMAT_MOD_VIVANTE_SPLIT_SUPER_TILED
STRINGIFY(DRM_FORMAT_MOD_VIVANTE_SPLIT_SUPER_TILED)
#endif
#ifdef DRM_FORMAT_MOD_NVIDIA_TEGRA_TILED
STRINGIFY(DRM_FORMAT_MOD_NVIDIA_TEGRA_TILED)
#endif
#ifdef DRM_FORMAT_MOD_NVIDIA_16BX2_BLOCK_ONE_GOB
STRINGIFY(DRM_FORMAT_MOD_NVIDIA_16BX2_BLOCK_ONE_GOB)
#endif
#ifdef DRM_FORMAT_MOD_NVIDIA_16BX2_BLOCK_TWO_GOB
STRINGIFY(DRM_FORMAT_MOD_NVIDIA_16BX2_BLOCK_TWO_GOB)
#endif
#ifdef DRM_FORMAT_MOD_NVIDIA_16BX2_BLOCK_FOUR_GOB
STRINGIFY(DRM_FORMAT_MOD_NVIDIA_16BX2_BLOCK_FOUR_GOB)
#endif
#ifdef DRM_FORMAT_MOD_NVIDIA_16BX2_BLOCK_EIGHT_GOB
STRINGIFY(DRM_FORMAT_MOD_NVIDIA_16BX2_BLOCK_EIGHT_GOB)
#endif
#ifdef DRM_FORMAT_MOD_NVIDIA_16BX2_BLOCK_SIXTEEN_GOB
STRINGIFY(DRM_FORMAT_MOD_NVIDIA_16BX2_BLOCK_SIXTEEN_GOB)
#endif
#ifdef DRM_FORMAT_MOD_NVIDIA_16BX2_BLOCK_THIRTYTWO_GOB
STRINGIFY(DRM_FORMAT_MOD_NVIDIA_16BX2_BLOCK_THIRTYTWO_GOB)
#endif
#ifdef DRM_FORMAT_MOD_BROADCOM_VC4_T_TILED
STRINGIFY(DRM_FORMAT_MOD_BROADCOM_VC4_T_TILED)
#endif
#ifdef DRM_FORMAT_MOD_BROADCOM_SAND32
STRINGIFY(DRM_FORMAT_MOD_BROADCOM_SAND32)
#endif
#ifdef DRM_FORMAT_MOD_BROADCOM_SAND64
STRINGIFY(DRM_FORMAT_MOD_BROADCOM_SAND64)
#endif
#ifdef DRM_FORMAT_MOD_BROADCOM_SAND128
STRINGIFY(DRM_FORMAT_MOD_BROADCOM_SAND128)
#endif
#ifdef DRM_FORMAT_MOD_BROADCOM_SAND256
STRINGIFY(DRM_FORMAT_MOD_BROADCOM_SAND256)
#endif
#ifdef DRM_FORMAT_MOD_BROADCOM_UIF
STRINGIFY(DRM_FORMAT_MOD_BROADCOM_UIF)
#endif
#ifdef DRM_FORMAT_MOD_ARM_16X16_BLOCK_U_INTERLEAVED
STRINGIFY(DRM_FORMAT_MOD_ARM_16X16_BLOCK_U_INTERLEAVED)
#endif
#ifdef DRM_FORMAT_MOD_ALLWINNER_TILED
STRINGIFY(DRM_FORMAT_MOD_ALLWINNER_TILED)
#endif
default:
return "(unknown)";
}
#undef STRINGIFY
}
#endif
[-- Attachment #1.3: publickey - pillowtrucker@proton.me - 0x40BB2176.asc --]
[-- Type: application/pgp-keys, Size: 657 bytes --]
[-- Attachment #2: OpenPGP digital signature --]
[-- Type: application/pgp-signature, Size: 249 bytes --]
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory
2024-04-19 20:49 ` pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
@ 2024-04-20 9:22 ` Alan Mackenzie
2024-04-20 13:14 ` Robert Weiner
0 siblings, 1 reply; 15+ messages in thread
From: Alan Mackenzie @ 2024-04-20 9:22 UTC (permalink / raw)
To: pillowtrucker; +Cc: acm, Eli Zaretskii, Bob Weiner, 70423
Hello, M.
On Fri, Apr 19, 2024 at 20:49:20 +0000, pillowtrucker@proton.me wrote:
> Hello again, Alan!
> I've been using a git revision of hyperbole with the regex removed
> while Bob works on the new regex. I've hit a few other small glitches
> while using it, but nothing anywhere as major as the main issue at
> hand, and they're most definitely unrelated.
That's good to know, thanks. So it seems that the C++ value of
defun-prompt-regexp is indeed the cause of the immediate problem.
What should have occurred to me immediately is that in
c-beginning-of-defun-1, I should bind defun-prompt-regexp to nil. That
macro is intended to move to the beginning of the defun in the most
vanilla fashion possible, and for this it binds
beginning-of-defun-function, etc., to nil. It needs to do the same to
defun-prompt-regexp. This will likely speed it up, too.
> I also had a look in the other bug report and it seemed like there was
> also some kind of patch on the cc-mode side in emacs 30/trunk ? Or did
> I misunderstand that conversation ? I could try running an emacs git
> build if that's the case, although I'm not sure how many of my other
> packages will remain compatible, so it's not really a priority.
We're talking about bug#61436: Emacs Freezing With Java Files, I think.
There hasn't been any patch to CC Mode for this, though I think there
probably should be. The CC Mode position is that
java-defun-prompt-regexp is unsupported and unmaintained; it is not used
at all in CC Mode. But it is there for the convenience of other modes
(such as hyperbole) that want to copy it and use it at their own risk,
and also as an illustration of the limits of regular expressions. The
recommendation is to use "other methods" of finding starts of defuns.
> My init.el script is really innocent, although I've later asked some
> friends and they agree that they would also probably never run
> something like that.
Yes, I see that now. But I still don't really want to install these
packages into my Emacs, and I'm too lazy to set up an alternative
init.el. ;-)
> I just thought it would be a fun challenge to do everything to
> reproduce the issue in one init script. The base64-encoded string is
> just a gzipped copy of the .cpp file with which I could reproduce the
> issue. You should get the same string by running "gzip --stdout
> drm_formats.cpp|base64" on the attached .cpp file. (However, I don't
> know if all gzip versions produce the same output given the same input,
> and it will make me look even more suspicious if the strings don't
> match.)
Yes, I got the C++ file without too much trouble, thanks. I was
expecting it to be "extreme", triggering the problems in C++ Mode, but it
was just a perfectly normal C++ file. It was on noticing hyperbole mode
that I thought about bug#61436.
> Regardless, I've been productively working on other C++ code with the
> regexp turned off and it's been a great relief not to have to struggle
> with having to restart my workspace/desktop so often.
Yes, I can understand that. As I said, I'll fix c-beginning-of-defun-1
so that that can't possibly happen again, regardless of what happens to
these regexps.
> Thank you for both of yours work! And good luck with the new regexp!
> If you put it in some git tag/branch that I can pull easily, I could
> maybe assist with testing it ? Let me know if that's an option.
That's more up to Bob that me.
Alternatively, I could send you a copy of the new C++ regexp which you
could edit into the pertinent hyperbole source file.
> Kind regards,
> M
[ .... ]
--
Alan Mackenzie (Nuremberg, Germany).
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory
2024-04-20 9:22 ` Alan Mackenzie
@ 2024-04-20 13:14 ` Robert Weiner
2024-04-20 15:52 ` Robert Weiner
0 siblings, 1 reply; 15+ messages in thread
From: Robert Weiner @ 2024-04-20 13:14 UTC (permalink / raw)
To: Alan Mackenzie; +Cc: pillowtrucker, Eli Zaretskii, 70423
> On Apr 20, 2024, at 5:22 AM, Alan Mackenzie <acm@muc.de> wrote:
>
> Hello, M.
>
> Yes, I can understand that. As I said, I'll fix c-beginning-of-defun-1
> so that that can't possibly happen again, regardless of what happens to
> these regexps.
I think this is the crux of the fix needed, not a change in Hyperbole regexps. Alan, Hyperbole had your new defun regexp for Java and Emacs still would hang until we applied your recent fix to cc-defs.el. With that in place and no change to the c++ defun regex in Hyperbole, I have not been able to trigger a hang. So let’s just add your additional fix described above, skip the c++ defun rewrite and see if any other issues appear.
Cheers,
Bob
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory
2024-04-20 13:14 ` Robert Weiner
@ 2024-04-20 15:52 ` Robert Weiner
2024-05-02 8:40 ` Eli Zaretskii
0 siblings, 1 reply; 15+ messages in thread
From: Robert Weiner @ 2024-04-20 15:52 UTC (permalink / raw)
To: Alan Mackenzie; +Cc: pillowtrucker, Eli Zaretskii, 70423
[-- Attachment #1: Type: text/plain, Size: 1585 bytes --]
Hi all:
I have now read through the recent messages more carefully, duplicated the
hang in c++-mode using pillowtrucker's init.el and his drm_formats.cpp file
simply by invoking M->. I then added both Alan's cc-defs.el fix and his
new c++-defun-prompt-regexp and that resolved the hang. If I add the new
c++ regexp without the cc-defs.el fix, that also seems to solve the hang.
So I retract my prior message and acknowledge one source of the problem has
been the existing Hyperbole regexps. We'll update Hyperbole to use Allen's
new regexps and hopefully this will close this issue after pillowtrucker
does some testing. (I think Allen's other fixes should be applied to and
that they will help performance).
Regards,
Bob
On Sat, Apr 20, 2024 at 9:14 AM Robert Weiner <rswgnu@gmail.com> wrote:
>
> > On Apr 20, 2024, at 5:22 AM, Alan Mackenzie <acm@muc.de> wrote:
> >
> > Hello, M.
> >
> > Yes, I can understand that. As I said, I'll fix c-beginning-of-defun-1
> > so that that can't possibly happen again, regardless of what happens to
> > these regexps.
>
> I think this is the crux of the fix needed, not a change in Hyperbole
> regexps. Alan, Hyperbole had your new defun regexp for Java and Emacs
> still would hang until we applied your recent fix to cc-defs.el. With that
> in place and no change to the c++ defun regex in Hyperbole, I have not been
> able to trigger a hang. So let’s just add your additional fix described
> above, skip the c++ defun rewrite and see if any other issues appear.
>
> Cheers,
>
> Bob
[-- Attachment #2: Type: text/html, Size: 2565 bytes --]
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory
2024-04-20 15:52 ` Robert Weiner
@ 2024-05-02 8:40 ` Eli Zaretskii
2024-05-02 22:01 ` Robert Weiner
0 siblings, 1 reply; 15+ messages in thread
From: Eli Zaretskii @ 2024-05-02 8:40 UTC (permalink / raw)
To: rswgnu; +Cc: acm, pillowtrucker, 70423
> From: Robert Weiner <rsw@gnu.org>
> Date: Sat, 20 Apr 2024 11:52:49 -0400
> Cc: pillowtrucker@proton.me, 70423@debbugs.gnu.org,
> Eli Zaretskii <eliz@gnu.org>
>
> I have now read through the recent messages more carefully, duplicated the hang in c++-mode using
> pillowtrucker's init.el and his drm_formats.cpp file simply by invoking M->. I then added both Alan's cc-defs.el
> fix and his new c++-defun-prompt-regexp and that resolved the hang. If I add the new c++ regexp without the
> cc-defs.el fix, that also seems to solve the hang. So I retract my prior message and acknowledge one source
> of the problem has been the existing Hyperbole regexps. We'll update Hyperbole to use Allen's new regexps
> and hopefully this will close this issue after pillowtrucker does some testing. (I think Allen's other fixes should
> be applied to and that they will help performance).
Thanks.
Should this bug be closed, then? I believe you are saying that the
left-overs, such as they are, are not in Emacs?
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory
2024-05-02 8:40 ` Eli Zaretskii
@ 2024-05-02 22:01 ` Robert Weiner
2024-05-03 5:54 ` Eli Zaretskii
0 siblings, 1 reply; 15+ messages in thread
From: Robert Weiner @ 2024-05-02 22:01 UTC (permalink / raw)
To: Eli Zaretskii; +Cc: acm, pillowtrucker, 70423
Yes, this has been fixed. Please close it.
-- Bob
> On May 2, 2024, at 3:40 AM, Eli Zaretskii <eliz@gnu.org> wrote:
>
>
>>
>> From: Robert Weiner <rsw@gnu.org>
>> Date: Sat, 20 Apr 2024 11:52:49 -0400
>> Cc: pillowtrucker@proton.me, 70423@debbugs.gnu.org,
>> Eli Zaretskii <eliz@gnu.org>
>>
>> I have now read through the recent messages more carefully, duplicated the hang in c++-mode using
>> pillowtrucker's init.el and his drm_formats.cpp file simply by invoking M->. I then added both Alan's cc-defs.el
>> fix and his new c++-defun-prompt-regexp and that resolved the hang. If I add the new c++ regexp without the
>> cc-defs.el fix, that also seems to solve the hang. So I retract my prior message and acknowledge one source
>> of the problem has been the existing Hyperbole regexps. We'll update Hyperbole to use Allen's new regexps
>> and hopefully this will close this issue after pillowtrucker does some testing. (I think Allen's other fixes should
>> be applied to and that they will help performance).
>
> Thanks.
>
> Should this bug be closed, then? I believe you are saying that the
> left-overs, such as they are, are not in Emacs?
^ permalink raw reply [flat|nested] 15+ messages in thread
* bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory
2024-05-02 22:01 ` Robert Weiner
@ 2024-05-03 5:54 ` Eli Zaretskii
0 siblings, 0 replies; 15+ messages in thread
From: Eli Zaretskii @ 2024-05-03 5:54 UTC (permalink / raw)
To: Robert Weiner; +Cc: acm, pillowtrucker, 70423-done
> From: Robert Weiner <rswgnu@gmail.com>
> Date: Thu, 2 May 2024 17:01:34 -0500
> Cc: acm@muc.de, pillowtrucker@proton.me, 70423@debbugs.gnu.org
>
> Yes, this has been fixed. Please close it.
Thanks, done.
^ permalink raw reply [flat|nested] 15+ messages in thread
end of thread, other threads:[~2024-05-03 5:54 UTC | newest]
Thread overview: 15+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2024-04-16 13:36 bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory 1stmil.eth via Bug reports for GNU Emacs, the Swiss army knife of text editors
2024-04-16 15:52 ` bug#70423: Possible workaround/culprit pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
2024-04-16 18:31 ` Dmitry Gutov
2024-04-16 16:22 ` bug#70423: 29.3; cc-mode hang at 100% cpu and consuming all available memory Eli Zaretskii
2024-04-16 17:05 ` Alan Mackenzie
2024-04-16 17:59 ` Alan Mackenzie
2024-04-16 19:51 ` pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
2024-04-18 18:39 ` Alan Mackenzie
2024-04-19 20:49 ` pillowtrucker--- via Bug reports for GNU Emacs, the Swiss army knife of text editors
2024-04-20 9:22 ` Alan Mackenzie
2024-04-20 13:14 ` Robert Weiner
2024-04-20 15:52 ` Robert Weiner
2024-05-02 8:40 ` Eli Zaretskii
2024-05-02 22:01 ` Robert Weiner
2024-05-03 5:54 ` Eli Zaretskii
Code repositories for project(s) associated with this public inbox
https://git.savannah.gnu.org/cgit/emacs.git
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).