appx/bytecode.tex

   1 \documentclass[../thesis.tex]{subfiles}
   2
   3 \include{subfilepreamble}
   4
   5 \begin{document}
   6 \chapter{Bytecode instruction set}%
   7 \label{chp:bytecode_instruction_set}%
   8 \todo[inline]{formatting}
   9
  10 \begin{tabular}{ll}
  11         $l$ & label\\
  12         $w_r$ & return width\\
  13         $w_a$ & argument width\\
  14         $fp$ & frame pointer\\
  15         $sp$ & stack pointer\\
  16         $pc$ & program counter\\
  17 \end{tabular}
  18
  19 Bytecode is byte encoded, stack has 16-bit cells.
  20 Longs and reals are stored with the MSB first.
  21
  22 \footnotesize
  23 %\begin{longtable}{lllll}
  24 %       \caption{\normalsize Semantics for the bytecode instructions\label{tbl:instr_task}}
  25 %       \endfirsthead%
  26 %       \caption{\normalsize Semantics for the bytecode instructions (cont.)}
  27 %       \endhead%
  28 %       \endfoot%
  29 %       \endlastfoot%
  30 %       \toprule
  31 %       Instr. & Args & Semantics & sp & pc\\
  32 %
  33 %       \midrule
  34 %       \texttt{return}   & $w_r~w_a$           & $st[fp\shortminus{}w_a\shortminus{}3+i] = st[fp+1]$ & $st[fp\shortminus{}w_a\shortminus{}3+w_r]$ & $st[fp\shortminus{}w_a\shortminus{}1]$\\
  35 %                                     &                     & {\bf for all} $i\in\{0..w_r\}$\\
  36 %                                     &                     & $fp = st[fp\shortminus{}w_a\shortminus{}2]$\\
  37 %       \texttt{jumpF}    & $l$                 & & $sp\shortminus{}1$ & $\left\{\begin{array}{ll} pc+1 & \textrm{\bf if } st[sp\shortminus{}1]\\l & \textrm{\bf otherwise}\end{array}\right.$\\
  38 %       \texttt{jump}     & $l$                 & & $sp\shortminus{}1$ & $l$\\
  39 %       \texttt{jumpSR}   & $w_a~l$             & $st[sp\shortminus{}w_a\shortminus{}1]=pc+2$ & & $l$\\
  40 %       \texttt{tailCall} & $w_{a_1}~w_{a_2}~l$ & $rotate\:(w_{a_1}+3+w_{a_2},w_{a_2})$         & $fp$             & $jl$\\
  41 %                                         &                     & $fp = fp-w_{a_1}+w_{a_2}$\\
  42 %                                         &                     & \multicolumn{3}{p{.75\textwidth}}{{\bf where} $w_{a_1}$ is the width of the current function and $w_{a_2}$ the width of the called function}\\
  43 %       \texttt{arg}      & $i$                 & $st[sp] = st[fp-1-i]$ & $sp+1$\\
  44 %       \texttt{push}     & $n~b_0\ldots b_n$   & $st[sp+i] = s[i]$                             & $sp+n$           & $pc+2+n$\\
  45 %                                     &                     & {\bf for all} $i\in\{0..n\}$\\
  46 %%      \midrule
  47 %       \texttt{pop}      & $n$                 & & $sp-n$           & $pc+2$\\
  48 %%      \midrule
  49 %       \texttt{rot}      & $d~n$               & $rotate\:(d, n)$                              & $sp$             & $pc+3$\\
  50 %%      \midrule
  51 %       \texttt{dup}      &                     & $st[sp] = st[sp-1]$                           & $sp+1$           & $pc+1$\\
  52 %%      \midrule
  53 %       \texttt{pushPtrs} &                     & $st[sp] = sp$                                 & $sp+3$           & $pc+1$\\
  54 %                                         &                     & $st[sp+1] = fp$\\
  55 %                         &                     & $st[sp+2] = 0$\\
  56 %%      \midrule
  57 %       \texttt{unOp}     &                     & $st[sp-1] = \diamond{}st[sp-1]$                & $sp$             & $pc+1$\\
  58 %                                         &                     & \multicolumn{3}{l}{{\bf for all} $\diamond\in\{\neg\}$}\\
  59 %%      \midrule
  60 %       \texttt{binOp}    &                     & $st[sp-2] = st[sp-2] \mathbin{\oplus} st[sp-1]$         & $sp-1$           & $pc+1$\\
  61 %                                         &                     & \multicolumn{3}{l}{{\bf for all} $\oplus\in\{+, -, *, /, \wedge, \vee, \equiv, \not\equiv, \leq, \geq, <, >\}$}\\
  62 %%      \midrule
  63 %       \texttt{mkTask}   & \texttt{Stable\textsubscript{n}} & $st[sp-n-1] = node (stable,$              & $sp-n+1$ & $pc+2$\\
  64 %                                         &                                  & $\qquad\qquad st[sp-1], \ldots, st[sp-n-1])$\\
  65 %       \texttt{mkTask}   & \texttt{Unstable\textsubscript{n}} & $st[sp-n-1] = node (unstable,$          & $sp-n+1$ & $pc+2$\\
  66 %                                         &                                  & $\qquad\qquad st[sp-1], \ldots, st[sp-n-1])$\\
  67 %%      \midrule
  68 %%                 & \multicolumn{3}{l}{Unstable\textsubscript{n}} & st[sp-n-1] = node (unstable,          & sp-n+1 & pc+2\\
  69 %%             & \multicolumn{3}{l}{} & \qquad\qquad st[sp-1], \textrm{\ldots}, st[sp-n-1])\\
  70 %%      \midrule
  71 %%
  72 %%             & \multicolumn{3}{l}{ReadD        } & st[sp-1] \ \ = node (readd, st[sp-1])             &        & pc+2\\
  73 %%      \midrule
  74 %%             & \multicolumn{3}{l}{ReadA        } & st[sp-1] \ \ = node (reada, st[sp-1])             &        & pc+2\\
  75 %%      \midrule
  76 %%             & \multicolumn{3}{l}{Repeat       } & st[sp-1] \ \ = node (repeat, st[sp-1])              &        & pc+2\\
  77 %%      \midrule
  78 %%             & \multicolumn{3}{l}{Delay        } & st[sp-1] \ \ = node (delay, st[sp-1])             &        & pc+2\\
  79 %%      \midrule
  80 %%
  81 %%             & \multicolumn{3}{l}{WriteD       } & st[sp-2] \ \ = node (writed, st[sp-1], st[sp-2])  & sp-1   & pc+2\\
  82 %%      \midrule
  83 %%             & \multicolumn{3}{l}{WriteA       } & st[sp-2] \ \ = node (writea, st[sp-1], st[sp-2])  & sp-1   & pc+2\\
  84 %%      \midrule
  85 %%             & \multicolumn{3}{l}{And          } & st[sp-2] \ \ = node (and, st[sp-1], st[sp-2])     & sp-1   & pc+2\\
  86 %%      \midrule
  87 %%             & \multicolumn{3}{l}{Or           } & st[sp-2] \ \ = node (or, st[sp-1], st[sp-2])      & sp-1   & pc+2\\
  88 %%      \midrule
  89 %%
  90 %%             & \multicolumn{3}{l}{SdsSet i     } & st[sp-1] \ \ = node (sdsset,i, st[sp-1])          &        & pc+3\\
  91 %%      \midrule
  92 %%
  93 %%             & \multicolumn{3}{l}{SdsGet i     } & st[sp]\ \ \ \ \ = node (sdsget, i)                & sp+1   & pc+3\\
  94 %%      \midrule
  95 %%             & \multicolumn{3}{l}{DHTTemp i    } & st[sp-1] \ \ = node (dhttemp, i)                  & sp+1   & pc+3\\
  96 %%      \midrule
  97 %%             & \multicolumn{3}{l}{DHTHumid i   } & st[sp-1] \ \ = node (dhthumid, i)                 & sp+1   & pc+3\\
  98 %%      \midrule
  99 %%
 100 %%             & \multicolumn{3}{l}{Step aw jl   } & st[sp-1] \ \ = node (step, aw, jl, st[sp-1])      & sp-1   & pc+5\\
 101 %       \bottomrule
 102 %\end{longtable}
 103
 104 \input{subfilepostamble}
 105 \end{document}