http://debianws.lexgopc.com/wiki143/index.php?action=history&feed=atom&title=Bounded_pointer 2026-10-26T02:23:03Z Revision history for this page on the wiki MediaWiki 1.43.1 http://debianws.lexgopc.com/wiki143/index.php?title=Bounded_pointer&diff=3793691&oldid=prev 2024-03-27T01:03:59Z

<p>tag as one source</p> <p><b>New page</b></p><div>{{one source |date=March 2024}}<br /> In [[computer science]], a &#039;&#039;&#039;bounded pointer&#039;&#039;&#039; is a [[pointer (computer programming)|pointer]] that is augmented with additional information that enable the storage bounds within which it may point to be deduced.&lt;ref&gt;{{Cite book|url=https://books.google.com/books?id=K4P32IpvyNMC|title=Understanding and Using C Pointers: Core Techniques for Memory Management|last=Reese|first=Richard|date=2013|publisher=O&#039;Reilly Media, Inc.|isbn=9781449344566|pages=167|language=en}}&lt;/ref&gt; This additional information sometimes takes the form of two pointers holding the upper and lower [[memory address|addresses]] of the storage occupied by the object to which the bounded pointer points.<br /> <br /> Use of bound information makes it possible for a [[compiler]] to generate code that performs [[bounds checking]], i.e. that tests if a pointer&#039;s value lies within the bounds prior to dereferencing the pointer or modifying the value of the pointer. If the bounds are violated some kind of [[exception (computing)|exception]] may be raised. This is especially useful for data constructs such as [[array data structure|arrays]] in [[C (programming language)|C]].<br /> <br /> ==See also==<br /> * [[Bounds-checking elimination]]<br /> * [[Smart pointer]]<br /> * [[Tagged pointer]]<br /> <br /> == References ==<br /> {{Reflist}}<br /> <br /> [[Category:Data types]]<br /> <br /> <br /> {{Compu-prog-stub}}</div>

imported>Jlwoodwa