This repository was archived by the owner on Apr 21, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmemory_8hpp_source.html
96 lines (94 loc) · 79.9 KB
/
memory_8hpp_source.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.13"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>EOS.IO: contracts/eoslib/memory.hpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="eos-logo.png"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">EOS.IO
 <span id="projectnumber">DAWN3.0.1</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.13 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_ae9b15dd87e066e1908bbd90e8f38627.html">contracts</a></li><li class="navelem"><a class="el" href="dir_3fea0bf1ce879ce73e6ecec98007efcd.html">eoslib</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">memory.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="memory_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> </div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="preprocessor">#pragma once</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> </div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="preprocessor">#include <<a class="code" href="memory_8h.html">eoslib/memory.h</a>></span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="preprocessor">#include <<a class="code" href="print_8hpp.html">eoslib/print.hpp</a>></span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> </div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="keyword">namespace </span><a class="code" href="namespaceeosio.html">eosio</a> {</div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> </div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span>  <a class="code" href="group__memorycapi.html#gad8eef9133e11fe77cd34792771f81761">using ::memset</a>;</div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  <a class="code" href="group__memorycapi.html#ga59ed1449718a3c27f7622cb3efb845af">using ::memcpy</a>;</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div><div class="line"><a name="l00023"></a><span class="lineno"><a class="line" href="classeosio_1_1memory__manager.html"> 23</a></span>  <span class="keyword">class </span><a class="code" href="classeosio_1_1memory__manager.html">memory_manager</a> <span class="comment">// NOTE: Should never allocate another instance of memory_manager</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  {</div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="keyword">friend</span> <span class="keywordtype">void</span>* <a class="code" href="classeosio_1_1memory__manager.html#a8704c31c2d7a73953f3c1c320447c24a">malloc</a>(<a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> size);</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <span class="keyword">friend</span> <span class="keywordtype">void</span>* <a class="code" href="classeosio_1_1memory__manager.html#a8499edb5f09d8455c15c667c36abaac6">realloc</a>(<span class="keywordtype">void</span>* ptr, <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> size);</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keyword">friend</span> <span class="keywordtype">void</span> <a class="code" href="classeosio_1_1memory__manager.html#afbedc913aa4651b3c3b4b3aecd9b4711">free</a>(<span class="keywordtype">void</span>* ptr);</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00029"></a><span class="lineno"><a class="line" href="classeosio_1_1memory__manager.html#a1263e25250550298ba8408cce464a87c"> 29</a></span>  <a class="code" href="classeosio_1_1memory__manager.html#a1263e25250550298ba8408cce464a87c">memory_manager</a>()</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="comment">// NOTE: it appears that WASM has an issue with initialization lists if the object is globally allocated,</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="comment">// and seems to just initialize members to 0</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  : _heaps_actual_size(0)</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  , _active_heap(0)</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  , _active_free_heap(0)</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  {</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  }</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keyword">class </span>memory;</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  memory* next_active_heap()</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  {</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  memory* <span class="keyword">const</span> current_memory = _available_heaps + _active_heap;</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// make sure we will not exceed the 1M limit (needs to match wasm_interface.cpp _max_memory)</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">auto</span> remaining = 1024 * 1024 - <span class="keyword">reinterpret_cast<</span><a class="code" href="group__types.html#ga0d2e949ab6a1bb62f1b295cc79bc1f60">int32_t</a><span class="keyword">></span>(<a class="code" href="group__memorycapi.html#ga87ed00a8f774a9d36d650b80a36ad932">sbrk</a>(0));</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">if</span> (remaining <= 0)</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  {</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// ensure that any remaining unallocated memory gets cleaned up</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  current_memory->cleanup_remaining();</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  ++_active_heap;</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  _heaps_actual_size = _active_heap;</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  }</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> new_heap_size = remaining > _new_heap_size ? _new_heap_size : remaining;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordtype">char</span>* new_memory_start = <span class="keyword">static_cast<</span><span class="keywordtype">char</span>*<span class="keyword">></span>(<a class="code" href="group__memorycapi.html#ga87ed00a8f774a9d36d650b80a36ad932">sbrk</a>(new_heap_size));</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// if we can expand the current memory, keep working with it</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">if</span> (current_memory->expand_memory(new_memory_start, new_heap_size))</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">return</span> current_memory;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// ensure that any remaining unallocated memory gets cleaned up</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  current_memory->cleanup_remaining();</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  ++_active_heap;</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  memory* <span class="keyword">const</span> next = _available_heaps + _active_heap;</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  next->init(new_memory_start, new_heap_size);</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">return</span> next;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  }</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordtype">void</span>* <a class="code" href="classeosio_1_1memory__manager.html#a8704c31c2d7a73953f3c1c320447c24a">malloc</a>(<a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> size)</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  {</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">if</span> (size == 0)</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// see Note on ctor</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">if</span> (_heaps_actual_size == 0)</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  _heaps_actual_size = _heaps_size;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  adjust_to_mem_block(size);</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// first pass of loop never has to initialize the slot in _available_heap</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> needs_init = 0;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">char</span>* buffer = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  memory* current = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// need to make sure</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">if</span> (_active_heap < _heaps_actual_size)</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  {</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  memory* <span class="keyword">const</span> start_heap = &_available_heaps[_active_heap];</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// only heap 0 won't be initialized already</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">if</span>(_active_heap == 0 && !start_heap->is_init())</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  {</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  start_heap->init(_initial_heap, _initial_heap_size);</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  current = start_heap;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  }</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">while</span> (current != <span class="keyword">nullptr</span>)</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  {</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  buffer = current->malloc(size);</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// done if we have a buffer</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">if</span> (buffer != <span class="keyword">nullptr</span>)</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  current = next_active_heap();</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> </div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">if</span> (buffer == <span class="keyword">nullptr</span>)</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> end_free_heap = _active_free_heap;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">do</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  {</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  buffer = _available_heaps[_active_free_heap].malloc_from_freed(size);</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> </div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">if</span> (buffer != <span class="keyword">nullptr</span>)</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> </div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">if</span> (++_active_free_heap == _heaps_actual_size)</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  _active_free_heap = 0;</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> </div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  } <span class="keywordflow">while</span> (_active_free_heap != end_free_heap);</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">return</span> buffer;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  }</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> </div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordtype">void</span>* <a class="code" href="classeosio_1_1memory__manager.html#a8499edb5f09d8455c15c667c36abaac6">realloc</a>(<span class="keywordtype">void</span>* ptr, <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> size)</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  {</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">if</span> (size == 0)</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  {</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <a class="code" href="classeosio_1_1memory__manager.html#afbedc913aa4651b3c3b4b3aecd9b4711">free</a>(ptr);</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> </div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> REMOVE = size;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  adjust_to_mem_block(size);</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordtype">char</span>* realloc_ptr = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> orig_ptr_size = 0;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">if</span> (ptr != <span class="keyword">nullptr</span>)</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  {</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordtype">char</span>* <span class="keyword">const</span> char_ptr = <span class="keyword">static_cast<</span><span class="keywordtype">char</span>*<span class="keyword">></span>(ptr);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">for</span> (memory* realloc_heap = _available_heaps; realloc_heap < _available_heaps + _heaps_actual_size && realloc_heap->is_init(); ++realloc_heap)</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  {</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">if</span> (realloc_heap->is_in_heap(char_ptr))</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  {</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  realloc_ptr = realloc_heap->realloc_in_place(char_ptr, size, &orig_ptr_size);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">if</span> (realloc_ptr != <span class="keyword">nullptr</span>)</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">return</span> realloc_ptr;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  }</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  }</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordtype">char</span>* new_alloc = <span class="keyword">static_cast<</span><span class="keywordtype">char</span>*<span class="keyword">></span>(<a class="code" href="classeosio_1_1memory__manager.html#a8704c31c2d7a73953f3c1c320447c24a">malloc</a>(size));</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">if</span> (new_alloc == <span class="keyword">nullptr</span>)</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> copy_size = (size < orig_ptr_size) ? size : orig_ptr_size;</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">if</span> (copy_size > 0)</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  {</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <a class="code" href="group__memorycapi.html#ga59ed1449718a3c27f7622cb3efb845af">memcpy</a>(new_alloc, ptr, copy_size);</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <a class="code" href="classeosio_1_1memory__manager.html#afbedc913aa4651b3c3b4b3aecd9b4711">free</a> (ptr);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> </div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">return</span> new_alloc;</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> </div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordtype">void</span> <a class="code" href="classeosio_1_1memory__manager.html#afbedc913aa4651b3c3b4b3aecd9b4711">free</a>(<span class="keywordtype">void</span>* ptr)</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  {</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">if</span> (ptr == <span class="keyword">nullptr</span>)</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordtype">char</span>* <span class="keyword">const</span> char_ptr = <span class="keyword">static_cast<</span><span class="keywordtype">char</span>*<span class="keyword">></span>(ptr);</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">for</span> (memory* free_heap = _available_heaps; free_heap < _available_heaps + _heaps_actual_size && free_heap->is_init(); ++free_heap)</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  {</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">if</span> (free_heap->is_in_heap(char_ptr))</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  {</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  free_heap->free(char_ptr);</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  }</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  }</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordtype">void</span> adjust_to_mem_block(<a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a>& size)</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  {</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> remainder = (size + _size_marker) & _rem_mem_block_mask;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">if</span> (remainder > 0)</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  {</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  size += _mem_block - remainder;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  }</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  }</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> </div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">class </span>memory</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  {</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  memory()</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  : _heap_size(0)</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  , _heap(<span class="keyword">nullptr</span>)</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  , _offset(0)</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  {</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  }</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> </div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordtype">void</span> <a class="code" href="namespaceeosiosystem.html#a3ea5c4b8e36e422e6dd7f2e60ffd6fd4">init</a>(<span class="keywordtype">char</span>* <span class="keyword">const</span> mem_heap, <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> size)</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  {</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  _heap_size = size;</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  _heap = mem_heap;</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <a class="code" href="group__memorycapi.html#gad8eef9133e11fe77cd34792771f81761">memset</a>(_heap, 0, _heap_size);</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  }</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> </div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> is_init()<span class="keyword"> const</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">return</span> _heap != <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  }</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> is_in_heap(<span class="keyword">const</span> <span class="keywordtype">char</span>* <span class="keyword">const</span> ptr)<span class="keyword"> const</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* <span class="keyword">const</span> end_of_buffer = _heap + _heap_size;</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* <span class="keyword">const</span> first_ptr_of_buffer = _heap + _size_marker;</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">return</span> ptr >= first_ptr_of_buffer && ptr < end_of_buffer;</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  }</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> </div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> is_capacity_remaining()<span class="keyword"> const</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">return</span> _offset + _size_marker < _heap_size;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  }</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> </div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordtype">char</span>* <a class="code" href="classeosio_1_1memory__manager.html#a8704c31c2d7a73953f3c1c320447c24a">malloc</a>(<a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> size)</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  {</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> used_up_size = _offset + size + _size_marker;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">if</span> (used_up_size > _heap_size)</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  {</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> </div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  buffer_ptr new_buff(&_heap[_offset + _size_marker], size, _heap + _heap_size);</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  _offset += size + _size_marker;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  new_buff.mark_alloc();</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">return</span> new_buff.ptr();</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  }</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> </div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordtype">char</span>* malloc_from_freed(<a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> size)</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  {</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <a class="code" href="group__systemcapi.html#gae2a6ebaf48fe7c69f847ae18f109d09a">assert</a>(_offset == _heap_size, <span class="stringliteral">"malloc_from_freed was designed to only be called after _heap was completely allocated"</span>);</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> </div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordtype">char</span>* current = _heap + _size_marker;</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">while</span> (current != <span class="keyword">nullptr</span>)</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  {</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  buffer_ptr current_buffer(current, _heap + _heap_size);</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">if</span> (!current_buffer.is_alloc())</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  {</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">// done if we have enough contiguous memory</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">if</span> (current_buffer.merge_contiguous(size))</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  {</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  current_buffer.mark_alloc();</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">return</span> current;</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  }</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  current = current_buffer.next_ptr();</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  }</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> </div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">// failed to find any free memory</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  }</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> </div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordtype">char</span>* realloc_in_place(<span class="keywordtype">char</span>* <span class="keyword">const</span> ptr, <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> size, <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a>* orig_ptr_size)</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  {</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* <span class="keyword">const</span> end_of_buffer = _heap + _heap_size;</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  buffer_ptr orig_buffer(ptr, end_of_buffer);</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  *orig_ptr_size = orig_buffer.size();</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// is the passed in pointer valid</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordtype">char</span>* <span class="keyword">const</span> orig_buffer_end = orig_buffer.end();</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">if</span> (orig_buffer_end > end_of_buffer)</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  {</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  *orig_ptr_size = 0;</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  }</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> </div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">if</span> (ptr > end_of_buffer - size)</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  {</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="comment">// cannot resize in place</span></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> </div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keyword">const</span> <a class="code" href="group__types.html#ga0d2e949ab6a1bb62f1b295cc79bc1f60">int32_t</a> diff = size - *orig_ptr_size;</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">if</span> (diff < 0)</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  {</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="comment">// use a buffer_ptr to allocate the memory to free</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordtype">char</span>* <span class="keyword">const</span> new_ptr = ptr + size + _size_marker;</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  buffer_ptr excess_to_free(new_ptr, -diff, _heap + _heap_size);</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  excess_to_free.mark_free();</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> </div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">return</span> ptr;</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">// if ptr was the last allocated buffer, we can expand</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (orig_buffer_end == &_heap[_offset])</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  {</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  orig_buffer.size(size);</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  _offset += diff;</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> </div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">return</span> ptr;</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  }</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">if</span> (-diff == 0)</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">return</span> ptr;</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> </div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">if</span> (!orig_buffer.merge_contiguous_if_available(size))</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="comment">// could not resize in place</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> </div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  orig_buffer.mark_alloc();</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">return</span> ptr;</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  }</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> </div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordtype">void</span> <a class="code" href="classeosio_1_1memory__manager.html#afbedc913aa4651b3c3b4b3aecd9b4711">free</a>(<span class="keywordtype">char</span>* ptr)</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  {</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  buffer_ptr to_free(ptr, _heap + _heap_size);</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  to_free.mark_free();</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  }</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> </div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordtype">void</span> cleanup_remaining()</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  {</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">if</span> (_offset == _heap_size)</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> </div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// take the remaining memory and act like it was allocated</span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> size = _heap_size - _offset - _size_marker;</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  buffer_ptr new_buff(&_heap[_offset + _size_marker], size, _heap + _heap_size);</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  _offset = _heap_size;</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  new_buff.mark_free();</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  }</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordtype">bool</span> expand_memory(<span class="keywordtype">char</span>* exp_mem, <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> size)</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  {</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">if</span> (_heap + _heap_size != exp_mem)</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> </div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  _heap_size += size;</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> </div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  }</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span> </div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keyword">class </span>buffer_ptr</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  {</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  buffer_ptr(<span class="keywordtype">void</span>* ptr, <span class="keyword">const</span> <span class="keywordtype">char</span>* <span class="keyword">const</span> heap_end)</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  : _ptr(static_cast<char*>(ptr))</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  , _size(*reinterpret_cast<uint32_t*>(static_cast<char*>(ptr) - _size_marker) & ~_alloc_memory_mask)</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  , _heap_end(heap_end)</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  {</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  }</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> </div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  buffer_ptr(<span class="keywordtype">void</span>* ptr, <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> buff_size, <span class="keyword">const</span> <span class="keywordtype">char</span>* <span class="keyword">const</span> heap_end)</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  : _ptr(static_cast<char*>(ptr))</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  , _heap_end(heap_end)</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  {</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  size(buff_size);</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  }</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> </div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> size()<span class="keyword"> const</span></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">return</span> _size;</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  }</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> </div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordtype">char</span>* next_ptr()<span class="keyword"> const</span></div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordtype">char</span>* <span class="keyword">const</span> next = <a class="code" href="namespacestd.html#a32e349e93114238d72333a08f7ac044d">end</a>() + _size_marker;</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">if</span> (next >= _heap_end)</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span> </div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">return</span> next;</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  }</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> </div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordtype">void</span> size(<a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> val)</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  {</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="comment">// keep the same state (allocated or free) as was set before</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> memory_state = *<span class="keyword">reinterpret_cast<</span><a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a>*<span class="keyword">></span>(_ptr - _size_marker) & _alloc_memory_mask;</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  *<span class="keyword">reinterpret_cast<</span><a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a>*<span class="keyword">></span>(_ptr - _size_marker) = val | memory_state;</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  _size = val;</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  }</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> </div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordtype">char</span>* <a class="code" href="namespacestd.html#a32e349e93114238d72333a08f7ac044d">end</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordflow">return</span> _ptr + _size;</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> </div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordtype">char</span>* ptr()<span class="keyword"> const</span></div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keywordflow">return</span> _ptr;</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  }</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> </div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordtype">void</span> mark_alloc()</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  {</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  *<span class="keyword">reinterpret_cast<</span><a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a>*<span class="keyword">></span>(_ptr - _size_marker) |= _alloc_memory_mask;</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  }</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> </div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordtype">void</span> mark_free()</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  {</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  *<span class="keyword">reinterpret_cast<</span><a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a>*<span class="keyword">></span>(_ptr - _size_marker) &= ~_alloc_memory_mask;</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  }</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> </div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordtype">bool</span> is_alloc()<span class="keyword"> const</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">return</span> *<span class="keyword">reinterpret_cast<</span><span class="keyword">const </span><a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a>*<span class="keyword">></span>(_ptr - _size_marker) & _alloc_memory_mask;</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  }</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordtype">bool</span> merge_contiguous_if_available(<a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> needed_size)</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  {</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">return</span> merge_contiguous(needed_size, <span class="keyword">true</span>);</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  }</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> </div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordtype">bool</span> merge_contiguous(<a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> needed_size)</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  {</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordflow">return</span> merge_contiguous(needed_size, <span class="keyword">false</span>);</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  }</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordtype">bool</span> merge_contiguous(<a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> needed_size, <span class="keywordtype">bool</span> all_or_nothing)</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  {</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="comment">// do not bother if there isn't contiguious space to allocate</span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">if</span> (all_or_nothing && _heap_end - _ptr < needed_size)</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> </div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> possible_size = _size;</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">while</span> (possible_size < needed_size && (_ptr + possible_size < _heap_end))</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  {</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> next_mem_flag_size = *<span class="keyword">reinterpret_cast<</span><span class="keyword">const </span><a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a>*<span class="keyword">></span>(_ptr + possible_size);</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="comment">// if ALLOCed then done with contiguous free memory</span></div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keywordflow">if</span> (next_mem_flag_size & _alloc_memory_mask)</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> </div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  possible_size += (next_mem_flag_size & ~_alloc_memory_mask) + _size_marker;</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  }</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> </div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">if</span> (all_or_nothing && possible_size < needed_size)</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> </div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="comment">// combine</span></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> new_size = possible_size < needed_size ? possible_size : needed_size;</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  size(new_size);</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> </div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">if</span> (possible_size > needed_size)</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  {</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> freed_size = possible_size - needed_size - _size_marker;</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  buffer_ptr freed_remainder(_ptr + needed_size + _size_marker, freed_size, _heap_end);</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  freed_remainder.mark_free();</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  }</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> </div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">return</span> new_size == needed_size;</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  }</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> </div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keywordtype">char</span>* _ptr;</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> _size;</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* <span class="keyword">const</span> _heap_end;</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  };</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> </div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> _heap_size;</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordtype">char</span>* _heap;</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> _offset;</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  };</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> </div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> _size_marker = <span class="keyword">sizeof</span>(<a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a>);</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="comment">// allocate memory in 8 char blocks</span></div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> _mem_block = 8;</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> _rem_mem_block_mask = _mem_block - 1;</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> _initial_heap_size = 8192;<span class="comment">//32768;</span></div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> _new_heap_size = 65536;</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="comment">// if sbrk is not called outside of this file, then this is the max times we can call it</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> _heaps_size = 16;</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keywordtype">char</span> _initial_heap[_initial_heap_size];</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  memory _available_heaps[_heaps_size];</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> _heaps_actual_size;</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> _active_heap;</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> _active_free_heap;</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> _alloc_memory_mask = 1 << 31;</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  } <a class="code" href="group__memorycppapi.html#ga92fafed038dc971cb8742fce00f27b61">memory_heap</a>;</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> </div><div class="line"><a name="l00494"></a><span class="lineno"><a class="line" href="group__memorycppapi.html#gac4387e5dad9585f885c0c0bf8d353739"> 494</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span>* <a class="code" href="classeosio_1_1memory__manager.html#a8704c31c2d7a73953f3c1c320447c24a">malloc</a>(<a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> size)</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  {</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">return</span> <a class="code" href="group__memorycppapi.html#ga92fafed038dc971cb8742fce00f27b61">memory_heap</a>.<a class="code" href="classeosio_1_1memory__manager.html#a8704c31c2d7a73953f3c1c320447c24a">malloc</a>(size);</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  }</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span> </div><div class="line"><a name="l00512"></a><span class="lineno"><a class="line" href="group__memorycppapi.html#gac115b820d2ce5d099c809e9cdd547f04"> 512</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span>* <a class="code" href="classeosio_1_1memory__manager.html#a8499edb5f09d8455c15c667c36abaac6">realloc</a>(<span class="keywordtype">void</span>* ptr, <a class="code" href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a> size)</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  {</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">return</span> <a class="code" href="group__memorycppapi.html#ga92fafed038dc971cb8742fce00f27b61">memory_heap</a>.<a class="code" href="classeosio_1_1memory__manager.html#a8499edb5f09d8455c15c667c36abaac6">realloc</a>(ptr, size);</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  }</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> </div><div class="line"><a name="l00529"></a><span class="lineno"><a class="line" href="group__memorycppapi.html#gadc937e4380b5ab7212b4b603ccc516c5"> 529</a></span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classeosio_1_1memory__manager.html#afbedc913aa4651b3c3b4b3aecd9b4711">free</a>(<span class="keywordtype">void</span>* ptr)</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  {</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordflow">return</span> <a class="code" href="group__memorycppapi.html#ga92fafed038dc971cb8742fce00f27b61">memory_heap</a>.<a class="code" href="classeosio_1_1memory__manager.html#afbedc913aa4651b3c3b4b3aecd9b4711">free</a>(ptr);</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  }</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> }</div><div class="ttc" id="namespaceeosio_html"><div class="ttname"><a href="namespaceeosio.html">eosio</a></div><div class="ttdoc">Used to forward declare raw functions. </div><div class="ttdef"><b>Definition:</b> account.hpp:12</div></div>
<div class="ttc" id="group__systemcapi_html_gae2a6ebaf48fe7c69f847ae18f109d09a"><div class="ttname"><a href="group__systemcapi.html#gae2a6ebaf48fe7c69f847ae18f109d09a">assert</a></div><div class="ttdeci">void assert(uint32_t test, const char *cstr)</div><div class="ttdoc">Aborts processing of this action and unwinds all pending changes. </div></div>
<div class="ttc" id="print_8hpp_html"><div class="ttname"><a href="print_8hpp.html">print.hpp</a></div></div>
<div class="ttc" id="classeosio_1_1memory__manager_html_a8499edb5f09d8455c15c667c36abaac6"><div class="ttname"><a href="classeosio_1_1memory__manager.html#a8499edb5f09d8455c15c667c36abaac6">eosio::memory_manager::realloc</a></div><div class="ttdeci">friend void * realloc(void *ptr, uint32_t size)</div><div class="ttdoc">Allocate a block of memory. </div><div class="ttdef"><b>Definition:</b> memory.hpp:512</div></div>
<div class="ttc" id="memory_8h_html"><div class="ttname"><a href="memory_8h.html">memory.h</a></div></div>
<div class="ttc" id="group__memorycapi_html_ga59ed1449718a3c27f7622cb3efb845af"><div class="ttname"><a href="group__memorycapi.html#ga59ed1449718a3c27f7622cb3efb845af">memcpy</a></div><div class="ttdeci">void * memcpy(void *destination, const void *source, uint32_t num)</div><div class="ttdoc">Copy a block of memory from source to destination. </div></div>
<div class="ttc" id="namespacestd_html_a32e349e93114238d72333a08f7ac044d"><div class="ttname"><a href="namespacestd.html#a32e349e93114238d72333a08f7ac044d">std::end</a></div><div class="ttdeci">constexpr const E * end(initializer_list< E > il) noexcept</div></div>
<div class="ttc" id="group__types_html_ga06896e8c53f721507066c079052171f8"><div class="ttname"><a href="group__types.html#ga06896e8c53f721507066c079052171f8">uint32_t</a></div><div class="ttdeci">unsigned long uint32_t</div><div class="ttdef"><b>Definition:</b> types.h:19</div></div>
<div class="ttc" id="group__memorycppapi_html_ga92fafed038dc971cb8742fce00f27b61"><div class="ttname"><a href="group__memorycppapi.html#ga92fafed038dc971cb8742fce00f27b61">eosio::memory_heap</a></div><div class="ttdeci">class eosio::memory_manager memory_heap</div></div>
<div class="ttc" id="group__types_html_ga0d2e949ab6a1bb62f1b295cc79bc1f60"><div class="ttname"><a href="group__types.html#ga0d2e949ab6a1bb62f1b295cc79bc1f60">int32_t</a></div><div class="ttdeci">long int32_t</div><div class="ttdef"><b>Definition:</b> types.h:25</div></div>
<div class="ttc" id="group__memorycapi_html_ga87ed00a8f774a9d36d650b80a36ad932"><div class="ttname"><a href="group__memorycapi.html#ga87ed00a8f774a9d36d650b80a36ad932">sbrk</a></div><div class="ttdeci">void * sbrk(uint32_t num_bytes)</div><div class="ttdoc">Allocate page memory. </div></div>
<div class="ttc" id="group__memorycapi_html_gad8eef9133e11fe77cd34792771f81761"><div class="ttname"><a href="group__memorycapi.html#gad8eef9133e11fe77cd34792771f81761">memset</a></div><div class="ttdeci">void * memset(void *ptr, uint32_t value, uint32_t num)</div><div class="ttdoc">Fill a block of memory with the provided value. </div></div>
<div class="ttc" id="classeosio_1_1memory__manager_html_a8704c31c2d7a73953f3c1c320447c24a"><div class="ttname"><a href="classeosio_1_1memory__manager.html#a8704c31c2d7a73953f3c1c320447c24a">eosio::memory_manager::malloc</a></div><div class="ttdeci">friend void * malloc(uint32_t size)</div><div class="ttdoc">Allocate a block of memory. </div><div class="ttdef"><b>Definition:</b> memory.hpp:494</div></div>
<div class="ttc" id="classeosio_1_1memory__manager_html_a1263e25250550298ba8408cce464a87c"><div class="ttname"><a href="classeosio_1_1memory__manager.html#a1263e25250550298ba8408cce464a87c">eosio::memory_manager::memory_manager</a></div><div class="ttdeci">memory_manager()</div><div class="ttdef"><b>Definition:</b> memory.hpp:29</div></div>
<div class="ttc" id="classeosio_1_1memory__manager_html"><div class="ttname"><a href="classeosio_1_1memory__manager.html">eosio::memory_manager</a></div><div class="ttdef"><b>Definition:</b> memory.hpp:23</div></div>
<div class="ttc" id="classeosio_1_1memory__manager_html_afbedc913aa4651b3c3b4b3aecd9b4711"><div class="ttname"><a href="classeosio_1_1memory__manager.html#afbedc913aa4651b3c3b4b3aecd9b4711">eosio::memory_manager::free</a></div><div class="ttdeci">friend void free(void *ptr)</div><div class="ttdoc">Free a block of memory. </div><div class="ttdef"><b>Definition:</b> memory.hpp:529</div></div>
<div class="ttc" id="namespaceeosiosystem_html_a3ea5c4b8e36e422e6dd7f2e60ffd6fd4"><div class="ttname"><a href="namespaceeosiosystem.html#a3ea5c4b8e36e422e6dd7f2e60ffd6fd4">eosiosystem::init</a></div><div class="ttdeci">void init()</div><div class="ttdef"><b>Definition:</b> eosio.system.cpp:52</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.13
</small></address>
</body>
</html>