mirror of
https://github.com/ganelson/inform.git
synced 2024-07-08 18:14:21 +03:00
95 lines
13 KiB
HTML
95 lines
13 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
|
|
<html>
|
|
<head>
|
|
<title>2/tw</title>
|
|
<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>
|
|
|
|
<!--Weave of '2/inl' generated by 7-->
|
|
<ul class="crumbs"><li><a href="../webs.html">★</a></li><li><a href="index.html">inter</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>§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>§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">-</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">-</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">-</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</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">-</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">-</span><span class="element">>storage_used</span><span class="plain"> = 0;</span>
|
|
<span class="identifier">ifl</span><span class="plain">-</span><span class="element">>storage_capacity</span><span class="plain"> = 0;</span>
|
|
<span class="identifier">ifl</span><span class="plain">-</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">-</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</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">-</span><span class="element">>storage_used</span><span class="plain"> >= </span><span class="identifier">FL</span><span class="plain">-</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"> = 128;</span>
|
|
<span class="reserved">while</span><span class="plain"> (</span><span class="identifier">new_size</span><span class="plain"> < 2*</span><span class="identifier">FL</span><span class="plain">-</span><span class="element">>storage_capacity</span><span class="plain">) </span><span class="identifier">new_size</span><span class="plain"> = 2*</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">-</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">-</span><span class="element">>storage_used</span><span class="plain"> = 0;</span>
|
|
<span class="identifier">FL</span><span class="plain">-</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"> = &(</span><span class="identifier">FL</span><span class="plain">-</span><span class="element">>spare_storage</span><span class="plain">[</span><span class="identifier">FL</span><span class="plain">-</span><span class="element">>storage_used</span><span class="plain"> ++]);</span>
|
|
<span class="identifier">entry</span><span class="plain">-</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">-</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">-</span><span class="element">>prev_in_inl</span><span class="plain"> = </span><span class="identifier">FL</span><span class="plain">-</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">-</span><span class="element">>last_in_inl</span><span class="plain">) </span><span class="identifier">FL</span><span class="plain">-</span><span class="element">>last_in_inl</span><span class="plain">-</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">-</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">-</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">-</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>
|
|
|
|
<p class="endnote">The function Inter::Lists::new is used in 2/tw (<a href="2-tw.html#SP3">§3</a>), 3/iibf (<a href="3-iibf.html#SP1_4_4">§1.4.4</a>).</p>
|
|
|
|
<p class="endnote">The function Inter::Lists::add is used in 4/tpc5 (<a href="4-tpc5.html#SP2">§2</a>), 4/tpc6 (<a href="4-tpc6.html#SP2">§2</a>).</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-->
|
|
</body>
|
|
</html>
|
|
|