About: Tombstone (programming)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Tombstone (programming) Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatProgrammingConstructs, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FTombstone_%28programming%29&invfp=IFP_OFF&sas=SAME_AS_OFF

Tombstones are a mechanism to detect dangling pointers and mitigate the problems they can cause in computer programs. Dangling pointers can appear in certain computer programming languages, e.g. C, C++ and assembly languages. In more generalized terms, a tombstone can be understood as a marker for "this data is no longer here". For example, in filesystems it may be efficient when deleting files to mark them as "dead" instead of immediately reclaiming all their data blocks.

Attributes	Values
rdf:type	Thing language schema:Language Language Programming language yago:Abstraction100002137 yago:Cognition100023271 yago:Concept105835747 yago:Content105809192 yago:Idea105833840 yago:PsychologicalFeature100023100 organisation programming language yago:WikicatProgrammingConstructs
rdfs:label	Tombstone (programming) (en)
rdfs:comment	Tombstones are a mechanism to detect dangling pointers and mitigate the problems they can cause in computer programs. Dangling pointers can appear in certain computer programming languages, e.g. C, C++ and assembly languages. In more generalized terms, a tombstone can be understood as a marker for "this data is no longer here". For example, in filesystems it may be efficient when deleting files to mark them as "dead" instead of immediately reclaiming all their data blocks. (en)
dcterms:subject	Programming constructs
Wikipage page ID	2923260 (xsd:integer)
Wikipage revision ID	1091116062 (xsd:integer)
Link from a Wikipage to another Wikipage	Debugging Null pointer Dangling pointer Pointer (computer programming) C++ C (programming language) Locks-and-keys Dynamic memory allocation Central processing unit Handle (computing) Assembly language Programming constructs Operating system Programming language Random access memory Filesystems Computational overhead
sameAs	Tombstone (programming) Tombstone (programming) Tombstone (programming) Tombstone (programming)
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Compu-lang-stub
has abstract	Tombstones are a mechanism to detect dangling pointers and mitigate the problems they can cause in computer programs. Dangling pointers can appear in certain computer programming languages, e.g. C, C++ and assembly languages. A tombstone is a structure that acts as an intermediary between a pointer and its target, often heap-dynamic data in memory. The pointer – sometimes called the handle – points only at tombstones and never to its actual target. When the data is deallocated, the tombstone is set to a null (or, more generally, to a value that is illegal for a pointer in the given runtime environment), indicating that the variable no longer exists. This mechanism prevents the use of invalid pointers, which would otherwise access the memory area that once belonged to the now deallocated variable, although it may already contain other data, in turn leading to corruption of in-memory data. Depending on the operating system, the CPU can automatically detect such an invalid access (e.g. for the null value: a null pointer dereference error). This supports in analyzing the actual reason, a programming error, in debugging, and it can also be used to abort the program in production use, to prevent it from continuing with invalid data structures. In more generalized terms, a tombstone can be understood as a marker for "this data is no longer here". For example, in filesystems it may be efficient when deleting files to mark them as "dead" instead of immediately reclaiming all their data blocks. The downsides of using tombstones include a computational overhead and additional memory consumption: extra processing is necessary to follow the path from the pointer to data through the tombstone, and extra memory is necessary to retain tombstones for every pointer throughout the program. One other problem is that all the code that needs to work with the pointers in question needs to be implemented to use the tombstone mechanism. No popular programming language currently uses tombstones. However, built–in support by the programming language or the compiler is not necessary to use them. (en)
gold:hypernym	Mechanism
prov:wasDerivedFrom	wikipedia-en:Tombstone_(programming)?oldid=1091116062&ns=0
page length (characters) of wiki page	3547 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Tombstone_(programming)
is Link from a Wikipage to another Wikipage of	Microsoft Sync Framework Concurrent hash table Dangling pointer Locks-and-keys Handle (computing) Tombstone (disambiguation)
is Wikipage disambiguates of	Tombstone (disambiguation)
is foaf:primaryTopic of	wikipedia-en:Tombstone_(programming)

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 53 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software