Dead code: Difference between revisions

Revision as of 02:56, 3 February 2021

Revision as of 22:22, 25 May 2022

Line 1:

The term '''dead code''' has multiple definitions. Some use the term to refer to code (i.e. instructions in memory) which can never be executed at run-time.<ref>[https://www.cs.bu.edu/~hwxi/academic/papers/padl99.pdf Hongwei Xi, Dead Code Elimination through Dependent Types]</ref><ref>[http://www.do178site.com/do178b_questions.php] DO-178B</ref><ref>[[DO-178B]] Wikipedia/DO-178B.</ref>

The term '''dead code''' has multiple definitions.

In some areas of [[computer programming]], '''dead code''' is a section in the [[source code]] of a program which is executed but whose result is never used in any other computation.<ref>[http://doi.acm.org/10.1145/349214.349233 Debray, S. K., Evans, W., Muth, R., and De Sutter, B. 2000. Compiler techniques for code compaction. ACM Trans. Program. Lang. Syst. 22, 2 (Mar. 2000), 378-415378–415.]</ref><ref>[[Andrew Appel|Appel, A. W.]] 1998 Modern Compiler Implementation in Java. Cambridge University Press.</ref> The execution of dead code wastes computation time and memory.

Some use the term to refer to code (i.e. instructions in memory) which can never be executed at run-time.<ref>[https://www.cs.bu.edu/~hwxi/academic/papers/padl99.pdf Hongwei Xi, Dead Code Elimination through Dependent Types]</ref><ref>[http://www.do178site.com/do178b_questions.php] DO-178B</ref><ref>[[DO-178B]] Wikipedia/DO-178B.</ref>

In some areas of [[computer programming]], '''dead code''' is a section in the [[source code]] of a program which is executed but whose result is never used in any other computation.<ref>[http://doi.acm.org/10.1145/349214.349233 Debray, S. K., Evans, W., Muth, R., and De Sutter, B. 2000. Compiler techniques for code compaction. ACM Trans. Program. Lang. Syst. 22, 2 (Mar. 2000), 378-415.]</ref><ref>[[Andrew Appel|Appel, A. W.]] 1998 Modern Compiler Implementation in Java. Cambridge University Press.</ref> The execution of dead code wastes computation time and memory.

While the result of a dead computation may never be used, it may raise [[Exception handling|exceptions]] or affect some global state, thus removal of such code may change the output of the program and introduce unintended [[software bug|bugs]]. Compiler optimizations are typically conservative in their approach to dead -code removal if there is any ambiguity as to whether removal of the dead code will affect the program output. The programmer may aid the compiler in this matter by making additional use of [[Method (computer programming)#Static methods|static]] and/or [[Inline function|inline]] functions and enabling the use of [[link-time optimization]].

== Example ==

Line 20 ⟶ 19:

== Analysis ==

[[Dead -code elimination]] is a form of [[compiler optimization]] in which dead code is removed from a program. Dead code analysis can be performed using [[live variable analysis]], a form of [[static program analysis|static-code analysis]] and [[data -flow analysis]]. This is in contrast to unreachable code analysis which is based on [[control flow]] analysis|control-flow analysis]].

The dead -code elimination technique is in the same class of optimizations as [[unreachable code]] elimination and [[redundant code]] elimination.

In large programming projects, it is sometimes difficult to recognize and eliminate dead code, particularly when entire modules become dead. Test scaffolding can make it appear that the code is still live, and at times, contract language can require delivery of the code even when the code is no longer relevant.<ref>[[Douglas W. Jones]] [http://catless.com/Risks/8.19.html#subj2 Dead Code Maintenance, Risks 8.19 (Feb. 1, 1989)] {{Webarchive|url=https://web.archive.org/web/20110708124114/http://catless.com/Risks/8.19.html#subj2 |date=2011-07-08 }}</ref>

Line 30 ⟶ 29:

While most optimization techniques seek to remove dead code in an implementation, in extreme forms of optimization for size it may sometimes be desirable to deliberately introduce and carefully shape seemingly dead code, when it allows to fold otherwise unrelated code sections together (and thereby reduce their combined size) so that the extra code will effectively not harm the first path of execution through the code but is used to carry out the actions necessary for the alternative paths of execution, for which other sections of the code may become dead code. On a more functional level, this can be seen as both, artificially introduction of harmless/useful side-effects and reduction of the redundancy of the code, but it can also be used down to opcode level in order to allow the usage of shorter instructions, which would not be possible when folding code sequences without the concerted introduction of side-effects caused by the dead code.

== See also ==

* [[Dead -code elimination]]

* [[Redundant code]]

* [[Unreachable code]]

Line 38 ⟶ 37:

* ''0xDEADC0DE'' is a [[Magic number (programming)#Debug values|magic number]] written in [[Hexspeak]] used as a marker in [[OpenWrt|OpenWRT]] firmware

== References ==

{{Reflist}}