deletions | additions       diff --git a/osr-llvm.tex b/osr-llvm.tex  index 7f4e676..c949089 100644  --- a/osr-llvm.tex  +++ b/osr-llvm.tex 
...
%\subsection{Example}  In this section we discuss how to implement the OSR approach of \mysection\ref{se:overview} in LLVM. Our discussion is based on a simple example that illustrates a profile-driven optimization scenario. The IR code shown in this section has been generated with \osrkit, an LLVM-based library we prototyped to support VM builders with a set of abstractions for OSR instrumentation of IR code.  The example we consider is a simple base function {\tt isord} that checks whether an array of numbers is ordered according to some criterion specified by a comparator, as shown in \myfigure\ref{fi:isord-example}. Our goal is to instrument {\tt isort} with a mechanism that fires an OSR to a faster version if so that, whenever  the number of iterations of a base function {\tt isord}  exceeds a certain threshold. threshold, control is dynamically diverted to a faster version generated on the fly by inlining the comparator.  %To explain how the OSR approach of \mysection\ref{se:overview} can be implemented in LLVM, we consider the simple example of \myfigure\ref{fi:isord-example}. Function {\tt isord} checks whether an array of numbers is ordered according to some criterion specified by a comparator.