1
0
Fork 0
mirror of https://github.com/ganelson/inform.git synced 2024-07-08 18:14:21 +03:00
inform7/docs/bytecode-module/2-inl.html
Graham Nelson 1268a0f40e Colonised
2020-04-14 17:56:54 +01:00

138 lines
15 KiB
HTML

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<title>Inter Node Lists</title>
<meta name="viewport" content="width=device-width initial-scale=1">
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<meta http-equiv="Content-Language" content="en-gb">
<link href="../inweb.css" rel="stylesheet" rev="stylesheet" type="text/css">
</head>
<body>
<nav role="navigation">
<h1><a href="../index.html">
<img src="../docs-src/Figures/Inform.png" height=72">
</a></h1>
<ul><li><a href="../compiler.html">compiler tools</a></li>
<li><a href="../other.html">other tools</a></li>
<li><a href="../extensions.html">extensions and kits</a></li>
<li><a href="../units.html">unit test tools</a></li>
</ul><h2>Compiler Webs</h2><ul>
<li><a href="../inbuild/index.html">inbuild</a></li>
<li><a href="../inform7/index.html">inform7</a></li>
<li><a href="../inter/index.html">inter</a></li>
</ul><h2>Inbuild Modules</h2><ul>
<li><a href="../supervisor-module/index.html">supervisor</a></li>
</ul><h2>Inform7 Modules</h2><ul>
<li><a href="../core-module/index.html">core</a></li>
<li><a href="../inflections-module/index.html">inflections</a></li>
<li><a href="../linguistics-module/index.html">linguistics</a></li>
<li><a href="../kinds-module/index.html">kinds</a></li>
<li><a href="../if-module/index.html">if</a></li>
<li><a href="../multimedia-module/index.html">multimedia</a></li>
<li><a href="../problems-module/index.html">problems</a></li>
<li><a href="../index-module/index.html">index</a></li>
</ul><h2>Inter Modules</h2><ul>
<li><a href="index.html"><span class="selectedlink">bytecode</span></a></li>
<li><a href="../building-module/index.html">building</a></li>
<li><a href="../codegen-module/index.html">codegen</a></li>
</ul><h2>Shared Modules</h2><ul>
<li><a href="../arch-module/index.html">arch</a></li>
<li><a href="../syntax-module/index.html">syntax</a></li>
<li><a href="../words-module/index.html">words</a></li>
<li><a href="../html-module/index.html">html</a></li>
<li><a href="../../../inweb/docs/foundation-module/index.html">foundation</a></li>
</ul>
</nav>
<main role="main">
<!--Weave of 'Inter Node Lists' generated by 7-->
<ul class="crumbs"><li><a href="../index.html">Home</a></li><li><a href="../compiler.html">Inter Modules</a></li><li><a href="index.html">bytecode</a></li><li><a href="index.html#2">Chapter 2: Interoperability</a></li><li><b>Inter Node Lists</b></li></ul><p class="purpose">To store doubly-linked lists of inter frames.</p>
<p class="inwebparagraph"><a id="SP1"></a><b>&#167;1. </b></p>
<pre class="display">
<span class="reserved">typedef</span><span class="plain"> </span><span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_node_list</span><span class="plain"> {</span>
<span class="reserved">int</span><span class="plain"> </span><span class="identifier">storage_used</span><span class="plain">;</span>
<span class="reserved">int</span><span class="plain"> </span><span class="identifier">storage_capacity</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_node_list_entry</span><span class="plain"> *</span><span class="identifier">spare_storage</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_node_list_entry</span><span class="plain"> *</span><span class="identifier">first_in_inl</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_node_list_entry</span><span class="plain"> *</span><span class="identifier">last_in_inl</span><span class="plain">;</span>
<span class="identifier">MEMORY_MANAGEMENT</span>
<span class="plain">} </span><span class="reserved">inter_node_list</span><span class="plain">;</span>
<span class="reserved">typedef</span><span class="plain"> </span><span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_node_list_entry</span><span class="plain"> {</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">listed_node</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_node_list_entry</span><span class="plain"> *</span><span class="identifier">next_in_inl</span><span class="plain">;</span>
<span class="reserved">struct</span><span class="plain"> </span><span class="reserved">inter_node_list_entry</span><span class="plain"> *</span><span class="identifier">prev_in_inl</span><span class="plain">;</span>
<span class="identifier">MEMORY_MANAGEMENT</span>
<span class="plain">} </span><span class="reserved">inter_node_list_entry</span><span class="plain">;</span>
</pre>
<p class="inwebparagraph"></p>
<p class="endnote">The structure inter_node_list is private to this section.</p>
<p class="endnote">The structure inter_node_list_entry is private to this section.</p>
<p class="inwebparagraph"><a id="SP2"></a><b>&#167;2. </b></p>
<pre class="definitions">
<span class="definitionkeyword">define</span> <span class="identifier">LOOP_THROUGH_INTER_NODE_LIST</span><span class="plain">(</span><span class="identifier">F</span><span class="plain">, </span><span class="identifier">ifl</span><span class="plain">)</span>
<span class="reserved">for</span><span class="plain"> (</span><span class="reserved">inter_node_list_entry</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain">##</span><span class="identifier">_entry</span><span class="plain"> = (</span><span class="identifier">ifl</span><span class="plain">)?(</span><span class="identifier">ifl</span><span class="plain">-&gt;</span><span class="element">first_in_inl</span><span class="plain">):</span><span class="identifier">NULL</span><span class="plain">; </span><span class="identifier">F</span><span class="plain">##</span><span class="identifier">_entry</span><span class="plain">; </span><span class="identifier">F</span><span class="plain">##</span><span class="identifier">_entry</span><span class="plain"> = </span><span class="identifier">F</span><span class="plain">##</span><span class="identifier">_entry</span><span class="plain">-&gt;</span><span class="element">next_in_inl</span><span class="plain">)</span>
<span class="reserved">if</span><span class="plain"> (((</span><span class="identifier">F</span><span class="plain"> = </span><span class="identifier">F</span><span class="plain">##</span><span class="identifier">_entry</span><span class="plain">-&gt;</span><span class="element">listed_node</span><span class="plain">), </span><span class="identifier">F</span><span class="plain">))</span>
</pre>
<pre class="display">
<span class="reserved">inter_node_list</span><span class="plain"> *</span><span class="functiontext">Inter::Lists::new<button class="popup" onclick="togglePopup('usagePopup94')">...<span class="popuptext" id="usagePopup94">Usage of <b>Inter::Lists::new</b>:<br>The Warehouse - <a href="2-tw.html#SP3">&#167;3</a><br>Inter in Binary Files - <a href="3-iibf.html#SP1_4_4">&#167;1.4.4</a></span></button></span><span class="plain">(</span><span class="reserved">void</span><span class="plain">) {</span>
<span class="reserved">inter_node_list</span><span class="plain"> *</span><span class="identifier">ifl</span><span class="plain"> = </span><span class="identifier">CREATE</span><span class="plain">(</span><span class="reserved">inter_node_list</span><span class="plain">);</span>
<span class="identifier">ifl</span><span class="plain">-&gt;</span><span class="element">spare_storage</span><span class="plain"> = </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">ifl</span><span class="plain">-&gt;</span><span class="element">storage_used</span><span class="plain"> = </span><span class="constant">0</span><span class="plain">;</span>
<span class="identifier">ifl</span><span class="plain">-&gt;</span><span class="element">storage_capacity</span><span class="plain"> = </span><span class="constant">0</span><span class="plain">;</span>
<span class="identifier">ifl</span><span class="plain">-&gt;</span><span class="element">first_in_inl</span><span class="plain"> = </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">ifl</span><span class="plain">-&gt;</span><span class="element">last_in_inl</span><span class="plain"> = </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="reserved">return</span><span class="plain"> </span><span class="identifier">ifl</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">void</span><span class="plain"> </span><span class="functiontext">Inter::Lists::add<button class="popup" onclick="togglePopup('usagePopup95')">...<span class="popuptext" id="usagePopup95">Usage of <b>Inter::Lists::add</b>:<br>The PropertyValue Construct - <a href="4-tpc5.html#SP2">&#167;2</a><br>The Permission Construct - <a href="4-tpc6.html#SP2">&#167;2</a></span></button></span><span class="plain">(</span><span class="reserved">inter_node_list</span><span class="plain"> *</span><span class="identifier">FL</span><span class="plain">, </span><span class="reserved">inter_tree_node</span><span class="plain"> *</span><span class="identifier">F</span><span class="plain">) {</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">F</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="identifier">internal_error</span><span class="plain">(</span><span class="string">"linked imvalid frame"</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">FL</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="identifier">internal_error</span><span class="plain">(</span><span class="string">"bad frame list"</span><span class="plain">);</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">storage_used</span><span class="plain"> &gt;= </span><span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">storage_capacity</span><span class="plain">) {</span>
<span class="reserved">int</span><span class="plain"> </span><span class="identifier">new_size</span><span class="plain"> = </span><span class="constant">128</span><span class="plain">;</span>
<span class="reserved">while</span><span class="plain"> (</span><span class="identifier">new_size</span><span class="plain"> &lt; </span><span class="constant">2</span><span class="plain">*</span><span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">storage_capacity</span><span class="plain">) </span><span class="identifier">new_size</span><span class="plain"> = </span><span class="constant">2</span><span class="plain">*</span><span class="identifier">new_size</span><span class="plain">;</span>
<span class="reserved">inter_node_list_entry</span><span class="plain"> *</span><span class="identifier">storage</span><span class="plain"> = (</span><span class="reserved">inter_node_list_entry</span><span class="plain"> *) </span><span class="identifier">Memory::I7_calloc</span><span class="plain">(</span><span class="identifier">new_size</span><span class="plain">, </span><span class="reserved">sizeof</span><span class="plain">(</span><span class="reserved">inter_node_list_entry</span><span class="plain">), </span><span class="constant">INTER_LINKS_MREASON</span><span class="plain">);</span>
<span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">spare_storage</span><span class="plain"> = </span><span class="identifier">storage</span><span class="plain">;</span>
<span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">storage_used</span><span class="plain"> = </span><span class="constant">0</span><span class="plain">;</span>
<span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">storage_capacity</span><span class="plain"> = </span><span class="identifier">new_size</span><span class="plain">;</span>
<span class="plain">}</span>
<span class="reserved">inter_node_list_entry</span><span class="plain"> *</span><span class="identifier">entry</span><span class="plain"> = &amp;(</span><span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">spare_storage</span><span class="plain">[</span><span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">storage_used</span><span class="plain"> ++]);</span>
<span class="identifier">entry</span><span class="plain">-&gt;</span><span class="element">listed_node</span><span class="plain"> = </span><span class="identifier">F</span><span class="plain">;</span>
<span class="identifier">entry</span><span class="plain">-&gt;</span><span class="element">next_in_inl</span><span class="plain"> = </span><span class="identifier">NULL</span><span class="plain">;</span>
<span class="identifier">entry</span><span class="plain">-&gt;</span><span class="element">prev_in_inl</span><span class="plain"> = </span><span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">last_in_inl</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">last_in_inl</span><span class="plain">) </span><span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">last_in_inl</span><span class="plain">-&gt;</span><span class="element">next_in_inl</span><span class="plain"> = </span><span class="identifier">entry</span><span class="plain">;</span>
<span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">last_in_inl</span><span class="plain"> = </span><span class="identifier">entry</span><span class="plain">;</span>
<span class="reserved">if</span><span class="plain"> (</span><span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">first_in_inl</span><span class="plain"> == </span><span class="identifier">NULL</span><span class="plain">) </span><span class="identifier">FL</span><span class="plain">-&gt;</span><span class="element">first_in_inl</span><span class="plain"> = </span><span class="identifier">entry</span><span class="plain">;</span>
<span class="plain">}</span>
</pre>
<p class="inwebparagraph"></p>
<hr class="tocbar">
<ul class="toc"><li><a href="2-tw.html">Back to 'The Warehouse'</a></li><li><a href="2-st.html">Continue with 'Symbols Tables'</a></li></ul><hr class="tocbar">
<!--End of weave-->
<script>
function togglePopup(material_id) {
var popup = document.getElementById(material_id);
popup.classList.toggle("show");
}
</script>
<link href="Popups.css" rel="stylesheet" rev="stylesheet" type="text/css">
</main>
</body>
</html>