Exception handling is a programming language construct or computer hardware mechanism designed to handle the occurrence of some condition that changes the normal flow of execution. For signaling conditions that are part of the normal flow of execution see the concepts of signal and event handler. Signal programming is often used in the same sense as Event-driven programming. In computer programming an event handler is an asynchronous callback subroutine that handles inputs received in a program
In general, current state will be saved in a predefined location and execution will switch to a predefined handler. In Computer science, a subroutine ( function, method, procedure, or subprogram) is a portion of code within a larger Depending on the situation, the handler may later resume the execution at the original location, using the saved information to restore the original state. For example, an exception which will usually be resumed is a page fault, while a division by zero usually cannot be resolved transparently. In Computer storage technology a page is a fixed-length block of memory that is used as a unit of transfer between Physical memory and external storage like a In
From the processing point of view, hardware interrupts are similar to resumable exceptions, although they are usually not related to the current program flow. In Computing, an interrupt is an asynchronous signal from hardware indicating the need for attention or a synchronous event in software indicating the need for a change
From the point of view of the author of a routine, raising an exception is a useful way to signal that the routine could not execute normally, for example when its input arguments are invalid (a zero denominator in division) or when a resource it relies on is unavailable (a missing file, or a disk error). In systems without exceptions, the routine would need to return some special error code. In computer programming, error codes are enumerated messages that correspond to faults in a specific Software application. However, this sometimes is complicated by the semipredicate problem, in which users of the routine need to write extra code to distinguish normal return values from erroneous ones. In Computer programming, a semipredicate problem occurs when a Subroutine intended to return a useful value can fail but the signalling of failure uses an otherwise
In runtime engine environments such as Java or .NET there exist tools that attach to the runtime engine and every time that an exception of interest occurs they record debugging information that existed in memory at the time the exception was thrown (call stack and heap values). In Computer science, a call stack is a dynamic stack data structure which stores information about the active Subroutines of a Computer program These tools are called Automated Exception Handling or Error Interception tools and they provide 'root-cause' information for exceptions. Automated Exception Handling is a Computing term referring to the computerized handling of errors
Contents |
A piece of code is said to be exception-safe if run-time failures within the code will not produce ill effects, such as memory leaks, garbled stored data or invalid output. In Computer science, a memory leak is a particular type of unintentional memory consumption by a Computer program where the program fails to release memory Exception-safe code must satisfy invariants placed on the code even if exceptions occur. In computer science, a Predicate that if true will remain true throughout a specific sequence of operations, is called (an invariant to that sequence There are several levels of exception safety:
For instance, consider a smart vector type, such as C++'s std::vector or Java's ArrayList. When an item x is added to a vector v, the vector must actually add x to the internal list of objects and also update a count field that says how many objects are in v. It may also need to allocate new memory if the existing capacity isn't large enough. This memory allocation may fail and throw an exception. Because of this, a vector that provides failure transparency would be very difficult or impossible to write. However, the vector may be able to fairly easily offer the strong exception guarantee; in this case, either the insertion of x into v will succeed, or v will remain unchanged. If the vector provides only the basic exception safety guarantee, if the insertion fails, v may or may not contain x, but at least it will be in a consistent state. However, if the vector makes only the minimal guarantee, it's possible that the vector may be invalid. For instance, perhaps the size field of v was incremented but x wasn't actually inserted, making the state inconsistent. Of course, with no guarantee, the program may crash; perhaps the vector needed to expand but couldn't allocate the memory and blindly ploughs ahead as if the allocation succeeded, touching memory at an invalid address.
Usually at least basic exception safety is required. Failure transparency is difficult to implement, and is usually not possible in libraries where complete knowledge of the application is not available.
Many computer languages, such as Ada, Object Pascal (e. Exception handling syntax varies between Programming languages to accommodate their overall syntax. Ada is a structured, Statically typed, imperative, and object-oriented high-level computer Programming language Object Pascal refers to a branch of object oriented derivatives of Pascal, mostly known as the primary Programming language of CodeGear Delphi g. FreePascal, Delphi, and the like), C++, D, Eiffel, Java, Objective-C, Ocaml, PHP (as of version 5), PL/1, Prolog, Python, REALbasic, ML, Ruby, Actionscript and most .NET languages have built-in support for exceptions and exception handling. Object Pascal refers to a branch of object oriented derivatives of Pascal, mostly known as the primary Programming language of CodeGear Delphi C++ (" C Plus Plus " ˌsiːˌplʌsˈplʌs is a general-purpose Programming language. The D programming language, also known simply as D, is an object-oriented, imperative, multiparadigm System programming language Eiffel is an ISO -standardized Object-oriented Programming language designed to enable programmers to efficiently develop extensible reusable reliable Objective-C is a reflective, object-oriented Programming language which adds Smalltalk -style messaging to C. Objective Caml ( OCaml) is the main implementation of the Caml Programming language, created by Xavier Leroy, Jérôme Vouillon PHP is a computer Scripting language. Originally designed for producing Dynamic web pages it has evolved to include a Command line interface capability PL/I ("Programming Language One" ˌpiːˌɛlˈwʌn is an imperative computer Programming language designed for scientific engineering Prolog is a Logic programming language It is a general purpose language often associated with Artificial intelligence and Computational linguistics Python is a general-purpose High-level programming language. Its design philosophy emphasizes programmer productivity and code readability REALbasic ( RB) is an Object-oriented dialect of the BASIC programming language developed and commercially marketed by REAL Software Inc in Austin ML is a general-purpose Functional programming language developed by Robin Milner and others in the late 1970s at the University of Edinburgh, whose syntax Ruby is a dynamic, reflective, general purpose Object-oriented programming language that combines syntax inspired by Perl with Smalltalk ActionScript is a scripting language based on ECMAScript. ActionScript is used primarily for the development of websites and software using the Adobe Flash Player In those languages, the advent of an exception (more precisely, an exception handled by the language) unwinds the stack of function calls until an exception handler is found. In Computer science, a call stack is a dynamic stack data structure which stores information about the active Subroutines of a Computer program That is, if function f contains a handler H for exception E, calls function g, which in turn calls function h, and an exception E occurs in h, then functions h and g will be terminated and H in f will handle E.
Excluding minor syntactic differences, there are only a couple of exception handling styles in use. In the most popular style, an exception is initiated by a special statement (throw, or raise) with an exception object (e. g. with Java or Object Pascal) or a value of a special extendable enumerated type (e. g. with Ada). The scope for exception handlers starts with a marker clause (try, or the language's block starter such as begin) and ends in the start of the first handler clause (catch, except, rescue). Several handler clauses can follow, and each can specify which exception types it handles and what name it uses for the exception object.
A few languages also permit a clause (else) that is used in case no exception occurred before the end of the handler's scope was reached. More common is a related clause (finally, or ensure) that is executed whether an exception occurred or not, typically to release resources acquired within the body of the exception-handling block. Notably, C++ does not need and does not provide this construct, and the Resource Acquisition Is Initialization technique is used to free such resources instead. Resource Acquisition Is Initialization, often referred to by the acronym RAII, is a popular design pattern in many
In its whole, exception handling code might look like this (in Java-like pseudocode; note that an exception type called EmptyLineException would need to be declared somewhere):
try { line = console. Pseudocode is a compact and informal high-level description of a Computer programming Algorithm that uses the structural conventions of some Programming language readLine(); if (line. length() == 0) { throw new EmptyLineException("The line read from console was empty!"); } console. printLine("Hello %s!" % line); } catch (EmptyLineException e) { console. printLine("Hello!"); } catch (Exception e) { console. printLine("Error: " + e. message()); } else { console. printLine("The program ran successfully"); } finally { console. printLine("The program terminates now"); }
As a minor variation, some languages use a single handler clause, which deals with the class of the exception internally.
Languages such as Perl and C don't use the term exception handling, but include facilities that allow implementing similar functionality.
The C++ derivative Embedded C++ excludes exception handling support as it can substantially increase the size of the object code. Major Japanese CPU manufacturers including NEC, Hitachi, Fujitsu, and Toshiba, to address the shortcomings of C++ for embedded applications
A different view of exceptions is based on the principles of Design by Contract and is supported in particular by the Eiffel language. Design by Contract, DbC or Programming by Contract is an approach to designing Computer software. Eiffel is an ISO -standardized Object-oriented Programming language designed to enable programmers to efficiently develop extensible reusable reliable The idea is to provide a more rigorous basis for exception handling by defining precisely what is "normal" and "abnormal" behavior. Specifically, the approach is based on two concepts:
The "Safe Exception Handling principle" as introduced by Bertrand Meyer in Object-Oriented Software Construction then holds that there are only two meaningful ways a routine can react when an exception occurs:
Here is an example expressed in Eiffel syntax. It assumes that a routine send_fast is normally the better way to send a message, but it may fail, triggering an exception; if so, the algorithm next uses send_slow, which will fail less often. If send_slow fails, the routine send as a whole should fail, causing the caller to get an exception.
send (m: MESSAGE) -- Send m through fast link if possible, otherwise through slow link. local tried_fast, tried_slow: BOOLEAN do if tried_fast then tried_slow := True send_slow (m) else tried_fast := True send_fast (m) end rescue if not tried_slow then retry end end
The boolean local variables are initialized to False at the start. If send_fast fails, the body (do clause) will be executed again, causing execution of send_slow. If this execution of send_slow fails, the rescue clause will execute to the end with no retry (no else clause in the final if), causing the routine execution as a whole to fail.
This approach has the merit of defining clearly what a "normal" and "abnormal" cases are: an abnormal case, causing an exception, is one in which the routine is unable to fulfill its contract.
It defines a clear distribution of roles: the do clause (normal body) is in charge of achieving, or attempting to achieve, the routine's contract; the rescue clause is in charge of reestablishing the context and restarting the process if this has a chance of succeeding, but not of performing any actual computation.
The designers of Java devised[2][3] checked exceptions[4], which are a special set of exceptions. The checked exceptions that a method may raise are part of the method's signature. For instance, if a method might throw an IOException, it must declare this fact explicitly in its method signature. Failure to do so raises a compile-time error.
This is related to exception checkers that exist at least for OCaml. Objective Caml ( OCaml) is the main implementation of the Caml Programming language, created by Xavier Leroy, Jérôme Vouillon The external tool for OCaml is both transparent (i. e. it does not require any syntactic annotations) and facultative (i. e. it is possible to compile and run a program without having checked the exceptions, although this is not suggested for production code).
The CLU programming language had a feature with the interface closer to what Java has introduced later. CLU is a Programming language created at MIT by Barbara Liskov and her students between 1974 and 1975 A function could raise only exceptions listed in its type, but any leaking exceptions from called functions would automatically be turned into the sole runtime exception, failure, instead of resulting in compile-time error. Later, Modula-3 had a similar feature. Modula-3 is a Programming language conceived as a successor to an upgraded version of Modula-2. [5] These features don't include the compile time checking which is central in the concept of checked exceptions, and hasn't (as of 2006) been incorporated into major programming languages other than Java. [6]
Checked exceptions can, at compile time, greatly reduce (but not entirely eliminate) the incidence of unhandled exceptions surfacing at runtime in a given application; the unchecked exceptions (RuntimeExceptions and Errors) can still go unhandled. In Computer science, compile time refers to either the operations performed by a Compiler (the "compile-time operations" or Programming language In Computer science, runtime or run time describes the operation of a Computer program, the duration of its execution from beginning to termination
However, some see checked exceptions as a nuisance, syntactic salt that either requires large throws declarations, often revealing implementation details and reducing encapsulation, or encourages the (ab)use of poorly-considered try/catch blocks that can potentially hide legitimate exceptions from their appropriate handlers. Syntactic sugar is a term coined by Peter J Landin for additions to the Syntax of a Computer language that do not affect its functionality The problem is more evident if you consider what happens to code over time. An interface may be declared to throw exceptions X & Y. In a later version of the code you may find you detect a new kind of error, and want to throw exception Z, but this is an interface change making the new code incompatible with the earlier uses. Furthermore, consider the adapter pattern where one body of code declares an interface that is then implemented by a different body of code so that code can be plugged in and called by the first. In Computer programming, the adapter design pattern (often referred to as the wrapper pattern or simply a wrapper) translates one interface The adapter code may have a rich set of exceptions to describe problems, but is forced to use the exception types declared in the interface.
Others do not consider this a nuisance as it is possible to reduce the number of declared exceptions by either declaring a superclass of all potentially thrown exceptions or by defining and declaring exception types that are suitable for the level of abstraction of the called method,[7] and mapping lower level exceptions to these types, preferably wrapped using the exception chaining in order to preserve the root cause. In Computer science, a superclass is a class from which other classes are derived Exception chaining, or exception wrapping, is an Object-oriented programming technique of handling exceptions by re-throwing a caught exception after wrapping In addition, it's very possible that in the example above of the changing interface that the calling code would need to be modified as well, since in some sense the exceptions a method may throw are part of the method's implicit interface anyway.
A simple throws Exception declaration or catch (Exception e) is always sufficient to satisfy the checking. While this technique is sometimes useful, it effectively circumvents the checked exception mechanism, so it should only be used after careful consideration. Additionally, throws Exception forces all calling code to do the same.
One prevalent view is that unchecked exception types should not be handled, except maybe at the outermost levels of scope, as they often represent scenarios that do not allow for recovery: RuntimeExceptions frequently reflect programming defects,[8] and Errors generally represent unrecoverable JVM failures. The view is that, even in a language that supports checked exceptions, there are cases where the use of checked exceptions is not appropriate.
Somewhat related with the concept of checked exceptions is exception synchronity. Synchronous exceptions happen at a specific program statement whereas asynchronous exceptions can raise practically anywhere. [9][10] It follows that asynchronous exception handling can't be required by the compiler. They are also difficult to program with. Examples of naturally asynchronous events include pressing Ctrl-C to interrupt a program, and receiving a signal such as "stop" or "suspend" from another thread of execution. A signal is a limited form of Inter-process communication used in Unix, Unix-like, and other POSIX -compliant operating systems A thread in Computer science is short for a thread of execution.
Programming languages typically deal with this by limiting asynchronity, for example Java has lost thread stopping and resuming. [11] Instead, there can be semi-asynchronous exceptions that only raise in suitable locations of the program or synchronously.
Common Lisp, Dylan and Smalltalk have a Condition system which encompasses the aforementioned exception handling systems. Common Lisp, commonly abbreviated CL, is a dialect of the Lisp Programming language, published in ANSI standard document Information The Dylan Programming language is a multi-paradigm language that includes support for functional Smalltalk is an object-oriented, dynamically typed, reflective programming language. In those languages or environments the advent of a condition (a "generalisation of an error" according to Kent Pitman) implies a function call, and only late in the exception handler the decision to unwind the stack may be taken. Kent M Pitman is the President of HyperMeta Inc and has been involved for many years in the design implementation and use of Lisp and Scheme systems
Conditions are a generalization of exceptions. When a condition arises, an appropriate condition handler is searched for and selected, in stack order, to handle the condition. Conditions which do not represent errors may safely go unhandled entirely; their only purpose may be to propagate hints or warnings toward the user. [12]
This is related to the so-called resumption model of exception handling, in which some exceptions are said to be continuable: it is permitted to return to the expression that signaled an exception, after having taken corrective action in the handler. The condition system is generalized thus: within the handler of a non-serious condition (a. k. a. continuable exception), it is possible to jump to predefined restart points (a. k. a. restarts) that lie between the signaling expression and the condition handler. Restarts are functions closed over some lexical environment, allowing the programmer to repair this environment before exiting the condition handler completely or unwinding the stack even partially.
Condition handling moreover provides a separation of mechanism from policy. The Separation of mechanism and Policy is a fundamental design principle in the field of Computer science. Restarts provide various possible mechanisms for recovering from error, but do not select which mechanism is appropriate in a given situation. That is the province of the condition handler, which (since it is located in higher-level code) has access to a broader view.
An example: Suppose there is a library function whose purpose is to parse a single syslog file entry. syslog is a standard for forwarding log messages in an IP network. What should this function do if the entry is malformed? There is no one right answer, because the same library could be deployed in programs for many different purposes. In an interactive log-file browser, the right thing to do might be to return the entry unparsed, so the user can see it -- but in an automated log-summarizing program, the right thing to do might be to supply null values for the unreadable fields, but abort with an error if too many entries have been malformed.
That is to say, the question can only be answered in terms of the broader goals of the program, which are not known to the general-purpose library function. Nonetheless, exiting with an error message is only rarely the right answer. So instead of simply exiting with an error, the function may establish restarts offering various ways to continue -- for instance, to skip the log entry, to supply default or null values for the unreadable fields, to ask the user for the missing values, or to unwind the stack and abort processing with an error message. The restarts offered constitute the mechanisms available for recovering from error; the selection of restart by the condition handler supplies the policy. A policy is a deliberate plan of action to guide decisions and achieve rational outcome(s