Editing Infinite loop

{{Short description|Programming idiom}}
{{About-distinguish|the programming term|Infinite Loop (street)|Infinite Loop (book)}}
{{Redirect-distinguish|Endless loop|Endless Loop (album)}}
{{Loop constructs}}<!-- DO NOT remove. Discuss navigation concept at [[Talk:Do while loop#Helpbox experiment]] -->
In [[computer programming]], an '''infinite loop''' (or '''endless loop''')<ref>{{cite web
 |url=https://www.yourdictionary.com/endless-loop
 |title=Endless loop dictionary definition
 |access-date=2020-01-22
 |archive-date=2020-08-01
 |archive-url=https://web.archive.org/web/20200801213748/https://www.yourdictionary.com/endless-loop
 |url-status=live
 }}</ref><ref>{{cite web
 |url=https://whatis.techtarget.com/definition/infinite-loop-endless-loop
 |title=What is infinite loop (endless loop)
 |access-date=2020-01-22
 |archive-date=2019-07-15
 |archive-url=https://web.archive.org/web/20190715101446/https://whatis.techtarget.com/definition/infinite-loop-endless-loop
 |url-status=live
 }}</ref> is a sequence of instructions that, as written, will continue endlessly, unless an external intervention occurs, such as turning off power via a switch or pulling a plug. It may be intentional.

There is no general algorithm to determine whether a computer program contains an infinite loop or not; this is the [[halting problem]]. 

==Overview==
This differs from "a type of computer program that runs the same instructions continuously until it is either stopped or interrupted".<ref>{{cite news
 |work=[[The New York Times]]
 |url=https://archive.nytimes.com/www.nytimes.com/library/tech/99/08/biztech/articles/16digi.html
 |title=Overload of Hangers-On Creates Bumpy Ride for Internet Stocks
 |last=Caruso |first=Denise
 |date=August 16, 1999
 |access-date=December 27, 2019
 |archive-date=December 27, 2019
 |archive-url=https://web.archive.org/web/20191227145519/https://archive.nytimes.com/www.nytimes.com/library/tech/99/08/biztech/articles/16digi.html
 |url-status=live
 }}</ref> Consider the following [[pseudocode]]:
<syntaxhighlight lang="lua">
how_many = 0
while is_there_more_data() do
    how_many = how_many + 1
end
display "the number of items counted = " how_many
</syntaxhighlight>

''The same instructions'' were run ''continuously until it was stopped or interrupted'' . . . by the ''FALSE'' returned at some point by the function ''is_there_more_data''.

By contrast, the following loop will not end by itself:
<syntaxhighlight lang="lua">
birds = 1
fish = 2
while birds + fish > 1 do
    birds = 3 - birds
    fish = 3 - fish
end
</syntaxhighlight>

''birds'' will alternate being 1 or 2, while ''fish'' will alternate being 2 or 1. The loop will not stop unless an external intervention occurs ("pull the plug").

==Details==
An ''infinite loop'' is a sequence of instructions in a [[computer program]] which loops endlessly, either due to the [[control flow#Loops|loop]] having no terminating condition,<ref>{{cite magazine
 |magazine=Flow Journal
 |url=http://www.flowjournal.org/tag/loop-media/
 |title=Codes and Modes: The Character of Documentary Culture
 |quote=an infinite loop is one that lacks .. an exit condition
 |date=November 2014
 |access-date=2020-01-23
 |archive-date=2020-08-01
 |archive-url=https://web.archive.org/web/20200801213624/http://www.flowjournal.org/tag/loop-media/?print=print-search
 |url-status=live
 }}</ref> having one that can never be met, or one that causes the loop to start over. In older [[operating system]]s with [[cooperative multitasking]],<ref>also known as non-preemptive-multitasking: {{cite magazine
 |author=<!-- Unstated -->
 |magazine=[[PC Magazine]]
 |url=https://www.pcmag.com/encyclopedia/term/48051/non-preemptive-multitasking
 |title=Non-preemptive Multitasking
 |access-date=February 7, 2024
 |archive-date=July 26, 2019
 |archive-url=https://web.archive.org/web/20190726232111/https://www.pcmag.com/encyclopedia/term/48051/non-preemptive-multitasking
 |url-status=live
 }}</ref> infinite loops normally caused the entire system to become unresponsive. With the now-prevalent preemptive multitasking model, infinite loops usually cause the program to consume all available processor time, but can usually be terminated by a user. [[Busy waiting|Busy wait]] loops are also sometimes called "infinite loops". Infinite loops are one possible cause for a computer [[Hang (computing)|hanging or freezing]]; others include [[Thrashing (computer science)|thrashing]], [[deadlock (computer science)|deadlock]], and [[segmentation fault|access violation]]s.

==Intended vs unintended looping==
Looping is repeating a set of instructions until a specific condition is met. An infinite loop occurs when the condition will never be met due to some inherent characteristic of the loop.

===Intentional looping===
There are a few situations when this is desired behavior. For example, the games on cartridge-based game consoles typically have no exit condition in their main loop, as there is no operating system for the program to exit to; the loop runs until the console is powered off.

Modern interactive computers require that the computer constantly be monitoring for user input or device activity, so at some fundamental level there is an infinite processing [[idle loop]] that must continue until the device is turned off or reset. In the [[Apollo Guidance Computer]], for example, this outer loop was contained in the Exec program,<ref>{{cite web
 |url=http://klabs.org/history/history_docs/mit_docs/1711.pdf
 |title=The History of Apollo On-board Guidance, Navigation, and Control
 |author=David Hoag
 |date=September 1976
 |publisher=Charles Stark Draper Laboratory
 |access-date=2020-01-23
 |archive-date=2016-11-05
 |archive-url=https://web.archive.org/web/20161105060425/http://klabs.org/history/history_docs/mit_docs/1711.pdf
 |url-status=live
 }}</ref> and if the computer had absolutely no other work to do, it would loop run a dummy job that would simply turn off the "computer activity" indicator light.

Modern computers also typically do not halt the processor or motherboard circuit-driving clocks when they crash. Instead they fall back to an error condition displaying messages to the operator (such as the [[blue screen of death]]), and enter an infinite loop waiting for the user to either respond to a prompt to continue, or reset the device.

==== Spinlocks ====
[[Spinlock|Spinlocks]] are low-level synchronization mechanisms used in concurrent programming to protect shared resources. Unlike traditional locks that put a thread to sleep when it can't acquire the lock, spinlocks repeatedly "spin" in an infinite loop until the lock becomes available. This intentional infinite looping is a deliberate design choice aimed at minimizing the time a thread spends waiting for the lock and avoiding the overhead of higher level synchronisation mechanisms such as [[Lock (computer science)|mutexes]].

====Multi-threading====
In multi-threaded programs some threads can be executing inside infinite loops without causing the entire program to be stuck in an infinite loop. If the main thread exits, all threads of the process are forcefully stopped, thus all execution ends and the process/program terminates. The threads inside the infinite loops can perform "housekeeping" tasks or they can be in a blocked state waiting for input (from socket/queue) and resume execution every time input is received.

===Unintentional looping===
[[File:Infinite loop BSOD.jpg|thumb|A [[blue screen of death]] on [[Windows XP]]. "The [[device driver]] got stuck in an infinite loop."]]
Most often, the term is used for those situations when this is not the intended result; that is, when this is a [[software bug|bug]].<ref>{{cite web
 |url=https://nyxcrossword.com/2013/10/1013-13-new-york-times-crossword.html
 |title=New York Times Crossword Answers
 |quote=computing .. a defect .. which .. to loop
 |date=October 13, 2013
 |access-date=January 22, 2020
 |archive-date=August 2, 2020
 |archive-url=https://web.archive.org/web/20200802040416/https://nyxcrossword.com/2013/10/1013-13-new-york-times-crossword.html
 |url-status=live
 }}</ref> Such errors are most common by novice programmers, but can be made by experienced programmers also, because their causes can be quite subtle.

One common cause, for example, is that a programmer intends to iterate over sequence of nodes in a [[data structure]] such as a [[linked list]] or [[Tree (data structure)|tree]], executing the loop code once for each node. Improperly formed links can create a ''reference loop'' in the data structure, where one node links to another that occurs earlier in the sequence. This makes part of the data structure into a [[Ring (data structure)|ring]], causing naive code to loop forever.

While most infinite loops can be found by close inspection of the code, there is no general method to determine whether a given program will ever halt or will run forever; this is the [[undecidable problem|undecidability]] of the [[halting problem]].<ref>{{cite web|url=https://www.geeksforgeeks.org/halting-problem-in-theory-of-computation|title=Halting Problem in Theory of Computation|date=3 October 2018|access-date=22 January 2020|archive-date=9 August 2020|archive-url=https://web.archive.org/web/20200809100104/https://www.geeksforgeeks.org/halting-problem-in-theory-of-computation/|url-status=live}}</ref>

==Interruption==
As long as the system is responsive, infinite loops can often be interrupted by sending a signal to the process (such as [[SIGINT (POSIX)|SIGINT]] in Unix), or an [[interrupt]] to the processor, causing the current process to be aborted. This can be done in a [[task manager]], in a terminal with the [[Control-C]] command,<ref>{{cite web
 |url=https://pen-testing.sans.org/resources/papers/gcih/buffer-overflow-exploit-dameware-remote-control-software-104168
 |title=A Buffer Overflow Exploit Against the DameWare Remote Control software
 |quote=As soon as the command shell is closed with a control-c combination ...
 |date=December 19, 2003
 |access-date=January 22, 2020
 |archive-date=July 24, 2020
 |archive-url=https://web.archive.org/web/20200724200739/https://pen-testing.sans.org/resources/papers/gcih/buffer-overflow-exploit-dameware-remote-control-software-104168
 |url-status=live
 }}</ref> or by using the [[Kill (command)|kill]] command or [[system call]]. However, this does not always work, as the process may not be responding to signals or the processor may be in an uninterruptible state, such as in the [[Cyrix coma bug]] (caused by overlapping uninterruptible instructions in an [[instruction pipeline]]). In some cases other signals such as [[SIGKILL]] can work, as they do not require the process to be responsive, while in other cases the loop cannot be terminated short of system shutdown.

==Language support==
{{see also|Control flow}}
Infinite loops can be implemented using various [[control flow]] constructs. Most commonly, in unstructured programming this is jump back up ([[goto]]), while in structured programming this is an indefinite loop (while loop) set to never end, either by omitting the condition or explicitly setting it to true, as <code>while (true) ...</code>.

Some languages have special constructs for infinite loops, typically by omitting the condition from an indefinite loop. Examples include Ada (<code>loop ... end loop</code>),<ref>[[b:Ada Programming/Control#Endless Loop|Ada Programming: Control: Endless Loop]]</ref> Fortran (<code>DO ... END DO</code>), Go (<code>for { ... }</code>), Ruby (<code>loop do ... end</code>), and Rust (<code>loop { ... }</code>).

==Examples of intentional infinite loops==
A simple example (in [[C (programming language)|C]]):

<syntaxhighlight lang="c">
#include <stdio.h>

int main()
{
  for (;;) // or equivalently, while (1)
    printf("Infinite Loop\n");  
  return 0;
}
</syntaxhighlight>
The form <code>for (;;)</code> for an infinite loop is traditional, appearing in the standard reference ''[[The C Programming Language]]'', and is often punningly pronounced "forever".<ref>{{Cite web |url=https://stackoverflow.com/questions/20186809/endless-loop-in-c-c |title=Endless loop in C/C++ |url-status=live |archive-url=https://web.archive.org/web/20160803202212/http://stackoverflow.com/questions/20186809/endless-loop-in-c-c |archive-date=2016-08-03}}</ref>

This is a loop that will print "Infinite Loop" without halting.

A similar example in 1980s-era [[BASIC programming language|BASIC]]:
<syntaxhighlight lang="basic">
10 PRINT "INFINITE LOOP"
20 GOTO 10
</syntaxhighlight>

A similar example in [[MS-DOS]] compatible batch files:
<syntaxhighlight lang="bat">
:A
echo Infinite Loop
goto :A
</syntaxhighlight>

In [[Java (programming language)|Java]]:
<syntaxhighlight lang="java">
while (true) {
    System.out.println("Infinite Loop");
}
</syntaxhighlight>

The while loop never terminates because its condition is always true.

In [[Bourne Again Shell]]:
<syntaxhighlight lang="bash">
for ((;;)); do
	echo "Infinite Loop"
done
</syntaxhighlight>

In [[Rust (programming language)|Rust]]:
<syntaxhighlight lang="rust">
loop {
    println!("Infinite loop");
}
</syntaxhighlight>

==Examples of unintentional infinite loops==

===Mathematical errors===
Here is one example of an infinite loop in [[Visual Basic]]:
<syntaxhighlight lang=vbnet>
dim x as integer
do while x < 5
  x = 1
  x = x + 1
loop

</syntaxhighlight>
This creates a situation where <code>x</code> will never be greater than 5, since at the start of the loop code, <code>x</code> is assigned the value of 1 (regardless of any previous value) before it is changed to <code>x</code> + 1. Thus the loop will always result in <code>x</code> = 2 and will never break. This could be fixed by moving the <code>x = 1</code> instruction outside the loop so that its initial value is set only once.

In some languages, programmer confusion about mathematical symbols may lead to an unintentional infinite loop. For example, here is a snippet in [[C (programming language)|C]]:
<syntaxhighlight lang=c>
#include <stdio.h>

int main(void)
{
   int a = 0;
   while (a < 10) {
      printf("%d\n", a);
      if (a = 5)
         printf("a equals 5!\n");
      a++;
   }
   return 0;
}
</syntaxhighlight>

The expected output is the numbers 0 through 9, with an interjected "a equals 5!" between 5 and 6. However, in the line "<code>if (a = 5)</code>" above, the = (assignment) operator was confused with the == (equality test) operator. Instead, this will assign the value of 5 to <code>a</code> at this point in the program. Thus, <code>a</code> will never be able to advance to 10, and this loop cannot terminate.

===Rounding errors===
{| style="float:right; border: 1px solid grey;"
|-
| ''C output on an [[AMD Turion]] processor:''
|- 
|x = 0.10000000149011611938      
|- 
|x = 0.20000000298023223877      
|- 
|x = 0.30000001192092895508      
|- 
|x = 0.40000000596046447754      
|- 
|x = 0.50000000000000000000      
|- 
|x = 0.60000002384185791016      
|- 
|x = 0.70000004768371582031      
|- 
|x = 0.80000007152557373047      
|- 
|x = 0.90000009536743164062      
|- 
|x = 1.00000011920928955078      
|- 
|x = 1.10000014305114746094      
|- 
|x = 1.20000016689300537109      
|- 
| ...
|}

Unexpected behavior in evaluating the terminating condition can also cause this problem. Here is an example in [[C (programming language)|C]]:

<syntaxhighlight lang="c">
float x = 0.1;
while (x != 1.1) {
  printf("x = %22.20f\n", x);
  x += 0.1;
}
</syntaxhighlight>

On some systems, this loop will execute ten times as expected, but on other systems it will never terminate. The problem is that the loop terminating condition <code>(x != 1.1)</code> tests for exact equality of two [[floating point]] values, and the way floating point values are represented in many computers will make this test fail, because they cannot represent the value 0.1 exactly, thus introducing rounding errors on each increment (cf. box).

The same can happen in [[Python (programming language)|Python]]:
<syntaxhighlight lang="python">
x = 0.1
while x != 1:
    print(x)
    x += 0.1
</syntaxhighlight>

Because of the likelihood of tests for equality or not-equality failing unexpectedly, it is safer to use greater-than or less-than tests when dealing with floating-point values. For example, instead of testing whether <code>x</code> equals 1.1, one might test whether <code>(x <= 1.0)</code>, or <code>(x < 1.1)</code>, either of which would be certain to exit after a finite number of iterations. Another way to fix this particular example would be to use an [[integer (computer science)|integer]] as a [[control flow|loop index]], counting the number of iterations that have been performed.

A similar problem occurs frequently in [[numerical analysis]]: in order to compute a certain result, an iteration is intended to be carried out until the error is smaller than a chosen tolerance. However, because of rounding errors during the iteration, the specified tolerance can never be reached, resulting in an infinite loop.

==Multi-party loops==
An infinite loop may be caused by several entities interacting. Consider a server that always replies with an error message if it does not understand the request. Even if there is no possibility for an infinite loop within the server itself, a system comprising two of them (''A'' and ''B'') may loop endlessly: if ''A'' receives a message of unknown type from ''B'', then ''A'' replies with an error message to ''B''; if ''B'' does not understand the error message, it replies to ''A'' with its own error message; if ''A'' does not understand the error message from ''B'', it sends yet another error message, and so on.

One common example of such situation is an email loop. An example of an email loop is if someone receives mail from a no reply inbox, but their auto-response is on. They will reply to the no reply inbox, triggering the "this is a no reply inbox" response. This will be sent to the user, who then sends an auto reply to the no-reply inbox, and so on and so forth.

==Pseudo-infinite loops==
A pseudo-infinite loop is a loop that appears infinite but is really just a very long loop.

===Very large numbers===
An example in [[Bash (Unix shell)|bash]]:
<syntaxhighlight lang="bash">
for x in $(seq 1000000000); do
#loop code
done
</syntaxhighlight>

===Impossible termination condition===
An example [[for loop]] in [[C (programming language)|C]]:
<syntaxhighlight lang="c">
unsigned int i;
for (i = 1; i != 0; i++) {
  /* loop code */
}
</syntaxhighlight>
It appears that this will go on indefinitely, but in fact the value of <code>i</code> will eventually reach the maximum value storable in an <code>unsigned int</code> and adding 1 to that number will wrap-around to 0, breaking the loop. The actual limit of <code>i</code> depends on the details of the system and [[compiler]] used. With [[arbitrary-precision arithmetic]], this loop would continue until the computer's [[memory (computers)|memory]] could no longer hold <code>i</code>. If <code>i</code> was a signed integer, rather than an unsigned integer, overflow would be undefined. In this case, the compiler could optimize the code into an infinite loop.

===Infinite recursion===
{{Main|Recursion (computer science)#Infinite recursion}}
Infinite recursion is a special case of an infinite loop that is caused by [[recursion (computer science)|recursion]]. 

The following example in [[Visual Basic for Applications]] (VBA) returns a [[stack overflow]] error:
<syntaxhighlight lang="vbscript">
Sub Test1()
    Call Test1
End Sub
</syntaxhighlight>

===Break statement===
A "<code>while (true)</code>" loop looks infinite at first glance, but there may be a way to escape the loop through a [[break statement]] or [[return statement]].
Example in [[PHP]]:
<syntaxhighlight lang="php">
while (true) {
    if ($foo->bar()) {
        return;
    }
}
</syntaxhighlight>

===Alderson loop===
''Alderson loop'' is a rare slang or [[The Jargon File|jargon]] term for an infinite loop where there is an exit condition available, but inaccessible in an implementation of the code, typically due to a programmer error. These are most common and visible while [[debugging]] [[user interface]] code.

A C-like pseudocode example of an Alderson loop, where the program is supposed to sum numbers given by the user until zero is given, but where the wrong operator is used:
<syntaxhighlight lang="C">
int sum = 0;
int i;
while (true) {
   printf("Input a number to add to the sum or 0 to quit");
   i = getUserInput();
   if (i * 0) { // if i times 0 is true, add i to the sum. Note: ZERO means FALSE, Non-Zero means TRUE. "i * 0" is ZERO (FALSE)!
      sum += i; // sum never changes because (i * 0) is 0 for any i; it would change if we had != in the condition instead of *
   }
   if (sum > 100) {
      break;    // terminate the loop; exit condition exists but is never reached because sum is never added to
   }
}
</syntaxhighlight>

The term allegedly received its name from a programmer (whose last name is Alderson) who in 1996<ref>{{cite web
 |url=https://www.lee-dohm.com/2013/05/24/alderson-loop
 |title=Alderson loop
 |author=Lee Dohm
 |date=May 24, 2013
 |access-date=January 22, 2020
 |archive-date=June 19, 2020
 |archive-url=https://web.archive.org/web/20200619200434/https://www.lee-dohm.com/2013/05/24/alderson-loop/
 |url-status=live
 }}</ref> had coded a [[modal window|modal]] [[dialog box]] in [[Microsoft Access]] without either an OK or Cancel button, thereby disabling the entire program whenever the box came up.<ref>{{Cite web |url=http://www.catb.org/~esr/jargon/html/A/Alderson-loop.html |title=Alderson Loop |website=[[The Jargon File]], Version 4.4.7 |url-status=live |archive-url=https://web.archive.org/web/20060515053043/http://www.catb.org/~esr/jargon/html/A/Alderson-loop.html |archive-date=2006-05-15 |access-date=2006-05-21}}</ref>

==See also==
{{portal|Mathematics}}
*[[Cycle detection]]
*[[Divergence (computer science)]]
*[[Fork bomb]] (an infinite loop is one of two key components)
*[[Infinite regress]]

==References==
{{Reflist}}

==External links==
* [http://www.programming-idioms.org/idiom/50/make-an-infinite-loop Make an infinite loop] in several languages, on [http://www.programming-idioms.org/ programming-idioms.org].

{{DEFAULTSORT:Infinite Loop}}
[[Category:Control flow]]
[[Category:Iteration in programming]]
[[Category:Programming language comparisons]]
[[Category:Recursion]]<!-- Not directly relevant -->
[[Category:Software bugs]]
<!-- Hidden categories below -->
[[Category:Articles with example BASIC code]]
[[Category:Articles with example C code]]
[[Category:Articles with example Java code]]
[[Category:Articles with example PHP code]]
[[Category:Articles with example Python (programming language) code]]
[[Category:Articles with example Rust code]]