this is for holding javascript data
Camil Demetrescu edited osr-llvm.tex
over 8 years ago
Commit id: b534d6ef80f4365b1b55c5256f206e295b7ef46b
deletions | additions
diff --git a/osr-llvm.tex b/osr-llvm.tex
index a94a0f6..e7eb658 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. We start from 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} so that, whenever the number of iterations of {\tt isord} exceeds a certain threshold, control is dynamically diverted to a faster version generated on the fly by inlining the comparator.
The IR code shown in this section has been generated with \osrkit, an LLVM-based library we designed
to support that supports VM builders with a set of abstractions for OSR instrumentation of IR
code\ifauthorea{\footnote{\osrkit\ code\ifauthorea{}{\footnote{\osrkit\ is included in the accompanying
artifact.}}{}. artifact.}}.
%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.