<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title>静态分析 - 标签 - 研发日志 · R&amp;D Log</title><link>https://rd163.visword.com/tags/%E9%9D%99%E6%80%81%E5%88%86%E6%9E%90/</link><description>静态分析 - 标签 - 研发日志 · R&amp;D Log</description><generator>Hugo -- gohugo.io</generator><language>zh-CN</language><managingEditor>whutluohui@gmail.com (小智晖)</managingEditor><webMaster>whutluohui@gmail.com (小智晖)</webMaster><copyright>本作品采用知识共享署名-非商业性使用 4.0 国际许可协议进行许可。</copyright><lastBuildDate>Sun, 12 Jan 2025 00:00:00 +0800</lastBuildDate><atom:link href="https://rd163.visword.com/tags/%E9%9D%99%E6%80%81%E5%88%86%E6%9E%90/" rel="self" type="application/rss+xml"/><item><title>函数调用关系绘制</title><link>https://rd163.visword.com/posts/function-call-drawing/</link><pubDate>Sun, 12 Jan 2025 00:00:00 +0800</pubDate><author><name>小智晖</name></author><guid>https://rd163.visword.com/posts/function-call-drawing/</guid><description><![CDATA[<h2 id="简介" class="headerLink">
    <a href="#%e7%ae%80%e4%bb%8b" class="header-mark"></a>简介</h2><p><a href="https://www.gnu.org/software/cflow/" target="_blank" rel="noopener noreferrer">cflow</a> 是 GNU 项目维护的一款 C 语言静态分析（static analysis）工具，能够扫描源码并生成函数之间的调用关系图（call graph）。它不需要运行程序，仅依赖源代码本身，因此非常适合用于梳理陌生代码库、排查遗留项目或为代码写文档。</p>]]></description></item><item><title>详解圈复杂度</title><link>https://rd163.visword.com/posts/code-cyclomatic-complexity/</link><pubDate>Sun, 12 Jan 2025 00:00:00 +0800</pubDate><author><name>小智晖</name></author><guid>https://rd163.visword.com/posts/code-cyclomatic-complexity/</guid><description><![CDATA[<h2 id="什么是圈复杂度" class="headerLink">
    <a href="#%e4%bb%80%e4%b9%88%e6%98%af%e5%9c%88%e5%a4%8d%e6%9d%82%e5%ba%a6" class="header-mark"></a>什么是圈复杂度?</h2><p>圈复杂度（Cyclomatic Complexity）是一种代码复杂度的衡量标准，由 Thomas J. McCabe, Sr. 于 1976 年在论文 <em>A Complexity Measure</em>(IEEE Transactions on Software Engineering, SE-2(4): 308-320)中提出，目的是指导程序员写出更具可测性和可维护性的代码。</p>]]></description></item></channel></rss>