tristan/ZealOS
1
0
Fork 0
mirror of https://github.com/Zeal-Operating-System/ZealOS.git synced 2024-12-29 08:46:31 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions
ZealOS/docs/Demo/StackGrow.CC.html
TomAwezome 1b75d91002 Fix Mount AHCI Port selection. 
Add arg to SATARep to specify drive types to show.
Add checks in AHCIPortInit to verify port signatures, add helper method to get signatures from port.
2021-08-02 16:40:05 -04:00

81 lines
6.4 KiB
HTML
Executable file
Raw Blame History

<!DOCTYPE HTML>
<html>
<head>
<meta http-equiv="Content-Type" content="text/html;charset=US-ASCII">
<meta name="generator" content="ZealOS V0.13">
<style type="text/css">
body {background-color:#fef1f0;}
.cF0{color:#000000;background-color:#fef1f0;}
.cF1{color:#0148a4;background-color:#fef1f0;}
.cF2{color:#3b7901;background-color:#fef1f0;}
.cF3{color:#057c7e;background-color:#fef1f0;}
.cF4{color:#bb2020;background-color:#fef1f0;}
.cF5{color:#9e42ae;background-color:#fef1f0;}
.cF6{color:#b57901;background-color:#fef1f0;}
.cF7{color:#b2b6af;background-color:#fef1f0;}
.cF8{color:#555753;background-color:#fef1f0;}
.cF9{color:#678fbb;background-color:#fef1f0;}
.cFA{color:#82bc49;background-color:#fef1f0;}
.cFB{color:#0097a2;background-color:#fef1f0;}
.cFC{color:#e26a6a;background-color:#fef1f0;}
.cFD{color:#c671bc;background-color:#fef1f0;}
.cFE{color:#c7ab00;background-color:#fef1f0;}
.cFF{color:#fef1f0;background-color:#fef1f0;}
</style>
</head>
<body>
<pre style="font-family:monospace;font-size:12pt">
<a name="l1"></a><span class=cF9>I64</span><span class=cF0> Recurse(</span><span class=cF9>I64</span><span class=cF0> n)
<a name="l2"></a>{
<a name="l3"></a> </span><span class=cF1>if</span><span class=cF0> (n)
<a name="l4"></a> </span><span class=cF1>return</span><span class=cF0> </span><span class=cFE>1</span><span class=cF0> + </span><span class=cF5>CallStackGrow</span><span class=cF0>(</span><span class=cFE>0x800</span><span class=cF0>, </span><span class=cFE>0x1000000</span><span class=cF0>, &amp;Recurse, n - </span><span class=cFE>1</span><span class=cF0>);
<a name="l5"></a> </span><span class=cF1>else</span><span class=cF0>
<a name="l6"></a> </span><span class=cF1>return</span><span class=cF0> </span><span class=cFE>0</span><span class=cF0>;
<a name="l7"></a>}
<a name="l8"></a>
<a name="l9"></a></span><span class=cF9>I64</span><span class=cF0> Recurse2(</span><span class=cF9>I64</span><span class=cF0> n)
<a name="l10"></a>{
<a name="l11"></a> </span><span class=cF1>if</span><span class=cF0> (n)
<a name="l12"></a> </span><span class=cF1>return</span><span class=cF0> </span><span class=cFE>1</span><span class=cF0> + Recurse2(n - </span><span class=cFE>1</span><span class=cF0>);
<a name="l13"></a> </span><span class=cF1>else</span><span class=cF0>
<a name="l14"></a> </span><span class=cF1>return</span><span class=cF0> </span><span class=cFE>0</span><span class=cF0>;
<a name="l15"></a>}
<a name="l16"></a>
<a name="l17"></a></span><span class=cF9>I64</span><span class=cF0> Recurse3(</span><span class=cF9>I64</span><span class=cF0> n, </span><span class=cF9>I64</span><span class=cF0> lo, </span><span class=cF9>I64</span><span class=cF0> hi)
<a name="l18"></a>{
<a name="l19"></a> </span><span class=cF1>if</span><span class=cF0> (lo &lt;= n &lt; hi)
<a name="l20"></a> </span><span class=cF1>return</span><span class=cF0> </span><span class=cFE>1</span><span class=cF0> + Recurse3(n - </span><span class=cFE>1</span><span class=cF0>, lo, hi);
<a name="l21"></a> </span><span class=cF1>else</span><span class=cF0> </span><span class=cF1>if</span><span class=cF0> (n)
<a name="l22"></a> </span><span class=cF1>return</span><span class=cF0> Recurse3(n - </span><span class=cFE>1</span><span class=cF0>, lo, hi);
<a name="l23"></a> </span><span class=cF1>else</span><span class=cF0>
<a name="l24"></a> </span><span class=cF1>return</span><span class=cF0> </span><span class=cFE>0</span><span class=cF0>;
<a name="l25"></a>}
<a name="l26"></a>
<a name="l27"></a>#</span><span class=cF1>define</span><span class=cF0> DEPTH (</span><span class=cFE>2</span><span class=cF0> * </span><span class=cFE>1024</span><span class=cF0> * </span><span class=cFE>1024</span><span class=cF0>)
<a name="l28"></a>
<a name="l29"></a></span><span class=cF1>U0</span><span class=cF0> StackGrowDemo()
<a name="l30"></a>{
<a name="l31"></a> </span><span class=cF1>F64</span><span class=cF0> t0;
<a name="l32"></a>
<a name="l33"></a> t0 = </span><span class=cF5>tS</span><span class=cF0>;
<a name="l34"></a> </span><span class=cF6>&quot;%X:%X\n&quot;</span><span class=cF0>, DEPTH, Recurse(DEPTH);
<a name="l35"></a> </span><span class=cF6>&quot;Time:%7.5fs\n&quot;</span><span class=cF0>, </span><span class=cF5>tS</span><span class=cF0> - t0;
<a name="l36"></a>
<a name="l37"></a> </span><span class=cF2>//If you know the max stack ahead of time...</span><span class=cF0>
<a name="l38"></a> </span><span class=cF2>//Recurse2's stack is 16 because you have 1 arg,</span><span class=cF0>
<a name="l39"></a> </span><span class=cF2>//a return addr and no local variables.</span><span class=cF0>
<a name="l40"></a> t0 = </span><span class=cF5>tS</span><span class=cF0>;
<a name="l41"></a> </span><span class=cF6>&quot;%X:%X\n&quot;</span><span class=cF0>, DEPTH, </span><span class=cF5>CallStackGrow</span><span class=cF0>(DEPTH * </span><span class=cFE>16</span><span class=cF0> + </span><span class=cFE>0x800</span><span class=cF0>, DEPTH * </span><span class=cFE>16</span><span class=cF0> + </span><span class=cFE>0x800</span><span class=cF0>, &amp;Recurse2, DEPTH);
<a name="l42"></a> </span><span class=cF6>&quot;Time:%7.5fs\n&quot;</span><span class=cF0>, </span><span class=cF5>tS</span><span class=cF0> - t0;
<a name="l43"></a>
<a name="l44"></a> </span><span class=cF2>//</span><a href="https://zeal-operating-system.github.io/ZealOS/Kernel/KTask.CC.html#l129"><span class=cF4>CallStackGrow</span></a><span class=cF2>() works with multiple args.</span><span class=cF0>
<a name="l45"></a> t0 = </span><span class=cF5>tS</span><span class=cF0>;
<a name="l46"></a> </span><span class=cF6>&quot;%X:%X\n&quot;</span><span class=cF0>, DEPTH, </span><span class=cF5>CallStackGrow</span><span class=cF0>(DEPTH * </span><span class=cFE>32</span><span class=cF0> + </span><span class=cFE>0x800</span><span class=cF0>, DEPTH * </span><span class=cFE>32</span><span class=cF0> + </span><span class=cFE>0x800</span><span class=cF0>, &amp;Recurse3, DEPTH, </span><span class=cFE>1000</span><span class=cF0>, </span><span class=cFE>2000</span><span class=cF0>);
<a name="l47"></a> </span><span class=cF6>&quot;Time:%7.5fs\n&quot;</span><span class=cF0>, </span><span class=cF5>tS</span><span class=cF0> - t0;
<a name="l48"></a>}
<a name="l49"></a>
<a name="l50"></a>StackGrowDemo;
<a name="l51"></a>
<a name="l52"></a></span><span class=cF2>//Be careful because you can fragment memory.</span><span class=cF0>
</span></pre></body>
</html>
Reference in a new issue View git blame Copy permalink