Home My Page Projects Code Snippets Project Openings SML/NJ
Summary Activity Forums Tracker Lists Tasks Docs Surveys News SCM Files

SCM Repository

[smlnj] Diff of /sml/trunk/HISTORY
ViewVC logotype

Diff of /sml/trunk/HISTORY

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 937, Thu Sep 20 21:20:28 2001 UTC revision 1190, Mon May 13 20:39:05 2002 UTC
# Line 8  Line 8 
8  The form of an entry should be:  The form of an entry should be:
9    
10  Name:  Name:
11  Date:  Date: yyyy/mm/dd
12  Tag: <post-commit CVS tag>  Tag: <post-commit CVS tag>
13  Description:  Description:
14    
15  ----------------------------------------------------------------------  ----------------------------------------------------------------------
16  Name: Matthias Blume  Name: Matthias Blume
17    Date: 2002/05/13 16:40:00 EDT
18    Tag: blume-20020513-pp-etc
19    Description:
20    
21    A few minor bugfixes:
22    
23      - Stopgap measure for bug recently reported by Elsa Gunter (ppDec).
24        (Bogus printouts for redefined bindings still occur.  Compiler
25        bug should no longer occur now.  We need to redo the prettyprinter
26        from scratch.)
27    
28      - CM pathname printer now also adds escape sequences for ( and )
29    
30      - commend and docu fixes for ml-nlffi
31    
32    ----------------------------------------------------------------------
33    Name: Matthias Blume
34    Date: 2002/05/10 16:40:00 EDT
35    Tag: blume-20020510-erg-textio
36    Description:
37    
38    Applied the following bugfix provided by Emden Gansner:
39    
40        Output is corrupted when outputSubstr is used rather than output.
41    
42        The problem occurs when a substring
43    
44            ss = (s, dataStart, dataLen)
45    
46        where dataStart > 0, fills a stream buffer with avail bytes left.
47        avail bytes of s, starting at index dataStart, are copied into the
48        buffer, the buffer is flushed, and then the remaining dataLen-avail
49        bytes of ss are copied into the beginning of the buffer. Instead of
50        starting this copy at index dataStart+avail in s, the current code
51        starts the copy at index avail.
52    
53        Fix:
54        In text-io-fn.sml, change line 695 from
55             val needsFlush = copyVec(v, avail, dataLen-avail, buf, 0)
56        to
57             val needsFlush = copyVec(v, dataStart+avail, dataLen-avail, buf, 0)
58    
59    ----------------------------------------------------------------------
60    Name: Matthias Blume
61    Date: 2002/04/12 13:55:00 EDT
62    Tag: blume-20020412-assyntax
63    Description:
64    
65    1. Grabbed newer assyntax.h from the XFree86 project.
66    2. Fiddled with how to compile X86.prim.asm without warnings.
67    3. (Very) Minor cleanup in CM.
68    
69    ----------------------------------------------------------------------
70    Name: Matthias Blume
71    Date: 2002/04/01 (no joke!) 17:07:00 EST
72    Tag: blume-20020401-x86div
73    Description:
74    
75    Added full support for div/mod/rem/quot on the x86, using the machine
76    instruction's two results (without clumsily recomputing the remainder)
77    directly where appropriate.
78    
79    Some more extensive power-of-two support was added to the x86 instruction
80    selector (avoiding expensive divs, mods, and muls where they can be
81    replaced with cheaper shifts and masks).  However, this sort of thing
82    ought to be done earlier, e.g., within the CPS optimizer so that
83    all architectures benefit from it.
84    
85    The compiler compiles to a fixed point, but changes might be somewhat
86    fragile nevertheless.  Please, report any strange things that you might
87    see wrt. div/mod/quot/rem...
88    
89    ----------------------------------------------------------------------
90    Name: Matthias Blume
91    Date: 2002/03/29 17:22:00
92    Tag: blume-20020329-div
93    Description:
94    
95    Fixed my broken div/mod logic.  Unfortunately, this means that the
96    inline code for div/mod now has one more comparison than before.
97    Fast paths (quotient > 0 or remainder = 0) are not affected, though.
98    The problem was with quotient = 0, because that alone does not tell
99    us which way the rounding went.  One then has to look at whether
100    remainder and divisor have the same sign...  :(
101    
102    Anyway, I replaced the bootfiles with fresh ones...
103    
104    ----------------------------------------------------------------------
105    Name: Matthias Blume
106    Date: 2002/03/29 14:10:00 EST
107    Tag: blume-20020329-inlprims
108    Description:
109    
110    NEW BOOTFILES!!!    Version number bumped to 110.39.3.
111    
112    Primops have changed. This means that the bin/boot-file formats have
113    changed as well.
114    
115    To make sure that there is no confusion, I made a new version.
116    
117    
118    CHANGES:
119    
120    * removed REMT from mltree (remainder should never overflow).
121    
122    * added primops to deal with divisions of all flavors to the frontend
123    
124    * handled these primops all the way through so they map to their respective
125      MLRISC support
126    
127    * used these primops in the implementation of Int, Int32, Word, Word32
128    
129    * removed INLDIV, INLMOD, and INLREM as they are no longer necessary
130    
131    * parameterized INLMIN, INLMAX, and INLABS by a numkind
132    
133    * translate.sml now deals with all flavors of INL{MIN,MAX,ABS}, including
134      floating point
135    
136    * used INL{MIN,MAX,ABS} in the implementation of Int, Int32, Word, Word32,
137      and Real (but Real.abs maps to a separate floating-point-only primop)
138    
139    
140    TODO items:
141    
142    * Hacked Alpha32 instruction selection, disabling the selection of REMx
143      instructions because the machine instruction encoder cannot handle
144      them.  (Hppa, PPC, and Sparc instruction selection did not handle
145      REM in the first place, and REM is supported by the x86 machine coder.)
146    
147    * Handle DIV and MOD with DIV_TO_NEGINF directly in the x86 instruction
148      selection phase.  (The two can be streamlined because the hardware
149      delivers both quotient and remainder at the same time anyway.)
150    
151    * Think about what to do with "valOf(Int32.minInt) div ~1" and friends.
152      (Currently the behavior is inconsistent both across architectures and
153      wrt. the draft Basis spec.)
154    
155    * Word8 should eventually be handled natively, too.
156    
157    * There seems to be one serious bug in mltree-gen.sml.  It appears, though,
158      as if there currently is no execution path that could trigger it in
159      SML/NJ.  (The assumptions underlying functions arith and promotable do not
160      hold for things like multiplication and division.)
161    
162    ----------------------------------------------------------------------
163    Name: Matthias Blume
164    Date: 2002/03/27 16:27:00 EST
165    Tag: blume-20020327-mlrisc-divisions
166    Description:
167    
168    Added support for all four division operations (ML's div, mod, quot,
169    and rem) to MLRISC.  In the course of doing so, I also rationalized
170    the naming (no more annoying switch-around of DIV and QUOT), by
171    parameterizing the operation by div_rounding_mode (which can be either
172    DIV_TO_ZERO or DIV_TO_NEGINF).
173    
174    The generic MLTreeGen functor takes care of compiling all four
175    operations down to only round-to-zero div.
176    
177    Missing pieces:
178    
179      * Doing something smarter than relying on MLTreeGen on architectures
180        like, e.g., the x86 where hardware division delivers both quotient and
181        remainder at the same time.  With this, the implementation of the
182        round-to-neginf operations could be further streamlined.
183    
184      * Remove inlining support for div/mod/rem from the frontend and replace it
185        with primops that get carried through to the backend.  Do this for all
186        int and word types.
187    
188    ----------------------------------------------------------------------
189    Name: Matthias Blume
190    Date: 2002/03/25 17:25:00 EST
191    Tag: blume-20020325-divmod
192    Description:
193    
194    I improved (hopefully without breaking them) the implementation of Int.div,
195    Int.mod, and Int.rem.   For this, the code in translate.sml now takes
196    advantage of the following observations:
197    
198      Let  q = x quot y      r = x rem y
199           d = x div  y      m = x mod y
200    
201    where "quot" is the round-to-zero version of integer division that
202    hardware usually provides.  Then we have:
203    
204         r = x - q * y        where neither the * nor the - will overflow
205         d = if q >= 0 orelse x = q * y then q else q - 1
206                              where neither the * nor the - will overflow
207         m = if q >= 0 orelse r = 0 then r else r + y
208                              where the + will not overflow
209    
210    This results in substantial simplification of the generated code.
211    The following table shows the number of CFG nodes and edges generated
212    for
213            fun f (x, y) = x OPER y
214            (* with OPER \in div, mod, quot, rem *)
215    
216    
217        OPER | nodes(old) | edges(old) | nodes(new) | edges(new)
218        --------------------------------------------------------
219         div |         24 |         39 |         12 |         16
220         mod |         41 |         71 |         12 |         16
221        quot |          8 |         10 |          8 |         10
222         rem |         10 |         14 |          8 |         10
223    
224    
225    ----------------------------------------------------------------------
226    Name: Matthias Blume
227    Date: 2002/03/25 22:06:00 EST
228    Tag: blume-20020325-cprotobug
229    Description:
230    
231    Fixed a bug in cproto (c prototype decoder).
232    
233    ----------------------------------------------------------------------
234    Name: Matthias Blume
235    Date: 2002/03/25 16:00:00 EST
236    Tag: blume-20020325-raw-primops
237    Description:
238    
239    I did some cleanup to Allen's new primop code and
240    replaced yesterday's bootfiles with new ones.
241    (But they are stored in the same place.)
242    
243    ----------------------------------------------------------------------
244    Name: Matthias Blume
245    Date: 2002/03/24 22:40:00 EST
246    Tag: blume-20020324-bootfiles
247    Description:
248    
249    Made the bootfiles that Allen asked for.
250    
251    ----------------------------------------------------------------------
252    Name: Allen Leung
253    Date: 2002/03/23 15:50:00 EST
254    Tag: leunga-20020323-flint-cps-rcc-primops
255    Description:
256    
257      1. Changes to FLINT primops:
258    
259        (* make a call to a C-function;
260         * The primop carries C function prototype information and specifies
261         * which of its (ML-) arguments are floating point. C prototype
262         * information is for use by the backend, ML information is for
263         * use by the CPS converter. *)
264      | RAW_CCALL of { c_proto: CTypes.c_proto,
265                       ml_args: ccall_type list,
266                       ml_res_opt: ccall_type option,
267                       reentrant : bool
268                     } option
269       (* Allocate uninitialized storage on the heap.
270        * The record is meant to hold short-lived C objects, i.e., they
271        * are not ML pointers.  With the tag, the representation is
272        * the same as RECORD with tag tag_raw32 (sz=4), or tag_fblock (sz=8)
273        *)
274      | RAW_RECORD of {tag:bool,sz:int}
275      and ccall_type = CCALL_INT32 | CCALL_REAL64 | CCALL_ML_PTR
276    
277      2.  These CPS primops are now overloaded:
278    
279           rawload of {kind:numkind}
280           rawstore of {kind:numkind}
281    
282          The one argument form is:
283    
284             rawload {kind} address
285    
286          The two argument form is:
287    
288             rawload {kind} [ml object, byte-offset]
289    
290      3. RAW_CCALL/RCC now takes two extra arguments:
291    
292         a. The first is whether the C call is reentrant, i.e., whether
293            ML state should be saved and restored.
294         b. The second argument is a string argument specifying the name of
295            library and the C function.
296    
297         These things are currently not handled in the code generator, yet.
298    
299      4. In CProto,
300    
301         An encoding type of "bool" means "ml object" and is mapped into
302         C prototype of PTR.  Note that "bool" is different than "string",
303         even though "string" is also mapped into PTR, because "bool"
304         is assigned an CPS type of BOGt, while "string" is assigned INT32t.
305    
306      5. Pickler/unpicker
307    
308         Changed to handle RAW_RECORD and newest RAW_CCALL
309    
310      6. MLRiscGen,
311    
312         1. Changed to handle the new rawload/rawstore/rawrecord operators.
313         2. Code for handling C Calls has been moved to a new module CPSCCalls,
314            in the file CodeGen/cpscompile/cps-c-calls.sml
315    
316      7. Added the conditional move operator
317    
318             condmove of branch
319    
320         to cps.  Generation of this is still buggy so it is currently
321         disabled.
322    
323    ----------------------------------------------------------------------
324    Name: Lal George
325    Date: 2002/03/22 14:18:25 EST
326    Tag: george-20020322-cps-branch-prob
327    Description:
328    
329    Implemented the Ball-Larus branch prediction-heuristics, and
330    incorporated graphical viewers for control flow graphs.
331    
332    Ball-Larus Heuristics:
333    ---------------------
334    See the file compiler/CodeGen/cpscompile/cpsBranchProb.sml.
335    
336    By design it uses the Dempster-Shafer theory for combining
337    probabilities.  For example, in the function:
338    
339        fun f(n,acc) = if n = 0 then acc else f(n-1, n*acc)
340    
341    the ball-larus heuristics predicts that the n=0 is unlikely
342    (OH-heuristic), and the 'then' branch is unlikely because of the
343    RH-heuristic -- giving the 'then' branch an even lower combined
344    probability using the Dempster-Shafer theory.
345    
346    Finally, John Reppy's loop analysis in MLRISC, further lowers the
347    probability of the 'then' branch because of the loop in the else
348    branch.
349    
350    
351    Graphical Viewing:
352    ------------------
353    I merely plugged in Allen's graphical viewers into the compiler. The
354    additional code is not much. At the top level, saying:
355    
356            Control.MLRISC.getFlag "cfg-graphical-view" := true;
357    
358    will display the graphical view of the control flow graph just before
359    back-patching.  daVinci must be in your path for this to work. If
360    daVinci is not available, then the default viewer can be changed
361    using:
362    
363            Control.MLRISC.getString "viewer"
364    
365    which can be set to "dot" or "vcg" for the corresponding viewers. Of
366    course, these viewers must be in your path.
367    
368    The above will display the compilation unit at the level of clusters,
369    many of which are small, boring, and un-interesting. Also setting:
370    
371            Control.MLRISC.getInt "cfg-graphical-view_size"
372    
373    will display clusters that are larger than the value set by the above.
374    
375    
376    ----------------------------------------------------------------------
377    Name: Matthias Blume
378    Date: 2002/03/21 22:20:00 EST
379    Tag: blume-20020321-kmp-bugfix
380    Description:
381    
382    Changed the interface to the KMP routine in PreString and fixed
383    a minor bug in one place where it was used.
384    
385    ----------------------------------------------------------------------
386    Name: Allen Leung
387    Date: 2002/03/21 20:30:00 EST
388    Tag: leunga-20020321-cfg
389    Description:
390    
391      Fixed a potential problem in cfg edge splitting.
392    
393    ----------------------------------------------------------------------
394    Name: Allen Leung
395    Date: 2002/03/21 17:15:00 EST
396    Tag: leunga-20020321-x86-fp-cfg
397    Description:
398    
399      1. Recoded the buggy parts of x86-fp.
400    
401         a. All the block reordering code has been removed.
402            We now depend on the block placement phases to do this work.
403    
404         b. Critical edge splitting code has been simplified and moved into the
405            CFG modules, as where they belong.
406    
407         Both of these were quite buggy and complex.  The code is now much, much
408         simpler.
409    
410      2. X86 backend.
411    
412         a. Added instructions for 64-bit support.  Instruction selection for
413            64-bit has not been committed, however, since that
414            requires changes to MLTREE which haven't been approved by
415            Lal and John.
416    
417         b. Added support for FUCOMI and FUCOMIP when generating code for
418            PentiumPro and above.  We only generate these instructions in
419            the fast-fp mode.
420    
421         c. Added cases for JP and JNP in X86FreqProps.
422    
423      3. CFG
424    
425         CFG now has a bunch of methods for edge splitting and merging.
426    
427      4. Machine description.
428    
429         John's simplification of MLTREE_BASIS.fcond broke a few machine
430         description things:
431    
432         rtl-build.{sig,sml} and hppa.mdl fixed.
433    
434         NOTE: the machine description stuff in the repository is still broken.
435               Again, I can't put my fixes in because that involves
436               changes to MLTREE.
437    
438    ----------------------------------------------------------------------
439    Name: Matthias Blume
440    Date: 2002/03/20 15:55:00 EST
441    Tag: blume-20020320-kmp
442    Description:
443    
444    Implemented Knuth-Morris-Pratt string matching in PreString and used
445    it for String.isSubstring, Substring.isSubstring, and
446    Substring.position.
447    
448    (Might need some stress-testing.  Simple examples worked fine.)
449    
450    ----------------------------------------------------------------------
451    Name: Matthias Blume
452    Date: 2002/03/19 16:37:00 EST
453    Tag: blume-20020319-witnesses
454    Description:
455    
456    Added a structure C.W and functions convert/Ptr.convert to ml-nlffi-lib.
457    
458    This implements a generic mechanism for changing constness qualifiers
459    anywhere within big C types without resorting to outright "casts".
460    (So far, functions such as C.rw/C.ro or C.Ptr.rw/C.Ptr.ro only let you
461    modify the constness at the outermost level.)
462    The implementation of "convert" is based on the idea of "witness"
463    values -- values that are not used by the operation but whose types
464    "testify" to their applicability.  On the implementation side, "convert"
465    is simply a projection (returning its second curried argument).  With
466    cross-module inlining, it should not result in any machine code being
467    generated.
468    
469    ----------------------------------------------------------------------
470    Name: Matthias Blume
471    Date: 2002/03/15 16:40:00 EST
472    Tag: blume-20020315-basis
473    Description:
474    
475    Provided (preliminary?) implementations for
476    
477      {String,Substring}.{concatWith,isSuffix,isSubstring}
478    
479    and
480    
481      Substring.full
482    
483    Those are in the Basis spec but they were missing in SML/NJ.
484    
485    ----------------------------------------------------------------------
486    Name: Matthias Blume
487    Date: 2002/03/14 21:30:00 EST
488    Tag: blume-20020314-controls
489    Description:
490    
491    Controls:
492    ---------
493    
494    1. Factored out the recently-added Controls : CONTROLS stuff and put
495       it into its own library $/controls-lib.cm.  The source tree for
496       this is under src/smlnj-lib/Controls.
497    
498    2. Changed the names of types and functions in this interface, so they
499       make a bit more "sense":
500    
501          module -> registry
502          'a registry -> 'a group
503    
504    3. The interface now deals in ref cells only.  The getter/setter interface
505       is (mostly) gone.
506    
507    4. Added a function that lets one register an already-existing ref cell.
508    
509    5. Made the corresponding modifications to the rest of the code so that
510       everything compiles again.
511    
512    6. Changed the implementation of Controls.MLRISC back to something closer
513       to the original.  In particular, this module (and therefore MLRISC)
514       does not depend on Controls.  There now is some link-time code in
515       int-sys.sml that registers the MLRISC controls with the Controls
516       module.
517    
518    CM:
519    ---
520    
521      * One can now specify the lambda-split aggressiveness in init.cmi.
522    
523    ----------------------------------------------------------------------
524    Name: Allen Leung
525    Date: 2002/03/13 17:30:00 EST
526    Tag: leunga-20020313-x86-fp-unary
527    Description:
528    
529    Bug fix for:
530    
531    > leunga@weaselbane:~/Yale/tmp/sml-dist{21} bin/sml
532    > Standard ML of New Jersey v110.39.1 [FLINT v1.5], March 08, 2002
533    > - fun f(x,(y,z)) = Real.~ y;
534    > [autoloading]
535    > [autoloading done]
536    >       fchsl   (%eax), 184(%esp)
537    > Error: MLRisc bug: X86MCEmitter.emitInstr
538    >
539    > uncaught exception Error
540    >   raised at: ../MLRISC/control/mlriscErrormsg.sml:16.14-16.19
541    
542    The problem was that the code generator did not generate any fp registers
543    in this case, and the ra didn't know that it needed to run the X86FP phase to
544    translate the pseudo fp instruction.   This only happened with unary fp
545    operators in certain situations.
546    
547    ----------------------------------------------------------------------
548    Name: Matthias Blume
549    Date: 2002/03/13 14:00:00 EST
550    Tag: blume-20020313-overload-etc
551    Description:
552    
553    1. Added _overload as a synonym for overload for backward compatibility.
554       (Control.overloadKW must be true for either version to be accepted.)
555    
556    2. Fixed bug in install script that caused more things to be installed
557       than what was requested in config/targets.
558    
559    3. Made CM aware of the (_)overload construct so that autoloading
560       works.
561    
562    ----------------------------------------------------------------------
563    Name: Matthias Blume
564    Date: 2002/03/12 22:03:00 EST
565    Tag: blume-20020312-url
566    Description:
567    
568    Forgot to update BOOT and srcarchiveurl.
569    
570    ----------------------------------------------------------------------
571    Name: Matthias Blume
572    Date: 2002/03/12 17:30:00 EST
573    Tag: blume-20020312-version110392
574    Description:
575    
576    Yet another version number bump (because of small changes to the
577    binfile format).  Version number is now 110.39.2.  NEW BOOTFILES!
578    
579    Changes:
580    
581      The new pid generation scheme described a few weeks ago was overly
582      complicated.  I implemented a new mechanism that is simpler and
583      provides a bit more "stability":  Once CM has seen a compilation
584      unit, it keeps its identity constant (as long as you do not delete
585      those crucial CM/GUID/* files).  This means that when you change
586      an interface, compile, then go back to the old interface, and
587      compile again, you arrive at the original pid.
588    
589      There now also is a mechanism that instructs CM to use the plain
590      environment hash as a module's pid (effectively making its GUID
591      the empty string).  For this, "noguid" must be specified as an
592      option to the .sml file in question within its .cm file.
593      This is most useful for code that is being generated by tools such
594      as ml-nlffigen (because during development programmers tend to
595      erase the tool's entire output directory tree including CM's cached
596      GUIDs).  "noguid" is somewhat dangerous (since it can be used to locally
597      revert to the old, broken behavior of SML/NJ, but in specific cases
598      where there is no danger of interface confusion, its use is ok
599      (I think).
600    
601      ml-nlffigen by default generates "noguid" annotations.  They can be
602      turned off by specifying -guid in its command line.
603    
604    ----------------------------------------------------------------------
605    Name: Lal George
606    Date: 2002/03/12 12 14:42:36 EST
607    Tag: george-20020312-frequency-computation
608    Description:
609    
610    Integrated jump chaining and static block frequency into the
611    compiler. More details and numbers later.
612    
613    ----------------------------------------------------------------------
614    Name: Lal George
615    Date: 2002/03/11 11 22:38:53 EST
616    Tag: george-20020311-jump-chain-elim
617    Description:
618    
619    Tested the jump chain elimination on all architectures (except the
620    hppa).  This is on by default right now and is profitable for the
621    alpha and x86, however, it may not be profitable for the sparc and ppc
622    when compiling the compiler.
623    
624    The gc test will typically jump to a label at the end of the cluster,
625    where there is another jump to an external cluster containing the actual
626    code to invoke gc. This is to allow factoring of common gc invocation
627    sequences. That is to say, we generate:
628    
629            f:
630               testgc
631               ja   L1      % jump if above to L1
632    
633            L1:
634               jmp L2
635    
636    
637    After jump chain elimination the 'ja L1' instructions is converted to
638    'ja L2'. On the sparc and ppc, many of the 'ja L2' instructions may end
639    up being implemented in their long form (if L2 is far away) using:
640    
641            jbe     L3      % jump if below or equal to L3
642            jmp     L2
643         L3:
644            ...
645    
646    
647    For large compilation units L2  may be far away.
648    
649    
650    ----------------------------------------------------------------------
651    Name: Matthias Blume
652    Date: 2002/03/11 13:30:00 EST
653    Tag: blume-20020311-mltreeeval
654    Description:
655    
656    A functor parameter was missing.
657    
658    ----------------------------------------------------------------------
659    Name: Allen Leung
660    Date: 2002/03/11 10:30:00 EST
661    Tag: leunga-20020311-runtime-string0
662    Description:
663    
664       The representation of the empty string now points to a
665    legal null terminated C string instead of unit.  It is now possible
666    to convert an ML string into C string with InlineT.CharVector.getData.
667    This compiles into one single machine instruction.
668    
669    ----------------------------------------------------------------------
670    Name: Allen Leung
671    Date: 2002/03/10 23:55:00 EST
672    Tag: leunga-20020310-x86-call
673    Description:
674    
675       Added machine generation for CALL instruction (relative displacement mode)
676    
677    ----------------------------------------------------------------------
678    Name: Matthias Blume
679    Date: 2002/03/08 16:05:00
680    Tag: blume-20020308-entrypoints
681    Description:
682    
683    Version number bumped to 110.39.1.  NEW BOOTFILES!
684    
685    Entrypoints: non-zero offset into a code object where execution should begin.
686    
687    - Added the notion of an entrypoint to CodeObj.
688    - Added reading/writing of entrypoint info to Binfile.
689    - Made runtime system bootloader aware of entrypoints.
690    - Use the address of the label of the first function given to mlriscGen
691      as the entrypoint.  This address is currently always 0, but it will
692      not be 0 once we turn on block placement.
693    - Removed the linkage cluster code (which was The Other Way(tm) of dealing
694      with entry points) from mlriscGen.
695    
696    ----------------------------------------------------------------------
697    Name: Allen Leung
698    Date: 2002/03/07 20:45:00 EST
699    Tag: leunga-20020307-x86-cmov
700    Description:
701    
702       Bug fixes for CMOVcc on x86.
703    
704       1. Added machine code generation for CMOVcc
705       2. CMOVcc is now generated in preference over SETcc on PentiumPro or above.
706       3. CMOVcc cannot have an immediate operand as argument.
707    
708    ----------------------------------------------------------------------
709    Name: Matthias Blume
710    Date: 2002/03/07 16:15:00 EST
711    Tag: blume-20020307-controls
712    Description:
713    
714    This is a very large but mostly boring patch which makes (almost)
715    every tuneable compiler knob (i.e., pretty much everything under
716    Control.* plus a few other things) configurable via both the command
717    line and environment variables in the style CM did its configuration
718    until now.
719    
720    Try starting sml with '-h' (or, if you are brave, '-H')
721    
722    To this end, I added a structure Controls : CONTROLS to smlnj-lib.cm which
723    implements the underlying generic mechanism.
724    
725    The interface to some of the existing such facilities has changed somewhat.
726    For example, the MLRiscControl module now provides mkFoo instead of getFoo.
727    (The getFoo interface is still there for backward-compatibility, but its
728    use is deprecated.)
729    
730    The ml-build script passes -Cxxx=yyy command-line arguments through so
731    that one can now twiddle the compiler settings when using this "batch"
732    compiler.
733    
734    TODO items:
735    
736    We should go through and throw out all controls that are no longer
737    connected to anything.  Moreover, we should go through and provide
738    meaningful (and correct!) documentation strings for those controls
739    that still are connected.
740    
741    Currently, multiple calls to Controls.new are accepted (only the first
742    has any effect).  Eventually we should make sure that every control
743    is being made (via Controls.new) exactly once.  Future access can then
744    be done using Controls.acc.
745    
746    Finally, it would probably be a good idea to use the getter-setter
747    interface to controls rather than ref cells.  For the time being, both
748    styles are provided by the Controls module, but getter-setter pairs are
749    better if thread-safety is of any concern because they can be wrapped.
750    
751    *****************************************
752    
753    One bug fix: The function blockPlacement in three of the MLRISC
754    backpatch files used to be hard-wired to one of two possibilities at
755    link time (according to the value of the placementFlag).  But (I
756    think) it should rather sense the flag every time.
757    
758    *****************************************
759    
760    Other assorted changes (by other people who did not supply a HISTORY entry):
761    
762    1. the cross-module inliner now works much better (Monnier)
763    2. representation of weights, frequencies, and probabilities in MLRISC
764       changed in preparation of using those for weighted block placement
765       (Reppy, George)
766    
767    ----------------------------------------------------------------------
768    Name: Lal George
769    Date: 2002/03/07 14:44:24 EST 2002
770    Tag: george-20020307-weighted-block-placement
771    
772    Tested the weighted block placement optimization on all architectures
773    (except the hppa) using AMPL to generate the block and edge frequencies.
774    Changes were required in the machine properties to correctly
775    categorize trap instructions. There is an MLRISC flag
776    "weighted-block-placement" that can be used to enable weighted block
777    placement, but this will be ineffective without block/edge
778    frequencies (coming soon).
779    
780    
781    ----------------------------------------------------------------------
782    Name: Lal George
783    Date: 2002/03/05 17:24:48 EST
784    Tag: george-20020305-linkage-cluster
785    
786    In order to support the block placement optimization, a new cluster
787    is generated as the very first cluster (called the linkage cluster).
788    It contains a single jump to the 'real' entry point for the compilation
789    unit. Block placement has no effect on the linkage cluster itself, but
790    all the other clusters  have full freedom in the manner in which they
791    reorder blocks or functions.
792    
793    On the x86 the typical linkage code that is generated is:
794       ----------------------
795            .align 2
796       L0:
797            addl    $L1-L0, 72(%esp)
798            jmp     L1
799    
800    
801            .align  2
802       L1:
803       ----------------------
804    
805    72(%esp) is the memory location for the stdlink register. This
806    must contain the address of the CPS function being called. In the
807    above example, it contains the address of  L0; before
808    calling L1 (the real entry point for the compilation unit), it
809    must contain the address for L1, and hence
810    
811            addl $L1-L0, 72(%esp)
812    
813    I have tested this on all architectures except the hppa.The increase
814    in code size is of course negligible
815    
816    ----------------------------------------------------------------------
817    Name: Allen Leung
818    Date: 2002/03/03 13:20:00 EST
819    Tag: leunga-20020303-mlrisc-tools
820    
821      Added #[ ... ] expressions to mlrisc tools
822    
823    ----------------------------------------------------------------------
824    Name: Matthias Blume
825    Date: 2002/02/27 12:29:00 EST
826    Tag: blume-20020227-cdebug
827    Description:
828    
829    - made types in structure C and C_Debug to be equal
830    - got rid of code duplication (c-int.sml vs. c-int-debug.sml)
831    - there no longer is a C_Int_Debug (C_Debug is directly derived from C)
832    
833    ----------------------------------------------------------------------
834    Name: Matthias Blume
835    Date: 2002/02/26 12:00:00 EST
836    Tag: blume-20020226-ffi
837    Description:
838    
839    1. Fixed a minor bug in CM's "noweb" tool:
840       If numbering is turned off, then truly don't number (i.e., do not
841       supply the -L option to noweb).  The previous behavior was to supply
842       -L'' -- which caused noweb to use the "default" line numbering scheme.
843       Thanks to Chris Richards for pointing this out (and supplying the fix).
844    
845    2. Once again, I reworked some aspects of the FFI:
846    
847       A. The incomplete/complete type business:
848    
849       - Signatures POINTER_TO_INCOMPLETE_TYPE and accompanying functors are
850         gone!
851       - ML types representing an incomplete type are now *equal* to
852         ML types representing their corresponding complete types (just like
853         in C).  This is still safe because ml-nlffigen will not generate
854         RTTI for incomplete types, nor will it generate functions that
855         require access to such RTTI.   But when ML code generated from both
856         incomplete and complete versions of the C type meet, the ML types
857         are trivially interoperable.
858    
859         NOTE:  These changes restore the full generality of the translation
860         (which was previously lost when I eliminated functorization)!
861    
862       B. Enum types:
863    
864       - Structure C now has a type constructor "enum" that is similar to
865         how the "su" constructor works.  However, "enum" is not a phantom
866         type because each "T enum" has values (and is isomorphic to
867         MLRep.Signed.int).
868       - There are generic access operations for enum objects (using
869         MLRep.Signed.int).
870       - ml-nlffigen will generate a structure E_foo for each "enum foo".
871         * The structure contains the definition of type "mlrep" (the ML-side
872         representation type of the enum).  Normally, mlrep is the same
873         as "MLRep.Signed.int", but if ml-nlffigen was invoked with "-ec",
874         then mlrep will be defined as a datatype -- thus facilitating
875         pattern matching on mlrep values.
876         ("-ec" will be suppressed if there are duplicate values in an
877          enumeration.)
878         * Constructors ("-ec") or values (no "-ec") e_xxx of type mlrep
879         will be generated for each C enum constant xxx.
880         * Conversion functions m2i and i2m convert between mlrep and
881         MLRep.Signed.int.  (Without "-ec", these functions are identities.)
882         * Coversion functions c and ml convert between mlrep and "tag enum".
883         * Access functions (get/set) fetch and store mlrep values.
884       - By default (unless ml-nlffigen was invoked with "-nocollect"), unnamed
885         enumerations are merged into one single enumeration represented by
886         structure E_'.
887    
888    ----------------------------------------------------------------------
889    Name: Allen Leung
890    Date: 2002/02/25 04:45:00 EST
891    Tag: leunga-20020225-cps-spill
892    
893    This is a new implementation of the CPS spill phase.
894    The new phase is in the new file compiler/CodeGen/cpscompile/spill-new.sml
895    In case of problems, replace it with the old file spill.sml
896    
897    The current compiler runs into some serious performance problems when
898    constructing a large record.  This can happen when we try to compile a
899    structure with many items.  Even a very simple structure like the following
900    makes the compiler slow down.
901    
902        structure Foo = struct
903           val x_1 = 0w1 : Word32.int
904           val x_2 = 0w2 : Word32.int
905           val x_3 = 0w3 : Word32.int
906           ...
907           val x_N = 0wN : Word32.int
908        end
909    
910    The following table shows the compile time, from N=1000 to N=4000,
911    with the old compiler:
912    
913    N
914    1000   CPS 100 spill                           0.04u  0.00s  0.00g
915           MLRISC ra                               0.06u  0.00s  0.05g
916              (spills = 0 reloads = 0)
917           TOTAL                                   0.63u  0.07s  0.21g
918    
919    1100   CPS 100 spill                           8.25u  0.32s  0.64g
920           MLRISC ra                               5.68u  0.59s  3.93g
921              (spills = 0 reloads = 0)
922           TOTAL                                   14.71u  0.99s  4.81g
923    
924    1500   CPS 100 spill                           58.55u  2.34s  1.74g
925           MLRISC ra                               5.54u  0.65s  3.91g
926              (spills = 543 reloads = 1082)
927           TOTAL                                   65.40u  3.13s  6.00g
928    
929    2000   CPS 100 spill                           126.69u  4.84s  3.08g
930           MLRISC ra                               0.80u  0.10s  0.55g
931              (spills = 42 reloads = 84)
932           TOTAL                                   129.42u  5.10s  4.13g
933    
934    3000   CPS 100 spill                           675.59u  19.03s  11.64g
935           MLRISC ra                               2.69u  0.27s  1.38g
936              (spills = 62 reloads = 124)
937           TOTAL                                   682.48u  19.61s  13.99g
938    
939    4000   CPS 100 spill                           2362.82u  56.28s  43.60g
940           MLRISC ra                               4.96u  0.27s  2.72g
941              (spills = 85 reloads = 170)
942           TOTAL                                   2375.26u  57.21s  48.00g
943    
944    As you can see the old cps spill module suffers from some serious
945    performance problem.  But since I cannot decipher the old code fully,
946    instead of patching the problems up, I'm reimplementing it
947    with a different algorithm.  The new code is more modular,
948    smaller when compiled, and substantially faster
949    (O(n log n) time and O(n) space).  Timing of the new spill module:
950    
951    4000  CPS 100 spill                           0.02u  0.00s  0.00g
952          MLRISC ra                               0.25u  0.02s  0.15g
953             (spills=1 reloads=3)
954          TOTAL                                   7.74u  0.34s  1.62g
955    
956    Implementation details:
957    
958    As far as I can tell, the purpose of the CPS spill module is to make sure the
959    number of live variables at any program point (the bandwidth)
960    does not exceed a certain limit, which is determined by the
961    size of the spill area.
962    
963    When the bandwidth is too large, we decrease the register pressure by
964    packing live variables into spill records.  How we achieve this is
965    completely different than what we did in the old code.
966    
967    First, there is something about the MLRiscGen code generator
968    that we should be aware of:
969    
970    o MLRiscGen performs code motion!
971    
972       In particular, it will move floating point computations and
973       address computations involving only the heap pointer to
974       their use sites (if there is only a single use).
975       What this means is that if we have a CPS record construction
976       statement
977    
978           RECORD(k,vl,w,e)
979    
980       we should never count the new record address w as live if w
981       has only one use (which is often the case).
982    
983       We should do something similar to floating point, but the transformation
984       there is much more complex, so I won't deal with that.
985    
986    Secondly, there are now two new cps primops at our disposal:
987    
988     1. rawrecord of record_kind option
989        This pure operator allocates some uninitialized storage from the heap.
990        There are two forms:
991    
992         rawrecord NONE [INT n]  allocates a tagless record of length n
993         rawrecord (SOME rk) [INT n] allocates a tagged record of length n
994                                     and initializes the tag.
995    
996     2. rawupdate of cty
997          rawupdate cty (v,i,x)
998          Assigns to x to the ith component of record v.
999          The storelist is not updated.
1000    
1001    We use these new primops for both spilling and increment record construction.
1002    
1003     1. Spilling.
1004    
1005        This is implemented with a linear scan algorithm (but generalized
1006        to trees).  The algorithm will create a single spill record at the
1007        beginning of the cps function and use rawupdate to spill to it,
1008        and SELECT or SELp to reload from it.  So both spills and reloads
1009        are fine-grain operations.  In contrast, in the old algorithm
1010        "spills" have to be bundled together in records.
1011    
1012        Ideally, we should sink the spill record construction to where
1013        it is needed.  We can even split the spill record into multiple ones
1014        at the places where they are needed.  But CPS is not a good
1015        representation for global code motion, so I'll keep it simple and
1016        am not attempting this.
1017    
1018     2. Incremental record construction (aka record splitting).
1019    
1020        Long records with many component values which are simulatenously live
1021        (recall that single use record addresses are not considered to
1022         be live) are constructed with rawrecord and rawupdate.
1023        We allocate space on the heap with rawrecord first, then gradually
1024        fill it in with rawupdate.  This is the technique suggested to me
1025        by Matthias.
1026    
1027        Some restrictions on when this is applicable:
1028        1. It is not a VECTOR record.  The code generator currently does not handle
1029           this case. VECTOR record uses double indirection like arrays.
1030        2. All the record component values are defined in the same "basic block"
1031           as the record constructor.  This is to prevent speculative
1032           record construction.
1033    
1034    ----------------------------------------------------------------------
1035    Name: Allen Leung
1036    Date: 2002/02/22 01:02:00 EST
1037    Tag: leunga-20020222-mlrisc-tools
1038    
1039    Minor bug fixes in the parser and rewriter
1040    
1041    ----------------------------------------------------------------------
1042    Name: Allen Leung
1043    Date: 2002/02/21 20:20:00 EST
1044    Tag: leunga-20020221-peephole
1045    
1046    Regenerated the peephole files.  Some contained typos in the specification
1047    and some didn't compile because of pretty printing bugs in the old version
1048    of 'nowhere'.
1049    
1050    ----------------------------------------------------------------------
1051    Name: Allen Leung
1052    Date: 2002/02/19 20:20:00 EST
1053    Tag: leunga-20020219-mlrisc-tools
1054    Description:
1055    
1056       Minor bug fixes to the mlrisc-tools library:
1057    
1058       1.  Fixed up parsing colon suffixed keywords
1059       2.  Added the ability to shut the error messages up
1060       3.  Reimplemented the pretty printer and fixed up/improved
1061           the pretty printing of handle and -> types.
1062       4.  Fixed up generation of literal symbols in the nowhere tool.
1063       5.  Added some SML keywords to to sml.sty
1064    
1065    ----------------------------------------------------------------------
1066    Name: Matthias Blume
1067    Date: 2002/02/19 16:20:00 EST
1068    Tag: blume-20020219-cmffi
1069    Description:
1070    
1071    A wild mix of changes, some minor, some major:
1072    
1073    * All C FFI-related libraries are now anchored under $c:
1074        $/c.cm      --> $c/c.cm
1075        $/c-int.cm  --> $c/internals/c-int.cm
1076        $/memory.cm --> $c/memory/memory.cm
1077    
1078    * "make" tool (in CM) now treats its argument pathname slightly
1079      differently:
1080        1. If the native expansion is an absolute name, then before invoking
1081           the "make" command on it, CM will apply OS.Path.mkRelative
1082           (with relativeTo = OS.FileSys.getDir()) to it.
1083        2. The argument will be passed through to subsequent phases of CM
1084           processing without "going native".  In particular, if the argument
1085           was an anchored path, then "make" will not lose track of that anchor.
1086    
1087    * Compiler backends now "know" their respective C calling conventions
1088      instead of having to be told about it by ml-nlffigen.  This relieves
1089      ml-nlffigen from one of its burdens.
1090    
1091    * The X86Backend has been split into X86CCallBackend and X86StdCallBackend.
1092    
1093    * Export C_DEBUG and C_Debug from $c/c.cm.
1094    
1095    * C type encoding in ml-nlffi-lib has been improved to model the conceptual
1096      subtyping relationship between incomplete pointers and their complete
1097      counterparts.  For this, ('t, 'c) ptr has been changed to 'o ptr --
1098      with the convention of instantiating 'o with ('t, 'c) obj whenever
1099      the pointer target type is complete.  In the incomplete case, 'o
1100      will be instantiated with some "'c iobj" -- a type obtained by
1101      using one of the functors PointerToIncompleteType or PointerToCompleteType.
1102    
1103      Operations that work on both incomplete and complete pointer types are
1104      typed as taking an 'o ptr while operations that require the target to
1105      be known are typed as taking some ('t, 'c) obj ptr.
1106    
1107      voidptr is now a bit "more concrete", namely "type voidptr = void ptr'"
1108      where void is an eqtype without any values.  This makes it possible
1109      to work on voidptr values using functions meant to operate on light
1110      incomplete pointers.
1111    
1112    * As a result of the above, signature POINTER_TO_INCOMPLETE_TYPE has
1113      been vastly simplified.
1114    
1115    ----------------------------------------------------------------------
1116    Name: Matthias Blume
1117    Date: 2002/02/19 10:48:00 EST
1118    Tag: blume-20020219-pqfix
1119    Description:
1120    
1121    Applied Chris Okasaki's bug fix for priority queues.
1122    
1123    ----------------------------------------------------------------------
1124    Name: Matthias Blume
1125    Date: 2002/02/15 17:05:00
1126    Tag: Release_110_39
1127    Description:
1128    
1129    Last-minute retagging is becoming a tradition... :-(
1130    
1131    This is the working release 110.39.
1132    
1133    ----------------------------------------------------------------------
1134    Name: Matthias Blume
1135    Date: 2002/02/15 16:00:00 EST
1136    Tag: Release_110_39-orig
1137    Description:
1138    
1139    Working release 110.39.  New bootfiles.
1140    
1141    (Update: There was a small bug in the installer so it wouldn't work
1142    with all shells.  So I retagged. -Matthias)
1143    
1144    ----------------------------------------------------------------------
1145    Name: Matthias Blume
1146    Date: 2002/02/15 14:17:00 EST
1147    Tag: blume-20020215-showbindings
1148    Description:
1149    
1150    Added EnvRef.listBoundSymbols and CM.State.showBindings.  Especially
1151    the latter can be useful for exploring what bindings are available at
1152    the interactive prompt.  (The first function returns only the list
1153    of symbols that are really bound, the second prints those but also the
1154    ones that CM's autoloading mechanism knows about.)
1155    
1156    ----------------------------------------------------------------------
1157    Name: Matthias Blume
1158    Date: 2002/02/15 12:08:00 EST
1159    Tag: blume-20020215-iptrs
1160    Description:
1161    
1162    Two improvements to ml-nlffigen:
1163    
1164      1. Write files only if they do not exist or if their current contents
1165         do not coincide with what's being written.  (That is, avoid messing
1166         with the time stamps unless absolutely necessary.)
1167    
1168      2. Implement a "repository" mechanism for generated files related
1169         to "incomplete pointer types".   See the README file for details.
1170    
1171    ----------------------------------------------------------------------
1172    Name: Matthias Blume
1173    Date: 2002/02/14 11:50:00 EST
1174    Tag: blume-20020214-quote
1175    Description:
1176    
1177    Added a type 't t_' to tag.sml (in ml-nlffi-lib.cm).  This is required
1178    because of the new and improved tag generation scheme.  (Thanks to Allen
1179    Leung for pointing it out.)
1180    
1181    ----------------------------------------------------------------------
1182    Name: Lal George
1183    Date: 2002/02/14 09:55:27 EST 2002
1184    Tag: george-20020214-isabelle-bug
1185    Description:
1186    
1187    Fixed the MLRISC bug sent by Markus Wenzel regarding the compilation
1188    of Isabelle on the x86.
1189    
1190    From Allen:
1191    -----------
1192     I've found the problem:
1193    
1194         in ra-core.sml, I use the counter "blocked" to keep track of the
1195         true number of elements in the freeze queue.  When the counter goes
1196         to zero, I skip examining the queue.  But I've messed up the
1197         bookkeeping in combine():
1198    
1199             else ();
1200             case !ucol of
1201               PSEUDO => (if !cntv > 0 then
1202                     (if !cntu > 0 then blocked := !blocked - 1 else ();
1203                                        ^^^^^^^^^^^^^^^^^^^^^^^
1204                      moveu := mergeMoveList(!movev, !moveu)
1205                     )
1206                  else ();
1207    
1208         combine() is called to coalesce two nodes u and v.
1209         I think I was thinking that if the move counts of u and v are both
1210         greater than zero then after they are coalesced then one node is
1211         removed from the freeze queue.  Apparently I was thinking that
1212         both u and v are of low degree, but that's clearly not necessarily true.
1213    
1214    
1215    02/12/2002:
1216        Here's the patch.  HOL now compiles.
1217    
1218        I don't know how this impact on performance (compile
1219        time or runtime).  This bug caused the RA (especially on the x86)
1220        to go thru the potential spill phase when there are still nodes on the
1221        freeze queue.
1222    
1223    
1224    
1225    
1226    ----------------------------------------------------------------------
1227    Name: Matthias Blume
1228    Date: 2002/02/13 22:40:00 EST
1229    Tag: blume-20020213-fptr-rtti
1230    Description:
1231    
1232    Fixed a bug in ml-nlffigen that was introduced with one of the previous
1233    updates.
1234    
1235    ----------------------------------------------------------------------
1236    Name: Matthias Blume
1237    Date: 2002/02/13 16:41:00 EST
1238    Tag: blume-20020213-cmlpq
1239    Description:
1240    
1241    Added new priority queue export symbols (which have just been added to
1242    smlnj-lib.cm) to CML's version of smlnj-lib.cm.  (Otherwise CML would
1243    not compile and the installer would choke.)
1244    
1245    ----------------------------------------------------------------------
1246    Name: Matthias Blume
1247    Date: 2002/02/13 16:15:00 EST
1248    Tag: blume-20020213-various
1249    Description:
1250    
1251    1. More tweaks to ml-nlffigen:
1252    
1253       - better internal datastructures (resulting in slight speedup)
1254       - "-match" option requires exact match
1255       - "localized" gensym counters (untagged structs/unions nested within
1256         other structs/unions or within typedefs get a fresh counter; their
1257         tag will be prefixed by a concatenation of their parents' tags)
1258       - bug fixes (related to calculation of transitive closure of types
1259         to be included in the output)
1260    
1261    2. Minor Basis updates:
1262    
1263       - added implementations for List.collate and Option.app
1264    
1265    ----------------------------------------------------------------------
1266    Name: Matthias Blume
1267    Date: 2002/02/11 15:55:00 EST
1268    Tag: blume-20020211-gensym
1269    Description:
1270    
1271    Added a "-gensym" option to command line of ml-nlffigen.  This can be
1272    used to specify a "stem" -- a string that is inserted in all "gensym'd"
1273    names (ML structure names that correspond to unnamed C structs, unions,
1274    and enums), so that separate runs of ml-nlffigen do not clash.
1275    
1276    ----------------------------------------------------------------------
1277    Name: Matthias Blume
1278    Date: 2002/02/11 12:05:00 EST
1279    Tag: blume-20020211-gensml
1280    Description:
1281    
1282    A quick fix for a problem with GenSML (in the pgraph-util library):
1283    Make generation of toplevel "local" optional.  (Strictly speaking,
1284    signature definitions within "local" are not legal SML.)
1285    
1286    Other than that: updates to INSTALL and cm/TODO.
1287    
1288    ----------------------------------------------------------------------
1289    Name: Matthias Blume
1290    Date: 2002/02/08 15:00:00 EST
1291    Tag: blume-20020208-uniquepid
1292    Description:
1293    
1294    0. Version number has been bumped to 110.38.1.  NEW BOOTFILES!!!
1295    
1296    1. The installer (config/install.sh) has gotten smarter:
1297    
1298         - Configuration options are a bit easier to specify now
1299           (in config/targets).
1300         - Bug in recognizing .tar.bz2 files fixed.
1301         - Installer automatically resolves dependencies between
1302           configuration options (e.g., if you ask for eXene, you will
1303           also get cml -- regardless whether you asked for it or not).
1304         - Installer can run in "quieter mode" by setting the environment
1305           variable INSTALL_QUIETLY to "true".  "Quieter" does not mean
1306           "completely silent", though.
1307         - Build HashCons library as part of smlnj-lib.
1308    
1309    2. A new scheme for assigning persistent identifiers to compilation
1310       units (and, by extension, to types etc.) has been put into place.
1311       This fixes a long-standing bug where types and even dynamic values
1312       can get internally confused, thereby compromising type safety
1313       (abstraction) and dynamic correctness.  See
1314    
1315         http://cm.bell-labs.com/cm/cs/who/blume/pid-confusion.tgz
1316    
1317       for an example of how things could go wrong until now.
1318    
1319       The downside of the new scheme is that pids are not quite as
1320       persistent as they used to be: CM will generate a fresh pid
1321       for every compilation unit that it thinks it sees for the first
1322       time.  That means that if you compile starting from a clean, fresh
1323       source tree at two different times, you end up with different
1324       binaries.
1325    
1326       Cutoff recompilation, however, has not been compromised because
1327       CM keeps pid information in special caches between runs.
1328    
1329    ----------------------------------------------------------------------
1330    Name: Lal George
1331    Date: 2002/02/07 15:34:13 EST 2002
1332    Tag: <none>
1333    Description:
1334    
1335    Compilers that generate assembly code may produce  global labels
1336    whose value is resolved at link time. The various peephole optimization
1337    modules did not take this in account.
1338    
1339    TODO. The Labels.addrOf function should really return an option
1340    type so that clients are forced to deal with this issue, rather
1341    than an exception being raised.
1342    
1343    ----------------------------------------------------------------------
1344    Name: Lal George
1345    Date: 2002/02/06 13:55:02 EST
1346    Tag: george-20020206-ra-breakup
1347    Description:
1348    
1349    1. A bug fix from Allen.
1350    
1351        A typo causes extra fstp %st(0)'s to be generated at compensation
1352        edges, which might cause stack underflow traps at runtime.  This
1353        occurs in fft where there are extraneous fstps right before the 'into'
1354        trap instruction (in this case they are harmless since none of the
1355        integers overflow.)
1356    
1357    2. Pulled out various utility modules that were embedded in the modules
1358       of the register allocator. I need these modules for other purposes, but
1359       they are not complete enough to put into a library (just yet).
1360    ----------------------------------------------------------------------
1361    Name: Matthias Blume
1362    Date: 2002/01/31 16:05:00 EST
1363    Tag: blume-20020131-sparc-ccalls
1364    Description:
1365    
1366    1. C-calls on Sparc needlessly allocated a huge chunk (96 bytes)
1367       of extra stack space by mistake.  Fixed.
1368    
1369    2. Bug in logic of handling of command-line options in ml-nlffigen fixed.
1370    
1371    ----------------------------------------------------------------------
1372    Name: Allen Leung
1373    Date: 2002/01/30
1374    Tag: leunga-20020130-nowhere-bug-fix
1375    Description:
1376    
1377       MLRISC bug fixes:
1378       1. Fixed a bindings computation bug in the 'nowhere' program generator tool.
1379       2. MachineInt.fromString was negating its value.
1380    
1381    ----------------------------------------------------------------------
1382    Name: Matthias Blume
1383    Date: 2002/01/29
1384    Tag: blume-20020129-INSTALL
1385    Description:
1386    
1387    - Added somewhat detailed installation instructions (file INSTALL).
1388    - Fixed curl-detection bug in config/install.sh.
1389    - It is now possible to select the URL getter using the URLGETTER
1390      environment variable:
1391    
1392          not set / "unknown"      --> automatic detection (script tries wget,
1393                                       curl, and lynx)
1394          "wget" / "curl" / "lynx" --> use the specified program (script "knows"
1395                                       how to properly invoke them)
1396          other                    --> use $URLGETTER directly, it must take
1397                                       precisely two command-line arguments
1398                                       (source URL and destination file name)
1399    
1400    ----------------------------------------------------------------------
1401    Name: Matthias Blume
1402    Date: 2002/01/28
1403    Tag: blume-20020128-sparc-ccalls
1404    Description:
1405    
1406    - Fixed problem with calculation of "used" registers in sparc-c-calls.
1407    - Make use of the allocParam argument in sparc-c-calls.
1408    
1409    ----------------------------------------------------------------------
1410    Name: Matthias Blume
1411    Date: 2002/01/28
1412    Tag: blume-20020128-allocParam
1413    Description:
1414    
1415    John Reppy:  Changes c-calls API to accept client-callback for
1416    allocating extra stack space.
1417    me: Corresponding changes to mlriscGen (using a dummy argument that
1418        does not change the current behavior).
1419    
1420    ----------------------------------------------------------------------
1421    Name: Matthias Blume
1422    Date: 2002/01/28 12:00:00
1423    Tag: Release_110_38
1424    Description:
1425    
1426    This time for real!!!
1427    
1428    ----------------------------------------------------------------------
1429    Name: Matthias Blume
1430    Date: 2002/01/28 10:56:00 EST
1431    Tag: blume-20020128-retraction
1432    Description:
1433    
1434    0. Retracted earlier 110.38.  (The Release_110_38 tag has been replaced
1435       with blume-Release_110_38-retracted.)
1436    
1437    1. Fixed a problem with incorrect rounding modes in real64.sml.
1438       (Thanks to Andrew Mccreight <andrew.mccreight@yale.edu>.)
1439    
1440    2. A bug in ml-nlffigen related to the handling of unnamed structs, unions,
1441       and enums fixed.  The naming of corresponding ML identifiers should
1442       now be consistent again.
1443    
1444    ----------------------------------------------------------------------
1445    Name: Allen Leung
1446    Date: 2002/01/27
1447    Tag: leunga-20020127-nowhere
1448    Description:
1449    
1450       Added a target called nowhere in the configuration scripts.
1451       Enabling this will build the MLRISC 'nowhere' tool (for translating
1452       programs with where-clauses into legal SML code) during installation.
1453    
1454    ----------------------------------------------------------------------
1455    Name: Matthias Blume
1456    Date: 2002/01/25 21:27:00 EST
1457    Tag: blume-Release_110_38-retracted
1458    Description:
1459    
1460    Call it a (working) release!  Version is 110.38. Bootfiles are ready.
1461    
1462    README will be added later.
1463    
1464    !!! NOTE:  Re-tagged as blume-Release_110_38-retracted. Original tag
1465    (Release_110_38) removed.  Reason: Last-minute bug fixes.
1466    
1467    ----------------------------------------------------------------------
1468    Name: Matthias Blume
1469    Date: 2002/01/25
1470    Tag: blume-20020125-ffi
1471    Description:
1472    
1473    A large number of tweaks and improvements to ml-nlffi-lib and
1474    ml-nlffigen:
1475    
1476       - ML represenation types have been streamlined
1477       - getter and setter functions work with concrete values, not abstract
1478         ones where possible
1479       - ml-nlffigen command line more flexible (see README file there)
1480       - some bugs have been fixed (hopefully)
1481    
1482    ----------------------------------------------------------------------
1483    Name: Lal George
1484    Date: 2002/01/24
1485    Tag: george-20020124-risc-ra-interface
1486    Description:
1487    
1488       There is a dramatic simplification in the interface to the
1489       register allocator for RISC architectures as a result of making
1490       parallel copy instructions explicit.
1491    
1492    ----------------------------------------------------------------------
1493    Name: Matthias Blume
1494    Date: 2002/01/22
1495    Tag: blume-20020122-x86-ccalls
1496    Description:
1497    
1498    Bug fix for c-calls on x86 (having to do with how char- and
1499    short-arguments are being handled).
1500    
1501    ----------------------------------------------------------------------
1502    Name: Matthias Blume
1503    Date: 2002/01/21
1504    Tag: blume-20020121-ff
1505    Description:
1506    
1507    Another day of fiddling with the FFI...
1508    
1509    1. Bug fix/workaround:  CKIT does not complain about negative array
1510       dimensions, so ml-nlffigen has to guard itself against this possibility.
1511       (Otherwise a negative dimension would send it into an infinite loop.)
1512    
1513    2. Some of the abstract types (light objects, light pointers, most "base"
1514       types) in structure C are now eqtypes.
1515    
1516    3. Added constructors and test functions for NULL function pointers.
1517    
1518    ----------------------------------------------------------------------
1519    Name: Matthias Blume
1520    Date: 2002/01/18
1521    Tag: blume-20020118-ready-for-new-release
1522    Description:
1523    
1524    Made config/srcarchiveurl point to a new place.  (Will provide boot
1525    files shortly.)
1526    
1527    Maybe we christen this to be 110.38?
1528    
1529    ----------------------------------------------------------------------
1530    Name: Matthias Blume
1531    Date: 2002/01/18
1532    Tag: blume-20020118-more-ffifiddle
1533    Description:
1534    
1535    Today's FFI fiddling:
1536    
1537      - Provided a structure CGetSet with "convenient" versions of C.Get.* and
1538        C.Set.* that use concrete (MLRep.*) arguments and results instead
1539        of abstract ones.
1540    
1541      - Provided word-style bit operations etc. for "int" representation
1542        types in MLRep.S<Foo>Bitops where <Foo> ranges over Char, Int, Short,
1543        and Long.
1544    
1545    ----------------------------------------------------------------------
1546    Name: Matthias Blume
1547    Date: 2002/01/18
1548    Tag: blume-20020118-use-x86-fp
1549    Description:
1550    
1551    Now that x86-fast-fp seems to be working, I turned it back on again
1552    by default.  (Seems to work fine now, even with the FFI.)
1553    
1554    Other than that, I added some documentation about the FFI to
1555    src/ml-nlffigen/README and updated the FFI test examples in
1556    src/ml-nlffi-lib/Tests/*.
1557    
1558    ----------------------------------------------------------------------
1559    Name: Allen Leung
1560    Date: 2002/01/17
1561    Tag: leunga-20020117-x86-fast-fp-call
1562    Description:
1563    
1564       1. Fixed a problem with handling return fp values when x86's fast fp
1565          mode is turned on.
1566    
1567       2. Minor pretty printing fix for cellset.  Print %st(0) as %st(0) instead
1568          of %f32.
1569    
1570       3. Added a constructor INT32lit to the ast of MLRISC tools.
1571    
1572    ----------------------------------------------------------------------
1573    Name: Matthias Blume
1574    Date: 2002/01/16
1575    Tag: blume-20020116-ffifiddle
1576    Description:
1577    
1578    More fiddling with the FFI interface:
1579    
1580     - Make constness 'c instead of rw wherever possible.  This eliminates
1581       the need for certain explicit coercions.  (However, due to ML's
1582       value polymorphism, there will still be many cases where explicit
1583       coercions are necessary.  Phantom types are not the whole answer
1584       to modeling a subtyping relationship in ML.)
1585    
1586     - ro/rw coersions for pointers added.  (Avoids the detour through */&.)
1587    
1588     - "printf" test example added to src/ml-nlffi-lib/Tests.  (Demonstrates
1589       clumsy workaround for varargs problem.)
1590    
1591    ----------------------------------------------------------------------
1592    Name: Lal George
1593    Date: 2002/01/15
1594    Tag: <none>
1595    Description:
1596    
1597    1. Since COPY instructions are no longer native to the architecture,
1598       a generic functor can be used to implement the expandCopies function.
1599    
1600    2. Allowed EXPORT and IMPORT pseudo-op declarations to appear inside a
1601       TEXT segment.
1602    
1603    ----------------------------------------------------------------------
1604    Name: Matthias Blume
1605    Date: 2002/01/15
1606    Tag: blume-20020115-ffiupdates
1607    Description:
1608    
1609    1. Fix for bug resulting in single-precision float values being returned
1610       incorrectly from FFI calls.
1611    
1612    2. Small modifications to C FFI API:
1613    
1614        - memory-allocation routines return straight objects (no options)
1615          and raise an exception in out-of-memory situations
1616        - unsafe extensions to cast between function pointers and pointers
1617          from/to ints
1618        - added structure C_Debug as an alternative to structure C where
1619          pointer-dereferencing (|*| and |*!) always check for null-pointers
1620        - added open_lib' to DynLinkage;  open_lib' works like open_lib
1621          but also takes a (possibly empty) list of existing library handles
1622          that the current library depends on
1623    
1624    ----------------------------------------------------------------------
1625    Name: Matthias Blume
1626    Date: 2002/01/10
1627    Tag: blume-20020110-newffigen
1628    Description:
1629    
1630    1. Updates to portable graph code.
1631    
1632    2. Major update to ml-nlffigen and ml-nlffi-lib.  Things are much
1633       more scalable now so that even huge interfaces such as the one
1634       for GTK compile in finite time and space. :-)
1635       See src/ml-nlffigen/README for details on what's new.
1636    
1637    ----------------------------------------------------------------------
1638    Name: Lal George
1639    Date: 2001/01/09 14:31:35 EST 2002
1640    Tag: george-20011206-rm-native-copy
1641    Description:
1642    
1643            Removed the native COPY and FCOPY instructions
1644            from all the architectures and replaced it with the
1645            explicit COPY instruction from the previous commit.
1646    
1647            It is now possible to simplify many of the optimizations
1648            modules that manipulate copies. This has not been
1649            done in this change.
1650    
1651    ----------------------------------------------------------------------
1652    Name: Lal George
1653    Date: 2001/12/06 16:50:13 EST 2001
1654    Tag: george-20011206-mlrisc-instruction
1655    Description:
1656    
1657    Changed the representation of instructions from being fully abstract
1658    to being partially concrete. That is to say:
1659    
1660      from
1661            type instruction
1662    
1663      to
1664            type instr                              (* machine instruction *)
1665    
1666            datatype instruction =
1667                LIVE of {regs: C.cellset, spilled: C.cellset}
1668              | KILL of {regs: C.cellset, spilled: C.cellset}
1669              | COPYXXX of {k: CB.cellkind, dst: CB.cell list, src: CB.cell list}
1670              | ANNOTATION of {i: instruction, a: Annotations.annotation}
1671              | INSTR of instr
1672    
1673    This makes the handling of certain special instructions that appear on
1674    all architectures easier and uniform.
1675    
1676    LIVE and KILL say that a list of registers are live or killed at the
1677    program point where they appear. No spill code is generated when an
1678    element of the 'regs' field is spilled, but the register is moved to
1679    the 'spilled' (which is present, more for debugging than anything else).
1680    
1681    LIVE replaces the (now deprecated) DEFFREG instruction on the alpha.
1682    We used to generate:
1683    
1684            DEFFREG f1
1685            f1 := f2 + f3
1686            trapb
1687    
1688    but now generate:
1689    
1690            f1 := f2 + f3
1691            trapb
1692            LIVE {regs=[f1,f2,f3], spilled=[]}
1693    
1694    Furthermore, the DEFFREG (hack) required that all floating point instruction
1695    use all registers mentioned in the instruction. Therefore f1 := f2 + f3,
1696    defines f1 and uses [f1,f2,f3]! This hack is no longer required resulting
1697    in a cleaner alpha implementation. (Hopefully, intel will not get rid of
1698    this architecture).
1699    
1700    COPYXXX is intended to replace the parallel COPY and FCOPY  available on
1701    all the architectures. This will result in further simplification of the
1702    register allocator that must be aware of them for coalescing purposes, and
1703    will also simplify certain aspects of the machine description that provides
1704    callbacks related to parallel copies.
1705    
1706    ANNOTATION should be obvious, and now INSTR represents the honest to God
1707    machine instruction set!
1708    
1709    The <arch>/instructions/<arch>Instr.sml files define certain utility
1710    functions for making porting easier -- essentially converting upper case
1711    to lower case. All machine instructions (of type instr) are in upper case,
1712    and the lower case form generates an MLRISC instruction. For example on
1713    the alpha we have:
1714    
1715      datatype instr =
1716         LDA of {r:cell, b:cell, d:operand}
1717       | ...
1718    
1719      val lda : {r:cell, b:cell, d:operand} -> instruction
1720        ...
1721    
1722    where lda is just (INSTR o LDA), etc.
1723    
1724    ----------------------------------------------------------------------
1725    Name: Matthias Blume
1726    Date: 2001/11/22 21:40:00 EST
1727    Tag: Release_110_37
1728    Description:
1729    
1730    Release 110.37.  This time for real.
1731    
1732    ----------------------------------------------------------------------
1733    Name: Matthias Blume
1734    Date: 2001/11/21 16:35:00 EST
1735    Tag: blume-20011121-foot-in-mouth
1736    Description:
1737    
1738    Removed the "Release_110_37" tag because of a serious bug.
1739    This will be re-tagged once the bug is fixed.
1740    
1741    ----------------------------------------------------------------------
1742    Name: Matthias Blume
1743    Date: 2001/11/21 16:14:00 EST
1744    Tag: blume-20011121-forgottenfile
1745    Description:
1746    
1747    Forgot to add a file.  (Just a .tex-file -- part of
1748    the CM manual source.)
1749    
1750    ----------------------------------------------------------------------
1751    Name: Matthias Blume
1752    Date: 2001/11/21 16:10:00 EST
1753    Tag: blume-20011121-invalid_110_37
1754    Description:
1755    
1756    Note: I removed the original tag "Release_110_37" from this commit
1757          because we found a serious bug in all non-x86 backends.
1758          - Matthias
1759    
1760    1. Modifications to the SML/NJ code generator and to the runtime system
1761       so that code object name strings are directly inserted into code
1762       objects at code generation time.  The only business the runtime system
1763       has with this is now to read the name strings on occasions.
1764       (The encoding of the name string has also changed somewhat.)
1765    
1766    2. CM now implements a simple "set calculus" for specifying export lists.
1767       In particular, it is now possible to refer to the export lists of
1768       other libraries/groups/sources and form unions as well as differences.
1769       See the latest CM manual for details.
1770    
1771    3. An separate notion of "proxy" libraries has again be eliminated from
1772       CM's model.  (Proxy libraries are now simply a special case of using
1773       the export list calculus.)
1774    
1775    4. Some of the existing libraries now take advantage of the new set
1776       calculus.
1777       (Notice that not all libraries have been converted because some
1778       of the existing .cm-files are supposed to be backward compatible
1779       with 110.0.x.)
1780    
1781    5. Some cleanup in stand-alone programs.  (Don't use "exnMessage" -- use
1782       "General.exnMessage"!  The former relies on a certain hook to be
1783       initialized, and that often does not happen in the stand-alone case.)
1784    
1785    ----------------------------------------------------------------------
1786    Name: Lal George
1787    Date: 2001/11/21  13:56:18 EST
1788    Tag: george-2001121-pseudo-ops
1789    Description:
1790    
1791      Implemented a complete redesign of MLRISC pseudo-ops. Now there
1792      ought to never be any question of incompatabilities with
1793      pseudo-op syntax expected by host assemblers.
1794    
1795      For now, only modules supporting GAS syntax are implemented
1796      but more should follow, such as MASM, and vendor assembler
1797      syntax, e.g. IBM as, Sun as, etc.
1798    
1799    ----------------------------------------------------------------------
1800    Name: Matthias Blume
1801    Date: 2001/11/14 11:52:00 EST
1802    Tag: blume-20011114-srcname
1803    Description:
1804    
1805    1. Routed the name of the current source file to mlriscgen where it
1806       should be directly emitted into the code object.  (This last part
1807       is yet to be done.)
1808    
1809    2. Some cleanup of the pgraph code to make it match the proposal that
1810       I put out the other day.  (The proposal notwithstanding, things are
1811       still in flux here.)
1812    
1813    ----------------------------------------------------------------------
1814    Name: Lal George
1815    Date: 2001/11/14 09:44:04 EST
1816    Tag:
1817    Description:
1818    
1819      Fix for a backpatching bug reported by Allen.
1820    
1821      Because the boundary between short and long span-dependent
1822      instructions is +/- 128, there are an astounding number of
1823      span-dependent instructions whose size is over estimated.
1824    
1825      Allen came up with the idea of letting the size of span
1826      dependent instructions be non-monotonic, for a maxIter
1827      number of times, after which the size must be monotonically
1828      increasing.
1829    
1830      This table shows the number of span-dependent instructions
1831      whose size was over-estimated as a function of maxIter, for the
1832      file Parse/parse/ml.grm.sml:
1833    
1834         maxIter            # of instructions:
1835            10                      687
1836            20                      438
1837            30                      198
1838            40                        0
1839    
1840      In compiling the compiler, there is no significant difference in
1841      compilation speed between maxIter=10 and maxIter=40. Actually,
1842      my measurements showed that maxIter=40 was a tad faster than
1843      maxIter=10! Also 96% of the  files in the compiler reach a fix
1844      point within 13 iterations, so fixing maxIter at 40, while high,
1845      is okay.
1846    
1847    ----------------------------------------------------------------------
1848    Name: Matthias Blume
1849    Date: 2001/10/31 15:25:00 EST
1850    Tag: blume-20011031-pgraph
1851    Description:
1852    
1853    CKIT:
1854    * Changed the "Function" constructor of type Ast.ctype to carry optional
1855      argument identifiers.
1856    * Changed the return type of TypeUtil.getFunction accordingly.
1857    * Type equality ignores the argument names.
1858    * TypeUtil.composite tries to preserve argument names but gives up quickly
1859      if there is a mismatch.
1860    
1861    installation script:
1862    * attempts to use "curl" if available (unless "wget" is available as well)
1863    
1864    CM:
1865    * has an experimental implementation of "portable graphs" which I will
1866      soon propose as an implementation-independent library format
1867    * there are also new libraries $/pgraph.cm and $/pgraph-util.cm
1868    
1869    NLFFI-LIB:
1870    * some cleanup (all cosmetic)
1871    
1872    NLFFIGEN:
1873    * temporarily disabled the mechanism that suppresses ML output for
1874      C definitions whose identifiers start with an underscore character
1875    * generate val bindings for enum constants
1876    * user can request that only one style (light or heavy) is being used;
1877      default is to use both (command-line arguments: -heavy and -light)
1878    * fixed bug in handling of function types involving incomplete pointers
1879    * generate ML entry points that take record arguments (i.e., using
1880      named arguments) for C functions that have a prototype with named
1881      arguments
1882      (see changes to CKIT)
1883    
1884    ----------------------------------------------------------------------
1885    Name: Allen Leung
1886    Date: 2001/10/27 20:34:00 EDT
1887    Tag: leunga-20011027-x86-fast-fp-call
1888    Description:
1889    
1890       Fixed the bug described in blume-20010920-slowfp.
1891    
1892       The fix involves
1893          1. generating FCOPYs in FSTP in ia32-svid
1894          2. marking a CALL with the appropriate annotation
1895    
1896    ----------------------------------------------------------------------
1897    Name: Matthias Blume
1898    Date: 2001/10/16 11:32:00 EDT
1899    Tag: blume-20011016-netbsd
1900    Description:
1901    
1902    Underscore patch from Chris Richards (fixing problem with compiling
1903    runtime system under recent NetBSD).
1904    
1905    ----------------------------------------------------------------------
1906    Name: Allen Leung
1907    Date: 2001/10/12 17:18:32 EDT 2001
1908    Tag: leung-20011012-x86-printflowgraph
1909    Description:
1910    
1911    X86RA now uses a valid (instead of dummy) PrintFlowgraph module.
1912    
1913    ----------------------------------------------------------------------
1914    Name: Lal George
1915    Date: 2001/10/11 23:51:34 EDT
1916    Tag: george-20011011-too-many-instrs
1917    Description:
1918    
1919    The representation of a program point never expected to see more
1920    than 65536 instructions in a basic block!
1921    
1922    ----------------------------------------------------------------------
1923    Name: Lal George
1924    Date: 2001/10/09 09:41:37 EDT
1925    Tag: george-20011008-mlrisc-labels
1926    Description:
1927    
1928    Changed the machine description files to support printing of
1929    local and global labels in assembly code, based on host assembler
1930    conventions.
1931    
1932    ----------------------------------------------------------------------
1933    Name: Matthias Blume
1934    Date: 2001/09/25 15:25:00 EDT
1935    Tag: blume-20010925-exninfo
1936    Description:
1937    
1938    I provided a non-hook implementation of exnName (at the toplevel) and
1939    made the "dummy" implementation of exnMessage (at the toplevel) more
1940    useful: if nothing gets "hooked in", then at least you are going to
1941    see the exception name and a message indicating why you don't see more.
1942    
1943    [For the time being, programs that need exnMessage and want to use
1944    ml-build should either use General.exnMessage (strongly recommended) or
1945    refer to structure General at some other point so that CM sees a
1946    static dependency.]
1947    
1948    [Similar remarks go for "print" and "use":  If you want to use their
1949    functionality in stand-alone programs generated by ml-build, then use
1950    TextIO.output and Backend.Interact.useFile (from $smlnj/compiler.cm).]
1951    
1952    ----------------------------------------------------------------------
1953    Name: Matthias Blume
1954    Date: 2001/09/20 17:28:00 EDT
1955    Tag: blume-20010920-slowfp
1956    Description:
1957    
1958    Allen says that x86-fast-fp is not safe yet, so I turned it off again...
1959    
1960    ----------------------------------------------------------------------
1961    Name: Matthias Blume
1962  Date: 2001/09/20 17:20:00 EDT  Date: 2001/09/20 17:20:00 EDT
1963  Tag: blume-20010920-canonicalpaths  Tag: blume-20010920-canonicalpaths
1964  Description:  Description:

Legend:
Removed from v.937  
changed lines
  Added in v.1190

root@smlnj-gforge.cs.uchicago.edu
ViewVC Help
Powered by ViewVC 1.0.0