Gecko [ fernandoquevedodop.com ]

Name	Size	Permission
abbrev.txt	7.28 KB	-rw-r--r--
color.txt	1.64 KB	-rw-r--r--
compile.txt	2.2 KB	-rw-r--r--
dfa.txt	8.8 KB	-rw-r--r--
edt.txt	2.45 KB	-rw-r--r--
emacs.txt	8.53 KB	-rw-r--r--
filelock.txt	1.08 KB	-rw-r--r--
fold.txt	5.89 KB	-rw-r--r--
hooks.txt	19.85 KB	-rw-r--r--
ide-mode.txt	7.65 KB	-rw-r--r--
jed_faq.txt	18.17 KB	-rw-r--r--
linux-keys.txt	1.05 KB	-rw-r--r--
menus.txt	1.84 KB	-rw-r--r--
mouse.txt	6.64 KB	-rw-r--r--
pc-keys.txt	3.78 KB	-rw-r--r--
program.txt	5.13 KB	-rw-r--r--
rgrep.txt	1.25 KB	-rw-r--r--
rmail.txt	3.75 KB	-rw-r--r--
script.txt	4.05 KB	-rw-r--r--
syntax.txt	2.47 KB	-rw-r--r--
undo.txt	264 B	-rw-r--r--
utf8.txt	3.56 KB	-rw-r--r--
wjed.txt	7.65 KB	-rw-r--r--
wordstar.txt	1.76 KB	-rw-r--r--
xjed.txt	6.21 KB	-rw-r--r--
xrenderfont.txt	868 B	-rw-r--r--
yankpop.txt	4.44 KB	-rw-r--r--

Code Editor : program.txt

NOTE: This document was written with version 1 of the S-Lang
      interpreter in mind.  However, version 2 has several levels of
      optimization that obsolete some of the recommendations given
      here. For example, recent versions of the interpreter execute
      the "naive" version of the Fibonacci function faster than the
      "optimized" version given below.  Rather, the user is urged to
      write clean code and make use of the S-Lang profiler when
      performance matters.

==========================================================================

This document provides some tips for writing better and more efficient
S-Lang code.  It is not meant to be a tutorial on S-Lang.

Writing Fast Routines
=====================

The first thing that one must realize is that S-Lang is an interpreted
  language and runs much slower than a compiled language.  This fact can be
  used to justify a rule of thumb that may be used to gauge the speed of a
  S-Lang expression:

Rule of Thumb: All single token intrinsic statements and expressions run
		   at the same speed.

The phrase ``intrinsic statements and expressions'' includes not only
  intrinsic functions but also assignment operations as well as pushing an
  object on the stack.  For example, consider the expression:

n = down (20);

This expression consists of the operation of pushing `20' onto the stack
   followed by calling the intrinsic function `down' and assigning it to
   `n'.  It is easiest to see this using the RPN form:

.  20 down =n

(Remember, all RPN expressions must lie on lines that begin with a
   period.).   From the above rule of thumb, this expression executes at a
   speed of 3 units.

Now consider something more tricky.  Consider the expression:

n = n + 1;

It also executes in 3 units of time.  This is equivalent to:

n++;

However, `n++' is a single token and executes in 1 unit of time!  So, the
   rule is that one should try to use the `++' and `--' forms whenever
   possible.  The same statement is true for the `+=' and `-=' operators.
   The statement:

n += 1;

parses to two tokens:

.  1 +=n;

and executes in 2 units.  Note that

n++; n++;

also achieves the effect `n = n + 2' but executes in 2 units as well.

At this point, it should be clear that the code that executes the fastest
   is the code that contains the least number of tokens.   However, this is
   only partially true and only holds for expressions that do not call other
   S-Lang functions.

As an example, consider the recursive function below:

define fib ();   % definition required for recursion

define fib(n)
       {
          if (n == 0) return(0);
          if (n == 1) return(1);

return fib(n - 1) + fib(n - 2);
       }

The first thing to do is to change

if (n == 0) return 0;

to
         ifnot (n) return 0;

since the expression `n == 0' executes in 3 units and `n' executes in
   only 1.  Similarly, the statement:

if (n == 1) return 1;

may be written:

n--; ifnot (n) return 1;

with the side effect that n is reduced by 1 in the process.  But that is
   a good thing because we can then modify:

return fib (n - 1) + fib (n - 2);

to:

return fib(n) + fib (n - 1);

Actually, we can do better than that.  We can write `n - 1' which
   executes in 3 units to the equivalent comma expression `(n--, n)'
   that executes in 2 units to produce:

return fib (n) + fib ( (n--, n) );

Here the fact that `n--' does not affect the stack makes this possible.
   Finally, we are left with:

define fib (n)
      {
        ifnot (n) return 0;
	n--; ifnot (n) return 1;
	return fib(n) + fib ( (n--, n) );
      }

Simply counting tokens (if, ifnot, fib, n, ==, 1, -, etc...) shows that the
   unoptimized version has 19 whereas the optimized version has 12. Applying
   the rule of thumb to this suggests that the optimized version should run
   19/12 times faster!  The reader is encouraged to compare the speed of the
   first version of `fib' with the optimized version to verify that this is
   indeed the case (use something like fib(25)).

Here is a brief summary of what to do to squeeze extra speed out of
   S-Lang:

1.  Use the `++', `--', `+=', and `-=' forms wherever possible.
      2.  Eliminate `if (something == 0)' in favor of `ifnot (something)'
      3.  Avoid `while(1)' and use `forever' instead.
      4.  For simple looping a fixed number of times use `loop'.
      5.  If you have something like:

for (i = imin; i <= imax; i += di)
	      {
	         ...
	      }

replace it by the MUCH faster and smaller version

_for (imin, imax, di)
	       {
	         i = ();
		   .
		   .
	       }

6.  For multiplication by 2 use the `mul2' function.
      7.  To square a number, do not use `x * x'.  Use `sqr(x)'.

Writing Memory Efficient Routines
=================================

In the previous section, it was emphasized that routines that use the
   least number of tokens are the fastest.  Since they use the smallest
   number of tokens, they take up less space and and are more memory
   efficient.

${this.title}

Code Editor : program.txt