<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
        <title>Programming on Rebel Zhang&#39;s Blog</title>
        <link>https://rebel1725.codeberg.page/blog/en/tags/programming/</link>
        <description>Recent content in Programming on Rebel Zhang&#39;s Blog</description>
        <generator>Hugo -- gohugo.io</generator>
        <language>en-GB</language>
        <managingEditor>rebel1725@tilde.club (Rebel Zhang)</managingEditor>
        <webMaster>rebel1725@tilde.club (Rebel Zhang)</webMaster>
        <lastBuildDate>Wed, 11 Nov 2026 18:02:19 +0800</lastBuildDate><atom:link href="https://rebel1725.codeberg.page/blog/en/tags/programming/index.xml" rel="self" type="application/rss+xml" /><item>
            <title>From Knowing C Syntax to Becoming a Real C Programmer</title>
            <link>https://rebel1725.codeberg.page/blog/en/post/from-knowing-c-syntax-to-becoming-a-real-c-programmer/</link>
            <pubDate>Wed, 11 Nov 2026 18:02:19 +0800</pubDate><author>rebel1725@tilde.club (Rebel Zhang)</author>
            <guid>https://rebel1725.codeberg.page/blog/en/post/from-knowing-c-syntax-to-becoming-a-real-c-programmer/</guid>
            <description>&lt;p&gt;C is a really easy-to-learn programming language. Variables, functions, control-flow statements, structures, pointers, and that&amp;rsquo;s about it. Most importantly, C gives you control: when you write code in C, you are the god.&lt;/p&gt;&#xA;&lt;p&gt;However, with great power comes great responsibility. You can make everything work perfectly and efficiently, but you can also mess everything up by introducing stack overflows, dangling pointers, use-after-free errors, null-pointer dereferences, double-free errors, memory leaks, out-of-bounds memory accesses, and so on into your programme.&lt;/p&gt;&#xA;&lt;p&gt;Furthermore, C is a powerful language that gives you control. However, this also means that C offers much less abstraction than C++, Python, and other languages, and you are responsible for implementing much of the logic needed to get things done. Therefore, &lt;strong&gt;there is a huge gap between knowing C syntax and becoming a real C programmer.&lt;/strong&gt;&lt;/p&gt;&#xA;&lt;p&gt;I learnt C in 2024/2025, but without putting my knowledge into practice by writing real, production-ready programmes, I moved on to learning C++. I then started writing applications in C++ and Qt, which I found comfortable. However, in recent days, I have been hitting roadblocks while trying to implement a CanoKey companion application with &lt;code&gt;libcanokey&lt;/code&gt;. Its initial purpose was to practise C++ + Qt + Kirigami programming, but I have realised that I still have a lot to learn to move from &amp;lsquo;knowing C&amp;rsquo; to &amp;lsquo;knowing how to develop useful programmes in C&amp;rsquo;.&lt;/p&gt;&#xA;&lt;p&gt;This article lists some simple examples, and I hope it helps other people who have just learnt C syntax but do not yet know how to write useful programmes in C.&lt;/p&gt;&#xA;&lt;h2 id=&#34;object-oriented-programming-in-c&#34;&gt;Object-oriented programming in C&#xA;&lt;/h2&gt;&lt;p&gt;C does not natively support OOP. One of its main built-in aggregate types for grouping values is called a &lt;em&gt;structure&lt;/em&gt;. It combines several members of C&amp;rsquo;s built-in types or other structure types into a single type, with possible padding between members. However, many projects and libraries from the free software community that are written in C use a manually implemented, pseudo-OOP design. They do not extend C syntax; they simply use structures to achieve what they want.&lt;/p&gt;&#xA;&lt;h3 id=&#34;the-basic-idea&#34;&gt;The basic idea&#xA;&lt;/h3&gt;&lt;p&gt;Define a structure:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;typedef&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;struct&lt;/span&gt; Counter&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; a;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;} Counter;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;And define some functions:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;Counter &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;&lt;span style=&#34;color:#a6e22e&#34;&gt;counter_create&lt;/span&gt;()&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    Counter &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;ans &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;malloc&lt;/span&gt;(&lt;span style=&#34;color:#66d9ef&#34;&gt;sizeof&lt;/span&gt; &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;ans);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;if&lt;/span&gt; (&lt;span style=&#34;color:#f92672&#34;&gt;!&lt;/span&gt; ans) &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; NULL;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    ans&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;a &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt;;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; ans;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;void&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;counter_increase&lt;/span&gt;(Counter &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;self)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    self&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;a&lt;span style=&#34;color:#f92672&#34;&gt;++&lt;/span&gt;;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;counter_get_value&lt;/span&gt;(Counter &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;self)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; self&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;a;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;Congratulations! You have implemented a class and its methods in C.&lt;/p&gt;&#xA;&lt;p&gt;A C++ class that does the same thing would look like this:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-cpp&#34; data-lang=&#34;cpp&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;class&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;Counter&lt;/span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;public&lt;/span&gt;&lt;span style=&#34;color:#f92672&#34;&gt;:&lt;/span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    Counter()&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#f92672&#34;&gt;:&lt;/span&gt; a(&lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt;) {}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;void&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;increase&lt;/span&gt;()&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    {&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        &lt;span style=&#34;color:#66d9ef&#34;&gt;this&lt;/span&gt;&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;a&lt;span style=&#34;color:#f92672&#34;&gt;++&lt;/span&gt;;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    }&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;get_value&lt;/span&gt;() &lt;span style=&#34;color:#66d9ef&#34;&gt;const&lt;/span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    {&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;this&lt;/span&gt;&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;a;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    }&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;private&lt;/span&gt;&lt;span style=&#34;color:#f92672&#34;&gt;:&lt;/span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; a;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;The core idea is to &lt;strong&gt;use structures as objects and functions as methods&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h3 id=&#34;encapsulation&#34;&gt;Encapsulation&#xA;&lt;/h3&gt;&lt;p&gt;We usually treat the structures we define as objects and operate on them using a set of functions. However, directly modifying the members of these structures is still possible, which can produce unexpected behaviour.&lt;/p&gt;&#xA;&lt;p&gt;C does not provide a mechanism for preventing a structure from being modified directly while still allowing it to be modified through a given set of functions. However, there is a trick that can help us achieve our goal.&lt;/p&gt;&#xA;&lt;p&gt;Put the declarations of our structure and functions inside a header file, &lt;code&gt;counter.h&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;#ifndef COUNTER_H&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;#define COUNTER_H&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;typedef&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;struct&lt;/span&gt; Counter Counter;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;Counter &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;&lt;span style=&#34;color:#a6e22e&#34;&gt;counter_create&lt;/span&gt;();&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;void&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;counter_increase&lt;/span&gt;(Counter &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;self);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;counter_get_value&lt;/span&gt;(Counter &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;self);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;#endif&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;And put the implementations inside &lt;code&gt;counter.c&lt;/code&gt;:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;#include&lt;/span&gt; &lt;span style=&#34;color:#75715e&#34;&gt;&amp;#34;counter.h&amp;#34;&lt;/span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;struct&lt;/span&gt; Counter&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; a;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;};&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;Counter &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;&lt;span style=&#34;color:#a6e22e&#34;&gt;counter_create&lt;/span&gt;()&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    Counter &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;ans &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;malloc&lt;/span&gt;(&lt;span style=&#34;color:#66d9ef&#34;&gt;sizeof&lt;/span&gt; &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;ans);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;if&lt;/span&gt; (&lt;span style=&#34;color:#f92672&#34;&gt;!&lt;/span&gt; ans) &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; NULL;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    ans&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;a &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt;;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; ans;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;void&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;counter_increase&lt;/span&gt;(Counter &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;self)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    self&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;a&lt;span style=&#34;color:#f92672&#34;&gt;++&lt;/span&gt;;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;counter_get_value&lt;/span&gt;(Counter &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;self)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; self&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;a;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;In any source file that needs to use &lt;code&gt;Counter&lt;/code&gt;, simply write:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;#include&lt;/span&gt; &lt;span style=&#34;color:#75715e&#34;&gt;&amp;#34;counter.h&amp;#34;&lt;/span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;Now, your source file knows that there is a structure called &lt;code&gt;Counter&lt;/code&gt; and that there are some functions that can operate on it. However, the source file does not know which members the structure contains or what the functions do. Therefore, it cannot directly modify the structure unless it forcibly casts the pointer to some known type.&lt;/p&gt;&#xA;&lt;h3 id=&#34;inheritance&#34;&gt;Inheritance&#xA;&lt;/h3&gt;&lt;p&gt;Define another structure:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;typedef&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;struct&lt;/span&gt; CounterPlusPlus&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    Counter pref;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; step;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;} CounterPlusPlus;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;And define a method:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;void&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;counter_plus_plus_increase&lt;/span&gt;(CounterPlusPlus &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;self)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    self&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;pref.a &lt;span style=&#34;color:#f92672&#34;&gt;+=&lt;/span&gt; self&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;step;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;We could certainly define a function such as &lt;code&gt;int counter_plus_plus_get_value(CounterPlusPlus *self)&lt;/code&gt; to retrieve the value from our upgraded counter. But we do not need to!&lt;/p&gt;&#xA;&lt;p&gt;In a structure, members are laid out in declaration order, although padding may be inserted between them. A &lt;code&gt;CounterPlusPlus&lt;/code&gt; consists of a &lt;code&gt;Counter&lt;/code&gt; followed by an &lt;code&gt;int&lt;/code&gt;. Therefore, the address of a &lt;code&gt;CounterPlusPlus&lt;/code&gt; instance is the same as the address of its first member, &lt;code&gt;pref&lt;/code&gt;!&lt;/p&gt;&#xA;&lt;p&gt;Thus, we can cast &lt;code&gt;CounterPlusPlus *&lt;/code&gt; to &lt;code&gt;Counter *&lt;/code&gt;, pass it to &lt;code&gt;int counter_get_value(Counter *self)&lt;/code&gt;, and let the function treat it as a &lt;code&gt;Counter&lt;/code&gt;. It will work exactly as expected!&lt;/p&gt;&#xA;&lt;p&gt;This is a common approach to implementing inheritance in C. &lt;a class=&#34;link&#34; href=&#34;https://docs.gtk.org/gobject/&#34;  target=&#34;_blank&#34; rel=&#34;noopener&#34;&#xA;    &gt;GObject&lt;/a&gt; uses this approach extensively, and many of its data types inherit from &lt;code&gt;GObject&lt;/code&gt; in this way.&lt;/p&gt;&#xA;&lt;h2 id=&#34;resource-management-and-ownership&#34;&gt;Resource management and ownership&#xA;&lt;/h2&gt;&lt;p&gt;C gives us the freedom to allocate and deallocate memory, but if we do not use that freedom wisely, we are very likely to run into problems such as memory leaks, double-free errors, use-after-free errors, and so on.&lt;/p&gt;&#xA;&lt;p&gt;Ownership is a convention that C programmers follow to help them manage allocated memory correctly. You can find more information about this in &lt;a class=&#34;link&#34; href=&#34;../ownership-and-lifetimes-explained&#34; &gt;my previous article&lt;/a&gt;.&lt;/p&gt;&#xA;&lt;h2 id=&#34;communicating-directly-with-hardware&#34;&gt;Communicating directly with hardware&#xA;&lt;/h2&gt;&lt;p&gt;You may know that system programming makes extensive use of C, and that C can communicate directly with hardware. Many beginner and intermediate C learners may think this is based on special C syntax introduced by the hardware interface. However, most of the time, this is not the case.&lt;/p&gt;&#xA;&lt;p&gt;Most manufacturers provide a HAL for their hardware to make it easier for developers to develop firmware and drivers. The HAL provides functions for operating the hardware. However, in most cases, the HAL itself is also written in C. So, what C constructs does a HAL use to operate the hardware?&lt;/p&gt;&#xA;&lt;p&gt;Indeed, some hardware platforms provide special machine instructions for certain operations, and these can be accessed by integrating assembly language with C. However, in most cases, communicating with hardware from C is nothing more complicated than writing something like this:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;((&lt;span style=&#34;color:#66d9ef&#34;&gt;volatile&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;uint32_t&lt;/span&gt; &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;)&lt;span style=&#34;color:#ae81ff&#34;&gt;0x40000000UL&lt;/span&gt;) &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;1&lt;/span&gt;;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;Yes. You read that right, and I am not kidding. An address, a type cast, and an ordinary integer assignment. That&amp;rsquo;s all.&lt;/p&gt;&#xA;&lt;p&gt;Most hardware has &lt;em&gt;control registers&lt;/em&gt; for its operation, and you make them perform different tasks by storing values in them. Techniques such as MMIO map these registers into one or more address spaces, allowing you to access them in much the same way as ordinary memory. By reading from and writing to peripheral registers, we can configure hardware, control its operating state, and trigger supported operations. The peripheral&amp;rsquo;s internal logic interprets these register accesses and performs the corresponding actions. There are other techniques, such as PMIO, which uses a separate I/O address space on architectures that support it.&lt;/p&gt;&#xA;&lt;p&gt;Nothing magical or opaque.&lt;/p&gt;&#xA;&lt;h2 id=&#34;further-suggestions&#34;&gt;Further suggestions&#xA;&lt;/h2&gt;&lt;p&gt;The points listed above are just the tip of the iceberg.&lt;/p&gt;&#xA;&lt;p&gt;At the moment, I am using the Study mode offered by an LLM service provider to explore these topics in depth. It has generated a roadmap, and here is a list of some crucial points. I hope they help.&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Memory management and ownership&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Stack allocation versus heap allocation.&lt;/li&gt;&#xA;&lt;li&gt;Object lifetime and storage duration.&lt;/li&gt;&#xA;&lt;li&gt;Ownership, borrowing and ownership transfer.&lt;/li&gt;&#xA;&lt;li&gt;Shallow copies versus deep copies.&lt;/li&gt;&#xA;&lt;li&gt;Reference counting.&lt;/li&gt;&#xA;&lt;li&gt;Resource acquisition and release.&lt;/li&gt;&#xA;&lt;li&gt;Partial initialisation and failure cleanup.&lt;/li&gt;&#xA;&lt;li&gt;Avoiding memory leaks, double-free and use-after-free.&lt;/li&gt;&#xA;&lt;li&gt;Flexible array members.&lt;/li&gt;&#xA;&lt;li&gt;Alignment and padding.&lt;/li&gt;&#xA;&lt;li&gt;Allocation-size overflow.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;API design and encapsulation&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Opaque structures.&lt;/li&gt;&#xA;&lt;li&gt;Public headers and private headers.&lt;/li&gt;&#xA;&lt;li&gt;Constructors and destructors.&lt;/li&gt;&#xA;&lt;li&gt;Initialisers and finalisers.&lt;/li&gt;&#xA;&lt;li&gt;Getters and setters.&lt;/li&gt;&#xA;&lt;li&gt;Reference counting APIs.&lt;/li&gt;&#xA;&lt;li&gt;Copying and cloning.&lt;/li&gt;&#xA;&lt;li&gt;Function contracts.&lt;/li&gt;&#xA;&lt;li&gt;Preconditions and postconditions.&lt;/li&gt;&#xA;&lt;li&gt;Error reporting.&lt;/li&gt;&#xA;&lt;li&gt;API documentation.&lt;/li&gt;&#xA;&lt;li&gt;Namespace conventions.&lt;/li&gt;&#xA;&lt;li&gt;Callback APIs.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The complete compilation process&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Preprocessing.&lt;/li&gt;&#xA;&lt;li&gt;Compilation.&lt;/li&gt;&#xA;&lt;li&gt;Assembly.&lt;/li&gt;&#xA;&lt;li&gt;Linking.&lt;/li&gt;&#xA;&lt;li&gt;Translation units.&lt;/li&gt;&#xA;&lt;li&gt;Object files.&lt;/li&gt;&#xA;&lt;li&gt;Symbol tables.&lt;/li&gt;&#xA;&lt;li&gt;Undefined symbols.&lt;/li&gt;&#xA;&lt;li&gt;Symbol visibility.&lt;/li&gt;&#xA;&lt;li&gt;Static libraries.&lt;/li&gt;&#xA;&lt;li&gt;Shared libraries.&lt;/li&gt;&#xA;&lt;li&gt;Position-independent code.&lt;/li&gt;&#xA;&lt;li&gt;Runtime library loading.&lt;/li&gt;&#xA;&lt;li&gt;Dynamic linking.&lt;/li&gt;&#xA;&lt;li&gt;ABI compatibility.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Advanced pointer techniques&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Pointer arithmetic.&lt;/li&gt;&#xA;&lt;li&gt;Arrays and pointers: their similarities and differences.&lt;/li&gt;&#xA;&lt;li&gt;Pointer-to-pointer (&lt;code&gt;T **&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;Pointers to arrays.&lt;/li&gt;&#xA;&lt;li&gt;Function pointers.&lt;/li&gt;&#xA;&lt;li&gt;Pointers to structures.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;const&lt;/code&gt; correctness.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;restrict&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;void *&lt;/code&gt; and generic programming.&lt;/li&gt;&#xA;&lt;li&gt;Null pointers and invalid pointers.&lt;/li&gt;&#xA;&lt;li&gt;Pointer lifetime and aliasing rules.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Structures and data-oriented design&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Structure composition.&lt;/li&gt;&#xA;&lt;li&gt;Opaque structures.&lt;/li&gt;&#xA;&lt;li&gt;Public versus private structures.&lt;/li&gt;&#xA;&lt;li&gt;Tagged unions.&lt;/li&gt;&#xA;&lt;li&gt;Enumerations.&lt;/li&gt;&#xA;&lt;li&gt;Bit-fields and their portability limitations.&lt;/li&gt;&#xA;&lt;li&gt;Structure padding and alignment.&lt;/li&gt;&#xA;&lt;li&gt;Flexible array members.&lt;/li&gt;&#xA;&lt;li&gt;Intrusive versus non-intrusive data structures.&lt;/li&gt;&#xA;&lt;li&gt;Structure initialisation.&lt;/li&gt;&#xA;&lt;li&gt;Compound literals.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;C strings and binary data&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Null-terminated strings.&lt;/li&gt;&#xA;&lt;li&gt;Character arrays.&lt;/li&gt;&#xA;&lt;li&gt;Buffer sizes and capacities.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;strlen()&lt;/code&gt;, &lt;code&gt;strcmp()&lt;/code&gt;, &lt;code&gt;memcpy()&lt;/code&gt; and &lt;code&gt;memmove()&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Safe string construction.&lt;/li&gt;&#xA;&lt;li&gt;Dynamic string buffers.&lt;/li&gt;&#xA;&lt;li&gt;UTF-8.&lt;/li&gt;&#xA;&lt;li&gt;Character encoding versus byte representation.&lt;/li&gt;&#xA;&lt;li&gt;Integer formatting and &lt;code&gt;printf()&lt;/code&gt; format specifiers.&lt;/li&gt;&#xA;&lt;li&gt;Format-string vulnerabilities.&lt;/li&gt;&#xA;&lt;li&gt;Binary data handling.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Integer types and undefined behaviour&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Integer promotions.&lt;/li&gt;&#xA;&lt;li&gt;Signed and unsigned arithmetic.&lt;/li&gt;&#xA;&lt;li&gt;Integer overflow.&lt;/li&gt;&#xA;&lt;li&gt;Integer conversions.&lt;/li&gt;&#xA;&lt;li&gt;Fixed-width integer types (&lt;code&gt;uint32_t&lt;/code&gt;, &lt;code&gt;int64_t&lt;/code&gt;, etc.).&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;size_t&lt;/code&gt;, &lt;code&gt;ptrdiff_t&lt;/code&gt; and &lt;code&gt;uintptr_t&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Endianness.&lt;/li&gt;&#xA;&lt;li&gt;Alignment.&lt;/li&gt;&#xA;&lt;li&gt;Undefined behaviour.&lt;/li&gt;&#xA;&lt;li&gt;Unspecified behaviour.&lt;/li&gt;&#xA;&lt;li&gt;Implementation-defined behaviour.&lt;/li&gt;&#xA;&lt;li&gt;Strict aliasing.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Error handling&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Return-value-based error handling.&lt;/li&gt;&#xA;&lt;li&gt;Error codes.&lt;/li&gt;&#xA;&lt;li&gt;Error output parameters.&lt;/li&gt;&#xA;&lt;li&gt;The &lt;code&gt;goto&lt;/code&gt; cleanup pattern.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Data structures and algorithms in C&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Dynamic arrays.&lt;/li&gt;&#xA;&lt;li&gt;Linked lists.&lt;/li&gt;&#xA;&lt;li&gt;Doubly linked lists.&lt;/li&gt;&#xA;&lt;li&gt;Hash tables.&lt;/li&gt;&#xA;&lt;li&gt;Trees.&lt;/li&gt;&#xA;&lt;li&gt;Binary search trees.&lt;/li&gt;&#xA;&lt;li&gt;Balanced trees.&lt;/li&gt;&#xA;&lt;li&gt;Queues.&lt;/li&gt;&#xA;&lt;li&gt;Stacks.&lt;/li&gt;&#xA;&lt;li&gt;Heaps.&lt;/li&gt;&#xA;&lt;li&gt;Ring buffers.&lt;/li&gt;&#xA;&lt;li&gt;String builders.&lt;/li&gt;&#xA;&lt;li&gt;Iterators.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Function pointers, callbacks and polymorphism&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Callback registration.&lt;/li&gt;&#xA;&lt;li&gt;Function pointers.&lt;/li&gt;&#xA;&lt;li&gt;Function pointers inside structures.&lt;/li&gt;&#xA;&lt;li&gt;Virtual-function-table patterns.&lt;/li&gt;&#xA;&lt;li&gt;Interface implementation.&lt;/li&gt;&#xA;&lt;li&gt;Event handlers.&lt;/li&gt;&#xA;&lt;li&gt;User-data pointers.&lt;/li&gt;&#xA;&lt;li&gt;Plugin interfaces.&lt;/li&gt;&#xA;&lt;li&gt;Dynamic dispatch.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;The operating system interface&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Standard C library versus operating-system APIs.&lt;/li&gt;&#xA;&lt;li&gt;POSIX.&lt;/li&gt;&#xA;&lt;li&gt;File descriptors.&lt;/li&gt;&#xA;&lt;li&gt;File streams (&lt;code&gt;FILE *&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;File operations.&lt;/li&gt;&#xA;&lt;li&gt;Directories and paths.&lt;/li&gt;&#xA;&lt;li&gt;Processes.&lt;/li&gt;&#xA;&lt;li&gt;Environment variables.&lt;/li&gt;&#xA;&lt;li&gt;Pipes.&lt;/li&gt;&#xA;&lt;li&gt;Signals.&lt;/li&gt;&#xA;&lt;li&gt;Sockets.&lt;/li&gt;&#xA;&lt;li&gt;Memory mapping (&lt;code&gt;mmap()&lt;/code&gt;).&lt;/li&gt;&#xA;&lt;li&gt;System calls.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Concurrency and multithreading&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Processes versus threads.&lt;/li&gt;&#xA;&lt;li&gt;POSIX threads.&lt;/li&gt;&#xA;&lt;li&gt;Mutexes.&lt;/li&gt;&#xA;&lt;li&gt;Condition variables.&lt;/li&gt;&#xA;&lt;li&gt;Semaphores.&lt;/li&gt;&#xA;&lt;li&gt;Atomic operations.&lt;/li&gt;&#xA;&lt;li&gt;Data races.&lt;/li&gt;&#xA;&lt;li&gt;Deadlocks.&lt;/li&gt;&#xA;&lt;li&gt;Thread safety.&lt;/li&gt;&#xA;&lt;li&gt;Thread-local storage.&lt;/li&gt;&#xA;&lt;li&gt;Memory ordering.&lt;/li&gt;&#xA;&lt;li&gt;Event loops.&lt;/li&gt;&#xA;&lt;li&gt;Asynchronous programming.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Event-driven programming&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Event loops.&lt;/li&gt;&#xA;&lt;li&gt;Event queues.&lt;/li&gt;&#xA;&lt;li&gt;Event dispatching.&lt;/li&gt;&#xA;&lt;li&gt;Callbacks.&lt;/li&gt;&#xA;&lt;li&gt;Timers.&lt;/li&gt;&#xA;&lt;li&gt;Input events.&lt;/li&gt;&#xA;&lt;li&gt;Window events.&lt;/li&gt;&#xA;&lt;li&gt;Asynchronous operations.&lt;/li&gt;&#xA;&lt;li&gt;Application lifecycle.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Build systems&#xA;&lt;ul&gt;&#xA;&lt;li&gt;GNU Make&lt;/li&gt;&#xA;&lt;li&gt;Autoconf and Automake&lt;/li&gt;&#xA;&lt;li&gt;Meson&lt;/li&gt;&#xA;&lt;li&gt;CMake&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Library installation and dependency management&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Include directories.&lt;/li&gt;&#xA;&lt;li&gt;Library directories.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;pkg-config&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;.pc&lt;/code&gt; files.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;PKG_CONFIG_PATH&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Static versus shared linking.&lt;/li&gt;&#xA;&lt;li&gt;Runtime library paths.&lt;/li&gt;&#xA;&lt;li&gt;Installation prefixes.&lt;/li&gt;&#xA;&lt;li&gt;Header installation.&lt;/li&gt;&#xA;&lt;li&gt;Library versioning.&lt;/li&gt;&#xA;&lt;li&gt;Dependency discovery.&lt;/li&gt;&#xA;&lt;li&gt;Transitive dependencies.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Debugging&#xA;&lt;ul&gt;&#xA;&lt;li&gt;GDB.&lt;/li&gt;&#xA;&lt;li&gt;Breakpoints.&lt;/li&gt;&#xA;&lt;li&gt;Backtraces.&lt;/li&gt;&#xA;&lt;li&gt;Stack frames.&lt;/li&gt;&#xA;&lt;li&gt;Variable inspection.&lt;/li&gt;&#xA;&lt;li&gt;Core dumps.&lt;/li&gt;&#xA;&lt;li&gt;Watchpoints.&lt;/li&gt;&#xA;&lt;li&gt;Debug symbols.&lt;/li&gt;&#xA;&lt;li&gt;Debugging optimised programmes.&lt;/li&gt;&#xA;&lt;li&gt;Debugging segmentation faults.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Memory and undefined-behaviour detection&#xA;&lt;ul&gt;&#xA;&lt;li&gt;AddressSanitizer, for out-of-bounds access, use-after-free and other memory errors.&lt;/li&gt;&#xA;&lt;li&gt;UndefinedBehaviorSanitizer, for various forms of undefined behaviour.&lt;/li&gt;&#xA;&lt;li&gt;Valgrind Memcheck, for invalid memory access, uninitialised values and memory leaks.&lt;/li&gt;&#xA;&lt;li&gt;MemorySanitizer, for use of uninitialised memory.&lt;/li&gt;&#xA;&lt;li&gt;Static analysis, for potential defects without executing the programme.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Software testing&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Unit testing.&lt;/li&gt;&#xA;&lt;li&gt;Integration testing.&lt;/li&gt;&#xA;&lt;li&gt;Regression testing.&lt;/li&gt;&#xA;&lt;li&gt;Test fixtures.&lt;/li&gt;&#xA;&lt;li&gt;Test assertions.&lt;/li&gt;&#xA;&lt;li&gt;Boundary testing.&lt;/li&gt;&#xA;&lt;li&gt;Error-path testing.&lt;/li&gt;&#xA;&lt;li&gt;Memory-leak testing.&lt;/li&gt;&#xA;&lt;li&gt;Fuzz testing.&lt;/li&gt;&#xA;&lt;li&gt;Continuous integration.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Performance analysis&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Algorithmic complexity.&lt;/li&gt;&#xA;&lt;li&gt;Cache locality.&lt;/li&gt;&#xA;&lt;li&gt;Memory allocation overhead.&lt;/li&gt;&#xA;&lt;li&gt;Profiling.&lt;/li&gt;&#xA;&lt;li&gt;CPU profiling.&lt;/li&gt;&#xA;&lt;li&gt;Memory profiling.&lt;/li&gt;&#xA;&lt;li&gt;Benchmarking.&lt;/li&gt;&#xA;&lt;li&gt;Data-oriented optimisation.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Coding conventions and readability&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Naming conventions.&lt;/li&gt;&#xA;&lt;li&gt;Indentation.&lt;/li&gt;&#xA;&lt;li&gt;Function organisation.&lt;/li&gt;&#xA;&lt;li&gt;Header organisation.&lt;/li&gt;&#xA;&lt;li&gt;Comments.&lt;/li&gt;&#xA;&lt;li&gt;Documentation comments.&lt;/li&gt;&#xA;&lt;li&gt;Naming public and private symbols.&lt;/li&gt;&#xA;&lt;li&gt;File organisation.&lt;/li&gt;&#xA;&lt;li&gt;Avoiding unnecessary macros.&lt;/li&gt;&#xA;&lt;li&gt;Avoiding unnecessary global variables.&lt;/li&gt;&#xA;&lt;li&gt;Keeping functions understandable.&lt;/li&gt;&#xA;&lt;li&gt;Maintaining consistency.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Documentation&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Public functions.&lt;/li&gt;&#xA;&lt;li&gt;Function parameters.&lt;/li&gt;&#xA;&lt;li&gt;Return values.&lt;/li&gt;&#xA;&lt;li&gt;Error conditions.&lt;/li&gt;&#xA;&lt;li&gt;Ownership transfer.&lt;/li&gt;&#xA;&lt;li&gt;Object lifecycle.&lt;/li&gt;&#xA;&lt;li&gt;Thread-safety guarantees.&lt;/li&gt;&#xA;&lt;li&gt;API stability.&lt;/li&gt;&#xA;&lt;li&gt;Examples of usage.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;API and ABI stability&#xA;&lt;ul&gt;&#xA;&lt;li&gt;What is an API?&lt;/li&gt;&#xA;&lt;li&gt;What is an ABI?&lt;/li&gt;&#xA;&lt;li&gt;What constitutes an incompatible change?&lt;/li&gt;&#xA;&lt;li&gt;Why exposing structure members can be problematic.&lt;/li&gt;&#xA;&lt;li&gt;Symbol visibility.&lt;/li&gt;&#xA;&lt;li&gt;Shared-library versioning.&lt;/li&gt;&#xA;&lt;li&gt;Deprecation.&lt;/li&gt;&#xA;&lt;li&gt;Backwards compatibility.&lt;/li&gt;&#xA;&lt;li&gt;Parallel installation of different library versions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Internationalisation and localisation&#xA;&lt;ul&gt;&#xA;&lt;li&gt;UTF-8.&lt;/li&gt;&#xA;&lt;li&gt;Character encodings.&lt;/li&gt;&#xA;&lt;li&gt;Locales.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;gettext&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;Translation catalogues.&lt;/li&gt;&#xA;&lt;li&gt;Plural forms.&lt;/li&gt;&#xA;&lt;li&gt;Date and number formatting.&lt;/li&gt;&#xA;&lt;li&gt;Translating error messages.&lt;/li&gt;&#xA;&lt;li&gt;Avoiding hard-coded user-facing strings.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Git and collaborative development&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Repositories.&lt;/li&gt;&#xA;&lt;li&gt;Commits.&lt;/li&gt;&#xA;&lt;li&gt;Branches.&lt;/li&gt;&#xA;&lt;li&gt;Merging.&lt;/li&gt;&#xA;&lt;li&gt;Rebasing.&lt;/li&gt;&#xA;&lt;li&gt;Diff inspection.&lt;/li&gt;&#xA;&lt;li&gt;Conflict resolution.&lt;/li&gt;&#xA;&lt;li&gt;Patch creation.&lt;/li&gt;&#xA;&lt;li&gt;Code review.&lt;/li&gt;&#xA;&lt;li&gt;Issue reporting.&lt;/li&gt;&#xA;&lt;li&gt;Release branches.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;&lt;p&gt;Or a simplified version:&lt;/p&gt;&#xA;&lt;ol&gt;&#xA;&lt;li&gt;Stage 1 — Idiomatic C&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Memory ownership and lifetimes.&lt;/li&gt;&#xA;&lt;li&gt;Advanced pointers and structures.&lt;/li&gt;&#xA;&lt;li&gt;String and buffer handling.&lt;/li&gt;&#xA;&lt;li&gt;Error handling.&lt;/li&gt;&#xA;&lt;li&gt;Data structures.&lt;/li&gt;&#xA;&lt;li&gt;Function pointers and callbacks.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Stage 2 — Library engineering&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Opaque types and API design.&lt;/li&gt;&#xA;&lt;li&gt;Header and source organisation.&lt;/li&gt;&#xA;&lt;li&gt;Static and shared libraries.&lt;/li&gt;&#xA;&lt;li&gt;Compilation and linking.&lt;/li&gt;&#xA;&lt;li&gt;&lt;code&gt;pkg-config&lt;/code&gt;.&lt;/li&gt;&#xA;&lt;li&gt;ABI and API stability.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Stage 3 — Professional C development&#xA;&lt;ul&gt;&#xA;&lt;li&gt;POSIX and system programming.&lt;/li&gt;&#xA;&lt;li&gt;Build systems.&lt;/li&gt;&#xA;&lt;li&gt;Debugging and profiling.&lt;/li&gt;&#xA;&lt;li&gt;Unit and integration testing.&lt;/li&gt;&#xA;&lt;li&gt;Sanitizers and static analysis.&lt;/li&gt;&#xA;&lt;li&gt;Documentation and coding conventions.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Stage 4 — Ecosystem development&#xA;&lt;ul&gt;&#xA;&lt;li&gt;GLib and GObject.&lt;/li&gt;&#xA;&lt;li&gt;GNU development practices.&lt;/li&gt;&#xA;&lt;li&gt;SDL development practices.&lt;/li&gt;&#xA;&lt;li&gt;Git and collaborative development.&lt;/li&gt;&#xA;&lt;li&gt;API compatibility.&lt;/li&gt;&#xA;&lt;li&gt;Contributing patches to established projects.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ol&gt;&#xA;</description>
        </item><item>
            <title>Ownership and Lifetimes Explained</title>
            <link>https://rebel1725.codeberg.page/blog/en/post/ownership-and-lifetimes-explained/</link>
            <pubDate>Wed, 11 Nov 2026 12:25:16 +0800</pubDate><author>rebel1725@tilde.club (Rebel Zhang)</author>
            <guid>https://rebel1725.codeberg.page/blog/en/post/ownership-and-lifetimes-explained/</guid>
            <description>&lt;p&gt;C allows us to define variables as follows:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;// A variable declared inside a function will usually be stored on the stack.&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; a &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;42&lt;/span&gt;;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;// A variable declared with `static` or at file scope will usually be stored in `.data`&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;// or `.rodata`.&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;static&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; b &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;2026&lt;/span&gt;;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;The storage for these variables is managed by the language itself. However, sometimes we need to manage memory manually. In such cases, we can obtain &lt;em&gt;dynamically allocated memory&lt;/em&gt; using functions such as &lt;code&gt;malloc()&lt;/code&gt;, &lt;code&gt;calloc()&lt;/code&gt; and &lt;code&gt;realloc()&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;// Dynamically allocated memory will usually come from the heap.&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;c &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;malloc&lt;/span&gt;(&lt;span style=&#34;color:#66d9ef&#34;&gt;sizeof&lt;/span&gt; &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;c);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;c &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;42&lt;/span&gt;;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;When the memory is no longer needed, we deallocate it using &lt;code&gt;free()&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#a6e22e&#34;&gt;free&lt;/span&gt;(c);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;This gives us the flexibility to allocate and deallocate memory as needed, allowing us to implement all kinds of complex data structures and, consequently, many things that would be difficult or impossible with only statically allocated memory.&lt;/p&gt;&#xA;&lt;p&gt;However, this approach also introduces a problem.&lt;/p&gt;&#xA;&lt;p&gt;Consider the following scenario:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;a &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;malloc&lt;/span&gt;(&lt;span style=&#34;color:#66d9ef&#34;&gt;sizeof&lt;/span&gt; &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;a);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;b &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; a;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;Who is responsible for deallocating the memory?&lt;/p&gt;&#xA;&lt;p&gt;Clearly, leaving the allocation undeallocated is not a solution, as this would result in a memory leak. Nor is deallocating it through both pointers, as this would cause undefined behaviour under ISO/IEC 9899 and is commonly referred to as a &lt;em&gt;double free&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;We should deallocate the memory through just &lt;em&gt;one of&lt;/em&gt; these pointers. But how do we determine which one? This introduces us to an important concept in memory management, and resource management in general: &lt;strong&gt;ownership&lt;/strong&gt;.&lt;/p&gt;&#xA;&lt;h2 id=&#34;ownership-borrowing-and-transfer&#34;&gt;Ownership, borrowing and transfer&#xA;&lt;/h2&gt;&lt;p&gt;Ownership is a contract that specifies which part of a programme is responsible for managing a resource and deallocating it when it is no longer needed. We say that a pointer variable &lt;em&gt;owns&lt;/em&gt; the memory when it is designated as responsible for releasing that allocation using &lt;code&gt;free()&lt;/code&gt;.&lt;/p&gt;&#xA;&lt;p&gt;To explain how ownership helps us manage resources properly, let&amp;rsquo;s implement a linked list. First, define the following structure:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;typedef&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;struct&lt;/span&gt; N&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; data;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;struct&lt;/span&gt; N &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;previous;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;struct&lt;/span&gt; N &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;next;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;} Node;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;We use &lt;code&gt;previous == NULL&lt;/code&gt; to indicate a guard node (whose &lt;code&gt;data&lt;/code&gt; member is meaningless), and &lt;code&gt;next == NULL&lt;/code&gt; to indicate the last item in the linked list.&lt;/p&gt;&#xA;&lt;p&gt;Suppose we have a &lt;code&gt;Node&lt;/code&gt; variable defined at file scope and use it as our guard node:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;Node l &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; {&lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt;, NULL, NULL};&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;We need some functions to manipulate this linked list.&lt;/p&gt;&#xA;&lt;p&gt;Let&amp;rsquo;s define the following functions:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;Node &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;&lt;span style=&#34;color:#a6e22e&#34;&gt;getNode&lt;/span&gt;(Node &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;guard, &lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; index)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;if&lt;/span&gt; (index &lt;span style=&#34;color:#f92672&#34;&gt;&amp;lt;&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt;)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; NULL;  &lt;span style=&#34;color:#75715e&#34;&gt;// The index is negative.&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;else&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;if&lt;/span&gt; (index &lt;span style=&#34;color:#f92672&#34;&gt;&amp;gt;&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt; &lt;span style=&#34;color:#f92672&#34;&gt;&amp;amp;&amp;amp;&lt;/span&gt; guard&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next &lt;span style=&#34;color:#f92672&#34;&gt;==&lt;/span&gt; NULL)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; NULL;  &lt;span style=&#34;color:#75715e&#34;&gt;// The index is out of range.&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;else&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;if&lt;/span&gt; (index &lt;span style=&#34;color:#f92672&#34;&gt;==&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt;)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; guard&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;else&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;getNode&lt;/span&gt;(guard&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next, index &lt;span style=&#34;color:#f92672&#34;&gt;-&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;1&lt;/span&gt;);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;void&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;setData&lt;/span&gt;(Node &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;x, &lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; data)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    x&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;data &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; data;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;getData&lt;/span&gt;(Node &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;x)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; x&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;data;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;Here are some statements from our &lt;code&gt;main()&lt;/code&gt; function:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;/* ... */&lt;/span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;Node &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;a &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;malloc&lt;/span&gt;(&lt;span style=&#34;color:#66d9ef&#34;&gt;sizeof&lt;/span&gt; &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;a);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;a&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;previous &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; NULL;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;a&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; NULL;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#a6e22e&#34;&gt;setData&lt;/span&gt;(a, &lt;span style=&#34;color:#ae81ff&#34;&gt;42&lt;/span&gt;);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#a6e22e&#34;&gt;printf&lt;/span&gt;(&lt;span style=&#34;color:#e6db74&#34;&gt;&amp;#34;%d&lt;/span&gt;&lt;span style=&#34;color:#ae81ff&#34;&gt;\n&lt;/span&gt;&lt;span style=&#34;color:#e6db74&#34;&gt;&amp;#34;&lt;/span&gt;, &lt;span style=&#34;color:#a6e22e&#34;&gt;getData&lt;/span&gt;(a));&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;/* ... */&lt;/span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;Who is responsible for deallocating the memory pointed to by &lt;code&gt;a&lt;/code&gt; after &lt;code&gt;setData()&lt;/code&gt; and &lt;code&gt;getData()&lt;/code&gt; have been called? Obviously, it is still &lt;code&gt;a&lt;/code&gt;. &lt;code&gt;setData()&lt;/code&gt; and &lt;code&gt;getData()&lt;/code&gt; only read or modify the memory passed to them through their parameters; they neither allocate nor deallocate memory. They do not pass the pointers to other functions or global variables that will also manage the memory. We therefore say that these functions &lt;em&gt;borrow&lt;/em&gt; the memory rather than take ownership of it.&lt;/p&gt;&#xA;&lt;p&gt;Borrowing means that a function receives access to a resource without taking responsibility for its lifetime. The function may read or modify the resource, depending on the interface contract, but must not independently release it.&lt;/p&gt;&#xA;&lt;p&gt;The same applies to &lt;code&gt;getNode()&lt;/code&gt;: it traverses the linked list and retrieves a node by index. It neither allocates nor deallocates memory, nor does it transfer ownership of anything.&lt;/p&gt;&#xA;&lt;p&gt;However, this is not always the case. Consider the following functions:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;Node &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;&lt;span style=&#34;color:#a6e22e&#34;&gt;createNode&lt;/span&gt;(&lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; data)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    Node &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;ans &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;malloc&lt;/span&gt;(&lt;span style=&#34;color:#66d9ef&#34;&gt;sizeof&lt;/span&gt; &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;ans);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;if&lt;/span&gt; (&lt;span style=&#34;color:#f92672&#34;&gt;!&lt;/span&gt; ans)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        &lt;span style=&#34;color:#a6e22e&#34;&gt;exit&lt;/span&gt;(EXIT_FAILURE);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    ans&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;data &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; data;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    ans&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;previous &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; NULL;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    ans&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; NULL;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; ans;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;insertNode&lt;/span&gt;(Node &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;guard, Node &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;n, &lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; index)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;if&lt;/span&gt; (index &lt;span style=&#34;color:#f92672&#34;&gt;&amp;lt;&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt;)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;1&lt;/span&gt;;  &lt;span style=&#34;color:#75715e&#34;&gt;// The index is negative.&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;else&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;if&lt;/span&gt; (index &lt;span style=&#34;color:#f92672&#34;&gt;&amp;gt;&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt; &lt;span style=&#34;color:#f92672&#34;&gt;&amp;amp;&amp;amp;&lt;/span&gt; guard&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next &lt;span style=&#34;color:#f92672&#34;&gt;==&lt;/span&gt; NULL)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;2&lt;/span&gt;;  &lt;span style=&#34;color:#75715e&#34;&gt;// The index is out of range.&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;else&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;if&lt;/span&gt; (index &lt;span style=&#34;color:#f92672&#34;&gt;==&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt;)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    {&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        &lt;span style=&#34;color:#66d9ef&#34;&gt;if&lt;/span&gt; (guard&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        {&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;            n&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; guard&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;            guard&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;previous &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; n;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        }&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        n&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;previous &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; guard;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        guard&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; n;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt;;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    }&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;else&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;insertNode&lt;/span&gt;(guard&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next, n, index &lt;span style=&#34;color:#f92672&#34;&gt;-&lt;/span&gt; &lt;span style=&#34;color:#ae81ff&#34;&gt;1&lt;/span&gt;);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;We can now pass &lt;code&gt;a&lt;/code&gt; to &lt;code&gt;insertNode()&lt;/code&gt; to insert the node we have allocated into the linked list:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;/* ... */&lt;/span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#a6e22e&#34;&gt;insertNode&lt;/span&gt;(&lt;span style=&#34;color:#f92672&#34;&gt;&amp;amp;&lt;/span&gt;l, a, &lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt;);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;/* ... */&lt;/span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;What happens now?&lt;/p&gt;&#xA;&lt;p&gt;Obviously, we should no longer call &lt;code&gt;free()&lt;/code&gt; on &lt;code&gt;a&lt;/code&gt; after successfully calling &lt;code&gt;insertNode()&lt;/code&gt;, as doing so would break the linked list. Instead, the node should be deallocated when we destroy the linked list:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;void&lt;/span&gt; &lt;span style=&#34;color:#a6e22e&#34;&gt;destroyExceptGuard&lt;/span&gt;(Node &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;guard)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;if&lt;/span&gt; (guard &lt;span style=&#34;color:#f92672&#34;&gt;==&lt;/span&gt; NULL)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt;;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    Node &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;current &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; guard&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    guard&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; NULL;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;while&lt;/span&gt; (current &lt;span style=&#34;color:#f92672&#34;&gt;!=&lt;/span&gt; NULL)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    {&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        Node &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;next &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; current&lt;span style=&#34;color:#f92672&#34;&gt;-&amp;gt;&lt;/span&gt;next;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        &lt;span style=&#34;color:#a6e22e&#34;&gt;free&lt;/span&gt;(current);&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        current &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; next;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    }&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;When &lt;code&gt;insertNode()&lt;/code&gt; successfully inserts a node, ownership of that node is &lt;em&gt;transferred&lt;/em&gt; from the caller to the linked list. The function carries out this transfer, but the linked list becomes responsible for the node after insertion.&lt;/p&gt;&#xA;&lt;p&gt;The function &lt;code&gt;createNode()&lt;/code&gt; does the opposite: it allocates memory and returns a pointer to it. After the function returns, it is no longer responsible for deallocating the memory. Instead, responsibility passes to the caller, which receives the returned pointer. We say that the function &lt;em&gt;transfers&lt;/em&gt; ownership to the caller.&lt;/p&gt;&#xA;&lt;h2 id=&#34;lifetimes--how-long-should-a-resource-live&#34;&gt;Lifetimes — How long should a resource live?&#xA;&lt;/h2&gt;&lt;p&gt;Having ownership means that the owner is responsible not only for deallocating the memory, but also for deciding &lt;em&gt;when&lt;/em&gt; to do so. In other words, the owner determines the resource&amp;rsquo;s &lt;em&gt;lifetime&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;p&gt;More generally, ownership is a programming contract that establishes which part of a programme is responsible for managing a resource&amp;rsquo;s lifetime and, in particular, releasing it when it is no longer needed. A pointer may refer to a resource without owning it, and multiple pointers may refer to the same resource.&lt;/p&gt;&#xA;&lt;p&gt;In C, the lifetime of an object in allocated storage is managed using &lt;code&gt;free()&lt;/code&gt; and other functions that can modify the allocation. The object exists from the time it is allocated until one of these functions is called on the allocation.&lt;/p&gt;&#xA;&lt;p&gt;Take another look at our linked-list node:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#66d9ef&#34;&gt;typedef&lt;/span&gt; &lt;span style=&#34;color:#66d9ef&#34;&gt;struct&lt;/span&gt; N&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; data;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;struct&lt;/span&gt; N &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;previous;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;struct&lt;/span&gt; N &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;next;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;} Node;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;A complete, well-formed linked list should contain a guard node and some item nodes whose pointers are correctly linked to one another. If a node is deallocated without first updating the relevant pointers, the neighbouring nodes may retain pointer values that refer to an object whose lifetime has ended. These pointers must not be used. Consequently, traversing the linked list through these relationships can cause undefined behaviour. Furthermore, the nodes following the destroyed node may become unreachable when traversing the list from the guard node.&lt;/p&gt;&#xA;&lt;p&gt;When discussing a pointer&amp;rsquo;s lifetime, we are usually referring to the lifetime of the object it points to, rather than the lifetime of the pointer variable itself. The pointer variable also has its own lifetime, but this is separate and does not affect the lifetime of its referent.&lt;/p&gt;&#xA;&lt;p&gt;Lifetime issues are not limited to dynamically allocated memory, whose lifetime we manage ourselves. For example, suppose we replace &lt;code&gt;createNode()&lt;/code&gt; with the following implementation:&lt;/p&gt;&#xA;&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;&#34;&gt;&lt;code class=&#34;language-c&#34; data-lang=&#34;c&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;Node &lt;span style=&#34;color:#f92672&#34;&gt;*&lt;/span&gt;&lt;span style=&#34;color:#a6e22e&#34;&gt;createNode&lt;/span&gt;(&lt;span style=&#34;color:#66d9ef&#34;&gt;int&lt;/span&gt; data)&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;{&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    Node ans;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    ans.data &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; data;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    ans.previous &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; NULL;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    ans.next &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; NULL;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; &lt;span style=&#34;color:#f92672&#34;&gt;&amp;amp;&lt;/span&gt;ans;&#xA;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}&#xA;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;This implementation is invalid because the lifetime of &lt;code&gt;ans&lt;/code&gt; lasts only while the function is executing. It ends when the function returns, at which point the returned pointer no longer refers to a live object.&lt;/p&gt;&#xA;&lt;p&gt;Adding &lt;code&gt;static&lt;/code&gt; to &lt;code&gt;Node ans&lt;/code&gt; would not solve the problem. It would give &lt;code&gt;ans&lt;/code&gt; a lifetime that extends throughout the entire execution of the programme, but every function call would refer to the same object rather than creating a new one.&lt;/p&gt;&#xA;&lt;h2 id=&#34;ownership-and-lifetimes-in-different-programming-languages&#34;&gt;Ownership and lifetimes in different programming languages&#xA;&lt;/h2&gt;&lt;p&gt;In C, ownership is not enforced by the language itself. Instead, it is a contract that programmers establish and follow to avoid crashes and unexpected behaviour. Object lifetimes, by contrast, are defined by the language itself.&lt;/p&gt;&#xA;&lt;p&gt;In some other programming languages, ownership is enforced by the language itself. Rust is a notable example: it has an ownership system enforced by its compiler. Every value has an owner, and ownership can be transferred between variables through move semantics. References (&lt;code&gt;&amp;amp;T&lt;/code&gt; and &lt;code&gt;&amp;amp;mut T&lt;/code&gt;) allow other parts of the programme to borrow values without taking ownership. Rust&amp;rsquo;s lifetime rules ensure that borrowed references cannot outlive the values they refer to. For example, &lt;code&gt;String&lt;/code&gt; is an owning type that manages a dynamically allocated buffer containing its string data, whereas &lt;code&gt;&amp;amp;str&lt;/code&gt; is a borrowed string slice. Rust also provides types such as &lt;code&gt;Rc&amp;lt;T&amp;gt;&lt;/code&gt; and &lt;code&gt;Arc&amp;lt;T&amp;gt;&lt;/code&gt; for shared ownership.&lt;/p&gt;&#xA;&lt;p&gt;C++ uses RAII and combines automatic resource management with facilities for manual management. We can manage memory manually using &lt;code&gt;new&lt;/code&gt; and &lt;code&gt;delete&lt;/code&gt;, or use smart pointers such as &lt;code&gt;std::unique_ptr&amp;lt;T&amp;gt;&lt;/code&gt; and &lt;code&gt;std::shared_ptr&amp;lt;T&amp;gt;&lt;/code&gt;, which are provided by the C++ standard library. These objects encapsulate ownership information for dynamically allocated memory, allowing the language to manage resources automatically. We can also implement our own smart pointers. &lt;code&gt;std::unique_ptr&amp;lt;T&amp;gt;&lt;/code&gt; enforces exclusive ownership, behaving similarly to exclusive-ownership contracts in C, while managing the resource automatically. &lt;code&gt;std::shared_ptr&amp;lt;T&amp;gt;&lt;/code&gt; uses a counter to track how many variables share ownership of a resource. It deallocates the resource automatically when no variable retains shared ownership.&lt;/p&gt;&#xA;&lt;p&gt;Languages such as Python generally use automatic memory management rather than requiring programmers to explicitly allocate and deallocate memory. CPython, for example, uses reference counting together with a cyclic garbage collector.&lt;/p&gt;&#xA;</description>
        </item></channel>
</rss>
