We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a344101 commit 2638652Copy full SHA for 2638652
src/malloc.md
@@ -189,7 +189,7 @@ t_block extend_heap(t_block last, size_t s) {
189
</pre>
190
<h3 id="324-分裂block">3.2.4 分裂block</h3>
191
<p>First fit有一个比较致命的缺点,就是可能会让很小的size占据很大的一块block,此时,为了提高payload,应该在剩余数据区足够大的情况下,将其分裂为一个新的block,示意如下:</p>
192
-<p><img src="http://blog-codinglabs-org.qiniudn.com/image/a-malloc-tutorial-07.png" alt="分裂block"></p>
+<p><img src="http://blog-codinglabs-org.qiniudn.com/image/a--tutorial-07.png" alt="分裂block"></p>
193
<p>实现代码:</p>
194
<pre class="prettyprint linenums lang-c">void split_block(t_block b, size_t s) {
195
t_block new;
0 commit comments