https://trust-lang.net/en/docs/safety/ Recent content in Guarantees and safety on TrustLang Hugo en https://trust-lang.net/en/docs/safety/memory/ Mon, 01 Jan 0001 00:00:00 +0000 https://trust-lang.net/en/docs/safety/memory/ <p>No single memory management approach is the best or universal: different approaches win under different conditions:</p> <ul> <li>Manual memory management can do anything, except one thing — guarantee the absence of errors.</li> <li>Ownership and borrowing analysis at compile time makes it possible to prove the correctness of code without additional runtime checks, but some scenarios and algorithms cannot be proven statically at compile time.</li> <li>Counting strong and weak references at runtime is convenient for shared ownership, but has a non-zero cost and does not protect against cyclic and cross dependencies.</li> <li>Garbage collection simplifies working with complex cyclic structures, but has the most expensive overhead and non-deterministic execution.</li> <li>None of the listed memory management approaches includes the issues of inter-thread memory access synchronization.</li> </ul> <p>Therefore, choosing only one memory management approach in a programming language means deliberately limiting its capabilities and adding unnecessary overhead. For these reasons, the memory management concept of <em>TrustLang</em> allows extending the implementation of the memory management model with minimal impact on the language syntax and is defined by the requirements (guarantees) for working with memory.</p> https://trust-lang.net/en/docs/safety/stack_check/ Mon, 01 Jan 0001 00:00:00 +0000 https://trust-lang.net/en/docs/safety/stack_check/ <p><em>TrustLang</em> has built-in <a href="https://github.com/afteri-ru/stack-check">stack overflow protection</a>. Before calling a protected function, the free space on the thread stack is checked, and if it is insufficient — instead of abnormal termination of the whole application (<code>segmentation fault</code>), a <strong>program exception <code>stack_overflow</code></strong> is created, which can be caught and handled inside the application, after which program execution continues.</p> <p>A detailed description of the implementation and usage methods will be here.</p> <p>For now you can look at usage examples: <a href="https://trust-lang.net/en/playground/?file=fibonacci">recursive computation of Fibonacci numbers</a> and <a href="https://trust-lang.net/en/playground/?file=prime">recursive primality check</a></p>