- Memory Models: x86 is TSO, TSO is Good - 1 Update
- I correct a typo, read again - 1 Update
- About memory safety and memory leaks in programming languages.. - 1 Update
| Horizon68 <horizon@horizon.com>: Oct 05 01:26PM -0700 Hello.. Read the following interesting webpage: Memory Models: x86 is TSO, TSO is Good Essentially, the conclusion is that x86 in practice implements the old SPARC TSO memory model. The big take-away from the talk for me is that it confirms the observation made may times before that SPARC TSO seems to be the optimal memory model. It is sufficiently understandable that programmers can write correct code without having barriers everywhere. It is sufficiently weak that you can build fast hardware implementation that can scale to big machines. Read more here: https://jakob.engbloms.se/archives/1435 Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: Oct 12 02:46PM -0700 Hello, I correct a typo, read again: About memory safety and memory leaks in programming languages.. Memory safety is the state of being protected from various software bugs and security vulnerabilities when dealing with memory access, such as buffer overflows and dangling pointers. I am also working with Delphi and FreePascal and C++, and as you have noticed i have invented a scalable reference counting with efficient support for weak references that is really powerful, read about it and download it from here(it is the Delphi and FreePascal implementation): https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references And you have to understand that this invention of mine solves the problem of dangling pointers and it solves the problem of memory leaks and this reference counting of mine is also "scalable", and i think that this invention of mine is the only one that you will find, and you will not find it in C++ and you will not find it in Rust. Also Delphi and FreePascal solves the out of bounds in arrays and strings like this by making range checks enabled: In the {$R+} state, all array and string-indexing expressions are verified as being within the defined bounds, and all assignments to scalar and subrange variables are checked to be within range. **If a range check fails, an ERangeError exception is raised (or the program is terminated if exception handling is not enabled). Range Checks is OFF by default. To enable it, you can add this directive to your code: {$RANGECHECKS ON} So i think that with my invention above and with all my other inventions that are my scalable algorithms and there implementations and such in C++ and Delphi and FreePascal that you will find in my following website, Delphi and FreePascal have become powerful: https://sites.google.com/site/scalable68/ Thank you, Amine Moulay Ramdane. |
| Horizon68 <horizon@horizon.com>: Oct 12 02:29PM -0700 Hello... About memory safety and memory leaks in programming languages.. Memory safety is the state of being protected from various software bugs and security vulnerabilities when dealing with memory access, such as buffer overflows and dangling pointers. I am also working with Delphi and FreePascal and C++, and as you have noticed i have invented a scalable reference counting with efficient support for weak references that is really powerful, read about it and download it from here(it is the Delphi and FreePascal implementation): https://sites.google.com/site/scalable68/scalable-reference-counting-with-efficient-support-for-weak-references And you have to understand that this invention of mine solves the problem of dangling pointers and it solves the problem of memory leaks and this reference counting of mine is also "scalable", and i think that this invention of mine is the only one that you will find, and you will not find it in C++ and you will not find it in Rust. Also Delphi and FreePascal solves the out of bounds in arrays and strings like this by making range checks enabled: In the {$R+} state, all array and string-indexing expressions are verified as being within the defined bounds, and all assignments to scalar and subrange variables are checked to be within range. **If a range check fails, an ERangeError exception is raised (or the program is terminated if exception handling is not enabled). Range Checks is OFF by default. To enable it, you can add this directive to your code: {$RANGECHECKS ON} So i think that with my invention above and with all my other inventions that are my scalable algorithms and there implementations and such in C++ and Delphi and FreePascal that you will in my following website, Delphi and FreePascal have become powerful: https://sites.google.com/site/scalable68/ Thank you, Amine Moulay Ramdane. |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com. |
No comments:
Post a Comment